[redis.git] / sha1.c


/* from valgrind tests */

/* ================ sha1.c ================ */
/*
SHA-1 in C
By Steve Reid <steve@edmweb.com>
100% Public Domain

Test Vectors (from FIPS PUB 180-1)
"abc"
  A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
A million repetitions of "a"
  34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
*/

/* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
/* #define SHA1HANDSOFF * Copies data before messing with it. */

#define SHA1HANDSOFF

#include <endian.h>

#include <stdio.h>
#include <string.h>
#include <sys/types.h>	/* for u_int*_t */
#include "sha1.h"

#ifndef BYTE_ORDER
#if (BSD >= 199103)
# include <machine/endian.h>
#else
#ifdef linux
# include <endian.h>
#else
#define	LITTLE_ENDIAN	1234	/* least-significant byte first (vax, pc) */
#define	BIG_ENDIAN	4321	/* most-significant byte first (IBM, net) */
#define	PDP_ENDIAN	3412	/* LSB first in word, MSW first in long (pdp)*/

#if defined(vax) || defined(ns32000) || defined(sun386) || defined(__i386__) || \
    defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \
    defined(__alpha__) || defined(__alpha)
#define BYTE_ORDER	LITTLE_ENDIAN
#endif

#if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \
    defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \
    defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\
    defined(apollo) || defined(__convex__) || defined(_CRAY) || \
    defined(__hppa) || defined(__hp9000) || \
    defined(__hp9000s300) || defined(__hp9000s700) || \
    defined (BIT_ZERO_ON_LEFT) || defined(m68k)
#define BYTE_ORDER	BIG_ENDIAN
#endif
#endif /* linux */
#endif /* BSD */
#endif /* BYTE_ORDER */

#if defined(__BYTE_ORDER) && !defined(BYTE_ORDER)
#if (__BYTE_ORDER == __LITTLE_ENDIAN)
#define BYTE_ORDER LITTLE_ENDIAN
#else
#define BYTE_ORDER BIG_ENDIAN
#endif
#endif

#if !defined(BYTE_ORDER) || \
    (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \
    BYTE_ORDER != PDP_ENDIAN)
	/* you must determine what the correct bit order is for
	 * your compiler - the next line is an intentional error
	 * which will force your compiles to bomb until you fix
	 * the above macros.
	 */
#error "Undefined or invalid BYTE_ORDER"
#endif

#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))

/* blk0() and blk() perform the initial expand. */
/* I got the idea of expanding during the round function from SSLeay */
#if BYTE_ORDER == LITTLE_ENDIAN
#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
    |(rol(block->l[i],8)&0x00FF00FF))
#elif BYTE_ORDER == BIG_ENDIAN
#define blk0(i) block->l[i]
#else
#error "Endianness not defined!"
#endif
#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
    ^block->l[(i+2)&15]^block->l[i&15],1))

/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);


/* Hash a single 512-bit block. This is the core of the algorithm. */

void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64])
{
u_int32_t a, b, c, d, e;
typedef union {
    unsigned char c[64];
    u_int32_t l[16];
} CHAR64LONG16;
#ifdef SHA1HANDSOFF
CHAR64LONG16 block[1];  /* use array to appear as a pointer */
    memcpy(block, buffer, 64);
#else
    /* The following had better never be used because it causes the
     * pointer-to-const buffer to be cast into a pointer to non-const.
     * And the result is written through.  I threw a "const" in, hoping
     * this will cause a diagnostic.
     */
CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
#endif
    /* Copy context->state[] to working vars */
    a = state[0];
    b = state[1];
    c = state[2];
    d = state[3];
    e = state[4];
    /* 4 rounds of 20 operations each. Loop unrolled. */
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    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);
    /* Add the working vars back into context.state[] */
    state[0] += a;
    state[1] += b;
    state[2] += c;
    state[3] += d;
    state[4] += e;
    /* Wipe variables */
    a = b = c = d = e = 0;
#ifdef SHA1HANDSOFF
    memset(block, '\0', sizeof(block));
