From: Mark Mitchell <mark@codesourcery.com>
Date: Tue, 17 May 2005 18:25:58 +0000 (+0000)
Subject: struct-layout-1_generate.c (iterative_hash): Remove little-endian optimizations.
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=a3a02333fa1c9f0d9fed99707b9da2e51754374d;p=gcc.git

struct-layout-1_generate.c (iterative_hash): Remove little-endian optimizations.

	* gcc.dg/compat/struct-layout-1_generate.c (iterative_hash):
	Remove little-endian optimizations.

From-SVN: r99844
---

diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index 712d9b9f8c6..09e8bfacd2c 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,8 @@
+2005-05-17  Mark Mitchell  <mark@codesourcery.com>
+
+	* gcc.dg/compat/struct-layout-1_generate.c (iterative_hash):
+	Remove little-endian optimizations. 
+
 2005-05-17  Jeff Law  <law@redhat.com>
 
 	* g++.dg/tree-ssa/pr18414.C: New test.
diff --git a/gcc/testsuite/gcc.dg/compat/struct-layout-1_generate.c b/gcc/testsuite/gcc.dg/compat/struct-layout-1_generate.c
index 6c627f0de58..d8b8bfbe0dc 100644
--- a/gcc/testsuite/gcc.dg/compat/struct-layout-1_generate.c
+++ b/gcc/testsuite/gcc.dg/compat/struct-layout-1_generate.c
@@ -1225,21 +1225,6 @@ iterative_hash (const void *k_in /* the key */,
   c = initval;           /* the previous hash value */
 
   /*---------------------------------------- handle most of the key */
-#ifndef WORDS_BIGENDIAN
-  /* On a little-endian machine, if the data is 4-byte aligned we can hash
-     by word for better speed.  This gives nondeterministic results on
-     big-endian machines.  */
-  if (sizeof (hashval_t) == 4 && (((size_t)k)&3) == 0)
-    while (len >= 12)    /* aligned */
-      {
-	a += *(hashval_t *)(k+0);
-	b += *(hashval_t *)(k+4);
-	c += *(hashval_t *)(k+8);
-	mix(a,b,c);
-	k += 12; len -= 12;
-      }
-  else /* unaligned */
-#endif
     while (len >= 12)
       {
 	a += (k[0] +((hashval_t)k[1]<<8) +((hashval_t)k[2]<<16) +((hashval_t)k[3]<<24));