1/*******************************************************************************
2Copyright (C) Marvell International Ltd. and its affiliates
3
4This software file (the "File") is owned and distributed by Marvell
5International Ltd. and/or its affiliates ("Marvell") under the following
6alternative licensing terms.  Once you have made an election to distribute the
7File under one of the following license alternatives, please (i) delete this
8introductory statement regarding license alternatives, (ii) delete the two
9license alternatives that you have not elected to use and (iii) preserve the
10Marvell copyright notice above.
11
12********************************************************************************
13Marvell Commercial License Option
14
15If you received this File from Marvell and you have entered into a commercial
16license agreement (a "Commercial License") with Marvell, the File is licensed
17to you under the terms of the applicable Commercial License.
18
19********************************************************************************
20Marvell GPL License Option
21
22If you received this File from Marvell, you may opt to use, redistribute and/or
23modify this File in accordance with the terms and conditions of the General
24Public License Version 2, June 1991 (the "GPL License"), a copy of which is
25available along with the File in the license.txt file or by writing to the Free
26Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or
27on the worldwide web at http://www.gnu.org/licenses/gpl.txt.
28
29THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED
30WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY
31DISCLAIMED.  The GPL License provides additional details about this warranty
32disclaimer.
33********************************************************************************
34Marvell BSD License Option
35
36If you received this File from Marvell, you may opt to use, redistribute and/or
37modify this File under the following licensing terms.
38Redistribution and use in source and binary forms, with or without modification,
39are permitted provided that the following conditions are met:
40
41    *   Redistributions of source code must retain the above copyright notice,
42	    this list of conditions and the following disclaimer.
43
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.
47
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.
51
52THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
53ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
54WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
55DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
56ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
57(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
58LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
59ANY 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
61SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
62
63*******************************************************************************/
64
65#include "mvOs.h"
66#include "mvSHA1.h"
67
68#define SHA1HANDSOFF
69
70typedef union
71{
72    MV_U8   c[64];
73    MV_U32  l[16];
74
75} CHAR64LONG16;
76
77static void mvSHA1Transform(MV_U32 state[5], const MV_U8 *buffer);
78
79#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
80
81
82#ifdef MV_CPU_LE
83#define blk0(i) (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) | \
84        (rol(block->l[i], 8) & 0x00FF00FF))
85#else
86#define blk0(i) block->l[i]
87#endif
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))
90
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); \
94        w = rol(w, 30);
95#define R1(v,w,x,y,z,i) \
96        z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
97        w = rol(w, 30);
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); \
102        w = rol(w, 30);
103#define R4(v,w,x,y,z,i) \
104        z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
105        w=rol(w, 30);
106
107/* Hash a single 512-bit block. This is the core of the algorithm. */
108static void    mvSHA1Transform(MV_U32 state[5], const MV_U8 *buffer)
109{
110    MV_U32          a, b, c, d, e;
111    CHAR64LONG16*   block;
112
113#ifdef SHA1HANDSOFF
114    static MV_U32  workspace[16];
115
116    block = (CHAR64LONG16 *) workspace;
117    memcpy(block, buffer, 64);
118#else
119    block = (CHAR64LONG16 *) buffer;
120#endif
121    /* Copy context->state[] to working vars */
122    a = state[0];
123    b = state[1];
124    c = state[2];
125    d = state[3];
126    e = state[4];
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[] */
149    state[0] += a;
150    state[1] += b;
151    state[2] += c;
152    state[3] += d;
153    state[4] += e;
154    /* Wipe variables */
155    a = b = c = d = e = 0;
156}
157
158void    mvSHA1Init(MV_SHA1_CTX* context)
159{
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;
167}
168
169
170/* Run your data through this. */
171void    mvSHA1Update(MV_SHA1_CTX *context, MV_U8 const *data,
172                     unsigned int len)
173{
174    MV_U32 i, j;
175
176    j = (context->count[0] >> 3) & 63;
177    if ((context->count[0] += len << 3) < (len << 3))
178            context->count[1]++;
179    context->count[1] += (len >> 29);
180    if ((j + len) > 63)
181    {
182        memcpy(&context->buffer[j], data, (i = 64-j));
183        mvSHA1Transform(context->state, context->buffer);
184        for ( ; i + 63 < len; i += 64)
185        {
186            mvSHA1Transform(context->state, &data[i]);
187        }
188        j = 0;
189    }
190    else
191    {
192        i = 0;
193    }
194    memcpy(&context->buffer[j], &data[i], len - i);
195}
196
197void    mvSHA1Final(MV_U8* digest, MV_SHA1_CTX* context)
198{
199    MV_U32  i;
200    MV_U8   finalcount[8];
201
202    for (i = 0; i < 8; i++)
203    {
204        finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] >>
205                      ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
206    }
207    mvSHA1Update(context, (const unsigned char *) "\200", 1);
208    while ((context->count[0] & 504) != 448)
209    {
210        mvSHA1Update(context, (const unsigned char *) "\0", 1);
211    }
212    mvSHA1Update(context, finalcount, 8);  /* Should cause a mvSHA1Transform()
213                                          */
214    for (i = 0; i < 20; i++)
215    {
216        digest[i] = (unsigned char)
217                    ((context->state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255);
218    }
219    /* Wipe variables */
220    i = 0;
221    memset(context->buffer, 0, 64);
222    memset(context->state, 0, 20);
223    memset(context->count, 0, 8);
224    memset(finalcount, 0, 8);
225
226#ifdef SHA1HANDSOFF  /* make SHA1Transform overwrite it's own static vars */
227    mvSHA1Transform(context->state, context->buffer);
228#endif
229}
230
231
232void mvSHA1(MV_U8 const *buf, unsigned int len, MV_U8* digest)
233{
234    MV_SHA1_CTX  ctx;
235
236    mvSHA1Init(&ctx);
237    mvSHA1Update(&ctx, buf, len);
238    mvSHA1Final(digest, &ctx);
239}
240