Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitb0b64f6

Browse files
committed
Attempt to fix breakage due to declaration following code.
Per Tom Lane and the buildfarm.
1 parent2f1d2b7 commitb0b64f6

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

‎src/backend/utils/sort/tuplesort.c

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -2357,11 +2357,6 @@ inittapes(Tuplesortstate *state)
23572357

23582358
if (state->replaceActive)
23592359
{
2360-
#ifdefTRACE_SORT
2361-
if (trace_sort)
2362-
elog(LOG,"replacement selection will sort %d first run tuples",
2363-
state->memtupcount);
2364-
#endif
23652360
/*
23662361
* Convert the unsorted contents of memtuples[] into a heap. Each
23672362
* tuple is marked as belonging to run number zero.
@@ -2372,6 +2367,11 @@ inittapes(Tuplesortstate *state)
23722367
*/
23732368
intntuples=state->memtupcount;
23742369

2370+
#ifdefTRACE_SORT
2371+
if (trace_sort)
2372+
elog(LOG,"replacement selection will sort %d first run tuples",
2373+
state->memtupcount);
2374+
#endif
23752375
state->memtupcount=0;/* make the heap empty */
23762376

23772377
for (j=0;j<ntuples;j++)

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp