sha512-avx-asm.S 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423
  1. ########################################################################
  2. # Implement fast SHA-512 with AVX instructions. (x86_64)
  3. #
  4. # Copyright (C) 2013 Intel Corporation.
  5. #
  6. # Authors:
  7. # James Guilford <[email protected]>
  8. # Kirk Yap <[email protected]>
  9. # David Cote <[email protected]>
  10. # Tim Chen <[email protected]>
  11. #
  12. # This software is available to you under a choice of one of two
  13. # licenses. You may choose to be licensed under the terms of the GNU
  14. # General Public License (GPL) Version 2, available from the file
  15. # COPYING in the main directory of this source tree, or the
  16. # OpenIB.org BSD license below:
  17. #
  18. # Redistribution and use in source and binary forms, with or
  19. # without modification, are permitted provided that the following
  20. # conditions are met:
  21. #
  22. # - Redistributions of source code must retain the above
  23. # copyright notice, this list of conditions and the following
  24. # disclaimer.
  25. #
  26. # - Redistributions in binary form must reproduce the above
  27. # copyright notice, this list of conditions and the following
  28. # disclaimer in the documentation and/or other materials
  29. # provided with the distribution.
  30. #
  31. # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  32. # EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  33. # MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  34. # NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  35. # BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  36. # ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  37. # CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  38. # SOFTWARE.
  39. #
  40. ########################################################################
  41. #
  42. # This code is described in an Intel White-Paper:
  43. # "Fast SHA-512 Implementations on Intel Architecture Processors"
  44. #
  45. # To find it, surf to http://www.intel.com/p/en_US/embedded
  46. # and search for that title.
  47. #
  48. ########################################################################
  49. #include <linux/linkage.h>
  50. #include <linux/cfi_types.h>
  51. .text
  52. # Virtual Registers
  53. # ARG1
  54. digest = %rdi
  55. # ARG2
  56. msg = %rsi
  57. # ARG3
  58. msglen = %rdx
  59. T1 = %rcx
  60. T2 = %r8
  61. a_64 = %r9
  62. b_64 = %r10
  63. c_64 = %r11
  64. d_64 = %r12
  65. e_64 = %r13
  66. f_64 = %r14
  67. g_64 = %r15
  68. h_64 = %rbx
  69. tmp0 = %rax
  70. # Local variables (stack frame)
  71. # Message Schedule
  72. W_SIZE = 80*8
  73. # W[t] + K[t] | W[t+1] + K[t+1]
  74. WK_SIZE = 2*8
  75. frame_W = 0
  76. frame_WK = frame_W + W_SIZE
  77. frame_size = frame_WK + WK_SIZE
  78. # Useful QWORD "arrays" for simpler memory references
  79. # MSG, DIGEST, K_t, W_t are arrays
  80. # WK_2(t) points to 1 of 2 qwords at frame.WK depdending on t being odd/even
  81. # Input message (arg1)
  82. #define MSG(i) 8*i(msg)
  83. # Output Digest (arg2)
  84. #define DIGEST(i) 8*i(digest)
  85. # SHA Constants (static mem)
  86. #define K_t(i) 8*i+K512(%rip)
  87. # Message Schedule (stack frame)
  88. #define W_t(i) 8*i+frame_W(%rsp)
  89. # W[t]+K[t] (stack frame)
  90. #define WK_2(i) 8*((i%2))+frame_WK(%rsp)
  91. .macro RotateState
  92. # Rotate symbols a..h right
  93. TMP = h_64
  94. h_64 = g_64
  95. g_64 = f_64
  96. f_64 = e_64
  97. e_64 = d_64
  98. d_64 = c_64
  99. c_64 = b_64
  100. b_64 = a_64
  101. a_64 = TMP
  102. .endm
  103. .macro RORQ p1 p2
  104. # shld is faster than ror on Sandybridge
  105. shld $(64-\p2), \p1, \p1
  106. .endm
  107. .macro SHA512_Round rnd
  108. # Compute Round %%t
  109. mov f_64, T1 # T1 = f
  110. mov e_64, tmp0 # tmp = e
  111. xor g_64, T1 # T1 = f ^ g
  112. RORQ tmp0, 23 # 41 # tmp = e ror 23
  113. and e_64, T1 # T1 = (f ^ g) & e
  114. xor e_64, tmp0 # tmp = (e ror 23) ^ e
  115. xor g_64, T1 # T1 = ((f ^ g) & e) ^ g = CH(e,f,g)
  116. idx = \rnd
  117. add WK_2(idx), T1 # W[t] + K[t] from message scheduler
  118. RORQ tmp0, 4 # 18 # tmp = ((e ror 23) ^ e) ror 4
  119. xor e_64, tmp0 # tmp = (((e ror 23) ^ e) ror 4) ^ e
  120. mov a_64, T2 # T2 = a
  121. add h_64, T1 # T1 = CH(e,f,g) + W[t] + K[t] + h
  122. RORQ tmp0, 14 # 14 # tmp = ((((e ror23)^e)ror4)^e)ror14 = S1(e)
  123. add tmp0, T1 # T1 = CH(e,f,g) + W[t] + K[t] + S1(e)
  124. mov a_64, tmp0 # tmp = a
  125. xor c_64, T2 # T2 = a ^ c
  126. and c_64, tmp0 # tmp = a & c
  127. and b_64, T2 # T2 = (a ^ c) & b
  128. xor tmp0, T2 # T2 = ((a ^ c) & b) ^ (a & c) = Maj(a,b,c)
  129. mov a_64, tmp0 # tmp = a
  130. RORQ tmp0, 5 # 39 # tmp = a ror 5
  131. xor a_64, tmp0 # tmp = (a ror 5) ^ a
  132. add T1, d_64 # e(next_state) = d + T1
  133. RORQ tmp0, 6 # 34 # tmp = ((a ror 5) ^ a) ror 6
  134. xor a_64, tmp0 # tmp = (((a ror 5) ^ a) ror 6) ^ a
  135. lea (T1, T2), h_64 # a(next_state) = T1 + Maj(a,b,c)
  136. RORQ tmp0, 28 # 28 # tmp = ((((a ror5)^a)ror6)^a)ror28 = S0(a)
  137. add tmp0, h_64 # a(next_state) = T1 + Maj(a,b,c) S0(a)
  138. RotateState
  139. .endm
  140. .macro SHA512_2Sched_2Round_avx rnd
  141. # Compute rounds t-2 and t-1
  142. # Compute message schedule QWORDS t and t+1
  143. # Two rounds are computed based on the values for K[t-2]+W[t-2] and
  144. # K[t-1]+W[t-1] which were previously stored at WK_2 by the message
  145. # scheduler.
  146. # The two new schedule QWORDS are stored at [W_t(t)] and [W_t(t+1)].
  147. # They are then added to their respective SHA512 constants at
  148. # [K_t(t)] and [K_t(t+1)] and stored at dqword [WK_2(t)]
  149. # For brievity, the comments following vectored instructions only refer to
  150. # the first of a pair of QWORDS.
  151. # Eg. XMM4=W[t-2] really means XMM4={W[t-2]|W[t-1]}
  152. # The computation of the message schedule and the rounds are tightly
  153. # stitched to take advantage of instruction-level parallelism.
  154. idx = \rnd - 2
  155. vmovdqa W_t(idx), %xmm4 # XMM4 = W[t-2]
  156. idx = \rnd - 15
  157. vmovdqu W_t(idx), %xmm5 # XMM5 = W[t-15]
  158. mov f_64, T1
  159. vpsrlq $61, %xmm4, %xmm0 # XMM0 = W[t-2]>>61
  160. mov e_64, tmp0
  161. vpsrlq $1, %xmm5, %xmm6 # XMM6 = W[t-15]>>1
  162. xor g_64, T1
  163. RORQ tmp0, 23 # 41
  164. vpsrlq $19, %xmm4, %xmm1 # XMM1 = W[t-2]>>19
  165. and e_64, T1
  166. xor e_64, tmp0
  167. vpxor %xmm1, %xmm0, %xmm0 # XMM0 = W[t-2]>>61 ^ W[t-2]>>19
  168. xor g_64, T1
  169. idx = \rnd
  170. add WK_2(idx), T1#
  171. vpsrlq $8, %xmm5, %xmm7 # XMM7 = W[t-15]>>8
  172. RORQ tmp0, 4 # 18
  173. vpsrlq $6, %xmm4, %xmm2 # XMM2 = W[t-2]>>6
  174. xor e_64, tmp0
  175. mov a_64, T2
  176. add h_64, T1
  177. vpxor %xmm7, %xmm6, %xmm6 # XMM6 = W[t-15]>>1 ^ W[t-15]>>8
  178. RORQ tmp0, 14 # 14
  179. add tmp0, T1
  180. vpsrlq $7, %xmm5, %xmm8 # XMM8 = W[t-15]>>7
  181. mov a_64, tmp0
  182. xor c_64, T2
  183. vpsllq $(64-61), %xmm4, %xmm3 # XMM3 = W[t-2]<<3
  184. and c_64, tmp0
  185. and b_64, T2
  186. vpxor %xmm3, %xmm2, %xmm2 # XMM2 = W[t-2]>>6 ^ W[t-2]<<3
  187. xor tmp0, T2
  188. mov a_64, tmp0
  189. vpsllq $(64-1), %xmm5, %xmm9 # XMM9 = W[t-15]<<63
  190. RORQ tmp0, 5 # 39
  191. vpxor %xmm9, %xmm8, %xmm8 # XMM8 = W[t-15]>>7 ^ W[t-15]<<63
  192. xor a_64, tmp0
  193. add T1, d_64
  194. RORQ tmp0, 6 # 34
  195. xor a_64, tmp0
  196. vpxor %xmm8, %xmm6, %xmm6 # XMM6 = W[t-15]>>1 ^ W[t-15]>>8 ^
  197. # W[t-15]>>7 ^ W[t-15]<<63
  198. lea (T1, T2), h_64
  199. RORQ tmp0, 28 # 28
  200. vpsllq $(64-19), %xmm4, %xmm4 # XMM4 = W[t-2]<<25
  201. add tmp0, h_64
  202. RotateState
  203. vpxor %xmm4, %xmm0, %xmm0 # XMM0 = W[t-2]>>61 ^ W[t-2]>>19 ^
  204. # W[t-2]<<25
  205. mov f_64, T1
  206. vpxor %xmm2, %xmm0, %xmm0 # XMM0 = s1(W[t-2])
  207. mov e_64, tmp0
  208. xor g_64, T1
  209. idx = \rnd - 16
  210. vpaddq W_t(idx), %xmm0, %xmm0 # XMM0 = s1(W[t-2]) + W[t-16]
  211. idx = \rnd - 7
  212. vmovdqu W_t(idx), %xmm1 # XMM1 = W[t-7]
  213. RORQ tmp0, 23 # 41
  214. and e_64, T1
  215. xor e_64, tmp0
  216. xor g_64, T1
  217. vpsllq $(64-8), %xmm5, %xmm5 # XMM5 = W[t-15]<<56
  218. idx = \rnd + 1
  219. add WK_2(idx), T1
  220. vpxor %xmm5, %xmm6, %xmm6 # XMM6 = s0(W[t-15])
  221. RORQ tmp0, 4 # 18
  222. vpaddq %xmm6, %xmm0, %xmm0 # XMM0 = s1(W[t-2]) + W[t-16] + s0(W[t-15])
  223. xor e_64, tmp0
  224. vpaddq %xmm1, %xmm0, %xmm0 # XMM0 = W[t] = s1(W[t-2]) + W[t-7] +
  225. # s0(W[t-15]) + W[t-16]
  226. mov a_64, T2
  227. add h_64, T1
  228. RORQ tmp0, 14 # 14
  229. add tmp0, T1
  230. idx = \rnd
  231. vmovdqa %xmm0, W_t(idx) # Store W[t]
  232. vpaddq K_t(idx), %xmm0, %xmm0 # Compute W[t]+K[t]
  233. vmovdqa %xmm0, WK_2(idx) # Store W[t]+K[t] for next rounds
  234. mov a_64, tmp0
  235. xor c_64, T2
  236. and c_64, tmp0
  237. and b_64, T2
  238. xor tmp0, T2
  239. mov a_64, tmp0
  240. RORQ tmp0, 5 # 39
  241. xor a_64, tmp0
  242. add T1, d_64
  243. RORQ tmp0, 6 # 34
  244. xor a_64, tmp0
  245. lea (T1, T2), h_64
  246. RORQ tmp0, 28 # 28
  247. add tmp0, h_64
  248. RotateState
  249. .endm
  250. ########################################################################
  251. # void sha512_transform_avx(sha512_state *state, const u8 *data, int blocks)
  252. # Purpose: Updates the SHA512 digest stored at "state" with the message
  253. # stored in "data".
  254. # The size of the message pointed to by "data" must be an integer multiple
  255. # of SHA512 message blocks.
  256. # "blocks" is the message length in SHA512 blocks
  257. ########################################################################
  258. SYM_TYPED_FUNC_START(sha512_transform_avx)
  259. test msglen, msglen
  260. je nowork
  261. # Save GPRs
  262. push %rbx
  263. push %r12
  264. push %r13
  265. push %r14
  266. push %r15
  267. # Allocate Stack Space
  268. push %rbp
  269. mov %rsp, %rbp
  270. sub $frame_size, %rsp
  271. and $~(0x20 - 1), %rsp
  272. updateblock:
  273. # Load state variables
  274. mov DIGEST(0), a_64
  275. mov DIGEST(1), b_64
  276. mov DIGEST(2), c_64
  277. mov DIGEST(3), d_64
  278. mov DIGEST(4), e_64
  279. mov DIGEST(5), f_64
  280. mov DIGEST(6), g_64
  281. mov DIGEST(7), h_64
  282. t = 0
  283. .rept 80/2 + 1
  284. # (80 rounds) / (2 rounds/iteration) + (1 iteration)
  285. # +1 iteration because the scheduler leads hashing by 1 iteration
  286. .if t < 2
  287. # BSWAP 2 QWORDS
  288. vmovdqa XMM_QWORD_BSWAP(%rip), %xmm1
  289. vmovdqu MSG(t), %xmm0
  290. vpshufb %xmm1, %xmm0, %xmm0 # BSWAP
  291. vmovdqa %xmm0, W_t(t) # Store Scheduled Pair
  292. vpaddq K_t(t), %xmm0, %xmm0 # Compute W[t]+K[t]
  293. vmovdqa %xmm0, WK_2(t) # Store into WK for rounds
  294. .elseif t < 16
  295. # BSWAP 2 QWORDS# Compute 2 Rounds
  296. vmovdqu MSG(t), %xmm0
  297. vpshufb %xmm1, %xmm0, %xmm0 # BSWAP
  298. SHA512_Round t-2 # Round t-2
  299. vmovdqa %xmm0, W_t(t) # Store Scheduled Pair
  300. vpaddq K_t(t), %xmm0, %xmm0 # Compute W[t]+K[t]
  301. SHA512_Round t-1 # Round t-1
  302. vmovdqa %xmm0, WK_2(t)# Store W[t]+K[t] into WK
  303. .elseif t < 79
  304. # Schedule 2 QWORDS# Compute 2 Rounds
  305. SHA512_2Sched_2Round_avx t
  306. .else
  307. # Compute 2 Rounds
  308. SHA512_Round t-2
  309. SHA512_Round t-1
  310. .endif
  311. t = t+2
  312. .endr
  313. # Update digest
  314. add a_64, DIGEST(0)
  315. add b_64, DIGEST(1)
  316. add c_64, DIGEST(2)
  317. add d_64, DIGEST(3)
  318. add e_64, DIGEST(4)
  319. add f_64, DIGEST(5)
  320. add g_64, DIGEST(6)
  321. add h_64, DIGEST(7)
  322. # Advance to next message block
  323. add $16*8, msg
  324. dec msglen
  325. jnz updateblock
  326. # Restore Stack Pointer
  327. mov %rbp, %rsp
  328. pop %rbp
  329. # Restore GPRs
  330. pop %r15
  331. pop %r14
  332. pop %r13
  333. pop %r12
  334. pop %rbx
  335. nowork:
  336. RET
  337. SYM_FUNC_END(sha512_transform_avx)
  338. ########################################################################
  339. ### Binary Data
  340. .section .rodata.cst16.XMM_QWORD_BSWAP, "aM", @progbits, 16
  341. .align 16
  342. # Mask for byte-swapping a couple of qwords in an XMM register using (v)pshufb.
  343. XMM_QWORD_BSWAP:
  344. .octa 0x08090a0b0c0d0e0f0001020304050607
  345. # Mergeable 640-byte rodata section. This allows linker to merge the table
  346. # with other, exactly the same 640-byte fragment of another rodata section
  347. # (if such section exists).
  348. .section .rodata.cst640.K512, "aM", @progbits, 640
  349. .align 64
  350. # K[t] used in SHA512 hashing
  351. K512:
  352. .quad 0x428a2f98d728ae22,0x7137449123ef65cd
  353. .quad 0xb5c0fbcfec4d3b2f,0xe9b5dba58189dbbc
  354. .quad 0x3956c25bf348b538,0x59f111f1b605d019
  355. .quad 0x923f82a4af194f9b,0xab1c5ed5da6d8118
  356. .quad 0xd807aa98a3030242,0x12835b0145706fbe
  357. .quad 0x243185be4ee4b28c,0x550c7dc3d5ffb4e2
  358. .quad 0x72be5d74f27b896f,0x80deb1fe3b1696b1
  359. .quad 0x9bdc06a725c71235,0xc19bf174cf692694
  360. .quad 0xe49b69c19ef14ad2,0xefbe4786384f25e3
  361. .quad 0x0fc19dc68b8cd5b5,0x240ca1cc77ac9c65
  362. .quad 0x2de92c6f592b0275,0x4a7484aa6ea6e483
  363. .quad 0x5cb0a9dcbd41fbd4,0x76f988da831153b5
  364. .quad 0x983e5152ee66dfab,0xa831c66d2db43210
  365. .quad 0xb00327c898fb213f,0xbf597fc7beef0ee4
  366. .quad 0xc6e00bf33da88fc2,0xd5a79147930aa725
  367. .quad 0x06ca6351e003826f,0x142929670a0e6e70
  368. .quad 0x27b70a8546d22ffc,0x2e1b21385c26c926
  369. .quad 0x4d2c6dfc5ac42aed,0x53380d139d95b3df
  370. .quad 0x650a73548baf63de,0x766a0abb3c77b2a8
  371. .quad 0x81c2c92e47edaee6,0x92722c851482353b
  372. .quad 0xa2bfe8a14cf10364,0xa81a664bbc423001
  373. .quad 0xc24b8b70d0f89791,0xc76c51a30654be30
  374. .quad 0xd192e819d6ef5218,0xd69906245565a910
  375. .quad 0xf40e35855771202a,0x106aa07032bbd1b8
  376. .quad 0x19a4c116b8d2d0c8,0x1e376c085141ab53
  377. .quad 0x2748774cdf8eeb99,0x34b0bcb5e19b48a8
  378. .quad 0x391c0cb3c5c95a63,0x4ed8aa4ae3418acb
  379. .quad 0x5b9cca4f7763e373,0x682e6ff3d6b2b8a3
  380. .quad 0x748f82ee5defb2fc,0x78a5636f43172f60
  381. .quad 0x84c87814a1f0ab72,0x8cc702081a6439ec
  382. .quad 0x90befffa23631e28,0xa4506cebde82bde9
  383. .quad 0xbef9a3f7b2c67915,0xc67178f2e372532b
  384. .quad 0xca273eceea26619c,0xd186b8c721c0c207
  385. .quad 0xeada7dd6cde0eb1e,0xf57d4f7fee6ed178
  386. .quad 0x06f067aa72176fba,0x0a637dc5a2c898a6
  387. .quad 0x113f9804bef90dae,0x1b710b35131c471b
  388. .quad 0x28db77f523047d84,0x32caab7b40c72493
  389. .quad 0x3c9ebe0a15c9bebc,0x431d67c49c100d4c
  390. .quad 0x4cc5d4becb3e42b6,0x597f299cfc657e2a
  391. .quad 0x5fcb6fab3ad6faec,0x6c44198c4a475817