postgrespro.git / summary / log / commit / refs

commit    90c0987258264de07780f0329db2fce83098fba8
Author:   Alexander Korotkov <akorotkov@postgresql.org>
Date:     Tue Sep 24 22:47:36 2019 +0000

    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


 src/backend/access/spgist/spgscan.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/backend/access/spgist/spgscan.c b/src/backend/access/spgist/spgscan.c
index cfba47067c..6e940fd3de 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 */


[parent: 709d003fbd98]