1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Copyright(c) 2011-2016 Intel Corporation All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions
; are met:
; * Redistributions of source code must retain the above copyright
; notice, this list of conditions and the following disclaimer.
; * Redistributions in binary form must reproduce the above copyright
; notice, this list of conditions and the following disclaimer in
; the documentation and/or other materials provided with the
; distribution.
; * Neither the name of Intel Corporation nor the names of its
; contributors may be used to endorse or promote products derived
; from this software without specific prior written permission.
;
; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
; OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
; LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
; OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
%include "sha512_job.asm"
%include "sha512_mb_mgr_datastruct.asm"
%include "reg_sizes.asm"
extern sha512_mb_x2_avx
%ifidn __OUTPUT_FORMAT__, elf64
; Linux register definitions
%define arg1 rdi ; rcx
%define arg2 rsi ; rdx
; idx needs to be other than arg1, arg2, rbx, r12
%define idx rdx ; rsi
%define last_len rdx ; rsi
%define size_offset rcx ; rdi
%define tmp2 rcx ; rdi
%else
; WINDOWS register definitions
%define arg1 rcx
%define arg2 rdx
; idx needs to be other than arg1, arg2, rbx, r12
%define last_len rsi
%define idx rsi
%define size_offset rdi
%define tmp2 rdi
%endif
; Common definitions
%define state arg1
%define job arg2
%define len2 arg2
%define p2 arg2
%define p r11
%define start_offset r11
%define unused_lanes rbx
%define job_rax rax
%define len rax
%define lane rbp
%define tmp3 rbp
%define lens3 rbp
%define extra_blocks r8
%define lens0 r8
%define tmp r9
%define lens1 r9
%define lane_data r10
%define lens2 r10
struc stack_frame
.xmm: resb 16*10
.gpr: resb 8*5
.rsp: resb 8
endstruc
; STACK_SPACE needs to be an odd multiple of 8
%define _XMM_SAVE stack_frame.gpr
%define _GPR_SAVE stack_frame.rsp
%define STACK_SPACE stack_frame_size
; SHA512_JOB* sha512_mb_mgr_submit_avx(SHA512_MB_JOB_MGR *state, SHA512_JOB *job)
; arg 1 : rcx : state
; arg 2 : rdx : job
global sha512_mb_mgr_submit_avx:function
sha512_mb_mgr_submit_avx:
mov rax, rsp
sub rsp, STACK_SPACE
and rsp, ~31
mov [rsp + stack_frame.rsp], rax
mov [rsp + _XMM_SAVE + 8*0], rbx
mov [rsp + _XMM_SAVE + 8*1], rbp
mov [rsp + _XMM_SAVE + 8*2], r12
%ifidn __OUTPUT_FORMAT__, win64
mov [rsp + _XMM_SAVE + 8*3], rsi
mov [rsp + _XMM_SAVE + 8*4], rdi
vmovdqa [rsp + 16*0], xmm6
vmovdqa [rsp + 16*1], xmm7
vmovdqa [rsp + 16*2], xmm8
vmovdqa [rsp + 16*3], xmm9
vmovdqa [rsp + 16*4], xmm10
vmovdqa [rsp + 16*5], xmm11
vmovdqa [rsp + 16*6], xmm12
vmovdqa [rsp + 16*7], xmm13
vmovdqa [rsp + 16*8], xmm14
vmovdqa [rsp + 16*9], xmm15
%endif
mov unused_lanes, [state + _unused_lanes]
movzx lane, BYTE(unused_lanes)
shr unused_lanes, 8
imul lane_data, lane, _LANE_DATA_size
mov dword [job + _status], STS_BEING_PROCESSED
lea lane_data, [state + _ldata + lane_data]
mov [state + _unused_lanes], unused_lanes
mov DWORD(len), [job + _len]
mov [lane_data + _job_in_lane], job
mov [state + _lens + 4 + 8*lane], DWORD(len)
; Load digest words from result_digest
vmovdqa xmm0, [job + _result_digest + 0*16]
vmovdqa xmm1, [job + _result_digest + 1*16]
vmovdqa xmm2, [job + _result_digest + 2*16]
vmovdqa xmm3, [job + _result_digest + 3*16]
vmovq [state + _args_digest + 8*lane + 0*32], xmm0
vpextrq [state + _args_digest + 8*lane + 1*32], xmm0, 1
vmovq [state + _args_digest + 8*lane + 2*32], xmm1
vpextrq [state + _args_digest + 8*lane + 3*32], xmm1, 1
vmovq [state + _args_digest + 8*lane + 4*32], xmm2
vpextrq [state + _args_digest + 8*lane + 5*32], xmm2, 1
vmovq [state + _args_digest + 8*lane + 6*32], xmm3
vpextrq [state + _args_digest + 8*lane + 7*32], xmm3, 1
mov p, [job + _buffer]
mov [state + _args_data_ptr + 8*lane], p
cmp unused_lanes, 0xff
jne return_null
start_loop:
; Find min length
mov lens0, [state + _lens + 0*8]
mov idx, lens0
mov lens1, [state + _lens + 1*8]
cmp lens1, idx
cmovb idx, lens1
mov len2, idx
and idx, 0xF
and len2, ~0xFF
jz len_is_0
sub lens0, len2
sub lens1, len2
shr len2, 32
mov [state + _lens + 0*8], lens0
mov [state + _lens + 1*8], lens1
; "state" and "args" are the same address, arg1
; len is arg2
call sha512_mb_x2_avx
; state and idx are intact
len_is_0:
; process completed job "idx"
imul lane_data, idx, _LANE_DATA_size
lea lane_data, [state + _ldata + lane_data]
mov job_rax, [lane_data + _job_in_lane]
mov unused_lanes, [state + _unused_lanes]
mov qword [lane_data + _job_in_lane], 0
mov dword [job_rax + _status], STS_COMPLETED
shl unused_lanes, 8
or unused_lanes, idx
mov [state + _unused_lanes], unused_lanes
vmovq xmm0, [state + _args_digest + 8*idx + 0*32]
vpinsrq xmm0, [state + _args_digest + 8*idx + 1*32], 1
vmovq xmm1, [state + _args_digest + 8*idx + 2*32]
vpinsrq xmm1, [state + _args_digest + 8*idx + 3*32], 1
vmovq xmm2, [state + _args_digest + 8*idx + 4*32]
vpinsrq xmm2, [state + _args_digest + 8*idx + 5*32], 1
vmovq xmm3, [state + _args_digest + 8*idx + 6*32]
vpinsrq xmm3, [state + _args_digest + 8*idx + 7*32], 1
vmovdqa [job_rax + _result_digest + 0*16], xmm0
vmovdqa [job_rax + _result_digest + 1*16], xmm1
vmovdqa [job_rax + _result_digest + 2*16], xmm2
vmovdqa [job_rax + _result_digest + 3*16], xmm3
return:
%ifidn __OUTPUT_FORMAT__, win64
vmovdqa xmm6, [rsp + 16*0]
vmovdqa xmm7, [rsp + 16*1]
vmovdqa xmm8, [rsp + 16*2]
vmovdqa xmm9, [rsp + 16*3]
vmovdqa xmm10, [rsp + 16*4]
vmovdqa xmm11, [rsp + 16*5]
vmovdqa xmm12, [rsp + 16*6]
vmovdqa xmm13, [rsp + 16*7]
vmovdqa xmm14, [rsp + 16*8]
vmovdqa xmm15, [rsp + 16*9]
mov rsi, [rsp + _XMM_SAVE + 8*3]
mov rdi, [rsp + _XMM_SAVE + 8*4]
%endif
mov rbx, [rsp + _XMM_SAVE + 8*0]
mov rbp, [rsp + _XMM_SAVE + 8*1]
mov r12, [rsp + _XMM_SAVE + 8*2]
mov rsp, [rsp + stack_frame.rsp]
ret
return_null:
xor job_rax, job_rax
jmp return
section .data align=16
align 16
H0: dd 0x6a09e667
H1: dd 0xbb67ae85
H2: dd 0x3c6ef372
H3: dd 0xa54ff53a
H4: dd 0x510e527f
H5: dd 0x9b05688c
H6: dd 0x1f83d9ab
H7: dd 0x5be0cd19
|