diff options
| author | Alexander Korotkov <akorotkov@postgresql.org> | 2019-09-08 21:07:30 +0300 |
|---|---|---|
| committer | Alexander Korotkov <akorotkov@postgresql.org> | 2019-09-08 21:49:15 +0300 |
| commit | 986319d467cfefaa54b5cb72e063e28b66f04d42 (patch) | |
| tree | 665f42f43aa4587858de804533a39fe475a45aab | |
| parent | f1a9abe61fef1be9a6085baa2856f2c51d508728 (diff) | |
| download | postgresql-986319d467cfefaa54b5cb72e063e28b66f04d42.tar.gz postgresql-986319d467cfefaa54b5cb72e063e28b66f04d42.zip | |
Fix handling Inf and Nan values in GiST pairing heap comparator
Previously plain float comparison was used in GiST pairing heap. Such
comparison doesn't provide proper ordering for value sets containing Inf and Nan
values. This commit fixes that by usage of float8_cmp_internal(). Note, there
is remaining problem with NULL distances, which are represented as Inf in
pairing heap. It would be fixes in subsequent commit.
Backpatch to all supported versions.
Reported-by: Andrey Borodin
Discussion: https://postgr.es/m/CAPpHfdsNvNdA0DBS%2BwMpFrgwT6C3-q50sFVGLSiuWnV3FqOJuQ%40mail.gmail.com
Author: Alexander Korotkov
Reviewed-by: Heikki Linnakangas
Backpatch-through: 9.4
| -rw-r--r-- | src/backend/access/gist/gistscan.c | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/src/backend/access/gist/gistscan.c b/src/backend/access/gist/gistscan.c index cde9e794967..ff28ad8423f 100644 --- a/src/backend/access/gist/gistscan.c +++ b/src/backend/access/gist/gistscan.c @@ -17,6 +17,7 @@ #include "access/gist_private.h" #include "access/gistscan.h" #include "access/relscan.h" +#include "utils/builtins.h" #include "utils/lsyscache.h" #include "utils/memutils.h" #include "utils/rel.h" @@ -36,8 +37,10 @@ pairingheap_GISTSearchItem_cmp(const pairingheap_node *a, const pairingheap_node /* Order according to distance comparison */ for (i = 0; i < scan->numberOfOrderBys; i++) { - if (sa->distances[i] != sb->distances[i]) - return (sa->distances[i] < sb->distances[i]) ? 1 : -1; + int cmp = -float8_cmp_internal(sa->distances[i], sb->distances[i]); + + if (cmp != 0) + return cmp; } /* Heap items go before inner pages, to ensure a depth-first search */ |