blob: fa23d3362a8f5f36e26c452291c8f57a9f7560f7 [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
Ronald Cron4b8b1992020-06-09 13:52:23 +02005#include <test/macros.h>
6
Simon Butcheredb7fd92016-05-17 13:35:51 +01007#include <stdlib.h>
8
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02009#if defined(MBEDTLS_PLATFORM_C)
Manuel Pégourié-Gonnard7f809972015-03-09 17:05:11 +000010#include "mbedtls/platform.h"
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020011#else
Rich Evans00ab4702015-02-06 13:43:58 +000012#include <stdio.h>
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020013#define mbedtls_fprintf fprintf
Simon Butcher25731362016-09-30 13:11:29 +010014#define mbedtls_snprintf snprintf
15#define mbedtls_calloc calloc
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020016#define mbedtls_free free
17#define mbedtls_exit exit
Simon Butcherb2d5dd12016-04-27 13:35:37 +010018#define mbedtls_time time
19#define mbedtls_time_t time_t
Janos Follath55abc212016-04-18 18:18:48 +010020#define MBEDTLS_EXIT_SUCCESS EXIT_SUCCESS
21#define MBEDTLS_EXIT_FAILURE EXIT_FAILURE
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020022#endif
23
SimonB0269dad2016-02-17 23:34:30 +000024#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
25#include "mbedtls/memory_buffer_alloc.h"
26#endif
27
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050028#if defined(MBEDTLS_CHECK_PARAMS)
29#include "mbedtls/platform_util.h"
30#include <setjmp.h>
31#endif
32
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033#ifdef _MSC_VER
34#include <basetsd.h>
Azim Khan0fa35042018-06-22 11:34:33 +010035typedef UINT8 uint8_t;
36typedef INT32 int32_t;
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000037typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000038#define strncasecmp _strnicmp
39#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000040#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020041#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000042#endif
43
Paul Bakker19343182013-08-16 13:31:10 +020044#include <string.h>
45
Janos Follath8ca53b52016-10-05 10:57:49 +010046#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
47#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000048#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010049#endif
SimonB0269dad2016-02-17 23:34:30 +000050
Azim Khand30ca132017-06-09 04:32:58 +010051/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +010052typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +010053{
54 uint8_t * x;
55 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +010056} data_t;
Azim Khand30ca132017-06-09 04:32:58 +010057
SimonB0269dad2016-02-17 23:34:30 +000058/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +010059/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +000060
Azim Khan62a5d7d2018-06-29 10:02:54 +010061#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
62#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
63#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +010064
Azim Khan62a5d7d2018-06-29 10:02:54 +010065#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
66#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
67#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
68#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
69 Only int, string, binary data
70 and integer expressions are
71 allowed */
72#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
73 build */
SimonB0269dad2016-02-17 23:34:30 +000074
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050075typedef enum
76{
77 PARAMFAIL_TESTSTATE_IDLE = 0, /* No parameter failure call test */
78 PARAMFAIL_TESTSTATE_PENDING, /* Test call to the parameter failure
79 * is pending */
80 PARAMFAIL_TESTSTATE_CALLED /* The test call to the parameter
81 * failure function has been made */
82} paramfail_test_state_t;
83
SimonB0269dad2016-02-17 23:34:30 +000084
85/*----------------------------------------------------------------------------*/
86/* Macros */
87
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050088/**
89 * \brief This macro tests the expression passed to it as a test step or
90 * individual test in a test case.
Gilles Peskine8954d0c2018-09-27 13:51:25 +020091 *
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050092 * It allows a library function to return a value and return an error
93 * code that can be tested.
Gilles Peskine8954d0c2018-09-27 13:51:25 +020094 *
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050095 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
96 * callback, MBEDTLS_PARAM_FAILED(), will be assumed to be a test
97 * failure.
Gilles Peskine8954d0c2018-09-27 13:51:25 +020098 *
Andrzej Kurekc470b6b2019-01-31 08:20:20 -050099 * This macro is not suitable for negative parameter validation tests,
100 * as it assumes the test step will not create an error.
101 *
Jaeden Amero67ea2c52019-02-11 12:05:54 +0000102 * Failing the test means:
103 * - Mark this test case as failed.
104 * - Print a message identifying the failure.
105 * - Jump to the \c exit label.
106 *
107 * This macro expands to an instruction, not an expression.
108 * It may jump to the \c exit label.
109 *
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500110 * \param TEST The test expression to be tested.
Gilles Peskine8954d0c2018-09-27 13:51:25 +0200111 */
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500112#define TEST_ASSERT( TEST ) \
113 do { \
114 if( ! (TEST) ) \
115 { \
116 test_fail( #TEST, __LINE__, __FILE__ ); \
117 goto exit; \
118 } \
SimonB0269dad2016-02-17 23:34:30 +0000119 } while( 0 )
120
Gilles Peskine5f7aeee2018-12-17 23:26:52 +0100121/** Evaluate two expressions and fail the test case if they have different
122 * values.
123 *
124 * \param expr1 An expression to evaluate.
125 * \param expr2 The expected value of \p expr1. This can be any
126 * expression, but it is typically a constant.
127 */
128#define TEST_EQUAL( expr1, expr2 ) \
129 TEST_ASSERT( ( expr1 ) == ( expr2 ) )
130
Gilles Peskineb75125c2018-09-27 13:52:16 +0200131/** Allocate memory dynamically and fail the test case if this fails.
132 *
133 * You must set \p pointer to \c NULL before calling this macro and
134 * put `mbedtls_free( pointer )` in the test's cleanup code.
135 *
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100136 * If \p length is zero, the resulting \p pointer will be \c NULL.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200137 * This is usually what we want in tests since API functions are
138 * supposed to accept null pointers when a buffer size is zero.
139 *
140 * This macro expands to an instruction, not an expression.
141 * It may jump to the \c exit label.
142 *
143 * \param pointer An lvalue where the address of the allocated buffer
144 * will be stored.
145 * This expression may be evaluated multiple times.
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100146 * \param length Number of elements to allocate.
Gilles Peskineb75125c2018-09-27 13:52:16 +0200147 * This expression may be evaluated multiple times.
148 *
149 */
Gilles Peskine7f6e3a82018-11-30 18:51:45 +0100150#define ASSERT_ALLOC( pointer, length ) \
151 do \
152 { \
153 TEST_ASSERT( ( pointer ) == NULL ); \
154 if( ( length ) != 0 ) \
155 { \
156 ( pointer ) = mbedtls_calloc( sizeof( *( pointer ) ), \
157 ( length ) ); \
158 TEST_ASSERT( ( pointer ) != NULL ); \
159 } \
160 } \
Gilles Peskineb75125c2018-09-27 13:52:16 +0200161 while( 0 )
162
Gilles Peskine292672e2020-01-21 16:20:04 +0100163/** Allocate memory dynamically. If the allocation fails, skip the test case.
Gilles Peskine2cd8ecc2019-03-04 17:13:43 +0100164 *
165 * This macro behaves like #ASSERT_ALLOC, except that if the allocation
Gilles Peskine292672e2020-01-21 16:20:04 +0100166 * fails, it marks the test as skipped rather than failed.
Gilles Peskine2cd8ecc2019-03-04 17:13:43 +0100167 */
168#define ASSERT_ALLOC_WEAK( pointer, length ) \
169 do \
170 { \
171 TEST_ASSERT( ( pointer ) == NULL ); \
172 if( ( length ) != 0 ) \
173 { \
174 ( pointer ) = mbedtls_calloc( sizeof( *( pointer ) ), \
175 ( length ) ); \
Gilles Peskine292672e2020-01-21 16:20:04 +0100176 TEST_ASSUME( ( pointer ) != NULL ); \
Gilles Peskine2cd8ecc2019-03-04 17:13:43 +0100177 } \
178 } \
179 while( 0 )
180
Gilles Peskine3c225962018-09-27 13:56:31 +0200181/** Compare two buffers and fail the test case if they differ.
182 *
183 * This macro expands to an instruction, not an expression.
184 * It may jump to the \c exit label.
185 *
186 * \param p1 Pointer to the start of the first buffer.
187 * \param size1 Size of the first buffer in bytes.
188 * This expression may be evaluated multiple times.
189 * \param p2 Pointer to the start of the second buffer.
190 * \param size2 Size of the second buffer in bytes.
191 * This expression may be evaluated multiple times.
192 */
193#define ASSERT_COMPARE( p1, size1, p2, size2 ) \
194 do \
195 { \
196 TEST_ASSERT( ( size1 ) == ( size2 ) ); \
197 if( ( size1 ) != 0 ) \
198 TEST_ASSERT( memcmp( ( p1 ), ( p2 ), ( size1 ) ) == 0 ); \
199 } \
200 while( 0 )
201
Hanno Beckere69d0152019-07-05 13:31:30 +0100202/**
203 * \brief This macro tests the expression passed to it and skips the
204 * running test if it doesn't evaluate to 'true'.
205 *
206 * \param TEST The test expression to be tested.
207 */
208#define TEST_ASSUME( TEST ) \
209 do { \
210 if( ! (TEST) ) \
211 { \
212 test_skip( #TEST, __LINE__, __FILE__ ); \
213 goto exit; \
214 } \
215 } while( 0 )
216
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500217#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
218/**
219 * \brief This macro tests the statement passed to it as a test step or
220 * individual test in a test case. The macro assumes the test will fail
221 * and will generate an error.
222 *
223 * It allows a library function to return a value and tests the return
224 * code on return to confirm the given error code was returned.
225 *
226 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
227 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
228 * expected failure, and the test will pass.
229 *
230 * This macro is intended for negative parameter validation tests,
231 * where the failing function may return an error value or call
232 * MBEDTLS_PARAM_FAILED() to indicate the error.
233 *
234 * \param PARAM_ERROR_VALUE The expected error code.
235 *
236 * \param TEST The test expression to be tested.
237 */
238#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
239 do { \
240 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
241 if( (TEST) != (PARAM_ERR_VALUE) || \
242 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
243 { \
244 test_fail( #TEST, __LINE__, __FILE__ ); \
245 goto exit; \
246 } \
247 } while( 0 )
248
249/**
250 * \brief This macro tests the statement passed to it as a test step or
251 * individual test in a test case. The macro assumes the test will fail
252 * and will generate an error.
253 *
254 * It assumes the library function under test cannot return a value and
255 * assumes errors can only be indicated byt calls to
256 * MBEDTLS_PARAM_FAILED().
257 *
258 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
259 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
260 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
261 * can be made.
262 *
263 * This macro is intended for negative parameter validation tests,
264 * where the failing function can only return an error by calling
265 * MBEDTLS_PARAM_FAILED() to indicate the error.
266 *
267 * \param TEST The test expression to be tested.
268 */
269#define TEST_INVALID_PARAM( TEST ) \
270 do { \
271 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
272 if( setjmp( param_fail_jmp ) == 0 ) \
273 { \
274 TEST; \
275 test_fail( #TEST, __LINE__, __FILE__ ); \
276 goto exit; \
277 } \
278 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
279 } while( 0 )
280#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
281
282/**
283 * \brief This macro tests the statement passed to it as a test step or
284 * individual test in a test case. The macro assumes the test will not fail.
285 *
286 * It assumes the library function under test cannot return a value and
287 * assumes errors can only be indicated by calls to
288 * MBEDTLS_PARAM_FAILED().
289 *
290 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
291 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
292 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
293 * can be made.
294 *
295 * This macro is intended to test that functions returning void
296 * accept all of the parameter values they're supposed to accept - eg
297 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
298 * that's allowed to be NULL happens to be NULL.
299 *
300 * Note: for functions that return something other that void,
301 * checking that they accept all the parameters they're supposed to
302 * accept is best done by using TEST_ASSERT() and checking the return
303 * value as well.
304 *
305 * Note: this macro is available even when #MBEDTLS_CHECK_PARAMS is
306 * disabled, as it makes sense to check that the functions accept all
307 * legal values even if this option is disabled - only in that case,
308 * the test is more about whether the function segfaults than about
309 * whether it invokes MBEDTLS_PARAM_FAILED().
310 *
311 * \param TEST The test expression to be tested.
312 */
313#define TEST_VALID_PARAM( TEST ) \
314 TEST_ASSERT( ( TEST, 1 ) );
315
Gilles Peskine28405302018-09-27 13:52:16 +0200316/** Allocate memory dynamically and fail the test case if this fails.
317 *
318 * You must set \p pointer to \c NULL before calling this macro and
319 * put `mbedtls_free( pointer )` in the test's cleanup code.
320 *
Gilles Peskine6608e712018-11-30 18:51:45 +0100321 * If \p length is zero, the resulting \p pointer will be \c NULL.
Gilles Peskine28405302018-09-27 13:52:16 +0200322 * This is usually what we want in tests since API functions are
323 * supposed to accept null pointers when a buffer size is zero.
324 *
325 * This macro expands to an instruction, not an expression.
326 * It may jump to the \c exit label.
327 *
328 * \param pointer An lvalue where the address of the allocated buffer
329 * will be stored.
330 * This expression may be evaluated multiple times.
Gilles Peskine6608e712018-11-30 18:51:45 +0100331 * \param length Number of elements to allocate.
Gilles Peskine28405302018-09-27 13:52:16 +0200332 * This expression may be evaluated multiple times.
333 *
334 */
Gilles Peskine6608e712018-11-30 18:51:45 +0100335#define ASSERT_ALLOC( pointer, length ) \
336 do \
337 { \
338 TEST_ASSERT( ( pointer ) == NULL ); \
339 if( ( length ) != 0 ) \
340 { \
341 ( pointer ) = mbedtls_calloc( sizeof( *( pointer ) ), \
342 ( length ) ); \
343 TEST_ASSERT( ( pointer ) != NULL ); \
344 } \
345 } \
Gilles Peskine28405302018-09-27 13:52:16 +0200346 while( 0 )
347
SimonB0269dad2016-02-17 23:34:30 +0000348/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100349/* Global variables */
350
Hanno Beckere69d0152019-07-05 13:31:30 +0100351typedef enum
352{
353 TEST_RESULT_SUCCESS = 0,
354 TEST_RESULT_FAILED,
355 TEST_RESULT_SKIPPED
356} test_result_t;
357
Gilles Peskine47b75402019-09-16 15:12:51 +0200358typedef struct
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100359{
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500360 paramfail_test_state_t paramfail_test_state;
Hanno Beckere69d0152019-07-05 13:31:30 +0100361 test_result_t result;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100362 const char *test;
363 const char *filename;
364 int line_no;
Gilles Peskine56055912019-03-01 14:26:30 +0100365 unsigned long step;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100366}
Gilles Peskine47b75402019-09-16 15:12:51 +0200367test_info_t;
368static test_info_t test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100369
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400370#if defined(MBEDTLS_PLATFORM_C)
Ronald Cronf91c4952020-05-27 16:22:17 +0200371static mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400372#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100373
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500374#if defined(MBEDTLS_CHECK_PARAMS)
375jmp_buf param_fail_jmp;
376jmp_buf jmp_tmp;
377#endif
378
SimonB8ca7bc42016-04-17 23:24:50 +0100379/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100380/* Helper flags for complex dependencies */
381
382/* Indicates whether we expect mbedtls_entropy_init
383 * to initialize some strong entropy source. */
384#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
385 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
386 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
387 defined(MBEDTLS_HAVEGE_C) || \
388 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
389 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100390#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100391#endif
392
393
394/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000395/* Helper Functions */
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500396
Gilles Peskine56055912019-03-01 14:26:30 +0100397/** Set the test step number for failure reports.
398 *
399 * Call this function to display "step NNN" in addition to the line number
400 * and file name if a test fails. Typically the "step number" is the index
401 * of a for loop but it can be whatever you want.
402 *
403 * \param step The step number to report.
404 */
405void test_set_step( unsigned long step )
406{
407 test_info.step = step;
408}
409
Simon Butcherecff2192018-10-03 16:17:41 +0100410void test_fail( const char *test, int line_no, const char* filename )
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500411{
Hanno Beckere69d0152019-07-05 13:31:30 +0100412 test_info.result = TEST_RESULT_FAILED;
413 test_info.test = test;
414 test_info.line_no = line_no;
415 test_info.filename = filename;
416}
417
418void test_skip( const char *test, int line_no, const char* filename )
419{
420 test_info.result = TEST_RESULT_SKIPPED;
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500421 test_info.test = test;
422 test_info.line_no = line_no;
423 test_info.filename = filename;
424}
425
Ronald Cronf91c4952020-05-27 16:22:17 +0200426int platform_setup()
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400427{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400428 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400429#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400430 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400431#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400432 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400433}
434
Ronald Cronf91c4952020-05-27 16:22:17 +0200435void platform_teardown()
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400436{
437#if defined(MBEDTLS_PLATFORM_C)
438 mbedtls_platform_teardown( &platform_ctx );
439#endif /* MBEDTLS_PLATFORM_C */
440}
SimonB0269dad2016-02-17 23:34:30 +0000441
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500442#if defined(MBEDTLS_CHECK_PARAMS)
443void mbedtls_param_failed( const char *failure_condition,
444 const char *file,
445 int line )
446{
447 /* If we are testing the callback function... */
448 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
449 {
450 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
451 }
452 else
453 {
454 /* ...else we treat this as an error */
455
456 /* Record the location of the failure, but not as a failure yet, in case
457 * it was part of the test */
458 test_fail( failure_condition, line, file );
Hanno Beckere69d0152019-07-05 13:31:30 +0100459 test_info.result = TEST_RESULT_SUCCESS;
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500460
461 longjmp( param_fail_jmp, 1 );
462 }
463}
464#endif
465
Janos Follath8ca53b52016-10-05 10:57:49 +0100466#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
467static int redirect_output( FILE** out_stream, const char* path )
468{
469 int stdout_fd = dup( fileno( *out_stream ) );
470
471 if( stdout_fd == -1 )
472 {
473 return -1;
474 }
475
476 fflush( *out_stream );
477 fclose( *out_stream );
478 *out_stream = fopen( path, "w" );
479
480 if( *out_stream == NULL )
481 {
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500482 close( stdout_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100483 return -1;
484 }
485
486 return stdout_fd;
487}
488
489static int restore_output( FILE** out_stream, int old_fd )
490{
491 fflush( *out_stream );
492 fclose( *out_stream );
493
494 *out_stream = fdopen( old_fd, "w" );
495 if( *out_stream == NULL )
496 {
497 return -1;
498 }
499
500 return 0;
501}
Simon Butchere0192962016-10-12 23:07:30 +0100502
Janos Follathe709f7c2016-10-13 11:26:29 +0100503static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100504{
Janos Follathe709f7c2016-10-13 11:26:29 +0100505 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100506}
Janos Follath8ca53b52016-10-05 10:57:49 +0100507#endif /* __unix__ || __APPLE__ __MACH__ */
508
Simon Butcherecff2192018-10-03 16:17:41 +0100509int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000510{
511 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000512 int len = strlen( ibuf ) / 2;
Gilles Peskine9e23bea2019-06-07 14:52:07 +0200513 TEST_HELPER_ASSERT( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000514
Rich Evans4c091142015-02-02 12:04:10 +0000515 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000516 {
517 c = *ibuf++;
518 if( c >= '0' && c <= '9' )
519 c -= '0';
520 else if( c >= 'a' && c <= 'f' )
521 c -= 'a' - 10;
522 else if( c >= 'A' && c <= 'F' )
523 c -= 'A' - 10;
524 else
Gilles Peskine9e23bea2019-06-07 14:52:07 +0200525 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000526
527 c2 = *ibuf++;
528 if( c2 >= '0' && c2 <= '9' )
529 c2 -= '0';
530 else if( c2 >= 'a' && c2 <= 'f' )
531 c2 -= 'a' - 10;
532 else if( c2 >= 'A' && c2 <= 'F' )
533 c2 -= 'A' - 10;
534 else
Gilles Peskine9e23bea2019-06-07 14:52:07 +0200535 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000536
537 *obuf++ = ( c << 4 ) | c2;
538 }
539
540 return len;
541}
542
Simon Butcherecff2192018-10-03 16:17:41 +0100543void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000544{
545 unsigned char l, h;
546
Rich Evans42914452015-02-02 12:09:25 +0000547 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000548 {
Rich Evans42914452015-02-02 12:09:25 +0000549 h = *ibuf / 16;
550 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000551
552 if( h < 10 )
553 *obuf++ = '0' + h;
554 else
555 *obuf++ = 'a' + h - 10;
556
557 if( l < 10 )
558 *obuf++ = '0' + l;
559 else
560 *obuf++ = 'a' + l - 10;
561
562 ++ibuf;
563 len--;
564 }
565}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000566
567/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200568 * Allocate and zeroize a buffer.
569 *
570 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
571 *
572 * For convenience, dies if allocation fails.
573 */
Ronald Cronf91c4952020-05-27 16:22:17 +0200574unsigned char *zero_alloc( size_t len )
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200575{
576 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000577 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200578
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200579 p = mbedtls_calloc( 1, actual_len );
Gilles Peskine9e23bea2019-06-07 14:52:07 +0200580 TEST_HELPER_ASSERT( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200581
582 memset( p, 0x00, actual_len );
583
584 return( p );
585}
586
587/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200588 * Allocate and fill a buffer from hex data.
589 *
590 * The buffer is sized exactly as needed. This allows to detect buffer
591 * overruns (including overreads) when running the test suite under valgrind.
592 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200593 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
594 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200595 * For convenience, dies if allocation fails.
596 */
Simon Butcherecff2192018-10-03 16:17:41 +0100597unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200598{
599 unsigned char *obuf;
600
Rich Evans42914452015-02-02 12:09:25 +0000601 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200602
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200603 if( *olen == 0 )
604 return( zero_alloc( *olen ) );
605
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200606 obuf = mbedtls_calloc( 1, *olen );
Gilles Peskine9e23bea2019-06-07 14:52:07 +0200607 TEST_HELPER_ASSERT( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200608
609 (void) unhexify( obuf, ibuf );
610
611 return( obuf );
612}
613
614/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000615 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000616 * Although predictable and often similar on multiple
617 * runs, this does not result in identical random on
618 * each run. So do not use this if the results of a
619 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000620 *
621 * rng_state shall be NULL.
622 */
Ronald Cronf91c4952020-05-27 16:22:17 +0200623int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000624{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200625#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000626 size_t i;
627
Paul Bakker9dcc3222011-03-08 14:16:06 +0000628 if( rng_state != NULL )
629 rng_state = NULL;
630
Paul Bakkera3d195c2011-11-27 21:07:34 +0000631 for( i = 0; i < len; ++i )
632 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200633#else
634 if( rng_state != NULL )
635 rng_state = NULL;
636
637 arc4random_buf( output, len );
638#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000639
640 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000641}
642
643/**
644 * This function only returns zeros
645 *
646 * rng_state shall be NULL.
647 */
Simon Butcherecff2192018-10-03 16:17:41 +0100648int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000649{
650 if( rng_state != NULL )
651 rng_state = NULL;
652
Paul Bakkera3d195c2011-11-27 21:07:34 +0000653 memset( output, 0, len );
654
Paul Bakker9dcc3222011-03-08 14:16:06 +0000655 return( 0 );
656}
657
658typedef struct
659{
660 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000661 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000662} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000663
664/**
665 * This function returns random based on a buffer it receives.
666 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000667 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100668 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000669 * The number of bytes released from the buffer on each call to
670 * the random function is specified by per_call. (Can be between
671 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000672 *
673 * After the buffer is empty it will return rand();
674 */
Simon Butcherecff2192018-10-03 16:17:41 +0100675int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000676{
Paul Bakker997bbd12011-03-13 15:45:42 +0000677 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000678 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000679
680 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000681 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000682
Paul Bakkera3d195c2011-11-27 21:07:34 +0000683 use_len = len;
684 if( len > info->length )
685 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000686
Paul Bakkera3d195c2011-11-27 21:07:34 +0000687 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000688 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000689 memcpy( output, info->buf, use_len );
690 info->buf += use_len;
691 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000692 }
693
Paul Bakkera3d195c2011-11-27 21:07:34 +0000694 if( len - use_len > 0 )
695 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
696
697 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000698}
Paul Bakker997bbd12011-03-13 15:45:42 +0000699
700/**
701 * Info structure for the pseudo random function
702 *
703 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000704 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000705 * State( v0, v1 ) should be set to zero.
706 */
707typedef struct
708{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000709 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000710 uint32_t v0, v1;
711} rnd_pseudo_info;
712
713/**
714 * This function returns random based on a pseudo random function.
715 * This means the results should be identical on all systems.
716 * Pseudo random is based on the XTEA encryption algorithm to
717 * generate pseudorandom.
718 *
719 * rng_state shall be a pointer to a rnd_pseudo_info structure.
720 */
Simon Butcherecff2192018-10-03 16:17:41 +0100721int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000722{
723 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000724 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100725 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000726
727 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000728 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000729
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000730 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000731
732 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000733 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000734 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000735 sum = 0;
736
Paul Bakkera3d195c2011-11-27 21:07:34 +0000737 for( i = 0; i < 32; i++ )
738 {
Rich Evans42914452015-02-02 12:09:25 +0000739 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
740 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000741 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000742 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
743 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000744 }
745
Paul Bakker5c2364c2012-10-01 14:41:15 +0000746 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100747 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000748 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100749 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000750 }
751
Paul Bakkera3d195c2011-11-27 21:07:34 +0000752 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000753}
SimonB0269dad2016-02-17 23:34:30 +0000754
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100755int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100756{
757 int ret = 0;
758 uint32_t i = 0;
759
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500760 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100761 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100762
763 for( i = 0; i < a_len; i++ )
764 {
Andrzej Kurekc470b6b2019-01-31 08:20:20 -0500765 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100766 {
767 ret = -1;
768 break;
769 }
770 }
771 return ret;
772}