blob: 18a96d18a534a89f28c509520397438ba3a468c2 [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
Gilles Peskinec0713732021-01-29 21:17:11 +010049#if defined(MBEDTLS_THREADING_C) && defined(MBEDTLS_THREADING_PTHREAD) && \
50 defined(MBEDTLS_TEST_HOOKS)
51#include "mbedtls/threading.h"
52#define MBEDTLS_TEST_MUTEX_USAGE
53#endif
54
Manuel Pégourié-Gonnardf0828472020-08-25 11:26:37 +020055/*
56 * Define the two macros
57 *
58 * #define TEST_CF_SECRET(ptr, size)
59 * #define TEST_CF_PUBLIC(ptr, size)
60 *
61 * that can be used in tests to mark a memory area as secret (no branch or
62 * memory access should depend on it) or public (default, only needs to be
63 * marked explicitly when it was derived from secret data).
64 *
65 * Arguments:
66 * - ptr: a pointer to the memory area to be marked
67 * - size: the size in bytes of the memory area
68 *
69 * Implementation:
70 * The basic idea is that of ctgrind <https://github.com/agl/ctgrind>: we can
71 * re-use tools that were designed for checking use of uninitialized memory.
72 * This file contains two implementations: one based on MemorySanitizer, the
73 * other on valgrind's memcheck. If none of them is enabled, dummy macros that
74 * do nothing are defined for convenience.
75 */
Manuel Pégourié-Gonnarda2377222020-07-28 10:53:06 +020076#if defined(MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN)
77#include <sanitizer/msan_interface.h>
78
79/* Use macros to avoid messing up with origin tracking */
80#define TEST_CF_SECRET __msan_allocated_memory
81// void __msan_allocated_memory(const volatile void* data, size_t size);
82#define TEST_CF_PUBLIC __msan_unpoison
83// void __msan_unpoison(const volatile void *a, size_t size);
84
Manuel Pégourié-Gonnardf0828472020-08-25 11:26:37 +020085#elif defined(MBEDTLS_TEST_CONSTANT_FLOW_VALGRIND)
86#include <valgrind/memcheck.h>
87
88#define TEST_CF_SECRET VALGRIND_MAKE_MEM_UNDEFINED
89// VALGRIND_MAKE_MEM_UNDEFINED(_qzz_addr, _qzz_len)
90#define TEST_CF_PUBLIC VALGRIND_MAKE_MEM_DEFINED
91// VALGRIND_MAKE_MEM_DEFINED(_qzz_addr, _qzz_len)
92
93#else /* MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN ||
94 MBEDTLS_TEST_CONSTANT_FLOW_VALGRIND */
Manuel Pégourié-Gonnarda2377222020-07-28 10:53:06 +020095
96#define TEST_CF_SECRET(ptr, size)
97#define TEST_CF_PUBLIC(ptr, size)
98
99#endif /* MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN */
100
Azim Khand30ca132017-06-09 04:32:58 +0100101/* Type for Hex parameters */
Azim Khan5fcca462018-06-29 11:05:32 +0100102typedef struct data_tag
Azim Khand30ca132017-06-09 04:32:58 +0100103{
104 uint8_t * x;
105 uint32_t len;
Azim Khan5fcca462018-06-29 11:05:32 +0100106} data_t;
Azim Khand30ca132017-06-09 04:32:58 +0100107
SimonB0269dad2016-02-17 23:34:30 +0000108/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +0100109/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +0000110
Azim Khan62a5d7d2018-06-29 10:02:54 +0100111#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
112#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
113#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +0100114
Azim Khan62a5d7d2018-06-29 10:02:54 +0100115#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
116#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
117#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
118#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
119 Only int, string, binary data
120 and integer expressions are
121 allowed */
122#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
123 build */
SimonB0269dad2016-02-17 23:34:30 +0000124
Simon Butcher6542f6c2018-12-09 22:09:59 +0000125typedef enum
126{
127 PARAMFAIL_TESTSTATE_IDLE = 0, /* No parameter failure call test */
128 PARAMFAIL_TESTSTATE_PENDING, /* Test call to the parameter failure
129 * is pending */
130 PARAMFAIL_TESTSTATE_CALLED /* The test call to the parameter
131 * failure function has been made */
132} paramfail_test_state_t;
133
SimonB0269dad2016-02-17 23:34:30 +0000134
135/*----------------------------------------------------------------------------*/
136/* Macros */
137
Simon Butchera6463452018-12-06 17:41:56 +0000138/**
139 * \brief This macro tests the expression passed to it as a test step or
140 * individual test in a test case.
141 *
142 * It allows a library function to return a value and return an error
143 * code that can be tested.
144 *
145 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100146 * callback, MBEDTLS_PARAM_FAILED(), will be assumed to be a test
147 * failure.
Simon Butchera6463452018-12-06 17:41:56 +0000148 *
149 * This macro is not suitable for negative parameter validation tests,
150 * as it assumes the test step will not create an error.
151 *
152 * \param TEST The test expression to be tested.
153 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000154#define TEST_ASSERT( TEST ) \
155 do { \
156 if( ! (TEST) ) \
157 { \
158 test_fail( #TEST, __LINE__, __FILE__ ); \
159 goto exit; \
160 } \
SimonB0269dad2016-02-17 23:34:30 +0000161 } while( 0 )
162
Ronald Cron8e8898d2020-07-30 14:18:02 +0200163/** Compare two buffers and fail the test case if they differ.
164 *
165 * This macro expands to an instruction, not an expression.
166 * It may jump to the \c exit label.
167 *
168 * \param p1 Pointer to the start of the first buffer.
169 * \param size1 Size of the first buffer in bytes.
170 * This expression may be evaluated multiple times.
171 * \param p2 Pointer to the start of the second buffer.
172 * \param size2 Size of the second buffer in bytes.
173 * This expression may be evaluated multiple times.
174 */
175#define ASSERT_COMPARE( p1, size1, p2, size2 ) \
176 do \
177 { \
178 TEST_ASSERT( ( size1 ) == ( size2 ) ); \
179 if( ( size1 ) != 0 ) \
180 TEST_ASSERT( memcmp( ( p1 ), ( p2 ), ( size1 ) ) == 0 ); \
181 } \
182 while( 0 )
183
Hanno Beckerd3369f62019-07-05 13:31:30 +0100184/**
185 * \brief This macro tests the expression passed to it and skips the
186 * running test if it doesn't evaluate to 'true'.
187 *
188 * \param TEST The test expression to be tested.
189 */
190#define TEST_ASSUME( TEST ) \
191 do { \
192 if( ! (TEST) ) \
193 { \
194 test_skip( #TEST, __LINE__, __FILE__ ); \
195 goto exit; \
196 } \
197 } while( 0 )
198
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100199#if defined(MBEDTLS_CHECK_PARAMS) && !defined(MBEDTLS_PARAM_FAILED_ALT)
Simon Butchera6463452018-12-06 17:41:56 +0000200/**
201 * \brief This macro tests the statement passed to it as a test step or
202 * individual test in a test case. The macro assumes the test will fail
203 * and will generate an error.
204 *
205 * It allows a library function to return a value and tests the return
206 * code on return to confirm the given error code was returned.
207 *
208 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100209 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000210 * expected failure, and the test will pass.
211 *
212 * This macro is intended for negative parameter validation tests,
213 * where the failing function may return an error value or call
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100214 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000215 *
216 * \param PARAM_ERROR_VALUE The expected error code.
217 *
218 * \param TEST The test expression to be tested.
219 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000220#define TEST_INVALID_PARAM_RET( PARAM_ERR_VALUE, TEST ) \
221 do { \
222 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_PENDING; \
Manuel Pégourié-Gonnardacfdc622018-12-11 10:36:21 +0100223 if( (TEST) != (PARAM_ERR_VALUE) || \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000224 test_info.paramfail_test_state != PARAMFAIL_TESTSTATE_CALLED ) \
225 { \
226 test_fail( #TEST, __LINE__, __FILE__ ); \
227 goto exit; \
228 } \
229 } while( 0 )
Simon Butchera6463452018-12-06 17:41:56 +0000230
231/**
232 * \brief This macro tests the statement passed to it as a test step or
233 * individual test in a test case. The macro assumes the test will fail
234 * and will generate an error.
235 *
236 * It assumes the library function under test cannot return a value and
237 * assumes errors can only be indicated byt calls to
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100238 * MBEDTLS_PARAM_FAILED().
Simon Butchera6463452018-12-06 17:41:56 +0000239 *
240 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100241 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
Simon Butchera6463452018-12-06 17:41:56 +0000242 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
243 * can be made.
244 *
245 * This macro is intended for negative parameter validation tests,
246 * where the failing function can only return an error by calling
Manuel Pégourié-Gonnarda2b0e272018-12-10 15:23:58 +0100247 * MBEDTLS_PARAM_FAILED() to indicate the error.
Simon Butchera6463452018-12-06 17:41:56 +0000248 *
249 * \param TEST The test expression to be tested.
250 */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000251#define TEST_INVALID_PARAM( TEST ) \
252 do { \
253 memcpy(jmp_tmp, param_fail_jmp, sizeof(jmp_buf)); \
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100254 if( setjmp( param_fail_jmp ) == 0 ) \
Simon Butcher6542f6c2018-12-09 22:09:59 +0000255 { \
256 TEST; \
257 test_fail( #TEST, __LINE__, __FILE__ ); \
258 goto exit; \
259 } \
260 memcpy(param_fail_jmp, jmp_tmp, sizeof(jmp_buf)); \
Simon Butchera6463452018-12-06 17:41:56 +0000261 } while( 0 )
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100262#endif /* MBEDTLS_CHECK_PARAMS && !MBEDTLS_PARAM_FAILED_ALT */
Simon Butchera6463452018-12-06 17:41:56 +0000263
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100264/**
265 * \brief This macro tests the statement passed to it as a test step or
266 * individual test in a test case. The macro assumes the test will not fail.
267 *
268 * It assumes the library function under test cannot return a value and
269 * assumes errors can only be indicated by calls to
270 * MBEDTLS_PARAM_FAILED().
271 *
272 * When MBEDTLS_CHECK_PARAMS is enabled, calls to the parameter failure
273 * callback, MBEDTLS_PARAM_FAILED(), are assumed to indicate the
274 * expected failure. If MBEDTLS_CHECK_PARAMS is not enabled, no test
275 * can be made.
276 *
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100277 * This macro is intended to test that functions returning void
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100278 * accept all of the parameter values they're supposed to accept - eg
279 * that they don't call MBEDTLS_PARAM_FAILED() when a parameter
Manuel Pégourié-Gonnardcd2b29c2018-12-12 10:23:57 +0100280 * that's allowed to be NULL happens to be NULL.
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100281 *
282 * Note: for functions that return something other that void,
283 * checking that they accept all the parameters they're supposed to
284 * accept is best done by using TEST_ASSERT() and checking the return
285 * value as well.
286 *
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100287 * Note: this macro is available even when #MBEDTLS_CHECK_PARAMS is
288 * disabled, as it makes sense to check that the functions accept all
289 * legal values even if this option is disabled - only in that case,
Manuel Pégourié-Gonnarde7306d32018-12-13 09:45:49 +0100290 * the test is more about whether the function segfaults than about
Manuel Pégourié-Gonnard54e7f312018-12-12 11:56:09 +0100291 * whether it invokes MBEDTLS_PARAM_FAILED().
292 *
Manuel Pégourié-Gonnard44c5d582018-12-10 16:56:14 +0100293 * \param TEST The test expression to be tested.
294 */
295#define TEST_VALID_PARAM( TEST ) \
296 TEST_ASSERT( ( TEST, 1 ) );
Simon Butchera6463452018-12-06 17:41:56 +0000297
Gilles Peskine137d31b2019-06-07 14:52:07 +0200298#define TEST_HELPER_ASSERT(a) if( !( a ) ) \
Rich Evans4c091142015-02-02 12:04:10 +0000299{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200300 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000301 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200302 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000303}
304
Ronald Cron07c83f22020-04-06 09:50:58 +0200305#if defined(__GNUC__)
306/* Test if arg and &(arg)[0] have the same type. This is true if arg is
307 * an array but not if it's a pointer. */
308#define IS_ARRAY_NOT_POINTER( arg ) \
309 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
310 __typeof__( &( arg )[0] ) ) )
311#else
312/* On platforms where we don't know how to implement this check,
313 * omit it. Oh well, a non-portable check is better than nothing. */
314#define IS_ARRAY_NOT_POINTER( arg ) 1
315#endif
316
317/* A compile-time constant with the value 0. If `const_expr` is not a
318 * compile-time constant with a nonzero value, cause a compile-time error. */
319#define STATIC_ASSERT_EXPR( const_expr ) \
makise-homura50f6a192020-08-23 00:39:15 +0300320 ( 0 && sizeof( struct { unsigned int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
Ronald Cron07c83f22020-04-06 09:50:58 +0200321/* Return the scalar value `value` (possibly promoted). This is a compile-time
322 * constant if `value` is. `condition` must be a compile-time constant.
323 * If `condition` is false, arrange to cause a compile-time error. */
324#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
325 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
326
327#define ARRAY_LENGTH_UNSAFE( array ) \
328 ( sizeof( array ) / sizeof( *( array ) ) )
329/** Return the number of elements of a static or stack array.
330 *
331 * \param array A value of array (not pointer) type.
332 *
333 * \return The number of elements of the array.
334 */
335#define ARRAY_LENGTH( array ) \
336 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
337 ARRAY_LENGTH_UNSAFE( array ) ) )
338
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000339/*
340 * 32-bit integer manipulation macros (big endian)
341 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000342#ifndef GET_UINT32_BE
343#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000344{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000345 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
346 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
347 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
348 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000349}
350#endif
351
Paul Bakker5c2364c2012-10-01 14:41:15 +0000352#ifndef PUT_UINT32_BE
353#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000354{ \
355 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
356 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
357 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
358 (b)[(i) + 3] = (unsigned char) ( (n) ); \
359}
360#endif
361
SimonB0269dad2016-02-17 23:34:30 +0000362
363/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100364/* Global variables */
365
Hanno Beckerd3369f62019-07-05 13:31:30 +0100366typedef enum
367{
368 TEST_RESULT_SUCCESS = 0,
369 TEST_RESULT_FAILED,
370 TEST_RESULT_SKIPPED
371} test_result_t;
372
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100373static struct
374{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000375 paramfail_test_state_t paramfail_test_state;
Hanno Beckerd3369f62019-07-05 13:31:30 +0100376 test_result_t result;
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100377 const char *test;
378 const char *filename;
379 int line_no;
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100380#if defined(MBEDTLS_TEST_MUTEX_USAGE)
381 const char *mutex_usage_error;
382#endif
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100383}
384test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100385
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400386#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400387mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400388#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100389
Simon Butchera6463452018-12-06 17:41:56 +0000390#if defined(MBEDTLS_CHECK_PARAMS)
391jmp_buf param_fail_jmp;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000392jmp_buf jmp_tmp;
Simon Butchera6463452018-12-06 17:41:56 +0000393#endif
394
SimonB8ca7bc42016-04-17 23:24:50 +0100395/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100396/* Helper flags for complex dependencies */
397
398/* Indicates whether we expect mbedtls_entropy_init
399 * to initialize some strong entropy source. */
400#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
401 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
402 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
403 defined(MBEDTLS_HAVEGE_C) || \
404 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
405 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100406#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100407#endif
408
409
410/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000411/* Helper Functions */
Simon Butcher6542f6c2018-12-09 22:09:59 +0000412
Simon Butcherecff2192018-10-03 16:17:41 +0100413void test_fail( const char *test, int line_no, const char* filename )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000414{
Gilles Peskinedfb5cff2020-08-29 15:18:23 +0200415 if( test_info.result == TEST_RESULT_FAILED )
416 {
417 /* We've already recorded the test as having failed. Don't
418 * overwrite any previous information about the failure. */
419 return;
420 }
Hanno Beckerd3369f62019-07-05 13:31:30 +0100421 test_info.result = TEST_RESULT_FAILED;
422 test_info.test = test;
423 test_info.line_no = line_no;
424 test_info.filename = filename;
425}
426
427void test_skip( const char *test, int line_no, const char* filename )
428{
429 test_info.result = TEST_RESULT_SKIPPED;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000430 test_info.test = test;
431 test_info.line_no = line_no;
432 test_info.filename = filename;
433}
434
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400435static int platform_setup()
436{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400437 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400438#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400439 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400440#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400441 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400442}
443
444static void platform_teardown()
445{
446#if defined(MBEDTLS_PLATFORM_C)
447 mbedtls_platform_teardown( &platform_ctx );
448#endif /* MBEDTLS_PLATFORM_C */
449}
SimonB0269dad2016-02-17 23:34:30 +0000450
Simon Butchera6463452018-12-06 17:41:56 +0000451#if defined(MBEDTLS_CHECK_PARAMS)
Manuel Pégourié-Gonnard3ef6a6d2018-12-10 14:31:45 +0100452void mbedtls_param_failed( const char *failure_condition,
453 const char *file,
454 int line )
Simon Butchera6463452018-12-06 17:41:56 +0000455{
Simon Butcher6542f6c2018-12-09 22:09:59 +0000456 /* If we are testing the callback function... */
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100457 if( test_info.paramfail_test_state == PARAMFAIL_TESTSTATE_PENDING )
Simon Butcher6542f6c2018-12-09 22:09:59 +0000458 {
459 test_info.paramfail_test_state = PARAMFAIL_TESTSTATE_CALLED;
460 }
461 else
462 {
463 /* ...else we treat this as an error */
Simon Butchera6463452018-12-06 17:41:56 +0000464
Simon Butcher6542f6c2018-12-09 22:09:59 +0000465 /* Record the location of the failure, but not as a failure yet, in case
466 * it was part of the test */
467 test_fail( failure_condition, line, file );
Hanno Beckerd3369f62019-07-05 13:31:30 +0100468 test_info.result = TEST_RESULT_SUCCESS;
Simon Butcher6542f6c2018-12-09 22:09:59 +0000469
470 longjmp( param_fail_jmp, 1 );
471 }
Simon Butchera6463452018-12-06 17:41:56 +0000472}
473#endif
474
Janos Follath8ca53b52016-10-05 10:57:49 +0100475#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
gufe44650ce762020-07-30 09:02:27 +0200476static int redirect_output( FILE* out_stream, const char* path )
Janos Follath8ca53b52016-10-05 10:57:49 +0100477{
gufe44650ce762020-07-30 09:02:27 +0200478 int out_fd, dup_fd;
479 FILE* path_stream;
Janos Follath8ca53b52016-10-05 10:57:49 +0100480
gufe44650ce762020-07-30 09:02:27 +0200481 out_fd = fileno( out_stream );
482 dup_fd = dup( out_fd );
483
484 if( dup_fd == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100485 {
gufe44650ce762020-07-30 09:02:27 +0200486 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100487 }
488
gufe44650ce762020-07-30 09:02:27 +0200489 path_stream = fopen( path, "w" );
490 if( path_stream == NULL )
Janos Follath8ca53b52016-10-05 10:57:49 +0100491 {
gufe44650ce762020-07-30 09:02:27 +0200492 close( dup_fd );
493 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100494 }
495
gufe44650ce762020-07-30 09:02:27 +0200496 fflush( out_stream );
497 if( dup2( fileno( path_stream ), out_fd ) == -1 )
498 {
499 close( dup_fd );
500 fclose( path_stream );
501 return( -1 );
502 }
503
504 fclose( path_stream );
505 return( dup_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100506}
507
gufe44650ce762020-07-30 09:02:27 +0200508static int restore_output( FILE* out_stream, int dup_fd )
Janos Follath8ca53b52016-10-05 10:57:49 +0100509{
gufe44650ce762020-07-30 09:02:27 +0200510 int out_fd = fileno( out_stream );
Janos Follath8ca53b52016-10-05 10:57:49 +0100511
gufe44650ce762020-07-30 09:02:27 +0200512 fflush( out_stream );
513 if( dup2( dup_fd, out_fd ) == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100514 {
gufe44650ce762020-07-30 09:02:27 +0200515 close( out_fd );
516 close( dup_fd );
517 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100518 }
519
gufe44650ce762020-07-30 09:02:27 +0200520 close( dup_fd );
521 return( 0 );
Simon Butchere0192962016-10-12 23:07:30 +0100522}
Janos Follath8ca53b52016-10-05 10:57:49 +0100523#endif /* __unix__ || __APPLE__ __MACH__ */
524
Ronald Crona0c9ff32020-06-08 17:05:57 +0200525int mbedtls_test_unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000526{
527 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000528 int len = strlen( ibuf ) / 2;
Gilles Peskine137d31b2019-06-07 14:52:07 +0200529 TEST_HELPER_ASSERT( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000530
Rich Evans4c091142015-02-02 12:04:10 +0000531 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000532 {
533 c = *ibuf++;
534 if( c >= '0' && c <= '9' )
535 c -= '0';
536 else if( c >= 'a' && c <= 'f' )
537 c -= 'a' - 10;
538 else if( c >= 'A' && c <= 'F' )
539 c -= 'A' - 10;
540 else
Gilles Peskine137d31b2019-06-07 14:52:07 +0200541 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000542
543 c2 = *ibuf++;
544 if( c2 >= '0' && c2 <= '9' )
545 c2 -= '0';
546 else if( c2 >= 'a' && c2 <= 'f' )
547 c2 -= 'a' - 10;
548 else if( c2 >= 'A' && c2 <= 'F' )
549 c2 -= 'A' - 10;
550 else
Gilles Peskine137d31b2019-06-07 14:52:07 +0200551 TEST_HELPER_ASSERT( 0 );
Paul Bakker367dae42009-06-28 21:50:27 +0000552
553 *obuf++ = ( c << 4 ) | c2;
554 }
555
556 return len;
557}
558
Ronald Crona0c9ff32020-06-08 17:05:57 +0200559void mbedtls_test_hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000560{
561 unsigned char l, h;
562
Rich Evans42914452015-02-02 12:09:25 +0000563 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000564 {
Rich Evans42914452015-02-02 12:09:25 +0000565 h = *ibuf / 16;
566 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000567
568 if( h < 10 )
569 *obuf++ = '0' + h;
570 else
571 *obuf++ = 'a' + h - 10;
572
573 if( l < 10 )
574 *obuf++ = '0' + l;
575 else
576 *obuf++ = 'a' + l - 10;
577
578 ++ibuf;
579 len--;
580 }
581}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000582
583/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200584 * Allocate and zeroize a buffer.
585 *
586 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
587 *
588 * For convenience, dies if allocation fails.
589 */
590static unsigned char *zero_alloc( size_t len )
591{
592 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000593 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200594
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200595 p = mbedtls_calloc( 1, actual_len );
Gilles Peskine137d31b2019-06-07 14:52:07 +0200596 TEST_HELPER_ASSERT( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200597
598 memset( p, 0x00, actual_len );
599
600 return( p );
601}
602
603/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200604 * Allocate and fill a buffer from hex data.
605 *
606 * The buffer is sized exactly as needed. This allows to detect buffer
607 * overruns (including overreads) when running the test suite under valgrind.
608 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200609 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
610 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200611 * For convenience, dies if allocation fails.
612 */
Simon Butcherecff2192018-10-03 16:17:41 +0100613unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200614{
615 unsigned char *obuf;
616
Rich Evans42914452015-02-02 12:09:25 +0000617 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200618
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200619 if( *olen == 0 )
620 return( zero_alloc( *olen ) );
621
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200622 obuf = mbedtls_calloc( 1, *olen );
Gilles Peskine137d31b2019-06-07 14:52:07 +0200623 TEST_HELPER_ASSERT( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200624
Ronald Crona0c9ff32020-06-08 17:05:57 +0200625 (void) mbedtls_test_unhexify( obuf, ibuf );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200626
627 return( obuf );
628}
629
630/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000631 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000632 * Although predictable and often similar on multiple
633 * runs, this does not result in identical random on
634 * each run. So do not use this if the results of a
635 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000636 *
637 * rng_state shall be NULL.
638 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000639static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000640{
gufe443fa7c642020-08-03 17:56:50 +0200641#if !defined(__OpenBSD__) && !defined(__NetBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000642 size_t i;
643
Paul Bakker9dcc3222011-03-08 14:16:06 +0000644 if( rng_state != NULL )
645 rng_state = NULL;
646
Paul Bakkera3d195c2011-11-27 21:07:34 +0000647 for( i = 0; i < len; ++i )
648 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200649#else
650 if( rng_state != NULL )
651 rng_state = NULL;
652
653 arc4random_buf( output, len );
gufe443fa7c642020-08-03 17:56:50 +0200654#endif /* !OpenBSD && !NetBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000655
656 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000657}
658
659/**
660 * This function only returns zeros
661 *
662 * rng_state shall be NULL.
663 */
Simon Butcherecff2192018-10-03 16:17:41 +0100664int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000665{
666 if( rng_state != NULL )
667 rng_state = NULL;
668
Paul Bakkera3d195c2011-11-27 21:07:34 +0000669 memset( output, 0, len );
670
Paul Bakker9dcc3222011-03-08 14:16:06 +0000671 return( 0 );
672}
673
674typedef struct
675{
676 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000677 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000678} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000679
680/**
681 * This function returns random based on a buffer it receives.
682 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000683 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100684 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000685 * The number of bytes released from the buffer on each call to
686 * the random function is specified by per_call. (Can be between
687 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000688 *
689 * After the buffer is empty it will return rand();
690 */
Simon Butcherecff2192018-10-03 16:17:41 +0100691int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000692{
Paul Bakker997bbd12011-03-13 15:45:42 +0000693 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000694 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000695
696 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000697 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000698
Paul Bakkera3d195c2011-11-27 21:07:34 +0000699 use_len = len;
700 if( len > info->length )
701 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000702
Paul Bakkera3d195c2011-11-27 21:07:34 +0000703 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000704 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000705 memcpy( output, info->buf, use_len );
706 info->buf += use_len;
707 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000708 }
709
Paul Bakkera3d195c2011-11-27 21:07:34 +0000710 if( len - use_len > 0 )
711 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
712
713 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000714}
Paul Bakker997bbd12011-03-13 15:45:42 +0000715
716/**
717 * Info structure for the pseudo random function
718 *
719 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000720 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000721 * State( v0, v1 ) should be set to zero.
722 */
723typedef struct
724{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000725 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000726 uint32_t v0, v1;
727} rnd_pseudo_info;
728
729/**
730 * This function returns random based on a pseudo random function.
731 * This means the results should be identical on all systems.
732 * Pseudo random is based on the XTEA encryption algorithm to
733 * generate pseudorandom.
734 *
735 * rng_state shall be a pointer to a rnd_pseudo_info structure.
736 */
Simon Butcherecff2192018-10-03 16:17:41 +0100737int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000738{
739 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000740 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100741 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000742
743 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000744 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000745
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000746 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000747
748 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000749 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000750 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000751 sum = 0;
752
Paul Bakkera3d195c2011-11-27 21:07:34 +0000753 for( i = 0; i < 32; i++ )
754 {
Rich Evans42914452015-02-02 12:09:25 +0000755 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
756 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000757 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000758 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
759 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000760 }
761
Paul Bakker5c2364c2012-10-01 14:41:15 +0000762 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100763 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000764 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100765 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000766 }
767
Paul Bakkera3d195c2011-11-27 21:07:34 +0000768 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000769}
SimonB0269dad2016-02-17 23:34:30 +0000770
Ronald Crond2397942020-06-10 11:03:08 +0200771int mbedtls_test_hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len )
Azim Khan3499a9e2017-05-30 00:06:49 +0100772{
773 int ret = 0;
774 uint32_t i = 0;
775
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100776 if( a_len != b_len )
Mohammad Azim Khand2d01122018-07-18 17:48:37 +0100777 return( -1 );
Azim Khan3499a9e2017-05-30 00:06:49 +0100778
779 for( i = 0; i < a_len; i++ )
780 {
Manuel Pégourié-Gonnardaae10fa2018-12-12 10:24:19 +0100781 if( a[i] != b[i] )
Azim Khan3499a9e2017-05-30 00:06:49 +0100782 {
783 ret = -1;
784 break;
785 }
786 }
787 return ret;
788}
Gilles Peskinec0713732021-01-29 21:17:11 +0100789
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100790#if defined(MBEDTLS_TEST_MUTEX_USAGE)
Gilles Peskinec0713732021-01-29 21:17:11 +0100791/** Mutex usage verification framework.
792 *
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100793 * The mutex usage verification code below aims to detect bad usage of
794 * Mbed TLS's mutex abstraction layer at runtime. Note that this is solely
795 * about the use of the mutex itself, not about checking whether the mutex
796 * correctly protects whatever it is supposed to protect.
797 *
798 * The normal usage of a mutex is:
799 * ```
800 * digraph mutex_states {
801 * "UNINITIALIZED"; // the initial state
802 * "IDLE";
803 * "FREED";
804 * "LOCKED";
805 * "UNINITIALIZED" -> "IDLE" [label="init"];
806 * "FREED" -> "IDLE" [label="init"];
807 * "IDLE" -> "LOCKED" [label="lock"];
808 * "LOCKED" -> "IDLE" [label="unlock"];
809 * "IDLE" -> "FREED" [label="free"];
810 * }
811 * ```
812 *
813 * All bad transitions that can be unambiguously detected are reported.
814 * An attempt to use an uninitialized mutex cannot be detected in general
815 * since the memory content may happen to denote a valid state. For the same
816 * reason, a double init cannot be detected.
817 * All-bits-zero is the state of a freed mutex, which is distinct from an
818 * initialized mutex, so attempting to use zero-initialized memory as a mutex
819 * without calling the init function is detected.
820 *
821 * If an error is detected, this framework will report what happened and the
822 * test case will be marked as failed. Unfortunately, the error report cannot
823 * indicate the exact location of the problematic call. To locate the error,
824 * use a debugger and set a breakpoint on mbedtls_test_mutex_usage_error().
Gilles Peskinec0713732021-01-29 21:17:11 +0100825 */
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100826enum value_of_mutex_is_valid
827{
828 MUTEX_FREED = 0, //!< Set by threading_mutex_free_pthread
829 MUTEX_IDLE = 1, //!< Set by threading_mutex_init_pthread and by our unlock
830 MUTEX_LOCKED = 2, //!< Set by our lock
831};
Gilles Peskinec0713732021-01-29 21:17:11 +0100832
Gilles Peskinec0713732021-01-29 21:17:11 +0100833typedef struct
834{
835 void (*init)( mbedtls_threading_mutex_t * );
836 void (*free)( mbedtls_threading_mutex_t * );
837 int (*lock)( mbedtls_threading_mutex_t * );
838 int (*unlock)( mbedtls_threading_mutex_t * );
839} mutex_functions_t;
840static mutex_functions_t mutex_functions;
841
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100842static void mbedtls_test_mutex_usage_error( mbedtls_threading_mutex_t *mutex,
843 const char *msg )
844{
845 (void) mutex;
846 if( test_info.mutex_usage_error == NULL )
847 test_info.mutex_usage_error = msg;
848 mbedtls_fprintf( stdout, "[mutex: %s] ", msg );
849 /* Don't mark the test as failed yet. This way, if the test fails later
850 * for a functional reason, the test framework will report the message
851 * and location for this functional reason. If the test passes,
852 * mbedtls_test_mutex_usage_check() will mark it as failed. */
853}
854
Gilles Peskinec0713732021-01-29 21:17:11 +0100855static void mbedtls_test_wrap_mutex_init( mbedtls_threading_mutex_t *mutex )
856{
857 mutex_functions.init( mutex );
858}
859
860static void mbedtls_test_wrap_mutex_free( mbedtls_threading_mutex_t *mutex )
861{
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100862 switch( mutex->is_valid )
863 {
864 case MUTEX_FREED:
865 mbedtls_test_mutex_usage_error( mutex, "free without init or double free" );
866 break;
867 case MUTEX_IDLE:
868 /* Do nothing. The underlying free function will reset is_valid
869 * to 0. */
870 break;
871 case MUTEX_LOCKED:
872 mbedtls_test_mutex_usage_error( mutex, "free without unlock" );
873 break;
874 default:
875 mbedtls_test_mutex_usage_error( mutex, "corrupted state" );
876 break;
877 }
Gilles Peskinec0713732021-01-29 21:17:11 +0100878 mutex_functions.free( mutex );
879}
880
881static int mbedtls_test_wrap_mutex_lock( mbedtls_threading_mutex_t *mutex )
882{
883 int ret = mutex_functions.lock( mutex );
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100884 switch( mutex->is_valid )
885 {
886 case MUTEX_FREED:
887 mbedtls_test_mutex_usage_error( mutex, "lock without init" );
888 break;
889 case MUTEX_IDLE:
890 if( ret == 0 )
891 mutex->is_valid = 2;
892 break;
893 case MUTEX_LOCKED:
894 mbedtls_test_mutex_usage_error( mutex, "double lock" );
895 break;
896 default:
897 mbedtls_test_mutex_usage_error( mutex, "corrupted state" );
898 break;
899 }
Gilles Peskinec0713732021-01-29 21:17:11 +0100900 return( ret );
901}
902
903static int mbedtls_test_wrap_mutex_unlock( mbedtls_threading_mutex_t *mutex )
904{
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100905 int ret = mutex_functions.unlock( mutex );
906 switch( mutex->is_valid )
907 {
908 case MUTEX_FREED:
909 mbedtls_test_mutex_usage_error( mutex, "unlock without init" );
910 break;
911 case MUTEX_IDLE:
912 mbedtls_test_mutex_usage_error( mutex, "unlock without lock" );
913 break;
914 case MUTEX_LOCKED:
915 if( ret == 0 )
916 mutex->is_valid = MUTEX_IDLE;
917 break;
918 default:
919 mbedtls_test_mutex_usage_error( mutex, "corrupted state" );
920 break;
921 }
922 return( ret );
Gilles Peskinec0713732021-01-29 21:17:11 +0100923}
924
925static void mbedtls_test_mutex_usage_init( void )
926{
927 mutex_functions.init = mbedtls_mutex_init;
928 mutex_functions.free = mbedtls_mutex_free;
929 mutex_functions.lock = mbedtls_mutex_lock;
930 mutex_functions.unlock = mbedtls_mutex_unlock;
931 mbedtls_mutex_init = &mbedtls_test_wrap_mutex_init;
932 mbedtls_mutex_free = &mbedtls_test_wrap_mutex_free;
933 mbedtls_mutex_lock = &mbedtls_test_wrap_mutex_lock;
934 mbedtls_mutex_unlock = &mbedtls_test_wrap_mutex_unlock;
935}
936
Gilles Peskinecd2e2482021-01-29 21:18:09 +0100937static void mbedtls_test_mutex_usage_check( void )
938{
939 if( test_info.mutex_usage_error != NULL &&
940 test_info.result != TEST_RESULT_FAILED )
941 {
942 /* Functionally, the test passed. But there was a mutex usage error,
943 * so mark the test as failed after all. */
944 test_fail( "Mutex usage error", __LINE__, __FILE__ );
945 }
946 test_info.mutex_usage_error = NULL;
947}
948
Gilles Peskinec0713732021-01-29 21:17:11 +0100949#endif /* MBEDTLS_TEST_MUTEX_USAGE */