blob: 316c06e31ec7e4f6f448466aa514d4d0afb9037d [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 Peskine0174be22018-12-17 23:26:01 +010093/** Evaluate an expression and fail the test case if it returns an error.
94 *
95 * \param expr The expression to evaluate. This is typically a call
96 * to a \c psa_xxx function that returns a value of type
97 * #psa_status_t.
98 */
99#define PSA_ASSERT( expr ) TEST_ASSERT( ( expr ) == PSA_SUCCESS )
100
Gilles Peskineb75125c2018-09-27 13:52:16 +0200101/** Allocate memory dynamically and fail the test case if this fails.
102 *
103 * You must set \p pointer to \c NULL before calling this macro and
104 * put `mbedtls_free( pointer )` in the test's cleanup code.
105 *
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100106 * If \p length is zero, the resulting \p pointer will be \c NULL.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200107 * This is usually what we want in tests since API functions are
108 * supposed to accept null pointers when a buffer size is zero.
109 *
110 * This macro expands to an instruction, not an expression.
111 * It may jump to the \c exit label.
112 *
113 * \param pointer An lvalue where the address of the allocated buffer
114 * will be stored.
115 * This expression may be evaluated multiple times.
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100116 * \param length Number of elements to allocate.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200117 * This expression may be evaluated multiple times.
118 *
119 */
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100120#define ASSERT_ALLOC( pointer, length ) \
121 do \
122 { \
123 TEST_ASSERT( ( pointer ) == NULL ); \
124 if( ( length ) != 0 ) \
125 { \
126 ( pointer ) = mbedtls_calloc( sizeof( *( pointer ) ), \
127 ( length ) ); \
128 TEST_ASSERT( ( pointer ) != NULL ); \
129 } \
130 } \
Gilles Peskineb75125c2018-09-27 13:52:16 +0200131 while( 0 )
132
Gilles Peskine3c225962018-09-27 13:56:31 +0200133/** Compare two buffers and fail the test case if they differ.
134 *
135 * This macro expands to an instruction, not an expression.
136 * It may jump to the \c exit label.
137 *
138 * \param p1 Pointer to the start of the first buffer.
139 * \param size1 Size of the first buffer in bytes.
140 * This expression may be evaluated multiple times.
141 * \param p2 Pointer to the start of the second buffer.
142 * \param size2 Size of the second buffer in bytes.
143 * This expression may be evaluated multiple times.
144 */
145#define ASSERT_COMPARE( p1, size1, p2, size2 ) \
146 do \
147 { \
148 TEST_ASSERT( ( size1 ) == ( size2 ) ); \
149 if( ( size1 ) != 0 ) \
150 TEST_ASSERT( memcmp( ( p1 ), ( p2 ), ( size1 ) ) == 0 ); \
151 } \
152 while( 0 )
153
Rich Evans4c091142015-02-02 12:04:10 +0000154#define assert(a) if( !( a ) ) \
155{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200156 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000157 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200158 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000159}
160
Gilles Peskinef055ad72018-12-17 23:18:00 +0100161#if defined(__GNUC__)
162/* Test if arg and &(arg)[0] have the same type. This is true if arg is
163 * an array but not if it's a pointer. */
164#define IS_ARRAY_NOT_POINTER( arg ) \
165 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
166 __typeof__( &( arg )[0] ) ) )
167#else
168/* On platforms where we don't know how to implement this check,
169 * omit it. Oh well, a non-portable check is better than nothing. */
170#define IS_ARRAY_NOT_POINTER( arg ) 1
171#endif
172
173/* A compile-time constant with the value 0. If `const_expr` is not a
174 * compile-time constant with a nonzero value, cause a compile-time error. */
175#define STATIC_ASSERT_EXPR( const_expr ) \
176 ( 0 && sizeof( struct { int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
177/* Return the scalar value `value` (possibly promoted). This is a compile-time
178 * constant if `value` is. `condition` must be a compile-time constant.
179 * If `condition` is false, arrange to cause a compile-time error. */
180#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
181 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
182
183#define ARRAY_LENGTH_UNSAFE( array ) \
Gilles Peskine3d2f9492018-12-17 23:17:17 +0100184 ( sizeof( array ) / sizeof( *( array ) ) )
Gilles Peskinef055ad72018-12-17 23:18:00 +0100185/** Return the number of elements of a static or stack array.
186 *
187 * \param array A value of array (not pointer) type.
188 *
189 * \return The number of elements of the array.
190 */
191#define ARRAY_LENGTH( array ) \
192 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
193 ARRAY_LENGTH_UNSAFE( array ) ) )
194
195
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000196/*
197 * 32-bit integer manipulation macros (big endian)
198 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000199#ifndef GET_UINT32_BE
200#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000201{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000202 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
203 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
204 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
205 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000206}
207#endif
208
Paul Bakker5c2364c2012-10-01 14:41:15 +0000209#ifndef PUT_UINT32_BE
210#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000211{ \
212 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
213 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
214 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
215 (b)[(i) + 3] = (unsigned char) ( (n) ); \
216}
217#endif
218
SimonB0269dad2016-02-17 23:34:30 +0000219
220/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100221/* Global variables */
222
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100223
224static struct
225{
226 int failed;
227 const char *test;
228 const char *filename;
229 int line_no;
230}
231test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100232
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400233#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400234mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400235#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100236
237/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100238/* Helper flags for complex dependencies */
239
240/* Indicates whether we expect mbedtls_entropy_init
241 * to initialize some strong entropy source. */
242#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
243 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
244 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
245 defined(MBEDTLS_HAVEGE_C) || \
246 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
247 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100248#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100249#endif
250
251
252/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000253/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400254static int platform_setup()
255{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400256 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400257#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400258 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400259#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400260 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400261}
262
263static void platform_teardown()
264{
265#if defined(MBEDTLS_PLATFORM_C)
266 mbedtls_platform_teardown( &platform_ctx );
267#endif /* MBEDTLS_PLATFORM_C */
268}
SimonB0269dad2016-02-17 23:34:30 +0000269
Janos Follath8ca53b52016-10-05 10:57:49 +0100270#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
271static int redirect_output( FILE** out_stream, const char* path )
272{
273 int stdout_fd = dup( fileno( *out_stream ) );
274
275 if( stdout_fd == -1 )
276 {
277 return -1;
278 }
279
280 fflush( *out_stream );
281 fclose( *out_stream );
282 *out_stream = fopen( path, "w" );
283
284 if( *out_stream == NULL )
285 {
286 return -1;
287 }
288
289 return stdout_fd;
290}
291
292static int restore_output( FILE** out_stream, int old_fd )
293{
294 fflush( *out_stream );
295 fclose( *out_stream );
296
297 *out_stream = fdopen( old_fd, "w" );
298 if( *out_stream == NULL )
299 {
300 return -1;
301 }
302
303 return 0;
304}
Simon Butchere0192962016-10-12 23:07:30 +0100305
Janos Follathe709f7c2016-10-13 11:26:29 +0100306static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100307{
Janos Follathe709f7c2016-10-13 11:26:29 +0100308 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100309}
Janos Follath8ca53b52016-10-05 10:57:49 +0100310#endif /* __unix__ || __APPLE__ __MACH__ */
311
Rich Evans4c091142015-02-02 12:04:10 +0000312static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000313{
314 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000315 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000316 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000317
Rich Evans4c091142015-02-02 12:04:10 +0000318 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000319 {
320 c = *ibuf++;
321 if( c >= '0' && c <= '9' )
322 c -= '0';
323 else if( c >= 'a' && c <= 'f' )
324 c -= 'a' - 10;
325 else if( c >= 'A' && c <= 'F' )
326 c -= 'A' - 10;
327 else
328 assert( 0 );
329
330 c2 = *ibuf++;
331 if( c2 >= '0' && c2 <= '9' )
332 c2 -= '0';
333 else if( c2 >= 'a' && c2 <= 'f' )
334 c2 -= 'a' - 10;
335 else if( c2 >= 'A' && c2 <= 'F' )
336 c2 -= 'A' - 10;
337 else
338 assert( 0 );
339
340 *obuf++ = ( c << 4 ) | c2;
341 }
342
343 return len;
344}
345
Rich Evans42914452015-02-02 12:09:25 +0000346static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000347{
348 unsigned char l, h;
349
Rich Evans42914452015-02-02 12:09:25 +0000350 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000351 {
Rich Evans42914452015-02-02 12:09:25 +0000352 h = *ibuf / 16;
353 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000354
355 if( h < 10 )
356 *obuf++ = '0' + h;
357 else
358 *obuf++ = 'a' + h - 10;
359
360 if( l < 10 )
361 *obuf++ = '0' + l;
362 else
363 *obuf++ = 'a' + l - 10;
364
365 ++ibuf;
366 len--;
367 }
368}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000369
370/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200371 * Allocate and zeroize a buffer.
372 *
373 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
374 *
375 * For convenience, dies if allocation fails.
376 */
377static unsigned char *zero_alloc( size_t len )
378{
379 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000380 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200381
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200382 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200383 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200384
385 memset( p, 0x00, actual_len );
386
387 return( p );
388}
389
390/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200391 * Allocate and fill a buffer from hex data.
392 *
393 * The buffer is sized exactly as needed. This allows to detect buffer
394 * overruns (including overreads) when running the test suite under valgrind.
395 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200396 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
397 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200398 * For convenience, dies if allocation fails.
399 */
400static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
401{
402 unsigned char *obuf;
403
Rich Evans42914452015-02-02 12:09:25 +0000404 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200405
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200406 if( *olen == 0 )
407 return( zero_alloc( *olen ) );
408
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200409 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200410 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200411
412 (void) unhexify( obuf, ibuf );
413
414 return( obuf );
415}
416
417/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000418 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000419 * Although predictable and often similar on multiple
420 * runs, this does not result in identical random on
421 * each run. So do not use this if the results of a
422 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000423 *
424 * rng_state shall be NULL.
425 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000426static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000427{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200428#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000429 size_t i;
430
Paul Bakker9dcc3222011-03-08 14:16:06 +0000431 if( rng_state != NULL )
432 rng_state = NULL;
433
Paul Bakkera3d195c2011-11-27 21:07:34 +0000434 for( i = 0; i < len; ++i )
435 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200436#else
437 if( rng_state != NULL )
438 rng_state = NULL;
439
440 arc4random_buf( output, len );
441#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000442
443 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000444}
445
446/**
447 * This function only returns zeros
448 *
449 * rng_state shall be NULL.
450 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000451static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000452{
453 if( rng_state != NULL )
454 rng_state = NULL;
455
Paul Bakkera3d195c2011-11-27 21:07:34 +0000456 memset( output, 0, len );
457
Paul Bakker9dcc3222011-03-08 14:16:06 +0000458 return( 0 );
459}
460
461typedef struct
462{
463 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000464 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000465} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000466
467/**
468 * This function returns random based on a buffer it receives.
469 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000470 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100471 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000472 * The number of bytes released from the buffer on each call to
473 * the random function is specified by per_call. (Can be between
474 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000475 *
476 * After the buffer is empty it will return rand();
477 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000478static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000479{
Paul Bakker997bbd12011-03-13 15:45:42 +0000480 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000481 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000482
483 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000484 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000485
Paul Bakkera3d195c2011-11-27 21:07:34 +0000486 use_len = len;
487 if( len > info->length )
488 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000489
Paul Bakkera3d195c2011-11-27 21:07:34 +0000490 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000491 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000492 memcpy( output, info->buf, use_len );
493 info->buf += use_len;
494 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000495 }
496
Paul Bakkera3d195c2011-11-27 21:07:34 +0000497 if( len - use_len > 0 )
498 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
499
500 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000501}
Paul Bakker997bbd12011-03-13 15:45:42 +0000502
503/**
504 * Info structure for the pseudo random function
505 *
506 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000507 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000508 * State( v0, v1 ) should be set to zero.
509 */
510typedef struct
511{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000512 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000513 uint32_t v0, v1;
514} rnd_pseudo_info;
515
516/**
517 * This function returns random based on a pseudo random function.
518 * This means the results should be identical on all systems.
519 * Pseudo random is based on the XTEA encryption algorithm to
520 * generate pseudorandom.
521 *
522 * rng_state shall be a pointer to a rnd_pseudo_info structure.
523 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000524static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000525{
526 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000527 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100528 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000529
530 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000531 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000532
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000533 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000534
535 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000536 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000537 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000538 sum = 0;
539
Paul Bakkera3d195c2011-11-27 21:07:34 +0000540 for( i = 0; i < 32; i++ )
541 {
Rich Evans42914452015-02-02 12:09:25 +0000542 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
543 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000544 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000545 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
546 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000547 }
548
Paul Bakker5c2364c2012-10-01 14:41:15 +0000549 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100550 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000551 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100552 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000553 }
554
Paul Bakkera3d195c2011-11-27 21:07:34 +0000555 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000556}
SimonB0269dad2016-02-17 23:34:30 +0000557
Simon Butcherd96924d2016-05-06 00:22:18 +0100558static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000559{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100560 test_info.failed = 1;
561 test_info.test = test;
562 test_info.line_no = line_no;
563 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000564}
Azim Khan3499a9e2017-05-30 00:06:49 +0100565
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100566int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100567{
568 int ret = 0;
569 uint32_t i = 0;
570
571 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100572 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100573
574 for( i = 0; i < a_len; i++ )
575 {
576 if ( a[i] != b[i] )
577 {
578 ret = -1;
579 break;
580 }
581 }
582 return ret;
583}
584