blob: 5d0a3906d43557d7b1ca6e41ba3a392f2a56e7f6 [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 *
Andrzej Kurek1b20be52019-02-15 10:13:35 -0500100 * Failing the test means:
101 * - Mark this test case as failed.
102 * - Print a message identifying the failure.
103 * - Jump to the \c exit label.
104 *
105 * This macro expands to an instruction, not an expression.
106 * It may jump to the \c exit label.
107 *
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500108 * \param TEST The test expression to be tested.
109 */
110#define TEST_ASSERT( TEST ) \
111 do { \
112 if( ! (TEST) ) \
113 { \
114 test_fail( #TEST, __LINE__, __FILE__ ); \
115 goto exit; \
116 } \
SimonB0269dad2016-02-17 23:34:30 +0000117 } while( 0 )
118
Hanno Beckere69d0152019-07-05 13:31:30 +0100119/**
120 * \brief This macro tests the expression passed to it and skips the
121 * running test if it doesn't evaluate to 'true'.
122 *
123 * \param TEST The test expression to be tested.
124 */
125#define TEST_ASSUME( TEST ) \
126 do { \
127 if( ! (TEST) ) \
128 { \
129 test_skip( #TEST, __LINE__, __FILE__ ); \
130 goto exit; \
131 } \
132 } while( 0 )
133
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500134#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
135/**
136 * \brief This macro tests the statement passed to it as a test step or
137 * individual test in a test case. The macro assumes the test will fail
138 * and will generate an error.
139 *
140 * It allows a library function to return a value and tests the return
141 * code on return to confirm the given error code was returned.
142 *
143 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
144 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
145 * expected failure, and the test will pass.
146 *
147 * This macro is intended for negative parameter validation tests,
148 * where the failing function may return an error value or call
149 * MBEDTLS_PARAM_FAILED() to indicate the error.
150 *
151 * \param PARAM_ERROR_VALUE The expected error code.
152 *
153 * \param TEST The test expression to be tested.
154 */
155#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
156 do { \
157 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
158 if( (TEST) != (PARAM_ERR_VALUE) || \
159 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
160 { \
161 test_fail( #TEST, __LINE__, __FILE__ ); \
162 goto exit; \
163 } \
164 } while( 0 )
165
166/**
167 * \brief This macro tests the statement passed to it as a test step or
168 * individual test in a test case. The macro assumes the test will fail
169 * and will generate an error.
170 *
171 * It assumes the library function under test cannot return a value and
172 * assumes errors can only be indicated byt calls to
173 * MBEDTLS_PARAM_FAILED().
174 *
175 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
176 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
177 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
178 * can be made.
179 *
180 * This macro is intended for negative parameter validation tests,
181 * where the failing function can only return an error by calling
182 * MBEDTLS_PARAM_FAILED() to indicate the error.
183 *
184 * \param TEST The test expression to be tested.
185 */
186#define TEST_INVALID_PARAM( TEST ) \
187 do { \
188 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
189 if( setjmp( param_fail_jmp ) == 0 ) \
190 { \
191 TEST; \
192 test_fail( #TEST, __LINE__, __FILE__ ); \
193 goto exit; \
194 } \
195 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
196 } while( 0 )
197#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
198
199/**
200 * \brief This macro tests the statement passed to it as a test step or
201 * individual test in a test case. The macro assumes the test will not fail.
202 *
203 * It assumes the library function under test cannot return a value and
204 * assumes errors can only be indicated by calls to
205 * MBEDTLS_PARAM_FAILED().
206 *
207 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
208 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
209 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
210 * can be made.
211 *
212 * This macro is intended to test that functions returning void
213 * accept all of the parameter values they're supposed to accept - eg
214 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
215 * that's allowed to be NULL happens to be NULL.
216 *
217 * Note: for functions that return something other that void,
218 * checking that they accept all the parameters they're supposed to
219 * accept is best done by using TEST_ASSERT() and checking the return
220 * value as well.
221 *
222 * Note: this macro is available even when #MBEDTLS_CHECK_PARAMS is
223 * disabled, as it makes sense to check that the functions accept all
224 * legal values even if this option is disabled - only in that case,
225 * the test is more about whether the function segfaults than about
226 * whether it invokes MBEDTLS_PARAM_FAILED().
227 *
228 * \param TEST The test expression to be tested.
229 */
230#define TEST_VALID_PARAM( TEST ) \
231 TEST_ASSERT( ( TEST, 1 ) );
232
Gilles Peskinee7655df2019-06-07 14:52:07 +0200233#define TEST_HELPER_ASSERT(a) if( !( a ) ) \
Rich Evans4c091142015-02-02 12:04:10 +0000234{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200235 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000236 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200237 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000238}
239
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000240/*
241 * 32-bit integer manipulation macros (big endian)
242 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000243#ifndef GET_UINT32_BE
244#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000245{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000246 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
247 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
248 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
249 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000250}
251#endif
252
Paul Bakker5c2364c2012-10-01 14:41:15 +0000253#ifndef PUT_UINT32_BE
254#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000255{ \
256 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
257 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
258 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
259 (b)[(i) + 3] = (unsigned char) ( (n) ); \
260}
261#endif
262
SimonB0269dad2016-02-17 23:34:30 +0000263
264/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100265/* Global variables */
266
Hanno Beckere69d0152019-07-05 13:31:30 +0100267typedef enum
268{
269 TEST_RESULT_SUCCESS = 0,
270 TEST_RESULT_FAILED,
271 TEST_RESULT_SKIPPED
272} test_result_t;
273
Gilles Peskine47b75402019-09-16 15:12:51 +0200274typedef struct
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100275{
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500276 paramfail_test_state_t paramfail_test_state;
Hanno Beckere69d0152019-07-05 13:31:30 +0100277 test_result_t result;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100278 const char *test;
279 const char *filename;
280 int line_no;
281}
Gilles Peskine47b75402019-09-16 15:12:51 +0200282test_info_t;
283static test_info_t test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100284
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400285#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400286mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400287#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100288
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500289#if defined(MBEDTLS_CHECK_PARAMS)
290jmp_buf param_fail_jmp;
291jmp_buf jmp_tmp;
292#endif
293
SimonB8ca7bc42016-04-17 23:24:50 +0100294/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100295/* Helper flags for complex dependencies */
296
297/* Indicates whether we expect mbedtls_entropy_init
298 * to initialize some strong entropy source. */
299#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
300 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
301 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
302 defined(MBEDTLS_HAVEGE_C) || \
303 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
304 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100305#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100306#endif
307
308
309/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000310/* Helper Functions */
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500311
Simon Butcherecff2192018-10-03 16:17:41 +0100312void test_fail( const char *test, int line_no, const char* filename )
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500313{
Hanno Beckere69d0152019-07-05 13:31:30 +0100314 test_info.result = TEST_RESULT_FAILED;
315 test_info.test = test;
316 test_info.line_no = line_no;
317 test_info.filename = filename;
318}
319
320void test_skip( const char *test, int line_no, const char* filename )
321{
322 test_info.result = TEST_RESULT_SKIPPED;
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500323 test_info.test = test;
324 test_info.line_no = line_no;
325 test_info.filename = filename;
326}
327
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400328static int platform_setup()
329{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400330 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400331#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400332 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400333#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400334 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400335}
336
337static void platform_teardown()
338{
339#if defined(MBEDTLS_PLATFORM_C)
340 mbedtls_platform_teardown( &platform_ctx );
341#endif /* MBEDTLS_PLATFORM_C */
342}
SimonB0269dad2016-02-17 23:34:30 +0000343
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500344#if defined(MBEDTLS_CHECK_PARAMS)
345void mbedtls_param_failed( const char *failure_condition,
346 const char *file,
347 int line )
348{
349 /* If we are testing the callback function... */
350 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
351 {
352 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
353 }
354 else
355 {
356 /* ...else we treat this as an error */
357
358 /* Record the location of the failure, but not as a failure yet, in case
359 * it was part of the test */
360 test_fail( failure_condition, line, file );
Hanno Beckere69d0152019-07-05 13:31:30 +0100361 test_info.result = TEST_RESULT_SUCCESS;
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500362
363 longjmp( param_fail_jmp, 1 );
364 }
365}
366#endif
367
Janos Follath8ca53b52016-10-05 10:57:49 +0100368#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
369static int redirect_output( FILE** out_stream, const char* path )
370{
371 int stdout_fd = dup( fileno( *out_stream ) );
372
373 if( stdout_fd == -1 )
374 {
375 return -1;
376 }
377
378 fflush( *out_stream );
379 fclose( *out_stream );
380 *out_stream = fopen( path, "w" );
381
382 if( *out_stream == NULL )
383 {
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500384 close( stdout_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100385 return -1;
386 }
387
388 return stdout_fd;
389}
390
391static int restore_output( FILE** out_stream, int old_fd )
392{
393 fflush( *out_stream );
394 fclose( *out_stream );
395
396 *out_stream = fdopen( old_fd, "w" );
397 if( *out_stream == NULL )
398 {
399 return -1;
400 }
401
402 return 0;
403}
Simon Butchere0192962016-10-12 23:07:30 +0100404
Janos Follathe709f7c2016-10-13 11:26:29 +0100405static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100406{
Janos Follathe709f7c2016-10-13 11:26:29 +0100407 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100408}
Janos Follath8ca53b52016-10-05 10:57:49 +0100409#endif /* __unix__ || __APPLE__ __MACH__ */
410
Simon Butcherecff2192018-10-03 16:17:41 +0100411int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000412{
413 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000414 int len = strlen( ibuf ) / 2;
Gilles Peskinee7655df2019-06-07 14:52:07 +0200415 TEST_HELPER_ASSERT( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000416
Rich Evans4c091142015-02-02 12:04:10 +0000417 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000418 {
419 c = *ibuf++;
420 if( c >= '0' && c <= '9' )
421 c -= '0';
422 else if( c >= 'a' && c <= 'f' )
423 c -= 'a' - 10;
424 else if( c >= 'A' && c <= 'F' )
425 c -= 'A' - 10;
426 else
Gilles Peskinee7655df2019-06-07 14:52:07 +0200427 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000428
429 c2 = *ibuf++;
430 if( c2 >= '0' && c2 <= '9' )
431 c2 -= '0';
432 else if( c2 >= 'a' && c2 <= 'f' )
433 c2 -= 'a' - 10;
434 else if( c2 >= 'A' && c2 <= 'F' )
435 c2 -= 'A' - 10;
436 else
Gilles Peskinee7655df2019-06-07 14:52:07 +0200437 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000438
439 *obuf++ = ( c << 4 ) | c2;
440 }
441
442 return len;
443}
444
Simon Butcherecff2192018-10-03 16:17:41 +0100445void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000446{
447 unsigned char l, h;
448
Rich Evans42914452015-02-02 12:09:25 +0000449 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000450 {
Rich Evans42914452015-02-02 12:09:25 +0000451 h = *ibuf / 16;
452 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000453
454 if( h < 10 )
455 *obuf++ = '0' + h;
456 else
457 *obuf++ = 'a' + h - 10;
458
459 if( l < 10 )
460 *obuf++ = '0' + l;
461 else
462 *obuf++ = 'a' + l - 10;
463
464 ++ibuf;
465 len--;
466 }
467}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000468
469/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200470 * Allocate and zeroize a buffer.
471 *
472 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
473 *
474 * For convenience, dies if allocation fails.
475 */
476static unsigned char *zero_alloc( size_t len )
477{
478 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000479 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200480
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200481 p = mbedtls_calloc( 1, actual_len );
Gilles Peskinee7655df2019-06-07 14:52:07 +0200482 TEST_HELPER_ASSERT( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200483
484 memset( p, 0x00, actual_len );
485
486 return( p );
487}
488
489/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200490 * Allocate and fill a buffer from hex data.
491 *
492 * The buffer is sized exactly as needed. This allows to detect buffer
493 * overruns (including overreads) when running the test suite under valgrind.
494 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200495 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
496 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200497 * For convenience, dies if allocation fails.
498 */
Simon Butcherecff2192018-10-03 16:17:41 +0100499unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200500{
501 unsigned char *obuf;
502
Rich Evans42914452015-02-02 12:09:25 +0000503 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200504
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200505 if( *olen == 0 )
506 return( zero_alloc( *olen ) );
507
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200508 obuf = mbedtls_calloc( 1, *olen );
Gilles Peskinee7655df2019-06-07 14:52:07 +0200509 TEST_HELPER_ASSERT( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200510
511 (void) unhexify( obuf, ibuf );
512
513 return( obuf );
514}
515
516/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000517 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000518 * Although predictable and often similar on multiple
519 * runs, this does not result in identical random on
520 * each run. So do not use this if the results of a
521 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000522 *
523 * rng_state shall be NULL.
524 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000525static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000526{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200527#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000528 size_t i;
529
Paul Bakker9dcc3222011-03-08 14:16:06 +0000530 if( rng_state != NULL )
531 rng_state = NULL;
532
Paul Bakkera3d195c2011-11-27 21:07:34 +0000533 for( i = 0; i < len; ++i )
534 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200535#else
536 if( rng_state != NULL )
537 rng_state = NULL;
538
539 arc4random_buf( output, len );
540#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000541
542 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000543}
544
545/**
546 * This function only returns zeros
547 *
548 * rng_state shall be NULL.
549 */
Simon Butcherecff2192018-10-03 16:17:41 +0100550int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000551{
552 if( rng_state != NULL )
553 rng_state = NULL;
554
Paul Bakkera3d195c2011-11-27 21:07:34 +0000555 memset( output, 0, len );
556
Paul Bakker9dcc3222011-03-08 14:16:06 +0000557 return( 0 );
558}
559
560typedef struct
561{
562 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000563 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000564} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000565
566/**
567 * This function returns random based on a buffer it receives.
568 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000569 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100570 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000571 * The number of bytes released from the buffer on each call to
572 * the random function is specified by per_call. (Can be between
573 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000574 *
575 * After the buffer is empty it will return rand();
576 */
Simon Butcherecff2192018-10-03 16:17:41 +0100577int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000578{
Paul Bakker997bbd12011-03-13 15:45:42 +0000579 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000580 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000581
582 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000583 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000584
Paul Bakkera3d195c2011-11-27 21:07:34 +0000585 use_len = len;
586 if( len > info->length )
587 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000588
Paul Bakkera3d195c2011-11-27 21:07:34 +0000589 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000590 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000591 memcpy( output, info->buf, use_len );
592 info->buf += use_len;
593 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000594 }
595
Paul Bakkera3d195c2011-11-27 21:07:34 +0000596 if( len - use_len > 0 )
597 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
598
599 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000600}
Paul Bakker997bbd12011-03-13 15:45:42 +0000601
602/**
603 * Info structure for the pseudo random function
604 *
605 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000606 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000607 * State( v0, v1 ) should be set to zero.
608 */
609typedef struct
610{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000611 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000612 uint32_t v0, v1;
613} rnd_pseudo_info;
614
615/**
616 * This function returns random based on a pseudo random function.
617 * This means the results should be identical on all systems.
618 * Pseudo random is based on the XTEA encryption algorithm to
619 * generate pseudorandom.
620 *
621 * rng_state shall be a pointer to a rnd_pseudo_info structure.
622 */
Simon Butcherecff2192018-10-03 16:17:41 +0100623int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000624{
625 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000626 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100627 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000628
629 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000630 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000631
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000632 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000633
634 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000635 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000636 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000637 sum = 0;
638
Paul Bakkera3d195c2011-11-27 21:07:34 +0000639 for( i = 0; i < 32; i++ )
640 {
Rich Evans42914452015-02-02 12:09:25 +0000641 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
642 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000643 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000644 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
645 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000646 }
647
Paul Bakker5c2364c2012-10-01 14:41:15 +0000648 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100649 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000650 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100651 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000652 }
653
Paul Bakkera3d195c2011-11-27 21:07:34 +0000654 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000655}
SimonB0269dad2016-02-17 23:34:30 +0000656
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100657int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100658{
659 int ret = 0;
660 uint32_t i = 0;
661
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500662 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100663 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100664
665 for( i = 0; i < a_len; i++ )
666 {
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500667 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100668 {
669 ret = -1;
670 break;
671 }
672 }
673 return ret;
674}