sshsha.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690
  1. /*
  2. * SHA1 hash algorithm. Used in SSH-2 as a MAC, and the transform is
  3. * also used as a `stirring' function for the PuTTY random number
  4. * pool. Implemented directly from the specification by Simon
  5. * Tatham.
  6. */
  7. #include "ssh.h"
  8. #include <assert.h>
  9. /* ----------------------------------------------------------------------
  10. * Core SHA algorithm: processes 16-word blocks into a message digest.
  11. */
  12. #define rol(x,y) ( ((x) << (y)) | (((uint32_t)x) >> (32-y)) )
  13. static void sha1_sw(SHA_State * s, const unsigned char *q, int len);
  14. static void sha1_ni(SHA_State * s, const unsigned char *q, int len);
  15. static void SHA_Core_Init(uint32_t h[5])
  16. {
  17. h[0] = 0x67452301;
  18. h[1] = 0xefcdab89;
  19. h[2] = 0x98badcfe;
  20. h[3] = 0x10325476;
  21. h[4] = 0xc3d2e1f0;
  22. }
  23. void SHATransform(uint32_t * digest, uint32_t * block)
  24. {
  25. uint32_t w[80];
  26. uint32_t a, b, c, d, e;
  27. int t;
  28. #ifdef RANDOM_DIAGNOSTICS
  29. {
  30. extern int random_diagnostics;
  31. if (random_diagnostics) {
  32. int i;
  33. printf("SHATransform:");
  34. for (i = 0; i < 5; i++)
  35. printf(" %08x", digest[i]);
  36. printf(" +");
  37. for (i = 0; i < 16; i++)
  38. printf(" %08x", block[i]);
  39. }
  40. }
  41. #endif
  42. for (t = 0; t < 16; t++)
  43. w[t] = block[t];
  44. for (t = 16; t < 80; t++) {
  45. uint32_t tmp = w[t - 3] ^ w[t - 8] ^ w[t - 14] ^ w[t - 16];
  46. w[t] = rol(tmp, 1);
  47. }
  48. a = digest[0];
  49. b = digest[1];
  50. c = digest[2];
  51. d = digest[3];
  52. e = digest[4];
  53. for (t = 0; t < 20; t++) {
  54. uint32_t tmp =
  55. rol(a, 5) + ((b & c) | (d & ~b)) + e + w[t] + 0x5a827999;
  56. e = d;
  57. d = c;
  58. c = rol(b, 30);
  59. b = a;
  60. a = tmp;
  61. }
  62. for (t = 20; t < 40; t++) {
  63. uint32_t tmp = rol(a, 5) + (b ^ c ^ d) + e + w[t] + 0x6ed9eba1;
  64. e = d;
  65. d = c;
  66. c = rol(b, 30);
  67. b = a;
  68. a = tmp;
  69. }
  70. for (t = 40; t < 60; t++) {
  71. uint32_t tmp = rol(a,
  72. 5) + ((b & c) | (b & d) | (c & d)) + e + w[t] +
  73. 0x8f1bbcdc;
  74. e = d;
  75. d = c;
  76. c = rol(b, 30);
  77. b = a;
  78. a = tmp;
  79. }
  80. for (t = 60; t < 80; t++) {
  81. uint32_t tmp = rol(a, 5) + (b ^ c ^ d) + e + w[t] + 0xca62c1d6;
  82. e = d;
  83. d = c;
  84. c = rol(b, 30);
  85. b = a;
  86. a = tmp;
  87. }
  88. digest[0] += a;
  89. digest[1] += b;
  90. digest[2] += c;
  91. digest[3] += d;
  92. digest[4] += e;
  93. #ifdef RANDOM_DIAGNOSTICS
  94. {
  95. extern int random_diagnostics;
  96. if (random_diagnostics) {
  97. int i;
  98. printf(" =");
  99. for (i = 0; i < 5; i++)
  100. printf(" %08x", digest[i]);
  101. printf("\n");
  102. }
  103. }
  104. #endif
  105. }
  106. /* ----------------------------------------------------------------------
  107. * Outer SHA algorithm: take an arbitrary length byte string,
  108. * convert it into 16-word blocks with the prescribed padding at
  109. * the end, and pass those blocks to the core SHA algorithm.
  110. */
  111. static void SHA_BinarySink_write(BinarySink *bs, const void *p, size_t len);
  112. void SHA_Init(SHA_State * s)
  113. {
  114. SHA_Core_Init(s->h);
  115. s->blkused = 0;
  116. s->len = 0;
  117. if (supports_sha_ni())
  118. s->sha1 = &sha1_ni;
  119. else
  120. s->sha1 = &sha1_sw;
  121. BinarySink_INIT(s, SHA_BinarySink_write);
  122. }
  123. static void SHA_BinarySink_write(BinarySink *bs, const void *p, size_t len)
  124. {
  125. struct SHA_State *s = BinarySink_DOWNCAST(bs, struct SHA_State);
  126. const unsigned char *q = (const unsigned char *) p;
  127. /*
  128. * Update the length field.
  129. */
  130. s->len += len;
  131. (*(s->sha1))(s, q, len);
  132. }
  133. static void sha1_sw(SHA_State * s, const unsigned char *q, int len)
  134. {
  135. uint32_t wordblock[16];
  136. int i;
  137. if (s->blkused && s->blkused + len < 64) {
  138. /*
  139. * Trivial case: just add to the block.
  140. */
  141. memcpy(s->block + s->blkused, q, len);
  142. s->blkused += len;
  143. } else {
  144. /*
  145. * We must complete and process at least one block.
  146. */
  147. while (s->blkused + len >= 64) {
  148. memcpy(s->block + s->blkused, q, 64 - s->blkused);
  149. q += 64 - s->blkused;
  150. len -= 64 - s->blkused;
  151. /* Now process the block. Gather bytes big-endian into words */
  152. for (i = 0; i < 16; i++) {
  153. wordblock[i] =
  154. (((uint32_t) s->block[i * 4 + 0]) << 24) |
  155. (((uint32_t) s->block[i * 4 + 1]) << 16) |
  156. (((uint32_t) s->block[i * 4 + 2]) << 8) |
  157. (((uint32_t) s->block[i * 4 + 3]) << 0);
  158. }
  159. SHATransform(s->h, wordblock);
  160. s->blkused = 0;
  161. }
  162. memcpy(s->block, q, len);
  163. s->blkused = len;
  164. }
  165. }
  166. void SHA_Final(SHA_State * s, unsigned char *output)
  167. {
  168. int i;
  169. int pad;
  170. unsigned char c[64];
  171. uint64_t len;
  172. if (s->blkused >= 56)
  173. pad = 56 + 64 - s->blkused;
  174. else
  175. pad = 56 - s->blkused;
  176. len = (s->len << 3);
  177. memset(c, 0, pad);
  178. c[0] = 0x80;
  179. put_data(s, &c, pad);
  180. put_uint64(s, len);
  181. for (i = 0; i < 5; i++) {
  182. output[i * 4] = (s->h[i] >> 24) & 0xFF;
  183. output[i * 4 + 1] = (s->h[i] >> 16) & 0xFF;
  184. output[i * 4 + 2] = (s->h[i] >> 8) & 0xFF;
  185. output[i * 4 + 3] = (s->h[i]) & 0xFF;
  186. }
  187. }
  188. void SHA_Simple(const void *p, int len, unsigned char *output)
  189. {
  190. SHA_State s;
  191. SHA_Init(&s);
  192. put_data(&s, p, len);
  193. SHA_Final(&s, output);
  194. smemclr(&s, sizeof(s));
  195. }
  196. /*
  197. * Thin abstraction for things where hashes are pluggable.
  198. */
  199. struct sha1_hash {
  200. SHA_State state;
  201. ssh_hash hash;
  202. };
  203. static ssh_hash *sha1_new(const ssh_hashalg *alg)
  204. {
  205. struct sha1_hash *h = snew(struct sha1_hash);
  206. SHA_Init(&h->state);
  207. h->hash.vt = alg;
  208. BinarySink_DELEGATE_INIT(&h->hash, &h->state);
  209. return &h->hash;
  210. }
  211. static ssh_hash *sha1_copy(ssh_hash *hashold)
  212. {
  213. struct sha1_hash *hold, *hnew;
  214. ssh_hash *hashnew = sha1_new(hashold->vt);
  215. hold = container_of(hashold, struct sha1_hash, hash);
  216. hnew = container_of(hashnew, struct sha1_hash, hash);
  217. hnew->state = hold->state;
  218. BinarySink_COPIED(&hnew->state);
  219. return hashnew;
  220. }
  221. static void sha1_free(ssh_hash *hash)
  222. {
  223. struct sha1_hash *h = container_of(hash, struct sha1_hash, hash);
  224. smemclr(h, sizeof(*h));
  225. sfree(h);
  226. }
  227. static void sha1_final(ssh_hash *hash, unsigned char *output)
  228. {
  229. struct sha1_hash *h = container_of(hash, struct sha1_hash, hash);
  230. SHA_Final(&h->state, output);
  231. sha1_free(hash);
  232. }
  233. const ssh_hashalg ssh_sha1 = {
  234. sha1_new, sha1_copy, sha1_final, sha1_free, 20, "SHA-1"
  235. };
  236. /* ----------------------------------------------------------------------
  237. * The above is the SHA-1 algorithm itself. Now we implement the
  238. * HMAC wrapper on it.
  239. */
  240. struct hmacsha1 {
  241. SHA_State sha[3];
  242. ssh2_mac mac;
  243. };
  244. static ssh2_mac *hmacsha1_new(const ssh2_macalg *alg, ssh_cipher *cipher)
  245. {
  246. struct hmacsha1 *ctx = snew(struct hmacsha1);
  247. ctx->mac.vt = alg;
  248. BinarySink_DELEGATE_INIT(&ctx->mac, &ctx->sha[2]);
  249. return &ctx->mac;
  250. }
  251. static void hmacsha1_free(ssh2_mac *mac)
  252. {
  253. struct hmacsha1 *ctx = container_of(mac, struct hmacsha1, mac);
  254. smemclr(ctx, sizeof(*ctx));
  255. sfree(ctx);
  256. }
  257. static void sha1_key_internal(SHA_State *keys,
  258. const unsigned char *key, int len)
  259. {
  260. unsigned char foo[64];
  261. int i;
  262. memset(foo, 0x36, 64);
  263. for (i = 0; i < len && i < 64; i++)
  264. foo[i] ^= key[i];
  265. SHA_Init(&keys[0]);
  266. put_data(&keys[0], foo, 64);
  267. memset(foo, 0x5C, 64);
  268. for (i = 0; i < len && i < 64; i++)
  269. foo[i] ^= key[i];
  270. SHA_Init(&keys[1]);
  271. put_data(&keys[1], foo, 64);
  272. smemclr(foo, 64); /* burn the evidence */
  273. }
  274. static void hmacsha1_key(ssh2_mac *mac, ptrlen key)
  275. {
  276. struct hmacsha1 *ctx = container_of(mac, struct hmacsha1, mac);
  277. sha1_key_internal(ctx->sha, key.ptr, key.len);
  278. }
  279. static void hmacsha1_start(ssh2_mac *mac)
  280. {
  281. struct hmacsha1 *ctx = container_of(mac, struct hmacsha1, mac);
  282. ctx->sha[2] = ctx->sha[0]; /* structure copy */
  283. BinarySink_COPIED(&ctx->sha[2]);
  284. }
  285. static void hmacsha1_genresult(ssh2_mac *mac, unsigned char *hmac)
  286. {
  287. struct hmacsha1 *ctx = container_of(mac, struct hmacsha1, mac);
  288. SHA_State s;
  289. unsigned char intermediate[20];
  290. s = ctx->sha[2]; /* structure copy */
  291. BinarySink_COPIED(&s);
  292. SHA_Final(&s, intermediate);
  293. s = ctx->sha[1]; /* structure copy */
  294. BinarySink_COPIED(&s);
  295. put_data(&s, intermediate, 20);
  296. SHA_Final(&s, intermediate);
  297. memcpy(hmac, intermediate, ctx->mac.vt->len);
  298. smemclr(intermediate, sizeof(intermediate));
  299. }
  300. void hmac_sha1_simple(const void *key, int keylen,
  301. const void *data, int datalen,
  302. unsigned char *output) {
  303. SHA_State states[2];
  304. unsigned char intermediate[20];
  305. sha1_key_internal(states, key, keylen);
  306. put_data(&states[0], data, datalen);
  307. SHA_Final(&states[0], intermediate);
  308. put_data(&states[1], intermediate, 20);
  309. SHA_Final(&states[1], output);
  310. }
  311. const ssh2_macalg ssh_hmac_sha1 = {
  312. hmacsha1_new, hmacsha1_free, hmacsha1_key,
  313. hmacsha1_start, hmacsha1_genresult,
  314. "hmac-sha1", "[email protected]",
  315. 20, 20,
  316. "HMAC-SHA1"
  317. };
  318. const ssh2_macalg ssh_hmac_sha1_96 = {
  319. hmacsha1_new, hmacsha1_free, hmacsha1_key,
  320. hmacsha1_start, hmacsha1_genresult,
  321. "hmac-sha1-96", "[email protected]",
  322. 12, 20,
  323. "HMAC-SHA1-96"
  324. };
  325. const ssh2_macalg ssh_hmac_sha1_buggy = {
  326. hmacsha1_new, hmacsha1_free, hmacsha1_key,
  327. hmacsha1_start, hmacsha1_genresult,
  328. "hmac-sha1", NULL,
  329. 20, 16,
  330. "bug-compatible HMAC-SHA1"
  331. };
  332. const ssh2_macalg ssh_hmac_sha1_96_buggy = {
  333. hmacsha1_new, hmacsha1_free, hmacsha1_key,
  334. hmacsha1_start, hmacsha1_genresult,
  335. "hmac-sha1-96", NULL,
  336. 12, 16,
  337. "bug-compatible HMAC-SHA1-96"
  338. };
  339. #ifdef COMPILER_SUPPORTS_SHA_NI
  340. #if defined _MSC_VER && defined _M_AMD64
  341. # include <intrin.h>
  342. #endif
  343. /*
  344. * Set target architecture for Clang and GCC
  345. */
  346. #if !defined(__clang__) && defined(__GNUC__)
  347. # pragma GCC target("sha")
  348. # pragma GCC target("sse4.1")
  349. #endif
  350. #if defined(__clang__) || (defined(__GNUC__) && (__GNUC__ >= 5))
  351. # define FUNC_ISA __attribute__ ((target("sse4.1,sha")))
  352. #else
  353. # define FUNC_ISA
  354. #endif
  355. #include <wmmintrin.h>
  356. #include <smmintrin.h>
  357. #include <immintrin.h>
  358. #if defined(__clang__) || defined(__GNUC__)
  359. #include <shaintrin.h>
  360. #endif
  361. /*
  362. * Determinators of CPU type
  363. */
  364. #if defined(__clang__) || defined(__GNUC__)
  365. #include <cpuid.h>
  366. bool supports_sha_ni(void)
  367. {
  368. unsigned int CPUInfo[4];
  369. __cpuid(0, CPUInfo[0], CPUInfo[1], CPUInfo[2], CPUInfo[3]);
  370. if (CPUInfo[0] < 7)
  371. return false;
  372. __cpuid_count(7, 0, CPUInfo[0], CPUInfo[1], CPUInfo[2], CPUInfo[3]);
  373. return CPUInfo[1] & (1 << 29); /* SHA */
  374. }
  375. #else /* defined(__clang__) || defined(__GNUC__) */
  376. bool supports_sha_ni(void)
  377. {
  378. unsigned int CPUInfo[4];
  379. __cpuid(CPUInfo, 0);
  380. if (CPUInfo[0] < 7)
  381. return false;
  382. __cpuidex(CPUInfo, 7, 0);
  383. return CPUInfo[1] & (1 << 29); /* Check SHA */
  384. }
  385. #endif /* defined(__clang__) || defined(__GNUC__) */
  386. /* SHA1 implementation using new instructions
  387. The code is based on Jeffrey Walton's SHA1 implementation:
  388. https://github.com/noloader/SHA-Intrinsics
  389. */
  390. FUNC_ISA
  391. static void sha1_ni_(SHA_State * s, const unsigned char *q, int len)
  392. {
  393. if (s->blkused && s->blkused + len < 64) {
  394. /*
  395. * Trivial case: just add to the block.
  396. */
  397. memcpy(s->block + s->blkused, q, len);
  398. s->blkused += len;
  399. } else {
  400. __m128i ABCD, ABCD_SAVE, E0, E0_SAVE, E1;
  401. const __m128i MASK = _mm_set_epi64x(0x0001020304050607ULL, 0x08090a0b0c0d0e0fULL);
  402. ABCD = _mm_loadu_si128((const __m128i*) s->h);
  403. E0 = _mm_set_epi32(s->h[4], 0, 0, 0);
  404. ABCD = _mm_shuffle_epi32(ABCD, 0x1B);
  405. /*
  406. * We must complete and process at least one block.
  407. */
  408. while (s->blkused + len >= 64)
  409. {
  410. __m128i MSG0, MSG1, MSG2, MSG3;
  411. memcpy(s->block + s->blkused, q, 64 - s->blkused);
  412. q += 64 - s->blkused;
  413. len -= 64 - s->blkused;
  414. /* Save current state */
  415. ABCD_SAVE = ABCD;
  416. E0_SAVE = E0;
  417. /* Rounds 0-3 */
  418. MSG0 = _mm_loadu_si128((const __m128i*)(s->block + 0));
  419. MSG0 = _mm_shuffle_epi8(MSG0, MASK);
  420. E0 = _mm_add_epi32(E0, MSG0);
  421. E1 = ABCD;
  422. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 0);
  423. /* Rounds 4-7 */
  424. MSG1 = _mm_loadu_si128((const __m128i*)(s->block + 16));
  425. MSG1 = _mm_shuffle_epi8(MSG1, MASK);
  426. E1 = _mm_sha1nexte_epu32(E1, MSG1);
  427. E0 = ABCD;
  428. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 0);
  429. MSG0 = _mm_sha1msg1_epu32(MSG0, MSG1);
  430. /* Rounds 8-11 */
  431. MSG2 = _mm_loadu_si128((const __m128i*)(s->block + 32));
  432. MSG2 = _mm_shuffle_epi8(MSG2, MASK);
  433. E0 = _mm_sha1nexte_epu32(E0, MSG2);
  434. E1 = ABCD;
  435. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 0);
  436. MSG1 = _mm_sha1msg1_epu32(MSG1, MSG2);
  437. MSG0 = _mm_xor_si128(MSG0, MSG2);
  438. /* Rounds 12-15 */
  439. MSG3 = _mm_loadu_si128((const __m128i*)(s->block + 48));
  440. MSG3 = _mm_shuffle_epi8(MSG3, MASK);
  441. E1 = _mm_sha1nexte_epu32(E1, MSG3);
  442. E0 = ABCD;
  443. MSG0 = _mm_sha1msg2_epu32(MSG0, MSG3);
  444. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 0);
  445. MSG2 = _mm_sha1msg1_epu32(MSG2, MSG3);
  446. MSG1 = _mm_xor_si128(MSG1, MSG3);
  447. /* Rounds 16-19 */
  448. E0 = _mm_sha1nexte_epu32(E0, MSG0);
  449. E1 = ABCD;
  450. MSG1 = _mm_sha1msg2_epu32(MSG1, MSG0);
  451. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 0);
  452. MSG3 = _mm_sha1msg1_epu32(MSG3, MSG0);
  453. MSG2 = _mm_xor_si128(MSG2, MSG0);
  454. /* Rounds 20-23 */
  455. E1 = _mm_sha1nexte_epu32(E1, MSG1);
  456. E0 = ABCD;
  457. MSG2 = _mm_sha1msg2_epu32(MSG2, MSG1);
  458. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 1);
  459. MSG0 = _mm_sha1msg1_epu32(MSG0, MSG1);
  460. MSG3 = _mm_xor_si128(MSG3, MSG1);
  461. /* Rounds 24-27 */
  462. E0 = _mm_sha1nexte_epu32(E0, MSG2);
  463. E1 = ABCD;
  464. MSG3 = _mm_sha1msg2_epu32(MSG3, MSG2);
  465. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 1);
  466. MSG1 = _mm_sha1msg1_epu32(MSG1, MSG2);
  467. MSG0 = _mm_xor_si128(MSG0, MSG2);
  468. /* Rounds 28-31 */
  469. E1 = _mm_sha1nexte_epu32(E1, MSG3);
  470. E0 = ABCD;
  471. MSG0 = _mm_sha1msg2_epu32(MSG0, MSG3);
  472. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 1);
  473. MSG2 = _mm_sha1msg1_epu32(MSG2, MSG3);
  474. MSG1 = _mm_xor_si128(MSG1, MSG3);
  475. /* Rounds 32-35 */
  476. E0 = _mm_sha1nexte_epu32(E0, MSG0);
  477. E1 = ABCD;
  478. MSG1 = _mm_sha1msg2_epu32(MSG1, MSG0);
  479. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 1);
  480. MSG3 = _mm_sha1msg1_epu32(MSG3, MSG0);
  481. MSG2 = _mm_xor_si128(MSG2, MSG0);
  482. /* Rounds 36-39 */
  483. E1 = _mm_sha1nexte_epu32(E1, MSG1);
  484. E0 = ABCD;
  485. MSG2 = _mm_sha1msg2_epu32(MSG2, MSG1);
  486. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 1);
  487. MSG0 = _mm_sha1msg1_epu32(MSG0, MSG1);
  488. MSG3 = _mm_xor_si128(MSG3, MSG1);
  489. /* Rounds 40-43 */
  490. E0 = _mm_sha1nexte_epu32(E0, MSG2);
  491. E1 = ABCD;
  492. MSG3 = _mm_sha1msg2_epu32(MSG3, MSG2);
  493. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 2);
  494. MSG1 = _mm_sha1msg1_epu32(MSG1, MSG2);
  495. MSG0 = _mm_xor_si128(MSG0, MSG2);
  496. /* Rounds 44-47 */
  497. E1 = _mm_sha1nexte_epu32(E1, MSG3);
  498. E0 = ABCD;
  499. MSG0 = _mm_sha1msg2_epu32(MSG0, MSG3);
  500. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 2);
  501. MSG2 = _mm_sha1msg1_epu32(MSG2, MSG3);
  502. MSG1 = _mm_xor_si128(MSG1, MSG3);
  503. /* Rounds 48-51 */
  504. E0 = _mm_sha1nexte_epu32(E0, MSG0);
  505. E1 = ABCD;
  506. MSG1 = _mm_sha1msg2_epu32(MSG1, MSG0);
  507. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 2);
  508. MSG3 = _mm_sha1msg1_epu32(MSG3, MSG0);
  509. MSG2 = _mm_xor_si128(MSG2, MSG0);
  510. /* Rounds 52-55 */
  511. E1 = _mm_sha1nexte_epu32(E1, MSG1);
  512. E0 = ABCD;
  513. MSG2 = _mm_sha1msg2_epu32(MSG2, MSG1);
  514. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 2);
  515. MSG0 = _mm_sha1msg1_epu32(MSG0, MSG1);
  516. MSG3 = _mm_xor_si128(MSG3, MSG1);
  517. /* Rounds 56-59 */
  518. E0 = _mm_sha1nexte_epu32(E0, MSG2);
  519. E1 = ABCD;
  520. MSG3 = _mm_sha1msg2_epu32(MSG3, MSG2);
  521. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 2);
  522. MSG1 = _mm_sha1msg1_epu32(MSG1, MSG2);
  523. MSG0 = _mm_xor_si128(MSG0, MSG2);
  524. /* Rounds 60-63 */
  525. E1 = _mm_sha1nexte_epu32(E1, MSG3);
  526. E0 = ABCD;
  527. MSG0 = _mm_sha1msg2_epu32(MSG0, MSG3);
  528. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 3);
  529. MSG2 = _mm_sha1msg1_epu32(MSG2, MSG3);
  530. MSG1 = _mm_xor_si128(MSG1, MSG3);
  531. /* Rounds 64-67 */
  532. E0 = _mm_sha1nexte_epu32(E0, MSG0);
  533. E1 = ABCD;
  534. MSG1 = _mm_sha1msg2_epu32(MSG1, MSG0);
  535. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 3);
  536. MSG3 = _mm_sha1msg1_epu32(MSG3, MSG0);
  537. MSG2 = _mm_xor_si128(MSG2, MSG0);
  538. /* Rounds 68-71 */
  539. E1 = _mm_sha1nexte_epu32(E1, MSG1);
  540. E0 = ABCD;
  541. MSG2 = _mm_sha1msg2_epu32(MSG2, MSG1);
  542. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 3);
  543. MSG3 = _mm_xor_si128(MSG3, MSG1);
  544. /* Rounds 72-75 */
  545. E0 = _mm_sha1nexte_epu32(E0, MSG2);
  546. E1 = ABCD;
  547. MSG3 = _mm_sha1msg2_epu32(MSG3, MSG2);
  548. ABCD = _mm_sha1rnds4_epu32(ABCD, E0, 3);
  549. /* Rounds 76-79 */
  550. E1 = _mm_sha1nexte_epu32(E1, MSG3);
  551. E0 = ABCD;
  552. ABCD = _mm_sha1rnds4_epu32(ABCD, E1, 3);
  553. /* Combine state */
  554. E0 = _mm_sha1nexte_epu32(E0, E0_SAVE);
  555. ABCD = _mm_add_epi32(ABCD, ABCD_SAVE);
  556. s->blkused = 0;
  557. }
  558. ABCD = _mm_shuffle_epi32(ABCD, 0x1B);
  559. /* Save state */
  560. _mm_storeu_si128((__m128i*) s->h, ABCD);
  561. s->h[4] = _mm_extract_epi32(E0, 3);
  562. memcpy(s->block, q, len);
  563. s->blkused = len;
  564. }
  565. }
  566. /*
  567. * Workaround LLVM bug https://bugs.llvm.org/show_bug.cgi?id=34980
  568. */
  569. static void sha1_ni(SHA_State * s, const unsigned char *q, int len)
  570. {
  571. sha1_ni_(s, q, len);
  572. }
  573. #else /* COMPILER_SUPPORTS_AES_NI */
  574. static void sha1_ni(SHA_State * s, const unsigned char *q, int len)
  575. {
  576. unreachable("sha1_ni not compiled in");
  577. }
  578. bool supports_sha_ni(void)
  579. {
  580. return false;
  581. }
  582. #endif /* COMPILER_SUPPORTS_AES_NI */