TCPSpeedTest - I have a problem getting this to work. Server onl…

Users » tax » Code » TCPSpeedTest

Jesper Taxbøl / Mbed 2 deprecated TCPSpeedTest

I have a problem getting this to work. Server only recieves half of the data being sent. Whats wrong

services/mysql/sha1.c@0:66300c77c6e9, 2011-03-29 (annotated)

Committer:: tax
Date:: Tue Mar 29 13:20:15 2011 +0000
Revision:: 0:66300c77c6e9

Who changed what in which revision?

User	Revision	Line number	New contents of line
tax	0:66300c77c6e9	1	/*
tax	0:66300c77c6e9	2	* FIPS-180-1 compliant SHA-1 implementation
tax	0:66300c77c6e9	3	*
tax	0:66300c77c6e9	4	* Copyright (C) 2006-2010, Paul Bakker <polarssl_maintainer at polarssl.org>
tax	0:66300c77c6e9	5	* All rights reserved.
tax	0:66300c77c6e9	6	*
tax	0:66300c77c6e9	7	* This program is free software; you can redistribute it and/or modify
tax	0:66300c77c6e9	8	* it under the terms of the GNU General Public License as published by
tax	0:66300c77c6e9	9	* the Free Software Foundation; either version 2 of the License, or
tax	0:66300c77c6e9	10	* (at your option) any later version.
tax	0:66300c77c6e9	11	*
tax	0:66300c77c6e9	12	* This program is distributed in the hope that it will be useful,
tax	0:66300c77c6e9	13	* but WITHOUT ANY WARRANTY; without even the implied warranty of
tax	0:66300c77c6e9	14	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
tax	0:66300c77c6e9	15	* GNU General Public License for more details.
tax	0:66300c77c6e9	16	*
tax	0:66300c77c6e9	17	* You should have received a copy of the GNU General Public License along
tax	0:66300c77c6e9	18	* with this program; if not, write to the Free Software Foundation, Inc.,
tax	0:66300c77c6e9	19	* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
tax	0:66300c77c6e9	20	*/
tax	0:66300c77c6e9	21	/*
tax	0:66300c77c6e9	22	* The SHA-1 standard was published by NIST in 1993.
tax	0:66300c77c6e9	23	*
tax	0:66300c77c6e9	24	* http://www.itl.nist.gov/fipspubs/fip180-1.htm
tax	0:66300c77c6e9	25	*/
tax	0:66300c77c6e9	26
tax	0:66300c77c6e9	27	#include "sha1config.h"
tax	0:66300c77c6e9	28
tax	0:66300c77c6e9	29	#if defined(POLARSSL_SHA1_C)
tax	0:66300c77c6e9	30
tax	0:66300c77c6e9	31	#include "sha1.h"
tax	0:66300c77c6e9	32
tax	0:66300c77c6e9	33	#include <string.h>
tax	0:66300c77c6e9	34	#include <stdio.h>
tax	0:66300c77c6e9	35
tax	0:66300c77c6e9	36	/*
tax	0:66300c77c6e9	37	* 32-bit integer manipulation macros (big endian)
tax	0:66300c77c6e9	38	*/
tax	0:66300c77c6e9	39	#ifndef GET_ULONG_BE
tax	0:66300c77c6e9	40	#define GET_ULONG_BE(n,b,i) \
tax	0:66300c77c6e9	41	{ \
tax	0:66300c77c6e9	42	(n) = ( (unsigned long) (b)[(i) ] << 24 ) \
tax	0:66300c77c6e9	43	\| ( (unsigned long) (b)[(i) + 1] << 16 ) \
tax	0:66300c77c6e9	44	\| ( (unsigned long) (b)[(i) + 2] << 8 ) \
tax	0:66300c77c6e9	45	\| ( (unsigned long) (b)[(i) + 3] ); \
tax	0:66300c77c6e9	46	}
tax	0:66300c77c6e9	47	#endif
tax	0:66300c77c6e9	48
tax	0:66300c77c6e9	49	#ifndef PUT_ULONG_BE
tax	0:66300c77c6e9	50	#define PUT_ULONG_BE(n,b,i) \
tax	0:66300c77c6e9	51	{ \
tax	0:66300c77c6e9	52	(b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
tax	0:66300c77c6e9	53	(b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
tax	0:66300c77c6e9	54	(b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
tax	0:66300c77c6e9	55	(b)[(i) + 3] = (unsigned char) ( (n) ); \
tax	0:66300c77c6e9	56	}
tax	0:66300c77c6e9	57	#endif
tax	0:66300c77c6e9	58
tax	0:66300c77c6e9	59	/*
tax	0:66300c77c6e9	60	* SHA-1 context setup
tax	0:66300c77c6e9	61	*/
tax	0:66300c77c6e9	62	void sha1_starts( sha1_context *ctx )
tax	0:66300c77c6e9	63	{
tax	0:66300c77c6e9	64	ctx->total[0] = 0;
tax	0:66300c77c6e9	65	ctx->total[1] = 0;
tax	0:66300c77c6e9	66
tax	0:66300c77c6e9	67	ctx->state[0] = 0x67452301;
tax	0:66300c77c6e9	68	ctx->state[1] = 0xEFCDAB89;
tax	0:66300c77c6e9	69	ctx->state[2] = 0x98BADCFE;
tax	0:66300c77c6e9	70	ctx->state[3] = 0x10325476;
tax	0:66300c77c6e9	71	ctx->state[4] = 0xC3D2E1F0;
tax	0:66300c77c6e9	72	}
tax	0:66300c77c6e9	73
tax	0:66300c77c6e9	74	static void sha1_process( sha1_context *ctx, const unsigned char data[64] )
tax	0:66300c77c6e9	75	{
tax	0:66300c77c6e9	76	unsigned long temp, W[16], A, B, C, D, E;
tax	0:66300c77c6e9	77
tax	0:66300c77c6e9	78	GET_ULONG_BE( W[ 0], data, 0 );
tax	0:66300c77c6e9	79	GET_ULONG_BE( W[ 1], data, 4 );
tax	0:66300c77c6e9	80	GET_ULONG_BE( W[ 2], data, 8 );
tax	0:66300c77c6e9	81	GET_ULONG_BE( W[ 3], data, 12 );
tax	0:66300c77c6e9	82	GET_ULONG_BE( W[ 4], data, 16 );
tax	0:66300c77c6e9	83	GET_ULONG_BE( W[ 5], data, 20 );
tax	0:66300c77c6e9	84	GET_ULONG_BE( W[ 6], data, 24 );
tax	0:66300c77c6e9	85	GET_ULONG_BE( W[ 7], data, 28 );
tax	0:66300c77c6e9	86	GET_ULONG_BE( W[ 8], data, 32 );
tax	0:66300c77c6e9	87	GET_ULONG_BE( W[ 9], data, 36 );
tax	0:66300c77c6e9	88	GET_ULONG_BE( W[10], data, 40 );
tax	0:66300c77c6e9	89	GET_ULONG_BE( W[11], data, 44 );
tax	0:66300c77c6e9	90	GET_ULONG_BE( W[12], data, 48 );
tax	0:66300c77c6e9	91	GET_ULONG_BE( W[13], data, 52 );
tax	0:66300c77c6e9	92	GET_ULONG_BE( W[14], data, 56 );
tax	0:66300c77c6e9	93	GET_ULONG_BE( W[15], data, 60 );
tax	0:66300c77c6e9	94
tax	0:66300c77c6e9	95	#define S(x,n) ((x << n) \| ((x & 0xFFFFFFFF) >> (32 - n)))
tax	0:66300c77c6e9	96
tax	0:66300c77c6e9	97	#define R(t) \
tax	0:66300c77c6e9	98	( \
tax	0:66300c77c6e9	99	temp = W[(t - 3) & 0x0F] ^ W[(t - 8) & 0x0F] ^ \
tax	0:66300c77c6e9	100	W[(t - 14) & 0x0F] ^ W[ t & 0x0F], \
tax	0:66300c77c6e9	101	( W[t & 0x0F] = S(temp,1) ) \
tax	0:66300c77c6e9	102	)
tax	0:66300c77c6e9	103
tax	0:66300c77c6e9	104	#define P(a,b,c,d,e,x) \
tax	0:66300c77c6e9	105	{ \
tax	0:66300c77c6e9	106	e += S(a,5) + F(b,c,d) + K + x; b = S(b,30); \
tax	0:66300c77c6e9	107	}
tax	0:66300c77c6e9	108
tax	0:66300c77c6e9	109	A = ctx->state[0];
tax	0:66300c77c6e9	110	B = ctx->state[1];
tax	0:66300c77c6e9	111	C = ctx->state[2];
tax	0:66300c77c6e9	112	D = ctx->state[3];
tax	0:66300c77c6e9	113	E = ctx->state[4];
tax	0:66300c77c6e9	114
tax	0:66300c77c6e9	115	#define F(x,y,z) (z ^ (x & (y ^ z)))
tax	0:66300c77c6e9	116	#define K 0x5A827999
tax	0:66300c77c6e9	117
tax	0:66300c77c6e9	118	P( A, B, C, D, E, W[0] );
tax	0:66300c77c6e9	119	P( E, A, B, C, D, W[1] );
tax	0:66300c77c6e9	120	P( D, E, A, B, C, W[2] );
tax	0:66300c77c6e9	121	P( C, D, E, A, B, W[3] );
tax	0:66300c77c6e9	122	P( B, C, D, E, A, W[4] );
tax	0:66300c77c6e9	123	P( A, B, C, D, E, W[5] );
tax	0:66300c77c6e9	124	P( E, A, B, C, D, W[6] );
tax	0:66300c77c6e9	125	P( D, E, A, B, C, W[7] );
tax	0:66300c77c6e9	126	P( C, D, E, A, B, W[8] );
tax	0:66300c77c6e9	127	P( B, C, D, E, A, W[9] );
tax	0:66300c77c6e9	128	P( A, B, C, D, E, W[10] );
tax	0:66300c77c6e9	129	P( E, A, B, C, D, W[11] );
tax	0:66300c77c6e9	130	P( D, E, A, B, C, W[12] );
tax	0:66300c77c6e9	131	P( C, D, E, A, B, W[13] );
tax	0:66300c77c6e9	132	P( B, C, D, E, A, W[14] );
tax	0:66300c77c6e9	133	P( A, B, C, D, E, W[15] );
tax	0:66300c77c6e9	134	P( E, A, B, C, D, R(16) );
tax	0:66300c77c6e9	135	P( D, E, A, B, C, R(17) );
tax	0:66300c77c6e9	136	P( C, D, E, A, B, R(18) );
tax	0:66300c77c6e9	137	P( B, C, D, E, A, R(19) );
tax	0:66300c77c6e9	138
tax	0:66300c77c6e9	139	#undef K
tax	0:66300c77c6e9	140	#undef F
tax	0:66300c77c6e9	141
tax	0:66300c77c6e9	142	#define F(x,y,z) (x ^ y ^ z)
tax	0:66300c77c6e9	143	#define K 0x6ED9EBA1
tax	0:66300c77c6e9	144
tax	0:66300c77c6e9	145	P( A, B, C, D, E, R(20) );
tax	0:66300c77c6e9	146	P( E, A, B, C, D, R(21) );
tax	0:66300c77c6e9	147	P( D, E, A, B, C, R(22) );
tax	0:66300c77c6e9	148	P( C, D, E, A, B, R(23) );
tax	0:66300c77c6e9	149	P( B, C, D, E, A, R(24) );
tax	0:66300c77c6e9	150	P( A, B, C, D, E, R(25) );
tax	0:66300c77c6e9	151	P( E, A, B, C, D, R(26) );
tax	0:66300c77c6e9	152	P( D, E, A, B, C, R(27) );
tax	0:66300c77c6e9	153	P( C, D, E, A, B, R(28) );
tax	0:66300c77c6e9	154	P( B, C, D, E, A, R(29) );
tax	0:66300c77c6e9	155	P( A, B, C, D, E, R(30) );
tax	0:66300c77c6e9	156	P( E, A, B, C, D, R(31) );
tax	0:66300c77c6e9	157	P( D, E, A, B, C, R(32) );
tax	0:66300c77c6e9	158	P( C, D, E, A, B, R(33) );
tax	0:66300c77c6e9	159	P( B, C, D, E, A, R(34) );
tax	0:66300c77c6e9	160	P( A, B, C, D, E, R(35) );
tax	0:66300c77c6e9	161	P( E, A, B, C, D, R(36) );
tax	0:66300c77c6e9	162	P( D, E, A, B, C, R(37) );
tax	0:66300c77c6e9	163	P( C, D, E, A, B, R(38) );
tax	0:66300c77c6e9	164	P( B, C, D, E, A, R(39) );
tax	0:66300c77c6e9	165
tax	0:66300c77c6e9	166	#undef K
tax	0:66300c77c6e9	167	#undef F
tax	0:66300c77c6e9	168
tax	0:66300c77c6e9	169	#define F(x,y,z) ((x & y) \| (z & (x \| y)))
tax	0:66300c77c6e9	170	#define K 0x8F1BBCDC
tax	0:66300c77c6e9	171
tax	0:66300c77c6e9	172	P( A, B, C, D, E, R(40) );
tax	0:66300c77c6e9	173	P( E, A, B, C, D, R(41) );
tax	0:66300c77c6e9	174	P( D, E, A, B, C, R(42) );
tax	0:66300c77c6e9	175	P( C, D, E, A, B, R(43) );
tax	0:66300c77c6e9	176	P( B, C, D, E, A, R(44) );
tax	0:66300c77c6e9	177	P( A, B, C, D, E, R(45) );
tax	0:66300c77c6e9	178	P( E, A, B, C, D, R(46) );
tax	0:66300c77c6e9	179	P( D, E, A, B, C, R(47) );
tax	0:66300c77c6e9	180	P( C, D, E, A, B, R(48) );
tax	0:66300c77c6e9	181	P( B, C, D, E, A, R(49) );
tax	0:66300c77c6e9	182	P( A, B, C, D, E, R(50) );
tax	0:66300c77c6e9	183	P( E, A, B, C, D, R(51) );
tax	0:66300c77c6e9	184	P( D, E, A, B, C, R(52) );
tax	0:66300c77c6e9	185	P( C, D, E, A, B, R(53) );
tax	0:66300c77c6e9	186	P( B, C, D, E, A, R(54) );
tax	0:66300c77c6e9	187	P( A, B, C, D, E, R(55) );
tax	0:66300c77c6e9	188	P( E, A, B, C, D, R(56) );
tax	0:66300c77c6e9	189	P( D, E, A, B, C, R(57) );
tax	0:66300c77c6e9	190	P( C, D, E, A, B, R(58) );
tax	0:66300c77c6e9	191	P( B, C, D, E, A, R(59) );
tax	0:66300c77c6e9	192
tax	0:66300c77c6e9	193	#undef K
tax	0:66300c77c6e9	194	#undef F
tax	0:66300c77c6e9	195
tax	0:66300c77c6e9	196	#define F(x,y,z) (x ^ y ^ z)
tax	0:66300c77c6e9	197	#define K 0xCA62C1D6
tax	0:66300c77c6e9	198
tax	0:66300c77c6e9	199	P( A, B, C, D, E, R(60) );
tax	0:66300c77c6e9	200	P( E, A, B, C, D, R(61) );
tax	0:66300c77c6e9	201	P( D, E, A, B, C, R(62) );
tax	0:66300c77c6e9	202	P( C, D, E, A, B, R(63) );
tax	0:66300c77c6e9	203	P( B, C, D, E, A, R(64) );
tax	0:66300c77c6e9	204	P( A, B, C, D, E, R(65) );
tax	0:66300c77c6e9	205	P( E, A, B, C, D, R(66) );
tax	0:66300c77c6e9	206	P( D, E, A, B, C, R(67) );
tax	0:66300c77c6e9	207	P( C, D, E, A, B, R(68) );
tax	0:66300c77c6e9	208	P( B, C, D, E, A, R(69) );
tax	0:66300c77c6e9	209	P( A, B, C, D, E, R(70) );
tax	0:66300c77c6e9	210	P( E, A, B, C, D, R(71) );
tax	0:66300c77c6e9	211	P( D, E, A, B, C, R(72) );
tax	0:66300c77c6e9	212	P( C, D, E, A, B, R(73) );
tax	0:66300c77c6e9	213	P( B, C, D, E, A, R(74) );
tax	0:66300c77c6e9	214	P( A, B, C, D, E, R(75) );
tax	0:66300c77c6e9	215	P( E, A, B, C, D, R(76) );
tax	0:66300c77c6e9	216	P( D, E, A, B, C, R(77) );
tax	0:66300c77c6e9	217	P( C, D, E, A, B, R(78) );
tax	0:66300c77c6e9	218	P( B, C, D, E, A, R(79) );
tax	0:66300c77c6e9	219
tax	0:66300c77c6e9	220	#undef K
tax	0:66300c77c6e9	221	#undef F
tax	0:66300c77c6e9	222
tax	0:66300c77c6e9	223	ctx->state[0] += A;
tax	0:66300c77c6e9	224	ctx->state[1] += B;
tax	0:66300c77c6e9	225	ctx->state[2] += C;
tax	0:66300c77c6e9	226	ctx->state[3] += D;
tax	0:66300c77c6e9	227	ctx->state[4] += E;
tax	0:66300c77c6e9	228	}
tax	0:66300c77c6e9	229
tax	0:66300c77c6e9	230	/*
tax	0:66300c77c6e9	231	* SHA-1 process buffer
tax	0:66300c77c6e9	232	*/
tax	0:66300c77c6e9	233	void sha1_update( sha1_context ctx, const unsigned char input, int ilen )
tax	0:66300c77c6e9	234	{
tax	0:66300c77c6e9	235	int fill;
tax	0:66300c77c6e9	236	unsigned long left;
tax	0:66300c77c6e9	237
tax	0:66300c77c6e9	238	if( ilen <= 0 )
tax	0:66300c77c6e9	239	return;
tax	0:66300c77c6e9	240
tax	0:66300c77c6e9	241	left = ctx->total[0] & 0x3F;
tax	0:66300c77c6e9	242	fill = 64 - left;
tax	0:66300c77c6e9	243
tax	0:66300c77c6e9	244	ctx->total[0] += ilen;
tax	0:66300c77c6e9	245	ctx->total[0] &= 0xFFFFFFFF;
tax	0:66300c77c6e9	246
tax	0:66300c77c6e9	247	if( ctx->total[0] < (unsigned long) ilen )
tax	0:66300c77c6e9	248	ctx->total[1]++;
tax	0:66300c77c6e9	249
tax	0:66300c77c6e9	250	if( left && ilen >= fill )
tax	0:66300c77c6e9	251	{
tax	0:66300c77c6e9	252	memcpy( (void *) (ctx->buffer + left),
tax	0:66300c77c6e9	253	(void *) input, fill );
tax	0:66300c77c6e9	254	sha1_process( ctx, ctx->buffer );
tax	0:66300c77c6e9	255	input += fill;
tax	0:66300c77c6e9	256	ilen -= fill;
tax	0:66300c77c6e9	257	left = 0;
tax	0:66300c77c6e9	258	}
tax	0:66300c77c6e9	259
tax	0:66300c77c6e9	260	while( ilen >= 64 )
tax	0:66300c77c6e9	261	{
tax	0:66300c77c6e9	262	sha1_process( ctx, input );
tax	0:66300c77c6e9	263	input += 64;
tax	0:66300c77c6e9	264	ilen -= 64;
tax	0:66300c77c6e9	265	}
tax	0:66300c77c6e9	266
tax	0:66300c77c6e9	267	if( ilen > 0 )
tax	0:66300c77c6e9	268	{
tax	0:66300c77c6e9	269	memcpy( (void *) (ctx->buffer + left),
tax	0:66300c77c6e9	270	(void *) input, ilen );
tax	0:66300c77c6e9	271	}
tax	0:66300c77c6e9	272	}
tax	0:66300c77c6e9	273
tax	0:66300c77c6e9	274	static const unsigned char sha1_padding[64] =
tax	0:66300c77c6e9	275	{
tax	0:66300c77c6e9	276	0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
tax	0:66300c77c6e9	277	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
tax	0:66300c77c6e9	278	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
tax	0:66300c77c6e9	279	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
tax	0:66300c77c6e9	280	};
tax	0:66300c77c6e9	281
tax	0:66300c77c6e9	282	/*
tax	0:66300c77c6e9	283	* SHA-1 final digest
tax	0:66300c77c6e9	284	*/
tax	0:66300c77c6e9	285	void sha1_finish( sha1_context *ctx, unsigned char output[20] )
tax	0:66300c77c6e9	286	{
tax	0:66300c77c6e9	287	unsigned long last, padn;
tax	0:66300c77c6e9	288	unsigned long high, low;
tax	0:66300c77c6e9	289	unsigned char msglen[8];
tax	0:66300c77c6e9	290
tax	0:66300c77c6e9	291	high = ( ctx->total[0] >> 29 )
tax	0:66300c77c6e9	292	\| ( ctx->total[1] << 3 );
tax	0:66300c77c6e9	293	low = ( ctx->total[0] << 3 );
tax	0:66300c77c6e9	294
tax	0:66300c77c6e9	295	PUT_ULONG_BE( high, msglen, 0 );
tax	0:66300c77c6e9	296	PUT_ULONG_BE( low, msglen, 4 );
tax	0:66300c77c6e9	297
tax	0:66300c77c6e9	298	last = ctx->total[0] & 0x3F;
tax	0:66300c77c6e9	299	padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
tax	0:66300c77c6e9	300
tax	0:66300c77c6e9	301	sha1_update( ctx, (unsigned char *) sha1_padding, padn );
tax	0:66300c77c6e9	302	sha1_update( ctx, msglen, 8 );
tax	0:66300c77c6e9	303
tax	0:66300c77c6e9	304	PUT_ULONG_BE( ctx->state[0], output, 0 );
tax	0:66300c77c6e9	305	PUT_ULONG_BE( ctx->state[1], output, 4 );
tax	0:66300c77c6e9	306	PUT_ULONG_BE( ctx->state[2], output, 8 );
tax	0:66300c77c6e9	307	PUT_ULONG_BE( ctx->state[3], output, 12 );
tax	0:66300c77c6e9	308	PUT_ULONG_BE( ctx->state[4], output, 16 );
tax	0:66300c77c6e9	309	}
tax	0:66300c77c6e9	310
tax	0:66300c77c6e9	311	/*
tax	0:66300c77c6e9	312	* output = SHA-1( input buffer )
tax	0:66300c77c6e9	313	*/
tax	0:66300c77c6e9	314	void sha1( const unsigned char *input, int ilen, unsigned char output[20] )
tax	0:66300c77c6e9	315	{
tax	0:66300c77c6e9	316	sha1_context ctx;
tax	0:66300c77c6e9	317
tax	0:66300c77c6e9	318	sha1_starts( &ctx );
tax	0:66300c77c6e9	319	sha1_update( &ctx, input, ilen );
tax	0:66300c77c6e9	320	sha1_finish( &ctx, output );
tax	0:66300c77c6e9	321
tax	0:66300c77c6e9	322	memset( &ctx, 0, sizeof( sha1_context ) );
tax	0:66300c77c6e9	323	}
tax	0:66300c77c6e9	324
tax	0:66300c77c6e9	325	/*
tax	0:66300c77c6e9	326	* output = SHA-1( file contents )
tax	0:66300c77c6e9	327	*/
tax	0:66300c77c6e9	328	#if 0 //No need for that
tax	0:66300c77c6e9	329	int sha1_file( const char *path, unsigned char output[20] )
tax	0:66300c77c6e9	330	{
tax	0:66300c77c6e9	331	FILE *f;
tax	0:66300c77c6e9	332	size_t n;
tax	0:66300c77c6e9	333	sha1_context ctx;
tax	0:66300c77c6e9	334	unsigned char buf[1024];
tax	0:66300c77c6e9	335
tax	0:66300c77c6e9	336	if( ( f = fopen( path, "rb" ) ) == NULL )
tax	0:66300c77c6e9	337	return( 1 );
tax	0:66300c77c6e9	338
tax	0:66300c77c6e9	339	sha1_starts( &ctx );
tax	0:66300c77c6e9	340
tax	0:66300c77c6e9	341	while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 )
tax	0:66300c77c6e9	342	sha1_update( &ctx, buf, (int) n );
tax	0:66300c77c6e9	343
tax	0:66300c77c6e9	344	sha1_finish( &ctx, output );
tax	0:66300c77c6e9	345
tax	0:66300c77c6e9	346	memset( &ctx, 0, sizeof( sha1_context ) );
tax	0:66300c77c6e9	347
tax	0:66300c77c6e9	348	if( ferror( f ) != 0 )
tax	0:66300c77c6e9	349	{
tax	0:66300c77c6e9	350	fclose( f );
tax	0:66300c77c6e9	351	return( 2 );
tax	0:66300c77c6e9	352	}
tax	0:66300c77c6e9	353
tax	0:66300c77c6e9	354	fclose( f );
tax	0:66300c77c6e9	355	return( 0 );
tax	0:66300c77c6e9	356	}
tax	0:66300c77c6e9	357	#endif
tax	0:66300c77c6e9	358
tax	0:66300c77c6e9	359	/*
tax	0:66300c77c6e9	360	* SHA-1 HMAC context setup
tax	0:66300c77c6e9	361	*/
tax	0:66300c77c6e9	362	void sha1_hmac_starts( sha1_context ctx, const unsigned char key, int keylen )
tax	0:66300c77c6e9	363	{
tax	0:66300c77c6e9	364	int i;
tax	0:66300c77c6e9	365	unsigned char sum[20];
tax	0:66300c77c6e9	366
tax	0:66300c77c6e9	367	if( keylen > 64 )
tax	0:66300c77c6e9	368	{
tax	0:66300c77c6e9	369	sha1( key, keylen, sum );
tax	0:66300c77c6e9	370	keylen = 20;
tax	0:66300c77c6e9	371	key = sum;
tax	0:66300c77c6e9	372	}
tax	0:66300c77c6e9	373
tax	0:66300c77c6e9	374	memset( ctx->ipad, 0x36, 64 );
tax	0:66300c77c6e9	375	memset( ctx->opad, 0x5C, 64 );
tax	0:66300c77c6e9	376
tax	0:66300c77c6e9	377	for( i = 0; i < keylen; i++ )
tax	0:66300c77c6e9	378	{
tax	0:66300c77c6e9	379	ctx->ipad[i] = (unsigned char)( ctx->ipad[i] ^ key[i] );
tax	0:66300c77c6e9	380	ctx->opad[i] = (unsigned char)( ctx->opad[i] ^ key[i] );
tax	0:66300c77c6e9	381	}
tax	0:66300c77c6e9	382
tax	0:66300c77c6e9	383	sha1_starts( ctx );
tax	0:66300c77c6e9	384	sha1_update( ctx, ctx->ipad, 64 );
tax	0:66300c77c6e9	385
tax	0:66300c77c6e9	386	memset( sum, 0, sizeof( sum ) );
tax	0:66300c77c6e9	387	}
tax	0:66300c77c6e9	388
tax	0:66300c77c6e9	389	/*
tax	0:66300c77c6e9	390	* SHA-1 HMAC process buffer
tax	0:66300c77c6e9	391	*/
tax	0:66300c77c6e9	392	void sha1_hmac_update( sha1_context ctx, const unsigned char input, int ilen )
tax	0:66300c77c6e9	393	{
tax	0:66300c77c6e9	394	sha1_update( ctx, input, ilen );
tax	0:66300c77c6e9	395	}
tax	0:66300c77c6e9	396
tax	0:66300c77c6e9	397	/*
tax	0:66300c77c6e9	398	* SHA-1 HMAC final digest
tax	0:66300c77c6e9	399	*/
tax	0:66300c77c6e9	400	void sha1_hmac_finish( sha1_context *ctx, unsigned char output[20] )
tax	0:66300c77c6e9	401	{
tax	0:66300c77c6e9	402	unsigned char tmpbuf[20];
tax	0:66300c77c6e9	403
tax	0:66300c77c6e9	404	sha1_finish( ctx, tmpbuf );
tax	0:66300c77c6e9	405	sha1_starts( ctx );
tax	0:66300c77c6e9	406	sha1_update( ctx, ctx->opad, 64 );
tax	0:66300c77c6e9	407	sha1_update( ctx, tmpbuf, 20 );
tax	0:66300c77c6e9	408	sha1_finish( ctx, output );
tax	0:66300c77c6e9	409
tax	0:66300c77c6e9	410	memset( tmpbuf, 0, sizeof( tmpbuf ) );
tax	0:66300c77c6e9	411	}
tax	0:66300c77c6e9	412
tax	0:66300c77c6e9	413	/*
tax	0:66300c77c6e9	414	* SHA1 HMAC context reset
tax	0:66300c77c6e9	415	*/
tax	0:66300c77c6e9	416	void sha1_hmac_reset( sha1_context *ctx )
tax	0:66300c77c6e9	417	{
tax	0:66300c77c6e9	418	sha1_starts( ctx );
tax	0:66300c77c6e9	419	sha1_update( ctx, ctx->ipad, 64 );
tax	0:66300c77c6e9	420	}
tax	0:66300c77c6e9	421
tax	0:66300c77c6e9	422	/*
tax	0:66300c77c6e9	423	* output = HMAC-SHA-1( hmac key, input buffer )
tax	0:66300c77c6e9	424	*/
tax	0:66300c77c6e9	425	void sha1_hmac( const unsigned char *key, int keylen,
tax	0:66300c77c6e9	426	const unsigned char *input, int ilen,
tax	0:66300c77c6e9	427	unsigned char output[20] )
tax	0:66300c77c6e9	428	{
tax	0:66300c77c6e9	429	sha1_context ctx;
tax	0:66300c77c6e9	430
tax	0:66300c77c6e9	431	sha1_hmac_starts( &ctx, key, keylen );
tax	0:66300c77c6e9	432	sha1_hmac_update( &ctx, input, ilen );
tax	0:66300c77c6e9	433	sha1_hmac_finish( &ctx, output );
tax	0:66300c77c6e9	434
tax	0:66300c77c6e9	435	memset( &ctx, 0, sizeof( sha1_context ) );
tax	0:66300c77c6e9	436	}
tax	0:66300c77c6e9	437
tax	0:66300c77c6e9	438	#if defined(POLARSSL_SELF_TEST)
tax	0:66300c77c6e9	439	/*
tax	0:66300c77c6e9	440	* FIPS-180-1 test vectors
tax	0:66300c77c6e9	441	*/
tax	0:66300c77c6e9	442	static unsigned char sha1_test_buf[3][57] =
tax	0:66300c77c6e9	443	{
tax	0:66300c77c6e9	444	{ "abc" },
tax	0:66300c77c6e9	445	{ "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
tax	0:66300c77c6e9	446	{ "" }
tax	0:66300c77c6e9	447	};
tax	0:66300c77c6e9	448
tax	0:66300c77c6e9	449	static const int sha1_test_buflen[3] =
tax	0:66300c77c6e9	450	{
tax	0:66300c77c6e9	451	3, 56, 1000
tax	0:66300c77c6e9	452	};
tax	0:66300c77c6e9	453
tax	0:66300c77c6e9	454	static const unsigned char sha1_test_sum[3][20] =
tax	0:66300c77c6e9	455	{
tax	0:66300c77c6e9	456	{ 0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E,
tax	0:66300c77c6e9	457	0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D },
tax	0:66300c77c6e9	458	{ 0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE,
tax	0:66300c77c6e9	459	0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1 },
tax	0:66300c77c6e9	460	{ 0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E,
tax	0:66300c77c6e9	461	0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31, 0x65, 0x34, 0x01, 0x6F }
tax	0:66300c77c6e9	462	};
tax	0:66300c77c6e9	463
tax	0:66300c77c6e9	464	/*
tax	0:66300c77c6e9	465	* RFC 2202 test vectors
tax	0:66300c77c6e9	466	*/
tax	0:66300c77c6e9	467	static unsigned char sha1_hmac_test_key[7][26] =
tax	0:66300c77c6e9	468	{
tax	0:66300c77c6e9	469	{ "\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B"
tax	0:66300c77c6e9	470	"\x0B\x0B\x0B\x0B" },
tax	0:66300c77c6e9	471	{ "Jefe" },
tax	0:66300c77c6e9	472	{ "\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA"
tax	0:66300c77c6e9	473	"\xAA\xAA\xAA\xAA" },
tax	0:66300c77c6e9	474	{ "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0A\x0B\x0C\x0D\x0E\x0F\x10"
tax	0:66300c77c6e9	475	"\x11\x12\x13\x14\x15\x16\x17\x18\x19" },
tax	0:66300c77c6e9	476	{ "\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C"
tax	0:66300c77c6e9	477	"\x0C\x0C\x0C\x0C" },
tax	0:66300c77c6e9	478	{ "" }, /* 0xAA 80 times */
tax	0:66300c77c6e9	479	{ "" }
tax	0:66300c77c6e9	480	};
tax	0:66300c77c6e9	481
tax	0:66300c77c6e9	482	static const int sha1_hmac_test_keylen[7] =
tax	0:66300c77c6e9	483	{
tax	0:66300c77c6e9	484	20, 4, 20, 25, 20, 80, 80
tax	0:66300c77c6e9	485	};
tax	0:66300c77c6e9	486
tax	0:66300c77c6e9	487	static unsigned char sha1_hmac_test_buf[7][74] =
tax	0:66300c77c6e9	488	{
tax	0:66300c77c6e9	489	{ "Hi There" },
tax	0:66300c77c6e9	490	{ "what do ya want for nothing?" },
tax	0:66300c77c6e9	491	{ "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
tax	0:66300c77c6e9	492	"\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
tax	0:66300c77c6e9	493	"\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
tax	0:66300c77c6e9	494	"\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
tax	0:66300c77c6e9	495	"\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD" },
tax	0:66300c77c6e9	496	{ "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
tax	0:66300c77c6e9	497	"\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
tax	0:66300c77c6e9	498	"\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
tax	0:66300c77c6e9	499	"\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
tax	0:66300c77c6e9	500	"\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD" },
tax	0:66300c77c6e9	501	{ "Test With Truncation" },
tax	0:66300c77c6e9	502	{ "Test Using Larger Than Block-Size Key - Hash Key First" },
tax	0:66300c77c6e9	503	{ "Test Using Larger Than Block-Size Key and Larger"
tax	0:66300c77c6e9	504	" Than One Block-Size Data" }
tax	0:66300c77c6e9	505	};
tax	0:66300c77c6e9	506
tax	0:66300c77c6e9	507	static const int sha1_hmac_test_buflen[7] =
tax	0:66300c77c6e9	508	{
tax	0:66300c77c6e9	509	8, 28, 50, 50, 20, 54, 73
tax	0:66300c77c6e9	510	};
tax	0:66300c77c6e9	511
tax	0:66300c77c6e9	512	static const unsigned char sha1_hmac_test_sum[7][20] =
tax	0:66300c77c6e9	513	{
tax	0:66300c77c6e9	514	{ 0xB6, 0x17, 0x31, 0x86, 0x55, 0x05, 0x72, 0x64, 0xE2, 0x8B,
tax	0:66300c77c6e9	515	0xC0, 0xB6, 0xFB, 0x37, 0x8C, 0x8E, 0xF1, 0x46, 0xBE, 0x00 },
tax	0:66300c77c6e9	516	{ 0xEF, 0xFC, 0xDF, 0x6A, 0xE5, 0xEB, 0x2F, 0xA2, 0xD2, 0x74,
tax	0:66300c77c6e9	517	0x16, 0xD5, 0xF1, 0x84, 0xDF, 0x9C, 0x25, 0x9A, 0x7C, 0x79 },
tax	0:66300c77c6e9	518	{ 0x12, 0x5D, 0x73, 0x42, 0xB9, 0xAC, 0x11, 0xCD, 0x91, 0xA3,
tax	0:66300c77c6e9	519	0x9A, 0xF4, 0x8A, 0xA1, 0x7B, 0x4F, 0x63, 0xF1, 0x75, 0xD3 },
tax	0:66300c77c6e9	520	{ 0x4C, 0x90, 0x07, 0xF4, 0x02, 0x62, 0x50, 0xC6, 0xBC, 0x84,
tax	0:66300c77c6e9	521	0x14, 0xF9, 0xBF, 0x50, 0xC8, 0x6C, 0x2D, 0x72, 0x35, 0xDA },
tax	0:66300c77c6e9	522	{ 0x4C, 0x1A, 0x03, 0x42, 0x4B, 0x55, 0xE0, 0x7F, 0xE7, 0xF2,
tax	0:66300c77c6e9	523	0x7B, 0xE1 },
tax	0:66300c77c6e9	524	{ 0xAA, 0x4A, 0xE5, 0xE1, 0x52, 0x72, 0xD0, 0x0E, 0x95, 0x70,
tax	0:66300c77c6e9	525	0x56, 0x37, 0xCE, 0x8A, 0x3B, 0x55, 0xED, 0x40, 0x21, 0x12 },
tax	0:66300c77c6e9	526	{ 0xE8, 0xE9, 0x9D, 0x0F, 0x45, 0x23, 0x7D, 0x78, 0x6D, 0x6B,
tax	0:66300c77c6e9	527	0xBA, 0xA7, 0x96, 0x5C, 0x78, 0x08, 0xBB, 0xFF, 0x1A, 0x91 }
tax	0:66300c77c6e9	528	};
tax	0:66300c77c6e9	529
tax	0:66300c77c6e9	530	/*
tax	0:66300c77c6e9	531	* Checkup routine
tax	0:66300c77c6e9	532	*/
tax	0:66300c77c6e9	533	int sha1_self_test( int verbose )
tax	0:66300c77c6e9	534	{
tax	0:66300c77c6e9	535	int i, j, buflen;
tax	0:66300c77c6e9	536	unsigned char buf[1024];
tax	0:66300c77c6e9	537	unsigned char sha1sum[20];
tax	0:66300c77c6e9	538	sha1_context ctx;
tax	0:66300c77c6e9	539
tax	0:66300c77c6e9	540	/*
tax	0:66300c77c6e9	541	* SHA-1
tax	0:66300c77c6e9	542	*/
tax	0:66300c77c6e9	543	for( i = 0; i < 3; i++ )
tax	0:66300c77c6e9	544	{
tax	0:66300c77c6e9	545	if( verbose != 0 )
tax	0:66300c77c6e9	546	printf( " SHA-1 test #%d: ", i + 1 );
tax	0:66300c77c6e9	547
tax	0:66300c77c6e9	548	sha1_starts( &ctx );
tax	0:66300c77c6e9	549
tax	0:66300c77c6e9	550	if( i == 2 )
tax	0:66300c77c6e9	551	{
tax	0:66300c77c6e9	552	memset( buf, 'a', buflen = 1000 );
tax	0:66300c77c6e9	553
tax	0:66300c77c6e9	554	for( j = 0; j < 1000; j++ )
tax	0:66300c77c6e9	555	sha1_update( &ctx, buf, buflen );
tax	0:66300c77c6e9	556	}
tax	0:66300c77c6e9	557	else
tax	0:66300c77c6e9	558	sha1_update( &ctx, sha1_test_buf[i],
tax	0:66300c77c6e9	559	sha1_test_buflen[i] );
tax	0:66300c77c6e9	560
tax	0:66300c77c6e9	561	sha1_finish( &ctx, sha1sum );
tax	0:66300c77c6e9	562
tax	0:66300c77c6e9	563	if( memcmp( sha1sum, sha1_test_sum[i], 20 ) != 0 )
tax	0:66300c77c6e9	564	{
tax	0:66300c77c6e9	565	if( verbose != 0 )
tax	0:66300c77c6e9	566	printf( "failed\n" );
tax	0:66300c77c6e9	567
tax	0:66300c77c6e9	568	return( 1 );
tax	0:66300c77c6e9	569	}
tax	0:66300c77c6e9	570
tax	0:66300c77c6e9	571	if( verbose != 0 )
tax	0:66300c77c6e9	572	printf( "passed\n" );
tax	0:66300c77c6e9	573	}
tax	0:66300c77c6e9	574
tax	0:66300c77c6e9	575	if( verbose != 0 )
tax	0:66300c77c6e9	576	printf( "\n" );
tax	0:66300c77c6e9	577
tax	0:66300c77c6e9	578	for( i = 0; i < 7; i++ )
tax	0:66300c77c6e9	579	{
tax	0:66300c77c6e9	580	if( verbose != 0 )
tax	0:66300c77c6e9	581	printf( " HMAC-SHA-1 test #%d: ", i + 1 );
tax	0:66300c77c6e9	582
tax	0:66300c77c6e9	583	if( i == 5 \|\| i == 6 )
tax	0:66300c77c6e9	584	{
tax	0:66300c77c6e9	585	memset( buf, '\xAA', buflen = 80 );
tax	0:66300c77c6e9	586	sha1_hmac_starts( &ctx, buf, buflen );
tax	0:66300c77c6e9	587	}
tax	0:66300c77c6e9	588	else
tax	0:66300c77c6e9	589	sha1_hmac_starts( &ctx, sha1_hmac_test_key[i],
tax	0:66300c77c6e9	590	sha1_hmac_test_keylen[i] );
tax	0:66300c77c6e9	591
tax	0:66300c77c6e9	592	sha1_hmac_update( &ctx, sha1_hmac_test_buf[i],
tax	0:66300c77c6e9	593	sha1_hmac_test_buflen[i] );
tax	0:66300c77c6e9	594
tax	0:66300c77c6e9	595	sha1_hmac_finish( &ctx, sha1sum );
tax	0:66300c77c6e9	596
tax	0:66300c77c6e9	597	buflen = ( i == 4 ) ? 12 : 20;
tax	0:66300c77c6e9	598
tax	0:66300c77c6e9	599	if( memcmp( sha1sum, sha1_hmac_test_sum[i], buflen ) != 0 )
tax	0:66300c77c6e9	600	{
tax	0:66300c77c6e9	601	if( verbose != 0 )
tax	0:66300c77c6e9	602	printf( "failed\n" );
tax	0:66300c77c6e9	603
tax	0:66300c77c6e9	604	return( 1 );
tax	0:66300c77c6e9	605	}
tax	0:66300c77c6e9	606
tax	0:66300c77c6e9	607	if( verbose != 0 )
tax	0:66300c77c6e9	608	printf( "passed\n" );
tax	0:66300c77c6e9	609	}
tax	0:66300c77c6e9	610
tax	0:66300c77c6e9	611	if( verbose != 0 )
tax	0:66300c77c6e9	612	printf( "\n" );
tax	0:66300c77c6e9	613
tax	0:66300c77c6e9	614	return( 0 );
tax	0:66300c77c6e9	615	}
tax	0:66300c77c6e9	616
tax	0:66300c77c6e9	617	#endif
tax	0:66300c77c6e9	618
tax	0:66300c77c6e9	619	#endif

Repository toolbox

Export to desktop IDE

Build repository

Repository details

Type:	Program
Mbed OS support:	Mbed 2 deprecated
Created:	29 Mar 2011
Imports:	16
Forks:	0
Commits:	1
Dependents:	0
Dependencies:	1
Followers:	2

services/mysql/sha1.c@0:66300c77c6e9, 2011-03-29 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning