blob: 1ce17f53ce2fdf0db2832fba292e727acaba8ddc [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#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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100111#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
Simon Butchera6463452018-12-06 17:41:56 +0000112/**
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100121 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000122 * 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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100126 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000127 *
128 * \param PARAM_ERROR_VALUE The expected error code.
129 *
130 * \param TEST The test expression to be tested.
131 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000132#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
133 do { \
134 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
Manuel Pégourié-Gonnardacfdc622018-12-11 10:36:21 +0100135 if( (TEST) != (PARAM_ERR_VALUE) || \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000136 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
137 { \
138 test_fail( #TEST, __LINE__, __FILE__ ); \
139 goto exit; \
140 } \
141 } while( 0 )
Simon Butchera6463452018-12-06 17:41:56 +0000142
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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100150 * MBEDTLS_PARAM_FAILED().
Simon Butchera6463452018-12-06 17:41:56 +0000151 *
152 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100153 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000154 * 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
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100159 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000160 *
161 * \param TEST The test expression to be tested.
162 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000163#define TEST_INVALID_PARAM( TEST ) \
164 do { \
165 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100166 if( setjmp( param_fail_jmp ) == 0 ) \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000167 { \
168 TEST; \
169 test_fail( #TEST, __LINE__, __FILE__ ); \
170 goto exit; \
171 } \
172 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
Simon Butchera6463452018-12-06 17:41:56 +0000173 } while( 0 )
174
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100175/**
176 * \brief This macro tests the statement passed to it as a test step or
177 * individual test in a test case. The macro assumes the test will not fail.
178 *
179 * It assumes the library function under test cannot return a value and
180 * assumes errors can only be indicated by calls to
181 * MBEDTLS_PARAM_FAILED().
182 *
183 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
184 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
185 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
186 * can be made.
187 *
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100188 * This macro is intended to test that functions returning void
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100189 * accept all of the parameter values they're supposed to accept - eg
190 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100191 * that's allowed to be NULL happens to be NULL.
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100192 *
193 * Note: for functions that return something other that void,
194 * checking that they accept all the parameters they're supposed to
195 * accept is best done by using TEST_ASSERT() and checking the return
196 * value as well.
197 *
198 * \param TEST The test expression to be tested.
199 */
200#define TEST_VALID_PARAM( TEST ) \
201 TEST_ASSERT( ( TEST, 1 ) );
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100202#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
Simon Butchera6463452018-12-06 17:41:56 +0000203
Rich Evans4c091142015-02-02 12:04:10 +0000204#define assert(a) if( !( a ) ) \
205{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200206 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000207 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200208 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000209}
210
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000211/*
212 * 32-bit integer manipulation macros (big endian)
213 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000214#ifndef GET_UINT32_BE
215#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000216{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000217 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
218 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
219 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
220 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000221}
222#endif
223
Paul Bakker5c2364c2012-10-01 14:41:15 +0000224#ifndef PUT_UINT32_BE
225#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000226{ \
227 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
228 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
229 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
230 (b)[(i) + 3] = (unsigned char) ( (n) ); \
231}
232#endif
233
SimonB0269dad2016-02-17 23:34:30 +0000234
235/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100236/* Global variables */
237
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100238static struct
239{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000240 paramfail_test_state_t paramfail_test_state;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100241 int failed;
242 const char *test;
243 const char *filename;
244 int line_no;
245}
246test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100247
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400248#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400249mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400250#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100251
Simon Butchera6463452018-12-06 17:41:56 +0000252#if defined(MBEDTLS_CHECK_PARAMS)
253jmp_buf param_fail_jmp;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000254jmp_buf jmp_tmp;
Simon Butchera6463452018-12-06 17:41:56 +0000255#endif
256
SimonB8ca7bc42016-04-17 23:24:50 +0100257/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100258/* Helper flags for complex dependencies */
259
260/* Indicates whether we expect mbedtls_entropy_init
261 * to initialize some strong entropy source. */
262#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
263 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
264 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
265 defined(MBEDTLS_HAVEGE_C) || \
266 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
267 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100268#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100269#endif
270
271
272/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000273/* Helper Functions */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000274
275static void test_fail( const char *test, int line_no, const char* filename )
276{
277 test_info.failed = 1;
278 test_info.test = test;
279 test_info.line_no = line_no;
280 test_info.filename = filename;
281}
282
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400283static int platform_setup()
284{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400285 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400286#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400287 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400288#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400289 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400290}
291
292static void platform_teardown()
293{
294#if defined(MBEDTLS_PLATFORM_C)
295 mbedtls_platform_teardown( &platform_ctx );
296#endif /* MBEDTLS_PLATFORM_C */
297}
SimonB0269dad2016-02-17 23:34:30 +0000298
Simon Butchera6463452018-12-06 17:41:56 +0000299#if defined(MBEDTLS_CHECK_PARAMS)
Manuel Pégourié-Gonnard3ef6a6d2018-12-10 14:31:45 +0100300void mbedtls_param_failed( const char *failure_condition,
301 const char *file,
302 int line )
Simon Butchera6463452018-12-06 17:41:56 +0000303{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000304 /* If we are testing the callback function... */
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100305 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000306 {
307 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
308 }
309 else
310 {
311 /* ...else we treat this as an error */
Simon Butchera6463452018-12-06 17:41:56 +0000312
Simon Butcher6542f6c2018-12-09 22:09:59 +0000313 /* Record the location of the failure, but not as a failure yet, in case
314 * it was part of the test */
315 test_fail( failure_condition, line, file );
316 test_info.failed = 0;
317
318 longjmp( param_fail_jmp, 1 );
319 }
Simon Butchera6463452018-12-06 17:41:56 +0000320}
321#endif
322
Janos Follath8ca53b52016-10-05 10:57:49 +0100323#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
324static int redirect_output( FILE** out_stream, const char* path )
325{
326 int stdout_fd = dup( fileno( *out_stream ) );
327
328 if( stdout_fd == -1 )
329 {
330 return -1;
331 }
332
333 fflush( *out_stream );
334 fclose( *out_stream );
335 *out_stream = fopen( path, "w" );
336
337 if( *out_stream == NULL )
338 {
339 return -1;
340 }
341
342 return stdout_fd;
343}
344
345static int restore_output( FILE** out_stream, int old_fd )
346{
347 fflush( *out_stream );
348 fclose( *out_stream );
349
350 *out_stream = fdopen( old_fd, "w" );
351 if( *out_stream == NULL )
352 {
353 return -1;
354 }
355
356 return 0;
357}
Simon Butchere0192962016-10-12 23:07:30 +0100358
Janos Follathe709f7c2016-10-13 11:26:29 +0100359static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100360{
Janos Follathe709f7c2016-10-13 11:26:29 +0100361 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100362}
Janos Follath8ca53b52016-10-05 10:57:49 +0100363#endif /* __unix__ || __APPLE__ __MACH__ */
364
Rich Evans4c091142015-02-02 12:04:10 +0000365static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000366{
367 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000368 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000369 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000370
Rich Evans4c091142015-02-02 12:04:10 +0000371 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000372 {
373 c = *ibuf++;
374 if( c >= '0' && c <= '9' )
375 c -= '0';
376 else if( c >= 'a' && c <= 'f' )
377 c -= 'a' - 10;
378 else if( c >= 'A' && c <= 'F' )
379 c -= 'A' - 10;
380 else
381 assert( 0 );
382
383 c2 = *ibuf++;
384 if( c2 >= '0' && c2 <= '9' )
385 c2 -= '0';
386 else if( c2 >= 'a' && c2 <= 'f' )
387 c2 -= 'a' - 10;
388 else if( c2 >= 'A' && c2 <= 'F' )
389 c2 -= 'A' - 10;
390 else
391 assert( 0 );
392
393 *obuf++ = ( c << 4 ) | c2;
394 }
395
396 return len;
397}
398
Rich Evans42914452015-02-02 12:09:25 +0000399static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000400{
401 unsigned char l, h;
402
Rich Evans42914452015-02-02 12:09:25 +0000403 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000404 {
Rich Evans42914452015-02-02 12:09:25 +0000405 h = *ibuf / 16;
406 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000407
408 if( h < 10 )
409 *obuf++ = '0' + h;
410 else
411 *obuf++ = 'a' + h - 10;
412
413 if( l < 10 )
414 *obuf++ = '0' + l;
415 else
416 *obuf++ = 'a' + l - 10;
417
418 ++ibuf;
419 len--;
420 }
421}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000422
423/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200424 * Allocate and zeroize a buffer.
425 *
426 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
427 *
428 * For convenience, dies if allocation fails.
429 */
430static unsigned char *zero_alloc( size_t len )
431{
432 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000433 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200434
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200435 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200436 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200437
438 memset( p, 0x00, actual_len );
439
440 return( p );
441}
442
443/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200444 * Allocate and fill a buffer from hex data.
445 *
446 * The buffer is sized exactly as needed. This allows to detect buffer
447 * overruns (including overreads) when running the test suite under valgrind.
448 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200449 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
450 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200451 * For convenience, dies if allocation fails.
452 */
453static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
454{
455 unsigned char *obuf;
456
Rich Evans42914452015-02-02 12:09:25 +0000457 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200458
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200459 if( *olen == 0 )
460 return( zero_alloc( *olen ) );
461
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200462 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200463 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200464
465 (void) unhexify( obuf, ibuf );
466
467 return( obuf );
468}
469
470/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000471 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000472 * Although predictable and often similar on multiple
473 * runs, this does not result in identical random on
474 * each run. So do not use this if the results of a
475 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000476 *
477 * rng_state shall be NULL.
478 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000479static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000480{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200481#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000482 size_t i;
483
Paul Bakker9dcc3222011-03-08 14:16:06 +0000484 if( rng_state != NULL )
485 rng_state = NULL;
486
Paul Bakkera3d195c2011-11-27 21:07:34 +0000487 for( i = 0; i < len; ++i )
488 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200489#else
490 if( rng_state != NULL )
491 rng_state = NULL;
492
493 arc4random_buf( output, len );
494#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000495
496 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000497}
498
499/**
500 * This function only returns zeros
501 *
502 * rng_state shall be NULL.
503 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000504static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000505{
506 if( rng_state != NULL )
507 rng_state = NULL;
508
Paul Bakkera3d195c2011-11-27 21:07:34 +0000509 memset( output, 0, len );
510
Paul Bakker9dcc3222011-03-08 14:16:06 +0000511 return( 0 );
512}
513
514typedef struct
515{
516 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000517 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000518} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000519
520/**
521 * This function returns random based on a buffer it receives.
522 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000523 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100524 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000525 * The number of bytes released from the buffer on each call to
526 * the random function is specified by per_call. (Can be between
527 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000528 *
529 * After the buffer is empty it will return rand();
530 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000531static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000532{
Paul Bakker997bbd12011-03-13 15:45:42 +0000533 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000534 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000535
536 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000537 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000538
Paul Bakkera3d195c2011-11-27 21:07:34 +0000539 use_len = len;
540 if( len > info->length )
541 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000542
Paul Bakkera3d195c2011-11-27 21:07:34 +0000543 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000544 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000545 memcpy( output, info->buf, use_len );
546 info->buf += use_len;
547 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000548 }
549
Paul Bakkera3d195c2011-11-27 21:07:34 +0000550 if( len - use_len > 0 )
551 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
552
553 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000554}
Paul Bakker997bbd12011-03-13 15:45:42 +0000555
556/**
557 * Info structure for the pseudo random function
558 *
559 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000560 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000561 * State( v0, v1 ) should be set to zero.
562 */
563typedef struct
564{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000565 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000566 uint32_t v0, v1;
567} rnd_pseudo_info;
568
569/**
570 * This function returns random based on a pseudo random function.
571 * This means the results should be identical on all systems.
572 * Pseudo random is based on the XTEA encryption algorithm to
573 * generate pseudorandom.
574 *
575 * rng_state shall be a pointer to a rnd_pseudo_info structure.
576 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000577static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000578{
579 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000580 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100581 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000582
583 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000584 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000585
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000586 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000587
588 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000589 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000590 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000591 sum = 0;
592
Paul Bakkera3d195c2011-11-27 21:07:34 +0000593 for( i = 0; i < 32; i++ )
594 {
Rich Evans42914452015-02-02 12:09:25 +0000595 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
596 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000597 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000598 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
599 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000600 }
601
Paul Bakker5c2364c2012-10-01 14:41:15 +0000602 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100603 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000604 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100605 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000606 }
607
Paul Bakkera3d195c2011-11-27 21:07:34 +0000608 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000609}
SimonB0269dad2016-02-17 23:34:30 +0000610
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100611int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100612{
613 int ret = 0;
614 uint32_t i = 0;
615
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100616 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100617 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100618
619 for( i = 0; i < a_len; i++ )
620 {
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100621 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100622 {
623 ret = -1;
624 break;
625 }
626 }
627 return ret;
628}
629