blob: 6ead2d349b976edbf35d114d5c9e9831661d8dcb [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
Hanno Beckerf2bf1152019-08-20 16:15:58 +010031#if defined(MBEDTLS_USE_TINYCRYPT)
32#include "tinycrypt/ecc.h"
33#endif /* MBEDTLS_USE_TINYCRYPT */
34
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000035#ifdef _MSC_VER
36#include <basetsd.h>
Azim Khan0fa35042018-06-22 11:34:33 +010037typedef UINT8 uint8_t;
38typedef INT32 int32_t;
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000039typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000040#define strncasecmp _strnicmp
41#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000042#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020043#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000044#endif
45
Paul Bakker19343182013-08-16 13:31:10 +020046#include <string.h>
47
Janos Follath8ca53b52016-10-05 10:57:49 +010048#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
49#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000050#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010051#endif
SimonB0269dad2016-02-17 23:34:30 +000052
Azim Khand30ca132017-06-09 04:32:58 +010053/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +010054typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +010055{
56 uint8_t * x;
57 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +010058} data_t;
Azim Khand30ca132017-06-09 04:32:58 +010059
SimonB0269dad2016-02-17 23:34:30 +000060/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +010061/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +000062
Azim Khan62a5d7d2018-06-29 10:02:54 +010063#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
64#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
65#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +010066
Azim Khan62a5d7d2018-06-29 10:02:54 +010067#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
68#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
69#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
70#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
71 Only int, string, binary data
72 and integer expressions are
73 allowed */
74#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
75 build */
SimonB0269dad2016-02-17 23:34:30 +000076
Simon Butcher6542f6c2018-12-09 22:09:59 +000077typedef enum
78{
79 PARAMFAIL_TESTSTATE_IDLE = 0, /* No parameter failure call test */
80 PARAMFAIL_TESTSTATE_PENDING, /* Test call to the parameter failure
81 * is pending */
82 PARAMFAIL_TESTSTATE_CALLED /* The test call to the parameter
83 * failure function has been made */
84} paramfail_test_state_t;
85
SimonB0269dad2016-02-17 23:34:30 +000086
87/*----------------------------------------------------------------------------*/
88/* Macros */
89
Simon Butchera6463452018-12-06 17:41:56 +000090/**
91 * \brief This macro tests the expression passed to it as a test step or
92 * individual test in a test case.
93 *
94 * It allows a library function to return a value and return an error
95 * code that can be tested.
96 *
97 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +010098 * callback, MBEDTLS_PARAM_FAILED(), will be assumed to be a test
99 * failure.
Simon Butchera6463452018-12-06 17:41:56 +0000100 *
101 * This macro is not suitable for negative parameter validation tests,
102 * as it assumes the test step will not create an error.
103 *
104 * \param TEST The test expression to be tested.
105 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000106#define TEST_ASSERT( TEST ) \
107 do { \
108 if( ! (TEST) ) \
109 { \
110 test_fail( #TEST, __LINE__, __FILE__ ); \
111 goto exit; \
112 } \
SimonB0269dad2016-02-17 23:34:30 +0000113 } while( 0 )
114
Hanno Becker930fbf62019-07-05 13:31:30 +0100115/**
116 * \brief This macro tests the expression passed to it and skips the
117 * running test if it doesn't evaluate to 'true'.
118 *
119 * \param TEST The test expression to be tested.
120 */
121#define TEST_ASSUME( TEST ) \
122 do { \
123 if( ! (TEST) ) \
124 { \
125 test_skip( #TEST, __LINE__, __FILE__ ); \
126 goto exit; \
127 } \
128 } while( 0 )
129
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100130#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
Simon Butchera6463452018-12-06 17:41:56 +0000131/**
132 * \brief This macro tests the statement passed to it as a test step or
133 * individual test in a test case. The macro assumes the test will fail
134 * and will generate an error.
135 *
136 * It allows a library function to return a value and tests the return
137 * code on return to confirm the given error code was returned.
138 *
139 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100140 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000141 * expected failure, and the test will pass.
142 *
143 * This macro is intended for negative parameter validation tests,
144 * where the failing function may return an error value or call
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100145 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000146 *
147 * \param PARAM_ERROR_VALUE The expected error code.
148 *
149 * \param TEST The test expression to be tested.
150 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000151#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
152 do { \
153 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
Manuel Pégourié-Gonnardacfdc622018-12-11 10:36:21 +0100154 if( (TEST) != (PARAM_ERR_VALUE) || \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000155 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
156 { \
157 test_fail( #TEST, __LINE__, __FILE__ ); \
158 goto exit; \
159 } \
160 } while( 0 )
Simon Butchera6463452018-12-06 17:41:56 +0000161
162/**
163 * \brief This macro tests the statement passed to it as a test step or
164 * individual test in a test case. The macro assumes the test will fail
165 * and will generate an error.
166 *
167 * It assumes the library function under test cannot return a value and
168 * assumes errors can only be indicated byt calls to
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100169 * MBEDTLS_PARAM_FAILED().
Simon Butchera6463452018-12-06 17:41:56 +0000170 *
171 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100172 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000173 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
174 * can be made.
175 *
176 * This macro is intended for negative parameter validation tests,
177 * where the failing function can only return an error by calling
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100178 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000179 *
180 * \param TEST The test expression to be tested.
181 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000182#define TEST_INVALID_PARAM( TEST ) \
183 do { \
184 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100185 if( setjmp( param_fail_jmp ) == 0 ) \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000186 { \
187 TEST; \
188 test_fail( #TEST, __LINE__, __FILE__ ); \
189 goto exit; \
190 } \
191 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
Simon Butchera6463452018-12-06 17:41:56 +0000192 } while( 0 )
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100193#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
Simon Butchera6463452018-12-06 17:41:56 +0000194
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100195/**
196 * \brief This macro tests the statement passed to it as a test step or
197 * individual test in a test case. The macro assumes the test will not fail.
198 *
199 * It assumes the library function under test cannot return a value and
200 * assumes errors can only be indicated by calls to
201 * MBEDTLS_PARAM_FAILED().
202 *
203 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
204 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
205 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
206 * can be made.
207 *
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100208 * This macro is intended to test that functions returning void
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100209 * accept all of the parameter values they're supposed to accept - eg
210 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100211 * that's allowed to be NULL happens to be NULL.
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100212 *
213 * Note: for functions that return something other that void,
214 * checking that they accept all the parameters they're supposed to
215 * accept is best done by using TEST_ASSERT() and checking the return
216 * value as well.
217 *
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100218 * Note: this macro is available even when #MBEDTLS_CHECK_PARAMS is
219 * disabled, as it makes sense to check that the functions accept all
220 * legal values even if this option is disabled - only in that case,
Manuel Pégourié-Gonnarde7306d32018-12-13 09:45:49 +0100221 * the test is more about whether the function segfaults than about
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100222 * whether it invokes MBEDTLS_PARAM_FAILED().
223 *
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100224 * \param TEST The test expression to be tested.
225 */
226#define TEST_VALID_PARAM( TEST ) \
227 TEST_ASSERT( ( TEST, 1 ) );
Simon Butchera6463452018-12-06 17:41:56 +0000228
Gilles Peskine137d31b2019-06-07 14:52:07 +0200229#define TEST_HELPER_ASSERT(a) if( !( a ) ) \
Rich Evans4c091142015-02-02 12:04:10 +0000230{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200231 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000232 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200233 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000234}
235
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000236/*
237 * 32-bit integer manipulation macros (big endian)
238 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000239#ifndef GET_UINT32_BE
240#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000241{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000242 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
243 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
244 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
245 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000246}
247#endif
248
Paul Bakker5c2364c2012-10-01 14:41:15 +0000249#ifndef PUT_UINT32_BE
250#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000251{ \
252 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
253 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
254 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
255 (b)[(i) + 3] = (unsigned char) ( (n) ); \
256}
257#endif
258
SimonB0269dad2016-02-17 23:34:30 +0000259
260/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100261/* Global variables */
262
Hanno Becker930fbf62019-07-05 13:31:30 +0100263typedef enum
264{
265 TEST_RESULT_SUCCESS = 0,
266 TEST_RESULT_FAILED,
267 TEST_RESULT_SKIPPED
268} test_result_t;
269
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100270static struct
271{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000272 paramfail_test_state_t paramfail_test_state;
Hanno Becker930fbf62019-07-05 13:31:30 +0100273 test_result_t result;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100274 const char *test;
275 const char *filename;
276 int line_no;
277}
278test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100279
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400280#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400281mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400282#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100283
Simon Butchera6463452018-12-06 17:41:56 +0000284#if defined(MBEDTLS_CHECK_PARAMS)
285jmp_buf param_fail_jmp;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000286jmp_buf jmp_tmp;
Simon Butchera6463452018-12-06 17:41:56 +0000287#endif
288
SimonB8ca7bc42016-04-17 23:24:50 +0100289/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100290/* Helper flags for complex dependencies */
291
292/* Indicates whether we expect mbedtls_entropy_init
293 * to initialize some strong entropy source. */
294#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
295 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
296 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
297 defined(MBEDTLS_HAVEGE_C) || \
298 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
299 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100300#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100301#endif
302
303
304/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000305/* Helper Functions */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000306
Simon Butcherecff2192018-10-03 16:17:41 +0100307void test_fail( const char *test, int line_no, const char* filename )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000308{
Hanno Becker930fbf62019-07-05 13:31:30 +0100309 test_info.result = TEST_RESULT_FAILED;
310 test_info.test = test;
311 test_info.line_no = line_no;
312 test_info.filename = filename;
313}
314
315void test_skip( const char *test, int line_no, const char* filename )
316{
317 test_info.result = TEST_RESULT_SKIPPED;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000318 test_info.test = test;
319 test_info.line_no = line_no;
320 test_info.filename = filename;
321}
322
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400323static int platform_setup()
324{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400325 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400326#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400327 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400328#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400329 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400330}
331
332static void platform_teardown()
333{
334#if defined(MBEDTLS_PLATFORM_C)
335 mbedtls_platform_teardown( &platform_ctx );
336#endif /* MBEDTLS_PLATFORM_C */
337}
SimonB0269dad2016-02-17 23:34:30 +0000338
Simon Butchera6463452018-12-06 17:41:56 +0000339#if defined(MBEDTLS_CHECK_PARAMS)
Manuel Pégourié-Gonnard3ef6a6d2018-12-10 14:31:45 +0100340void mbedtls_param_failed( const char *failure_condition,
341 const char *file,
342 int line )
Simon Butchera6463452018-12-06 17:41:56 +0000343{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000344 /* If we are testing the callback function... */
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100345 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000346 {
347 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
348 }
349 else
350 {
351 /* ...else we treat this as an error */
Simon Butchera6463452018-12-06 17:41:56 +0000352
Simon Butcher6542f6c2018-12-09 22:09:59 +0000353 /* Record the location of the failure, but not as a failure yet, in case
354 * it was part of the test */
355 test_fail( failure_condition, line, file );
Hanno Becker930fbf62019-07-05 13:31:30 +0100356 test_info.result = TEST_RESULT_SUCCESS;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000357
358 longjmp( param_fail_jmp, 1 );
359 }
Simon Butchera6463452018-12-06 17:41:56 +0000360}
361#endif
362
Hanno Becker572d4482019-07-23 13:47:53 +0100363#if defined(MBEDTLS_SSL_CONF_RNG)
364int rng_wrap( void *ctx, unsigned char *dst, size_t len )
365{
366 ((void) ctx);
367 ((void) dst);
368 ((void) len);
369 /* We don't expect test suites to use SSL functionality
370 * that would trigger the hardcoded RNG. */
371 return( -1 );
372}
373#endif /* MBEDTLS_SSL_CONF_RNG */
374
Janos Follath8ca53b52016-10-05 10:57:49 +0100375#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
376static int redirect_output( FILE** out_stream, const char* path )
377{
378 int stdout_fd = dup( fileno( *out_stream ) );
379
380 if( stdout_fd == -1 )
381 {
382 return -1;
383 }
384
385 fflush( *out_stream );
386 fclose( *out_stream );
387 *out_stream = fopen( path, "w" );
388
389 if( *out_stream == NULL )
390 {
Andres Amaya Garcia687d6732018-11-26 21:23:28 +0000391 close( stdout_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100392 return -1;
393 }
394
395 return stdout_fd;
396}
397
398static int restore_output( FILE** out_stream, int old_fd )
399{
400 fflush( *out_stream );
401 fclose( *out_stream );
402
403 *out_stream = fdopen( old_fd, "w" );
404 if( *out_stream == NULL )
405 {
406 return -1;
407 }
408
409 return 0;
410}
Simon Butchere0192962016-10-12 23:07:30 +0100411
Janos Follathe709f7c2016-10-13 11:26:29 +0100412static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100413{
Janos Follathe709f7c2016-10-13 11:26:29 +0100414 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100415}
Janos Follath8ca53b52016-10-05 10:57:49 +0100416#endif /* __unix__ || __APPLE__ __MACH__ */
417
Simon Butcherecff2192018-10-03 16:17:41 +0100418int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000419{
420 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000421 int len = strlen( ibuf ) / 2;
Gilles Peskine137d31b2019-06-07 14:52:07 +0200422 TEST_HELPER_ASSERT( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000423
Rich Evans4c091142015-02-02 12:04:10 +0000424 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000425 {
426 c = *ibuf++;
427 if( c >= '0' && c <= '9' )
428 c -= '0';
429 else if( c >= 'a' && c <= 'f' )
430 c -= 'a' - 10;
431 else if( c >= 'A' && c <= 'F' )
432 c -= 'A' - 10;
433 else
Gilles Peskine137d31b2019-06-07 14:52:07 +0200434 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000435
436 c2 = *ibuf++;
437 if( c2 >= '0' && c2 <= '9' )
438 c2 -= '0';
439 else if( c2 >= 'a' && c2 <= 'f' )
440 c2 -= 'a' - 10;
441 else if( c2 >= 'A' && c2 <= 'F' )
442 c2 -= 'A' - 10;
443 else
Gilles Peskine137d31b2019-06-07 14:52:07 +0200444 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000445
446 *obuf++ = ( c << 4 ) | c2;
447 }
448
449 return len;
450}
451
Simon Butcherecff2192018-10-03 16:17:41 +0100452void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000453{
454 unsigned char l, h;
455
Rich Evans42914452015-02-02 12:09:25 +0000456 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000457 {
Rich Evans42914452015-02-02 12:09:25 +0000458 h = *ibuf / 16;
459 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000460
461 if( h < 10 )
462 *obuf++ = '0' + h;
463 else
464 *obuf++ = 'a' + h - 10;
465
466 if( l < 10 )
467 *obuf++ = '0' + l;
468 else
469 *obuf++ = 'a' + l - 10;
470
471 ++ibuf;
472 len--;
473 }
474}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000475
476/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200477 * Allocate and zeroize a buffer.
478 *
479 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
480 *
481 * For convenience, dies if allocation fails.
482 */
483static unsigned char *zero_alloc( size_t len )
484{
485 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000486 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200487
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200488 p = mbedtls_calloc( 1, actual_len );
Gilles Peskine137d31b2019-06-07 14:52:07 +0200489 TEST_HELPER_ASSERT( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200490
491 memset( p, 0x00, actual_len );
492
493 return( p );
494}
495
496/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200497 * Allocate and fill a buffer from hex data.
498 *
499 * The buffer is sized exactly as needed. This allows to detect buffer
500 * overruns (including overreads) when running the test suite under valgrind.
501 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200502 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
503 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200504 * For convenience, dies if allocation fails.
505 */
Simon Butcherecff2192018-10-03 16:17:41 +0100506unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200507{
508 unsigned char *obuf;
509
Rich Evans42914452015-02-02 12:09:25 +0000510 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200511
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200512 if( *olen == 0 )
513 return( zero_alloc( *olen ) );
514
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200515 obuf = mbedtls_calloc( 1, *olen );
Gilles Peskine137d31b2019-06-07 14:52:07 +0200516 TEST_HELPER_ASSERT( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200517
518 (void) unhexify( obuf, ibuf );
519
520 return( obuf );
521}
522
523/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000524 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000525 * Although predictable and often similar on multiple
526 * runs, this does not result in identical random on
527 * each run. So do not use this if the results of a
528 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000529 *
530 * rng_state shall be NULL.
531 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000532static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000533{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200534#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000535 size_t i;
536
Paul Bakker9dcc3222011-03-08 14:16:06 +0000537 if( rng_state != NULL )
538 rng_state = NULL;
539
Paul Bakkera3d195c2011-11-27 21:07:34 +0000540 for( i = 0; i < len; ++i )
541 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200542#else
543 if( rng_state != NULL )
544 rng_state = NULL;
545
546 arc4random_buf( output, len );
547#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000548
549 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000550}
551
Hanno Beckerf2bf1152019-08-20 16:15:58 +0100552#if defined(MBEDTLS_USE_TINYCRYPT)
553static int uecc_rng_wrapper( uint8_t *dest, unsigned int size )
554{
555 int ret;
556 ret = rnd_std_rand( NULL, dest, size );
557 if( ret == 0 )
558 return( (int) size );
559
560 return( 0 );
561}
562#endif /* MBEDTLS_USE_TINYCRYPT */
563
Paul Bakker9dcc3222011-03-08 14:16:06 +0000564/**
565 * This function only returns zeros
566 *
567 * rng_state shall be NULL.
568 */
Simon Butcherecff2192018-10-03 16:17:41 +0100569int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000570{
571 if( rng_state != NULL )
572 rng_state = NULL;
573
Paul Bakkera3d195c2011-11-27 21:07:34 +0000574 memset( output, 0, len );
575
Paul Bakker9dcc3222011-03-08 14:16:06 +0000576 return( 0 );
577}
578
579typedef struct
580{
581 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000582 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000583} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000584
585/**
586 * This function returns random based on a buffer it receives.
587 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000588 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100589 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000590 * The number of bytes released from the buffer on each call to
591 * the random function is specified by per_call. (Can be between
592 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000593 *
594 * After the buffer is empty it will return rand();
595 */
Simon Butcherecff2192018-10-03 16:17:41 +0100596int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000597{
Paul Bakker997bbd12011-03-13 15:45:42 +0000598 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000599 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000600
601 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000602 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000603
Paul Bakkera3d195c2011-11-27 21:07:34 +0000604 use_len = len;
605 if( len > info->length )
606 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000607
Paul Bakkera3d195c2011-11-27 21:07:34 +0000608 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000609 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000610 memcpy( output, info->buf, use_len );
611 info->buf += use_len;
612 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000613 }
614
Paul Bakkera3d195c2011-11-27 21:07:34 +0000615 if( len - use_len > 0 )
616 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
617
618 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000619}
Paul Bakker997bbd12011-03-13 15:45:42 +0000620
621/**
622 * Info structure for the pseudo random function
623 *
624 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000625 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000626 * State( v0, v1 ) should be set to zero.
627 */
628typedef struct
629{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000630 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000631 uint32_t v0, v1;
632} rnd_pseudo_info;
633
634/**
635 * This function returns random based on a pseudo random function.
636 * This means the results should be identical on all systems.
637 * Pseudo random is based on the XTEA encryption algorithm to
638 * generate pseudorandom.
639 *
640 * rng_state shall be a pointer to a rnd_pseudo_info structure.
641 */
Simon Butcherecff2192018-10-03 16:17:41 +0100642int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000643{
644 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000645 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100646 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000647
648 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000649 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000650
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000651 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000652
653 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000654 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000655 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000656 sum = 0;
657
Paul Bakkera3d195c2011-11-27 21:07:34 +0000658 for( i = 0; i < 32; i++ )
659 {
Rich Evans42914452015-02-02 12:09:25 +0000660 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
661 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000662 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000663 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
664 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000665 }
666
Paul Bakker5c2364c2012-10-01 14:41:15 +0000667 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100668 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000669 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100670 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000671 }
672
Paul Bakkera3d195c2011-11-27 21:07:34 +0000673 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000674}
SimonB0269dad2016-02-17 23:34:30 +0000675
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100676int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100677{
678 int ret = 0;
679 uint32_t i = 0;
680
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100681 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100682 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100683
684 for( i = 0; i < a_len; i++ )
685 {
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100686 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100687 {
688 ret = -1;
689 break;
690 }
691 }
692 return ret;
693}