[apple/xnu.git] / bsd / crypto / sha1.c

/*
 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. 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.
 * 3. Neither the name of the project 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 PROJECT 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 PROJECT 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.
 */
/*
 * FIPS pub 180-1: Secure Hash Algorithm (SHA-1)
 * based on: http://csrc.nist.gov/fips/fip180-1.txt
 * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org>
 */

#include <sys/types.h>
#include <sys/cdefs.h>
#include <sys/time.h>
#include <sys/systm.h>

#include <crypto/sha1.h>

/* sanity check */
#if BYTE_ORDER != BIG_ENDIAN
# if BYTE_ORDER != LITTLE_ENDIAN
#  define unsupported 1
# endif
#endif

#ifndef unsupported

/* constant table */
static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
#define	K(t)	_K[(t) / 20]

#define	F0(b, c, d)	(((b) & (c)) | ((~(b)) & (d)))
#define	F1(b, c, d)	(((b) ^ (c)) ^ (d))
#define	F2(b, c, d)	(((b) & (c)) | ((b) & (d)) | ((c) & (d)))
#define	F3(b, c, d)	(((b) ^ (c)) ^ (d))

#define	S(n, x)		(((x) << (n)) | ((x) >> (32 - n)))

#define	H(n)	(ctxt->h.b32[(n)])
#define	COUNT	(ctxt->count)
#define	BCOUNT	(ctxt->c.b64[0] / 8)
#define	W(n)	(ctxt->m.b32[(n)])

#define	PUTBYTE(x)	{ \
	ctxt->m.b8[(COUNT % 64)] = (x);		\
	COUNT++;				\
	COUNT %= 64;				\
	ctxt->c.b64[0] += 8;			\
	if (COUNT % 64 == 0)			\
		sha1_step(ctxt);		\
     }

#define	PUTPAD(x)	{ \
	ctxt->m.b8[(COUNT % 64)] = (x);		\
	COUNT++;				\
	COUNT %= 64;				\
	if (COUNT % 64 == 0)			\
		sha1_step(ctxt);		\
     }

static void sha1_step __P((struct sha1_ctxt *));

static void
sha1_step(ctxt)
	struct sha1_ctxt *ctxt;
{
	u_int32_t	a, b, c, d, e;
	size_t t, s;
	u_int32_t	tmp;

#if BYTE_ORDER == LITTLE_ENDIAN
	struct sha1_ctxt tctxt;
	bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
	ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
	ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
	ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
	ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
	ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
	ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
	ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
	ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
	ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
	ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
	ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
	ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
	ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
	ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
	ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
	ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
	ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
	ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
	ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
	ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
	ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
	ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
	ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
	ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
	ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
	ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
	ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
	ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
	ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
	ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
	ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
	ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
#endif

	a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);

	for (t = 0; t < 20; t++) {
		s = t & 0x0f;
		if (t >= 16) {
			W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
		}
		tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
		e = d; d = c; c = S(30, b); b = a; a = tmp;
	}
	for (t = 20; t < 40; t++) {
		s = t & 0x0f;
		W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
		tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
		e = d; d = c; c = S(30, b); b = a; a = tmp;
	}
	for (t = 40; t < 60; t++) {
		s = t & 0x0f;
		W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
		tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
		e = d; d = c; c = S(30, b); b = a; a = tmp;
	}
	for (t = 60; t < 80; t++) {
		s = t & 0x0f;
		W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
		tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
		e = d; d = c; c = S(30, b); b = a; a = tmp;
	}

	H(0) = H(0) + a;
	H(1) = H(1) + b;
	H(2) = H(2) + c;
	H(3) = H(3) + d;
	H(4) = H(4) + e;

	bzero(&ctxt->m.b8[0], 64);
}

/*------------------------------------------------------------*/

void
sha1_init(ctxt)
	struct sha1_ctxt *ctxt;
{
	bzero(ctxt, sizeof(struct sha1_ctxt));
	H(0) = 0x67452301;
	H(1) = 0xefcdab89;
	H(2) = 0x98badcfe;
	H(3) = 0x10325476;
	H(4) = 0xc3d2e1f0;
}

void
sha1_pad(ctxt)
	struct sha1_ctxt *ctxt;
{
	size_t padlen;		/*pad length in bytes*/
	size_t padstart;

	PUTPAD(0x80);

	padstart = COUNT % 64;
	padlen = 64 - padstart;
	if (padlen < 8) {
		bzero(&ctxt->m.b8[padstart], padlen);
		COUNT += padlen;
		COUNT %= 64;
		sha1_step(ctxt);
		padstart = COUNT % 64;	/* should be 0 */
		padlen = 64 - padstart;	/* should be 64 */
	}
	bzero(&ctxt->m.b8[padstart], padlen - 8);
	COUNT += (padlen - 8);
	COUNT %= 64;
#if BYTE_ORDER == BIG_ENDIAN
	PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
	PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
	PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
	PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
#else
	PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
	PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
	PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
	PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
#endif
}

