blob: 80b15094e2436ae6e475614ebc6a46de5495b7da [file] [log] [blame]
SimonB15942102016-04-25 21:34:49 +01001#line 1 "helpers.function"
SimonB0269dad2016-02-17 23:34:30 +00002/*----------------------------------------------------------------------------*/
3/* Headers */
4
Simon Butcheredb7fd92016-05-17 13:35:51 +01005#include <stdlib.h>
6
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02007#if defined(MBEDTLS_PLATFORM_C)
Manuel Pégourié-Gonnard7f809972015-03-09 17:05:11 +00008#include "mbedtls/platform.h"
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +02009#else
Rich Evans00ab4702015-02-06 13:43:58 +000010#include <stdio.h>
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020011#define mbedtls_fprintf fprintf
Simon Butcher25731362016-09-30 13:11:29 +010012#define mbedtls_snprintf snprintf
13#define mbedtls_calloc calloc
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020014#define mbedtls_free free
15#define mbedtls_exit exit
Simon Butcherb2d5dd12016-04-27 13:35:37 +010016#define mbedtls_time time
17#define mbedtls_time_t time_t
Janos Follath55abc212016-04-18 18:18:48 +010018#define MBEDTLS_EXIT_SUCCESS EXIT_SUCCESS
19#define MBEDTLS_EXIT_FAILURE EXIT_FAILURE
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020020#endif
21
SimonB0269dad2016-02-17 23:34:30 +000022#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
23#include "mbedtls/memory_buffer_alloc.h"
24#endif
25
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000026#ifdef _MSC_VER
27#include <basetsd.h>
28typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000029#define strncasecmp _strnicmp
30#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000031#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020032#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033#endif
34
Paul Bakker19343182013-08-16 13:31:10 +020035#include <string.h>
36
Janos Follath8ca53b52016-10-05 10:57:49 +010037#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
38#include <unistd.h>
39#endif
SimonB0269dad2016-02-17 23:34:30 +000040
41/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010042/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000043
SimonB8ca7bc42016-04-17 23:24:50 +010044#define DEPENDENCY_SUPPORTED 0
45#define DEPENDENCY_NOT_SUPPORTED 1
46
47#define KEY_VALUE_MAPPING_FOUND 0
48#define KEY_VALUE_MAPPING_NOT_FOUND -1
49
50#define DISPATCH_TEST_SUCCESS 0
51#define DISPATCH_TEST_FN_NOT_FOUND 1
52#define DISPATCH_INVALID_TEST_DATA 2
53#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000054
55
56/*----------------------------------------------------------------------------*/
57/* Macros */
58
59#define TEST_ASSERT( TEST ) \
60 do { \
61 if( ! (TEST) ) \
62 { \
SimonB31a6c492016-05-02 21:32:44 +010063 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000064 goto exit; \
65 } \
66 } while( 0 )
67
Rich Evans4c091142015-02-02 12:04:10 +000068#define assert(a) if( !( a ) ) \
69{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020070 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000071 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020072 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000073}
74
Ronald Croneb5d0e92020-04-06 10:34:22 +020075#if defined(__GNUC__)
76/* Test if arg and &(arg)[0] have the same type. This is true if arg is
77 * an array but not if it's a pointer. */
78#define IS_ARRAY_NOT_POINTER( arg ) \
79 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
80 __typeof__( &( arg )[0] ) ) )
81#else
82/* On platforms where we don't know how to implement this check,
83 * omit it. Oh well, a non-portable check is better than nothing. */
84#define IS_ARRAY_NOT_POINTER( arg ) 1
85#endif
86
87/* A compile-time constant with the value 0. If `const_expr` is not a
88 * compile-time constant with a nonzero value, cause a compile-time error. */
89#define STATIC_ASSERT_EXPR( const_expr ) \
90 ( 0 && sizeof( struct { int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
91/* Return the scalar value `value` (possibly promoted). This is a compile-time
92 * constant if `value` is. `condition` must be a compile-time constant.
93 * If `condition` is false, arrange to cause a compile-time error. */
94#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
95 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
96
97#define ARRAY_LENGTH_UNSAFE( array ) \
98 ( sizeof( array ) / sizeof( *( array ) ) )
99/** Return the number of elements of a static or stack array.
100 *
101 * \param array A value of array (not pointer) type.
102 *
103 * \return The number of elements of the array.
104 */
105#define ARRAY_LENGTH( array ) \
106 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
107 ARRAY_LENGTH_UNSAFE( array ) ) )
108
109
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000110/*
111 * 32-bit integer manipulation macros (big endian)
112 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000113#ifndef GET_UINT32_BE
114#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000115{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000116 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
117 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
118 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
119 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000120}
121#endif
122
Paul Bakker5c2364c2012-10-01 14:41:15 +0000123#ifndef PUT_UINT32_BE
124#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000125{ \
126 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
127 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
128 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
129 (b)[(i) + 3] = (unsigned char) ( (n) ); \
130}
131#endif
132
SimonB0269dad2016-02-17 23:34:30 +0000133
134/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100135/* Global variables */
136
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100137
138static struct
139{
140 int failed;
141 const char *test;
142 const char *filename;
143 int line_no;
144}
145test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100146
147
148/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100149/* Helper flags for complex dependencies */
150
151/* Indicates whether we expect mbedtls_entropy_init
152 * to initialize some strong entropy source. */
153#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
154 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
155 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
156 defined(MBEDTLS_HAVEGE_C) || \
157 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
158 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100159#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100160#endif
161
162
163/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000164/* Helper Functions */
165
Simon Butcher638dceb2018-10-03 16:17:41 +0100166void test_fail( const char *test, int line_no, const char* filename )
167{
168 test_info.failed = 1;
169 test_info.test = test;
170 test_info.line_no = line_no;
171 test_info.filename = filename;
172}
173
Janos Follath8ca53b52016-10-05 10:57:49 +0100174#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
gufe44b0ab8c22020-07-30 09:02:27 +0200175static int redirect_output( FILE* out_stream, const char* path )
Janos Follath8ca53b52016-10-05 10:57:49 +0100176{
gufe44b0ab8c22020-07-30 09:02:27 +0200177 int out_fd, dup_fd;
178 FILE* path_stream;
Janos Follath8ca53b52016-10-05 10:57:49 +0100179
gufe44b0ab8c22020-07-30 09:02:27 +0200180 out_fd = fileno( out_stream );
181 dup_fd = dup( out_fd );
182
183 if( dup_fd == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100184 {
gufe44b0ab8c22020-07-30 09:02:27 +0200185 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100186 }
187
gufe44b0ab8c22020-07-30 09:02:27 +0200188 path_stream = fopen( path, "w" );
189 if( path_stream == NULL )
Janos Follath8ca53b52016-10-05 10:57:49 +0100190 {
gufe44b0ab8c22020-07-30 09:02:27 +0200191 close( dup_fd );
192 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100193 }
194
gufe44b0ab8c22020-07-30 09:02:27 +0200195 fflush( out_stream );
196 if( dup2( fileno( path_stream ), out_fd ) == -1 )
197 {
198 close( dup_fd );
199 fclose( path_stream );
200 return( -1 );
201 }
202
203 fclose( path_stream );
204 return( dup_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100205}
206
gufe44b0ab8c22020-07-30 09:02:27 +0200207static int restore_output( FILE* out_stream, int dup_fd )
Janos Follath8ca53b52016-10-05 10:57:49 +0100208{
gufe44b0ab8c22020-07-30 09:02:27 +0200209 int out_fd = fileno( out_stream );
Janos Follath8ca53b52016-10-05 10:57:49 +0100210
gufe44b0ab8c22020-07-30 09:02:27 +0200211 fflush( out_stream );
212 if( dup2( dup_fd, out_fd ) == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100213 {
gufe44b0ab8c22020-07-30 09:02:27 +0200214 close( out_fd );
215 close( dup_fd );
216 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100217 }
218
gufe44b0ab8c22020-07-30 09:02:27 +0200219 close( dup_fd );
220 return( 0 );
Simon Butchere0192962016-10-12 23:07:30 +0100221}
Janos Follath8ca53b52016-10-05 10:57:49 +0100222#endif /* __unix__ || __APPLE__ __MACH__ */
223
Simon Butcher638dceb2018-10-03 16:17:41 +0100224int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000225{
226 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000227 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000228 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000229
Rich Evans4c091142015-02-02 12:04:10 +0000230 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000231 {
232 c = *ibuf++;
233 if( c >= '0' && c <= '9' )
234 c -= '0';
235 else if( c >= 'a' && c <= 'f' )
236 c -= 'a' - 10;
237 else if( c >= 'A' && c <= 'F' )
238 c -= 'A' - 10;
239 else
240 assert( 0 );
241
242 c2 = *ibuf++;
243 if( c2 >= '0' && c2 <= '9' )
244 c2 -= '0';
245 else if( c2 >= 'a' && c2 <= 'f' )
246 c2 -= 'a' - 10;
247 else if( c2 >= 'A' && c2 <= 'F' )
248 c2 -= 'A' - 10;
249 else
250 assert( 0 );
251
252 *obuf++ = ( c << 4 ) | c2;
253 }
254
255 return len;
256}
257
Simon Butcher638dceb2018-10-03 16:17:41 +0100258void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000259{
260 unsigned char l, h;
261
Rich Evans42914452015-02-02 12:09:25 +0000262 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000263 {
Rich Evans42914452015-02-02 12:09:25 +0000264 h = *ibuf / 16;
265 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000266
267 if( h < 10 )
268 *obuf++ = '0' + h;
269 else
270 *obuf++ = 'a' + h - 10;
271
272 if( l < 10 )
273 *obuf++ = '0' + l;
274 else
275 *obuf++ = 'a' + l - 10;
276
277 ++ibuf;
278 len--;
279 }
280}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000281
282/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200283 * Allocate and zeroize a buffer.
284 *
285 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
286 *
287 * For convenience, dies if allocation fails.
288 */
289static unsigned char *zero_alloc( size_t len )
290{
291 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000292 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200293
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200294 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200295 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200296
297 memset( p, 0x00, actual_len );
298
299 return( p );
300}
301
302/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200303 * Allocate and fill a buffer from hex data.
304 *
305 * The buffer is sized exactly as needed. This allows to detect buffer
306 * overruns (including overreads) when running the test suite under valgrind.
307 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200308 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
309 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200310 * For convenience, dies if allocation fails.
311 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100312unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200313{
314 unsigned char *obuf;
315
Rich Evans42914452015-02-02 12:09:25 +0000316 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200317
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200318 if( *olen == 0 )
319 return( zero_alloc( *olen ) );
320
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200321 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200322 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200323
324 (void) unhexify( obuf, ibuf );
325
326 return( obuf );
327}
328
329/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000330 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000331 * Although predictable and often similar on multiple
332 * runs, this does not result in identical random on
333 * each run. So do not use this if the results of a
334 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000335 *
336 * rng_state shall be NULL.
337 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000338static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000339{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200340#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000341 size_t i;
342
Paul Bakker9dcc3222011-03-08 14:16:06 +0000343 if( rng_state != NULL )
344 rng_state = NULL;
345
Paul Bakkera3d195c2011-11-27 21:07:34 +0000346 for( i = 0; i < len; ++i )
347 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200348#else
349 if( rng_state != NULL )
350 rng_state = NULL;
351
352 arc4random_buf( output, len );
353#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000354
355 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000356}
357
358/**
359 * This function only returns zeros
360 *
361 * rng_state shall be NULL.
362 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100363int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000364{
365 if( rng_state != NULL )
366 rng_state = NULL;
367
Paul Bakkera3d195c2011-11-27 21:07:34 +0000368 memset( output, 0, len );
369
Paul Bakker9dcc3222011-03-08 14:16:06 +0000370 return( 0 );
371}
372
373typedef struct
374{
375 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000376 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000377} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000378
379/**
380 * This function returns random based on a buffer it receives.
381 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000382 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100383 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000384 * The number of bytes released from the buffer on each call to
385 * the random function is specified by per_call. (Can be between
386 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000387 *
388 * After the buffer is empty it will return rand();
389 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100390int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000391{
Paul Bakker997bbd12011-03-13 15:45:42 +0000392 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000393 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000394
395 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000396 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000397
Paul Bakkera3d195c2011-11-27 21:07:34 +0000398 use_len = len;
399 if( len > info->length )
400 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000401
Paul Bakkera3d195c2011-11-27 21:07:34 +0000402 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000403 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000404 memcpy( output, info->buf, use_len );
405 info->buf += use_len;
406 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000407 }
408
Paul Bakkera3d195c2011-11-27 21:07:34 +0000409 if( len - use_len > 0 )
410 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
411
412 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000413}
Paul Bakker997bbd12011-03-13 15:45:42 +0000414
415/**
416 * Info structure for the pseudo random function
417 *
418 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000419 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000420 * State( v0, v1 ) should be set to zero.
421 */
422typedef struct
423{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000424 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000425 uint32_t v0, v1;
426} rnd_pseudo_info;
427
428/**
429 * This function returns random based on a pseudo random function.
430 * This means the results should be identical on all systems.
431 * Pseudo random is based on the XTEA encryption algorithm to
432 * generate pseudorandom.
433 *
434 * rng_state shall be a pointer to a rnd_pseudo_info structure.
435 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100436int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000437{
438 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000439 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100440 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000441
442 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000443 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000444
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000445 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000446
447 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000448 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000449 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000450 sum = 0;
451
Paul Bakkera3d195c2011-11-27 21:07:34 +0000452 for( i = 0; i < 32; i++ )
453 {
Rich Evans42914452015-02-02 12:09:25 +0000454 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
455 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000456 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000457 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
458 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000459 }
460
Paul Bakker5c2364c2012-10-01 14:41:15 +0000461 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100462 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000463 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100464 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000465 }
466
Paul Bakkera3d195c2011-11-27 21:07:34 +0000467 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000468}
SimonB0269dad2016-02-17 23:34:30 +0000469