#endif
}


/* SHA1Init - Initialize new context */

void SHA1Init(SHA1_CTX* context)
{
    /* SHA1 initialization constants */
    context->state[0] = 0x67452301;
    context->state[1] = 0xEFCDAB89;
    context->state[2] = 0x98BADCFE;
    context->state[3] = 0x10325476;
    context->state[4] = 0xC3D2E1F0;
    context->count[0] = context->count[1] = 0;
}


/* Run your data through this. */

void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len)
{
u_int32_t i;
u_int32_t j;

    j = context->count[0];
    if ((context->count[0] += len << 3) < j)
	context->count[1]++;
    context->count[1] += (len>>29);
    j = (j >> 3) & 63;
    if ((j + len) > 63) {
        memcpy(&context->buffer[j], data, (i = 64-j));
        SHA1Transform(context->state, context->buffer);
        for ( ; i + 63 < len; i += 64) {
            SHA1Transform(context->state, &data[i]);
        }
        j = 0;
    }
    else i = 0;
    memcpy(&context->buffer[j], &data[i], len - i);
}


/* Add padding and return the message digest. */

void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
{
unsigned i;
unsigned char finalcount[8];
unsigned char c;

#if 0	/* untested "improvement" by DHR */
    /* Convert context->count to a sequence of bytes
     * in finalcount.  Second element first, but
     * big-endian order within element.
     * But we do it all backwards.
     */
    unsigned char *fcp = &finalcount[8];

    for (i = 0; i < 2; i++)
    {
	u_int32_t t = context->count[i];
	int j;

	for (j = 0; j < 4; t >>= 8, j++)
	    *--fcp = (unsigned char) t
    }
#else
    for (i = 0; i < 8; i++) {
        finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
         >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
    }
#endif
    c = 0200;
    SHA1Update(context, &c, 1);
    while ((context->count[0] & 504) != 448) {
	c = 0000;
        SHA1Update(context, &c, 1);
    }
    SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
    for (i = 0; i < 20; i++) {
        digest[i] = (unsigned char)
         ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
    }
    /* Wipe variables */
    memset(context, '\0', sizeof(*context));
    memset(&finalcount, '\0', sizeof(finalcount));
}
/* ================ end of sha1.c ================ */

#if 0
#define BUFSIZE 4096

int
main(int argc, char **argv)
{
    SHA1_CTX ctx;
    unsigned char hash[20], buf[BUFSIZE];
    int i;

    for(i=0;i<BUFSIZE;i++)
        buf[i] = i;

    SHA1Init(&ctx);
    for(i=0;i<1000;i++)
        SHA1Update(&ctx, buf, BUFSIZE);
    SHA1Final(hash, &ctx);

    printf("SHA1=");
    for(i=0;i<20;i++)
        printf("%02x", hash[i]);
    printf("\n");
    return 0;
}

#endif
Commit	Line	Data
ba798261	1
	2	/* from valgrind tests */
	3
	4	/* ================ sha1.c ================ */
	5	/*
	6	SHA-1 in C
	7	By Steve Reid <steve@edmweb.com>
	8	100% Public Domain
	9
	10	Test Vectors (from FIPS PUB 180-1)
	11	"abc"
	12	A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
	13	"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
	14	84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
	15	A million repetitions of "a"
	16	34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
	17	*/
	18
	19	/* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
	20	/* #define SHA1HANDSOFF * Copies data before messing with it. */
	21
	22	#define SHA1HANDSOFF
	23
8ba40049	24	#include <endian.h>
8ba40049	25
ba798261	26	#include <stdio.h>
	27	#include <string.h>
	28	#include <sys/types.h> /* for u_int_t /
	29	#include "sha1.h"
	30
	31	#ifndef BYTE_ORDER
	32	#if (BSD >= 199103)
	33	# include <machine/endian.h>
	34	#else
	35	#ifdef linux
	36	# include <endian.h>
	37	#else
	38	#define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */
	39	#define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */
	40	#define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp)*/
	41
	42	#if defined(vax) \|\| defined(ns32000) \|\| defined(sun386) \|\| defined(__i386__) \|\| \
	43	defined(MIPSEL) \|\| defined(_MIPSEL) \|\| defined(BIT_ZERO_ON_RIGHT) \|\| \
	44	defined(__alpha__) \|\| defined(__alpha)
	45	#define BYTE_ORDER LITTLE_ENDIAN
	46	#endif
	47
	48	#if defined(sel) \|\| defined(pyr) \|\| defined(mc68000) \|\| defined(sparc) \|\| \
	49	defined(is68k) \|\| defined(tahoe) \|\| defined(ibm032) \|\| defined(ibm370) \|\| \
	50	defined(MIPSEB) \|\| defined(_MIPSEB) \|\| defined(_IBMR2) \|\| defined(DGUX) \|\|\
	51	defined(apollo) \|\| defined(__convex__) \|\| defined(_CRAY) \|\| \
	52	defined(__hppa) \|\| defined(__hp9000) \|\| \
	53	defined(__hp9000s300) \|\| defined(__hp9000s700) \|\| \
	54	defined (BIT_ZERO_ON_LEFT) \|\| defined(m68k)
	55	#define BYTE_ORDER BIG_ENDIAN
	56	#endif
	57	#endif /* linux */
	58	#endif /* BSD */
	59	#endif /* BYTE_ORDER */
	60
8ba40049	61	#if defined(__BYTE_ORDER) && !defined(BYTE_ORDER)
	62	#if (__BYTE_ORDER == __LITTLE_ENDIAN)
	63	#define BYTE_ORDER LITTLE_ENDIAN
	64	#else
	65	#define BYTE_ORDER BIG_ENDIAN
	66	#endif
	67	#endif
	68
ba798261	69	#if !defined(BYTE_ORDER) \|\| \
	70	(BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \
	71	BYTE_ORDER != PDP_ENDIAN)
	72	/* you must determine what the correct bit order is for
	73	* your compiler - the next line is an intentional error
	74	* which will force your compiles to bomb until you fix
	75	* the above macros.
	76	*/
8ba40049	77	#error "Undefined or invalid BYTE_ORDER"
ba798261	78	#endif
	79
	80	#define rol(value, bits) (((value) << (bits)) \| ((value) >> (32 - (bits))))
	81
	82	/* blk0() and blk() perform the initial expand. */
	83	/* I got the idea of expanding during the round function from SSLeay */
	84	#if BYTE_ORDER == LITTLE_ENDIAN
	85	#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
	86	\|(rol(block->l[i],8)&0x00FF00FF))
	87	#elif BYTE_ORDER == BIG_ENDIAN
	88	#define blk0(i) block->l[i]
	89	#else
	90	#error "Endianness not defined!"
	91	#endif
	92	#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
	93	^block->l[(i+2)&15]^block->l[i&15],1))
	94
	95	/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
	96	#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
	97	#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
	98	#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
	99	#define R3(v,w,x,y,z,i) z+=(((w\|x)&y)\|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
	100	#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
	101
	102
	103	/* Hash a single 512-bit block. This is the core of the algorithm. */
	104
	105	void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64])
	106	{
	107	u_int32_t a, b, c, d, e;
	108	typedef union {
	109	unsigned char c[64];
	110	u_int32_t l[16];
	111	} CHAR64LONG16;
	112	#ifdef SHA1HANDSOFF
	113	CHAR64LONG16 block[1]; /* use array to appear as a pointer */
	114	memcpy(block, buffer, 64);
	115	#else
	116	/* The following had better never be used because it causes the
	117	* pointer-to-const buffer to be cast into a pointer to non-const.
	118	* And the result is written through. I threw a "const" in, hoping
	119	* this will cause a diagnostic.
	120	*/
	121	CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
	122	#endif
	123	/* Copy context->state[] to working vars */
	124	a = state[0];
	125	b = state[1];
	126	c = state[2];
	127	d = state[3];
	128	e = state[4];
	129	/* 4 rounds of 20 operations each. Loop unrolled. */
	130	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);
	131	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);
	132	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);
	133	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);
	134	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);
	135	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);
	136	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);
	137	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);
	138	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);
	139	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);
	140	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);
	141	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);
