blob: 71390ecfef9ab1af7298c575b991c57b8e2b799b [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)
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +010027#include "mbedtls/platform_util.h"
Simon Butchera6463452018-12-06 17:41:56 +000028#include <setjmp.h>
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +010029#endif
Simon Butcher747f5fe2018-12-07 16:53:57 +000030
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
Simon Butcher6542f6c2018-12-09 22:09:59 +000073typedef 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
Simon Butchera6463452018-12-06 17:41:56 +000086/**
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +010094 * callback, MBEDTLS_PARAM_FAILED(), will be assumed to be a test
95 * failure.
Simon Butchera6463452018-12-06 17:41:56 +000096 *
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100112#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100122 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000123 * 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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100127 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000128 *
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100151 * MBEDTLS_PARAM_FAILED().
Simon Butchera6463452018-12-06 17:41:56 +0000152 *
153 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100154 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000155 * 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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100160 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000161 *
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100176#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
Simon Butchera6463452018-12-06 17:41:56 +0000177
Rich Evans4c091142015-02-02 12:04:10 +0000178#define assert(a) if( !( a ) ) \
179{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200180 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000181 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200182 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000183}
184
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000185/*
186 * 32-bit integer manipulation macros (big endian)
187 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000188#ifndef GET_UINT32_BE
189#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000190{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000191 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
192 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
193 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
194 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000195}
196#endif
197
Paul Bakker5c2364c2012-10-01 14:41:15 +0000198#ifndef PUT_UINT32_BE
199#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000200{ \
201 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
202 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
203 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
204 (b)[(i) + 3] = (unsigned char) ( (n) ); \
205}
206#endif
207
SimonB0269dad2016-02-17 23:34:30 +0000208
209/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100210/* Global variables */
211
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100212static struct
213{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000214 paramfail_test_state_t paramfail_test_state;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100215 int failed;
216 const char *test;
217 const char *filename;
218 int line_no;
219}
220test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100221
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400222#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400223mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400224#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100225
Simon Butchera6463452018-12-06 17:41:56 +0000226#if defined(MBEDTLS_CHECK_PARAMS)
227jmp_buf param_fail_jmp;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000228jmp_buf jmp_tmp;
Simon Butchera6463452018-12-06 17:41:56 +0000229#endif
230
SimonB8ca7bc42016-04-17 23:24:50 +0100231/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100232/* Helper flags for complex dependencies */
233
234/* Indicates whether we expect mbedtls_entropy_init
235 * to initialize some strong entropy source. */
236#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
237 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
238 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
239 defined(MBEDTLS_HAVEGE_C) || \
240 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
241 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100242#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100243#endif
244
245
246/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000247/* Helper Functions */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000248
249static void test_fail( const char *test, int line_no, const char* filename )
250{
251 test_info.failed = 1;
252 test_info.test = test;
253 test_info.line_no = line_no;
254 test_info.filename = filename;
255}
256
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400257static int platform_setup()
258{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400259 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400260#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400261 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400262#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400263 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400264}
265
266static void platform_teardown()
267{
268#if defined(MBEDTLS_PLATFORM_C)
269 mbedtls_platform_teardown( &platform_ctx );
270#endif /* MBEDTLS_PLATFORM_C */
271}
SimonB0269dad2016-02-17 23:34:30 +0000272
Simon Butchera6463452018-12-06 17:41:56 +0000273#if defined(MBEDTLS_CHECK_PARAMS)
Manuel Pégourié-Gonnard3ef6a6d2018-12-10 14:31:45 +0100274void mbedtls_param_failed( const char *failure_condition,
275 const char *file,
276 int line )
Simon Butchera6463452018-12-06 17:41:56 +0000277{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000278 /* If we are testing the callback function... */
279 if ( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
280 {
281 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
282 }
283 else
284 {
285 /* ...else we treat this as an error */
Simon Butchera6463452018-12-06 17:41:56 +0000286
Simon Butcher6542f6c2018-12-09 22:09:59 +0000287 /* Record the location of the failure, but not as a failure yet, in case
288 * it was part of the test */
289 test_fail( failure_condition, line, file );
290 test_info.failed = 0;
291
292 longjmp( param_fail_jmp, 1 );
293 }
Simon Butchera6463452018-12-06 17:41:56 +0000294}
295#endif
296
Janos Follath8ca53b52016-10-05 10:57:49 +0100297#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
298static int redirect_output( FILE** out_stream, const char* path )
299{
300 int stdout_fd = dup( fileno( *out_stream ) );
301
302 if( stdout_fd == -1 )
303 {
304 return -1;
305 }
306
307 fflush( *out_stream );
308 fclose( *out_stream );
309 *out_stream = fopen( path, "w" );
310
311 if( *out_stream == NULL )
312 {
313 return -1;
314 }
315
316 return stdout_fd;
317}
318
319static int restore_output( FILE** out_stream, int old_fd )
320{
321 fflush( *out_stream );
322 fclose( *out_stream );
323
324 *out_stream = fdopen( old_fd, "w" );
325 if( *out_stream == NULL )
326 {
327 return -1;
328 }
329
330 return 0;
331}
Simon Butchere0192962016-10-12 23:07:30 +0100332
Janos Follathe709f7c2016-10-13 11:26:29 +0100333static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100334{
Janos Follathe709f7c2016-10-13 11:26:29 +0100335 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100336}
Janos Follath8ca53b52016-10-05 10:57:49 +0100337#endif /* __unix__ || __APPLE__ __MACH__ */
338
Rich Evans4c091142015-02-02 12:04:10 +0000339static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000340{
341 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000342 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000343 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000344
Rich Evans4c091142015-02-02 12:04:10 +0000345 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000346 {
347 c = *ibuf++;
348 if( c >= '0' && c <= '9' )
349 c -= '0';
350 else if( c >= 'a' && c <= 'f' )
351 c -= 'a' - 10;
352 else if( c >= 'A' && c <= 'F' )
353 c -= 'A' - 10;
354 else
355 assert( 0 );
356
357 c2 = *ibuf++;
358 if( c2 >= '0' && c2 <= '9' )
359 c2 -= '0';
360 else if( c2 >= 'a' && c2 <= 'f' )
361 c2 -= 'a' - 10;
362 else if( c2 >= 'A' && c2 <= 'F' )
363 c2 -= 'A' - 10;
364 else
365 assert( 0 );
366
367 *obuf++ = ( c << 4 ) | c2;
368 }
369
370 return len;
371}
372
Rich Evans42914452015-02-02 12:09:25 +0000373static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000374{
375 unsigned char l, h;
376
Rich Evans42914452015-02-02 12:09:25 +0000377 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000378 {
Rich Evans42914452015-02-02 12:09:25 +0000379 h = *ibuf / 16;
380 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000381
382 if( h < 10 )
383 *obuf++ = '0' + h;
384 else
385 *obuf++ = 'a' + h - 10;
386
387 if( l < 10 )
388 *obuf++ = '0' + l;
389 else
390 *obuf++ = 'a' + l - 10;
391
392 ++ibuf;
393 len--;
394 }
395}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000396
397/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200398 * Allocate and zeroize a buffer.
399 *
400 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
401 *
402 * For convenience, dies if allocation fails.
403 */
404static unsigned char *zero_alloc( size_t len )
405{
406 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000407 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200408
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200409 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200410 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200411
412 memset( p, 0x00, actual_len );
413
414 return( p );
415}
416
417/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200418 * Allocate and fill a buffer from hex data.
419 *
420 * The buffer is sized exactly as needed. This allows to detect buffer
421 * overruns (including overreads) when running the test suite under valgrind.
422 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200423 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
424 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200425 * For convenience, dies if allocation fails.
426 */
427static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
428{
429 unsigned char *obuf;
430
Rich Evans42914452015-02-02 12:09:25 +0000431 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200432
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200433 if( *olen == 0 )
434 return( zero_alloc( *olen ) );
435
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200436 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200437 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200438
439 (void) unhexify( obuf, ibuf );
440
441 return( obuf );
442}
443
444/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000445 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000446 * Although predictable and often similar on multiple
447 * runs, this does not result in identical random on
448 * each run. So do not use this if the results of a
449 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000450 *
451 * rng_state shall be NULL.
452 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000453static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000454{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200455#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000456 size_t i;
457
Paul Bakker9dcc3222011-03-08 14:16:06 +0000458 if( rng_state != NULL )
459 rng_state = NULL;
460
Paul Bakkera3d195c2011-11-27 21:07:34 +0000461 for( i = 0; i < len; ++i )
462 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200463#else
464 if( rng_state != NULL )
465 rng_state = NULL;
466
467 arc4random_buf( output, len );
468#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000469
470 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000471}
472
473/**
474 * This function only returns zeros
475 *
476 * rng_state shall be NULL.
477 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000478static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000479{
480 if( rng_state != NULL )
481 rng_state = NULL;
482
Paul Bakkera3d195c2011-11-27 21:07:34 +0000483 memset( output, 0, len );
484
Paul Bakker9dcc3222011-03-08 14:16:06 +0000485 return( 0 );
486}
487
488typedef struct
489{
490 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000491 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000492} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000493
494/**
495 * This function returns random based on a buffer it receives.
496 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000497 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100498 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000499 * The number of bytes released from the buffer on each call to
500 * the random function is specified by per_call. (Can be between
501 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000502 *
503 * After the buffer is empty it will return rand();
504 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000505static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000506{
Paul Bakker997bbd12011-03-13 15:45:42 +0000507 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000508 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000509
510 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000511 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000512
Paul Bakkera3d195c2011-11-27 21:07:34 +0000513 use_len = len;
514 if( len > info->length )
515 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000516
Paul Bakkera3d195c2011-11-27 21:07:34 +0000517 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000518 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000519 memcpy( output, info->buf, use_len );
520 info->buf += use_len;
521 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000522 }
523
Paul Bakkera3d195c2011-11-27 21:07:34 +0000524 if( len - use_len > 0 )
525 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
526
527 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000528}
Paul Bakker997bbd12011-03-13 15:45:42 +0000529
530/**
531 * Info structure for the pseudo random function
532 *
533 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000534 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000535 * State( v0, v1 ) should be set to zero.
536 */
537typedef struct
538{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000539 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000540 uint32_t v0, v1;
541} rnd_pseudo_info;
542
543/**
544 * This function returns random based on a pseudo random function.
545 * This means the results should be identical on all systems.
546 * Pseudo random is based on the XTEA encryption algorithm to
547 * generate pseudorandom.
548 *
549 * rng_state shall be a pointer to a rnd_pseudo_info structure.
550 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000551static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000552{
553 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000554 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100555 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000556
557 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000558 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000559
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000560 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000561
562 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000563 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000564 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000565 sum = 0;
566
Paul Bakkera3d195c2011-11-27 21:07:34 +0000567 for( i = 0; i < 32; i++ )
568 {
Rich Evans42914452015-02-02 12:09:25 +0000569 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
570 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000571 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000572 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
573 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000574 }
575
Paul Bakker5c2364c2012-10-01 14:41:15 +0000576 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100577 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000578 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100579 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000580 }
581
Paul Bakkera3d195c2011-11-27 21:07:34 +0000582 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000583}
SimonB0269dad2016-02-17 23:34:30 +0000584
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100585int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100586{
587 int ret = 0;
588 uint32_t i = 0;
589
590 if ( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100591 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100592
593 for( i = 0; i < a_len; i++ )
594 {
595 if ( a[i] != b[i] )
596 {
597 ret = -1;
598 break;
599 }
600 }
601 return ret;
602}
603