rdelaage
/
postgresql
mirror of https://git.postgresql.org/git/postgresql.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Improve comments about abbreviation abort. 

Peter Geoghegan
This commit is contained in:
Robert Haas 2015-11-03 14:11:49 -05:00
parent f18c944b61
commit ee44cb7566
1 changed files with 20 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
src/backend/utils/sort/tuplesort.c
View File

@ -1294,8 +1294,10 @@ tuplesort_putindextuplevalues(Tuplesortstate *state, Relation rel,
* *
* Alter datum1 representation in already-copied tuples, so as to * Alter datum1 representation in already-copied tuples, so as to
* ensure a consistent representation (current tuple was just * ensure a consistent representation (current tuple was just
* handled). Note that we rely on all tuples copied so far actually * handled). It does not matter if some dumped tuples are already
* being contained within memtuples array. * sorted on tape, since serialized tuples lack abbreviated keys
* (TSS_BUILDRUNS state prevents control reaching here in any
* case).
*/ */
for (i = 0; i < state->memtupcount; i++) for (i = 0; i < state->memtupcount; i++)
{ {
@ -1373,8 +1375,10 @@ tuplesort_putdatum(Tuplesortstate *state, Datum val, bool isNull)
* *
* Alter datum1 representation in already-copied tuples, so as to * Alter datum1 representation in already-copied tuples, so as to
* ensure a consistent representation (current tuple was just * ensure a consistent representation (current tuple was just
* handled). Note that we rely on all tuples copied so far * handled). It does not matter if some dumped tuples are
* actually being contained within memtuples array. * already sorted on tape, since serialized tuples lack
* abbreviated keys (TSS_BUILDRUNS state prevents control
* reaching here in any case).
*/ */
for (i = 0; i < state->memtupcount; i++) for (i = 0; i < state->memtupcount; i++)
{ {
@ -3174,8 +3178,10 @@ copytup_heap(Tuplesortstate *state, SortTuple *stup, void *tup)
* *
* Alter datum1 representation in already-copied tuples, so as to * Alter datum1 representation in already-copied tuples, so as to
* ensure a consistent representation (current tuple was just * ensure a consistent representation (current tuple was just
* handled). Note that we rely on all tuples copied so far actually * handled). It does not matter if some dumped tuples are already
* being contained within memtuples array. * sorted on tape, since serialized tuples lack abbreviated keys
* (TSS_BUILDRUNS state prevents control reaching here in any
* case).
*/ */
for (i = 0; i < state->memtupcount; i++) for (i = 0; i < state->memtupcount; i++)
{ {
@ -3414,8 +3420,10 @@ copytup_cluster(Tuplesortstate *state, SortTuple *stup, void *tup)
* *
* Alter datum1 representation in already-copied tuples, so as to * Alter datum1 representation in already-copied tuples, so as to
* ensure a consistent representation (current tuple was just * ensure a consistent representation (current tuple was just
* handled). Note that we rely on all tuples copied so far actually * handled). It does not matter if some dumped tuples are already
* being contained within memtuples array. * sorted on tape, since serialized tuples lack abbreviated keys
* (TSS_BUILDRUNS state prevents control reaching here in any
* case).
*/ */
for (i = 0; i < state->memtupcount; i++) for (i = 0; i < state->memtupcount; i++)
{ {
@ -3716,8 +3724,10 @@ copytup_index(Tuplesortstate *state, SortTuple *stup, void *tup)
* *
* Alter datum1 representation in already-copied tuples, so as to * Alter datum1 representation in already-copied tuples, so as to
* ensure a consistent representation (current tuple was just * ensure a consistent representation (current tuple was just
* handled). Note that we rely on all tuples copied so far actually * handled). It does not matter if some dumped tuples are already
* being contained within memtuples array. * sorted on tape, since serialized tuples lack abbreviated keys
* (TSS_BUILDRUNS state prevents control reaching here in any
* case).
*/ */
for (i = 0; i < state->memtupcount; i++) for (i = 0; i < state->memtupcount; i++)
{ {