expand h

1 files changed, 33 insertions, 17 deletions

diff --git a/test/monniaux/sha-2/sha-256.c b/test/monniaux/sha-2/sha-256.c
index 821995e1..6ac1dbd3 100644
--- a/test/monniaux/sha-2/sha-256.c
+++ b/test/monniaux/sha-2/sha-256.c
@@ -144,7 +144,7 @@ static int calc_chunk(uint8_t chunk[CHUNK_SIZE], struct buffer_state * state)
  *   for bit string lengths that are not multiples of eight, and it really operates on arrays of bytes.
  *   In particular, the len parameter is a number of bytes.
  */
-#define DO_NOT_UNROLL 1
+/* #define DO_NOT_UNROLL 1 */
 #define AUTOINCREMENT 1
 
 #if USE_ORIGINAL
@@ -379,6 +379,14 @@ void calc_sha_256(uint8_t hash[32], const void * input, size_t len)
 	 * (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):
 	 */
 	uint32_t h[] = { 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 };
+	uint32_t h0 = h[0];
+	uint32_t h1 = h[1];
+	uint32_t h2 = h[2];
+	uint32_t h3 = h[3];
+	uint32_t h4 = h[4];
+	uint32_t h5 = h[5];
+	uint32_t h6 = h[6];
+	uint32_t h7 = h[7];
 	int i, j;
 
 	/* 512-bit chunks is what we will operate on. */
@@ -414,14 +422,14 @@ void calc_sha_256(uint8_t hash[32], const void * input, size_t len)
 		}
 		
 		/* Initialize working variables to current hash value: */
-		ah0 = h[0];
-		ah1 = h[1];
-		ah2 = h[2];
-		ah3 = h[3];
-		ah4 = h[4];
-		ah5 = h[5];
-		ah6 = h[6];
-		ah7 = h[7];
+		ah0 = h0;
+		ah1 = h1;
+		ah2 = h2;
+		ah3 = h3;
+		ah4 = h4;
+		ah5 = h5;
+		ah6 = h6;
+		ah7 = h7;
 
 		/* Compression function main loop: */
 		for (i = 0; i < 64; ) {
@@ -572,15 +580,23 @@ void calc_sha_256(uint8_t hash[32], const void * input, size_t len)
 		}
 
 		/* Add the compressed chunk to the current hash value: */
-		h[0] += ah0;
-		h[1] += ah1;
-		h[2] += ah2;
-		h[3] += ah3;
-		h[4] += ah4;
-		h[5] += ah5;
-		h[6] += ah6;
-		h[7] += ah7;
+		h0 += ah0;
+		h1 += ah1;
+		h2 += ah2;
+		h3 += ah3;
+		h4 += ah4;
+		h5 += ah5;
+		h6 += ah6;
+		h7 += ah7;
 	}
+	h[0]=h0;
+	h[1]=h1;
+	h[2]=h2;
+	h[3]=h3;
+	h[4]=h4;
+	h[5]=h5;
+	h[6]=h6;
+	h[7]=h7;
 
 	/* Produce the final hash value (big-endian): */
 	for (i = 0, j = 0; i < 8; i++)