mirror of
https://github.com/postgres/postgres.git
synced 2025-11-10 17:42:29 +03:00
OK, folks, here is the pgindent output.
This commit is contained in:
@@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.47 1998/09/01 03:22:53 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.48 1998/09/01 04:29:00 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@@ -999,9 +999,9 @@ _copyArrayRef(ArrayRef *from)
|
||||
** -- JMH, 8/2/93
|
||||
*/
|
||||
static RelOptInfo *
|
||||
_copyRelOptInfo(RelOptInfo *from)
|
||||
_copyRelOptInfo(RelOptInfo * from)
|
||||
{
|
||||
RelOptInfo *newnode = makeNode(RelOptInfo);
|
||||
RelOptInfo *newnode = makeNode(RelOptInfo);
|
||||
int i,
|
||||
len;
|
||||
|
||||
@@ -1320,9 +1320,9 @@ _copyMergeOrder(MergeOrder *from)
|
||||
* ----------------
|
||||
*/
|
||||
static ClauseInfo *
|
||||
_copyClauseInfo(ClauseInfo *from)
|
||||
_copyClauseInfo(ClauseInfo * from)
|
||||
{
|
||||
ClauseInfo *newnode = makeNode(ClauseInfo);
|
||||
ClauseInfo *newnode = makeNode(ClauseInfo);
|
||||
|
||||
/* ----------------
|
||||
* copy remainder of node
|
||||
@@ -1413,9 +1413,9 @@ _copyMInfo(MInfo *from)
|
||||
* ----------------
|
||||
*/
|
||||
static JoinInfo *
|
||||
_copyJoinInfo(JoinInfo *from)
|
||||
_copyJoinInfo(JoinInfo * from)
|
||||
{
|
||||
JoinInfo *newnode = makeNode(JoinInfo);
|
||||
JoinInfo *newnode = makeNode(JoinInfo);
|
||||
|
||||
/* ----------------
|
||||
* copy remainder of node
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.19 1998/09/01 03:22:55 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.20 1998/09/01 04:29:03 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@@ -281,7 +281,7 @@ _equalFunc(Func *a, Func *b)
|
||||
* ClauseInfo is a subclass of Node.
|
||||
*/
|
||||
static bool
|
||||
_equalClauseInfo(ClauseInfo *a, ClauseInfo *b)
|
||||
_equalClauseInfo(ClauseInfo * a, ClauseInfo * b)
|
||||
{
|
||||
Assert(IsA(a, ClauseInfo));
|
||||
Assert(IsA(b, ClauseInfo));
|
||||
@@ -306,7 +306,7 @@ _equalClauseInfo(ClauseInfo *a, ClauseInfo *b)
|
||||
* RelOptInfo is a subclass of Node.
|
||||
*/
|
||||
static bool
|
||||
_equalRelOptInfo(RelOptInfo *a, RelOptInfo *b)
|
||||
_equalRelOptInfo(RelOptInfo * a, RelOptInfo * b)
|
||||
{
|
||||
Assert(IsA(a, RelOptInfo));
|
||||
Assert(IsA(b, RelOptInfo));
|
||||
@@ -530,7 +530,7 @@ _equalSubPlan(SubPlan *a, SubPlan *b)
|
||||
}
|
||||
|
||||
static bool
|
||||
_equalJoinInfo(JoinInfo *a, JoinInfo *b)
|
||||
_equalJoinInfo(JoinInfo * a, JoinInfo * b)
|
||||
{
|
||||
Assert(IsA(a, JoinInfo));
|
||||
Assert(IsA(b, JoinInfo));
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/list.c,v 1.14 1998/09/01 03:22:56 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/list.c,v 1.15 1998/09/01 04:29:05 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* XXX a few of the following functions are duplicated to handle
|
||||
@@ -105,7 +105,7 @@ nconc(List *l1, List *l2)
|
||||
;
|
||||
|
||||
lnext(temp) = l2;
|
||||
return l1; /* list1 is now list1+list2 */
|
||||
return l1; /* list1 is now list1+list2 */
|
||||
}
|
||||
|
||||
|
||||
@@ -305,10 +305,10 @@ LispUnion(List *l1, List *l2)
|
||||
List *j = NIL;
|
||||
|
||||
if (l1 == NIL)
|
||||
return l2; /* XXX - should be copy of l2 */
|
||||
return l2; /* XXX - should be copy of l2 */
|
||||
|
||||
if (l2 == NIL)
|
||||
return l1; /* XXX - should be copy of l1 */
|
||||
return l1; /* XXX - should be copy of l1 */
|
||||
|
||||
foreach(i, l1)
|
||||
{
|
||||
@@ -335,10 +335,10 @@ LispUnioni(List *l1, List *l2)
|
||||
List *j = NIL;
|
||||
|
||||
if (l1 == NIL)
|
||||
return l2; /* XXX - should be copy of l2 */
|
||||
return l2; /* XXX - should be copy of l2 */
|
||||
|
||||
if (l2 == NIL)
|
||||
return l1; /* XXX - should be copy of l1 */
|
||||
return l1; /* XXX - should be copy of l1 */
|
||||
|
||||
foreach(i, l1)
|
||||
{
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.45 1998/09/01 03:22:59 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.46 1998/09/01 04:29:07 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* Every (plan) node in POSTGRES has an associated "out" routine which
|
||||
@@ -129,6 +129,7 @@ _outFuncCall(StringInfo str, FuncCall *node)
|
||||
appendStringInfo(str, " :args ");
|
||||
_outNode(str, node->args);
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
static void
|
||||
@@ -660,7 +661,8 @@ _outResdom(StringInfo str, Resdom *node)
|
||||
sprintf(buf, " :restypmod %d ", node->restypmod);
|
||||
appendStringInfo(str, buf);
|
||||
appendStringInfo(str, " :resname ");
|
||||
sprintf(buf,"\"%s\"", node->resname); /* fix for SELECT col AS "my name" */
|
||||
sprintf(buf, "\"%s\"", node->resname); /* fix for SELECT col AS
|
||||
* "my name" */
|
||||
appendStringInfo(str, buf);
|
||||
sprintf(buf, " :reskey %d ", node->reskey);
|
||||
appendStringInfo(str, buf);
|
||||
@@ -990,7 +992,7 @@ _outEState(StringInfo str, EState *node)
|
||||
* Stuff from relation.h
|
||||
*/
|
||||
static void
|
||||
_outRelOptInfo(StringInfo str, RelOptInfo *node)
|
||||
_outRelOptInfo(StringInfo str, RelOptInfo * node)
|
||||
{
|
||||
char buf[500];
|
||||
|
||||
@@ -1356,7 +1358,7 @@ _outMergeOrder(StringInfo str, MergeOrder *node)
|
||||
* ClauseInfo is a subclass of Node.
|
||||
*/
|
||||
static void
|
||||
_outClauseInfo(StringInfo str, ClauseInfo *node)
|
||||
_outClauseInfo(StringInfo str, ClauseInfo * node)
|
||||
{
|
||||
char buf[500];
|
||||
|
||||
@@ -1424,7 +1426,7 @@ _outHInfo(StringInfo str, HInfo *node)
|
||||
* JoinInfo is a subclass of Node.
|
||||
*/
|
||||
static void
|
||||
_outJoinInfo(StringInfo str, JoinInfo *node)
|
||||
_outJoinInfo(StringInfo str, JoinInfo * node)
|
||||
{
|
||||
appendStringInfo(str, " JINFO ");
|
||||
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/print.c,v 1.17 1998/08/16 05:35:35 thomas Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/print.c,v 1.18 1998/09/01 04:29:10 momjian Exp $
|
||||
*
|
||||
* HISTORY
|
||||
* AUTHOR DATE MAJOR EVENT
|
||||
@@ -201,7 +201,7 @@ print_expr(Node *expr, List *rtable)
|
||||
|
||||
print_expr((Node *) get_leftop(e), rtable);
|
||||
opname = get_opname(((Oper *) e->oper)->opno);
|
||||
printf(" %s ", ((opname != NULL)? opname: "(invalid operator)"));
|
||||
printf(" %s ", ((opname != NULL) ? opname : "(invalid operator)"));
|
||||
print_expr((Node *) get_rightop(e), rtable);
|
||||
}
|
||||
else
|
||||
@@ -392,13 +392,16 @@ print_plan_recursive(Plan *p, Query *parsetree, int indentLevel, char *label)
|
||||
{
|
||||
List *lst;
|
||||
int whichplan = 0;
|
||||
Append *appendplan = (Append *)p;
|
||||
|
||||
Append *appendplan = (Append *) p;
|
||||
|
||||
foreach(lst, appendplan->appendplans)
|
||||
{
|
||||
Plan *subnode = (Plan *)lfirst(lst);
|
||||
Plan *subnode = (Plan *) lfirst(lst);
|
||||
|
||||
/* I don't think we need to fiddle with the range table here, bjm */
|
||||
/*
|
||||
* I don't think we need to fiddle with the range table here,
|
||||
* bjm
|
||||
*/
|
||||
print_plan_recursive(subnode, parsetree, indentLevel + 3, "a: ");
|
||||
|
||||
whichplan++;
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/readfuncs.c,v 1.36 1998/09/01 03:23:03 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/nodes/readfuncs.c,v 1.37 1998/09/01 04:29:12 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* Most of the read functions for plan nodes are tested. (In fact, they
|
||||
@@ -326,14 +326,14 @@ _readAppend()
|
||||
local_node->appendplans = nodeRead(true); /* now read it */
|
||||
|
||||
token = lsptok(NULL, &length); /* eat :unionrtables */
|
||||
local_node->unionrtables = nodeRead(true); /* now read it */
|
||||
local_node->unionrtables = nodeRead(true); /* now read it */
|
||||
|
||||
token = lsptok(NULL, &length); /* eat :inheritrelid */
|
||||
token = lsptok(NULL, &length); /* get inheritrelid */
|
||||
local_node->inheritrelid = strtoul(token, NULL, 10);
|
||||
|
||||
token = lsptok(NULL, &length); /* eat :inheritrtable */
|
||||
local_node->inheritrtable = nodeRead(true); /* now read it */
|
||||
local_node->inheritrtable = nodeRead(true); /* now read it */
|
||||
|
||||
return local_node;
|
||||
}
|
||||
@@ -716,7 +716,7 @@ _readResdom()
|
||||
else
|
||||
{
|
||||
local_node->resname = (char *) palloc(length + 1);
|
||||
StrNCpy(local_node->resname, token+1, length + 1 - 2);/* strip quotes */
|
||||
StrNCpy(local_node->resname, token + 1, length + 1 - 2); /* strip quotes */
|
||||
}
|
||||
|
||||
token = lsptok(NULL, &length); /* eat :reskey */
|
||||
@@ -1224,7 +1224,7 @@ _readEState()
|
||||
static RelOptInfo *
|
||||
_readRelOptInfo()
|
||||
{
|
||||
RelOptInfo *local_node;
|
||||
RelOptInfo *local_node;
|
||||
char *token;
|
||||
int length;
|
||||
|
||||
@@ -1769,7 +1769,7 @@ _readMergeOrder()
|
||||
static ClauseInfo *
|
||||
_readClauseInfo()
|
||||
{
|
||||
ClauseInfo *local_node;
|
||||
ClauseInfo *local_node;
|
||||
char *token;
|
||||
int length;
|
||||
|
||||
@@ -1867,7 +1867,7 @@ _readHInfo()
|
||||
static JoinInfo *
|
||||
_readJoinInfo()
|
||||
{
|
||||
JoinInfo *local_node;
|
||||
JoinInfo *local_node;
|
||||
char *token;
|
||||
int length;
|
||||
|
||||
|
||||
Reference in New Issue
Block a user