(msort_with_tmp): Fixed alignment test. B1 and B2 are always congruent; just test...

diff --git a/stdlib/msort.c b/stdlib/msort.c
index 959aaa3dda0e2a1d83b5007ea19e94d98719c524..21fbbfb2bfa840722af17929e3b2f84410598d22 100644 (file)
--- a/stdlib/msort.c
+++ b/stdlib/msort.c
@@ -45,7 +45,7 @@ DEFUN(msort_with_tmp, (b, n, s, cmp, t),
 
   tmp = t;
 
-  if (s == OPSIZ && (b1 - b2) % OPSIZ == 0)
+  if (s == OPSIZ && (b1 - (char *) 0) % OPSIZ == 0)
     /* We are operating on aligned words.  Use direct word stores.  */
     while (n1 > 0 && n2 > 0)
       {