blob: cbe3fa0d4075655a479cf55eccea2c2037192c26 [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
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000153/*
154 * 32-bit integer manipulation macros (big endian)
155 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000156#ifndef GET_UINT32_BE
157#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000158{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000159 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
160 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
161 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
162 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000163}
164#endif
165
Paul Bakker5c2364c2012-10-01 14:41:15 +0000166#ifndef PUT_UINT32_BE
167#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000168{ \
169 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
170 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
171 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
172 (b)[(i) + 3] = (unsigned char) ( (n) ); \
173}
174#endif
175
SimonB0269dad2016-02-17 23:34:30 +0000176
177/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100178/* Global variables */
179
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100180
181static struct
182{
183 int failed;
184 const char *test;
185 const char *filename;
186 int line_no;
187}
188test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100189
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400190#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400191mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400192#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100193
194/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100195/* Helper flags for complex dependencies */
196
197/* Indicates whether we expect mbedtls_entropy_init
198 * to initialize some strong entropy source. */
199#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
200 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
201 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
202 defined(MBEDTLS_HAVEGE_C) || \
203 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
204 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100205#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100206#endif
207
208
209/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000210/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400211static int platform_setup()
212{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400213 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400214#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400215 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400216#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400217 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400218}
219
220static void platform_teardown()
221{
222#if defined(MBEDTLS_PLATFORM_C)
223 mbedtls_platform_teardown( &platform_ctx );
224#endif /* MBEDTLS_PLATFORM_C */
225}
SimonB0269dad2016-02-17 23:34:30 +0000226
Janos Follath8ca53b52016-10-05 10:57:49 +0100227#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
228static int redirect_output( FILE** out_stream, const char* path )
229{
230 int stdout_fd = dup( fileno( *out_stream ) );
231
232 if( stdout_fd == -1 )
233 {
234 return -1;
235 }
236
237 fflush( *out_stream );
238 fclose( *out_stream );
239 *out_stream = fopen( path, "w" );
240
241 if( *out_stream == NULL )
242 {
243 return -1;
244 }
245
246 return stdout_fd;
247}
248
249static int restore_output( FILE** out_stream, int old_fd )
250{
251 fflush( *out_stream );
252 fclose( *out_stream );
253
254 *out_stream = fdopen( old_fd, "w" );
255 if( *out_stream == NULL )
256 {
257 return -1;
258 }
259
260 return 0;
261}
Simon Butchere0192962016-10-12 23:07:30 +0100262
Janos Follathe709f7c2016-10-13 11:26:29 +0100263static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100264{
Janos Follathe709f7c2016-10-13 11:26:29 +0100265 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100266}
Janos Follath8ca53b52016-10-05 10:57:49 +0100267#endif /* __unix__ || __APPLE__ __MACH__ */
268
Rich Evans4c091142015-02-02 12:04:10 +0000269static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000270{
271 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000272 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000273 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000274
Rich Evans4c091142015-02-02 12:04:10 +0000275 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000276 {
277 c = *ibuf++;
278 if( c >= '0' && c <= '9' )
279 c -= '0';
280 else if( c >= 'a' && c <= 'f' )
281 c -= 'a' - 10;
282 else if( c >= 'A' && c <= 'F' )
283 c -= 'A' - 10;
284 else
285 assert( 0 );
286
287 c2 = *ibuf++;
288 if( c2 >= '0' && c2 <= '9' )
289 c2 -= '0';
290 else if( c2 >= 'a' && c2 <= 'f' )
291 c2 -= 'a' - 10;
292 else if( c2 >= 'A' && c2 <= 'F' )
293 c2 -= 'A' - 10;
294 else
295 assert( 0 );
296
297 *obuf++ = ( c << 4 ) | c2;
298 }
299
300 return len;
301}
302
Rich Evans42914452015-02-02 12:09:25 +0000303static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000304{
305 unsigned char l, h;
306
Rich Evans42914452015-02-02 12:09:25 +0000307 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000308 {
Rich Evans42914452015-02-02 12:09:25 +0000309 h = *ibuf / 16;
310 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000311
312 if( h < 10 )
313 *obuf++ = '0' + h;
314 else
315 *obuf++ = 'a' + h - 10;
316
317 if( l < 10 )
318 *obuf++ = '0' + l;
319 else
320 *obuf++ = 'a' + l - 10;
321
322 ++ibuf;
323 len--;
324 }
325}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000326
327/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200328 * Allocate and zeroize a buffer.
329 *
330 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
331 *
332 * For convenience, dies if allocation fails.
333 */
334static unsigned char *zero_alloc( size_t len )
335{
336 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000337 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200338
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200339 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200340 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200341
342 memset( p, 0x00, actual_len );
343
344 return( p );
345}
346
347/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200348 * Allocate and fill a buffer from hex data.
349 *
350 * The buffer is sized exactly as needed. This allows to detect buffer
351 * overruns (including overreads) when running the test suite under valgrind.
352 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200353 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
354 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200355 * For convenience, dies if allocation fails.
356 */
357static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
358{
359 unsigned char *obuf;
360
Rich Evans42914452015-02-02 12:09:25 +0000361 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200362
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200363 if( *olen == 0 )
364 return( zero_alloc( *olen ) );
365
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200366 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200367 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200368
369 (void) unhexify( obuf, ibuf );
370
371 return( obuf );
372}
373
374/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000375 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000376 * Although predictable and often similar on multiple
377 * runs, this does not result in identical random on
378 * each run. So do not use this if the results of a
379 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000380 *
381 * rng_state shall be NULL.
382 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000383static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000384{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200385#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000386 size_t i;
387
Paul Bakker9dcc3222011-03-08 14:16:06 +0000388 if( rng_state != NULL )
389 rng_state = NULL;
390
Paul Bakkera3d195c2011-11-27 21:07:34 +0000391 for( i = 0; i < len; ++i )
392 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200393#else
394 if( rng_state != NULL )
395 rng_state = NULL;
396
397 arc4random_buf( output, len );
398#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000399
400 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000401}
402
403/**
404 * This function only returns zeros
405 *
406 * rng_state shall be NULL.
407 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000408static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000409{
410 if( rng_state != NULL )
411 rng_state = NULL;
412
Paul Bakkera3d195c2011-11-27 21:07:34 +0000413 memset( output, 0, len );
414
Paul Bakker9dcc3222011-03-08 14:16:06 +0000415 return( 0 );
416}
417
418typedef struct
419{
420 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000421 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000422} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000423
424/**
425 * This function returns random based on a buffer it receives.
426 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000427 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100428 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000429 * The number of bytes released from the buffer on each call to
430 * the random function is specified by per_call. (Can be between
431 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000432 *
433 * After the buffer is empty it will return rand();
434 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000435static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000436{
Paul Bakker997bbd12011-03-13 15:45:42 +0000437 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000438 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000439
440 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000441 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000442
Paul Bakkera3d195c2011-11-27 21:07:34 +0000443 use_len = len;
444 if( len > info->length )
445 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000446
Paul Bakkera3d195c2011-11-27 21:07:34 +0000447 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000448 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000449 memcpy( output, info->buf, use_len );
450 info->buf += use_len;
451 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000452 }
453
Paul Bakkera3d195c2011-11-27 21:07:34 +0000454 if( len - use_len > 0 )
455 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
456
457 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000458}
Paul Bakker997bbd12011-03-13 15:45:42 +0000459
460/**
461 * Info structure for the pseudo random function
462 *
463 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000464 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000465 * State( v0, v1 ) should be set to zero.
466 */
467typedef struct
468{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000469 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000470 uint32_t v0, v1;
471} rnd_pseudo_info;
472
473/**
474 * This function returns random based on a pseudo random function.
475 * This means the results should be identical on all systems.
476 * Pseudo random is based on the XTEA encryption algorithm to
477 * generate pseudorandom.
478 *
479 * rng_state shall be a pointer to a rnd_pseudo_info structure.
480 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000481static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000482{
483 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000484 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100485 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000486
487 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000488 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000489
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000490 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000491
492 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000493 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000494 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000495 sum = 0;
496
Paul Bakkera3d195c2011-11-27 21:07:34 +0000497 for( i = 0; i < 32; i++ )
498 {
Rich Evans42914452015-02-02 12:09:25 +0000499 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
500 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000501 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000502 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
503 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000504 }
505
Paul Bakker5c2364c2012-10-01 14:41:15 +0000506 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100507 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000508 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100509 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000510 }
511
Paul Bakkera3d195c2011-11-27 21:07:34 +0000512 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000513}
SimonB0269dad2016-02-17 23:34:30 +0000514
Simon Butcherd96924d2016-05-06 00:22:18 +0100515static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000516{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100517 test_info.failed = 1;
518 test_info.test = test;
519 test_info.line_no = line_no;
520 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000521}
Azim Khan3499a9e2017-05-30 00:06:49 +0100522
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100523int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100524{
525 int ret = 0;
526 uint32_t i = 0;
527
528 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100529 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100530
531 for( i = 0; i < a_len; i++ )
532 {
533 if ( a[i] != b[i] )
534 {
535 ret = -1;
536 break;
537 }
538 }
539 return ret;
540}
541