mirror of
https://github.com/postgres/postgres.git
synced 2025-04-20 00:42:27 +03:00
pgindent run prior to branching v13.
pgperltidy and reformat-dat-files too, though those didn't find anything to change.
This commit is contained in:
parent
7247e243a8
commit
b5d69b7c22
@ -2448,8 +2448,8 @@ BuildV1Call(LLVMJitContext *context, LLVMBuilderRef b,
|
|||||||
*v_fcinfo_isnull = LLVMBuildLoad(b, v_fcinfo_isnullp, "");
|
*v_fcinfo_isnull = LLVMBuildLoad(b, v_fcinfo_isnullp, "");
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Add lifetime-end annotation, signaling that writes to memory don't
|
* Add lifetime-end annotation, signaling that writes to memory don't have
|
||||||
* have to be retained (important for inlining potential).
|
* to be retained (important for inlining potential).
|
||||||
*/
|
*/
|
||||||
{
|
{
|
||||||
LLVMValueRef v_lifetime = create_LifetimeEnd(mod);
|
LLVMValueRef v_lifetime = create_LifetimeEnd(mod);
|
||||||
|
@ -2118,9 +2118,9 @@ create_agg_plan(PlannerInfo *root, AggPath *best_path)
|
|||||||
/*
|
/*
|
||||||
* Agg can project, so no need to be terribly picky about child tlist, but
|
* Agg can project, so no need to be terribly picky about child tlist, but
|
||||||
* we do need grouping columns to be available. We are a bit more careful
|
* we do need grouping columns to be available. We are a bit more careful
|
||||||
* with hash aggregate, where we explicitly request small tlist to minimize
|
* with hash aggregate, where we explicitly request small tlist to
|
||||||
* I/O needed for spilling (we can't be sure spilling won't be necessary,
|
* minimize I/O needed for spilling (we can't be sure spilling won't be
|
||||||
* so we just do it every time).
|
* necessary, so we just do it every time).
|
||||||
*/
|
*/
|
||||||
flags = CP_LABEL_TLIST;
|
flags = CP_LABEL_TLIST;
|
||||||
|
|
||||||
@ -2219,9 +2219,9 @@ create_groupingsets_plan(PlannerInfo *root, GroupingSetsPath *best_path)
|
|||||||
/*
|
/*
|
||||||
* Agg can project, so no need to be terribly picky about child tlist, but
|
* Agg can project, so no need to be terribly picky about child tlist, but
|
||||||
* we do need grouping columns to be available. We are a bit more careful
|
* we do need grouping columns to be available. We are a bit more careful
|
||||||
* with hash aggregate, where we explicitly request small tlist to minimize
|
* with hash aggregate, where we explicitly request small tlist to
|
||||||
* I/O needed for spilling (we can't be sure spilling won't be necessary,
|
* minimize I/O needed for spilling (we can't be sure spilling won't be
|
||||||
* so we just do it every time).
|
* necessary, so we just do it every time).
|
||||||
*/
|
*/
|
||||||
flags = CP_LABEL_TLIST;
|
flags = CP_LABEL_TLIST;
|
||||||
|
|
||||||
|
@ -653,8 +653,7 @@ AutoVacLauncherMain(int argc, char *argv[])
|
|||||||
HandleAutoVacLauncherInterrupts();
|
HandleAutoVacLauncherInterrupts();
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* a worker finished, or postmaster signaled failure to start a
|
* a worker finished, or postmaster signaled failure to start a worker
|
||||||
* worker
|
|
||||||
*/
|
*/
|
||||||
if (got_SIGUSR2)
|
if (got_SIGUSR2)
|
||||||
{
|
{
|
||||||
|
@ -170,7 +170,7 @@ typedef struct LogicalTape
|
|||||||
* numbers first).
|
* numbers first).
|
||||||
*/
|
*/
|
||||||
long *prealloc;
|
long *prealloc;
|
||||||
int nprealloc; /* number of elements in list */
|
int nprealloc; /* number of elements in list */
|
||||||
int prealloc_size; /* number of elements list can hold */
|
int prealloc_size; /* number of elements list can hold */
|
||||||
} LogicalTape;
|
} LogicalTape;
|
||||||
|
|
||||||
|
@ -290,7 +290,7 @@ typedef struct TableAmRoutine
|
|||||||
*
|
*
|
||||||
* *call_again is false on the first call to index_fetch_tuple for a tid.
|
* *call_again is false on the first call to index_fetch_tuple for a tid.
|
||||||
* If there potentially is another tuple matching the tid, *call_again
|
* If there potentially is another tuple matching the tid, *call_again
|
||||||
* needs be set to true by index_fetch_tuple, signaling to the caller
|
* needs to be set to true by index_fetch_tuple, signaling to the caller
|
||||||
* that index_fetch_tuple should be called again for the same tid.
|
* that index_fetch_tuple should be called again for the same tid.
|
||||||
*
|
*
|
||||||
* *all_dead, if all_dead is not NULL, should be set to true by
|
* *all_dead, if all_dead is not NULL, should be set to true by
|
||||||
|
@ -1459,7 +1459,6 @@ OffsetVarNodes_context
|
|||||||
Oid
|
Oid
|
||||||
OidOptions
|
OidOptions
|
||||||
OkeysState
|
OkeysState
|
||||||
OldSerXidControl
|
|
||||||
OldSnapshotControlData
|
OldSnapshotControlData
|
||||||
OldToNewMapping
|
OldToNewMapping
|
||||||
OldToNewMappingData
|
OldToNewMappingData
|
||||||
@ -1659,7 +1658,7 @@ PQconninfoOption
|
|||||||
PQnoticeProcessor
|
PQnoticeProcessor
|
||||||
PQnoticeReceiver
|
PQnoticeReceiver
|
||||||
PQprintOpt
|
PQprintOpt
|
||||||
PQsslKeyPassHook_type
|
PQsslKeyPassHook_OpenSSL_type
|
||||||
PREDICATELOCK
|
PREDICATELOCK
|
||||||
PREDICATELOCKTAG
|
PREDICATELOCKTAG
|
||||||
PREDICATELOCKTARGET
|
PREDICATELOCKTARGET
|
||||||
|
Loading…
x
Reference in New Issue
Block a user