@@ -18646,31 +18646,31 @@ updatePreparableStmtEnd(Node *n, int end_location)
18646
18646
{
18647
18647
if (IsA(n, SelectStmt))
18648
18648
{
18649
- SelectStmt *stmt = (SelectStmt *)n;
18649
+ SelectStmt *stmt = (SelectStmt *) n;
18650
18650
18651
18651
stmt->stmt_len = end_location - stmt->stmt_location;
18652
18652
}
18653
18653
else if (IsA(n, InsertStmt))
18654
18654
{
18655
- InsertStmt *stmt = (InsertStmt *)n;
18655
+ InsertStmt *stmt = (InsertStmt *) n;
18656
18656
18657
18657
stmt->stmt_len = end_location - stmt->stmt_location;
18658
18658
}
18659
18659
else if (IsA(n, UpdateStmt))
18660
18660
{
18661
- UpdateStmt *stmt = (UpdateStmt *)n;
18661
+ UpdateStmt *stmt = (UpdateStmt *) n;
18662
18662
18663
18663
stmt->stmt_len = end_location - stmt->stmt_location;
18664
18664
}
18665
18665
else if (IsA(n, DeleteStmt))
18666
18666
{
18667
- DeleteStmt *stmt = (DeleteStmt *)n;
18667
+ DeleteStmt *stmt = (DeleteStmt *) n;
18668
18668
18669
18669
stmt->stmt_len = end_location - stmt->stmt_location;
18670
18670
}
18671
18671
else if (IsA(n, MergeStmt))
18672
18672
{
18673
- MergeStmt *stmt = (MergeStmt *)n;
18673
+ MergeStmt *stmt = (MergeStmt *) n;
18674
18674
18675
18675
stmt->stmt_len = end_location - stmt->stmt_location;
18676
18676
}
@@ -18683,10 +18683,10 @@ makeColumnRef(char *colname, List *indirection,
18683
18683
int location, core_yyscan_t yyscanner)
18684
18684
{
18685
18685
/*
18686
- * Generate a ColumnRef node, with an A_Indirection node added if there
18687
- * is any subscripting in the specified indirection list. However,
18688
- * any field selection at the start of the indirection list must be
18689
- * transposed into the "fields" part of the ColumnRef node.
18686
+ * Generate a ColumnRef node, with an A_Indirection node added if there is
18687
+ * any subscripting in the specified indirection list. However, any field
18688
+ * selection at the start of the indirection list must be transposed into
18689
+ * the "fields" part of the ColumnRef node.
18690
18690
*/
18691
18691
ColumnRef *c = makeNode(ColumnRef);
18692
18692
int nfields = 0;
@@ -18752,55 +18752,55 @@ makeStringConstCast(char *str, int location, TypeName *typename)
18752
18752
static Node *
18753
18753
makeIntConst(int val, int location)
18754
18754
{
18755
- A_Const *n = makeNode(A_Const);
18755
+ A_Const *n = makeNode(A_Const);
18756
18756
18757
18757
n->val.ival.type = T_Integer;
18758
18758
n->val.ival.ival = val;
18759
18759
n->location = location;
18760
18760
18761
- return (Node *) n;
18761
+ return (Node *) n;
18762
18762
}
18763
18763
18764
18764
static Node *
18765
18765
makeFloatConst(char *str, int location)
18766
18766
{
18767
- A_Const *n = makeNode(A_Const);
18767
+ A_Const *n = makeNode(A_Const);
18768
18768
18769
18769
n->val.fval.type = T_Float;
18770
18770
n->val.fval.fval = str;
18771
18771
n->location = location;
18772
18772
18773
- return (Node *) n;
18773
+ return (Node *) n;
18774
18774
}
18775
18775
18776
18776
static Node *
18777
18777
makeBoolAConst(bool state, int location)
18778
18778
{
18779
- A_Const *n = makeNode(A_Const);
18779
+ A_Const *n = makeNode(A_Const);
18780
18780
18781
18781
n->val.boolval.type = T_Boolean;
18782
18782
n->val.boolval.boolval = state;
18783
18783
n->location = location;
18784
18784
18785
- return (Node *) n;
18785
+ return (Node *) n;
18786
18786
}
18787
18787
18788
18788
static Node *
18789
18789
makeBitStringConst(char *str, int location)
18790
18790
{
18791
- A_Const *n = makeNode(A_Const);
18791
+ A_Const *n = makeNode(A_Const);
18792
18792
18793
18793
n->val.bsval.type = T_BitString;
18794
18794
n->val.bsval.bsval = str;
18795
18795
n->location = location;
18796
18796
18797
- return (Node *) n;
18797
+ return (Node *) n;
18798
18798
}
18799
18799
18800
18800
static Node *
18801
18801
makeNullAConst(int location)
18802
18802
{
18803
- A_Const *n = makeNode(A_Const);
18803
+ A_Const *n = makeNode(A_Const);
18804
18804
18805
18805
n->isnull = true;
18806
18806
n->location = location;
@@ -18889,7 +18889,7 @@ check_func_name(List *names, core_yyscan_t yyscanner)
18889
18889
static List *
18890
18890
check_indirection(List *indirection, core_yyscan_t yyscanner)
18891
18891
{
18892
- ListCell *l;
18892
+ ListCell *l;
18893
18893
18894
18894
foreach(l, indirection)
18895
18895
{
@@ -18944,16 +18944,16 @@ makeOrderedSetArgs(List *directargs, List *orderedargs,
18944
18944
core_yyscan_t yyscanner)
18945
18945
{
18946
18946
FunctionParameter *lastd = (FunctionParameter *) llast(directargs);
18947
- Integer *ndirectargs;
18947
+ Integer *ndirectargs;
18948
18948
18949
18949
/* No restriction unless last direct arg is VARIADIC */
18950
18950
if (lastd->mode == FUNC_PARAM_VARIADIC)
18951
18951
{
18952
18952
FunctionParameter *firsto = (FunctionParameter *) linitial(orderedargs);
18953
18953
18954
18954
/*
18955
- * We ignore the names, though the aggr_arg production allows them;
18956
- * it doesn't allow default values, so those need not be checked.
18955
+ * We ignore the names, though the aggr_arg production allows them; it
18956
+ * doesn't allow default values, so those need not be checked.
18957
18957
*/
18958
18958
if (list_length(orderedargs) != 1 ||
18959
18959
firsto->mode != FUNC_PARAM_VARIADIC ||
@@ -19115,7 +19115,7 @@ doNegate(Node *n, int location)
19115
19115
{
19116
19116
if (IsA(n, A_Const))
19117
19117
{
19118
- A_Const *con = (A_Const *) n;
19118
+ A_Const *con = (A_Const *) n;
19119
19119
19120
19120
/* report the constant's location as that of the '-' sign */
19121
19121
con->location = location;
@@ -19143,7 +19143,7 @@ doNegateFloat(Float *v)
19143
19143
if (*oldval == '+')
19144
19144
oldval++;
19145
19145
if (*oldval == '-')
19146
- v->fval = oldval+ 1; /* just strip the '-' */
19146
+ v->fval = oldval + 1; /* just strip the '-' */
19147
19147
else
19148
19148
v->fval = psprintf("-%s", oldval);
19149
19149
}
@@ -19214,10 +19214,11 @@ static Node *
19214
19214
makeXmlExpr(XmlExprOp op, char *name, List *named_args, List *args,
19215
19215
int location)
19216
19216
{
19217
- XmlExpr *x = makeNode(XmlExpr);
19217
+ XmlExpr *x = makeNode(XmlExpr);
19218
19218
19219
19219
x->op = op;
19220
19220
x->name = name;
19221
+
19221
19222
/*
19222
19223
* named_args is a list of ResTarget; it'll be split apart into separate
19223
19224
* expression and name lists in transformXmlExpr().
@@ -19227,7 +19228,7 @@ makeXmlExpr(XmlExprOp op, char *name, List *named_args, List *args,
19227
19228
x->args = args;
19228
19229
/* xmloption, if relevant, must be filled in by caller */
19229
19230
/* type and typmod will be filled in during parse analysis */
19230
- x->type = InvalidOid; /* marks the node as not analyzed */
19231
+ x->type = InvalidOid; /* marks the node as not analyzed */
19231
19232
x->location = location;
19232
19233
return (Node *) x;
19233
19234
}
@@ -19352,7 +19353,7 @@ makeRangeVarFromQualifiedName(char *name, List *namelist, int location,
19352
19353
errcode (ERRCODE_SYNTAX_ERROR ),
19353
19354
errmsg (" improper qualified name (too many dotted names): %s" ,
19354
19355
NameListToString (lcons (makeString (name ), namelist ))),
19355
- parser_errposition (location ));
19356
+ parser_errposition (location ));
19356
19357
break;
19357
19358
}
19358
19359
@@ -19421,7 +19422,7 @@ processCASbits(int cas_bits, int location, const char *constrType,
19421
19422
else
19422
19423
ereport(ERROR,
19423
19424
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
19424
- /* translator: %s is CHECK, UNIQUE, or similar */
19425
+ /* translator: %s is CHECK, UNIQUE, or similar */
19425
19426
errmsg("%s constraints cannot be marked DEFERRABLE",
19426
19427
constrType),
19427
19428
parser_errposition(location)));
@@ -19434,7 +19435,7 @@ processCASbits(int cas_bits, int location, const char *constrType,
19434
19435
else
19435
19436
ereport(ERROR,
19436
19437
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
19437
- /* translator: %s is CHECK, UNIQUE, or similar */
19438
+ /* translator: %s is CHECK, UNIQUE, or similar */
19438
19439
errmsg("%s constraints cannot be marked DEFERRABLE",
19439
19440
constrType),
19440
19441
parser_errposition(location)));
@@ -19447,7 +19448,7 @@ processCASbits(int cas_bits, int location, const char *constrType,
19447
19448
else
19448
19449
ereport(ERROR,
19449
19450
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
19450
- /* translator: %s is CHECK, UNIQUE, or similar */
19451
+ /* translator: %s is CHECK, UNIQUE, or similar */
19451
19452
errmsg("%s constraints cannot be marked NOT VALID",
19452
19453
constrType),
19453
19454
parser_errposition(location)));
@@ -19460,7 +19461,7 @@ processCASbits(int cas_bits, int location, const char *constrType,
19460
19461
else
19461
19462
ereport(ERROR,
19462
19463
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
19463
- /* translator: %s is CHECK, UNIQUE, or similar */
19464
+ /* translator: %s is CHECK, UNIQUE, or similar */
19464
19465
errmsg("%s constraints cannot be marked NO INHERIT",
19465
19466
constrType),
19466
19467
parser_errposition(location)));
@@ -19485,7 +19486,7 @@ parsePartitionStrategy(char *strategy, int location, core_yyscan_t yyscanner)
19485
19486
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
19486
19487
errmsg("unrecognized partitioning strategy \"%s\"", strategy),
19487
19488
parser_errposition(location)));
19488
- return PARTITION_STRATEGY_LIST; /* keep compiler quiet */
19489
+ return PARTITION_STRATEGY_LIST; /* keep compiler quiet */
19489
19490
19490
19491
}
19491
19492
@@ -19556,8 +19557,8 @@ preprocess_pubobj_list(List *pubobjspec_list, core_yyscan_t yyscanner)
19556
19557
parser_errposition(pubobj->location));
19557
19558
19558
19559
/*
19559
- * We can distinguish between the different type of schema
19560
- * objects based on whether name and pubtable is set.
19560
+ * We can distinguish between the different type of schema objects
19561
+ * based on whether name and pubtable is set.
19561
19562
*/
19562
19563
if (pubobj->name)
19563
19564
pubobj->pubobjtype = PUBLICATIONOBJ_TABLES_IN_SCHEMA;
@@ -19612,11 +19613,13 @@ makeRecursiveViewSelect(char *relname, List *aliases, Node *query)
19612
19613
w->ctes = list_make1(cte);
19613
19614
w->location = -1;
19614
19615
19615
- /* create target list for the new SELECT from the alias list of the
19616
- * recursive view specification */
19617
- foreach (lc, aliases)
19616
+ /*
19617
+ * create target list for the new SELECT from the alias list of the
19618
+ * recursive view specification
19619
+ */
19620
+ foreach(lc, aliases)
19618
19621
{
19619
- ResTarget *rt = makeNode(ResTarget);
19622
+ ResTarget *rt = makeNode(ResTarget);
19620
19623
19621
19624
rt->name = NULL;
19622
19625
rt->indirection = NIL;
@@ -19626,8 +19629,10 @@ makeRecursiveViewSelect(char *relname, List *aliases, Node *query)
19626
19629
tl = lappend(tl, rt);
19627
19630
}
19628
19631
19629
- /* create new SELECT combining WITH clause, target list, and fake FROM
19630
- * clause */
19632
+ /*
19633
+ * create new SELECT combining WITH clause, target list, and fake FROM
19634
+ * clause
19635
+ */
19631
19636
s->withClause = w;
19632
19637
s->targetList = tl;
19633
19638
s->fromClause = list_make1(makeRangeVar(NULL, relname, -1));
0 commit comments