Update comment.

The _bt_tuplecompare() function mentioned in comment hasn't existed for a
long time.

Peter Geoghegan

diff --git a/src/backend/utils/sort/tuplesort.c b/src/backend/utils/sort/tuplesort.c
index 8e57505eddc48c7f1042e417d08789680f580e6a..2d15da0bfa796d9303e9597f496e19e40c3e50aa 100644 (file)
--- a/src/backend/utils/sort/tuplesort.c
+++ b/src/backend/utils/sort/tuplesort.c
@@ -3176,9 +3176,8 @@ comparetup_index_btree(const SortTuple *a, const SortTuple *b,
                                           Tuplesortstate *state)
 {
        /*
-        * This is similar to _bt_tuplecompare(), but we have already done the
-        * index_getattr calls for the first column, and we need to keep track of
-        * whether any null fields are present.  Also see the special treatment
+        * This is similar to comparetup_heap(), but expects index tuples.  There
+        * is also special handling for enforcing uniqueness, and special treatment
         * for equal keys at the end.
         */
        ScanKey         scanKey = state->indexScanKey;