mirror of
https://github.com/postgres/postgres.git
synced 2025-08-30 06:01:21 +03:00
Run pgindent with new pg_bsd_indent version 2.1.1.
Thomas Munro fixed a longstanding annoyance in pg_bsd_indent, that it would misformat lines containing IsA() macros on the assumption that the IsA() call should be treated like a cast. This improves some other cases involving field/variable names that match typedefs, too. The only places that get worse are a couple of uses of the OpenSSL macro STACK_OF(); we'll gladly take that trade-off. Discussion: https://postgr.es/m/20200114221814.GA19630@alvherre.pgsql
This commit is contained in:
@@ -753,7 +753,7 @@ ExplainPrintPlan(ExplainState *es, QueryDesc *queryDesc)
|
||||
* further down in the plan tree.
|
||||
*/
|
||||
ps = queryDesc->planstate;
|
||||
if (IsA(ps, GatherState) &&((Gather *) ps->plan)->invisible)
|
||||
if (IsA(ps, GatherState) && ((Gather *) ps->plan)->invisible)
|
||||
{
|
||||
ps = outerPlanState(ps);
|
||||
es->hide_workers = true;
|
||||
@@ -2256,7 +2256,7 @@ show_scan_qual(List *qual, const char *qlabel,
|
||||
{
|
||||
bool useprefix;
|
||||
|
||||
useprefix = (IsA(planstate->plan, SubqueryScan) ||es->verbose);
|
||||
useprefix = (IsA(planstate->plan, SubqueryScan) || es->verbose);
|
||||
show_qual(qual, qlabel, planstate, ancestors, useprefix, es);
|
||||
}
|
||||
|
||||
|
@@ -11136,7 +11136,7 @@ ATColumnChangeRequiresRewrite(Node *expr, AttrNumber varattno)
|
||||
for (;;)
|
||||
{
|
||||
/* only one varno, so no need to check that */
|
||||
if (IsA(expr, Var) &&((Var *) expr)->varattno == varattno)
|
||||
if (IsA(expr, Var) && ((Var *) expr)->varattno == varattno)
|
||||
return false;
|
||||
else if (IsA(expr, RelabelType))
|
||||
expr = (Node *) ((RelabelType *) expr)->arg;
|
||||
|
@@ -2176,7 +2176,7 @@ AlterDomainDefault(List *names, Node *defaultRaw)
|
||||
* DefineDomain.)
|
||||
*/
|
||||
if (defaultExpr == NULL ||
|
||||
(IsA(defaultExpr, Const) &&((Const *) defaultExpr)->constisnull))
|
||||
(IsA(defaultExpr, Const) && ((Const *) defaultExpr)->constisnull))
|
||||
{
|
||||
/* Default is NULL, drop it */
|
||||
defaultExpr = NULL;
|
||||
|
@@ -1410,7 +1410,7 @@ find_unaggregated_cols_walker(Node *node, Bitmapset **colnos)
|
||||
*colnos = bms_add_member(*colnos, var->varattno);
|
||||
return false;
|
||||
}
|
||||
if (IsA(node, Aggref) ||IsA(node, GroupingFunc))
|
||||
if (IsA(node, Aggref) || IsA(node, GroupingFunc))
|
||||
{
|
||||
/* do not descend into aggregate exprs */
|
||||
return false;
|
||||
|
@@ -277,8 +277,8 @@ ExecInitProjectSet(ProjectSet *node, EState *estate, int eflags)
|
||||
TargetEntry *te = (TargetEntry *) lfirst(lc);
|
||||
Expr *expr = te->expr;
|
||||
|
||||
if ((IsA(expr, FuncExpr) &&((FuncExpr *) expr)->funcretset) ||
|
||||
(IsA(expr, OpExpr) &&((OpExpr *) expr)->opretset))
|
||||
if ((IsA(expr, FuncExpr) && ((FuncExpr *) expr)->funcretset) ||
|
||||
(IsA(expr, OpExpr) && ((OpExpr *) expr)->opretset))
|
||||
{
|
||||
state->elems[off] = (Node *)
|
||||
ExecInitFunctionResultSet(expr, state->ps.ps_ExprContext,
|
||||
|
@@ -80,7 +80,7 @@ static int ssl_protocol_version_to_openssl(int v);
|
||||
int
|
||||
be_tls_init(bool isServerStart)
|
||||
{
|
||||
STACK_OF(X509_NAME) *root_cert_list = NULL;
|
||||
STACK_OF(X509_NAME) * root_cert_list = NULL;
|
||||
SSL_CTX *context;
|
||||
int ssl_ver_min = -1;
|
||||
int ssl_ver_max = -1;
|
||||
|
@@ -3682,7 +3682,7 @@ outNode(StringInfo str, const void *obj)
|
||||
|
||||
if (obj == NULL)
|
||||
appendStringInfoString(str, "<>");
|
||||
else if (IsA(obj, List) ||IsA(obj, IntList) || IsA(obj, OidList))
|
||||
else if (IsA(obj, List) || IsA(obj, IntList) || IsA(obj, OidList))
|
||||
_outList(str, obj);
|
||||
else if (IsA(obj, Integer) ||
|
||||
IsA(obj, Float) ||
|
||||
|
@@ -3257,7 +3257,7 @@ final_cost_mergejoin(PlannerInfo *root, MergePath *path,
|
||||
* The whole issue is moot if we are working from a unique-ified outer
|
||||
* input, or if we know we don't need to mark/restore at all.
|
||||
*/
|
||||
if (IsA(outer_path, UniquePath) ||path->skip_mark_restore)
|
||||
if (IsA(outer_path, UniquePath) || path->skip_mark_restore)
|
||||
rescannedtuples = 0;
|
||||
else
|
||||
{
|
||||
|
@@ -1960,7 +1960,7 @@ set_upper_references(PlannerInfo *root, Plan *plan, int rtoffset)
|
||||
static void
|
||||
set_param_references(PlannerInfo *root, Plan *plan)
|
||||
{
|
||||
Assert(IsA(plan, Gather) ||IsA(plan, GatherMerge));
|
||||
Assert(IsA(plan, Gather) || IsA(plan, GatherMerge));
|
||||
|
||||
if (plan->lefttree->extParam)
|
||||
{
|
||||
|
@@ -2639,7 +2639,7 @@ apply_projection_to_path(PlannerInfo *root,
|
||||
* workers can help project. But if there is something that is not
|
||||
* parallel-safe in the target expressions, then we can't.
|
||||
*/
|
||||
if ((IsA(path, GatherPath) ||IsA(path, GatherMergePath)) &&
|
||||
if ((IsA(path, GatherPath) || IsA(path, GatherMergePath)) &&
|
||||
is_parallel_safe(root, (Node *) target->exprs))
|
||||
{
|
||||
/*
|
||||
|
@@ -221,7 +221,7 @@ transformOptionalSelectInto(ParseState *pstate, Node *parseTree)
|
||||
/* If it's a set-operation tree, drill down to leftmost SelectStmt */
|
||||
while (stmt && stmt->op != SETOP_NONE)
|
||||
stmt = stmt->larg;
|
||||
Assert(stmt && IsA(stmt, SelectStmt) &&stmt->larg == NULL);
|
||||
Assert(stmt && IsA(stmt, SelectStmt) && stmt->larg == NULL);
|
||||
|
||||
if (stmt->intoClause)
|
||||
{
|
||||
@@ -641,7 +641,7 @@ transformInsertStmt(ParseState *pstate, InsertStmt *stmt)
|
||||
if (tle->resjunk)
|
||||
continue;
|
||||
if (tle->expr &&
|
||||
(IsA(tle->expr, Const) ||IsA(tle->expr, Param)) &&
|
||||
(IsA(tle->expr, Const) || IsA(tle->expr, Param)) &&
|
||||
exprType((Node *) tle->expr) == UNKNOWNOID)
|
||||
expr = tle->expr;
|
||||
else
|
||||
|
@@ -750,8 +750,8 @@ check_agg_arguments_walker(Node *node,
|
||||
*/
|
||||
if (context->sublevels_up == 0)
|
||||
{
|
||||
if ((IsA(node, FuncExpr) &&((FuncExpr *) node)->funcretset) ||
|
||||
(IsA(node, OpExpr) &&((OpExpr *) node)->opretset))
|
||||
if ((IsA(node, FuncExpr) && ((FuncExpr *) node)->funcretset) ||
|
||||
(IsA(node, OpExpr) && ((OpExpr *) node)->opretset))
|
||||
ereport(ERROR,
|
||||
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
||||
errmsg("aggregate function calls cannot contain set-returning function calls"),
|
||||
|
@@ -1767,7 +1767,7 @@ transformLimitClause(ParseState *pstate, Node *clause,
|
||||
* unadorned NULL that's not accepted back by the grammar.
|
||||
*/
|
||||
if (exprKind == EXPR_KIND_LIMIT && limitOption == LIMIT_OPTION_WITH_TIES &&
|
||||
IsA(clause, A_Const) &&((A_Const *) clause)->val.type == T_Null)
|
||||
IsA(clause, A_Const) && ((A_Const *) clause)->val.type == T_Null)
|
||||
ereport(ERROR,
|
||||
(errcode(ERRCODE_INVALID_ROW_COUNT_IN_LIMIT_CLAUSE),
|
||||
errmsg("row count cannot be NULL in FETCH FIRST ... WITH TIES clause")));
|
||||
|
@@ -961,7 +961,7 @@ transformAExprOp(ParseState *pstate, A_Expr *a)
|
||||
list_length(a->name) == 1 &&
|
||||
strcmp(strVal(linitial(a->name)), "=") == 0 &&
|
||||
(exprIsNullConstant(lexpr) || exprIsNullConstant(rexpr)) &&
|
||||
(!IsA(lexpr, CaseTestExpr) &&!IsA(rexpr, CaseTestExpr)))
|
||||
(!IsA(lexpr, CaseTestExpr) && !IsA(rexpr, CaseTestExpr)))
|
||||
{
|
||||
NullTest *n = makeNode(NullTest);
|
||||
|
||||
|
@@ -1479,13 +1479,13 @@ examine_clause_args(List *args, Var **varp, Const **cstp, bool *varonleftp)
|
||||
if (IsA(rightop, RelabelType))
|
||||
rightop = (Node *) ((RelabelType *) rightop)->arg;
|
||||
|
||||
if (IsA(leftop, Var) &&IsA(rightop, Const))
|
||||
if (IsA(leftop, Var) && IsA(rightop, Const))
|
||||
{
|
||||
var = (Var *) leftop;
|
||||
cst = (Const *) rightop;
|
||||
varonleft = true;
|
||||
}
|
||||
else if (IsA(leftop, Const) &&IsA(rightop, Var))
|
||||
else if (IsA(leftop, Const) && IsA(rightop, Var))
|
||||
{
|
||||
var = (Var *) rightop;
|
||||
cst = (Const *) leftop;
|
||||
|
@@ -4471,7 +4471,7 @@ TemporalSimplify(int32 max_precis, Node *node)
|
||||
|
||||
typmod = (Node *) lsecond(expr->args);
|
||||
|
||||
if (IsA(typmod, Const) &&!((Const *) typmod)->constisnull)
|
||||
if (IsA(typmod, Const) && !((Const *) typmod)->constisnull)
|
||||
{
|
||||
Node *source = (Node *) linitial(expr->args);
|
||||
int32 old_precis = exprTypmod(source);
|
||||
|
@@ -5025,7 +5025,7 @@ NUM_prepare_locale(NUMProc *Np)
|
||||
if (lconv->thousands_sep && *lconv->thousands_sep)
|
||||
Np->L_thousands_sep = lconv->thousands_sep;
|
||||
/* Make sure thousands separator doesn't match decimal point symbol. */
|
||||
else if (strcmp(Np->decimal, ",") !=0)
|
||||
else if (strcmp(Np->decimal, ",") != 0)
|
||||
Np->L_thousands_sep = ",";
|
||||
else
|
||||
Np->L_thousands_sep = ".";
|
||||
|
@@ -911,7 +911,7 @@ numeric_support(PG_FUNCTION_ARGS)
|
||||
|
||||
typmod = (Node *) lsecond(expr->args);
|
||||
|
||||
if (IsA(typmod, Const) &&!((Const *) typmod)->constisnull)
|
||||
if (IsA(typmod, Const) && !((Const *) typmod)->constisnull)
|
||||
{
|
||||
Node *source = (Node *) linitial(expr->args);
|
||||
int32 old_typmod = exprTypmod(source);
|
||||
|
@@ -5829,8 +5829,8 @@ get_rule_sortgroupclause(Index ref, List *tlist, bool force_colno,
|
||||
*/
|
||||
bool need_paren = (PRETTY_PAREN(context)
|
||||
|| IsA(expr, FuncExpr)
|
||||
||IsA(expr, Aggref)
|
||||
||IsA(expr, WindowFunc));
|
||||
|| IsA(expr, Aggref)
|
||||
|| IsA(expr, WindowFunc));
|
||||
|
||||
if (need_paren)
|
||||
appendStringInfoChar(context->buf, '(');
|
||||
@@ -10317,7 +10317,7 @@ get_from_clause_item(Node *jtnode, Query *query, deparse_context *context)
|
||||
|
||||
need_paren_on_right = PRETTY_PAREN(context) &&
|
||||
!IsA(j->rarg, RangeTblRef) &&
|
||||
!(IsA(j->rarg, JoinExpr) &&((JoinExpr *) j->rarg)->alias != NULL);
|
||||
!(IsA(j->rarg, JoinExpr) && ((JoinExpr *) j->rarg)->alias != NULL);
|
||||
|
||||
if (!PRETTY_PAREN(context) || j->alias != NULL)
|
||||
appendStringInfoChar(buf, '(');
|
||||
|
@@ -1263,7 +1263,7 @@ interval_support(PG_FUNCTION_ARGS)
|
||||
|
||||
typmod = (Node *) lsecond(expr->args);
|
||||
|
||||
if (IsA(typmod, Const) &&!((Const *) typmod)->constisnull)
|
||||
if (IsA(typmod, Const) && !((Const *) typmod)->constisnull)
|
||||
{
|
||||
Node *source = (Node *) linitial(expr->args);
|
||||
int32 new_typmod = DatumGetInt32(((Const *) typmod)->constvalue);
|
||||
|
@@ -713,7 +713,7 @@ varbit_support(PG_FUNCTION_ARGS)
|
||||
|
||||
typmod = (Node *) lsecond(expr->args);
|
||||
|
||||
if (IsA(typmod, Const) &&!((Const *) typmod)->constisnull)
|
||||
if (IsA(typmod, Const) && !((Const *) typmod)->constisnull)
|
||||
{
|
||||
Node *source = (Node *) linitial(expr->args);
|
||||
int32 new_typmod = DatumGetInt32(((Const *) typmod)->constvalue);
|
||||
|
@@ -572,7 +572,7 @@ varchar_support(PG_FUNCTION_ARGS)
|
||||
|
||||
typmod = (Node *) lsecond(expr->args);
|
||||
|
||||
if (IsA(typmod, Const) &&!((Const *) typmod)->constisnull)
|
||||
if (IsA(typmod, Const) && !((Const *) typmod)->constisnull)
|
||||
{
|
||||
Node *source = (Node *) linitial(expr->args);
|
||||
int32 old_typmod = exprTypmod(source);
|
||||
|
Reference in New Issue
Block a user