mirror of
https://github.com/postgres/postgres.git
synced 2025-07-03 20:02:46 +03:00
Post-feature-freeze pgindent run.
Discussion: https://postgr.es/m/15719.1523984266@sss.pgh.pa.us
This commit is contained in:
@ -2200,7 +2200,7 @@ ExecEvalFuncExprFusage(ExprState *state, ExprEvalStep *op,
|
||||
*/
|
||||
void
|
||||
ExecEvalFuncExprStrictFusage(ExprState *state, ExprEvalStep *op,
|
||||
ExprContext *econtext)
|
||||
ExprContext *econtext)
|
||||
{
|
||||
|
||||
FunctionCallInfo fcinfo = op->d.func.fcinfo_data;
|
||||
|
@ -1417,6 +1417,7 @@ ExecGetTriggerResultRel(EState *estate, Oid relid)
|
||||
rInfo++;
|
||||
nr--;
|
||||
}
|
||||
|
||||
/*
|
||||
* Third, search through the result relations that were created during
|
||||
* tuple routing, if any.
|
||||
|
@ -407,10 +407,9 @@ ExecSetExecProcNode(PlanState *node, ExecProcNodeMtd function)
|
||||
{
|
||||
/*
|
||||
* Add a wrapper around the ExecProcNode callback that checks stack depth
|
||||
* during the first execution and maybe adds an instrumentation
|
||||
* wrapper. When the callback is changed after execution has already begun
|
||||
* that means we'll superfluously execute ExecProcNodeFirst, but that seems
|
||||
* ok.
|
||||
* during the first execution and maybe adds an instrumentation wrapper.
|
||||
* When the callback is changed after execution has already begun that
|
||||
* means we'll superfluously execute ExecProcNodeFirst, but that seems ok.
|
||||
*/
|
||||
node->ExecProcNodeReal = function;
|
||||
node->ExecProcNode = ExecProcNodeFirst;
|
||||
|
@ -674,7 +674,7 @@ ExecFetchSlotTuple(TupleTableSlot *slot)
|
||||
if (HeapTupleHeaderGetNatts(slot->tts_tuple->t_data) <
|
||||
slot->tts_tupleDescriptor->natts)
|
||||
{
|
||||
HeapTuple tuple;
|
||||
HeapTuple tuple;
|
||||
MemoryContext oldContext = MemoryContextSwitchTo(slot->tts_mcxt);
|
||||
|
||||
tuple = heap_expand_tuple(slot->tts_tuple,
|
||||
|
@ -2365,7 +2365,7 @@ ExecInitAgg(Agg *node, EState *estate, int eflags)
|
||||
/* for each grouping set */
|
||||
for (i = 0; i < phasedata->numsets; i++)
|
||||
{
|
||||
int length = phasedata->gset_lengths[i];
|
||||
int length = phasedata->gset_lengths[i];
|
||||
|
||||
if (phasedata->eqfunctions[length - 1] != NULL)
|
||||
continue;
|
||||
|
@ -268,7 +268,7 @@ gather_getnext(GatherState *gatherstate)
|
||||
|
||||
if (gatherstate->need_to_scan_locally)
|
||||
{
|
||||
EState *estate = gatherstate->ps.state;
|
||||
EState *estate = gatherstate->ps.state;
|
||||
|
||||
/* Install our DSA area while executing the plan. */
|
||||
estate->es_query_dsa =
|
||||
|
@ -628,7 +628,7 @@ gather_merge_readnext(GatherMergeState *gm_state, int reader, bool nowait)
|
||||
{
|
||||
PlanState *outerPlan = outerPlanState(gm_state);
|
||||
TupleTableSlot *outerTupleSlot;
|
||||
EState *estate = gm_state->ps.state;
|
||||
EState *estate = gm_state->ps.state;
|
||||
|
||||
/* Install our DSA area while executing the plan. */
|
||||
estate->es_query_dsa = gm_state->pei ? gm_state->pei->area : NULL;
|
||||
|
@ -596,7 +596,8 @@ ExecInitHashJoin(HashJoin *node, EState *estate, int eflags)
|
||||
List *lclauses;
|
||||
List *rclauses;
|
||||
List *hoperators;
|
||||
TupleDesc outerDesc, innerDesc;
|
||||
TupleDesc outerDesc,
|
||||
innerDesc;
|
||||
ListCell *l;
|
||||
|
||||
/* check for unsupported flags */
|
||||
|
@ -1436,7 +1436,8 @@ MergeJoinState *
|
||||
ExecInitMergeJoin(MergeJoin *node, EState *estate, int eflags)
|
||||
{
|
||||
MergeJoinState *mergestate;
|
||||
TupleDesc outerDesc, innerDesc;
|
||||
TupleDesc outerDesc,
|
||||
innerDesc;
|
||||
|
||||
/* check for unsupported flags */
|
||||
Assert(!(eflags & (EXEC_FLAG_BACKWARD | EXEC_FLAG_MARK)));
|
||||
|
@ -1088,7 +1088,7 @@ lreplace:;
|
||||
*/
|
||||
ExecDelete(mtstate, tupleid, oldtuple, planSlot, epqstate,
|
||||
estate, &tuple_deleted, false,
|
||||
false /* canSetTag */, true /* changingPart */);
|
||||
false /* canSetTag */ , true /* changingPart */ );
|
||||
|
||||
/*
|
||||
* For some reason if DELETE didn't happen (e.g. trigger prevented
|
||||
@ -1678,8 +1678,8 @@ ExecPrepareTupleRouting(ModifyTableState *mtstate,
|
||||
HeapTuple tuple;
|
||||
|
||||
/*
|
||||
* Determine the target partition. If ExecFindPartition does not find
|
||||
* a partition after all, it doesn't return here; otherwise, the returned
|
||||
* Determine the target partition. If ExecFindPartition does not find a
|
||||
* partition after all, it doesn't return here; otherwise, the returned
|
||||
* value is to be used as an index into the arrays for the ResultRelInfo
|
||||
* and TupleConversionMap for the partition.
|
||||
*/
|
||||
@ -2140,7 +2140,7 @@ ExecModifyTable(PlanState *pstate)
|
||||
slot = ExecDelete(node, tupleid, oldtuple, planSlot,
|
||||
&node->mt_epqstate, estate,
|
||||
NULL, true, node->canSetTag,
|
||||
false /* changingPart */);
|
||||
false /* changingPart */ );
|
||||
break;
|
||||
default:
|
||||
elog(ERROR, "unknown operation");
|
||||
@ -2310,7 +2310,7 @@ ExecInitModifyTable(ModifyTable *node, EState *estate, int eflags)
|
||||
if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE &&
|
||||
(operation == CMD_INSERT || update_tuple_routing_needed))
|
||||
mtstate->mt_partition_tuple_routing =
|
||||
ExecSetupPartitionTupleRouting(mtstate, rel);
|
||||
ExecSetupPartitionTupleRouting(mtstate, rel);
|
||||
|
||||
/*
|
||||
* Build state for collecting transition tuples. This requires having a
|
||||
|
@ -153,8 +153,8 @@ ExecInitSampleScan(SampleScan *node, EState *estate, int eflags)
|
||||
RelationGetDescr(scanstate->ss.ss_currentRelation));
|
||||
|
||||
/*
|
||||
* Initialize result slot, type and projection.
|
||||
* tuple table and result tuple initialization
|
||||
* Initialize result slot, type and projection. tuple table and result
|
||||
* tuple initialization
|
||||
*/
|
||||
ExecInitResultTupleSlotTL(estate, &scanstate->ss.ps);
|
||||
ExecAssignScanProjectionInfo(&scanstate->ss);
|
||||
|
@ -214,8 +214,8 @@ ExecInitSort(Sort *node, EState *estate, int eflags)
|
||||
ExecCreateScanSlotFromOuterPlan(estate, &sortstate->ss);
|
||||
|
||||
/*
|
||||
* Initialize return slot and type. No need to initialize projection info because
|
||||
* this node doesn't do projections.
|
||||
* Initialize return slot and type. No need to initialize projection info
|
||||
* because this node doesn't do projections.
|
||||
*/
|
||||
ExecInitResultTupleSlotTL(estate, &sortstate->ss.ps);
|
||||
sortstate->ss.ps.ps_ProjInfo = NULL;
|
||||
|
@ -974,7 +974,7 @@ ExecInitSubPlan(SubPlan *subplan, PlanState *parent)
|
||||
|
||||
/*
|
||||
* Create comparator for lookups of rows in the table (potentially
|
||||
* across-type comparison).
|
||||
* across-type comparison).
|
||||
*/
|
||||
sstate->cur_eq_comp = ExecBuildGroupingEqual(tupDescLeft, tupDescRight,
|
||||
ncols,
|
||||
|
@ -131,8 +131,8 @@ ValuesNext(ValuesScanState *node)
|
||||
node->ss.ps.subPlan = NIL;
|
||||
|
||||
/*
|
||||
* As the expressions are only ever used once, disable JIT for
|
||||
* them. This is worthwhile because it's common to insert significant
|
||||
* As the expressions are only ever used once, disable JIT for them.
|
||||
* This is worthwhile because it's common to insert significant
|
||||
* amounts of data via VALUES().
|
||||
*/
|
||||
saved_jit_flags = econtext->ecxt_estate->es_jit_flags;
|
||||
|
Reference in New Issue
Block a user