blob: da843b2b3a24e35055082075b57b010ef3e6a789 [file] [log] [blame]
Azim Khanec024482017-05-09 17:20:21 +01001#line 2 "suites/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>
Azim Khan0fa35042018-06-22 11:34:33 +010028typedef UINT8 uint8_t;
29typedef INT32 int32_t;
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000030typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000031#define strncasecmp _strnicmp
32#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020034#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000035#endif
36
Paul Bakker19343182013-08-16 13:31:10 +020037#include <string.h>
38
Janos Follath8ca53b52016-10-05 10:57:49 +010039#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
40#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000041#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010042#endif
SimonB0269dad2016-02-17 23:34:30 +000043
Azim Khand30ca132017-06-09 04:32:58 +010044/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +010045typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +010046{
47 uint8_t * x;
48 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +010049} data_t;
Azim Khand30ca132017-06-09 04:32:58 +010050
SimonB0269dad2016-02-17 23:34:30 +000051/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +010052/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +000053
Azim Khan62a5d7d2018-06-29 10:02:54 +010054#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
55#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
56#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +010057
Azim Khan62a5d7d2018-06-29 10:02:54 +010058#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
59#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
60#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
61#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
62 Only int, string, binary data
63 and integer expressions are
64 allowed */
65#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
66 build */
SimonB0269dad2016-02-17 23:34:30 +000067
68
69/*----------------------------------------------------------------------------*/
70/* Macros */
71
Gilles Peskine8954d0c2018-09-27 13:51:25 +020072/** Evaluate an expression and fail the test case if it is false.
73 *
74 * Failing the test means:
75 * - Mark this test case as failed.
76 * - Print a message identifying the failure.
77 * - Jump to the \c exit label.
78 *
79 * This macro expands to an instruction, not an expression.
80 * It may jump to the \c exit label.
81 *
82 * \param TEST The expression to evaluate.
83 */
SimonB0269dad2016-02-17 23:34:30 +000084#define TEST_ASSERT( TEST ) \
85 do { \
86 if( ! (TEST) ) \
87 { \
SimonB31a6c492016-05-02 21:32:44 +010088 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000089 goto exit; \
90 } \
91 } while( 0 )
92
Gilles Peskine5f7aeee2018-12-17 23:26:52 +010093/** Evaluate two expressions and fail the test case if they have different
94 * values.
95 *
96 * \param expr1 An expression to evaluate.
97 * \param expr2 The expected value of \p expr1. This can be any
98 * expression, but it is typically a constant.
99 */
100#define TEST_EQUAL( expr1, expr2 ) \
101 TEST_ASSERT( ( expr1 ) == ( expr2 ) )
102
Gilles Peskine0174be22018-12-17 23:26:01 +0100103/** Evaluate an expression and fail the test case if it returns an error.
104 *
105 * \param expr The expression to evaluate. This is typically a call
106 * to a \c psa_xxx function that returns a value of type
107 * #psa_status_t.
108 */
Gilles Peskine5f7aeee2018-12-17 23:26:52 +0100109#define PSA_ASSERT( expr ) TEST_EQUAL( ( expr ), PSA_SUCCESS )
Gilles Peskine0174be22018-12-17 23:26:01 +0100110
Gilles Peskineb75125c2018-09-27 13:52:16 +0200111/** Allocate memory dynamically and fail the test case if this fails.
112 *
113 * You must set \p pointer to \c NULL before calling this macro and
114 * put `mbedtls_free( pointer )` in the test's cleanup code.
115 *
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100116 * If \p length is zero, the resulting \p pointer will be \c NULL.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200117 * This is usually what we want in tests since API functions are
118 * supposed to accept null pointers when a buffer size is zero.
119 *
120 * This macro expands to an instruction, not an expression.
121 * It may jump to the \c exit label.
122 *
123 * \param pointer An lvalue where the address of the allocated buffer
124 * will be stored.
125 * This expression may be evaluated multiple times.
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100126 * \param length Number of elements to allocate.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200127 * This expression may be evaluated multiple times.
128 *
129 */
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100130#define ASSERT_ALLOC( pointer, length ) \
131 do \
132 { \
133 TEST_ASSERT( ( pointer ) == NULL ); \
134 if( ( length ) != 0 ) \
135 { \
136 ( pointer ) = mbedtls_calloc( sizeof( *( pointer ) ), \
137 ( length ) ); \
138 TEST_ASSERT( ( pointer ) != NULL ); \
139 } \
140 } \
Gilles Peskineb75125c2018-09-27 13:52:16 +0200141 while( 0 )
142
Gilles Peskine3c225962018-09-27 13:56:31 +0200143/** Compare two buffers and fail the test case if they differ.
144 *
145 * This macro expands to an instruction, not an expression.
146 * It may jump to the \c exit label.
147 *
148 * \param p1 Pointer to the start of the first buffer.
149 * \param size1 Size of the first buffer in bytes.
150 * This expression may be evaluated multiple times.
151 * \param p2 Pointer to the start of the second buffer.
152 * \param size2 Size of the second buffer in bytes.
153 * This expression may be evaluated multiple times.
154 */
155#define ASSERT_COMPARE( p1, size1, p2, size2 ) \
156 do \
157 { \
158 TEST_ASSERT( ( size1 ) == ( size2 ) ); \
159 if( ( size1 ) != 0 ) \
160 TEST_ASSERT( memcmp( ( p1 ), ( p2 ), ( size1 ) ) == 0 ); \
161 } \
162 while( 0 )
163
Rich Evans4c091142015-02-02 12:04:10 +0000164#define assert(a) if( !( a ) ) \
165{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200166 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000167 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200168 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000169}
170
Gilles Peskinef055ad72018-12-17 23:18:00 +0100171#if defined(__GNUC__)
172/* Test if arg and &(arg)[0] have the same type. This is true if arg is
173 * an array but not if it's a pointer. */
174#define IS_ARRAY_NOT_POINTER( arg ) \
175 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
176 __typeof__( &( arg )[0] ) ) )
177#else
178/* On platforms where we don't know how to implement this check,
179 * omit it. Oh well, a non-portable check is better than nothing. */
180#define IS_ARRAY_NOT_POINTER( arg ) 1
181#endif
182
183/* A compile-time constant with the value 0. If `const_expr` is not a
184 * compile-time constant with a nonzero value, cause a compile-time error. */
185#define STATIC_ASSERT_EXPR( const_expr ) \
186 ( 0 && sizeof( struct { int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
187/* Return the scalar value `value` (possibly promoted). This is a compile-time
188 * constant if `value` is. `condition` must be a compile-time constant.
189 * If `condition` is false, arrange to cause a compile-time error. */
190#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
191 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
192
193#define ARRAY_LENGTH_UNSAFE( array ) \
Gilles Peskine3d2f9492018-12-17 23:17:17 +0100194 ( sizeof( array ) / sizeof( *( array ) ) )
Gilles Peskinef055ad72018-12-17 23:18:00 +0100195/** Return the number of elements of a static or stack array.
196 *
197 * \param array A value of array (not pointer) type.
198 *
199 * \return The number of elements of the array.
200 */
201#define ARRAY_LENGTH( array ) \
202 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
203 ARRAY_LENGTH_UNSAFE( array ) ) )
204
205
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000206/*
207 * 32-bit integer manipulation macros (big endian)
208 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000209#ifndef GET_UINT32_BE
210#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000211{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000212 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
213 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
214 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
215 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000216}
217#endif
218
Paul Bakker5c2364c2012-10-01 14:41:15 +0000219#ifndef PUT_UINT32_BE
220#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000221{ \
222 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
223 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
224 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
225 (b)[(i) + 3] = (unsigned char) ( (n) ); \
226}
227#endif
228
SimonB0269dad2016-02-17 23:34:30 +0000229
230/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100231/* Global variables */
232
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100233
234static struct
235{
236 int failed;
237 const char *test;
238 const char *filename;
239 int line_no;
240}
241test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100242
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400243#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400244mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400245#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100246
247/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100248/* Helper flags for complex dependencies */
249
250/* Indicates whether we expect mbedtls_entropy_init
251 * to initialize some strong entropy source. */
252#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
253 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
254 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
255 defined(MBEDTLS_HAVEGE_C) || \
256 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
257 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100258#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100259#endif
260
261
262/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000263/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400264static int platform_setup()
265{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400266 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400267#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400268 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400269#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400270 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400271}
272
273static void platform_teardown()
274{
275#if defined(MBEDTLS_PLATFORM_C)
276 mbedtls_platform_teardown( &platform_ctx );
277#endif /* MBEDTLS_PLATFORM_C */
278}
SimonB0269dad2016-02-17 23:34:30 +0000279
Janos Follath8ca53b52016-10-05 10:57:49 +0100280#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
281static int redirect_output( FILE** out_stream, const char* path )
282{
283 int stdout_fd = dup( fileno( *out_stream ) );
284
285 if( stdout_fd == -1 )
286 {
287 return -1;
288 }
289
290 fflush( *out_stream );
291 fclose( *out_stream );
292 *out_stream = fopen( path, "w" );
293
294 if( *out_stream == NULL )
295 {
296 return -1;
297 }
298
299 return stdout_fd;
300}
301
302static int restore_output( FILE** out_stream, int old_fd )
303{
304 fflush( *out_stream );
305 fclose( *out_stream );
306
307 *out_stream = fdopen( old_fd, "w" );
308 if( *out_stream == NULL )
309 {
310 return -1;
311 }
312
313 return 0;
314}
Simon Butchere0192962016-10-12 23:07:30 +0100315
Janos Follathe709f7c2016-10-13 11:26:29 +0100316static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100317{
Janos Follathe709f7c2016-10-13 11:26:29 +0100318 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100319}
Janos Follath8ca53b52016-10-05 10:57:49 +0100320#endif /* __unix__ || __APPLE__ __MACH__ */
321
Rich Evans4c091142015-02-02 12:04:10 +0000322static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000323{
324 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000325 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000326 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000327
Rich Evans4c091142015-02-02 12:04:10 +0000328 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000329 {
330 c = *ibuf++;
331 if( c >= '0' && c <= '9' )
332 c -= '0';
333 else if( c >= 'a' && c <= 'f' )
334 c -= 'a' - 10;
335 else if( c >= 'A' && c <= 'F' )
336 c -= 'A' - 10;
337 else
338 assert( 0 );
339
340 c2 = *ibuf++;
341 if( c2 >= '0' && c2 <= '9' )
342 c2 -= '0';
343 else if( c2 >= 'a' && c2 <= 'f' )
344 c2 -= 'a' - 10;
345 else if( c2 >= 'A' && c2 <= 'F' )
346 c2 -= 'A' - 10;
347 else
348 assert( 0 );
349
350 *obuf++ = ( c << 4 ) | c2;
351 }
352
353 return len;
354}
355
Rich Evans42914452015-02-02 12:09:25 +0000356static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000357{
358 unsigned char l, h;
359
Rich Evans42914452015-02-02 12:09:25 +0000360 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000361 {
Rich Evans42914452015-02-02 12:09:25 +0000362 h = *ibuf / 16;
363 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000364
365 if( h < 10 )
366 *obuf++ = '0' + h;
367 else
368 *obuf++ = 'a' + h - 10;
369
370 if( l < 10 )
371 *obuf++ = '0' + l;
372 else
373 *obuf++ = 'a' + l - 10;
374
375 ++ibuf;
376 len--;
377 }
378}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000379
380/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200381 * Allocate and zeroize a buffer.
382 *
383 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
384 *
385 * For convenience, dies if allocation fails.
386 */
387static unsigned char *zero_alloc( size_t len )
388{
389 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000390 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200391
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200392 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200393 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200394
395 memset( p, 0x00, actual_len );
396
397 return( p );
398}
399
400/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200401 * Allocate and fill a buffer from hex data.
402 *
403 * The buffer is sized exactly as needed. This allows to detect buffer
404 * overruns (including overreads) when running the test suite under valgrind.
405 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200406 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
407 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200408 * For convenience, dies if allocation fails.
409 */
410static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
411{
412 unsigned char *obuf;
413
Rich Evans42914452015-02-02 12:09:25 +0000414 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200415
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200416 if( *olen == 0 )
417 return( zero_alloc( *olen ) );
418
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200419 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200420 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200421
422 (void) unhexify( obuf, ibuf );
423
424 return( obuf );
425}
426
427/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000428 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000429 * Although predictable and often similar on multiple
430 * runs, this does not result in identical random on
431 * each run. So do not use this if the results of a
432 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000433 *
434 * rng_state shall be NULL.
435 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000436static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000437{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200438#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000439 size_t i;
440
Paul Bakker9dcc3222011-03-08 14:16:06 +0000441 if( rng_state != NULL )
442 rng_state = NULL;
443
Paul Bakkera3d195c2011-11-27 21:07:34 +0000444 for( i = 0; i < len; ++i )
445 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200446#else
447 if( rng_state != NULL )
448 rng_state = NULL;
449
450 arc4random_buf( output, len );
451#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000452
453 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000454}
455
456/**
457 * This function only returns zeros
458 *
459 * rng_state shall be NULL.
460 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000461static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000462{
463 if( rng_state != NULL )
464 rng_state = NULL;
465
Paul Bakkera3d195c2011-11-27 21:07:34 +0000466 memset( output, 0, len );
467
Paul Bakker9dcc3222011-03-08 14:16:06 +0000468 return( 0 );
469}
470
471typedef struct
472{
473 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000474 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000475} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000476
477/**
478 * This function returns random based on a buffer it receives.
479 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000480 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100481 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000482 * The number of bytes released from the buffer on each call to
483 * the random function is specified by per_call. (Can be between
484 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000485 *
486 * After the buffer is empty it will return rand();
487 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000488static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000489{
Paul Bakker997bbd12011-03-13 15:45:42 +0000490 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000491 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000492
493 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000494 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000495
Paul Bakkera3d195c2011-11-27 21:07:34 +0000496 use_len = len;
497 if( len > info->length )
498 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000499
Paul Bakkera3d195c2011-11-27 21:07:34 +0000500 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000501 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000502 memcpy( output, info->buf, use_len );
503 info->buf += use_len;
504 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000505 }
506
Paul Bakkera3d195c2011-11-27 21:07:34 +0000507 if( len - use_len > 0 )
508 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
509
510 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000511}
Paul Bakker997bbd12011-03-13 15:45:42 +0000512
513/**
514 * Info structure for the pseudo random function
515 *
516 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000517 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000518 * State( v0, v1 ) should be set to zero.
519 */
520typedef struct
521{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000522 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000523 uint32_t v0, v1;
524} rnd_pseudo_info;
525
526/**
527 * This function returns random based on a pseudo random function.
528 * This means the results should be identical on all systems.
529 * Pseudo random is based on the XTEA encryption algorithm to
530 * generate pseudorandom.
531 *
532 * rng_state shall be a pointer to a rnd_pseudo_info structure.
533 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000534static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000535{
536 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000537 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100538 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000539
540 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000541 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000542
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000543 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000544
545 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000546 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000547 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000548 sum = 0;
549
Paul Bakkera3d195c2011-11-27 21:07:34 +0000550 for( i = 0; i < 32; i++ )
551 {
Rich Evans42914452015-02-02 12:09:25 +0000552 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
553 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000554 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000555 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
556 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000557 }
558
Paul Bakker5c2364c2012-10-01 14:41:15 +0000559 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100560 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000561 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100562 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000563 }
564
Paul Bakkera3d195c2011-11-27 21:07:34 +0000565 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000566}
SimonB0269dad2016-02-17 23:34:30 +0000567
Simon Butcherd96924d2016-05-06 00:22:18 +0100568static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000569{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100570 test_info.failed = 1;
571 test_info.test = test;
572 test_info.line_no = line_no;
573 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000574}
Azim Khan3499a9e2017-05-30 00:06:49 +0100575
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100576int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100577{
578 int ret = 0;
579 uint32_t i = 0;
580
581 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100582 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100583
584 for( i = 0; i < a_len; i++ )
585 {
586 if ( a[i] != b[i] )
587 {
588 ret = -1;
589 break;
590 }
591 }
592 return ret;
593}
594