void
sha1_loop(ctxt, input0, len)
	struct sha1_ctxt *ctxt;
	const caddr_t input0;
	size_t len;
{
	const u_int8_t *input;
	size_t gaplen;
	size_t gapstart;
	size_t off;
	size_t copysiz;

	input = (const u_int8_t *)input0;
	off = 0;

	while (off < len) {
		gapstart = COUNT % 64;
		gaplen = 64 - gapstart;

		copysiz = (gaplen < len - off) ? gaplen : len - off;
		bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
		COUNT += copysiz;
		COUNT %= 64;
		ctxt->c.b64[0] += copysiz * 8;
		if (COUNT % 64 == 0)
			sha1_step(ctxt);
		off += copysiz;
	}
}

void
sha1_result(ctxt, digest0)
	struct sha1_ctxt *ctxt;
	caddr_t digest0;
{
	u_int8_t *digest;

	digest = (u_int8_t *)digest0;
	sha1_pad(ctxt);
#if BYTE_ORDER == BIG_ENDIAN
	bcopy(&ctxt->h.b8[0], digest, 20);
#else
	digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
	digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
	digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
	digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
	digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
	digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
	digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
	digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
	digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
	digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
#endif
}

#endif /*unsupported*/
Commit	Line	Data
1c79356b A	1	/*
	2	* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
	3	* All rights reserved.
	4	*
	5	* Redistribution and use in source and binary forms, with or without
	6	* modification, are permitted provided that the following conditions
	7	* are met:
	8	* 1. Redistributions of source code must retain the above copyright
	9	* notice, this list of conditions and the following disclaimer.
	10	* 2. Redistributions in binary form must reproduce the above copyright
	11	* notice, this list of conditions and the following disclaimer in the
	12	* documentation and/or other materials provided with the distribution.
	13	* 3. Neither the name of the project nor the names of its contributors
	14	* may be used to endorse or promote products derived from this software
	15	* without specific prior written permission.
	16	*
	17	* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
	18	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	19	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	20	* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
	21	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	22	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	23	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	24	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	25	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	26	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	27	* SUCH DAMAGE.
	28	*/
	29	/*
	30	* FIPS pub 180-1: Secure Hash Algorithm (SHA-1)
	31	* based on: http://csrc.nist.gov/fips/fip180-1.txt
	32	* implemented by Jun-ichiro itojun Itoh <itojun@itojun.org>
	33	*/
	34
	35	#include <sys/types.h>
	36	#include <sys/cdefs.h>
	37	#include <sys/time.h>
	38	#include <sys/systm.h>
	39
	40	#include <crypto/sha1.h>
	41
	42	/* sanity check */
	43	#if BYTE_ORDER != BIG_ENDIAN
	44	# if BYTE_ORDER != LITTLE_ENDIAN
	45	# define unsupported 1
	46	# endif
	47	#endif
	48
	49	#ifndef unsupported
	50
	51	/* constant table */
	52	static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
	53	#define K(t) _K[(t) / 20]
	54
	55	#define F0(b, c, d) (((b) & (c)) \| ((~(b)) & (d)))
	56	#define F1(b, c, d) (((b) ^ (c)) ^ (d))
	57	#define F2(b, c, d) (((b) & (c)) \| ((b) & (d)) \| ((c) & (d)))
	58	#define F3(b, c, d) (((b) ^ (c)) ^ (d))
	59
	60	#define S(n, x) (((x) << (n)) \| ((x) >> (32 - n)))
	61
	62	#define H(n) (ctxt->h.b32[(n)])
	63	#define COUNT (ctxt->count)
	64	#define BCOUNT (ctxt->c.b64[0] / 8)
