]> git.proxmox.com Git - ceph.git/blob - ceph/src/crypto/isa-l/isa-l_crypto/md5_mb/md5_ctx_avx2.c
add subtree-ish sources for 12.0.3
[ceph.git] / ceph / src / crypto / isa-l / isa-l_crypto / md5_mb / md5_ctx_avx2.c
1 /**********************************************************************
2 Copyright(c) 2011-2016 Intel Corporation All rights reserved.
3
4 Redistribution and use in source and binary forms, with or without
5 modification, are permitted provided that the following conditions
6 are met:
7 * Redistributions of source code must retain the above copyright
8 notice, this list of conditions and the following disclaimer.
9 * Redistributions in binary form must reproduce the above copyright
10 notice, this list of conditions and the following disclaimer in
11 the documentation and/or other materials provided with the
12 distribution.
13 * Neither the name of Intel Corporation nor the names of its
14 contributors may be used to endorse or promote products derived
15 from this software without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 **********************************************************************/
29
30 #include "md5_mb.h"
31 #include "memcpy_inline.h"
32
33 #ifdef _MSC_VER
34 #include <intrin.h>
35 #define inline __inline
36 #endif
37
38 static inline void hash_init_digest(MD5_WORD_T * digest);
39 static inline uint32_t hash_pad(uint8_t padblock[MD5_BLOCK_SIZE * 2], uint32_t total_len);
40 static MD5_HASH_CTX *md5_ctx_mgr_resubmit(MD5_HASH_CTX_MGR * mgr, MD5_HASH_CTX * ctx);
41
42 void md5_ctx_mgr_init_avx2(MD5_HASH_CTX_MGR * mgr)
43 {
44 md5_mb_mgr_init_avx2(&mgr->mgr);
45 }
46
47 MD5_HASH_CTX *md5_ctx_mgr_submit_avx2(MD5_HASH_CTX_MGR * mgr, MD5_HASH_CTX * ctx,
48 const void *buffer, uint32_t len, HASH_CTX_FLAG flags)
49 {
50 if (flags & (~HASH_ENTIRE)) {
51 // User should not pass anything other than FIRST, UPDATE, or LAST
52 ctx->error = HASH_CTX_ERROR_INVALID_FLAGS;
53 return ctx;
54 }
55
56 if (ctx->status & HASH_CTX_STS_PROCESSING) {
57 // Cannot submit to a currently processing job.
58 ctx->error = HASH_CTX_ERROR_ALREADY_PROCESSING;
59 return ctx;
60 }
61
62 if ((ctx->status & HASH_CTX_STS_COMPLETE) && !(flags & HASH_FIRST)) {
63 // Cannot update a finished job.
64 ctx->error = HASH_CTX_ERROR_ALREADY_COMPLETED;
65 return ctx;
66 }
67
68 if (flags & HASH_FIRST) {
69 // Init digest
70 hash_init_digest(ctx->job.result_digest);
71
72 // Reset byte counter
73 ctx->total_length = 0;
74
75 // Clear extra blocks
76 ctx->partial_block_buffer_length = 0;
77 }
78 // If we made it here, there were no errors during this call to submit
79 ctx->error = HASH_CTX_ERROR_NONE;
80
81 // Store buffer ptr info from user
82 ctx->incoming_buffer = buffer;
83 ctx->incoming_buffer_length = len;
84
85 // Store the user's request flags and mark this ctx as currently being processed.
86 ctx->status = (flags & HASH_LAST) ?
87 (HASH_CTX_STS) (HASH_CTX_STS_PROCESSING | HASH_CTX_STS_LAST) :
88 HASH_CTX_STS_PROCESSING;
89
90 // Advance byte counter
91 ctx->total_length += len;
92
93 // If there is anything currently buffered in the extra blocks, append to it until it contains a whole block.
94 // Or if the user's buffer contains less than a whole block, append as much as possible to the extra block.
95 if ((ctx->partial_block_buffer_length) | (len < MD5_BLOCK_SIZE)) {
96 // Compute how many bytes to copy from user buffer into extra block
97 uint32_t copy_len = MD5_BLOCK_SIZE - ctx->partial_block_buffer_length;
98 if (len < copy_len)
99 copy_len = len;
100
101 if (copy_len) {
102 // Copy and update relevant pointers and counters
103 memcpy_varlen(&ctx->partial_block_buffer
104 [ctx->partial_block_buffer_length], buffer, copy_len);
105
106 ctx->partial_block_buffer_length += copy_len;
107 ctx->incoming_buffer = (const void *)((const char *)buffer + copy_len);
108 ctx->incoming_buffer_length = len - copy_len;
109 }
110 // The extra block should never contain more than 1 block here
111 assert(ctx->partial_block_buffer_length <= MD5_BLOCK_SIZE);
112
113 // If the extra block buffer contains exactly 1 block, it can be hashed.
114 if (ctx->partial_block_buffer_length >= MD5_BLOCK_SIZE) {
115 ctx->partial_block_buffer_length = 0;
116
117 ctx->job.buffer = ctx->partial_block_buffer;
118 ctx->job.len = 1;
119 ctx = (MD5_HASH_CTX *) md5_mb_mgr_submit_avx2(&mgr->mgr, &ctx->job);
120 }
121 }
122
123 return md5_ctx_mgr_resubmit(mgr, ctx);
124 }
125
126 MD5_HASH_CTX *md5_ctx_mgr_flush_avx2(MD5_HASH_CTX_MGR * mgr)
127 {
128 MD5_HASH_CTX *ctx;
129
130 while (1) {
131 ctx = (MD5_HASH_CTX *) md5_mb_mgr_flush_avx2(&mgr->mgr);
132
133 // If flush returned 0, there are no more jobs in flight.
134 if (!ctx)
135 return NULL;
136
137 // If flush returned a job, verify that it is safe to return to the user.
138 // If it is not ready, resubmit the job to finish processing.
139 ctx = md5_ctx_mgr_resubmit(mgr, ctx);
140
141 // If md5_ctx_mgr_resubmit returned a job, it is ready to be returned.
142 if (ctx)
143 return ctx;
144
145 // Otherwise, all jobs currently being managed by the HASH_CTX_MGR still need processing. Loop.
146 }
147 }
148
149 static MD5_HASH_CTX *md5_ctx_mgr_resubmit(MD5_HASH_CTX_MGR * mgr, MD5_HASH_CTX * ctx)
150 {
151 while (ctx) {
152
153 if (ctx->status & HASH_CTX_STS_COMPLETE) {
154 ctx->status = HASH_CTX_STS_COMPLETE; // Clear PROCESSING bit
155 return ctx;
156 }
157 // If the extra blocks are empty, begin hashing what remains in the user's buffer.
158 if (ctx->partial_block_buffer_length == 0 && ctx->incoming_buffer_length) {
159 const void *buffer = ctx->incoming_buffer;
160 uint32_t len = ctx->incoming_buffer_length;
161
162 // Only entire blocks can be hashed. Copy remainder to extra blocks buffer.
163 uint32_t copy_len = len & (MD5_BLOCK_SIZE - 1);
164
165 if (copy_len) {
166 len -= copy_len;
167 //memcpy(ctx->partial_block_buffer, ((const char*)buffer + len), copy_len);
168 memcpy_varlen(ctx->partial_block_buffer,
169 ((const char *)buffer + len), copy_len);
170 ctx->partial_block_buffer_length = copy_len;
171 }
172
173 ctx->incoming_buffer_length = 0;
174
175 // len should be a multiple of the block size now
176 assert((len % MD5_BLOCK_SIZE) == 0);
177
178 // Set len to the number of blocks to be hashed in the user's buffer
179 len >>= MD5_LOG2_BLOCK_SIZE;
180
181 if (len) {
182 ctx->job.buffer = (uint8_t *) buffer;
183 ctx->job.len = len;
184 ctx = (MD5_HASH_CTX *) md5_mb_mgr_submit_avx2(&mgr->mgr,
185 &ctx->job);
186 continue;
187 }
188 }
189 // If the extra blocks are not empty, then we are either on the last block(s)
190 // or we need more user input before continuing.
191 if (ctx->status & HASH_CTX_STS_LAST) {
192
193 uint8_t *buf = ctx->partial_block_buffer;
194 uint32_t n_extra_blocks = hash_pad(buf, ctx->total_length);
195
196 ctx->status =
197 (HASH_CTX_STS) (HASH_CTX_STS_PROCESSING | HASH_CTX_STS_COMPLETE);
198
199 ctx->job.buffer = buf;
200 ctx->job.len = (uint32_t) n_extra_blocks;
201 ctx = (MD5_HASH_CTX *) md5_mb_mgr_submit_avx2(&mgr->mgr, &ctx->job);
202 continue;
203 }
204
205 if (ctx)
206 ctx->status = HASH_CTX_STS_IDLE;
207 return ctx;
208 }
209
210 return NULL;
211 }
212
213 static inline void hash_init_digest(MD5_WORD_T * digest)
214 {
215 static const MD5_WORD_T hash_initial_digest[MD5_DIGEST_NWORDS] =
216 { MD5_INITIAL_DIGEST };
217 //memcpy(digest, hash_initial_digest, sizeof(hash_initial_digest));
218 memcpy_fixedlen(digest, hash_initial_digest, sizeof(hash_initial_digest));
219 }
220
221 static inline uint32_t hash_pad(uint8_t padblock[MD5_BLOCK_SIZE * 2], uint32_t total_len)
222 {
223 uint32_t i = total_len & (MD5_BLOCK_SIZE - 1);
224
225 // memset(&padblock[i], 0, MD5_BLOCK_SIZE);
226 memclr_fixedlen(&padblock[i], MD5_BLOCK_SIZE);
227 padblock[i] = 0x80;
228
229 i += ((MD5_BLOCK_SIZE - 1) & (0 - (total_len + MD5_PADLENGTHFIELD_SIZE + 1))) + 1 +
230 MD5_PADLENGTHFIELD_SIZE;
231
232 *((uint64_t *) & padblock[i - 8]) = ((uint64_t) total_len << 3);
233
234 return i >> MD5_LOG2_BLOCK_SIZE; // Number of extra blocks to hash
235 }
236
237 struct slver {
238 uint16_t snum;
239 uint8_t ver;
240 uint8_t core;
241 };
242 struct slver md5_ctx_mgr_init_avx2_slver_04020186;
243 struct slver md5_ctx_mgr_init_avx2_slver = { 0x0186, 0x02, 0x04 };
244
245 struct slver md5_ctx_mgr_submit_avx2_slver_04020187;
246 struct slver md5_ctx_mgr_submit_avx2_slver = { 0x0187, 0x02, 0x04 };
247
248 struct slver md5_ctx_mgr_flush_avx2_slver_04020188;
249 struct slver md5_ctx_mgr_flush_avx2_slver = { 0x0188, 0x02, 0x04 };