2
0

sha_locl.h 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437
  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. #define DATA_ORDER_IS_BIG_ENDIAN
  63. #define HASH_LONG SHA_LONG
  64. #define HASH_CTX SHA_CTX
  65. #define HASH_CBLOCK SHA_CBLOCK
  66. #define HASH_MAKE_STRING(c,s) do { \
  67. unsigned long ll; \
  68. ll=(c)->h0; HOST_l2c(ll,(s)); \
  69. ll=(c)->h1; HOST_l2c(ll,(s)); \
  70. ll=(c)->h2; HOST_l2c(ll,(s)); \
  71. ll=(c)->h3; HOST_l2c(ll,(s)); \
  72. ll=(c)->h4; HOST_l2c(ll,(s)); \
  73. } while (0)
  74. #if defined(SHA_0)
  75. # define HASH_UPDATE SHA_Update
  76. # define HASH_TRANSFORM SHA_Transform
  77. # define HASH_FINAL SHA_Final
  78. # define HASH_INIT SHA_Init
  79. # define HASH_BLOCK_DATA_ORDER sha_block_data_order
  80. # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id))
  81. static void sha_block_data_order (SHA_CTX *c, const void *p,size_t num);
  82. #elif defined(SHA_1)
  83. # define HASH_UPDATE SHA1_Update
  84. # define HASH_TRANSFORM SHA1_Transform
  85. # define HASH_FINAL SHA1_Final
  86. # define HASH_INIT SHA1_Init
  87. # define HASH_BLOCK_DATA_ORDER sha1_block_data_order
  88. # if defined(__MWERKS__) && defined(__MC68K__)
  89. /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
  90. # define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \
  91. ix=(a)=ROTATE((a),1); \
  92. } while (0)
  93. # else
  94. # define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
  95. ix=(a)=ROTATE((a),1) \
  96. )
  97. # endif
  98. #ifndef SHA1_ASM
  99. static
  100. #endif
  101. void sha1_block_data_order (SHA_CTX *c, const void *p,size_t num);
  102. #else
  103. # error "Either SHA_0 or SHA_1 must be defined."
  104. #endif
  105. #include "md32_common.h"
  106. #define INIT_DATA_h0 0x67452301UL
  107. #define INIT_DATA_h1 0xefcdab89UL
  108. #define INIT_DATA_h2 0x98badcfeUL
  109. #define INIT_DATA_h3 0x10325476UL
  110. #define INIT_DATA_h4 0xc3d2e1f0UL
  111. int HASH_INIT (SHA_CTX *c)
  112. {
  113. memset (c,0,sizeof(*c));
  114. c->h0=INIT_DATA_h0;
  115. c->h1=INIT_DATA_h1;
  116. c->h2=INIT_DATA_h2;
  117. c->h3=INIT_DATA_h3;
  118. c->h4=INIT_DATA_h4;
  119. return 1;
  120. }
  121. #define K_00_19 0x5a827999UL
  122. #define K_20_39 0x6ed9eba1UL
  123. #define K_40_59 0x8f1bbcdcUL
  124. #define K_60_79 0xca62c1d6UL
  125. /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
  126. * simplified to the code in F_00_19. Wei attributes these optimisations
  127. * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
  128. * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
  129. * I've just become aware of another tweak to be made, again from Wei Dai,
  130. * in F_40_59, (x&a)|(y&a) -> (x|y)&a
  131. */
  132. #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
  133. #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
  134. #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
  135. #define F_60_79(b,c,d) F_20_39(b,c,d)
  136. #ifndef OPENSSL_SMALL_FOOTPRINT
  137. #define BODY_00_15(i,a,b,c,d,e,f,xi) \
  138. (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
  139. (b)=ROTATE((b),30);
  140. #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
  141. Xupdate(f,xi,xa,xb,xc,xd); \
  142. (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
  143. (b)=ROTATE((b),30);
  144. #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
  145. Xupdate(f,xi,xa,xb,xc,xd); \
  146. (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
  147. (b)=ROTATE((b),30);
  148. #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
  149. Xupdate(f,xa,xa,xb,xc,xd); \
  150. (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
  151. (b)=ROTATE((b),30);
  152. #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
  153. Xupdate(f,xa,xa,xb,xc,xd); \
  154. (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
  155. (b)=ROTATE((b),30);
  156. #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
  157. Xupdate(f,xa,xa,xb,xc,xd); \
  158. (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
  159. (b)=ROTATE((b),30);
  160. #ifdef X
  161. #undef X
  162. #endif
  163. #ifndef MD32_XARRAY
  164. /*
  165. * Originally X was an array. As it's automatic it's natural
  166. * to expect RISC compiler to accomodate at least part of it in
  167. * the register bank, isn't it? Unfortunately not all compilers
  168. * "find" this expectation reasonable:-( On order to make such
  169. * compilers generate better code I replace X[] with a bunch of
  170. * X0, X1, etc. See the function body below...
  171. * <appro@fy.chalmers.se>
  172. */
  173. # define X(i) XX##i
  174. #else
  175. /*
  176. * However! Some compilers (most notably HP C) get overwhelmed by
  177. * that many local variables so that we have to have the way to
  178. * fall down to the original behavior.
  179. */
  180. # define X(i) XX[i]
  181. #endif
  182. #if !defined(SHA_1) || !defined(SHA1_ASM)
  183. static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
  184. {
  185. const unsigned char *data=p;
  186. register unsigned MD32_REG_T A,B,C,D,E,T,l;
  187. #ifndef MD32_XARRAY
  188. unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
  189. XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
  190. #else
  191. SHA_LONG XX[16];
  192. #endif
  193. A=c->h0;
  194. B=c->h1;
  195. C=c->h2;
  196. D=c->h3;
  197. E=c->h4;
  198. for (;;)
  199. {
  200. const union { long one; char little; } is_endian = {1};
  201. if (!is_endian.little && sizeof(SHA_LONG)==4 && ((size_t)p%4)==0)
  202. {
  203. const SHA_LONG *W=(const SHA_LONG *)data;
  204. X( 0) = W[0]; X( 1) = W[ 1];
  205. BODY_00_15( 0,A,B,C,D,E,T,X( 0)); X( 2) = W[ 2];
  206. BODY_00_15( 1,T,A,B,C,D,E,X( 1)); X( 3) = W[ 3];
  207. BODY_00_15( 2,E,T,A,B,C,D,X( 2)); X( 4) = W[ 4];
  208. BODY_00_15( 3,D,E,T,A,B,C,X( 3)); X( 5) = W[ 5];
  209. BODY_00_15( 4,C,D,E,T,A,B,X( 4)); X( 6) = W[ 6];
  210. BODY_00_15( 5,B,C,D,E,T,A,X( 5)); X( 7) = W[ 7];
  211. BODY_00_15( 6,A,B,C,D,E,T,X( 6)); X( 8) = W[ 8];
  212. BODY_00_15( 7,T,A,B,C,D,E,X( 7)); X( 9) = W[ 9];
  213. BODY_00_15( 8,E,T,A,B,C,D,X( 8)); X(10) = W[10];
  214. BODY_00_15( 9,D,E,T,A,B,C,X( 9)); X(11) = W[11];
  215. BODY_00_15(10,C,D,E,T,A,B,X(10)); X(12) = W[12];
  216. BODY_00_15(11,B,C,D,E,T,A,X(11)); X(13) = W[13];
  217. BODY_00_15(12,A,B,C,D,E,T,X(12)); X(14) = W[14];
  218. BODY_00_15(13,T,A,B,C,D,E,X(13)); X(15) = W[15];
  219. BODY_00_15(14,E,T,A,B,C,D,X(14));
  220. BODY_00_15(15,D,E,T,A,B,C,X(15));
  221. data += SHA_CBLOCK;
  222. }
  223. else
  224. {
  225. HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
  226. BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
  227. BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
  228. BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
  229. BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
  230. BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
  231. BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
  232. BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
  233. BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
  234. BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
  235. BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
  236. BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
  237. BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
  238. BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
  239. BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
  240. BODY_00_15(14,E,T,A,B,C,D,X(14));
  241. BODY_00_15(15,D,E,T,A,B,C,X(15));
  242. }
  243. BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
  244. BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
  245. BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
  246. BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
  247. BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
  248. BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
  249. BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
  250. BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
  251. BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
  252. BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
  253. BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
  254. BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
  255. BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
  256. BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
  257. BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
  258. BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
  259. BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
  260. BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
  261. BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
  262. BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
  263. BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
  264. BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
  265. BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
  266. BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
  267. BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
  268. BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
  269. BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
  270. BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
  271. BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
  272. BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
  273. BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
  274. BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
  275. BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
  276. BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
  277. BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
  278. BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
  279. BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
  280. BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
  281. BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
  282. BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
  283. BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
  284. BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
  285. BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
  286. BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
  287. BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
  288. BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
  289. BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
  290. BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
  291. BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
  292. BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
  293. BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
  294. BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
  295. BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
  296. BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
  297. BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
  298. BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
  299. BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
  300. BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
  301. BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
  302. BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
  303. BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
  304. BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
  305. BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
  306. BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
  307. c->h0=(c->h0+E)&0xffffffffL;
  308. c->h1=(c->h1+T)&0xffffffffL;
  309. c->h2=(c->h2+A)&0xffffffffL;
  310. c->h3=(c->h3+B)&0xffffffffL;
  311. c->h4=(c->h4+C)&0xffffffffL;
  312. if (--num == 0) break;
  313. A=c->h0;
  314. B=c->h1;
  315. C=c->h2;
  316. D=c->h3;
  317. E=c->h4;
  318. }
  319. }
  320. #endif
  321. #else /* OPENSSL_SMALL_FOOTPRINT */
  322. #define BODY_00_15(xi) do { \
  323. T=E+K_00_19+F_00_19(B,C,D); \
  324. E=D, D=C, C=ROTATE(B,30), B=A; \
  325. A=ROTATE(A,5)+T+xi; } while(0)
  326. #define BODY_16_19(xa,xb,xc,xd) do { \
  327. Xupdate(T,xa,xa,xb,xc,xd); \
  328. T+=E+K_00_19+F_00_19(B,C,D); \
  329. E=D, D=C, C=ROTATE(B,30), B=A; \
  330. A=ROTATE(A,5)+T; } while(0)
  331. #define BODY_20_39(xa,xb,xc,xd) do { \
  332. Xupdate(T,xa,xa,xb,xc,xd); \
  333. T+=E+K_20_39+F_20_39(B,C,D); \
  334. E=D, D=C, C=ROTATE(B,30), B=A; \
  335. A=ROTATE(A,5)+T; } while(0)
  336. #define BODY_40_59(xa,xb,xc,xd) do { \
  337. Xupdate(T,xa,xa,xb,xc,xd); \
  338. T+=E+K_40_59+F_40_59(B,C,D); \
  339. E=D, D=C, C=ROTATE(B,30), B=A; \
  340. A=ROTATE(A,5)+T; } while(0)
  341. #define BODY_60_79(xa,xb,xc,xd) do { \
  342. Xupdate(T,xa,xa,xb,xc,xd); \
  343. T=E+K_60_79+F_60_79(B,C,D); \
  344. E=D, D=C, C=ROTATE(B,30), B=A; \
  345. A=ROTATE(A,5)+T+xa; } while(0)
  346. #if !defined(SHA_1) || !defined(SHA1_ASM)
  347. static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
  348. {
  349. const unsigned char *data=p;
  350. register unsigned MD32_REG_T A,B,C,D,E,T,l;
  351. int i;
  352. SHA_LONG X[16];
  353. A=c->h0;
  354. B=c->h1;
  355. C=c->h2;
  356. D=c->h3;
  357. E=c->h4;
  358. for (;;)
  359. {
  360. for (i=0;i<16;i++)
  361. { HOST_c2l(data,l); X[i]=l; BODY_00_15(X[i]); }
  362. for (i=0;i<4;i++)
  363. { BODY_16_19(X[i], X[i+2], X[i+8], X[(i+13)&15]); }
  364. for (;i<24;i++)
  365. { BODY_20_39(X[i&15], X[(i+2)&15], X[(i+8)&15],X[(i+13)&15]); }
  366. for (i=0;i<20;i++)
  367. { BODY_40_59(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); }
  368. for (i=4;i<24;i++)
  369. { BODY_60_79(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); }
  370. c->h0=(c->h0+A)&0xffffffffL;
  371. c->h1=(c->h1+B)&0xffffffffL;
  372. c->h2=(c->h2+C)&0xffffffffL;
  373. c->h3=(c->h3+D)&0xffffffffL;
  374. c->h4=(c->h4+E)&0xffffffffL;
  375. if (--num == 0) break;
  376. A=c->h0;
  377. B=c->h1;
  378. C=c->h2;
  379. D=c->h3;
  380. E=c->h4;
  381. }
  382. }
  383. #endif
  384. #endif