blob: f416b3035ddca0321afdf76e8505f9065305ea78 [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 *
98 * If \p size is zero, the resulting \p pointer will be \c NULL.
99 * 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.
108 * \param size Buffer size to allocate in bytes.
109 * This expression may be evaluated multiple times.
110 *
111 */
112#define ASSERT_ALLOC( pointer, size ) \
113 do \
114 { \
115 TEST_ASSERT( ( pointer ) == NULL ); \
116 if( ( size ) != 0 ) \
117 { \
118 ( pointer ) = mbedtls_calloc( 1, ( size ) ); \
119 TEST_ASSERT( ( pointer ) != NULL ); \
120 } \
121 } \
122 while( 0 )
123
Gilles Peskine3c225962018-09-27 13:56:31 +0200124/** Compare two buffers and fail the test case if they differ.
125 *
126 * This macro expands to an instruction, not an expression.
127 * It may jump to the \c exit label.
128 *
129 * \param p1 Pointer to the start of the first buffer.
130 * \param size1 Size of the first buffer in bytes.
131 * This expression may be evaluated multiple times.
132 * \param p2 Pointer to the start of the second buffer.
133 * \param size2 Size of the second buffer in bytes.
134 * This expression may be evaluated multiple times.
135 */
136#define ASSERT_COMPARE( p1, size1, p2, size2 ) \
137 do \
138 { \
139 TEST_ASSERT( ( size1 ) == ( size2 ) ); \
140 if( ( size1 ) != 0 ) \
141 TEST_ASSERT( memcmp( ( p1 ), ( p2 ), ( size1 ) ) == 0 ); \
142 } \
143 while( 0 )
144
Rich Evans4c091142015-02-02 12:04:10 +0000145#define assert(a) if( !( a ) ) \
146{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200147 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000148 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200149 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000150}
151
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000152/*
153 * 32-bit integer manipulation macros (big endian)
154 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000155#ifndef GET_UINT32_BE
156#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000157{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000158 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
159 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
160 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
161 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000162}
163#endif
164
Paul Bakker5c2364c2012-10-01 14:41:15 +0000165#ifndef PUT_UINT32_BE
166#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000167{ \
168 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
169 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
170 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
171 (b)[(i) + 3] = (unsigned char) ( (n) ); \
172}
173#endif
174
SimonB0269dad2016-02-17 23:34:30 +0000175
176/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100177/* Global variables */
178
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100179
180static struct
181{
182 int failed;
183 const char *test;
184 const char *filename;
185 int line_no;
186}
187test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100188
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400189#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400190mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400191#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100192
193/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100194/* Helper flags for complex dependencies */
195
196/* Indicates whether we expect mbedtls_entropy_init
197 * to initialize some strong entropy source. */
198#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
199 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
200 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
201 defined(MBEDTLS_HAVEGE_C) || \
202 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
203 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100204#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100205#endif
206
207
208/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000209/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400210static int platform_setup()
211{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400212 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400213#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400214 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400215#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400216 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400217}
218
219static void platform_teardown()
220{
221#if defined(MBEDTLS_PLATFORM_C)
222 mbedtls_platform_teardown( &platform_ctx );
223#endif /* MBEDTLS_PLATFORM_C */
224}
SimonB0269dad2016-02-17 23:34:30 +0000225
Janos Follath8ca53b52016-10-05 10:57:49 +0100226#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
227static int redirect_output( FILE** out_stream, const char* path )
228{
229 int stdout_fd = dup( fileno( *out_stream ) );
230
231 if( stdout_fd == -1 )
232 {
233 return -1;
234 }
235
236 fflush( *out_stream );
237 fclose( *out_stream );
238 *out_stream = fopen( path, "w" );
239
240 if( *out_stream == NULL )
241 {
242 return -1;
243 }
244
245 return stdout_fd;
246}
247
248static int restore_output( FILE** out_stream, int old_fd )
249{
250 fflush( *out_stream );
251 fclose( *out_stream );
252
253 *out_stream = fdopen( old_fd, "w" );
254 if( *out_stream == NULL )
255 {
256 return -1;
257 }
258
259 return 0;
260}
Simon Butchere0192962016-10-12 23:07:30 +0100261
Janos Follathe709f7c2016-10-13 11:26:29 +0100262static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100263{
Janos Follathe709f7c2016-10-13 11:26:29 +0100264 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100265}
Janos Follath8ca53b52016-10-05 10:57:49 +0100266#endif /* __unix__ || __APPLE__ __MACH__ */
267
Rich Evans4c091142015-02-02 12:04:10 +0000268static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000269{
270 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000271 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000272 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000273
Rich Evans4c091142015-02-02 12:04:10 +0000274 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000275 {
276 c = *ibuf++;
277 if( c >= '0' && c <= '9' )
278 c -= '0';
279 else if( c >= 'a' && c <= 'f' )
280 c -= 'a' - 10;
281 else if( c >= 'A' && c <= 'F' )
282 c -= 'A' - 10;
283 else
284 assert( 0 );
285
286 c2 = *ibuf++;
287 if( c2 >= '0' && c2 <= '9' )
288 c2 -= '0';
289 else if( c2 >= 'a' && c2 <= 'f' )
290 c2 -= 'a' - 10;
291 else if( c2 >= 'A' && c2 <= 'F' )
292 c2 -= 'A' - 10;
293 else
294 assert( 0 );
295
296 *obuf++ = ( c << 4 ) | c2;
297 }
298
299 return len;
300}
301
Rich Evans42914452015-02-02 12:09:25 +0000302static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000303{
304 unsigned char l, h;
305
Rich Evans42914452015-02-02 12:09:25 +0000306 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000307 {
Rich Evans42914452015-02-02 12:09:25 +0000308 h = *ibuf / 16;
309 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000310
311 if( h < 10 )
312 *obuf++ = '0' + h;
313 else
314 *obuf++ = 'a' + h - 10;
315
316 if( l < 10 )
317 *obuf++ = '0' + l;
318 else
319 *obuf++ = 'a' + l - 10;
320
321 ++ibuf;
322 len--;
323 }
324}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000325
326/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200327 * Allocate and zeroize a buffer.
328 *
329 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
330 *
331 * For convenience, dies if allocation fails.
332 */
333static unsigned char *zero_alloc( size_t len )
334{
335 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000336 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200337
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200338 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200339 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200340
341 memset( p, 0x00, actual_len );
342
343 return( p );
344}
345
346/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200347 * Allocate and fill a buffer from hex data.
348 *
349 * The buffer is sized exactly as needed. This allows to detect buffer
350 * overruns (including overreads) when running the test suite under valgrind.
351 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200352 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
353 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200354 * For convenience, dies if allocation fails.
355 */
356static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
357{
358 unsigned char *obuf;
359
Rich Evans42914452015-02-02 12:09:25 +0000360 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200361
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200362 if( *olen == 0 )
363 return( zero_alloc( *olen ) );
364
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200365 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200366 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200367
368 (void) unhexify( obuf, ibuf );
369
370 return( obuf );
371}
372
373/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000374 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000375 * Although predictable and often similar on multiple
376 * runs, this does not result in identical random on
377 * each run. So do not use this if the results of a
378 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000379 *
380 * rng_state shall be NULL.
381 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000382static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000383{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200384#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000385 size_t i;
386
Paul Bakker9dcc3222011-03-08 14:16:06 +0000387 if( rng_state != NULL )
388 rng_state = NULL;
389
Paul Bakkera3d195c2011-11-27 21:07:34 +0000390 for( i = 0; i < len; ++i )
391 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200392#else
393 if( rng_state != NULL )
394 rng_state = NULL;
395
396 arc4random_buf( output, len );
397#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000398
399 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000400}
401
402/**
403 * This function only returns zeros
404 *
405 * rng_state shall be NULL.
406 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000407static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000408{
409 if( rng_state != NULL )
410 rng_state = NULL;
411
Paul Bakkera3d195c2011-11-27 21:07:34 +0000412 memset( output, 0, len );
413
Paul Bakker9dcc3222011-03-08 14:16:06 +0000414 return( 0 );
415}
416
417typedef struct
418{
419 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000420 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000421} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000422
423/**
424 * This function returns random based on a buffer it receives.
425 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000426 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100427 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000428 * The number of bytes released from the buffer on each call to
429 * the random function is specified by per_call. (Can be between
430 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000431 *
432 * After the buffer is empty it will return rand();
433 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000434static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000435{
Paul Bakker997bbd12011-03-13 15:45:42 +0000436 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000437 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000438
439 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000440 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000441
Paul Bakkera3d195c2011-11-27 21:07:34 +0000442 use_len = len;
443 if( len > info->length )
444 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000445
Paul Bakkera3d195c2011-11-27 21:07:34 +0000446 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000447 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000448 memcpy( output, info->buf, use_len );
449 info->buf += use_len;
450 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000451 }
452
Paul Bakkera3d195c2011-11-27 21:07:34 +0000453 if( len - use_len > 0 )
454 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
455
456 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000457}
Paul Bakker997bbd12011-03-13 15:45:42 +0000458
459/**
460 * Info structure for the pseudo random function
461 *
462 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000463 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000464 * State( v0, v1 ) should be set to zero.
465 */
466typedef struct
467{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000468 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000469 uint32_t v0, v1;
470} rnd_pseudo_info;
471
472/**
473 * This function returns random based on a pseudo random function.
474 * This means the results should be identical on all systems.
475 * Pseudo random is based on the XTEA encryption algorithm to
476 * generate pseudorandom.
477 *
478 * rng_state shall be a pointer to a rnd_pseudo_info structure.
479 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000480static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000481{
482 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000483 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100484 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000485
486 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000487 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000488
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000489 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000490
491 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000492 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000493 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000494 sum = 0;
495
Paul Bakkera3d195c2011-11-27 21:07:34 +0000496 for( i = 0; i < 32; i++ )
497 {
Rich Evans42914452015-02-02 12:09:25 +0000498 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
499 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000500 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000501 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
502 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000503 }
504
Paul Bakker5c2364c2012-10-01 14:41:15 +0000505 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100506 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000507 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100508 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000509 }
510
Paul Bakkera3d195c2011-11-27 21:07:34 +0000511 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000512}
SimonB0269dad2016-02-17 23:34:30 +0000513
Simon Butcherd96924d2016-05-06 00:22:18 +0100514static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000515{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100516 test_info.failed = 1;
517 test_info.test = test;
518 test_info.line_no = line_no;
519 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000520}
Azim Khan3499a9e2017-05-30 00:06:49 +0100521
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100522int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100523{
524 int ret = 0;
525 uint32_t i = 0;
526
527 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100528 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100529
530 for( i = 0; i < a_len; i++ )
531 {
532 if ( a[i] != b[i] )
533 {
534 ret = -1;
535 break;
536 }
537 }
538 return ret;
539}
540