blob: 4a9d2a3bbb70d2cb2cbf94080ef29ffe3b5e9f38 [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 Peskinef055ad72018-12-17 23:18:00 +0100153#if defined(__GNUC__)
154/* Test if arg and &(arg)[0] have the same type. This is true if arg is
155 * an array but not if it's a pointer. */
156#define IS_ARRAY_NOT_POINTER( arg ) \
157 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
158 __typeof__( &( arg )[0] ) ) )
159#else
160/* On platforms where we don't know how to implement this check,
161 * omit it. Oh well, a non-portable check is better than nothing. */
162#define IS_ARRAY_NOT_POINTER( arg ) 1
163#endif
164
165/* A compile-time constant with the value 0. If `const_expr` is not a
166 * compile-time constant with a nonzero value, cause a compile-time error. */
167#define STATIC_ASSERT_EXPR( const_expr ) \
168 ( 0 && sizeof( struct { int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
169/* Return the scalar value `value` (possibly promoted). This is a compile-time
170 * constant if `value` is. `condition` must be a compile-time constant.
171 * If `condition` is false, arrange to cause a compile-time error. */
172#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
173 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
174
175#define ARRAY_LENGTH_UNSAFE( array ) \
Gilles Peskine3d2f9492018-12-17 23:17:17 +0100176 ( sizeof( array ) / sizeof( *( array ) ) )
Gilles Peskinef055ad72018-12-17 23:18:00 +0100177/** Return the number of elements of a static or stack array.
178 *
179 * \param array A value of array (not pointer) type.
180 *
181 * \return The number of elements of the array.
182 */
183#define ARRAY_LENGTH( array ) \
184 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
185 ARRAY_LENGTH_UNSAFE( array ) ) )
186
187
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000188/*
189 * 32-bit integer manipulation macros (big endian)
190 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000191#ifndef GET_UINT32_BE
192#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000193{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000194 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
195 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
196 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
197 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000198}
199#endif
200
Paul Bakker5c2364c2012-10-01 14:41:15 +0000201#ifndef PUT_UINT32_BE
202#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000203{ \
204 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
205 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
206 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
207 (b)[(i) + 3] = (unsigned char) ( (n) ); \
208}
209#endif
210
SimonB0269dad2016-02-17 23:34:30 +0000211
212/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100213/* Global variables */
214
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100215
216static struct
217{
218 int failed;
219 const char *test;
220 const char *filename;
221 int line_no;
222}
223test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100224
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400225#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400226mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400227#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100228
229/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100230/* Helper flags for complex dependencies */
231
232/* Indicates whether we expect mbedtls_entropy_init
233 * to initialize some strong entropy source. */
234#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
235 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
236 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
237 defined(MBEDTLS_HAVEGE_C) || \
238 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
239 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100240#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100241#endif
242
243
244/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000245/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400246static int platform_setup()
247{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400248 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400249#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400250 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400251#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400252 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400253}
254
255static void platform_teardown()
256{
257#if defined(MBEDTLS_PLATFORM_C)
258 mbedtls_platform_teardown( &platform_ctx );
259#endif /* MBEDTLS_PLATFORM_C */
260}
SimonB0269dad2016-02-17 23:34:30 +0000261
Janos Follath8ca53b52016-10-05 10:57:49 +0100262#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
263static int redirect_output( FILE** out_stream, const char* path )
264{
265 int stdout_fd = dup( fileno( *out_stream ) );
266
267 if( stdout_fd == -1 )
268 {
269 return -1;
270 }
271
272 fflush( *out_stream );
273 fclose( *out_stream );
274 *out_stream = fopen( path, "w" );
275
276 if( *out_stream == NULL )
277 {
278 return -1;
279 }
280
281 return stdout_fd;
282}
283
284static int restore_output( FILE** out_stream, int old_fd )
285{
286 fflush( *out_stream );
287 fclose( *out_stream );
288
289 *out_stream = fdopen( old_fd, "w" );
290 if( *out_stream == NULL )
291 {
292 return -1;
293 }
294
295 return 0;
296}
Simon Butchere0192962016-10-12 23:07:30 +0100297
Janos Follathe709f7c2016-10-13 11:26:29 +0100298static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100299{
Janos Follathe709f7c2016-10-13 11:26:29 +0100300 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100301}
Janos Follath8ca53b52016-10-05 10:57:49 +0100302#endif /* __unix__ || __APPLE__ __MACH__ */
303
Rich Evans4c091142015-02-02 12:04:10 +0000304static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000305{
306 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000307 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000308 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000309
Rich Evans4c091142015-02-02 12:04:10 +0000310 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000311 {
312 c = *ibuf++;
313 if( c >= '0' && c <= '9' )
314 c -= '0';
315 else if( c >= 'a' && c <= 'f' )
316 c -= 'a' - 10;
317 else if( c >= 'A' && c <= 'F' )
318 c -= 'A' - 10;
319 else
320 assert( 0 );
321
322 c2 = *ibuf++;
323 if( c2 >= '0' && c2 <= '9' )
324 c2 -= '0';
325 else if( c2 >= 'a' && c2 <= 'f' )
326 c2 -= 'a' - 10;
327 else if( c2 >= 'A' && c2 <= 'F' )
328 c2 -= 'A' - 10;
329 else
330 assert( 0 );
331
332 *obuf++ = ( c << 4 ) | c2;
333 }
334
335 return len;
336}
337
Rich Evans42914452015-02-02 12:09:25 +0000338static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000339{
340 unsigned char l, h;
341
Rich Evans42914452015-02-02 12:09:25 +0000342 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000343 {
Rich Evans42914452015-02-02 12:09:25 +0000344 h = *ibuf / 16;
345 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000346
347 if( h < 10 )
348 *obuf++ = '0' + h;
349 else
350 *obuf++ = 'a' + h - 10;
351
352 if( l < 10 )
353 *obuf++ = '0' + l;
354 else
355 *obuf++ = 'a' + l - 10;
356
357 ++ibuf;
358 len--;
359 }
360}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000361
362/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200363 * Allocate and zeroize a buffer.
364 *
365 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
366 *
367 * For convenience, dies if allocation fails.
368 */
369static unsigned char *zero_alloc( size_t len )
370{
371 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000372 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200373
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200374 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200375 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200376
377 memset( p, 0x00, actual_len );
378
379 return( p );
380}
381
382/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200383 * Allocate and fill a buffer from hex data.
384 *
385 * The buffer is sized exactly as needed. This allows to detect buffer
386 * overruns (including overreads) when running the test suite under valgrind.
387 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200388 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
389 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200390 * For convenience, dies if allocation fails.
391 */
392static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
393{
394 unsigned char *obuf;
395
Rich Evans42914452015-02-02 12:09:25 +0000396 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200397
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200398 if( *olen == 0 )
399 return( zero_alloc( *olen ) );
400
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200401 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200402 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200403
404 (void) unhexify( obuf, ibuf );
405
406 return( obuf );
407}
408
409/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000410 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000411 * Although predictable and often similar on multiple
412 * runs, this does not result in identical random on
413 * each run. So do not use this if the results of a
414 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000415 *
416 * rng_state shall be NULL.
417 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000418static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000419{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200420#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000421 size_t i;
422
Paul Bakker9dcc3222011-03-08 14:16:06 +0000423 if( rng_state != NULL )
424 rng_state = NULL;
425
Paul Bakkera3d195c2011-11-27 21:07:34 +0000426 for( i = 0; i < len; ++i )
427 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200428#else
429 if( rng_state != NULL )
430 rng_state = NULL;
431
432 arc4random_buf( output, len );
433#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000434
435 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000436}
437
438/**
439 * This function only returns zeros
440 *
441 * rng_state shall be NULL.
442 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000443static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000444{
445 if( rng_state != NULL )
446 rng_state = NULL;
447
Paul Bakkera3d195c2011-11-27 21:07:34 +0000448 memset( output, 0, len );
449
Paul Bakker9dcc3222011-03-08 14:16:06 +0000450 return( 0 );
451}
452
453typedef struct
454{
455 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000456 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000457} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000458
459/**
460 * This function returns random based on a buffer it receives.
461 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000462 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100463 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000464 * The number of bytes released from the buffer on each call to
465 * the random function is specified by per_call. (Can be between
466 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000467 *
468 * After the buffer is empty it will return rand();
469 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000470static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000471{
Paul Bakker997bbd12011-03-13 15:45:42 +0000472 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000473 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000474
475 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000476 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000477
Paul Bakkera3d195c2011-11-27 21:07:34 +0000478 use_len = len;
479 if( len > info->length )
480 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000481
Paul Bakkera3d195c2011-11-27 21:07:34 +0000482 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000483 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000484 memcpy( output, info->buf, use_len );
485 info->buf += use_len;
486 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000487 }
488
Paul Bakkera3d195c2011-11-27 21:07:34 +0000489 if( len - use_len > 0 )
490 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
491
492 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000493}
Paul Bakker997bbd12011-03-13 15:45:42 +0000494
495/**
496 * Info structure for the pseudo random function
497 *
498 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000499 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000500 * State( v0, v1 ) should be set to zero.
501 */
502typedef struct
503{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000504 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000505 uint32_t v0, v1;
506} rnd_pseudo_info;
507
508/**
509 * This function returns random based on a pseudo random function.
510 * This means the results should be identical on all systems.
511 * Pseudo random is based on the XTEA encryption algorithm to
512 * generate pseudorandom.
513 *
514 * rng_state shall be a pointer to a rnd_pseudo_info structure.
515 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000516static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000517{
518 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000519 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100520 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000521
522 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000523 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000524
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000525 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000526
527 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000528 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000529 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000530 sum = 0;
531
Paul Bakkera3d195c2011-11-27 21:07:34 +0000532 for( i = 0; i < 32; i++ )
533 {
Rich Evans42914452015-02-02 12:09:25 +0000534 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
535 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000536 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000537 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
538 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000539 }
540
Paul Bakker5c2364c2012-10-01 14:41:15 +0000541 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100542 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000543 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100544 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000545 }
546
Paul Bakkera3d195c2011-11-27 21:07:34 +0000547 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000548}
SimonB0269dad2016-02-17 23:34:30 +0000549
Simon Butcherd96924d2016-05-06 00:22:18 +0100550static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000551{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100552 test_info.failed = 1;
553 test_info.test = test;
554 test_info.line_no = line_no;
555 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000556}
Azim Khan3499a9e2017-05-30 00:06:49 +0100557
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100558int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100559{
560 int ret = 0;
561 uint32_t i = 0;
562
563 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100564 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100565
566 for( i = 0; i < a_len; i++ )
567 {
568 if ( a[i] != b[i] )
569 {
570 ret = -1;
571 break;
572 }
573 }
574 return ret;
575}
576