blob: 4f46ea967db1ac3b6dd5b47524e9a4efaf8218bc [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
Manuel Pégourié-Gonnardf0828472020-08-25 11:26:37 +020049/*
50 * Define the two macros
51 *
52 * #define TEST_CF_SECRET(ptr, size)
53 * #define TEST_CF_PUBLIC(ptr, size)
54 *
55 * that can be used in tests to mark a memory area as secret (no branch or
56 * memory access should depend on it) or public (default, only needs to be
57 * marked explicitly when it was derived from secret data).
58 *
59 * Arguments:
60 * - ptr: a pointer to the memory area to be marked
61 * - size: the size in bytes of the memory area
62 *
63 * Implementation:
64 * The basic idea is that of ctgrind <https://github.com/agl/ctgrind>: we can
65 * re-use tools that were designed for checking use of uninitialized memory.
66 * This file contains two implementations: one based on MemorySanitizer, the
67 * other on valgrind's memcheck. If none of them is enabled, dummy macros that
68 * do nothing are defined for convenience.
69 */
Manuel Pégourié-Gonnarda2377222020-07-28 10:53:06 +020070#if defined(MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN)
71#include <sanitizer/msan_interface.h>
72
73/* Use macros to avoid messing up with origin tracking */
74#define TEST_CF_SECRET __msan_allocated_memory
75// void __msan_allocated_memory(const volatile void* data, size_t size);
76#define TEST_CF_PUBLIC __msan_unpoison
77// void __msan_unpoison(const volatile void *a, size_t size);
78
Manuel Pégourié-Gonnardf0828472020-08-25 11:26:37 +020079#elif defined(MBEDTLS_TEST_CONSTANT_FLOW_VALGRIND)
80#include <valgrind/memcheck.h>
81
82#define TEST_CF_SECRET VALGRIND_MAKE_MEM_UNDEFINED
83// VALGRIND_MAKE_MEM_UNDEFINED(_qzz_addr, _qzz_len)
84#define TEST_CF_PUBLIC VALGRIND_MAKE_MEM_DEFINED
85// VALGRIND_MAKE_MEM_DEFINED(_qzz_addr, _qzz_len)
86
87#else /* MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN ||
88 MBEDTLS_TEST_CONSTANT_FLOW_VALGRIND */
Manuel Pégourié-Gonnarda2377222020-07-28 10:53:06 +020089
90#define TEST_CF_SECRET(ptr, size)
91#define TEST_CF_PUBLIC(ptr, size)
92
93#endif /* MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN */
94
Azim Khand30ca132017-06-09 04:32:58 +010095/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +010096typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +010097{
98 uint8_t * x;
99 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +0100100} data_t;
Azim Khand30ca132017-06-09 04:32:58 +0100101
SimonB0269dad2016-02-17 23:34:30 +0000102/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +0100103/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +0000104
Azim Khan62a5d7d2018-06-29 10:02:54 +0100105#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
106#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
107#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +0100108
Azim Khan62a5d7d2018-06-29 10:02:54 +0100109#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
110#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
111#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
112#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
113 Only int, string, binary data
114 and integer expressions are
115 allowed */
116#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
117 build */
SimonB0269dad2016-02-17 23:34:30 +0000118
Simon Butcher6542f6c2018-12-09 22:09:59 +0000119typedef enum
120{
121 PARAMFAIL_TESTSTATE_IDLE = 0, /* No parameter failure call test */
122 PARAMFAIL_TESTSTATE_PENDING, /* Test call to the parameter failure
123 * is pending */
124 PARAMFAIL_TESTSTATE_CALLED /* The test call to the parameter
125 * failure function has been made */
126} paramfail_test_state_t;
127
SimonB0269dad2016-02-17 23:34:30 +0000128
129/*----------------------------------------------------------------------------*/
130/* Macros */
131
Simon Butchera6463452018-12-06 17:41:56 +0000132/**
133 * \brief This macro tests the expression passed to it as a test step or
134 * individual test in a test case.
135 *
136 * It allows a library function to return a value and return an error
137 * code that can be tested.
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(), will be assumed to be a test
141 * failure.
Simon Butchera6463452018-12-06 17:41:56 +0000142 *
143 * This macro is not suitable for negative parameter validation tests,
144 * as it assumes the test step will not create an error.
145 *
146 * \param TEST The test expression to be tested.
147 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000148#define TEST_ASSERT( TEST ) \
149 do { \
150 if( ! (TEST) ) \
151 { \
152 test_fail( #TEST, __LINE__, __FILE__ ); \
153 goto exit; \
154 } \
SimonB0269dad2016-02-17 23:34:30 +0000155 } while( 0 )
156
Hanno Beckerd3369f62019-07-05 13:31:30 +0100157/**
158 * \brief This macro tests the expression passed to it and skips the
159 * running test if it doesn't evaluate to 'true'.
160 *
161 * \param TEST The test expression to be tested.
162 */
163#define TEST_ASSUME( TEST ) \
164 do { \
165 if( ! (TEST) ) \
166 { \
167 test_skip( #TEST, __LINE__, __FILE__ ); \
168 goto exit; \
169 } \
170 } while( 0 )
171
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100172#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
Simon Butchera6463452018-12-06 17:41:56 +0000173/**
174 * \brief This macro tests the statement passed to it as a test step or
175 * individual test in a test case. The macro assumes the test will fail
176 * and will generate an error.
177 *
178 * It allows a library function to return a value and tests the return
179 * code on return to confirm the given error code was returned.
180 *
181 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100182 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000183 * expected failure, and the test will pass.
184 *
185 * This macro is intended for negative parameter validation tests,
186 * where the failing function may return an error value or call
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100187 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000188 *
189 * \param PARAM_ERROR_VALUE The expected error code.
190 *
191 * \param TEST The test expression to be tested.
192 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000193#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
194 do { \
195 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
Manuel Pégourié-Gonnardacfdc622018-12-11 10:36:21 +0100196 if( (TEST) != (PARAM_ERR_VALUE) || \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000197 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
198 { \
199 test_fail( #TEST, __LINE__, __FILE__ ); \
200 goto exit; \
201 } \
202 } while( 0 )
Simon Butchera6463452018-12-06 17:41:56 +0000203
204/**
205 * \brief This macro tests the statement passed to it as a test step or
206 * individual test in a test case. The macro assumes the test will fail
207 * and will generate an error.
208 *
209 * It assumes the library function under test cannot return a value and
210 * assumes errors can only be indicated byt calls to
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100211 * MBEDTLS_PARAM_FAILED().
Simon Butchera6463452018-12-06 17:41:56 +0000212 *
213 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100214 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000215 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
216 * can be made.
217 *
218 * This macro is intended for negative parameter validation tests,
219 * where the failing function can only return an error by calling
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100220 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000221 *
222 * \param TEST The test expression to be tested.
223 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000224#define TEST_INVALID_PARAM( TEST ) \
225 do { \
226 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100227 if( setjmp( param_fail_jmp ) == 0 ) \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000228 { \
229 TEST; \
230 test_fail( #TEST, __LINE__, __FILE__ ); \
231 goto exit; \
232 } \
233 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
Simon Butchera6463452018-12-06 17:41:56 +0000234 } while( 0 )
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100235#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
Simon Butchera6463452018-12-06 17:41:56 +0000236
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100237/**
238 * \brief This macro tests the statement passed to it as a test step or
239 * individual test in a test case. The macro assumes the test will not fail.
240 *
241 * It assumes the library function under test cannot return a value and
242 * assumes errors can only be indicated by calls to
243 * MBEDTLS_PARAM_FAILED().
244 *
245 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
246 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
247 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
248 * can be made.
249 *
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100250 * This macro is intended to test that functions returning void
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100251 * accept all of the parameter values they're supposed to accept - eg
252 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100253 * that's allowed to be NULL happens to be NULL.
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100254 *
255 * Note: for functions that return something other that void,
256 * checking that they accept all the parameters they're supposed to
257 * accept is best done by using TEST_ASSERT() and checking the return
258 * value as well.
259 *
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100260 * Note: this macro is available even when #MBEDTLS_CHECK_PARAMS is
261 * disabled, as it makes sense to check that the functions accept all
262 * legal values even if this option is disabled - only in that case,
Manuel Pégourié-Gonnarde7306d32018-12-13 09:45:49 +0100263 * the test is more about whether the function segfaults than about
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100264 * whether it invokes MBEDTLS_PARAM_FAILED().
265 *
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100266 * \param TEST The test expression to be tested.
267 */
268#define TEST_VALID_PARAM( TEST ) \
269 TEST_ASSERT( ( TEST, 1 ) );
Simon Butchera6463452018-12-06 17:41:56 +0000270
Gilles Peskine137d31b2019-06-07 14:52:07 +0200271#define TEST_HELPER_ASSERT(a) if( !( a ) ) \
Rich Evans4c091142015-02-02 12:04:10 +0000272{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200273 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000274 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200275 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000276}
277
Ronald Cron07c83f22020-04-06 09:50:58 +0200278#if defined(__GNUC__)
279/* Test if arg and &(arg)[0] have the same type. This is true if arg is
280 * an array but not if it's a pointer. */
281#define IS_ARRAY_NOT_POINTER( arg ) \
282 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
283 __typeof__( &( arg )[0] ) ) )
284#else
285/* On platforms where we don't know how to implement this check,
286 * omit it. Oh well, a non-portable check is better than nothing. */
287#define IS_ARRAY_NOT_POINTER( arg ) 1
288#endif
289
290/* A compile-time constant with the value 0. If `const_expr` is not a
291 * compile-time constant with a nonzero value, cause a compile-time error. */
292#define STATIC_ASSERT_EXPR( const_expr ) \
makise-homura50f6a192020-08-23 00:39:15 +0300293 ( 0 && sizeof( struct { unsigned int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
Ronald Cron07c83f22020-04-06 09:50:58 +0200294/* Return the scalar value `value` (possibly promoted). This is a compile-time
295 * constant if `value` is. `condition` must be a compile-time constant.
296 * If `condition` is false, arrange to cause a compile-time error. */
297#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
298 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
299
300#define ARRAY_LENGTH_UNSAFE( array ) \
301 ( sizeof( array ) / sizeof( *( array ) ) )
302/** Return the number of elements of a static or stack array.
303 *
304 * \param array A value of array (not pointer) type.
305 *
306 * \return The number of elements of the array.
307 */
308#define ARRAY_LENGTH( array ) \
309 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
310 ARRAY_LENGTH_UNSAFE( array ) ) )
311
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000312/*
313 * 32-bit integer manipulation macros (big endian)
314 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000315#ifndef GET_UINT32_BE
316#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000317{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000318 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
319 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
320 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
321 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000322}
323#endif
324
Paul Bakker5c2364c2012-10-01 14:41:15 +0000325#ifndef PUT_UINT32_BE
326#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000327{ \
328 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
329 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
330 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
331 (b)[(i) + 3] = (unsigned char) ( (n) ); \
332}
333#endif
334
SimonB0269dad2016-02-17 23:34:30 +0000335
336/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100337/* Global variables */
338
Hanno Beckerd3369f62019-07-05 13:31:30 +0100339typedef enum
340{
341 TEST_RESULT_SUCCESS = 0,
342 TEST_RESULT_FAILED,
343 TEST_RESULT_SKIPPED
344} test_result_t;
345
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100346static struct
347{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000348 paramfail_test_state_t paramfail_test_state;
Hanno Beckerd3369f62019-07-05 13:31:30 +0100349 test_result_t result;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100350 const char *test;
351 const char *filename;
352 int line_no;
353}
354test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100355
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400356#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400357mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400358#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100359
Simon Butchera6463452018-12-06 17:41:56 +0000360#if defined(MBEDTLS_CHECK_PARAMS)
361jmp_buf param_fail_jmp;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000362jmp_buf jmp_tmp;
Simon Butchera6463452018-12-06 17:41:56 +0000363#endif
364
SimonB8ca7bc42016-04-17 23:24:50 +0100365/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100366/* Helper flags for complex dependencies */
367
368/* Indicates whether we expect mbedtls_entropy_init
369 * to initialize some strong entropy source. */
370#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
371 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
372 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
373 defined(MBEDTLS_HAVEGE_C) || \
374 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
375 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100376#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100377#endif
378
379
380/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000381/* Helper Functions */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000382
Simon Butcherecff2192018-10-03 16:17:41 +0100383void test_fail( const char *test, int line_no, const char* filename )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000384{
Hanno Beckerd3369f62019-07-05 13:31:30 +0100385 test_info.result = TEST_RESULT_FAILED;
386 test_info.test = test;
387 test_info.line_no = line_no;
388 test_info.filename = filename;
389}
390
391void test_skip( const char *test, int line_no, const char* filename )
392{
393 test_info.result = TEST_RESULT_SKIPPED;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000394 test_info.test = test;
395 test_info.line_no = line_no;
396 test_info.filename = filename;
397}
398
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400399static int platform_setup()
400{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400401 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400402#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400403 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400404#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400405 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400406}
407
408static void platform_teardown()
409{
410#if defined(MBEDTLS_PLATFORM_C)
411 mbedtls_platform_teardown( &platform_ctx );
412#endif /* MBEDTLS_PLATFORM_C */
413}
SimonB0269dad2016-02-17 23:34:30 +0000414
Simon Butchera6463452018-12-06 17:41:56 +0000415#if defined(MBEDTLS_CHECK_PARAMS)
Manuel Pégourié-Gonnard3ef6a6d2018-12-10 14:31:45 +0100416void mbedtls_param_failed( const char *failure_condition,
417 const char *file,
418 int line )
Simon Butchera6463452018-12-06 17:41:56 +0000419{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000420 /* If we are testing the callback function... */
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100421 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000422 {
423 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
424 }
425 else
426 {
427 /* ...else we treat this as an error */
Simon Butchera6463452018-12-06 17:41:56 +0000428
Simon Butcher6542f6c2018-12-09 22:09:59 +0000429 /* Record the location of the failure, but not as a failure yet, in case
430 * it was part of the test */
431 test_fail( failure_condition, line, file );
Hanno Beckerd3369f62019-07-05 13:31:30 +0100432 test_info.result = TEST_RESULT_SUCCESS;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000433
434 longjmp( param_fail_jmp, 1 );
435 }
Simon Butchera6463452018-12-06 17:41:56 +0000436}
437#endif
438
Janos Follath8ca53b52016-10-05 10:57:49 +0100439#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
gufe44650ce762020-07-30 09:02:27 +0200440static int redirect_output( FILE* out_stream, const char* path )
Janos Follath8ca53b52016-10-05 10:57:49 +0100441{
gufe44650ce762020-07-30 09:02:27 +0200442 int out_fd, dup_fd;
443 FILE* path_stream;
Janos Follath8ca53b52016-10-05 10:57:49 +0100444
gufe44650ce762020-07-30 09:02:27 +0200445 out_fd = fileno( out_stream );
446 dup_fd = dup( out_fd );
447
448 if( dup_fd == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100449 {
gufe44650ce762020-07-30 09:02:27 +0200450 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100451 }
452
gufe44650ce762020-07-30 09:02:27 +0200453 path_stream = fopen( path, "w" );
454 if( path_stream == NULL )
Janos Follath8ca53b52016-10-05 10:57:49 +0100455 {
gufe44650ce762020-07-30 09:02:27 +0200456 close( dup_fd );
457 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100458 }
459
gufe44650ce762020-07-30 09:02:27 +0200460 fflush( out_stream );
461 if( dup2( fileno( path_stream ), out_fd ) == -1 )
462 {
463 close( dup_fd );
464 fclose( path_stream );
465 return( -1 );
466 }
467
468 fclose( path_stream );
469 return( dup_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100470}
471
gufe44650ce762020-07-30 09:02:27 +0200472static int restore_output( FILE* out_stream, int dup_fd )
Janos Follath8ca53b52016-10-05 10:57:49 +0100473{
gufe44650ce762020-07-30 09:02:27 +0200474 int out_fd = fileno( out_stream );
Janos Follath8ca53b52016-10-05 10:57:49 +0100475
gufe44650ce762020-07-30 09:02:27 +0200476 fflush( out_stream );
477 if( dup2( dup_fd, out_fd ) == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100478 {
gufe44650ce762020-07-30 09:02:27 +0200479 close( out_fd );
480 close( dup_fd );
481 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100482 }
483
gufe44650ce762020-07-30 09:02:27 +0200484 close( dup_fd );
485 return( 0 );
Simon Butchere0192962016-10-12 23:07:30 +0100486}
Janos Follath8ca53b52016-10-05 10:57:49 +0100487#endif /* __unix__ || __APPLE__ __MACH__ */
488
Ronald Crona0c9ff32020-06-08 17:05:57 +0200489int mbedtls_test_unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000490{
491 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000492 int len = strlen( ibuf ) / 2;
Gilles Peskine137d31b2019-06-07 14:52:07 +0200493 TEST_HELPER_ASSERT( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000494
Rich Evans4c091142015-02-02 12:04:10 +0000495 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000496 {
497 c = *ibuf++;
498 if( c >= '0' && c <= '9' )
499 c -= '0';
500 else if( c >= 'a' && c <= 'f' )
501 c -= 'a' - 10;
502 else if( c >= 'A' && c <= 'F' )
503 c -= 'A' - 10;
504 else
Gilles Peskine137d31b2019-06-07 14:52:07 +0200505 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000506
507 c2 = *ibuf++;
508 if( c2 >= '0' && c2 <= '9' )
509 c2 -= '0';
510 else if( c2 >= 'a' && c2 <= 'f' )
511 c2 -= 'a' - 10;
512 else if( c2 >= 'A' && c2 <= 'F' )
513 c2 -= 'A' - 10;
514 else
Gilles Peskine137d31b2019-06-07 14:52:07 +0200515 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000516
517 *obuf++ = ( c << 4 ) | c2;
518 }
519
520 return len;
521}
522
Ronald Crona0c9ff32020-06-08 17:05:57 +0200523void mbedtls_test_hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000524{
525 unsigned char l, h;
526
Rich Evans42914452015-02-02 12:09:25 +0000527 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000528 {
Rich Evans42914452015-02-02 12:09:25 +0000529 h = *ibuf / 16;
530 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000531
532 if( h < 10 )
533 *obuf++ = '0' + h;
534 else
535 *obuf++ = 'a' + h - 10;
536
537 if( l < 10 )
538 *obuf++ = '0' + l;
539 else
540 *obuf++ = 'a' + l - 10;
541
542 ++ibuf;
543 len--;
544 }
545}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000546
547/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200548 * Allocate and zeroize a buffer.
549 *
550 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
551 *
552 * For convenience, dies if allocation fails.
553 */
554static unsigned char *zero_alloc( size_t len )
555{
556 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000557 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200558
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200559 p = mbedtls_calloc( 1, actual_len );
Gilles Peskine137d31b2019-06-07 14:52:07 +0200560 TEST_HELPER_ASSERT( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200561
562 memset( p, 0x00, actual_len );
563
564 return( p );
565}
566
567/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200568 * Allocate and fill a buffer from hex data.
569 *
570 * The buffer is sized exactly as needed. This allows to detect buffer
571 * overruns (including overreads) when running the test suite under valgrind.
572 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200573 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
574 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200575 * For convenience, dies if allocation fails.
576 */
Simon Butcherecff2192018-10-03 16:17:41 +0100577unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200578{
579 unsigned char *obuf;
580
Rich Evans42914452015-02-02 12:09:25 +0000581 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200582
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200583 if( *olen == 0 )
584 return( zero_alloc( *olen ) );
585
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200586 obuf = mbedtls_calloc( 1, *olen );
Gilles Peskine137d31b2019-06-07 14:52:07 +0200587 TEST_HELPER_ASSERT( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200588
Ronald Crona0c9ff32020-06-08 17:05:57 +0200589 (void) mbedtls_test_unhexify( obuf, ibuf );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200590
591 return( obuf );
592}
593
594/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000595 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000596 * Although predictable and often similar on multiple
597 * runs, this does not result in identical random on
598 * each run. So do not use this if the results of a
599 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000600 *
601 * rng_state shall be NULL.
602 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000603static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000604{
gufe443fa7c642020-08-03 17:56:50 +0200605#if !defined(__OpenBSD__) && !defined(__NetBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000606 size_t i;
607
Paul Bakker9dcc3222011-03-08 14:16:06 +0000608 if( rng_state != NULL )
609 rng_state = NULL;
610
Paul Bakkera3d195c2011-11-27 21:07:34 +0000611 for( i = 0; i < len; ++i )
612 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200613#else
614 if( rng_state != NULL )
615 rng_state = NULL;
616
617 arc4random_buf( output, len );
gufe443fa7c642020-08-03 17:56:50 +0200618#endif /* !OpenBSD && !NetBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000619
620 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000621}
622
623/**
624 * This function only returns zeros
625 *
626 * rng_state shall be NULL.
627 */
Simon Butcherecff2192018-10-03 16:17:41 +0100628int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000629{
630 if( rng_state != NULL )
631 rng_state = NULL;
632
Paul Bakkera3d195c2011-11-27 21:07:34 +0000633 memset( output, 0, len );
634
Paul Bakker9dcc3222011-03-08 14:16:06 +0000635 return( 0 );
636}
637
638typedef struct
639{
640 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000641 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000642} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000643
644/**
645 * This function returns random based on a buffer it receives.
646 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000647 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100648 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000649 * The number of bytes released from the buffer on each call to
650 * the random function is specified by per_call. (Can be between
651 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000652 *
653 * After the buffer is empty it will return rand();
654 */
Simon Butcherecff2192018-10-03 16:17:41 +0100655int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000656{
Paul Bakker997bbd12011-03-13 15:45:42 +0000657 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000658 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000659
660 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000661 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000662
Paul Bakkera3d195c2011-11-27 21:07:34 +0000663 use_len = len;
664 if( len > info->length )
665 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000666
Paul Bakkera3d195c2011-11-27 21:07:34 +0000667 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000668 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000669 memcpy( output, info->buf, use_len );
670 info->buf += use_len;
671 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000672 }
673
Paul Bakkera3d195c2011-11-27 21:07:34 +0000674 if( len - use_len > 0 )
675 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
676
677 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000678}
Paul Bakker997bbd12011-03-13 15:45:42 +0000679
680/**
681 * Info structure for the pseudo random function
682 *
683 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000684 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000685 * State( v0, v1 ) should be set to zero.
686 */
687typedef struct
688{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000689 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000690 uint32_t v0, v1;
691} rnd_pseudo_info;
692
693/**
694 * This function returns random based on a pseudo random function.
695 * This means the results should be identical on all systems.
696 * Pseudo random is based on the XTEA encryption algorithm to
697 * generate pseudorandom.
698 *
699 * rng_state shall be a pointer to a rnd_pseudo_info structure.
700 */
Simon Butcherecff2192018-10-03 16:17:41 +0100701int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000702{
703 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000704 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100705 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000706
707 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000708 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000709
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000710 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000711
712 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000713 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000714 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000715 sum = 0;
716
Paul Bakkera3d195c2011-11-27 21:07:34 +0000717 for( i = 0; i < 32; i++ )
718 {
Rich Evans42914452015-02-02 12:09:25 +0000719 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
720 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000721 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000722 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
723 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000724 }
725
Paul Bakker5c2364c2012-10-01 14:41:15 +0000726 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100727 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000728 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100729 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000730 }
731
Paul Bakkera3d195c2011-11-27 21:07:34 +0000732 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000733}
SimonB0269dad2016-02-17 23:34:30 +0000734
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100735int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100736{
737 int ret = 0;
738 uint32_t i = 0;
739
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100740 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100741 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100742
743 for( i = 0; i < a_len; i++ )
744 {
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100745 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100746 {
747 ret = -1;
748 break;
749 }
750 }
751 return ret;
752}