blob: 472df425b60b9c8e1aad659a0df13c2b7bf178c9 [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
Simon Butchera6463452018-12-06 17:41:56 +000026#if defined(MBEDTLS_CHECK_PARAMS)
27#include <setjmp.h>
Manuel Pégourié-Gonnard8e661bf2018-12-10 12:41:46 +010028#define MBEDTLS_PARAM_FAILED(x) mbedtls_param_failed( #x, __FILE__, __LINE__ )
Simon Butcher747f5fe2018-12-07 16:53:57 +000029
Simon Butcher747f5fe2018-12-07 16:53:57 +000030#endif /* MBEDTLS_CHECK_PARAMS */
31
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000032#ifdef _MSC_VER
33#include <basetsd.h>
Azim Khan0fa35042018-06-22 11:34:33 +010034typedef UINT8 uint8_t;
35typedef INT32 int32_t;
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000036typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000037#define strncasecmp _strnicmp
38#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000039#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020040#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000041#endif
42
Paul Bakker19343182013-08-16 13:31:10 +020043#include <string.h>
44
Janos Follath8ca53b52016-10-05 10:57:49 +010045#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
46#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000047#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010048#endif
SimonB0269dad2016-02-17 23:34:30 +000049
Azim Khand30ca132017-06-09 04:32:58 +010050/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +010051typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +010052{
53 uint8_t * x;
54 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +010055} data_t;
Azim Khand30ca132017-06-09 04:32:58 +010056
SimonB0269dad2016-02-17 23:34:30 +000057/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +010058/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +000059
Azim Khan62a5d7d2018-06-29 10:02:54 +010060#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
61#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
62#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +010063
Azim Khan62a5d7d2018-06-29 10:02:54 +010064#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
65#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
66#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
67#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
68 Only int, string, binary data
69 and integer expressions are
70 allowed */
71#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
72 build */
SimonB0269dad2016-02-17 23:34:30 +000073
Simon Butcher6542f6c2018-12-09 22:09:59 +000074typedef enum
75{
76 PARAMFAIL_TESTSTATE_IDLE = 0, /* No parameter failure call test */
77 PARAMFAIL_TESTSTATE_PENDING, /* Test call to the parameter failure
78 * is pending */
79 PARAMFAIL_TESTSTATE_CALLED /* The test call to the parameter
80 * failure function has been made */
81} paramfail_test_state_t;
82
SimonB0269dad2016-02-17 23:34:30 +000083
84/*----------------------------------------------------------------------------*/
85/* Macros */
86
Simon Butchera6463452018-12-06 17:41:56 +000087/**
88 * \brief This macro tests the expression passed to it as a test step or
89 * individual test in a test case.
90 *
91 * It allows a library function to return a value and return an error
92 * code that can be tested.
93 *
94 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
95 * callback, MBEDTLS_PARAM_FAIL, will be assumed to be a test failure.
96 *
97 * This macro is not suitable for negative parameter validation tests,
98 * as it assumes the test step will not create an error.
99 *
100 * \param TEST The test expression to be tested.
101 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000102
103#define TEST_ASSERT( TEST ) \
104 do { \
105 if( ! (TEST) ) \
106 { \
107 test_fail( #TEST, __LINE__, __FILE__ ); \
108 goto exit; \
109 } \
SimonB0269dad2016-02-17 23:34:30 +0000110 } while( 0 )
111
Simon Butcher6542f6c2018-12-09 22:09:59 +0000112#if defined(MBEDTLS_CHECK_PARAMS)
Simon Butchera6463452018-12-06 17:41:56 +0000113/**
114 * \brief This macro tests the statement passed to it as a test step or
115 * individual test in a test case. The macro assumes the test will fail
116 * and will generate an error.
117 *
118 * It allows a library function to return a value and tests the return
119 * code on return to confirm the given error code was returned.
120 *
121 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
122 * callback, MBEDTLS_PARAM_FAIL, are assumed to indicate the
123 * expected failure, and the test will pass.
124 *
125 * This macro is intended for negative parameter validation tests,
126 * where the failing function may return an error value or call
127 * MBEDTLS_PARAM_FAIL to indicate the error.
128 *
129 * \param PARAM_ERROR_VALUE The expected error code.
130 *
131 * \param TEST The test expression to be tested.
132 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000133#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
134 do { \
135 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
136 if( (TEST) != (PARAM_ERR_VALUE) && \
137 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
138 { \
139 test_fail( #TEST, __LINE__, __FILE__ ); \
140 goto exit; \
141 } \
142 } while( 0 )
Simon Butchera6463452018-12-06 17:41:56 +0000143
144/**
145 * \brief This macro tests the statement passed to it as a test step or
146 * individual test in a test case. The macro assumes the test will fail
147 * and will generate an error.
148 *
149 * It assumes the library function under test cannot return a value and
150 * assumes errors can only be indicated byt calls to
151 * MBEDTLS_PARAM_FAIL.
152 *
153 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
154 * callback, MBEDTLS_PARAM_FAIL, are assumed to indicate the
155 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
156 * can be made.
157 *
158 * This macro is intended for negative parameter validation tests,
159 * where the failing function can only return an error by calling
160 * MBEDTLS_PARAM_FAIL to indicate the error.
161 *
162 * \param TEST The test expression to be tested.
163 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000164#define TEST_INVALID_PARAM( TEST ) \
165 do { \
166 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
167 if ( setjmp( param_fail_jmp ) == 0 ) \
168 { \
169 TEST; \
170 test_fail( #TEST, __LINE__, __FILE__ ); \
171 goto exit; \
172 } \
173 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
Simon Butchera6463452018-12-06 17:41:56 +0000174 } while( 0 )
175
176#else
177
Simon Butchera6463452018-12-06 17:41:56 +0000178#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
179 do { \
180 if( (TEST) != (PARAM_ERR_VALUE) ) \
181 { \
182 test_fail( #TEST, __LINE__, __FILE__ ); \
183 goto exit; \
184 } \
185 } while( 0 )
186
187#define TEST_INVALID_PARAM( TEST ) \
188 do { \
189 TEST; \
190 } while( 0 )
191
192#endif /* !defined( MBEDTLS_CHECK_PARAMS ) */
193
Rich Evans4c091142015-02-02 12:04:10 +0000194#define assert(a) if( !( a ) ) \
195{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200196 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000197 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200198 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000199}
200
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000201/*
202 * 32-bit integer manipulation macros (big endian)
203 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000204#ifndef GET_UINT32_BE
205#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000206{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000207 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
208 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
209 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
210 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000211}
212#endif
213
Paul Bakker5c2364c2012-10-01 14:41:15 +0000214#ifndef PUT_UINT32_BE
215#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000216{ \
217 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
218 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
219 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
220 (b)[(i) + 3] = (unsigned char) ( (n) ); \
221}
222#endif
223
SimonB0269dad2016-02-17 23:34:30 +0000224
225/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100226/* Global variables */
227
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100228static struct
229{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000230 paramfail_test_state_t paramfail_test_state;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100231 int failed;
232 const char *test;
233 const char *filename;
234 int line_no;
235}
236test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100237
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400238#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400239mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400240#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100241
Simon Butchera6463452018-12-06 17:41:56 +0000242#if defined(MBEDTLS_CHECK_PARAMS)
243jmp_buf param_fail_jmp;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000244jmp_buf jmp_tmp;
Simon Butchera6463452018-12-06 17:41:56 +0000245#endif
246
SimonB8ca7bc42016-04-17 23:24:50 +0100247/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100248/* Helper flags for complex dependencies */
249
250/* Indicates whether we expect mbedtls_entropy_init
251 * to initialize some strong entropy source. */
252#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
253 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
254 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
255 defined(MBEDTLS_HAVEGE_C) || \
256 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
257 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100258#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100259#endif
260
261
262/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000263/* Helper Functions */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000264
265static void test_fail( const char *test, int line_no, const char* filename )
266{
267 test_info.failed = 1;
268 test_info.test = test;
269 test_info.line_no = line_no;
270 test_info.filename = filename;
271}
272
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400273static int platform_setup()
274{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400275 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400276#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400277 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400278#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400279 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400280}
281
282static void platform_teardown()
283{
284#if defined(MBEDTLS_PLATFORM_C)
285 mbedtls_platform_teardown( &platform_ctx );
286#endif /* MBEDTLS_PLATFORM_C */
287}
SimonB0269dad2016-02-17 23:34:30 +0000288
Simon Butchera6463452018-12-06 17:41:56 +0000289#if defined(MBEDTLS_CHECK_PARAMS)
Manuel Pégourié-Gonnard3ef6a6d2018-12-10 14:31:45 +0100290void mbedtls_param_failed( const char *failure_condition,
291 const char *file,
292 int line )
Simon Butchera6463452018-12-06 17:41:56 +0000293{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000294 /* If we are testing the callback function... */
295 if ( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
296 {
297 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
298 }
299 else
300 {
301 /* ...else we treat this as an error */
Simon Butchera6463452018-12-06 17:41:56 +0000302
Simon Butcher6542f6c2018-12-09 22:09:59 +0000303 /* Record the location of the failure, but not as a failure yet, in case
304 * it was part of the test */
305 test_fail( failure_condition, line, file );
306 test_info.failed = 0;
307
308 longjmp( param_fail_jmp, 1 );
309 }
Simon Butchera6463452018-12-06 17:41:56 +0000310}
311#endif
312
Janos Follath8ca53b52016-10-05 10:57:49 +0100313#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
314static int redirect_output( FILE** out_stream, const char* path )
315{
316 int stdout_fd = dup( fileno( *out_stream ) );
317
318 if( stdout_fd == -1 )
319 {
320 return -1;
321 }
322
323 fflush( *out_stream );
324 fclose( *out_stream );
325 *out_stream = fopen( path, "w" );
326
327 if( *out_stream == NULL )
328 {
329 return -1;
330 }
331
332 return stdout_fd;
333}
334
335static int restore_output( FILE** out_stream, int old_fd )
336{
337 fflush( *out_stream );
338 fclose( *out_stream );
339
340 *out_stream = fdopen( old_fd, "w" );
341 if( *out_stream == NULL )
342 {
343 return -1;
344 }
345
346 return 0;
347}
Simon Butchere0192962016-10-12 23:07:30 +0100348
Janos Follathe709f7c2016-10-13 11:26:29 +0100349static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100350{
Janos Follathe709f7c2016-10-13 11:26:29 +0100351 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100352}
Janos Follath8ca53b52016-10-05 10:57:49 +0100353#endif /* __unix__ || __APPLE__ __MACH__ */
354
Rich Evans4c091142015-02-02 12:04:10 +0000355static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000356{
357 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000358 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000359 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000360
Rich Evans4c091142015-02-02 12:04:10 +0000361 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000362 {
363 c = *ibuf++;
364 if( c >= '0' && c <= '9' )
365 c -= '0';
366 else if( c >= 'a' && c <= 'f' )
367 c -= 'a' - 10;
368 else if( c >= 'A' && c <= 'F' )
369 c -= 'A' - 10;
370 else
371 assert( 0 );
372
373 c2 = *ibuf++;
374 if( c2 >= '0' && c2 <= '9' )
375 c2 -= '0';
376 else if( c2 >= 'a' && c2 <= 'f' )
377 c2 -= 'a' - 10;
378 else if( c2 >= 'A' && c2 <= 'F' )
379 c2 -= 'A' - 10;
380 else
381 assert( 0 );
382
383 *obuf++ = ( c << 4 ) | c2;
384 }
385
386 return len;
387}
388
Rich Evans42914452015-02-02 12:09:25 +0000389static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000390{
391 unsigned char l, h;
392
Rich Evans42914452015-02-02 12:09:25 +0000393 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000394 {
Rich Evans42914452015-02-02 12:09:25 +0000395 h = *ibuf / 16;
396 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000397
398 if( h < 10 )
399 *obuf++ = '0' + h;
400 else
401 *obuf++ = 'a' + h - 10;
402
403 if( l < 10 )
404 *obuf++ = '0' + l;
405 else
406 *obuf++ = 'a' + l - 10;
407
408 ++ibuf;
409 len--;
410 }
411}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000412
413/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200414 * Allocate and zeroize a buffer.
415 *
416 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
417 *
418 * For convenience, dies if allocation fails.
419 */
420static unsigned char *zero_alloc( size_t len )
421{
422 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000423 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200424
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200425 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200426 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200427
428 memset( p, 0x00, actual_len );
429
430 return( p );
431}
432
433/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200434 * Allocate and fill a buffer from hex data.
435 *
436 * The buffer is sized exactly as needed. This allows to detect buffer
437 * overruns (including overreads) when running the test suite under valgrind.
438 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200439 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
440 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200441 * For convenience, dies if allocation fails.
442 */
443static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
444{
445 unsigned char *obuf;
446
Rich Evans42914452015-02-02 12:09:25 +0000447 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200448
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200449 if( *olen == 0 )
450 return( zero_alloc( *olen ) );
451
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200452 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200453 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200454
455 (void) unhexify( obuf, ibuf );
456
457 return( obuf );
458}
459
460/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000461 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000462 * Although predictable and often similar on multiple
463 * runs, this does not result in identical random on
464 * each run. So do not use this if the results of a
465 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000466 *
467 * rng_state shall be NULL.
468 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000469static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000470{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200471#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000472 size_t i;
473
Paul Bakker9dcc3222011-03-08 14:16:06 +0000474 if( rng_state != NULL )
475 rng_state = NULL;
476
Paul Bakkera3d195c2011-11-27 21:07:34 +0000477 for( i = 0; i < len; ++i )
478 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200479#else
480 if( rng_state != NULL )
481 rng_state = NULL;
482
483 arc4random_buf( output, len );
484#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000485
486 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000487}
488
489/**
490 * This function only returns zeros
491 *
492 * rng_state shall be NULL.
493 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000494static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000495{
496 if( rng_state != NULL )
497 rng_state = NULL;
498
Paul Bakkera3d195c2011-11-27 21:07:34 +0000499 memset( output, 0, len );
500
Paul Bakker9dcc3222011-03-08 14:16:06 +0000501 return( 0 );
502}
503
504typedef struct
505{
506 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000507 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000508} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000509
510/**
511 * This function returns random based on a buffer it receives.
512 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000513 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100514 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000515 * The number of bytes released from the buffer on each call to
516 * the random function is specified by per_call. (Can be between
517 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000518 *
519 * After the buffer is empty it will return rand();
520 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000521static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000522{
Paul Bakker997bbd12011-03-13 15:45:42 +0000523 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000524 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000525
526 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000527 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000528
Paul Bakkera3d195c2011-11-27 21:07:34 +0000529 use_len = len;
530 if( len > info->length )
531 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000532
Paul Bakkera3d195c2011-11-27 21:07:34 +0000533 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000534 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000535 memcpy( output, info->buf, use_len );
536 info->buf += use_len;
537 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000538 }
539
Paul Bakkera3d195c2011-11-27 21:07:34 +0000540 if( len - use_len > 0 )
541 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
542
543 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000544}
Paul Bakker997bbd12011-03-13 15:45:42 +0000545
546/**
547 * Info structure for the pseudo random function
548 *
549 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000550 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000551 * State( v0, v1 ) should be set to zero.
552 */
553typedef struct
554{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000555 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000556 uint32_t v0, v1;
557} rnd_pseudo_info;
558
559/**
560 * This function returns random based on a pseudo random function.
561 * This means the results should be identical on all systems.
562 * Pseudo random is based on the XTEA encryption algorithm to
563 * generate pseudorandom.
564 *
565 * rng_state shall be a pointer to a rnd_pseudo_info structure.
566 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000567static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000568{
569 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000570 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100571 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000572
573 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000574 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000575
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000576 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000577
578 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000579 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000580 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000581 sum = 0;
582
Paul Bakkera3d195c2011-11-27 21:07:34 +0000583 for( i = 0; i < 32; i++ )
584 {
Rich Evans42914452015-02-02 12:09:25 +0000585 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
586 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000587 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000588 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
589 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000590 }
591
Paul Bakker5c2364c2012-10-01 14:41:15 +0000592 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100593 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000594 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100595 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000596 }
597
Paul Bakkera3d195c2011-11-27 21:07:34 +0000598 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000599}
SimonB0269dad2016-02-17 23:34:30 +0000600
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100601int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100602{
603 int ret = 0;
604 uint32_t i = 0;
605
606 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100607 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100608
609 for( i = 0; i < a_len; i++ )
610 {
611 if ( a[i] != b[i] )
612 {
613 ret = -1;
614 break;
615 }
616 }
617 return ret;
618}
619