blob: 38c16ad50359a456772b461e1d8717358500a6ce [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 Peskineb75125c2018-09-27 13:52:16 +020093/** Allocate memory dynamically and fail the test case if this fails.
94 *
95 * You must set \p pointer to \c NULL before calling this macro and
96 * put `mbedtls_free( pointer )` in the test's cleanup code.
97 *
Gilles Peskine7f6e3a82018-11-30 18:51:45 +010098 * If \p length is zero, the resulting \p pointer will be \c NULL.
Gilles Peskineb75125c2018-09-27 13:52:16 +020099 * This is usually what we want in tests since API functions are
100 * supposed to accept null pointers when a buffer size is zero.
101 *
102 * This macro expands to an instruction, not an expression.
103 * It may jump to the \c exit label.
104 *
105 * \param pointer An lvalue where the address of the allocated buffer
106 * will be stored.
107 * This expression may be evaluated multiple times.
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100108 * \param length Number of elements to allocate.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200109 * This expression may be evaluated multiple times.
110 *
111 */
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100112#define ASSERT_ALLOC( pointer, length ) \
113 do \
114 { \
115 TEST_ASSERT( ( pointer ) == NULL ); \
116 if( ( length ) != 0 ) \
117 { \
118 ( pointer ) = mbedtls_calloc( sizeof( *( pointer ) ), \
119 ( length ) ); \
120 TEST_ASSERT( ( pointer ) != NULL ); \
121 } \
122 } \
Gilles Peskineb75125c2018-09-27 13:52:16 +0200123 while( 0 )
124
Gilles Peskine3c225962018-09-27 13:56:31 +0200125/** Compare two buffers and fail the test case if they differ.
126 *
127 * This macro expands to an instruction, not an expression.
128 * It may jump to the \c exit label.
129 *
130 * \param p1 Pointer to the start of the first buffer.
131 * \param size1 Size of the first buffer in bytes.
132 * This expression may be evaluated multiple times.
133 * \param p2 Pointer to the start of the second buffer.
134 * \param size2 Size of the second buffer in bytes.
135 * This expression may be evaluated multiple times.
136 */
137#define ASSERT_COMPARE( p1, size1, p2, size2 ) \
138 do \
139 { \
140 TEST_ASSERT( ( size1 ) == ( size2 ) ); \
141 if( ( size1 ) != 0 ) \
142 TEST_ASSERT( memcmp( ( p1 ), ( p2 ), ( size1 ) ) == 0 ); \
143 } \
144 while( 0 )
145
Rich Evans4c091142015-02-02 12:04:10 +0000146#define assert(a) if( !( a ) ) \
147{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200148 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000149 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200150 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000151}
152
Gilles Peskine3d2f9492018-12-17 23:17:17 +0100153/** Return the number of elements of a static or stack array. */
154#define ARRAY_LENGTH( array ) \
155 ( sizeof( array ) / sizeof( *( array ) ) )
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000156/*
157 * 32-bit integer manipulation macros (big endian)
158 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000159#ifndef GET_UINT32_BE
160#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000161{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000162 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
163 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
164 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
165 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000166}
167#endif
168
Paul Bakker5c2364c2012-10-01 14:41:15 +0000169#ifndef PUT_UINT32_BE
170#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000171{ \
172 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
173 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
174 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
175 (b)[(i) + 3] = (unsigned char) ( (n) ); \
176}
177#endif
178
SimonB0269dad2016-02-17 23:34:30 +0000179
180/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100181/* Global variables */
182
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100183
184static struct
185{
186 int failed;
187 const char *test;
188 const char *filename;
189 int line_no;
190}
191test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100192
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400193#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400194mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400195#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100196
197/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100198/* Helper flags for complex dependencies */
199
200/* Indicates whether we expect mbedtls_entropy_init
201 * to initialize some strong entropy source. */
202#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
203 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
204 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
205 defined(MBEDTLS_HAVEGE_C) || \
206 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
207 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100208#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100209#endif
210
211
212/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000213/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400214static int platform_setup()
215{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400216 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400217#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400218 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400219#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400220 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400221}
222
223static void platform_teardown()
224{
225#if defined(MBEDTLS_PLATFORM_C)
226 mbedtls_platform_teardown( &platform_ctx );
227#endif /* MBEDTLS_PLATFORM_C */
228}
SimonB0269dad2016-02-17 23:34:30 +0000229
Janos Follath8ca53b52016-10-05 10:57:49 +0100230#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
231static int redirect_output( FILE** out_stream, const char* path )
232{
233 int stdout_fd = dup( fileno( *out_stream ) );
234
235 if( stdout_fd == -1 )
236 {
237 return -1;
238 }
239
240 fflush( *out_stream );
241 fclose( *out_stream );
242 *out_stream = fopen( path, "w" );
243
244 if( *out_stream == NULL )
245 {
246 return -1;
247 }
248
249 return stdout_fd;
250}
251
252static int restore_output( FILE** out_stream, int old_fd )
253{
254 fflush( *out_stream );
255 fclose( *out_stream );
256
257 *out_stream = fdopen( old_fd, "w" );
258 if( *out_stream == NULL )
259 {
260 return -1;
261 }
262
263 return 0;
264}
Simon Butchere0192962016-10-12 23:07:30 +0100265
Janos Follathe709f7c2016-10-13 11:26:29 +0100266static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100267{
Janos Follathe709f7c2016-10-13 11:26:29 +0100268 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100269}
Janos Follath8ca53b52016-10-05 10:57:49 +0100270#endif /* __unix__ || __APPLE__ __MACH__ */
271
Rich Evans4c091142015-02-02 12:04:10 +0000272static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000273{
274 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000275 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000276 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000277
Rich Evans4c091142015-02-02 12:04:10 +0000278 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000279 {
280 c = *ibuf++;
281 if( c >= '0' && c <= '9' )
282 c -= '0';
283 else if( c >= 'a' && c <= 'f' )
284 c -= 'a' - 10;
285 else if( c >= 'A' && c <= 'F' )
286 c -= 'A' - 10;
287 else
288 assert( 0 );
289
290 c2 = *ibuf++;
291 if( c2 >= '0' && c2 <= '9' )
292 c2 -= '0';
293 else if( c2 >= 'a' && c2 <= 'f' )
294 c2 -= 'a' - 10;
295 else if( c2 >= 'A' && c2 <= 'F' )
296 c2 -= 'A' - 10;
297 else
298 assert( 0 );
299
300 *obuf++ = ( c << 4 ) | c2;
301 }
302
303 return len;
304}
305
Rich Evans42914452015-02-02 12:09:25 +0000306static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000307{
308 unsigned char l, h;
309
Rich Evans42914452015-02-02 12:09:25 +0000310 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000311 {
Rich Evans42914452015-02-02 12:09:25 +0000312 h = *ibuf / 16;
313 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000314
315 if( h < 10 )
316 *obuf++ = '0' + h;
317 else
318 *obuf++ = 'a' + h - 10;
319
320 if( l < 10 )
321 *obuf++ = '0' + l;
322 else
323 *obuf++ = 'a' + l - 10;
324
325 ++ibuf;
326 len--;
327 }
328}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000329
330/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200331 * Allocate and zeroize a buffer.
332 *
333 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
334 *
335 * For convenience, dies if allocation fails.
336 */
337static unsigned char *zero_alloc( size_t len )
338{
339 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000340 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200341
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200342 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200343 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200344
345 memset( p, 0x00, actual_len );
346
347 return( p );
348}
349
350/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200351 * Allocate and fill a buffer from hex data.
352 *
353 * The buffer is sized exactly as needed. This allows to detect buffer
354 * overruns (including overreads) when running the test suite under valgrind.
355 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200356 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
357 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200358 * For convenience, dies if allocation fails.
359 */
360static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
361{
362 unsigned char *obuf;
363
Rich Evans42914452015-02-02 12:09:25 +0000364 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200365
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200366 if( *olen == 0 )
367 return( zero_alloc( *olen ) );
368
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200369 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200370 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200371
372 (void) unhexify( obuf, ibuf );
373
374 return( obuf );
375}
376
377/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000378 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000379 * Although predictable and often similar on multiple
380 * runs, this does not result in identical random on
381 * each run. So do not use this if the results of a
382 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000383 *
384 * rng_state shall be NULL.
385 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000386static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000387{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200388#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000389 size_t i;
390
Paul Bakker9dcc3222011-03-08 14:16:06 +0000391 if( rng_state != NULL )
392 rng_state = NULL;
393
Paul Bakkera3d195c2011-11-27 21:07:34 +0000394 for( i = 0; i < len; ++i )
395 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200396#else
397 if( rng_state != NULL )
398 rng_state = NULL;
399
400 arc4random_buf( output, len );
401#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000402
403 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000404}
405
406/**
407 * This function only returns zeros
408 *
409 * rng_state shall be NULL.
410 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000411static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000412{
413 if( rng_state != NULL )
414 rng_state = NULL;
415
Paul Bakkera3d195c2011-11-27 21:07:34 +0000416 memset( output, 0, len );
417
Paul Bakker9dcc3222011-03-08 14:16:06 +0000418 return( 0 );
419}
420
421typedef struct
422{
423 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000424 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000425} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000426
427/**
428 * This function returns random based on a buffer it receives.
429 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000430 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100431 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000432 * The number of bytes released from the buffer on each call to
433 * the random function is specified by per_call. (Can be between
434 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000435 *
436 * After the buffer is empty it will return rand();
437 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000438static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000439{
Paul Bakker997bbd12011-03-13 15:45:42 +0000440 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000441 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000442
443 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000444 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000445
Paul Bakkera3d195c2011-11-27 21:07:34 +0000446 use_len = len;
447 if( len > info->length )
448 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000449
Paul Bakkera3d195c2011-11-27 21:07:34 +0000450 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000451 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000452 memcpy( output, info->buf, use_len );
453 info->buf += use_len;
454 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000455 }
456
Paul Bakkera3d195c2011-11-27 21:07:34 +0000457 if( len - use_len > 0 )
458 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
459
460 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000461}
Paul Bakker997bbd12011-03-13 15:45:42 +0000462
463/**
464 * Info structure for the pseudo random function
465 *
466 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000467 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000468 * State( v0, v1 ) should be set to zero.
469 */
470typedef struct
471{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000472 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000473 uint32_t v0, v1;
474} rnd_pseudo_info;
475
476/**
477 * This function returns random based on a pseudo random function.
478 * This means the results should be identical on all systems.
479 * Pseudo random is based on the XTEA encryption algorithm to
480 * generate pseudorandom.
481 *
482 * rng_state shall be a pointer to a rnd_pseudo_info structure.
483 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000484static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000485{
486 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000487 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100488 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000489
490 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000491 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000492
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000493 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000494
495 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000496 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000497 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000498 sum = 0;
499
Paul Bakkera3d195c2011-11-27 21:07:34 +0000500 for( i = 0; i < 32; i++ )
501 {
Rich Evans42914452015-02-02 12:09:25 +0000502 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
503 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000504 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000505 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
506 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000507 }
508
Paul Bakker5c2364c2012-10-01 14:41:15 +0000509 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100510 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000511 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100512 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000513 }
514
Paul Bakkera3d195c2011-11-27 21:07:34 +0000515 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000516}
SimonB0269dad2016-02-17 23:34:30 +0000517
Simon Butcherd96924d2016-05-06 00:22:18 +0100518static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000519{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100520 test_info.failed = 1;
521 test_info.test = test;
522 test_info.line_no = line_no;
523 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000524}
Azim Khan3499a9e2017-05-30 00:06:49 +0100525
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100526int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100527{
528 int ret = 0;
529 uint32_t i = 0;
530
531 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100532 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100533
534 for( i = 0; i < a_len; i++ )
535 {
536 if ( a[i] != b[i] )
537 {
538 ret = -1;
539 break;
540 }
541 }
542 return ret;
543}
544