sha_locl.h 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  1. /* crypto/sha/sha_locl.h */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young (eay@cryptsoft.com).
  7. * The implementation was written so as to conform with Netscapes SSL.
  8. *
  9. * This library is free for commercial and non-commercial use as long as
  10. * the following conditions are aheared to. The following conditions
  11. * apply to all code found in this distribution, be it the RC4, RSA,
  12. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  13. * included with this distribution is covered by the same copyright terms
  14. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15. *
  16. * Copyright remains Eric Young's, and as such any Copyright notices in
  17. * the code are not to be removed.
  18. * If this package is used in a product, Eric Young should be given attribution
  19. * as the author of the parts of the library used.
  20. * This can be in the form of a textual message at program startup or
  21. * in documentation (online or textual) provided with the package.
  22. *
  23. * Redistribution and use in source and binary forms, with or without
  24. * modification, are permitted provided that the following conditions
  25. * are met:
  26. * 1. Redistributions of source code must retain the copyright
  27. * notice, this list of conditions and the following disclaimer.
  28. * 2. Redistributions in binary form must reproduce the above copyright
  29. * notice, this list of conditions and the following disclaimer in the
  30. * documentation and/or other materials provided with the distribution.
  31. * 3. All advertising materials mentioning features or use of this software
  32. * must display the following acknowledgement:
  33. * "This product includes cryptographic software written by
  34. * Eric Young (eay@cryptsoft.com)"
  35. * The word 'cryptographic' can be left out if the rouines from the library
  36. * being used are not cryptographic related :-).
  37. * 4. If you include any Windows specific code (or a derivative thereof) from
  38. * the apps directory (application code) you must include an acknowledgement:
  39. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40. *
  41. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51. * SUCH DAMAGE.
  52. *
  53. * The licence and distribution terms for any publically available version or
  54. * derivative of this code cannot be changed. i.e. this code cannot simply be
  55. * copied and put under another distribution licence
  56. * [including the GNU Public Licence.]
  57. */
  58. #include <stdlib.h>
  59. #include <string.h>
  60. #include <openssl/opensslconf.h>
  61. #include <openssl/sha.h>
  62. #ifndef SHA_LONG_LOG2
  63. #define SHA_LONG_LOG2 2 /* default to 32 bits */
  64. #endif
  65. #define DATA_ORDER_IS_BIG_ENDIAN
  66. #define HASH_LONG SHA_LONG
  67. #define HASH_LONG_LOG2 SHA_LONG_LOG2
  68. #define HASH_CTX SHA_CTX
  69. #define HASH_CBLOCK SHA_CBLOCK
  70. #define HASH_LBLOCK SHA_LBLOCK
  71. #define HASH_MAKE_STRING(c,s) do { \
  72. unsigned long ll; \
  73. ll=(c)->h0; HOST_l2c(ll,(s)); \
  74. ll=(c)->h1; HOST_l2c(ll,(s)); \
  75. ll=(c)->h2; HOST_l2c(ll,(s)); \
  76. ll=(c)->h3; HOST_l2c(ll,(s)); \
  77. ll=(c)->h4; HOST_l2c(ll,(s)); \
  78. } while (0)
  79. #if defined(SHA_0)
  80. # define HASH_UPDATE SHA_Update
  81. # define HASH_TRANSFORM SHA_Transform
  82. # define HASH_FINAL SHA_Final
  83. # define HASH_INIT SHA_Init
  84. # define HASH_BLOCK_HOST_ORDER sha_block_host_order
  85. # define HASH_BLOCK_DATA_ORDER sha_block_data_order
  86. # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id))
  87. void sha_block_host_order (SHA_CTX *c, const void *p,int num);
  88. void sha_block_data_order (SHA_CTX *c, const void *p,int num);
  89. #elif defined(SHA_1)
  90. # define HASH_UPDATE SHA1_Update
  91. # define HASH_TRANSFORM SHA1_Transform
  92. # define HASH_FINAL SHA1_Final
  93. # define HASH_INIT SHA1_Init
  94. # define HASH_BLOCK_HOST_ORDER sha1_block_host_order
  95. # define HASH_BLOCK_DATA_ORDER sha1_block_data_order
  96. # if defined(__MWERKS__) && defined(__MC68K__)
  97. /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
  98. # define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \
  99. ix=(a)=ROTATE((a),1); \
  100. } while (0)
  101. # else
  102. # define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
  103. ix=(a)=ROTATE((a),1) \
  104. )
  105. # endif
  106. # ifdef SHA1_ASM
  107. # if defined(__i386) || defined(_M_IX86) || defined(__INTEL__)
  108. # define sha1_block_host_order sha1_block_asm_host_order
  109. # define DONT_IMPLEMENT_BLOCK_HOST_ORDER
  110. # define sha1_block_data_order sha1_block_asm_data_order
  111. # define DONT_IMPLEMENT_BLOCK_DATA_ORDER
  112. # define HASH_BLOCK_DATA_ORDER_ALIGNED sha1_block_asm_data_order
  113. # endif
  114. # endif
  115. void sha1_block_host_order (SHA_CTX *c, const void *p,int num);
  116. void sha1_block_data_order (SHA_CTX *c, const void *p,int num);
  117. #else
  118. # error "Either SHA_0 or SHA_1 must be defined."
  119. #endif
  120. #include "md32_common.h"
  121. #define INIT_DATA_h0 0x67452301UL
  122. #define INIT_DATA_h1 0xefcdab89UL
  123. #define INIT_DATA_h2 0x98badcfeUL
  124. #define INIT_DATA_h3 0x10325476UL
  125. #define INIT_DATA_h4 0xc3d2e1f0UL
  126. int HASH_INIT (SHA_CTX *c)
  127. {
  128. c->h0=INIT_DATA_h0;
  129. c->h1=INIT_DATA_h1;
  130. c->h2=INIT_DATA_h2;
  131. c->h3=INIT_DATA_h3;
  132. c->h4=INIT_DATA_h4;
  133. c->Nl=0;
  134. c->Nh=0;
  135. c->num=0;
  136. return 1;
  137. }
  138. #define K_00_19 0x5a827999UL
  139. #define K_20_39 0x6ed9eba1UL
  140. #define K_40_59 0x8f1bbcdcUL
  141. #define K_60_79 0xca62c1d6UL
  142. /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
  143. * simplified to the code in F_00_19. Wei attributes these optimisations
  144. * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
  145. * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
  146. * I've just become aware of another tweak to be made, again from Wei Dai,
  147. * in F_40_59, (x&a)|(y&a) -> (x|y)&a
  148. */
  149. #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
  150. #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
  151. #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
  152. #define F_60_79(b,c,d) F_20_39(b,c,d)
  153. #define BODY_00_15(i,a,b,c,d,e,f,xi) \
  154. (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
  155. (b)=ROTATE((b),30);
  156. #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
  157. Xupdate(f,xi,xa,xb,xc,xd); \
  158. (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
  159. (b)=ROTATE((b),30);
  160. #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
  161. Xupdate(f,xi,xa,xb,xc,xd); \
  162. (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
  163. (b)=ROTATE((b),30);
  164. #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
  165. Xupdate(f,xa,xa,xb,xc,xd); \
  166. (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
  167. (b)=ROTATE((b),30);
  168. #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
  169. Xupdate(f,xa,xa,xb,xc,xd); \
  170. (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
  171. (b)=ROTATE((b),30);
  172. #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
  173. Xupdate(f,xa,xa,xb,xc,xd); \
  174. (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
  175. (b)=ROTATE((b),30);
  176. #ifdef X
  177. #undef X
  178. #endif
  179. #ifndef MD32_XARRAY
  180. /*
  181. * Originally X was an array. As it's automatic it's natural
  182. * to expect RISC compiler to accomodate at least part of it in
  183. * the register bank, isn't it? Unfortunately not all compilers
  184. * "find" this expectation reasonable:-( On order to make such
  185. * compilers generate better code I replace X[] with a bunch of
  186. * X0, X1, etc. See the function body below...
  187. * <appro@fy.chalmers.se>
  188. */
  189. # define X(i) XX##i
  190. #else
  191. /*
  192. * However! Some compilers (most notably HP C) get overwhelmed by
  193. * that many local variables so that we have to have the way to
  194. * fall down to the original behavior.
  195. */
  196. # define X(i) XX[i]
  197. #endif
  198. #ifndef DONT_IMPLEMENT_BLOCK_HOST_ORDER
  199. void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num)
  200. {
  201. const SHA_LONG *W=d;
  202. register unsigned long A,B,C,D,E,T;
  203. #ifndef MD32_XARRAY
  204. unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
  205. XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
  206. #else
  207. SHA_LONG XX[16];
  208. #endif
  209. A=c->h0;
  210. B=c->h1;
  211. C=c->h2;
  212. D=c->h3;
  213. E=c->h4;
  214. for (;;)
  215. {
  216. BODY_00_15( 0,A,B,C,D,E,T,W[ 0]);
  217. BODY_00_15( 1,T,A,B,C,D,E,W[ 1]);
  218. BODY_00_15( 2,E,T,A,B,C,D,W[ 2]);
  219. BODY_00_15( 3,D,E,T,A,B,C,W[ 3]);
  220. BODY_00_15( 4,C,D,E,T,A,B,W[ 4]);
  221. BODY_00_15( 5,B,C,D,E,T,A,W[ 5]);
  222. BODY_00_15( 6,A,B,C,D,E,T,W[ 6]);
  223. BODY_00_15( 7,T,A,B,C,D,E,W[ 7]);
  224. BODY_00_15( 8,E,T,A,B,C,D,W[ 8]);
  225. BODY_00_15( 9,D,E,T,A,B,C,W[ 9]);
  226. BODY_00_15(10,C,D,E,T,A,B,W[10]);
  227. BODY_00_15(11,B,C,D,E,T,A,W[11]);
  228. BODY_00_15(12,A,B,C,D,E,T,W[12]);
  229. BODY_00_15(13,T,A,B,C,D,E,W[13]);
  230. BODY_00_15(14,E,T,A,B,C,D,W[14]);
  231. BODY_00_15(15,D,E,T,A,B,C,W[15]);
  232. BODY_16_19(16,C,D,E,T,A,B,X( 0),W[ 0],W[ 2],W[ 8],W[13]);
  233. BODY_16_19(17,B,C,D,E,T,A,X( 1),W[ 1],W[ 3],W[ 9],W[14]);
  234. BODY_16_19(18,A,B,C,D,E,T,X( 2),W[ 2],W[ 4],W[10],W[15]);
  235. BODY_16_19(19,T,A,B,C,D,E,X( 3),W[ 3],W[ 5],W[11],X( 0));
  236. BODY_20_31(20,E,T,A,B,C,D,X( 4),W[ 4],W[ 6],W[12],X( 1));
  237. BODY_20_31(21,D,E,T,A,B,C,X( 5),W[ 5],W[ 7],W[13],X( 2));
  238. BODY_20_31(22,C,D,E,T,A,B,X( 6),W[ 6],W[ 8],W[14],X( 3));
  239. BODY_20_31(23,B,C,D,E,T,A,X( 7),W[ 7],W[ 9],W[15],X( 4));
  240. BODY_20_31(24,A,B,C,D,E,T,X( 8),W[ 8],W[10],X( 0),X( 5));
  241. BODY_20_31(25,T,A,B,C,D,E,X( 9),W[ 9],W[11],X( 1),X( 6));
  242. BODY_20_31(26,E,T,A,B,C,D,X(10),W[10],W[12],X( 2),X( 7));
  243. BODY_20_31(27,D,E,T,A,B,C,X(11),W[11],W[13],X( 3),X( 8));
  244. BODY_20_31(28,C,D,E,T,A,B,X(12),W[12],W[14],X( 4),X( 9));
  245. BODY_20_31(29,B,C,D,E,T,A,X(13),W[13],W[15],X( 5),X(10));
  246. BODY_20_31(30,A,B,C,D,E,T,X(14),W[14],X( 0),X( 6),X(11));
  247. BODY_20_31(31,T,A,B,C,D,E,X(15),W[15],X( 1),X( 7),X(12));
  248. BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
  249. BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
  250. BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
  251. BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
  252. BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
  253. BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
  254. BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
  255. BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
  256. BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
  257. BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
  258. BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
  259. BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
  260. BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
  261. BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
  262. BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
  263. BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
  264. BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
  265. BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
  266. BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
  267. BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
  268. BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
  269. BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
  270. BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
  271. BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
  272. BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
  273. BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
  274. BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
  275. BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
  276. BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
  277. BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
  278. BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
  279. BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
  280. BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
  281. BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
  282. BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
  283. BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
  284. BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
  285. BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
  286. BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
  287. BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
  288. BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
  289. BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
  290. BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
  291. BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
  292. BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
  293. BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
  294. BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
  295. BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
  296. c->h0=(c->h0+E)&0xffffffffL;
  297. c->h1=(c->h1+T)&0xffffffffL;
  298. c->h2=(c->h2+A)&0xffffffffL;
  299. c->h3=(c->h3+B)&0xffffffffL;
  300. c->h4=(c->h4+C)&0xffffffffL;
  301. if (--num <= 0) break;
  302. A=c->h0;
  303. B=c->h1;
  304. C=c->h2;
  305. D=c->h3;
  306. E=c->h4;
  307. W+=SHA_LBLOCK;
  308. }
  309. }
  310. #endif
  311. #ifndef DONT_IMPLEMENT_BLOCK_DATA_ORDER
  312. void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num)
  313. {
  314. const unsigned char *data=p;
  315. register unsigned long A,B,C,D,E,T,l;
  316. #ifndef MD32_XARRAY
  317. unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
  318. XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
  319. #else
  320. SHA_LONG XX[16];
  321. #endif
  322. A=c->h0;
  323. B=c->h1;
  324. C=c->h2;
  325. D=c->h3;
  326. E=c->h4;
  327. for (;;)
  328. {
  329. HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
  330. BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
  331. BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
  332. BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
  333. BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
  334. BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
  335. BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
  336. BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
  337. BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
  338. BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
  339. BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
  340. BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
  341. BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
  342. BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
  343. BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
  344. BODY_00_15(14,E,T,A,B,C,D,X(14));
  345. BODY_00_15(15,D,E,T,A,B,C,X(15));
  346. BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
  347. BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
  348. BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
  349. BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
  350. BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
  351. BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
  352. BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
  353. BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
  354. BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
  355. BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
  356. BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
  357. BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
  358. BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
  359. BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
  360. BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
  361. BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
  362. BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
  363. BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
  364. BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
  365. BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
  366. BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
  367. BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
  368. BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
  369. BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
  370. BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
  371. BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
  372. BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
  373. BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
  374. BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
  375. BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
  376. BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
  377. BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
  378. BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
  379. BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
  380. BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
  381. BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
  382. BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
  383. BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
  384. BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
  385. BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
  386. BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
  387. BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
  388. BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
  389. BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
  390. BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
  391. BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
  392. BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
  393. BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
  394. BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
  395. BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
  396. BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
  397. BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
  398. BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
  399. BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
  400. BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
  401. BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
  402. BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
  403. BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
  404. BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
  405. BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
  406. BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
  407. BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
  408. BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
  409. BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
  410. c->h0=(c->h0+E)&0xffffffffL;
  411. c->h1=(c->h1+T)&0xffffffffL;
  412. c->h2=(c->h2+A)&0xffffffffL;
  413. c->h3=(c->h3+B)&0xffffffffL;
  414. c->h4=(c->h4+C)&0xffffffffL;
  415. if (--num <= 0) break;
  416. A=c->h0;
  417. B=c->h1;
  418. C=c->h2;
  419. D=c->h3;
  420. E=c->h4;
  421. }
  422. }
  423. #endif