1 /*******************************************************************************
2 Copyright (C) Marvell International Ltd. and its affiliates
4 This software file (the "File") is owned and distributed by Marvell
5 International Ltd. and/or its affiliates ("Marvell") under the following
6 alternative licensing terms. Once you have made an election to distribute the
7 File under one of the following license alternatives, please (i) delete this
8 introductory statement regarding license alternatives, (ii) delete the two
9 license alternatives that you have not elected to use and (iii) preserve the
10 Marvell copyright notice above.
12 ********************************************************************************
13 Marvell Commercial License Option
15 If you received this File from Marvell and you have entered into a commercial
16 license agreement (a "Commercial License") with Marvell, the File is licensed
17 to you under the terms of the applicable Commercial License.
19 ********************************************************************************
20 Marvell GPL License Option
22 If you received this File from Marvell, you may opt to use, redistribute and/or
23 modify this File in accordance with the terms and conditions of the General
24 Public License Version 2, June 1991 (the "GPL License"), a copy of which is
25 available along with the File in the license.txt file or by writing to the Free
26 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or
27 on the worldwide web at http://www.gnu.org/licenses/gpl.txt.
29 THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED
30 WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY
31 DISCLAIMED. The GPL License provides additional details about this warranty
33 ********************************************************************************
34 Marvell BSD License Option
36 If you received this File from Marvell, you may opt to use, redistribute and/or
37 modify this File under the following licensing terms.
38 Redistribution and use in source and binary forms, with or without modification,
39 are permitted provided that the following conditions are met:
41 * Redistributions of source code must retain the above copyright notice,
42 this list of conditions and the following disclaimer.
44 * Redistributions in binary form must reproduce the above copyright
45 notice, this list of conditions and the following disclaimer in the
46 documentation and/or other materials provided with the distribution.
48 * Neither the name of Marvell nor the names of its contributors may be
49 used to endorse or promote products derived from this software without
50 specific prior written permission.
52 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
53 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
54 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
55 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
56 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
57 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
58 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
59 ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
60 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
61 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
63 *******************************************************************************/
77 static void mvSHA1Transform(MV_U32 state
[5], const MV_U8
*buffer
);
79 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
83 #define blk0(i) (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) | \
84 (rol(block->l[i], 8) & 0x00FF00FF))
86 #define blk0(i) block->l[i]
88 #define blk(i) (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ \
89 block->l[(i + 8) & 15] ^ block->l[(i + 2) & 15] ^ block->l[i & 15], 1))
91 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
92 #define R0(v,w,x,y,z,i) \
93 z += ((w & (x ^ y)) ^ y) + blk0(i) + 0x5A827999 + rol(v, 5); \
95 #define R1(v,w,x,y,z,i) \
96 z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
98 #define R2(v,w,x,y,z,i) \
99 z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30);
100 #define R3(v,w,x,y,z,i) \
101 z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
103 #define R4(v,w,x,y,z,i) \
104 z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
107 /* Hash a single 512-bit block. This is the core of the algorithm. */
108 static void mvSHA1Transform(MV_U32 state
[5], const MV_U8
*buffer
)
110 MV_U32 a
, b
, c
, d
, e
;
114 static MV_U32 workspace
[16];
116 block
= (CHAR64LONG16
*) workspace
;
117 memcpy(block
, buffer
, 64);
119 block
= (CHAR64LONG16
*) buffer
;
121 /* Copy context->state[] to working vars */
127 /* 4 rounds of 20 operations each. Loop unrolled. */
128 R0(a
,b
,c
,d
,e
, 0); R0(e
,a
,b
,c
,d
, 1); R0(d
,e
,a
,b
,c
, 2); R0(c
,d
,e
,a
,b
, 3);
129 R0(b
,c
,d
,e
,a
, 4); R0(a
,b
,c
,d
,e
, 5); R0(e
,a
,b
,c
,d
, 6); R0(d
,e
,a
,b
,c
, 7);
130 R0(c
,d
,e
,a
,b
, 8); R0(b
,c
,d
,e
,a
, 9); R0(a
,b
,c
,d
,e
,10); R0(e
,a
,b
,c
,d
,11);
131 R0(d
,e
,a
,b
,c
,12); R0(c
,d
,e
,a
,b
,13); R0(b
,c
,d
,e
,a
,14); R0(a
,b
,c
,d
,e
,15);
132 R1(e
,a
,b
,c
,d
,16); R1(d
,e
,a
,b
,c
,17); R1(c
,d
,e
,a
,b
,18); R1(b
,c
,d
,e
,a
,19);
133 R2(a
,b
,c
,d
,e
,20); R2(e
,a
,b
,c
,d
,21); R2(d
,e
,a
,b
,c
,22); R2(c
,d
,e
,a
,b
,23);
134 R2(b
,c
,d
,e
,a
,24); R2(a
,b
,c
,d
,e
,25); R2(e
,a
,b
,c
,d
,26); R2(d
,e
,a
,b
,c
,27);
135 R2(c
,d
,e
,a
,b
,28); R2(b
,c
,d
,e
,a
,29); R2(a
,b
,c
,d
,e
,30); R2(e
,a
,b
,c
,d
,31);
136 R2(d
,e
,a
,b
,c
,32); R2(c
,d
,e
,a
,b
,33); R2(b
,c
,d
,e
,a
,34); R2(a
,b
,c
,d
,e
,35);
137 R2(e
,a
,b
,c
,d
,36); R2(d
,e
,a
,b
,c
,37); R2(c
,d
,e
,a
,b
,38); R2(b
,c
,d
,e
,a
,39);
138 R3(a
,b
,c
,d
,e
,40); R3(e
,a
,b
,c
,d
,41); R3(d
,e
,a
,b
,c
,42); R3(c
,d
,e
,a
,b
,43);
139 R3(b
,c
,d
,e
,a
,44); R3(a
,b
,c
,d
,e
,45); R3(e
,a
,b
,c
,d
,46); R3(d
,e
,a
,b
,c
,47);
140 R3(c
,d
,e
,a
,b
,48); R3(b
,c
,d
,e
,a
,49); R3(a
,b
,c
,d
,e
,50); R3(e
,a
,b
,c
,d
,51);
141 R3(d
,e
,a
,b
,c
,52); R3(c
,d
,e
,a
,b
,53); R3(b
,c
,d
,e
,a
,54); R3(a
,b
,c
,d
,e
,55);
142 R3(e
,a
,b
,c
,d
,56); R3(d
,e
,a
,b
,c
,57); R3(c
,d
,e
,a
,b
,58); R3(b
,c
,d
,e
,a
,59);
143 R4(a
,b
,c
,d
,e
,60); R4(e
,a
,b
,c
,d
,61); R4(d
,e
,a
,b
,c
,62); R4(c
,d
,e
,a
,b
,63);
144 R4(b
,c
,d
,e
,a
,64); R4(a
,b
,c
,d
,e
,65); R4(e
,a
,b
,c
,d
,66); R4(d
,e
,a
,b
,c
,67);
145 R4(c
,d
,e
,a
,b
,68); R4(b
,c
,d
,e
,a
,69); R4(a
,b
,c
,d
,e
,70); R4(e
,a
,b
,c
,d
,71);
146 R4(d
,e
,a
,b
,c
,72); R4(c
,d
,e
,a
,b
,73); R4(b
,c
,d
,e
,a
,74); R4(a
,b
,c
,d
,e
,75);
147 R4(e
,a
,b
,c
,d
,76); R4(d
,e
,a
,b
,c
,77); R4(c
,d
,e
,a
,b
,78); R4(b
,c
,d
,e
,a
,79);
148 /* Add the working vars back into context.state[] */
155 a
= b
= c
= d
= e
= 0;
158 void mvSHA1Init(MV_SHA1_CTX
* context
)
160 /* SHA1 initialization constants */
161 context
->state
[0] = 0x67452301;
162 context
->state
[1] = 0xEFCDAB89;
163 context
->state
[2] = 0x98BADCFE;
164 context
->state
[3] = 0x10325476;
165 context
->state
[4] = 0xC3D2E1F0;
166 context
->count
[0] = context
->count
[1] = 0;
170 /* Run your data through this. */
171 void mvSHA1Update(MV_SHA1_CTX
*context
, MV_U8
const *data
,
176 j
= (context
->count
[0] >> 3) & 63;
177 if ((context
->count
[0] += len
<< 3) < (len
<< 3))
179 context
->count
[1] += (len
>> 29);
182 memcpy(&context
->buffer
[j
], data
, (i
= 64-j
));
183 mvSHA1Transform(context
->state
, context
->buffer
);
184 for ( ; i
+ 63 < len
; i
+= 64)
186 mvSHA1Transform(context
->state
, &data
[i
]);
194 memcpy(&context
->buffer
[j
], &data
[i
], len
- i
);
197 void mvSHA1Final(MV_U8
* digest
, MV_SHA1_CTX
* context
)
202 for (i
= 0; i
< 8; i
++)
204 finalcount
[i
] = (unsigned char)((context
->count
[(i
>= 4 ? 0 : 1)] >>
205 ((3-(i
& 3)) * 8) ) & 255); /* Endian independent */
207 mvSHA1Update(context
, (const unsigned char *) "\200", 1);
208 while ((context
->count
[0] & 504) != 448)
210 mvSHA1Update(context
, (const unsigned char *) "\0", 1);
212 mvSHA1Update(context
, finalcount
, 8); /* Should cause a mvSHA1Transform()
214 for (i
= 0; i
< 20; i
++)
216 digest
[i
] = (unsigned char)
217 ((context
->state
[i
>> 2] >> ((3 - (i
& 3)) * 8)) & 255);
221 memset(context
->buffer
, 0, 64);
222 memset(context
->state
, 0, 20);
223 memset(context
->count
, 0, 8);
224 memset(finalcount
, 0, 8);
226 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
227 mvSHA1Transform(context
->state
, context
->buffer
);
232 void mvSHA1(MV_U8
const *buf
, unsigned int len
, MV_U8
* digest
)
237 mvSHA1Update(&ctx
, buf
, len
);
238 mvSHA1Final(digest
, &ctx
);
This page took 0.083647 seconds and 5 git commands to generate.