65	#define W(n) (ctxt->m.b32[(n)])
66
67	#define PUTBYTE(x) { \
68	ctxt->m.b8[(COUNT % 64)] = (x); \
69	COUNT++; \
70	COUNT %= 64; \
71	ctxt->c.b64[0] += 8; \
72	if (COUNT % 64 == 0) \
73	sha1_step(ctxt); \
74	}
75
76	#define PUTPAD(x) { \
77	ctxt->m.b8[(COUNT % 64)] = (x); \
78	COUNT++; \
79	COUNT %= 64; \
80	if (COUNT % 64 == 0) \
81	sha1_step(ctxt); \
82	}
83
84	static void sha1_step __P((struct sha1_ctxt *));
85
86	static void
87	sha1_step(ctxt)
88	struct sha1_ctxt *ctxt;
89	{
90	u_int32_t a, b, c, d, e;
91	size_t t, s;
92	u_int32_t tmp;
93
94	#if BYTE_ORDER == LITTLE_ENDIAN
95	struct sha1_ctxt tctxt;
96	bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
97	ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
98	ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
99	ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
100	ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
101	ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
102	ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
103	ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
104	ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
105	ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
106	ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
107	ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
108	ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
109	ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
110	ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
111	ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
112	ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
113	ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
114	ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
115	ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
116	ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
117	ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
118	ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
119	ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
120	ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
121	ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
122	ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
123	ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
124	ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
125	ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
126	ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
127	ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
128	ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
129	#endif
130
131	a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
132
133	for (t = 0; t < 20; t++) {
134	s = t & 0x0f;
135	if (t >= 16) {
136	W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
137	}
138	tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
139	e = d; d = c; c = S(30, b); b = a; a = tmp;
140	}
141	for (t = 20; t < 40; t++) {
142	s = t & 0x0f;
143	W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
144	tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
145	e = d; d = c; c = S(30, b); b = a; a = tmp;
146	}
147	for (t = 40; t < 60; t++) {
148	s = t & 0x0f;
149	W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
150	tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
151	e = d; d = c; c = S(30, b); b = a; a = tmp;
152	}
153	for (t = 60; t < 80; t++) {
154	s = t & 0x0f;
155	W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
156	tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
157	e = d; d = c; c = S(30, b); b = a; a = tmp;
158	}
159
160	H(0) = H(0) + a;
161	H(1) = H(1) + b;
162	H(2) = H(2) + c;
163	H(3) = H(3) + d;
164	H(4) = H(4) + e;
165
166	bzero(&ctxt->m.b8[0], 64);
167	}
168
169	/------------------------------------------------------------/
170
171	void
172	sha1_init(ctxt)
173	struct sha1_ctxt *ctxt;
174	{
175	bzero(ctxt, sizeof(struct sha1_ctxt));
176	H(0) = 0x67452301;
177	H(1) = 0xefcdab89;
178	H(2) = 0x98badcfe;
179	H(3) = 0x10325476;
180	H(4) = 0xc3d2e1f0;
181	}
182
183	void
184	sha1_pad(ctxt)
185	struct sha1_ctxt *ctxt;
186	{
187	size_t padlen; /pad length in bytes/
188	size_t padstart;
189
190	PUTPAD(0x80);
191
192	padstart = COUNT % 64;
193	padlen = 64 - padstart;
194	if (padlen < 8) {
195	bzero(&ctxt->m.b8[padstart], padlen);
196	COUNT += padlen;
197	COUNT %= 64;
198	sha1_step(ctxt);
199	padstart = COUNT % 64; /* should be 0 */
200	padlen = 64 - padstart; /* should be 64 */
201	}
202	bzero(&ctxt->m.b8[padstart], padlen - 8);
203	COUNT += (padlen - 8);
204	COUNT %= 64;
205	#if BYTE_ORDER == BIG_ENDIAN
206	PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
207	PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
208	PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
209	PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
210	#else
211	PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
212	PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
213	PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
214	PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
215	#endif
216	}
217
218	void
219	sha1_loop(ctxt, input0, len)
220	struct sha1_ctxt *ctxt;
221	const caddr_t input0;
222	size_t len;
223	{
224	const u_int8_t *input;
225	size_t gaplen;
226	size_t gapstart;
227	size_t off;
228	size_t copysiz;
229
230	input = (const u_int8_t *)input0;
231	off = 0;
232
233	while (off < len) {
234	gapstart = COUNT % 64;
235	gaplen = 64 - gapstart;
236
237	copysiz = (gaplen < len - off) ? gaplen : len - off;
238	bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
239	COUNT += copysiz;
240	COUNT %= 64;
241	ctxt->c.b64[0] += copysiz * 8;
242	if (COUNT % 64 == 0)
243	sha1_step(ctxt);
244	off += copysiz;
245	}
246	}
247
248	void
249	sha1_result(ctxt, digest0)
250	struct sha1_ctxt *ctxt;
251	caddr_t digest0;
252	{
253	u_int8_t *digest;
254
255	digest = (u_int8_t *)digest0;
256	sha1_pad(ctxt);
257	#if BYTE_ORDER == BIG_ENDIAN
258	bcopy(&ctxt->h.b8[0], digest, 20);
259	#else
260	digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
261	digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
262	digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
263	digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
264	digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
265	digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
266	digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
267	digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
268	digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
269	digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
270	#endif
271	}
272
273	#endif /unsupported/