Some compilers are just too whiny. Nothing makes Microsoft compiler
[openssl.git] / crypto / sha / sha512.c
1 /* crypto/sha/sha512.c */
2 /* ====================================================================
3  * Copyright (c) 2004 The OpenSSL Project.  All rights reserved
4  * according to the OpenSSL license [found in ../../LICENSE].
5  * ====================================================================
6  */
7 /*
8  * IMPLEMENTATION NOTES.
9  *
10  * As you might have noticed 32-bit hash algorithms:
11  *
12  * - permit SHA_LONG to be wider than 32-bit (case on CRAY);
13  * - optimized versions implement two transform functions: one operating
14  *   on [aligned] data in host byte order and one - on data in input
15  *   stream byte order;
16  * - share common byte-order neutral collector and padding function
17  *   implementations, ../md32_common.h;
18  *
19  * Neither of the above applies to this SHA-512 implementations. Reasons
20  * [in reverse order] are:
21  *
22  * - it's the only 64-bit hash algorithm for the moment of this writing,
23  *   there is no need for common collector/padding implementation [yet];
24  * - by supporting only one transform function [which operates on
25  *   *aligned* data in input stream byte order, big-endian in this case]
26  *   we minimize burden of maintenance in two ways: a) collector/padding
27  *   function is simpler; b) only one transform function to stare at;
28  * - SHA_LONG64 is required to be exactly 64-bit in order to be able to
29  *   apply a number of optimizations to mitigate potential performance
30  *   penalties caused by previous design decision;
31  *
32  * Caveat lector.
33  *
34  * Implementation relies on the fact that "long long" is 64-bit on
35  * both 32- and 64-bit platforms. If some compiler vendor comes up
36  * with 128-bit long long, adjustment to sha.h would be required.
37  * As this implementation relies on 64-bit integer type, it's totally
38  * inappropriate for platforms which don't support it, most notably
39  * 16-bit platforms.
40  *                                      <appro@fy.chalmers.se>
41  */
42 #include <stdlib.h>
43 #include <string.h>
44
45 #include <openssl/opensslconf.h>
46 #include <openssl/crypto.h>
47 #include <openssl/sha.h>
48 #include <openssl/opensslv.h>
49
50 const char *SHA512_version="SHA-512" OPENSSL_VERSION_PTEXT;
51
52 #if defined(_M_IX86) || defined(_M_AMD64) || defined(__i386) || defined(__x86_64)
53 #define SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA
54 #endif
55
56 int SHA384_Init (SHA512_CTX *c)
57         {
58         c->h[0]=U64(0xcbbb9d5dc1059ed8);
59         c->h[1]=U64(0x629a292a367cd507);
60         c->h[2]=U64(0x9159015a3070dd17);
61         c->h[3]=U64(0x152fecd8f70e5939);
62         c->h[4]=U64(0x67332667ffc00b31);
63         c->h[5]=U64(0x8eb44a8768581511);
64         c->h[6]=U64(0xdb0c2e0d64f98fa7);
65         c->h[7]=U64(0x47b5481dbefa4fa4);
66         c->Nl=0;        c->Nh=0;
67         c->num=0;       c->md_len=SHA384_DIGEST_LENGTH;
68         return 1;
69         }
70
71 int SHA512_Init (SHA512_CTX *c)
72         {
73         c->h[0]=U64(0x6a09e667f3bcc908);
74         c->h[1]=U64(0xbb67ae8584caa73b);
75         c->h[2]=U64(0x3c6ef372fe94f82b);
76         c->h[3]=U64(0xa54ff53a5f1d36f1);
77         c->h[4]=U64(0x510e527fade682d1);
78         c->h[5]=U64(0x9b05688c2b3e6c1f);
79         c->h[6]=U64(0x1f83d9abfb41bd6b);
80         c->h[7]=U64(0x5be0cd19137e2179);
81         c->Nl=0;        c->Nh=0;
82         c->num=0;       c->md_len=SHA512_DIGEST_LENGTH;
83         return 1;
84         }
85
86 #ifndef SHA512_ASM
87 static
88 #endif
89 void sha512_block (SHA512_CTX *ctx, const void *in, size_t num);
90
91 int SHA512_Final (unsigned char *md, SHA512_CTX *c)
92         {
93         unsigned char *p=(unsigned char *)c->u.p;
94         size_t n=c->num;
95
96         p[n]=0x80;      /* There always is a room for one */
97         n++;
98         if (n > (sizeof(c->u)-16))
99                 memset (p+n,0,sizeof(c->u)-n), n=0,
100                 sha512_block (c,p,1);
101
102         memset (p+n,0,sizeof(c->u)-16-n);
103 #ifdef  B_ENDIAN
104         c->u.d[SHA_LBLOCK-2] = c->Nh;
105         c->u.d[SHA_LBLOCK-1] = c->Nl;
106 #else
107         p[sizeof(c->u)-1]  = (unsigned char)(c->Nl);
108         p[sizeof(c->u)-2]  = (unsigned char)(c->Nl>>8);
109         p[sizeof(c->u)-3]  = (unsigned char)(c->Nl>>16);
110         p[sizeof(c->u)-4]  = (unsigned char)(c->Nl>>24);
111         p[sizeof(c->u)-5]  = (unsigned char)(c->Nl>>32);
112         p[sizeof(c->u)-6]  = (unsigned char)(c->Nl>>40);
113         p[sizeof(c->u)-7]  = (unsigned char)(c->Nl>>48);
114         p[sizeof(c->u)-8]  = (unsigned char)(c->Nl>>56);
115         p[sizeof(c->u)-9]  = (unsigned char)(c->Nh);
116         p[sizeof(c->u)-10] = (unsigned char)(c->Nh>>8);
117         p[sizeof(c->u)-11] = (unsigned char)(c->Nh>>16);
118         p[sizeof(c->u)-12] = (unsigned char)(c->Nh>>24);
119         p[sizeof(c->u)-13] = (unsigned char)(c->Nh>>32);
120         p[sizeof(c->u)-14] = (unsigned char)(c->Nh>>40);
121         p[sizeof(c->u)-15] = (unsigned char)(c->Nh>>48);
122         p[sizeof(c->u)-16] = (unsigned char)(c->Nh>>56);
123 #endif
124
125         sha512_block (c,p,1);
126
127         if (md==0) return 0;
128
129         switch (c->md_len)
130                 {
131                 /* Let compiler decide if it's appropriate to unroll... */
132                 case SHA384_DIGEST_LENGTH:
133                         for (n=0;n<SHA384_DIGEST_LENGTH/8;n++)
134                                 {
135                                 SHA_LONG64 t = c->h[n];
136
137                                 *(md++) = (unsigned char)(t>>56);
138                                 *(md++) = (unsigned char)(t>>48);
139                                 *(md++) = (unsigned char)(t>>40);
140                                 *(md++) = (unsigned char)(t>>32);
141                                 *(md++) = (unsigned char)(t>>24);
142                                 *(md++) = (unsigned char)(t>>16);
143                                 *(md++) = (unsigned char)(t>>8);
144                                 *(md++) = (unsigned char)(t);
145                                 }
146                         break;
147                 case SHA512_DIGEST_LENGTH:
148                         for (n=0;n<SHA512_DIGEST_LENGTH/8;n++)
149                                 {
150                                 SHA_LONG64 t = c->h[n];
151
152                                 *(md++) = (unsigned char)(t>>56);
153                                 *(md++) = (unsigned char)(t>>48);
154                                 *(md++) = (unsigned char)(t>>40);
155                                 *(md++) = (unsigned char)(t>>32);
156                                 *(md++) = (unsigned char)(t>>24);
157                                 *(md++) = (unsigned char)(t>>16);
158                                 *(md++) = (unsigned char)(t>>8);
159                                 *(md++) = (unsigned char)(t);
160                                 }
161                         break;
162                 /* ... as well as make sure md_len is not abused. */
163                 default:        return 0;
164                 }
165
166         return 1;
167         }
168
169 int SHA384_Final (unsigned char *md,SHA512_CTX *c)
170 {   return SHA512_Final (md,c);   }
171
172 int SHA512_Update (SHA512_CTX *c, const void *_data, size_t len)
173         {
174         SHA_LONG64      l;
175         unsigned char  *p=c->u.p;
176         const unsigned char *data=(const unsigned char *)_data;
177
178         if (len==0) return  1;
179
180         l = (c->Nl+(((SHA_LONG64)len)<<3))&U64(0xffffffffffffffff);
181         if (l < c->Nl)          c->Nh++;
182         if (sizeof(len)>=8)     c->Nh+=(((SHA_LONG64)len)>>61);
183         c->Nl=l;
184
185         if (c->num != 0)
186                 {
187                 size_t n = sizeof(c->u) - c->num;
188
189                 if (len < n)
190                         {
191                         memcpy (p+c->num,data,len), c->num += len;
192                         return 1;
193                         }
194                 else    {
195                         memcpy (p+c->num,data,n), c->num = 0;
196                         len-=n, data+=n;
197                         sha512_block (c,p,1);
198                         }
199                 }
200
201         if (len >= sizeof(c->u))
202                 {
203 #ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA
204                 if ((size_t)data%sizeof(c->u.d[0]) != 0)
205                         while (len >= sizeof(c->u))
206                                 memcpy (p,data,sizeof(c->u)),
207                                 sha512_block (c,p,1),
208                                 len  -= sizeof(c->u),
209                                 data += sizeof(c->u);
210                 else
211 #endif
212                         sha512_block (c,data,len/sizeof(c->u)),
213                         data += len,
214                         len  %= sizeof(c->u),
215                         data -= len;
216                 }
217
218         if (len != 0)   memcpy (p,data,len), c->num = (int)len;
219
220         return 1;
221         }
222
223 int SHA384_Update (SHA512_CTX *c, const void *data, size_t len)
224 {   return SHA512_Update (c,data,len);   }
225
226 void SHA512_Transform (SHA512_CTX *c, const unsigned char *data)
227 {   sha512_block (c,data,1);  }
228
229 unsigned char *SHA384(const unsigned char *d, size_t n, unsigned char *md)
230         {
231         SHA512_CTX c;
232         static unsigned char m[SHA384_DIGEST_LENGTH];
233
234         if (md == NULL) md=m;
235         SHA384_Init(&c);
236         SHA512_Update(&c,d,n);
237         SHA512_Final(md,&c);
238         OPENSSL_cleanse(&c,sizeof(c));
239         return(md);
240         }
241
242 unsigned char *SHA512(const unsigned char *d, size_t n, unsigned char *md)
243         {
244         SHA512_CTX c;
245         static unsigned char m[SHA512_DIGEST_LENGTH];
246
247         if (md == NULL) md=m;
248         SHA512_Init(&c);
249         SHA512_Update(&c,d,n);
250         SHA512_Final(md,&c);
251         OPENSSL_cleanse(&c,sizeof(c));
252         return(md);
253         }
254
255 #ifndef SHA512_ASM
256 static const SHA_LONG64 K512[80] = {
257         U64(0x428a2f98d728ae22),U64(0x7137449123ef65cd),
258         U64(0xb5c0fbcfec4d3b2f),U64(0xe9b5dba58189dbbc),
259         U64(0x3956c25bf348b538),U64(0x59f111f1b605d019),
260         U64(0x923f82a4af194f9b),U64(0xab1c5ed5da6d8118),
261         U64(0xd807aa98a3030242),U64(0x12835b0145706fbe),
262         U64(0x243185be4ee4b28c),U64(0x550c7dc3d5ffb4e2),
263         U64(0x72be5d74f27b896f),U64(0x80deb1fe3b1696b1),
264         U64(0x9bdc06a725c71235),U64(0xc19bf174cf692694),
265         U64(0xe49b69c19ef14ad2),U64(0xefbe4786384f25e3),
266         U64(0x0fc19dc68b8cd5b5),U64(0x240ca1cc77ac9c65),
267         U64(0x2de92c6f592b0275),U64(0x4a7484aa6ea6e483),
268         U64(0x5cb0a9dcbd41fbd4),U64(0x76f988da831153b5),
269         U64(0x983e5152ee66dfab),U64(0xa831c66d2db43210),
270         U64(0xb00327c898fb213f),U64(0xbf597fc7beef0ee4),
271         U64(0xc6e00bf33da88fc2),U64(0xd5a79147930aa725),
272         U64(0x06ca6351e003826f),U64(0x142929670a0e6e70),
273         U64(0x27b70a8546d22ffc),U64(0x2e1b21385c26c926),
274         U64(0x4d2c6dfc5ac42aed),U64(0x53380d139d95b3df),
275         U64(0x650a73548baf63de),U64(0x766a0abb3c77b2a8),
276         U64(0x81c2c92e47edaee6),U64(0x92722c851482353b),
277         U64(0xa2bfe8a14cf10364),U64(0xa81a664bbc423001),
278         U64(0xc24b8b70d0f89791),U64(0xc76c51a30654be30),
279         U64(0xd192e819d6ef5218),U64(0xd69906245565a910),
280         U64(0xf40e35855771202a),U64(0x106aa07032bbd1b8),
281         U64(0x19a4c116b8d2d0c8),U64(0x1e376c085141ab53),
282         U64(0x2748774cdf8eeb99),U64(0x34b0bcb5e19b48a8),
283         U64(0x391c0cb3c5c95a63),U64(0x4ed8aa4ae3418acb),
284         U64(0x5b9cca4f7763e373),U64(0x682e6ff3d6b2b8a3),
285         U64(0x748f82ee5defb2fc),U64(0x78a5636f43172f60),
286         U64(0x84c87814a1f0ab72),U64(0x8cc702081a6439ec),
287         U64(0x90befffa23631e28),U64(0xa4506cebde82bde9),
288         U64(0xbef9a3f7b2c67915),U64(0xc67178f2e372532b),
289         U64(0xca273eceea26619c),U64(0xd186b8c721c0c207),
290         U64(0xeada7dd6cde0eb1e),U64(0xf57d4f7fee6ed178),
291         U64(0x06f067aa72176fba),U64(0x0a637dc5a2c898a6),
292         U64(0x113f9804bef90dae),U64(0x1b710b35131c471b),
293         U64(0x28db77f523047d84),U64(0x32caab7b40c72493),
294         U64(0x3c9ebe0a15c9bebc),U64(0x431d67c49c100d4c),
295         U64(0x4cc5d4becb3e42b6),U64(0x597f299cfc657e2a),
296         U64(0x5fcb6fab3ad6faec),U64(0x6c44198c4a475817) };
297
298 #ifndef PEDANTIC
299 # if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
300 #  if defined(__x86_64) || defined(__x86_64__)
301 #   define PULL64(x) ({ SHA_LONG64 ret=*((const SHA_LONG64 *)(&(x)));   \
302                                 asm ("bswapq    %0"             \
303                                 : "=r"(ret)                     \
304                                 : "0"(ret)); ret;               })
305 #  endif
306 # endif
307 #endif
308
309 #ifndef PULL64
310 #define B(x,j)    (((SHA_LONG64)(*(((const unsigned char *)(&x))+j)))<<((7-j)*8))
311 #define PULL64(x) (B(x,0)|B(x,1)|B(x,2)|B(x,3)|B(x,4)|B(x,5)|B(x,6)|B(x,7))
312 #endif
313
314 #ifndef PEDANTIC
315 # if defined(_MSC_VER)
316 #  if defined(_WIN64)   /* applies to both IA-64 and AMD64 */
317 #   define ROTR(a,n)    _rotr64((a),n)
318 #  endif
319 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
320 #  if defined(__x86_64) || defined(__x86_64__)
321 #   define ROTR(a,n)    ({ unsigned long ret;           \
322                                 asm ("rorq %1,%0"       \
323                                 : "=r"(ret)             \
324                                 : "J"(n),"0"(a)         \
325                                 : "cc"); ret;           })
326 #  elif defined(_ARCH_PPC) && defined(__64BIT__)
327 #   define ROTR(a,n)    ({ unsigned long ret;           \
328                                 asm ("rotrdi %0,%1,%2"  \
329                                 : "=r"(ret)             \
330                                 : "r"(a),"K"(n)); ret;  })
331 #  endif
332 # endif
333 #endif
334
335 #ifndef ROTR
336 #define ROTR(x,s)       (((x)>>s) | (x)<<(64-s))
337 #endif
338
339 #define Sigma0(x)       (ROTR((x),28) ^ ROTR((x),34) ^ ROTR((x),39))
340 #define Sigma1(x)       (ROTR((x),14) ^ ROTR((x),18) ^ ROTR((x),41))
341 #define sigma0(x)       (ROTR((x),1)  ^ ROTR((x),8)  ^ ((x)>>7))
342 #define sigma1(x)       (ROTR((x),19) ^ ROTR((x),61) ^ ((x)>>6))
343
344 #define Ch(x,y,z)       (((x) & (y)) ^ ((~(x)) & (z)))
345 #define Maj(x,y,z)      (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
346
347 #if defined(OPENSSL_IA32_SSE2) && !defined(OPENSSL_NO_ASM)
348 #define GO_FOR_SSE2(ctx,in,num)         do {            \
349         extern int      OPENSSL_ia32cap;                \
350         void            sha512_block_sse2(void *,const void *,size_t);  \
351         if (!(OPENSSL_ia32cap & (1<<26))) break;        \
352         sha512_block_sse2(ctx->h,in,num); return;       \
353                                         } while (0)
354 #endif
355
356 #ifdef OPENSSL_SMALL_FOOTPRINT
357
358 static void sha512_block (SHA512_CTX *ctx, const void *in, size_t num)
359         {
360         const SHA_LONG64 *W=in;
361         SHA_LONG64      a,b,c,d,e,f,g,h,s0,s1,T1,T2;
362         SHA_LONG64      X[16];
363         int i;
364
365 #ifdef GO_FOR_SSE2
366         GO_FOR_SSE2(ctx,in,num);
367 #endif
368
369                         while (num--) {
370
371         a = ctx->h[0];  b = ctx->h[1];  c = ctx->h[2];  d = ctx->h[3];
372         e = ctx->h[4];  f = ctx->h[5];  g = ctx->h[6];  h = ctx->h[7];
373
374         for (i=0;i<16;i++)
375                 {
376 #ifdef B_ENDIAN
377                 T1 = X[i] = W[i];
378 #else
379                 T1 = X[i] = PULL64(W[i]);
380 #endif
381                 T1 += h + Sigma1(e) + Ch(e,f,g) + K512[i];
382                 T2 = Sigma0(a) + Maj(a,b,c);
383                 h = g;  g = f;  f = e;  e = d + T1;
384                 d = c;  c = b;  b = a;  a = T1 + T2;
385                 }
386
387         for (;i<80;i++)
388                 {
389                 s0 = X[(i+1)&0x0f];     s0 = sigma0(s0);
390                 s1 = X[(i+14)&0x0f];    s1 = sigma1(s1);
391
392                 T1 = X[i&0xf] += s0 + s1 + X[(i+9)&0xf];
393                 T1 += h + Sigma1(e) + Ch(e,f,g) + K512[i];
394                 T2 = Sigma0(a) + Maj(a,b,c);
395                 h = g;  g = f;  f = e;  e = d + T1;
396                 d = c;  c = b;  b = a;  a = T1 + T2;
397                 }
398
399         ctx->h[0] += a; ctx->h[1] += b; ctx->h[2] += c; ctx->h[3] += d;
400         ctx->h[4] += e; ctx->h[5] += f; ctx->h[6] += g; ctx->h[7] += h;
401
402                         W+=SHA_LBLOCK;
403                         }
404         }
405
406 #else
407
408 #define ROUND_00_15(i,a,b,c,d,e,f,g,h)          do {    \
409         T1 += h + Sigma1(e) + Ch(e,f,g) + K512[i];      \
410         h = Sigma0(a) + Maj(a,b,c);                     \
411         d += T1;        h += T1;                } while (0)
412
413 #define ROUND_16_80(i,a,b,c,d,e,f,g,h,X)        do {    \
414         s0 = X[(i+1)&0x0f];     s0 = sigma0(s0);        \
415         s1 = X[(i+14)&0x0f];    s1 = sigma1(s1);        \
416         T1 = X[(i)&0x0f] += s0 + s1 + X[(i+9)&0x0f];    \
417         ROUND_00_15(i,a,b,c,d,e,f,g,h);         } while (0)
418
419 static void sha512_block (SHA512_CTX *ctx, const void *in, size_t num)
420         {
421         const SHA_LONG64 *W=in;
422         SHA_LONG64      a,b,c,d,e,f,g,h,s0,s1,T1;
423         SHA_LONG64      X[16];
424         int i;
425
426 #ifdef GO_FOR_SSE2
427         GO_FOR_SSE2(ctx,in,num);
428 #endif
429
430                         while (num--) {
431
432         a = ctx->h[0];  b = ctx->h[1];  c = ctx->h[2];  d = ctx->h[3];
433         e = ctx->h[4];  f = ctx->h[5];  g = ctx->h[6];  h = ctx->h[7];
434
435 #ifdef B_ENDIAN
436         T1 = X[0] = W[0];       ROUND_00_15(0,a,b,c,d,e,f,g,h);
437         T1 = X[1] = W[1];       ROUND_00_15(1,h,a,b,c,d,e,f,g);
438         T1 = X[2] = W[2];       ROUND_00_15(2,g,h,a,b,c,d,e,f);
439         T1 = X[3] = W[3];       ROUND_00_15(3,f,g,h,a,b,c,d,e);
440         T1 = X[4] = W[4];       ROUND_00_15(4,e,f,g,h,a,b,c,d);
441         T1 = X[5] = W[5];       ROUND_00_15(5,d,e,f,g,h,a,b,c);
442         T1 = X[6] = W[6];       ROUND_00_15(6,c,d,e,f,g,h,a,b);
443         T1 = X[7] = W[7];       ROUND_00_15(7,b,c,d,e,f,g,h,a);
444         T1 = X[8] = W[8];       ROUND_00_15(8,a,b,c,d,e,f,g,h);
445         T1 = X[9] = W[9];       ROUND_00_15(9,h,a,b,c,d,e,f,g);
446         T1 = X[10] = W[10];     ROUND_00_15(10,g,h,a,b,c,d,e,f);
447         T1 = X[11] = W[11];     ROUND_00_15(11,f,g,h,a,b,c,d,e);
448         T1 = X[12] = W[12];     ROUND_00_15(12,e,f,g,h,a,b,c,d);
449         T1 = X[13] = W[13];     ROUND_00_15(13,d,e,f,g,h,a,b,c);
450         T1 = X[14] = W[14];     ROUND_00_15(14,c,d,e,f,g,h,a,b);
451         T1 = X[15] = W[15];     ROUND_00_15(15,b,c,d,e,f,g,h,a);
452 #else
453         T1 = X[0]  = PULL64(W[0]);      ROUND_00_15(0,a,b,c,d,e,f,g,h);
454         T1 = X[1]  = PULL64(W[1]);      ROUND_00_15(1,h,a,b,c,d,e,f,g);
455         T1 = X[2]  = PULL64(W[2]);      ROUND_00_15(2,g,h,a,b,c,d,e,f);
456         T1 = X[3]  = PULL64(W[3]);      ROUND_00_15(3,f,g,h,a,b,c,d,e);
457         T1 = X[4]  = PULL64(W[4]);      ROUND_00_15(4,e,f,g,h,a,b,c,d);
458         T1 = X[5]  = PULL64(W[5]);      ROUND_00_15(5,d,e,f,g,h,a,b,c);
459         T1 = X[6]  = PULL64(W[6]);      ROUND_00_15(6,c,d,e,f,g,h,a,b);
460         T1 = X[7]  = PULL64(W[7]);      ROUND_00_15(7,b,c,d,e,f,g,h,a);
461         T1 = X[8]  = PULL64(W[8]);      ROUND_00_15(8,a,b,c,d,e,f,g,h);
462         T1 = X[9]  = PULL64(W[9]);      ROUND_00_15(9,h,a,b,c,d,e,f,g);
463         T1 = X[10] = PULL64(W[10]);     ROUND_00_15(10,g,h,a,b,c,d,e,f);
464         T1 = X[11] = PULL64(W[11]);     ROUND_00_15(11,f,g,h,a,b,c,d,e);
465         T1 = X[12] = PULL64(W[12]);     ROUND_00_15(12,e,f,g,h,a,b,c,d);
466         T1 = X[13] = PULL64(W[13]);     ROUND_00_15(13,d,e,f,g,h,a,b,c);
467         T1 = X[14] = PULL64(W[14]);     ROUND_00_15(14,c,d,e,f,g,h,a,b);
468         T1 = X[15] = PULL64(W[15]);     ROUND_00_15(15,b,c,d,e,f,g,h,a);
469 #endif
470
471         for (i=16;i<80;i+=8)
472                 {
473                 ROUND_16_80(i+0,a,b,c,d,e,f,g,h,X);
474                 ROUND_16_80(i+1,h,a,b,c,d,e,f,g,X);
475                 ROUND_16_80(i+2,g,h,a,b,c,d,e,f,X);
476                 ROUND_16_80(i+3,f,g,h,a,b,c,d,e,X);
477                 ROUND_16_80(i+4,e,f,g,h,a,b,c,d,X);
478                 ROUND_16_80(i+5,d,e,f,g,h,a,b,c,X);
479                 ROUND_16_80(i+6,c,d,e,f,g,h,a,b,X);
480                 ROUND_16_80(i+7,b,c,d,e,f,g,h,a,X);
481                 }
482
483         ctx->h[0] += a; ctx->h[1] += b; ctx->h[2] += c; ctx->h[3] += d;
484         ctx->h[4] += e; ctx->h[5] += f; ctx->h[6] += g; ctx->h[7] += h;
485
486                         W+=SHA_LBLOCK;
487                         }
488         }
489
490 #endif
491
492 #endif /* SHA512_ASM */