database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-11-10 17:42:29 +03:00
Code Activity

Another pgindent run with updated typedefs.

Browse Source
This commit is contained in:
Bruce Momjian
2003-08-08 21:42:59 +00:00
parent 0e2b12bd96
commit 46785776c4
109 changed files with 811 additions and 808 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
src/backend/nodes/bitmapset.c
View File

@@ -14,7 +14,7 @@
* Copyright (c) 2003, PostgreSQL Global Development Group
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/bitmapset.c,v 1.4 2003/08/04 00:43:18 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/bitmapset.c,v 1.5 2003/08/08 21:41:43 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -107,7 +107,7 @@ static const uint8 number_of_ones[256] = {
* bms_copy - make a palloc'd copy of a bitmapset
*/
Bitmapset *
bms_copy(const Bitmapset * a)
bms_copy(const Bitmapset *a)
{
Bitmapset *result;
size_t size;
@@ -127,7 +127,7 @@ bms_copy(const Bitmapset * a)
* be reported as equal to a palloc'd value containing no members.
*/
bool
bms_equal(const Bitmapset * a, const Bitmapset * b)
bms_equal(const Bitmapset *a, const Bitmapset *b)
{
const Bitmapset *shorter;
const Bitmapset *longer;
@@ -197,7 +197,7 @@ bms_make_singleton(int x)
* Same as pfree except for allowing NULL input
*/
void
bms_free(Bitmapset * a)
bms_free(Bitmapset *a)
{
if (a)
pfree(a);
@@ -214,7 +214,7 @@ bms_free(Bitmapset * a)
* bms_union - set union
*/
Bitmapset *
bms_union(const Bitmapset * a, const Bitmapset * b)
bms_union(const Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
const Bitmapset *other;
@@ -248,7 +248,7 @@ bms_union(const Bitmapset * a, const Bitmapset * b)
* bms_intersect - set intersection
*/
Bitmapset *
bms_intersect(const Bitmapset * a, const Bitmapset * b)
bms_intersect(const Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
const Bitmapset *other;
@@ -280,7 +280,7 @@ bms_intersect(const Bitmapset * a, const Bitmapset * b)
* bms_difference - set difference (ie, A without members of B)
*/
Bitmapset *
bms_difference(const Bitmapset * a, const Bitmapset * b)
bms_difference(const Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
int shortlen;
@@ -304,7 +304,7 @@ bms_difference(const Bitmapset * a, const Bitmapset * b)
* bms_is_subset - is A a subset of B?
*/
bool
bms_is_subset(const Bitmapset * a, const Bitmapset * b)
bms_is_subset(const Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int longlen;
@@ -339,7 +339,7 @@ bms_is_subset(const Bitmapset * a, const Bitmapset * b)
* bms_is_member - is X a member of A?
*/
bool
bms_is_member(int x, const Bitmapset * a)
bms_is_member(int x, const Bitmapset *a)
{
int wordnum,
bitnum;
@@ -362,7 +362,7 @@ bms_is_member(int x, const Bitmapset * a)
* bms_overlap - do sets overlap (ie, have a nonempty intersection)?
*/
bool
bms_overlap(const Bitmapset * a, const Bitmapset * b)
bms_overlap(const Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@@ -384,7 +384,7 @@ bms_overlap(const Bitmapset * a, const Bitmapset * b)
* bms_nonempty_difference - do sets have a nonempty difference?
*/
bool
bms_nonempty_difference(const Bitmapset * a, const Bitmapset * b)
bms_nonempty_difference(const Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@@ -416,7 +416,7 @@ bms_nonempty_difference(const Bitmapset * a, const Bitmapset * b)
* Raises error if |a| is not 1.
*/
int
bms_singleton_member(const Bitmapset * a)
bms_singleton_member(const Bitmapset *a)
{
int result = -1;
int nwords;
@@ -451,7 +451,7 @@ bms_singleton_member(const Bitmapset * a)
* bms_num_members - count members of set
*/
int
bms_num_members(const Bitmapset * a)
bms_num_members(const Bitmapset *a)
{
int result = 0;
int nwords;
@@ -480,7 +480,7 @@ bms_num_members(const Bitmapset * a)
* This is faster than making an exact count with bms_num_members().
*/
BMS_Membership
bms_membership(const Bitmapset * a)
bms_membership(const Bitmapset *a)
{
BMS_Membership result = BMS_EMPTY_SET;
int nwords;
@@ -509,7 +509,7 @@ bms_membership(const Bitmapset * a)
* This is even faster than bms_membership().
*/
bool
bms_is_empty(const Bitmapset * a)
bms_is_empty(const Bitmapset *a)
{
int nwords;
int wordnum;
@@ -544,7 +544,7 @@ bms_is_empty(const Bitmapset * a)
* Input set is modified or recycled!
*/
Bitmapset *
bms_add_member(Bitmapset * a, int x)
bms_add_member(Bitmapset *a, int x)
{
int wordnum,
bitnum;
@@ -582,7 +582,7 @@ bms_add_member(Bitmapset * a, int x)
* Input set is modified in-place!
*/
Bitmapset *
bms_del_member(Bitmapset * a, int x)
bms_del_member(Bitmapset *a, int x)
{
int wordnum,
bitnum;
@@ -602,7 +602,7 @@ bms_del_member(Bitmapset * a, int x)
* bms_add_members - like bms_union, but left input is recycled
*/
Bitmapset *
bms_add_members(Bitmapset * a, const Bitmapset * b)
bms_add_members(Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
const Bitmapset *other;
@@ -638,7 +638,7 @@ bms_add_members(Bitmapset * a, const Bitmapset * b)
* bms_int_members - like bms_intersect, but left input is recycled
*/
Bitmapset *
bms_int_members(Bitmapset * a, const Bitmapset * b)
bms_int_members(Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@@ -664,7 +664,7 @@ bms_int_members(Bitmapset * a, const Bitmapset * b)
* bms_del_members - like bms_difference, but left input is recycled
*/
Bitmapset *
bms_del_members(Bitmapset * a, const Bitmapset * b)
bms_del_members(Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@@ -685,7 +685,7 @@ bms_del_members(Bitmapset * a, const Bitmapset * b)
* bms_join - like bms_union, but *both* inputs are recycled
*/
Bitmapset *
bms_join(Bitmapset * a, Bitmapset * b)
bms_join(Bitmapset *a, Bitmapset *b)
{
Bitmapset *result;
Bitmapset *other;
@@ -732,7 +732,7 @@ bms_join(Bitmapset * a, Bitmapset * b)
*----------
*/
int
bms_first_member(Bitmapset * a)
bms_first_member(Bitmapset *a)
{
int nwords;
int wordnum;

34
src/backend/nodes/copyfuncs.c
View File

@@ -15,7 +15,7 @@
* Portions Copyright (c) 1994, Regents of the University of California
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.262 2003/08/04 02:39:59 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.263 2003/08/08 21:41:43 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -755,7 +755,7 @@ _copyArrayRef(ArrayRef *from)
* _copyFuncExpr
*/
static FuncExpr *
_copyFuncExpr(FuncExpr * from)
_copyFuncExpr(FuncExpr *from)
{
FuncExpr *newnode = makeNode(FuncExpr);
@@ -772,7 +772,7 @@ _copyFuncExpr(FuncExpr * from)
* _copyOpExpr
*/
static OpExpr *
_copyOpExpr(OpExpr * from)
_copyOpExpr(OpExpr *from)
{
OpExpr *newnode = makeNode(OpExpr);
@@ -789,7 +789,7 @@ _copyOpExpr(OpExpr * from)
* _copyDistinctExpr (same as OpExpr)
*/
static DistinctExpr *
_copyDistinctExpr(DistinctExpr * from)
_copyDistinctExpr(DistinctExpr *from)
{
DistinctExpr *newnode = makeNode(DistinctExpr);
@@ -806,7 +806,7 @@ _copyDistinctExpr(DistinctExpr * from)
* _copyScalarArrayOpExpr
*/
static ScalarArrayOpExpr *
_copyScalarArrayOpExpr(ScalarArrayOpExpr * from)
_copyScalarArrayOpExpr(ScalarArrayOpExpr *from)
{
ScalarArrayOpExpr *newnode = makeNode(ScalarArrayOpExpr);
@@ -822,7 +822,7 @@ _copyScalarArrayOpExpr(ScalarArrayOpExpr * from)
* _copyBoolExpr
*/
static BoolExpr *
_copyBoolExpr(BoolExpr * from)
_copyBoolExpr(BoolExpr *from)
{
BoolExpr *newnode = makeNode(BoolExpr);
@@ -940,7 +940,7 @@ _copyCaseWhen(CaseWhen *from)
* _copyArrayExpr
*/
static ArrayExpr *
_copyArrayExpr(ArrayExpr * from)
_copyArrayExpr(ArrayExpr *from)
{
ArrayExpr *newnode = makeNode(ArrayExpr);
@@ -956,7 +956,7 @@ _copyArrayExpr(ArrayExpr * from)
* _copyCoalesceExpr
*/
static CoalesceExpr *
_copyCoalesceExpr(CoalesceExpr * from)
_copyCoalesceExpr(CoalesceExpr *from)
{
CoalesceExpr *newnode = makeNode(CoalesceExpr);
@@ -970,7 +970,7 @@ _copyCoalesceExpr(CoalesceExpr * from)
* _copyNullIfExpr (same as OpExpr)
*/
static NullIfExpr *
_copyNullIfExpr(NullIfExpr * from)
_copyNullIfExpr(NullIfExpr *from)
{
NullIfExpr *newnode = makeNode(NullIfExpr);
@@ -1015,7 +1015,7 @@ _copyBooleanTest(BooleanTest *from)
* _copyCoerceToDomain
*/
static CoerceToDomain *
_copyCoerceToDomain(CoerceToDomain * from)
_copyCoerceToDomain(CoerceToDomain *from)
{
CoerceToDomain *newnode = makeNode(CoerceToDomain);
@@ -1031,7 +1031,7 @@ _copyCoerceToDomain(CoerceToDomain * from)
* _copyCoerceToDomainValue
*/
static CoerceToDomainValue *
_copyCoerceToDomainValue(CoerceToDomainValue * from)
_copyCoerceToDomainValue(CoerceToDomainValue *from)
{
CoerceToDomainValue *newnode = makeNode(CoerceToDomainValue);
@@ -1045,7 +1045,7 @@ _copyCoerceToDomainValue(CoerceToDomainValue * from)
* _copySetToDefault
*/
static SetToDefault *
_copySetToDefault(SetToDefault * from)
_copySetToDefault(SetToDefault *from)
{
SetToDefault *newnode = makeNode(SetToDefault);
@@ -1191,7 +1191,7 @@ _copyJoinInfo(JoinInfo *from)
* _copyInClauseInfo
*/
static InClauseInfo *
_copyInClauseInfo(InClauseInfo * from)
_copyInClauseInfo(InClauseInfo *from)
{
InClauseInfo *newnode = makeNode(InClauseInfo);
@@ -1633,7 +1633,7 @@ _copyAlterTableStmt(AlterTableStmt *from)
}
static AlterDomainStmt *
_copyAlterDomainStmt(AlterDomainStmt * from)
_copyAlterDomainStmt(AlterDomainStmt *from)
{
AlterDomainStmt *newnode = makeNode(AlterDomainStmt);
@@ -1685,7 +1685,7 @@ _copyFuncWithArgs(FuncWithArgs *from)
}
static DeclareCursorStmt *
_copyDeclareCursorStmt(DeclareCursorStmt * from)
_copyDeclareCursorStmt(DeclareCursorStmt *from)
{
DeclareCursorStmt *newnode = makeNode(DeclareCursorStmt);
@@ -1747,7 +1747,7 @@ _copyCreateStmt(CreateStmt *from)
}
static InhRelation *
_copyInhRelation(InhRelation * from)
_copyInhRelation(InhRelation *from)
{
InhRelation *newnode = makeNode(InhRelation);
@@ -2118,7 +2118,7 @@ _copyCreateSeqStmt(CreateSeqStmt *from)
}
static AlterSeqStmt *
_copyAlterSeqStmt(AlterSeqStmt * from)
_copyAlterSeqStmt(AlterSeqStmt *from)
{
AlterSeqStmt *newnode = makeNode(AlterSeqStmt);

34
src/backend/nodes/equalfuncs.c
View File

@@ -18,7 +18,7 @@
* Portions Copyright (c) 1994, Regents of the University of California
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.206 2003/08/04 02:39:59 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.207 2003/08/08 21:41:43 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -224,7 +224,7 @@ _equalArrayRef(ArrayRef *a, ArrayRef *b)
}
static bool
_equalFuncExpr(FuncExpr * a, FuncExpr * b)
_equalFuncExpr(FuncExpr *a, FuncExpr *b)
{
COMPARE_SCALAR_FIELD(funcid);
COMPARE_SCALAR_FIELD(funcresulttype);
@@ -245,7 +245,7 @@ _equalFuncExpr(FuncExpr * a, FuncExpr * b)
}
static bool
_equalOpExpr(OpExpr * a, OpExpr * b)
_equalOpExpr(OpExpr *a, OpExpr *b)
{
COMPARE_SCALAR_FIELD(opno);
@@ -268,7 +268,7 @@ _equalOpExpr(OpExpr * a, OpExpr * b)
}
static bool
_equalDistinctExpr(DistinctExpr * a, DistinctExpr * b)
_equalDistinctExpr(DistinctExpr *a, DistinctExpr *b)
{
COMPARE_SCALAR_FIELD(opno);
@@ -291,7 +291,7 @@ _equalDistinctExpr(DistinctExpr * a, DistinctExpr * b)
}
static bool
_equalScalarArrayOpExpr(ScalarArrayOpExpr * a, ScalarArrayOpExpr * b)
_equalScalarArrayOpExpr(ScalarArrayOpExpr *a, ScalarArrayOpExpr *b)
{
COMPARE_SCALAR_FIELD(opno);
@@ -313,7 +313,7 @@ _equalScalarArrayOpExpr(ScalarArrayOpExpr * a, ScalarArrayOpExpr * b)
}
static bool
_equalBoolExpr(BoolExpr * a, BoolExpr * b)
_equalBoolExpr(BoolExpr *a, BoolExpr *b)
{
COMPARE_SCALAR_FIELD(boolop);
COMPARE_NODE_FIELD(args);
@@ -404,7 +404,7 @@ _equalCaseWhen(CaseWhen *a, CaseWhen *b)
}
static bool
_equalArrayExpr(ArrayExpr * a, ArrayExpr * b)
_equalArrayExpr(ArrayExpr *a, ArrayExpr *b)
{
COMPARE_SCALAR_FIELD(array_typeid);
COMPARE_SCALAR_FIELD(element_typeid);
@@ -415,7 +415,7 @@ _equalArrayExpr(ArrayExpr * a, ArrayExpr * b)
}
static bool
_equalCoalesceExpr(CoalesceExpr * a, CoalesceExpr * b)
_equalCoalesceExpr(CoalesceExpr *a, CoalesceExpr *b)
{
COMPARE_SCALAR_FIELD(coalescetype);
COMPARE_NODE_FIELD(args);
@@ -424,7 +424,7 @@ _equalCoalesceExpr(CoalesceExpr * a, CoalesceExpr * b)
}
static bool
_equalNullIfExpr(NullIfExpr * a, NullIfExpr * b)
_equalNullIfExpr(NullIfExpr *a, NullIfExpr *b)
{
COMPARE_SCALAR_FIELD(opno);
@@ -465,7 +465,7 @@ _equalBooleanTest(BooleanTest *a, BooleanTest *b)
}
static bool
_equalCoerceToDomain(CoerceToDomain * a, CoerceToDomain * b)
_equalCoerceToDomain(CoerceToDomain *a, CoerceToDomain *b)
{
COMPARE_NODE_FIELD(arg);
COMPARE_SCALAR_FIELD(resulttype);
@@ -484,7 +484,7 @@ _equalCoerceToDomain(CoerceToDomain * a, CoerceToDomain * b)
}
static bool
_equalCoerceToDomainValue(CoerceToDomainValue * a, CoerceToDomainValue * b)
_equalCoerceToDomainValue(CoerceToDomainValue *a, CoerceToDomainValue *b)
{
COMPARE_SCALAR_FIELD(typeId);
COMPARE_SCALAR_FIELD(typeMod);
@@ -493,7 +493,7 @@ _equalCoerceToDomainValue(CoerceToDomainValue * a, CoerceToDomainValue * b)
}
static bool
_equalSetToDefault(SetToDefault * a, SetToDefault * b)
_equalSetToDefault(SetToDefault *a, SetToDefault *b)
{
COMPARE_SCALAR_FIELD(typeId);
COMPARE_SCALAR_FIELD(typeMod);
@@ -587,7 +587,7 @@ _equalJoinInfo(JoinInfo *a, JoinInfo *b)
}
static bool
_equalInClauseInfo(InClauseInfo * a, InClauseInfo * b)
_equalInClauseInfo(InClauseInfo *a, InClauseInfo *b)
{
COMPARE_BITMAPSET_FIELD(lefthand);
COMPARE_BITMAPSET_FIELD(righthand);
@@ -715,7 +715,7 @@ _equalAlterTableStmt(AlterTableStmt *a, AlterTableStmt *b)
}
static bool
_equalAlterDomainStmt(AlterDomainStmt * a, AlterDomainStmt * b)
_equalAlterDomainStmt(AlterDomainStmt *a, AlterDomainStmt *b)
{
COMPARE_SCALAR_FIELD(subtype);
COMPARE_NODE_FIELD(typename);
@@ -759,7 +759,7 @@ _equalFuncWithArgs(FuncWithArgs *a, FuncWithArgs *b)
}
static bool
_equalDeclareCursorStmt(DeclareCursorStmt * a, DeclareCursorStmt * b)
_equalDeclareCursorStmt(DeclareCursorStmt *a, DeclareCursorStmt *b)
{
COMPARE_STRING_FIELD(portalname);
COMPARE_SCALAR_FIELD(options);
@@ -811,7 +811,7 @@ _equalCreateStmt(CreateStmt *a, CreateStmt *b)
}
static bool
_equalInhRelation(InhRelation * a, InhRelation * b)
_equalInhRelation(InhRelation *a, InhRelation *b)
{
COMPARE_NODE_FIELD(relation);
COMPARE_SCALAR_FIELD(including_defaults);
@@ -1122,7 +1122,7 @@ _equalCreateSeqStmt(CreateSeqStmt *a, CreateSeqStmt *b)
}
static bool
_equalAlterSeqStmt(AlterSeqStmt * a, AlterSeqStmt * b)
_equalAlterSeqStmt(AlterSeqStmt *a, AlterSeqStmt *b)
{
COMPARE_NODE_FIELD(sequence);
COMPARE_NODE_FIELD(options);

12
src/backend/nodes/list.c
View File

@@ -9,7 +9,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/list.c,v 1.53 2003/08/04 02:39:59 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/list.c,v 1.54 2003/08/08 21:41:44 momjian Exp $
*
* NOTES
* XXX a few of the following functions are duplicated to handle
@@ -202,7 +202,7 @@ nconc(List *l1, List *l2)
* since we avoid having to chase down the list again each time.
*/
void
FastAppend(FastList * fl, void *datum)
FastAppend(FastList *fl, void *datum)
{
List *cell = makeList1(datum);
@@ -223,7 +223,7 @@ FastAppend(FastList * fl, void *datum)
* FastAppendi - same for integers
*/
void
FastAppendi(FastList * fl, int datum)
FastAppendi(FastList *fl, int datum)
{
List *cell = makeListi1(datum);
@@ -244,7 +244,7 @@ FastAppendi(FastList * fl, int datum)
* FastAppendo - same for Oids
*/
void
FastAppendo(FastList * fl, Oid datum)
FastAppendo(FastList *fl, Oid datum)
{
List *cell = makeListo1(datum);
@@ -267,7 +267,7 @@ FastAppendo(FastList * fl, Oid datum)
* Note that the cells of the second argument are absorbed into the FastList.
*/
void
FastConc(FastList * fl, List *cells)
FastConc(FastList *fl, List *cells)
{
if (cells == NIL)
return; /* nothing to do */
@@ -290,7 +290,7 @@ FastConc(FastList * fl, List *cells)
* Note that the cells of the second argument are absorbed into the first.
*/
void
FastConcFast(FastList * fl, FastList * fl2)
FastConcFast(FastList *fl, FastList *fl2)
{
if (fl2->head == NIL)
return; /* nothing to do */

36
src/backend/nodes/outfuncs.c
View File

@@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.216 2003/08/04 02:39:59 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.217 2003/08/08 21:41:44 momjian Exp $
*
* NOTES
* Every node type that can appear in stored rules' parsetrees *must*
@@ -184,7 +184,7 @@ _outOidList(StringInfo str, List *list)
* an integer List would be.
*/
static void
_outBitmapset(StringInfo str, Bitmapset * bms)
_outBitmapset(StringInfo str, Bitmapset *bms)
{
Bitmapset *tmpset;
int x;
@@ -631,7 +631,7 @@ _outArrayRef(StringInfo str, ArrayRef *node)
}
static void
_outFuncExpr(StringInfo str, FuncExpr * node)
_outFuncExpr(StringInfo str, FuncExpr *node)
{
WRITE_NODE_TYPE("FUNCEXPR");
@@ -643,7 +643,7 @@ _outFuncExpr(StringInfo str, FuncExpr * node)
}
static void
_outOpExpr(StringInfo str, OpExpr * node)
_outOpExpr(StringInfo str, OpExpr *node)
{
WRITE_NODE_TYPE("OPEXPR");
@@ -655,7 +655,7 @@ _outOpExpr(StringInfo str, OpExpr * node)
}
static void
_outDistinctExpr(StringInfo str, DistinctExpr * node)
_outDistinctExpr(StringInfo str, DistinctExpr *node)
{
WRITE_NODE_TYPE("DISTINCTEXPR");
@@ -667,7 +667,7 @@ _outDistinctExpr(StringInfo str, DistinctExpr * node)
}
static void
_outScalarArrayOpExpr(StringInfo str, ScalarArrayOpExpr * node)
_outScalarArrayOpExpr(StringInfo str, ScalarArrayOpExpr *node)
{
WRITE_NODE_TYPE("SCALARARRAYOPEXPR");
@@ -678,7 +678,7 @@ _outScalarArrayOpExpr(StringInfo str, ScalarArrayOpExpr * node)
}
static void
_outBoolExpr(StringInfo str, BoolExpr * node)
_outBoolExpr(StringInfo str, BoolExpr *node)
{
char *opstr = NULL;
@@ -778,7 +778,7 @@ _outCaseWhen(StringInfo str, CaseWhen *node)
}
static void
_outArrayExpr(StringInfo str, ArrayExpr * node)
_outArrayExpr(StringInfo str, ArrayExpr *node)
{
WRITE_NODE_TYPE("ARRAY");
@@ -789,7 +789,7 @@ _outArrayExpr(StringInfo str, ArrayExpr * node)
}
static void
_outCoalesceExpr(StringInfo str, CoalesceExpr * node)
_outCoalesceExpr(StringInfo str, CoalesceExpr *node)
{
WRITE_NODE_TYPE("COALESCE");
@@ -798,7 +798,7 @@ _outCoalesceExpr(StringInfo str, CoalesceExpr * node)
}
static void
_outNullIfExpr(StringInfo str, NullIfExpr * node)
_outNullIfExpr(StringInfo str, NullIfExpr *node)
{
WRITE_NODE_TYPE("NULLIFEXPR");
@@ -828,7 +828,7 @@ _outBooleanTest(StringInfo str, BooleanTest *node)
}
static void
_outCoerceToDomain(StringInfo str, CoerceToDomain * node)
_outCoerceToDomain(StringInfo str, CoerceToDomain *node)
{
WRITE_NODE_TYPE("COERCETODOMAIN");
@@ -839,7 +839,7 @@ _outCoerceToDomain(StringInfo str, CoerceToDomain * node)
}
static void
_outCoerceToDomainValue(StringInfo str, CoerceToDomainValue * node)
_outCoerceToDomainValue(StringInfo str, CoerceToDomainValue *node)
{
WRITE_NODE_TYPE("COERCETODOMAINVALUE");
@@ -848,7 +848,7 @@ _outCoerceToDomainValue(StringInfo str, CoerceToDomainValue * node)
}
static void
_outSetToDefault(StringInfo str, SetToDefault * node)
_outSetToDefault(StringInfo str, SetToDefault *node)
{
WRITE_NODE_TYPE("SETTODEFAULT");
@@ -977,7 +977,7 @@ _outAppendPath(StringInfo str, AppendPath *node)
}
static void
_outResultPath(StringInfo str, ResultPath * node)
_outResultPath(StringInfo str, ResultPath *node)
{
WRITE_NODE_TYPE("RESULTPATH");
@@ -988,7 +988,7 @@ _outResultPath(StringInfo str, ResultPath * node)
}
static void
_outMaterialPath(StringInfo str, MaterialPath * node)
_outMaterialPath(StringInfo str, MaterialPath *node)
{
WRITE_NODE_TYPE("MATERIALPATH");
@@ -998,7 +998,7 @@ _outMaterialPath(StringInfo str, MaterialPath * node)
}
static void
_outUniquePath(StringInfo str, UniquePath * node)
_outUniquePath(StringInfo str, UniquePath *node)
{
WRITE_NODE_TYPE("UNIQUEPATH");
@@ -1077,7 +1077,7 @@ _outJoinInfo(StringInfo str, JoinInfo *node)
}
static void
_outInClauseInfo(StringInfo str, InClauseInfo * node)
_outInClauseInfo(StringInfo str, InClauseInfo *node)
{
WRITE_NODE_TYPE("INCLAUSEINFO");
@@ -1130,7 +1130,7 @@ _outNotifyStmt(StringInfo str, NotifyStmt *node)
}
static void
_outDeclareCursorStmt(StringInfo str, DeclareCursorStmt * node)
_outDeclareCursorStmt(StringInfo str, DeclareCursorStmt *node)
{
WRITE_NODE_TYPE("DECLARECURSOR");