blob: 1255ff4be4879c9068fb9a49b4882075c5f9cb69 [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
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050026#if defined(MBEDTLS_CHECK_PARAMS)
27#include "mbedtls/platform_util.h"
28#include <setjmp.h>
29#endif
30
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000031#ifdef _MSC_VER
32#include <basetsd.h>
Azim Khan0fa35042018-06-22 11:34:33 +010033typedef UINT8 uint8_t;
34typedef INT32 int32_t;
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000035typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000036#define strncasecmp _strnicmp
37#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000038#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020039#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000040#endif
41
Paul Bakker19343182013-08-16 13:31:10 +020042#include <string.h>
43
Janos Follath8ca53b52016-10-05 10:57:49 +010044#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
45#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000046#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010047#endif
SimonB0269dad2016-02-17 23:34:30 +000048
Azim Khand30ca132017-06-09 04:32:58 +010049/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +010050typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +010051{
52 uint8_t * x;
53 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +010054} data_t;
Azim Khand30ca132017-06-09 04:32:58 +010055
SimonB0269dad2016-02-17 23:34:30 +000056/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +010057/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +000058
Azim Khan62a5d7d2018-06-29 10:02:54 +010059#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
60#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
61#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +010062
Azim Khan62a5d7d2018-06-29 10:02:54 +010063#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
64#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
65#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
66#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
67 Only int, string, binary data
68 and integer expressions are
69 allowed */
70#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
71 build */
SimonB0269dad2016-02-17 23:34:30 +000072
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050073typedef enum
74{
75 PARAMFAIL_TESTSTATE_IDLE = 0, /* No parameter failure call test */
76 PARAMFAIL_TESTSTATE_PENDING, /* Test call to the parameter failure
77 * is pending */
78 PARAMFAIL_TESTSTATE_CALLED /* The test call to the parameter
79 * failure function has been made */
80} paramfail_test_state_t;
81
SimonB0269dad2016-02-17 23:34:30 +000082
83/*----------------------------------------------------------------------------*/
84/* Macros */
85
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050086/**
87 * \brief This macro tests the expression passed to it as a test step or
88 * individual test in a test case.
89 *
90 * It allows a library function to return a value and return an error
91 * code that can be tested.
92 *
93 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
94 * callback, MBEDTLS_PARAM_FAILED(), will be assumed to be a test
95 * 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 */
102#define TEST_ASSERT( TEST ) \
103 do { \
104 if( ! (TEST) ) \
105 { \
106 test_fail( #TEST, __LINE__, __FILE__ ); \
107 goto exit; \
108 } \
SimonB0269dad2016-02-17 23:34:30 +0000109 } while( 0 )
110
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500111#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
112/**
113 * \brief This macro tests the statement passed to it as a test step or
114 * individual test in a test case. The macro assumes the test will fail
115 * and will generate an error.
116 *
117 * It allows a library function to return a value and tests the return
118 * code on return to confirm the given error code was returned.
119 *
120 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
121 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
122 * expected failure, and the test will pass.
123 *
124 * This macro is intended for negative parameter validation tests,
125 * where the failing function may return an error value or call
126 * MBEDTLS_PARAM_FAILED() to indicate the error.
127 *
128 * \param PARAM_ERROR_VALUE The expected error code.
129 *
130 * \param TEST The test expression to be tested.
131 */
132#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
133 do { \
134 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
135 if( (TEST) != (PARAM_ERR_VALUE) || \
136 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
137 { \
138 test_fail( #TEST, __LINE__, __FILE__ ); \
139 goto exit; \
140 } \
141 } while( 0 )
142
143/**
144 * \brief This macro tests the statement passed to it as a test step or
145 * individual test in a test case. The macro assumes the test will fail
146 * and will generate an error.
147 *
148 * It assumes the library function under test cannot return a value and
149 * assumes errors can only be indicated byt calls to
150 * MBEDTLS_PARAM_FAILED().
151 *
152 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
153 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
154 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
155 * can be made.
156 *
157 * This macro is intended for negative parameter validation tests,
158 * where the failing function can only return an error by calling
159 * MBEDTLS_PARAM_FAILED() to indicate the error.
160 *
161 * \param TEST The test expression to be tested.
162 */
163#define TEST_INVALID_PARAM( TEST ) \
164 do { \
165 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
166 if( setjmp( param_fail_jmp ) == 0 ) \
167 { \
168 TEST; \
169 test_fail( #TEST, __LINE__, __FILE__ ); \
170 goto exit; \
171 } \
172 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
173 } while( 0 )
174#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
175
176/**
177 * \brief This macro tests the statement passed to it as a test step or
178 * individual test in a test case. The macro assumes the test will not fail.
179 *
180 * It assumes the library function under test cannot return a value and
181 * assumes errors can only be indicated by calls to
182 * MBEDTLS_PARAM_FAILED().
183 *
184 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
185 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
186 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
187 * can be made.
188 *
189 * This macro is intended to test that functions returning void
190 * accept all of the parameter values they're supposed to accept - eg
191 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
192 * that's allowed to be NULL happens to be NULL.
193 *
194 * Note: for functions that return something other that void,
195 * checking that they accept all the parameters they're supposed to
196 * accept is best done by using TEST_ASSERT() and checking the return
197 * value as well.
198 *
199 * Note: this macro is available even when #MBEDTLS_CHECK_PARAMS is
200 * disabled, as it makes sense to check that the functions accept all
201 * legal values even if this option is disabled - only in that case,
202 * the test is more about whether the function segfaults than about
203 * whether it invokes MBEDTLS_PARAM_FAILED().
204 *
205 * \param TEST The test expression to be tested.
206 */
207#define TEST_VALID_PARAM( TEST ) \
208 TEST_ASSERT( ( TEST, 1 ) );
209
Rich Evans4c091142015-02-02 12:04:10 +0000210#define assert(a) if( !( a ) ) \
211{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200212 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000213 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200214 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000215}
216
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000217/*
218 * 32-bit integer manipulation macros (big endian)
219 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000220#ifndef GET_UINT32_BE
221#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000222{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000223 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
224 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
225 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
226 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000227}
228#endif
229
Paul Bakker5c2364c2012-10-01 14:41:15 +0000230#ifndef PUT_UINT32_BE
231#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000232{ \
233 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
234 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
235 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
236 (b)[(i) + 3] = (unsigned char) ( (n) ); \
237}
238#endif
239
SimonB0269dad2016-02-17 23:34:30 +0000240
241/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100242/* Global variables */
243
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100244static struct
245{
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500246 paramfail_test_state_t paramfail_test_state;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100247 int failed;
248 const char *test;
249 const char *filename;
250 int line_no;
251}
252test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100253
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400254#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400255mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400256#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100257
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500258#if defined(MBEDTLS_CHECK_PARAMS)
259jmp_buf param_fail_jmp;
260jmp_buf jmp_tmp;
261#endif
262
SimonB8ca7bc42016-04-17 23:24:50 +0100263/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100264/* Helper flags for complex dependencies */
265
266/* Indicates whether we expect mbedtls_entropy_init
267 * to initialize some strong entropy source. */
268#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
269 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
270 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
271 defined(MBEDTLS_HAVEGE_C) || \
272 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
273 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100274#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100275#endif
276
277
278/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000279/* Helper Functions */
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500280
281static void test_fail( const char *test, int line_no, const char* filename )
282{
283 test_info.failed = 1;
284 test_info.test = test;
285 test_info.line_no = line_no;
286 test_info.filename = filename;
287}
288
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400289static int platform_setup()
290{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400291 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400292#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400293 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400294#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400295 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400296}
297
298static void platform_teardown()
299{
300#if defined(MBEDTLS_PLATFORM_C)
301 mbedtls_platform_teardown( &platform_ctx );
302#endif /* MBEDTLS_PLATFORM_C */
303}
SimonB0269dad2016-02-17 23:34:30 +0000304
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500305#if defined(MBEDTLS_CHECK_PARAMS)
306void mbedtls_param_failed( const char *failure_condition,
307 const char *file,
308 int line )
309{
310 /* If we are testing the callback function... */
311 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
312 {
313 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
314 }
315 else
316 {
317 /* ...else we treat this as an error */
318
319 /* Record the location of the failure, but not as a failure yet, in case
320 * it was part of the test */
321 test_fail( failure_condition, line, file );
322 test_info.failed = 0;
323
324 longjmp( param_fail_jmp, 1 );
325 }
326}
327#endif
328
Janos Follath8ca53b52016-10-05 10:57:49 +0100329#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
330static int redirect_output( FILE** out_stream, const char* path )
331{
332 int stdout_fd = dup( fileno( *out_stream ) );
333
334 if( stdout_fd == -1 )
335 {
336 return -1;
337 }
338
339 fflush( *out_stream );
340 fclose( *out_stream );
341 *out_stream = fopen( path, "w" );
342
343 if( *out_stream == NULL )
344 {
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500345 close( stdout_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100346 return -1;
347 }
348
349 return stdout_fd;
350}
351
352static int restore_output( FILE** out_stream, int old_fd )
353{
354 fflush( *out_stream );
355 fclose( *out_stream );
356
357 *out_stream = fdopen( old_fd, "w" );
358 if( *out_stream == NULL )
359 {
360 return -1;
361 }
362
363 return 0;
364}
Simon Butchere0192962016-10-12 23:07:30 +0100365
Janos Follathe709f7c2016-10-13 11:26:29 +0100366static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100367{
Janos Follathe709f7c2016-10-13 11:26:29 +0100368 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100369}
Janos Follath8ca53b52016-10-05 10:57:49 +0100370#endif /* __unix__ || __APPLE__ __MACH__ */
371
Rich Evans4c091142015-02-02 12:04:10 +0000372static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000373{
374 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000375 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000376 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000377
Rich Evans4c091142015-02-02 12:04:10 +0000378 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000379 {
380 c = *ibuf++;
381 if( c >= '0' && c <= '9' )
382 c -= '0';
383 else if( c >= 'a' && c <= 'f' )
384 c -= 'a' - 10;
385 else if( c >= 'A' && c <= 'F' )
386 c -= 'A' - 10;
387 else
388 assert( 0 );
389
390 c2 = *ibuf++;
391 if( c2 >= '0' && c2 <= '9' )
392 c2 -= '0';
393 else if( c2 >= 'a' && c2 <= 'f' )
394 c2 -= 'a' - 10;
395 else if( c2 >= 'A' && c2 <= 'F' )
396 c2 -= 'A' - 10;
397 else
398 assert( 0 );
399
400 *obuf++ = ( c << 4 ) | c2;
401 }
402
403 return len;
404}
405
Rich Evans42914452015-02-02 12:09:25 +0000406static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000407{
408 unsigned char l, h;
409
Rich Evans42914452015-02-02 12:09:25 +0000410 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000411 {
Rich Evans42914452015-02-02 12:09:25 +0000412 h = *ibuf / 16;
413 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000414
415 if( h < 10 )
416 *obuf++ = '0' + h;
417 else
418 *obuf++ = 'a' + h - 10;
419
420 if( l < 10 )
421 *obuf++ = '0' + l;
422 else
423 *obuf++ = 'a' + l - 10;
424
425 ++ibuf;
426 len--;
427 }
428}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000429
430/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200431 * Allocate and zeroize a buffer.
432 *
433 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
434 *
435 * For convenience, dies if allocation fails.
436 */
437static unsigned char *zero_alloc( size_t len )
438{
439 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000440 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200441
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200442 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200443 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200444
445 memset( p, 0x00, actual_len );
446
447 return( p );
448}
449
450/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200451 * Allocate and fill a buffer from hex data.
452 *
453 * The buffer is sized exactly as needed. This allows to detect buffer
454 * overruns (including overreads) when running the test suite under valgrind.
455 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200456 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
457 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200458 * For convenience, dies if allocation fails.
459 */
460static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
461{
462 unsigned char *obuf;
463
Rich Evans42914452015-02-02 12:09:25 +0000464 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200465
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200466 if( *olen == 0 )
467 return( zero_alloc( *olen ) );
468
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200469 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200470 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200471
472 (void) unhexify( obuf, ibuf );
473
474 return( obuf );
475}
476
477/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000478 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000479 * Although predictable and often similar on multiple
480 * runs, this does not result in identical random on
481 * each run. So do not use this if the results of a
482 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000483 *
484 * rng_state shall be NULL.
485 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000486static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000487{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200488#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000489 size_t i;
490
Paul Bakker9dcc3222011-03-08 14:16:06 +0000491 if( rng_state != NULL )
492 rng_state = NULL;
493
Paul Bakkera3d195c2011-11-27 21:07:34 +0000494 for( i = 0; i < len; ++i )
495 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200496#else
497 if( rng_state != NULL )
498 rng_state = NULL;
499
500 arc4random_buf( output, len );
501#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000502
503 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000504}
505
506/**
507 * This function only returns zeros
508 *
509 * rng_state shall be NULL.
510 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000511static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000512{
513 if( rng_state != NULL )
514 rng_state = NULL;
515
Paul Bakkera3d195c2011-11-27 21:07:34 +0000516 memset( output, 0, len );
517
Paul Bakker9dcc3222011-03-08 14:16:06 +0000518 return( 0 );
519}
520
521typedef struct
522{
523 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000524 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000525} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000526
527/**
528 * This function returns random based on a buffer it receives.
529 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000530 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100531 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000532 * The number of bytes released from the buffer on each call to
533 * the random function is specified by per_call. (Can be between
534 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000535 *
536 * After the buffer is empty it will return rand();
537 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000538static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000539{
Paul Bakker997bbd12011-03-13 15:45:42 +0000540 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000541 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000542
543 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000544 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000545
Paul Bakkera3d195c2011-11-27 21:07:34 +0000546 use_len = len;
547 if( len > info->length )
548 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000549
Paul Bakkera3d195c2011-11-27 21:07:34 +0000550 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000551 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000552 memcpy( output, info->buf, use_len );
553 info->buf += use_len;
554 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000555 }
556
Paul Bakkera3d195c2011-11-27 21:07:34 +0000557 if( len - use_len > 0 )
558 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
559
560 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000561}
Paul Bakker997bbd12011-03-13 15:45:42 +0000562
563/**
564 * Info structure for the pseudo random function
565 *
566 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000567 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000568 * State( v0, v1 ) should be set to zero.
569 */
570typedef struct
571{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000572 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000573 uint32_t v0, v1;
574} rnd_pseudo_info;
575
576/**
577 * This function returns random based on a pseudo random function.
578 * This means the results should be identical on all systems.
579 * Pseudo random is based on the XTEA encryption algorithm to
580 * generate pseudorandom.
581 *
582 * rng_state shall be a pointer to a rnd_pseudo_info structure.
583 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000584static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000585{
586 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000587 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100588 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000589
590 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000591 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000592
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000593 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000594
595 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000596 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000597 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000598 sum = 0;
599
Paul Bakkera3d195c2011-11-27 21:07:34 +0000600 for( i = 0; i < 32; i++ )
601 {
Rich Evans42914452015-02-02 12:09:25 +0000602 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
603 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000604 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000605 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
606 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000607 }
608
Paul Bakker5c2364c2012-10-01 14:41:15 +0000609 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100610 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000611 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100612 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000613 }
614
Paul Bakkera3d195c2011-11-27 21:07:34 +0000615 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000616}
SimonB0269dad2016-02-17 23:34:30 +0000617
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100618int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100619{
620 int ret = 0;
621 uint32_t i = 0;
622
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500623 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100624 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100625
626 for( i = 0; i < a_len; i++ )
627 {
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500628 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100629 {
630 ret = -1;
631 break;
632 }
633 }
634 return ret;
635}