142	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);
143	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);
144	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);
145	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);
146	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);
147	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);
148	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);
149	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);
150	/* Add the working vars back into context.state[] */
151	state[0] += a;
152	state[1] += b;
153	state[2] += c;
154	state[3] += d;
155	state[4] += e;
156	/* Wipe variables */
157	a = b = c = d = e = 0;
158	#ifdef SHA1HANDSOFF
159	memset(block, '\0', sizeof(block));
160	#endif
161	}
162
163
164	/* SHA1Init - Initialize new context */
165
166	void SHA1Init(SHA1_CTX* context)
167	{
168	/* SHA1 initialization constants */
169	context->state[0] = 0x67452301;
170	context->state[1] = 0xEFCDAB89;
171	context->state[2] = 0x98BADCFE;
172	context->state[3] = 0x10325476;
173	context->state[4] = 0xC3D2E1F0;
174	context->count[0] = context->count[1] = 0;
175	}
176
177
178	/* Run your data through this. */
179
180	void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len)
181	{
182	u_int32_t i;
183	u_int32_t j;
184
185	j = context->count[0];
186	if ((context->count[0] += len << 3) < j)
187	context->count[1]++;
188	context->count[1] += (len>>29);
189	j = (j >> 3) & 63;
190	if ((j + len) > 63) {
191	memcpy(&context->buffer[j], data, (i = 64-j));
192	SHA1Transform(context->state, context->buffer);
193	for ( ; i + 63 < len; i += 64) {
194	SHA1Transform(context->state, &data[i]);
195	}
196	j = 0;
197	}
198	else i = 0;
199	memcpy(&context->buffer[j], &data[i], len - i);
200	}
201
202
203	/* Add padding and return the message digest. */
204
205	void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
206	{
207	unsigned i;
208	unsigned char finalcount[8];
209	unsigned char c;
210
211	#if 0 /* untested "improvement" by DHR */
212	/* Convert context->count to a sequence of bytes
213	* in finalcount. Second element first, but
214	* big-endian order within element.
215	* But we do it all backwards.
216	*/
217	unsigned char *fcp = &finalcount[8];
218
219	for (i = 0; i < 2; i++)
220	{
221	u_int32_t t = context->count[i];
222	int j;
223
224	for (j = 0; j < 4; t >>= 8, j++)
225	*--fcp = (unsigned char) t
226	}
227	#else
228	for (i = 0; i < 8; i++) {
229	finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
230	>> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
231	}
232	#endif
233	c = 0200;
234	SHA1Update(context, &c, 1);
235	while ((context->count[0] & 504) != 448) {
236	c = 0000;
237	SHA1Update(context, &c, 1);
238	}
239	SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
240	for (i = 0; i < 20; i++) {
241	digest[i] = (unsigned char)
242	((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
243	}
244	/* Wipe variables */
245	memset(context, '\0', sizeof(*context));
246	memset(&finalcount, '\0', sizeof(finalcount));
247	}
248	/* ================ end of sha1.c ================ */
249
250	#if 0
251	#define BUFSIZE 4096
252
253	int
254	main(int argc, char **argv)
255	{
256	SHA1_CTX ctx;
257	unsigned char hash[20], buf[BUFSIZE];
258	int i;
259
260	for(i=0;i<BUFSIZE;i++)
261	buf[i] = i;
262
263	SHA1Init(&ctx);
264	for(i=0;i<1000;i++)
265	SHA1Update(&ctx, buf, BUFSIZE);
266	SHA1Final(hash, &ctx);
267
268	printf("SHA1=");
269	for(i=0;i<20;i++)
270	printf("%02x", hash[i]);
271	printf("\n");
272	return 0;
273	}
274
275	#endif