2
0

sha512.c 32 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861
  1. /*
  2. * Copyright 2004-2022 The OpenSSL Project Authors. All Rights Reserved.
  3. *
  4. * Licensed under the Apache License 2.0 (the "License"). You may not use
  5. * this file except in compliance with the License. You can obtain a copy
  6. * in the file LICENSE in the source distribution or at
  7. * https://www.openssl.org/source/license.html
  8. */
  9. /*
  10. * SHA512 low level APIs are deprecated for public use, but still ok for
  11. * internal use.
  12. */
  13. #include "internal/deprecated.h"
  14. #include <stdio.h>
  15. #include <openssl/opensslconf.h>
  16. /*-
  17. * IMPLEMENTATION NOTES.
  18. *
  19. * As you might have noticed 32-bit hash algorithms:
  20. *
  21. * - permit SHA_LONG to be wider than 32-bit
  22. * - optimized versions implement two transform functions: one operating
  23. * on [aligned] data in host byte order and one - on data in input
  24. * stream byte order;
  25. * - share common byte-order neutral collector and padding function
  26. * implementations, crypto/md32_common.h;
  27. *
  28. * Neither of the above applies to this SHA-512 implementations. Reasons
  29. * [in reverse order] are:
  30. *
  31. * - it's the only 64-bit hash algorithm for the moment of this writing,
  32. * there is no need for common collector/padding implementation [yet];
  33. * - by supporting only one transform function [which operates on
  34. * *aligned* data in input stream byte order, big-endian in this case]
  35. * we minimize burden of maintenance in two ways: a) collector/padding
  36. * function is simpler; b) only one transform function to stare at;
  37. * - SHA_LONG64 is required to be exactly 64-bit in order to be able to
  38. * apply a number of optimizations to mitigate potential performance
  39. * penalties caused by previous design decision;
  40. *
  41. * Caveat lector.
  42. *
  43. * Implementation relies on the fact that "long long" is 64-bit on
  44. * both 32- and 64-bit platforms. If some compiler vendor comes up
  45. * with 128-bit long long, adjustment to sha.h would be required.
  46. * As this implementation relies on 64-bit integer type, it's totally
  47. * inappropriate for platforms which don't support it, most notably
  48. * 16-bit platforms.
  49. */
  50. #include <stdlib.h>
  51. #include <string.h>
  52. #include <openssl/crypto.h>
  53. #include <openssl/sha.h>
  54. #include <openssl/opensslv.h>
  55. #include "internal/cryptlib.h"
  56. #include "crypto/sha.h"
  57. #if defined(__i386) || defined(__i386__) || defined(_M_IX86) || \
  58. defined(__x86_64) || defined(_M_AMD64) || defined(_M_X64) || \
  59. defined(__s390__) || defined(__s390x__) || \
  60. defined(__aarch64__) || \
  61. defined(SHA512_ASM)
  62. # define SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA
  63. #endif
  64. #if (defined(_WIN32) || defined(_WIN64)) && !defined(__MINGW32__)
  65. # define U64(C) C##UI64
  66. #elif defined(__arch64__)
  67. # define U64(C) C##UL
  68. #else
  69. # define U64(C) C##ULL
  70. #endif
  71. int sha512_224_init(SHA512_CTX *c)
  72. {
  73. c->h[0] = U64(0x8c3d37c819544da2);
  74. c->h[1] = U64(0x73e1996689dcd4d6);
  75. c->h[2] = U64(0x1dfab7ae32ff9c82);
  76. c->h[3] = U64(0x679dd514582f9fcf);
  77. c->h[4] = U64(0x0f6d2b697bd44da8);
  78. c->h[5] = U64(0x77e36f7304c48942);
  79. c->h[6] = U64(0x3f9d85a86a1d36c8);
  80. c->h[7] = U64(0x1112e6ad91d692a1);
  81. c->Nl = 0;
  82. c->Nh = 0;
  83. c->num = 0;
  84. c->md_len = SHA224_DIGEST_LENGTH;
  85. return 1;
  86. }
  87. int sha512_256_init(SHA512_CTX *c)
  88. {
  89. c->h[0] = U64(0x22312194fc2bf72c);
  90. c->h[1] = U64(0x9f555fa3c84c64c2);
  91. c->h[2] = U64(0x2393b86b6f53b151);
  92. c->h[3] = U64(0x963877195940eabd);
  93. c->h[4] = U64(0x96283ee2a88effe3);
  94. c->h[5] = U64(0xbe5e1e2553863992);
  95. c->h[6] = U64(0x2b0199fc2c85b8aa);
  96. c->h[7] = U64(0x0eb72ddc81c52ca2);
  97. c->Nl = 0;
  98. c->Nh = 0;
  99. c->num = 0;
  100. c->md_len = SHA256_DIGEST_LENGTH;
  101. return 1;
  102. }
  103. int SHA384_Init(SHA512_CTX *c)
  104. {
  105. c->h[0] = U64(0xcbbb9d5dc1059ed8);
  106. c->h[1] = U64(0x629a292a367cd507);
  107. c->h[2] = U64(0x9159015a3070dd17);
  108. c->h[3] = U64(0x152fecd8f70e5939);
  109. c->h[4] = U64(0x67332667ffc00b31);
  110. c->h[5] = U64(0x8eb44a8768581511);
  111. c->h[6] = U64(0xdb0c2e0d64f98fa7);
  112. c->h[7] = U64(0x47b5481dbefa4fa4);
  113. c->Nl = 0;
  114. c->Nh = 0;
  115. c->num = 0;
  116. c->md_len = SHA384_DIGEST_LENGTH;
  117. return 1;
  118. }
  119. int SHA512_Init(SHA512_CTX *c)
  120. {
  121. c->h[0] = U64(0x6a09e667f3bcc908);
  122. c->h[1] = U64(0xbb67ae8584caa73b);
  123. c->h[2] = U64(0x3c6ef372fe94f82b);
  124. c->h[3] = U64(0xa54ff53a5f1d36f1);
  125. c->h[4] = U64(0x510e527fade682d1);
  126. c->h[5] = U64(0x9b05688c2b3e6c1f);
  127. c->h[6] = U64(0x1f83d9abfb41bd6b);
  128. c->h[7] = U64(0x5be0cd19137e2179);
  129. c->Nl = 0;
  130. c->Nh = 0;
  131. c->num = 0;
  132. c->md_len = SHA512_DIGEST_LENGTH;
  133. return 1;
  134. }
  135. #ifndef SHA512_ASM
  136. static
  137. #endif
  138. void sha512_block_data_order(SHA512_CTX *ctx, const void *in, size_t num);
  139. int SHA512_Final(unsigned char *md, SHA512_CTX *c)
  140. {
  141. unsigned char *p = (unsigned char *)c->u.p;
  142. size_t n = c->num;
  143. p[n] = 0x80; /* There always is a room for one */
  144. n++;
  145. if (n > (sizeof(c->u) - 16)) {
  146. memset(p + n, 0, sizeof(c->u) - n);
  147. n = 0;
  148. sha512_block_data_order(c, p, 1);
  149. }
  150. memset(p + n, 0, sizeof(c->u) - 16 - n);
  151. #ifdef B_ENDIAN
  152. c->u.d[SHA_LBLOCK - 2] = c->Nh;
  153. c->u.d[SHA_LBLOCK - 1] = c->Nl;
  154. #else
  155. p[sizeof(c->u) - 1] = (unsigned char)(c->Nl);
  156. p[sizeof(c->u) - 2] = (unsigned char)(c->Nl >> 8);
  157. p[sizeof(c->u) - 3] = (unsigned char)(c->Nl >> 16);
  158. p[sizeof(c->u) - 4] = (unsigned char)(c->Nl >> 24);
  159. p[sizeof(c->u) - 5] = (unsigned char)(c->Nl >> 32);
  160. p[sizeof(c->u) - 6] = (unsigned char)(c->Nl >> 40);
  161. p[sizeof(c->u) - 7] = (unsigned char)(c->Nl >> 48);
  162. p[sizeof(c->u) - 8] = (unsigned char)(c->Nl >> 56);
  163. p[sizeof(c->u) - 9] = (unsigned char)(c->Nh);
  164. p[sizeof(c->u) - 10] = (unsigned char)(c->Nh >> 8);
  165. p[sizeof(c->u) - 11] = (unsigned char)(c->Nh >> 16);
  166. p[sizeof(c->u) - 12] = (unsigned char)(c->Nh >> 24);
  167. p[sizeof(c->u) - 13] = (unsigned char)(c->Nh >> 32);
  168. p[sizeof(c->u) - 14] = (unsigned char)(c->Nh >> 40);
  169. p[sizeof(c->u) - 15] = (unsigned char)(c->Nh >> 48);
  170. p[sizeof(c->u) - 16] = (unsigned char)(c->Nh >> 56);
  171. #endif
  172. sha512_block_data_order(c, p, 1);
  173. if (md == 0)
  174. return 0;
  175. switch (c->md_len) {
  176. /* Let compiler decide if it's appropriate to unroll... */
  177. case SHA224_DIGEST_LENGTH:
  178. for (n = 0; n < SHA224_DIGEST_LENGTH / 8; n++) {
  179. SHA_LONG64 t = c->h[n];
  180. *(md++) = (unsigned char)(t >> 56);
  181. *(md++) = (unsigned char)(t >> 48);
  182. *(md++) = (unsigned char)(t >> 40);
  183. *(md++) = (unsigned char)(t >> 32);
  184. *(md++) = (unsigned char)(t >> 24);
  185. *(md++) = (unsigned char)(t >> 16);
  186. *(md++) = (unsigned char)(t >> 8);
  187. *(md++) = (unsigned char)(t);
  188. }
  189. /*
  190. * For 224 bits, there are four bytes left over that have to be
  191. * processed separately.
  192. */
  193. {
  194. SHA_LONG64 t = c->h[SHA224_DIGEST_LENGTH / 8];
  195. *(md++) = (unsigned char)(t >> 56);
  196. *(md++) = (unsigned char)(t >> 48);
  197. *(md++) = (unsigned char)(t >> 40);
  198. *(md++) = (unsigned char)(t >> 32);
  199. }
  200. break;
  201. case SHA256_DIGEST_LENGTH:
  202. for (n = 0; n < SHA256_DIGEST_LENGTH / 8; n++) {
  203. SHA_LONG64 t = c->h[n];
  204. *(md++) = (unsigned char)(t >> 56);
  205. *(md++) = (unsigned char)(t >> 48);
  206. *(md++) = (unsigned char)(t >> 40);
  207. *(md++) = (unsigned char)(t >> 32);
  208. *(md++) = (unsigned char)(t >> 24);
  209. *(md++) = (unsigned char)(t >> 16);
  210. *(md++) = (unsigned char)(t >> 8);
  211. *(md++) = (unsigned char)(t);
  212. }
  213. break;
  214. case SHA384_DIGEST_LENGTH:
  215. for (n = 0; n < SHA384_DIGEST_LENGTH / 8; n++) {
  216. SHA_LONG64 t = c->h[n];
  217. *(md++) = (unsigned char)(t >> 56);
  218. *(md++) = (unsigned char)(t >> 48);
  219. *(md++) = (unsigned char)(t >> 40);
  220. *(md++) = (unsigned char)(t >> 32);
  221. *(md++) = (unsigned char)(t >> 24);
  222. *(md++) = (unsigned char)(t >> 16);
  223. *(md++) = (unsigned char)(t >> 8);
  224. *(md++) = (unsigned char)(t);
  225. }
  226. break;
  227. case SHA512_DIGEST_LENGTH:
  228. for (n = 0; n < SHA512_DIGEST_LENGTH / 8; n++) {
  229. SHA_LONG64 t = c->h[n];
  230. *(md++) = (unsigned char)(t >> 56);
  231. *(md++) = (unsigned char)(t >> 48);
  232. *(md++) = (unsigned char)(t >> 40);
  233. *(md++) = (unsigned char)(t >> 32);
  234. *(md++) = (unsigned char)(t >> 24);
  235. *(md++) = (unsigned char)(t >> 16);
  236. *(md++) = (unsigned char)(t >> 8);
  237. *(md++) = (unsigned char)(t);
  238. }
  239. break;
  240. /* ... as well as make sure md_len is not abused. */
  241. default:
  242. return 0;
  243. }
  244. return 1;
  245. }
  246. int SHA384_Final(unsigned char *md, SHA512_CTX *c)
  247. {
  248. return SHA512_Final(md, c);
  249. }
  250. int SHA512_Update(SHA512_CTX *c, const void *_data, size_t len)
  251. {
  252. SHA_LONG64 l;
  253. unsigned char *p = c->u.p;
  254. const unsigned char *data = (const unsigned char *)_data;
  255. if (len == 0)
  256. return 1;
  257. l = (c->Nl + (((SHA_LONG64) len) << 3)) & U64(0xffffffffffffffff);
  258. if (l < c->Nl)
  259. c->Nh++;
  260. if (sizeof(len) >= 8)
  261. c->Nh += (((SHA_LONG64) len) >> 61);
  262. c->Nl = l;
  263. if (c->num != 0) {
  264. size_t n = sizeof(c->u) - c->num;
  265. if (len < n) {
  266. memcpy(p + c->num, data, len), c->num += (unsigned int)len;
  267. return 1;
  268. } else {
  269. memcpy(p + c->num, data, n), c->num = 0;
  270. len -= n, data += n;
  271. sha512_block_data_order(c, p, 1);
  272. }
  273. }
  274. if (len >= sizeof(c->u)) {
  275. #ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA
  276. if ((size_t)data % sizeof(c->u.d[0]) != 0)
  277. while (len >= sizeof(c->u))
  278. memcpy(p, data, sizeof(c->u)),
  279. sha512_block_data_order(c, p, 1),
  280. len -= sizeof(c->u), data += sizeof(c->u);
  281. else
  282. #endif
  283. sha512_block_data_order(c, data, len / sizeof(c->u)),
  284. data += len, len %= sizeof(c->u), data -= len;
  285. }
  286. if (len != 0)
  287. memcpy(p, data, len), c->num = (int)len;
  288. return 1;
  289. }
  290. int SHA384_Update(SHA512_CTX *c, const void *data, size_t len)
  291. {
  292. return SHA512_Update(c, data, len);
  293. }
  294. void SHA512_Transform(SHA512_CTX *c, const unsigned char *data)
  295. {
  296. #ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA
  297. if ((size_t)data % sizeof(c->u.d[0]) != 0)
  298. memcpy(c->u.p, data, sizeof(c->u.p)), data = c->u.p;
  299. #endif
  300. sha512_block_data_order(c, data, 1);
  301. }
  302. #ifndef SHA512_ASM
  303. static const SHA_LONG64 K512[80] = {
  304. U64(0x428a2f98d728ae22), U64(0x7137449123ef65cd),
  305. U64(0xb5c0fbcfec4d3b2f), U64(0xe9b5dba58189dbbc),
  306. U64(0x3956c25bf348b538), U64(0x59f111f1b605d019),
  307. U64(0x923f82a4af194f9b), U64(0xab1c5ed5da6d8118),
  308. U64(0xd807aa98a3030242), U64(0x12835b0145706fbe),
  309. U64(0x243185be4ee4b28c), U64(0x550c7dc3d5ffb4e2),
  310. U64(0x72be5d74f27b896f), U64(0x80deb1fe3b1696b1),
  311. U64(0x9bdc06a725c71235), U64(0xc19bf174cf692694),
  312. U64(0xe49b69c19ef14ad2), U64(0xefbe4786384f25e3),
  313. U64(0x0fc19dc68b8cd5b5), U64(0x240ca1cc77ac9c65),
  314. U64(0x2de92c6f592b0275), U64(0x4a7484aa6ea6e483),
  315. U64(0x5cb0a9dcbd41fbd4), U64(0x76f988da831153b5),
  316. U64(0x983e5152ee66dfab), U64(0xa831c66d2db43210),
  317. U64(0xb00327c898fb213f), U64(0xbf597fc7beef0ee4),
  318. U64(0xc6e00bf33da88fc2), U64(0xd5a79147930aa725),
  319. U64(0x06ca6351e003826f), U64(0x142929670a0e6e70),
  320. U64(0x27b70a8546d22ffc), U64(0x2e1b21385c26c926),
  321. U64(0x4d2c6dfc5ac42aed), U64(0x53380d139d95b3df),
  322. U64(0x650a73548baf63de), U64(0x766a0abb3c77b2a8),
  323. U64(0x81c2c92e47edaee6), U64(0x92722c851482353b),
  324. U64(0xa2bfe8a14cf10364), U64(0xa81a664bbc423001),
  325. U64(0xc24b8b70d0f89791), U64(0xc76c51a30654be30),
  326. U64(0xd192e819d6ef5218), U64(0xd69906245565a910),
  327. U64(0xf40e35855771202a), U64(0x106aa07032bbd1b8),
  328. U64(0x19a4c116b8d2d0c8), U64(0x1e376c085141ab53),
  329. U64(0x2748774cdf8eeb99), U64(0x34b0bcb5e19b48a8),
  330. U64(0x391c0cb3c5c95a63), U64(0x4ed8aa4ae3418acb),
  331. U64(0x5b9cca4f7763e373), U64(0x682e6ff3d6b2b8a3),
  332. U64(0x748f82ee5defb2fc), U64(0x78a5636f43172f60),
  333. U64(0x84c87814a1f0ab72), U64(0x8cc702081a6439ec),
  334. U64(0x90befffa23631e28), U64(0xa4506cebde82bde9),
  335. U64(0xbef9a3f7b2c67915), U64(0xc67178f2e372532b),
  336. U64(0xca273eceea26619c), U64(0xd186b8c721c0c207),
  337. U64(0xeada7dd6cde0eb1e), U64(0xf57d4f7fee6ed178),
  338. U64(0x06f067aa72176fba), U64(0x0a637dc5a2c898a6),
  339. U64(0x113f9804bef90dae), U64(0x1b710b35131c471b),
  340. U64(0x28db77f523047d84), U64(0x32caab7b40c72493),
  341. U64(0x3c9ebe0a15c9bebc), U64(0x431d67c49c100d4c),
  342. U64(0x4cc5d4becb3e42b6), U64(0x597f299cfc657e2a),
  343. U64(0x5fcb6fab3ad6faec), U64(0x6c44198c4a475817)
  344. };
  345. # ifndef PEDANTIC
  346. # if defined(__GNUC__) && __GNUC__>=2 && \
  347. !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
  348. # if defined(__x86_64) || defined(__x86_64__)
  349. # define ROTR(a,n) ({ SHA_LONG64 ret; \
  350. asm ("rorq %1,%0" \
  351. : "=r"(ret) \
  352. : "J"(n),"0"(a) \
  353. : "cc"); ret; })
  354. # if !defined(B_ENDIAN)
  355. # define PULL64(x) ({ SHA_LONG64 ret=*((const SHA_LONG64 *)(&(x))); \
  356. asm ("bswapq %0" \
  357. : "=r"(ret) \
  358. : "0"(ret)); ret; })
  359. # endif
  360. # elif (defined(__i386) || defined(__i386__)) && !defined(B_ENDIAN)
  361. # if defined(I386_ONLY)
  362. # define PULL64(x) ({ const unsigned int *p=(const unsigned int *)(&(x));\
  363. unsigned int hi=p[0],lo=p[1]; \
  364. asm("xchgb %%ah,%%al;xchgb %%dh,%%dl;"\
  365. "roll $16,%%eax; roll $16,%%edx; "\
  366. "xchgb %%ah,%%al;xchgb %%dh,%%dl;"\
  367. : "=a"(lo),"=d"(hi) \
  368. : "0"(lo),"1"(hi) : "cc"); \
  369. ((SHA_LONG64)hi)<<32|lo; })
  370. # else
  371. # define PULL64(x) ({ const unsigned int *p=(const unsigned int *)(&(x));\
  372. unsigned int hi=p[0],lo=p[1]; \
  373. asm ("bswapl %0; bswapl %1;" \
  374. : "=r"(lo),"=r"(hi) \
  375. : "0"(lo),"1"(hi)); \
  376. ((SHA_LONG64)hi)<<32|lo; })
  377. # endif
  378. # elif (defined(_ARCH_PPC) && defined(__64BIT__)) || defined(_ARCH_PPC64)
  379. # define ROTR(a,n) ({ SHA_LONG64 ret; \
  380. asm ("rotrdi %0,%1,%2" \
  381. : "=r"(ret) \
  382. : "r"(a),"K"(n)); ret; })
  383. # elif defined(__aarch64__)
  384. # define ROTR(a,n) ({ SHA_LONG64 ret; \
  385. asm ("ror %0,%1,%2" \
  386. : "=r"(ret) \
  387. : "r"(a),"I"(n)); ret; })
  388. # if defined(__BYTE_ORDER__) && defined(__ORDER_LITTLE_ENDIAN__) && \
  389. __BYTE_ORDER__==__ORDER_LITTLE_ENDIAN__
  390. # define PULL64(x) ({ SHA_LONG64 ret; \
  391. asm ("rev %0,%1" \
  392. : "=r"(ret) \
  393. : "r"(*((const SHA_LONG64 *)(&(x))))); ret; })
  394. # endif
  395. # elif (defined(__riscv_zbkb) || defined(__riscv_zbb)) && __riscv_xlen == 32
  396. # define PULL64(x) ({ SHA_LONG64 ret; \
  397. unsigned int *r = (unsigned int *)(&(ret)); \
  398. const unsigned int *p = (const unsigned int *)(&(x)); \
  399. asm ("rev8 %0, %1" \
  400. : "=r"(r[0]) \
  401. : "r" (p[1])); \
  402. asm ("rev8 %0, %1" \
  403. : "=r"(r[1]) \
  404. : "r" (p[0])); ret; })
  405. # elif (defined(__riscv_zbkb) || defined(__riscv_zbb)) && __riscv_xlen == 64
  406. # define PULL64(x) ({ SHA_LONG64 ret; \
  407. asm ("rev8 %0, %1" \
  408. : "=r"(ret) \
  409. : "r"(x)); ret; })
  410. # endif
  411. # if defined(__riscv_zknh) && __riscv_xlen == 32
  412. # define Sigma0(x) ({ SHA_LONG64 ret; unsigned int *r = (unsigned int *)(&(ret)); \
  413. const unsigned int *p = (const unsigned int *)(&(x)); \
  414. asm ("sha512sum0r %0, %1, %2" \
  415. : "=r"(r[0]) \
  416. : "r" (p[0]), "r" (p[1])); \
  417. asm ("sha512sum0r %0, %2, %1" \
  418. : "=r"(r[1]) \
  419. : "r" (p[0]), "r" (p[1])); ret; })
  420. # define Sigma1(x) ({ SHA_LONG64 ret; unsigned int *r = (unsigned int *)(&(ret)); \
  421. const unsigned int *p = (const unsigned int *)(&(x)); \
  422. asm ("sha512sum1r %0, %1, %2" \
  423. : "=r"(r[0]) \
  424. : "r" (p[0]), "r" (p[1])); \
  425. asm ("sha512sum1r %0, %2, %1" \
  426. : "=r"(r[1]) \
  427. : "r" (p[0]), "r" (p[1])); ret; })
  428. # define sigma0(x) ({ SHA_LONG64 ret; unsigned int *r = (unsigned int *)(&(ret)); \
  429. const unsigned int *p = (const unsigned int *)(&(x)); \
  430. asm ("sha512sig0l %0, %1, %2" \
  431. : "=r"(r[0]) \
  432. : "r" (p[0]), "r" (p[1])); \
  433. asm ("sha512sig0h %0, %2, %1" \
  434. : "=r"(r[1]) \
  435. : "r" (p[0]), "r" (p[1])); ret; })
  436. # define sigma1(x) ({ SHA_LONG64 ret; unsigned int *r = (unsigned int *)(&(ret)); \
  437. const unsigned int *p = (const unsigned int *)(&(x)); \
  438. asm ("sha512sig1l %0, %1, %2" \
  439. : "=r"(r[0]) \
  440. : "r" (p[0]), "r" (p[1])); \
  441. asm ("sha512sig1h %0, %2, %1" \
  442. : "=r"(r[1]) \
  443. : "r" (p[0]), "r" (p[1])); ret; })
  444. # elif defined(__riscv_zknh) && __riscv_xlen == 64
  445. # define Sigma0(x) ({ SHA_LONG64 ret; \
  446. asm ("sha512sum0 %0, %1" \
  447. : "=r"(ret) \
  448. : "r"(x)); ret; })
  449. # define Sigma1(x) ({ SHA_LONG64 ret; \
  450. asm ("sha512sum1 %0, %1" \
  451. : "=r"(ret) \
  452. : "r"(x)); ret; })
  453. # define sigma0(x) ({ SHA_LONG64 ret; \
  454. asm ("sha512sig0 %0, %1" \
  455. : "=r"(ret) \
  456. : "r"(x)); ret; })
  457. # define sigma1(x) ({ SHA_LONG64 ret; \
  458. asm ("sha512sig1 %0, %1" \
  459. : "=r"(ret) \
  460. : "r"(x)); ret; })
  461. # endif
  462. # if (defined(__riscv_zbt) || defined(__riscv_zpn)) && __riscv_xlen == 32
  463. # define Ch(x,y,z) ({ SHA_LONG64 ret; unsigned int *r = (unsigned int *)(&(ret)); \
  464. const unsigned int *xp = (const unsigned int *)(&(x)); \
  465. const unsigned int *yp = (const unsigned int *)(&(y)); \
  466. const unsigned int *zp = (const unsigned int *)(&(z)); \
  467. asm (".insn r4 0x33, 1, 0x3, %0, %2, %1, %3\n\t" \
  468. : "=r"(r[0]) \
  469. : "r"(xp[0]), "r"(yp[0]), "r"(zp[0])); \
  470. asm (".insn r4 0x33, 1, 0x3, %0, %2, %1, %3\n\t" \
  471. : "=r"(r[1]) \
  472. : "r"(xp[1]), "r"(yp[1]), "r"(zp[1])); ret; })
  473. # define Maj(x,y,z) ({ SHA_LONG64 ret; unsigned int *r = (unsigned int *)(&(ret)); \
  474. const unsigned int *xp = (const unsigned int *)(&(x)); \
  475. const unsigned int *yp = (const unsigned int *)(&(y)); \
  476. const unsigned int *zp = (const unsigned int *)(&(z)); \
  477. asm (".insn r4 0x33, 1, 0x3, %0, %2, %1, %3\n\t" \
  478. : "=r"(r[0]) \
  479. : "r"(xp[0]^zp[0]), "r"(yp[0]), "r"(zp[0])); \
  480. asm (".insn r4 0x33, 1, 0x3, %0, %2, %1, %3\n\t" \
  481. : "=r"(r[1]) \
  482. : "r"(xp[1]^zp[1]), "r"(yp[1]), "r"(zp[1])); ret; })
  483. # elif (defined(__riscv_zbt) || defined(__riscv_zpn)) && __riscv_xlen == 64
  484. # define Ch(x,y,z) ({ SHA_LONG64 ret; \
  485. asm (".insn r4 0x33, 1, 0x3, %0, %2, %1, %3"\
  486. : "=r"(ret) \
  487. : "r"(x), "r"(y), "r"(z)); ret; })
  488. # define Maj(x,y,z) ({ SHA_LONG64 ret; \
  489. asm (".insn r4 0x33, 1, 0x3, %0, %2, %1, %3"\
  490. : "=r"(ret) \
  491. : "r"(x^z), "r"(y), "r"(x)); ret; })
  492. # endif
  493. # elif defined(_MSC_VER)
  494. # if defined(_WIN64) /* applies to both IA-64 and AMD64 */
  495. # pragma intrinsic(_rotr64)
  496. # define ROTR(a,n) _rotr64((a),n)
  497. # endif
  498. # if defined(_M_IX86) && !defined(OPENSSL_NO_ASM) && \
  499. !defined(OPENSSL_NO_INLINE_ASM)
  500. # if defined(I386_ONLY)
  501. static SHA_LONG64 __fastcall __pull64be(const void *x)
  502. {
  503. _asm mov edx,[ecx + 0]
  504. _asm mov eax,[ecx + 4]
  505. _asm xchg dh, dl
  506. _asm xchg ah, al
  507. _asm rol edx, 16
  508. _asm rol eax, 16
  509. _asm xchg dh, dl
  510. _asm xchg ah, al
  511. }
  512. # else
  513. static SHA_LONG64 __fastcall __pull64be(const void *x)
  514. {
  515. _asm mov edx,[ecx + 0]
  516. _asm mov eax,[ecx + 4]
  517. _asm bswap edx
  518. _asm bswap eax
  519. }
  520. # endif
  521. # define PULL64(x) __pull64be(&(x))
  522. # endif
  523. # endif
  524. # endif
  525. # ifndef PULL64
  526. # define B(x,j) (((SHA_LONG64)(*(((const unsigned char *)(&x))+j)))<<((7-j)*8))
  527. # 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))
  528. # endif
  529. # ifndef ROTR
  530. # define ROTR(x,s) (((x)>>s) | (x)<<(64-s))
  531. # endif
  532. # ifndef Sigma0
  533. # define Sigma0(x) (ROTR((x),28) ^ ROTR((x),34) ^ ROTR((x),39))
  534. # endif
  535. # ifndef Sigma1
  536. # define Sigma1(x) (ROTR((x),14) ^ ROTR((x),18) ^ ROTR((x),41))
  537. # endif
  538. # ifndef sigma0
  539. # define sigma0(x) (ROTR((x),1) ^ ROTR((x),8) ^ ((x)>>7))
  540. # endif
  541. # ifndef sigma1
  542. # define sigma1(x) (ROTR((x),19) ^ ROTR((x),61) ^ ((x)>>6))
  543. # endif
  544. # ifndef Ch
  545. # define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
  546. # endif
  547. # ifndef Maj
  548. # define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
  549. # endif
  550. # if defined(__i386) || defined(__i386__) || defined(_M_IX86)
  551. /*
  552. * This code should give better results on 32-bit CPU with less than
  553. * ~24 registers, both size and performance wise...
  554. */
  555. static void sha512_block_data_order(SHA512_CTX *ctx, const void *in,
  556. size_t num)
  557. {
  558. const SHA_LONG64 *W = in;
  559. SHA_LONG64 A, E, T;
  560. SHA_LONG64 X[9 + 80], *F;
  561. int i;
  562. while (num--) {
  563. F = X + 80;
  564. A = ctx->h[0];
  565. F[1] = ctx->h[1];
  566. F[2] = ctx->h[2];
  567. F[3] = ctx->h[3];
  568. E = ctx->h[4];
  569. F[5] = ctx->h[5];
  570. F[6] = ctx->h[6];
  571. F[7] = ctx->h[7];
  572. for (i = 0; i < 16; i++, F--) {
  573. # ifdef B_ENDIAN
  574. T = W[i];
  575. # else
  576. T = PULL64(W[i]);
  577. # endif
  578. F[0] = A;
  579. F[4] = E;
  580. F[8] = T;
  581. T += F[7] + Sigma1(E) + Ch(E, F[5], F[6]) + K512[i];
  582. E = F[3] + T;
  583. A = T + Sigma0(A) + Maj(A, F[1], F[2]);
  584. }
  585. for (; i < 80; i++, F--) {
  586. T = sigma0(F[8 + 16 - 1]);
  587. T += sigma1(F[8 + 16 - 14]);
  588. T += F[8 + 16] + F[8 + 16 - 9];
  589. F[0] = A;
  590. F[4] = E;
  591. F[8] = T;
  592. T += F[7] + Sigma1(E) + Ch(E, F[5], F[6]) + K512[i];
  593. E = F[3] + T;
  594. A = T + Sigma0(A) + Maj(A, F[1], F[2]);
  595. }
  596. ctx->h[0] += A;
  597. ctx->h[1] += F[1];
  598. ctx->h[2] += F[2];
  599. ctx->h[3] += F[3];
  600. ctx->h[4] += E;
  601. ctx->h[5] += F[5];
  602. ctx->h[6] += F[6];
  603. ctx->h[7] += F[7];
  604. W += SHA_LBLOCK;
  605. }
  606. }
  607. # elif defined(OPENSSL_SMALL_FOOTPRINT)
  608. static void sha512_block_data_order(SHA512_CTX *ctx, const void *in,
  609. size_t num)
  610. {
  611. const SHA_LONG64 *W = in;
  612. SHA_LONG64 a, b, c, d, e, f, g, h, s0, s1, T1, T2;
  613. SHA_LONG64 X[16];
  614. int i;
  615. while (num--) {
  616. a = ctx->h[0];
  617. b = ctx->h[1];
  618. c = ctx->h[2];
  619. d = ctx->h[3];
  620. e = ctx->h[4];
  621. f = ctx->h[5];
  622. g = ctx->h[6];
  623. h = ctx->h[7];
  624. for (i = 0; i < 16; i++) {
  625. # ifdef B_ENDIAN
  626. T1 = X[i] = W[i];
  627. # else
  628. T1 = X[i] = PULL64(W[i]);
  629. # endif
  630. T1 += h + Sigma1(e) + Ch(e, f, g) + K512[i];
  631. T2 = Sigma0(a) + Maj(a, b, c);
  632. h = g;
  633. g = f;
  634. f = e;
  635. e = d + T1;
  636. d = c;
  637. c = b;
  638. b = a;
  639. a = T1 + T2;
  640. }
  641. for (; i < 80; i++) {
  642. s0 = X[(i + 1) & 0x0f];
  643. s0 = sigma0(s0);
  644. s1 = X[(i + 14) & 0x0f];
  645. s1 = sigma1(s1);
  646. T1 = X[i & 0xf] += s0 + s1 + X[(i + 9) & 0xf];
  647. T1 += h + Sigma1(e) + Ch(e, f, g) + K512[i];
  648. T2 = Sigma0(a) + Maj(a, b, c);
  649. h = g;
  650. g = f;
  651. f = e;
  652. e = d + T1;
  653. d = c;
  654. c = b;
  655. b = a;
  656. a = T1 + T2;
  657. }
  658. ctx->h[0] += a;
  659. ctx->h[1] += b;
  660. ctx->h[2] += c;
  661. ctx->h[3] += d;
  662. ctx->h[4] += e;
  663. ctx->h[5] += f;
  664. ctx->h[6] += g;
  665. ctx->h[7] += h;
  666. W += SHA_LBLOCK;
  667. }
  668. }
  669. # else
  670. # define ROUND_00_15(i,a,b,c,d,e,f,g,h) do { \
  671. T1 += h + Sigma1(e) + Ch(e,f,g) + K512[i]; \
  672. h = Sigma0(a) + Maj(a,b,c); \
  673. d += T1; h += T1; } while (0)
  674. # define ROUND_16_80(i,j,a,b,c,d,e,f,g,h,X) do { \
  675. s0 = X[(j+1)&0x0f]; s0 = sigma0(s0); \
  676. s1 = X[(j+14)&0x0f]; s1 = sigma1(s1); \
  677. T1 = X[(j)&0x0f] += s0 + s1 + X[(j+9)&0x0f]; \
  678. ROUND_00_15(i+j,a,b,c,d,e,f,g,h); } while (0)
  679. static void sha512_block_data_order(SHA512_CTX *ctx, const void *in,
  680. size_t num)
  681. {
  682. const SHA_LONG64 *W = in;
  683. SHA_LONG64 a, b, c, d, e, f, g, h, s0, s1, T1;
  684. SHA_LONG64 X[16];
  685. int i;
  686. while (num--) {
  687. a = ctx->h[0];
  688. b = ctx->h[1];
  689. c = ctx->h[2];
  690. d = ctx->h[3];
  691. e = ctx->h[4];
  692. f = ctx->h[5];
  693. g = ctx->h[6];
  694. h = ctx->h[7];
  695. # ifdef B_ENDIAN
  696. T1 = X[0] = W[0];
  697. ROUND_00_15(0, a, b, c, d, e, f, g, h);
  698. T1 = X[1] = W[1];
  699. ROUND_00_15(1, h, a, b, c, d, e, f, g);
  700. T1 = X[2] = W[2];
  701. ROUND_00_15(2, g, h, a, b, c, d, e, f);
  702. T1 = X[3] = W[3];
  703. ROUND_00_15(3, f, g, h, a, b, c, d, e);
  704. T1 = X[4] = W[4];
  705. ROUND_00_15(4, e, f, g, h, a, b, c, d);
  706. T1 = X[5] = W[5];
  707. ROUND_00_15(5, d, e, f, g, h, a, b, c);
  708. T1 = X[6] = W[6];
  709. ROUND_00_15(6, c, d, e, f, g, h, a, b);
  710. T1 = X[7] = W[7];
  711. ROUND_00_15(7, b, c, d, e, f, g, h, a);
  712. T1 = X[8] = W[8];
  713. ROUND_00_15(8, a, b, c, d, e, f, g, h);
  714. T1 = X[9] = W[9];
  715. ROUND_00_15(9, h, a, b, c, d, e, f, g);
  716. T1 = X[10] = W[10];
  717. ROUND_00_15(10, g, h, a, b, c, d, e, f);
  718. T1 = X[11] = W[11];
  719. ROUND_00_15(11, f, g, h, a, b, c, d, e);
  720. T1 = X[12] = W[12];
  721. ROUND_00_15(12, e, f, g, h, a, b, c, d);
  722. T1 = X[13] = W[13];
  723. ROUND_00_15(13, d, e, f, g, h, a, b, c);
  724. T1 = X[14] = W[14];
  725. ROUND_00_15(14, c, d, e, f, g, h, a, b);
  726. T1 = X[15] = W[15];
  727. ROUND_00_15(15, b, c, d, e, f, g, h, a);
  728. # else
  729. T1 = X[0] = PULL64(W[0]);
  730. ROUND_00_15(0, a, b, c, d, e, f, g, h);
  731. T1 = X[1] = PULL64(W[1]);
  732. ROUND_00_15(1, h, a, b, c, d, e, f, g);
  733. T1 = X[2] = PULL64(W[2]);
  734. ROUND_00_15(2, g, h, a, b, c, d, e, f);
  735. T1 = X[3] = PULL64(W[3]);
  736. ROUND_00_15(3, f, g, h, a, b, c, d, e);
  737. T1 = X[4] = PULL64(W[4]);
  738. ROUND_00_15(4, e, f, g, h, a, b, c, d);
  739. T1 = X[5] = PULL64(W[5]);
  740. ROUND_00_15(5, d, e, f, g, h, a, b, c);
  741. T1 = X[6] = PULL64(W[6]);
  742. ROUND_00_15(6, c, d, e, f, g, h, a, b);
  743. T1 = X[7] = PULL64(W[7]);
  744. ROUND_00_15(7, b, c, d, e, f, g, h, a);
  745. T1 = X[8] = PULL64(W[8]);
  746. ROUND_00_15(8, a, b, c, d, e, f, g, h);
  747. T1 = X[9] = PULL64(W[9]);
  748. ROUND_00_15(9, h, a, b, c, d, e, f, g);
  749. T1 = X[10] = PULL64(W[10]);
  750. ROUND_00_15(10, g, h, a, b, c, d, e, f);
  751. T1 = X[11] = PULL64(W[11]);
  752. ROUND_00_15(11, f, g, h, a, b, c, d, e);
  753. T1 = X[12] = PULL64(W[12]);
  754. ROUND_00_15(12, e, f, g, h, a, b, c, d);
  755. T1 = X[13] = PULL64(W[13]);
  756. ROUND_00_15(13, d, e, f, g, h, a, b, c);
  757. T1 = X[14] = PULL64(W[14]);
  758. ROUND_00_15(14, c, d, e, f, g, h, a, b);
  759. T1 = X[15] = PULL64(W[15]);
  760. ROUND_00_15(15, b, c, d, e, f, g, h, a);
  761. # endif
  762. for (i = 16; i < 80; i += 16) {
  763. ROUND_16_80(i, 0, a, b, c, d, e, f, g, h, X);
  764. ROUND_16_80(i, 1, h, a, b, c, d, e, f, g, X);
  765. ROUND_16_80(i, 2, g, h, a, b, c, d, e, f, X);
  766. ROUND_16_80(i, 3, f, g, h, a, b, c, d, e, X);
  767. ROUND_16_80(i, 4, e, f, g, h, a, b, c, d, X);
  768. ROUND_16_80(i, 5, d, e, f, g, h, a, b, c, X);
  769. ROUND_16_80(i, 6, c, d, e, f, g, h, a, b, X);
  770. ROUND_16_80(i, 7, b, c, d, e, f, g, h, a, X);
  771. ROUND_16_80(i, 8, a, b, c, d, e, f, g, h, X);
  772. ROUND_16_80(i, 9, h, a, b, c, d, e, f, g, X);
  773. ROUND_16_80(i, 10, g, h, a, b, c, d, e, f, X);
  774. ROUND_16_80(i, 11, f, g, h, a, b, c, d, e, X);
  775. ROUND_16_80(i, 12, e, f, g, h, a, b, c, d, X);
  776. ROUND_16_80(i, 13, d, e, f, g, h, a, b, c, X);
  777. ROUND_16_80(i, 14, c, d, e, f, g, h, a, b, X);
  778. ROUND_16_80(i, 15, b, c, d, e, f, g, h, a, X);
  779. }
  780. ctx->h[0] += a;
  781. ctx->h[1] += b;
  782. ctx->h[2] += c;
  783. ctx->h[3] += d;
  784. ctx->h[4] += e;
  785. ctx->h[5] += f;
  786. ctx->h[6] += g;
  787. ctx->h[7] += h;
  788. W += SHA_LBLOCK;
  789. }
  790. }
  791. # endif
  792. #endif /* SHA512_ASM */