aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAlexander Korotkov <akorotkov@postgresql.org>2019-09-25 01:47:36 +0300
committerAlexander Korotkov <akorotkov@postgresql.org>2019-09-25 01:52:55 +0300
commit8728552b291b8fe3778346fb4d4b7d1c8743f708 (patch)
treea733329b3f0a4abbd576f54d7beb693212f3b42f
parent17822c0e4f5ab8093e78f665c9e44766ae648a44 (diff)
downloadpostgresql-8728552b291b8fe3778346fb4d4b7d1c8743f708.tar.gz
postgresql-8728552b291b8fe3778346fb4d4b7d1c8743f708.zip
Fix bug in pairingheap_SpGistSearchItem_cmp()
Our item contains only so->numberOfNonNullOrderBys of distances. Reflect that in the loop upper bound. Discussion: https://postgr.es/m/53536807-784c-e029-6e92-6da802ab8d60%40postgrespro.ru Author: Nikita Glukhov Backpatch-through: 12
-rw-r--r--src/backend/access/spgist/spgscan.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/backend/access/spgist/spgscan.c b/src/backend/access/spgist/spgscan.c
index 37d56771ca5..34983ee5a7c 100644
--- a/src/backend/access/spgist/spgscan.c
+++ b/src/backend/access/spgist/spgscan.c
@@ -56,7 +56,7 @@ pairingheap_SpGistSearchItem_cmp(const pairingheap_node *a,
else
{
/* Order according to distance comparison */
- for (i = 0; i < so->numberOfOrderBys; i++)
+ for (i = 0; i < so->numberOfNonNullOrderBys; i++)
{
if (isnan(sa->distances[i]) && isnan(sb->distances[i]))
continue; /* NaN == NaN */