blob: eef41c79a6c96071b892eadeff889627020f69b3 [file] [log] [blame]
SimonB15942102016-04-25 21:34:49 +01001#line 1 "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
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000026#ifdef _MSC_VER
27#include <basetsd.h>
28typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000029#define strncasecmp _strnicmp
30#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000031#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020032#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033#endif
34
Paul Bakker19343182013-08-16 13:31:10 +020035#include <string.h>
36
Janos Follath8ca53b52016-10-05 10:57:49 +010037#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
38#include <unistd.h>
39#endif
SimonB0269dad2016-02-17 23:34:30 +000040
41/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010042/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000043
SimonB8ca7bc42016-04-17 23:24:50 +010044#define DEPENDENCY_SUPPORTED 0
45#define DEPENDENCY_NOT_SUPPORTED 1
46
47#define KEY_VALUE_MAPPING_FOUND 0
48#define KEY_VALUE_MAPPING_NOT_FOUND -1
49
50#define DISPATCH_TEST_SUCCESS 0
51#define DISPATCH_TEST_FN_NOT_FOUND 1
52#define DISPATCH_INVALID_TEST_DATA 2
53#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000054
55
56/*----------------------------------------------------------------------------*/
57/* Macros */
58
59#define TEST_ASSERT( TEST ) \
60 do { \
61 if( ! (TEST) ) \
62 { \
SimonB31a6c492016-05-02 21:32:44 +010063 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000064 goto exit; \
65 } \
66 } while( 0 )
67
Rich Evans4c091142015-02-02 12:04:10 +000068#define assert(a) if( !( a ) ) \
69{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020070 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000071 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020072 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000073}
74
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000075/*
76 * 32-bit integer manipulation macros (big endian)
77 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000078#ifndef GET_UINT32_BE
79#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000080{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000081 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
82 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
83 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
84 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000085}
86#endif
87
Paul Bakker5c2364c2012-10-01 14:41:15 +000088#ifndef PUT_UINT32_BE
89#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000090{ \
91 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
92 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
93 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
94 (b)[(i) + 3] = (unsigned char) ( (n) ); \
95}
96#endif
97
SimonB0269dad2016-02-17 23:34:30 +000098
99/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100100/* Global variables */
101
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100102
103static struct
104{
105 int failed;
106 const char *test;
107 const char *filename;
108 int line_no;
109}
110test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100111
112
113/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100114/* Helper flags for complex dependencies */
115
116/* Indicates whether we expect mbedtls_entropy_init
117 * to initialize some strong entropy source. */
118#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
119 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
120 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
121 defined(MBEDTLS_HAVEGE_C) || \
122 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
123 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100124#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100125#endif
126
127
128/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000129/* Helper Functions */
130
Janos Follath8ca53b52016-10-05 10:57:49 +0100131#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
132static int redirect_output( FILE** out_stream, const char* path )
133{
134 int stdout_fd = dup( fileno( *out_stream ) );
135
136 if( stdout_fd == -1 )
137 {
138 return -1;
139 }
140
141 fflush( *out_stream );
142 fclose( *out_stream );
143 *out_stream = fopen( path, "w" );
144
145 if( *out_stream == NULL )
146 {
147 return -1;
148 }
149
150 return stdout_fd;
151}
152
153static int restore_output( FILE** out_stream, int old_fd )
154{
155 fflush( *out_stream );
156 fclose( *out_stream );
157
158 *out_stream = fdopen( old_fd, "w" );
159 if( *out_stream == NULL )
160 {
161 return -1;
162 }
163
164 return 0;
165}
Simon Butchere0192962016-10-12 23:07:30 +0100166
Janos Follathe709f7c2016-10-13 11:26:29 +0100167static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100168{
Janos Follathe709f7c2016-10-13 11:26:29 +0100169 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100170}
Janos Follath8ca53b52016-10-05 10:57:49 +0100171#endif /* __unix__ || __APPLE__ __MACH__ */
172
Rich Evans4c091142015-02-02 12:04:10 +0000173static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000174{
175 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000176 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000177 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000178
Rich Evans4c091142015-02-02 12:04:10 +0000179 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000180 {
181 c = *ibuf++;
182 if( c >= '0' && c <= '9' )
183 c -= '0';
184 else if( c >= 'a' && c <= 'f' )
185 c -= 'a' - 10;
186 else if( c >= 'A' && c <= 'F' )
187 c -= 'A' - 10;
188 else
189 assert( 0 );
190
191 c2 = *ibuf++;
192 if( c2 >= '0' && c2 <= '9' )
193 c2 -= '0';
194 else if( c2 >= 'a' && c2 <= 'f' )
195 c2 -= 'a' - 10;
196 else if( c2 >= 'A' && c2 <= 'F' )
197 c2 -= 'A' - 10;
198 else
199 assert( 0 );
200
201 *obuf++ = ( c << 4 ) | c2;
202 }
203
204 return len;
205}
206
Rich Evans42914452015-02-02 12:09:25 +0000207static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000208{
209 unsigned char l, h;
210
Rich Evans42914452015-02-02 12:09:25 +0000211 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000212 {
Rich Evans42914452015-02-02 12:09:25 +0000213 h = *ibuf / 16;
214 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000215
216 if( h < 10 )
217 *obuf++ = '0' + h;
218 else
219 *obuf++ = 'a' + h - 10;
220
221 if( l < 10 )
222 *obuf++ = '0' + l;
223 else
224 *obuf++ = 'a' + l - 10;
225
226 ++ibuf;
227 len--;
228 }
229}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000230
231/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200232 * Allocate and zeroize a buffer.
233 *
234 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
235 *
236 * For convenience, dies if allocation fails.
237 */
238static unsigned char *zero_alloc( size_t len )
239{
240 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000241 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200242
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200243 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200244 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200245
246 memset( p, 0x00, actual_len );
247
248 return( p );
249}
250
251/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200252 * Allocate and fill a buffer from hex data.
253 *
254 * The buffer is sized exactly as needed. This allows to detect buffer
255 * overruns (including overreads) when running the test suite under valgrind.
256 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200257 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
258 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200259 * For convenience, dies if allocation fails.
260 */
261static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
262{
263 unsigned char *obuf;
264
Rich Evans42914452015-02-02 12:09:25 +0000265 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200266
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200267 if( *olen == 0 )
268 return( zero_alloc( *olen ) );
269
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200270 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200271 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200272
273 (void) unhexify( obuf, ibuf );
274
275 return( obuf );
276}
277
278/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000279 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000280 * Although predictable and often similar on multiple
281 * runs, this does not result in identical random on
282 * each run. So do not use this if the results of a
283 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000284 *
285 * rng_state shall be NULL.
286 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000287static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000288{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200289#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000290 size_t i;
291
Paul Bakker9dcc3222011-03-08 14:16:06 +0000292 if( rng_state != NULL )
293 rng_state = NULL;
294
Paul Bakkera3d195c2011-11-27 21:07:34 +0000295 for( i = 0; i < len; ++i )
296 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200297#else
298 if( rng_state != NULL )
299 rng_state = NULL;
300
301 arc4random_buf( output, len );
302#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000303
304 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000305}
306
307/**
308 * This function only returns zeros
309 *
310 * rng_state shall be NULL.
311 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000312static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000313{
314 if( rng_state != NULL )
315 rng_state = NULL;
316
Paul Bakkera3d195c2011-11-27 21:07:34 +0000317 memset( output, 0, len );
318
Paul Bakker9dcc3222011-03-08 14:16:06 +0000319 return( 0 );
320}
321
322typedef struct
323{
324 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000325 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000326} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000327
328/**
329 * This function returns random based on a buffer it receives.
330 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000331 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100332 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000333 * The number of bytes released from the buffer on each call to
334 * the random function is specified by per_call. (Can be between
335 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000336 *
337 * After the buffer is empty it will return rand();
338 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000339static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000340{
Paul Bakker997bbd12011-03-13 15:45:42 +0000341 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000342 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000343
344 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000345 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000346
Paul Bakkera3d195c2011-11-27 21:07:34 +0000347 use_len = len;
348 if( len > info->length )
349 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000350
Paul Bakkera3d195c2011-11-27 21:07:34 +0000351 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000352 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000353 memcpy( output, info->buf, use_len );
354 info->buf += use_len;
355 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000356 }
357
Paul Bakkera3d195c2011-11-27 21:07:34 +0000358 if( len - use_len > 0 )
359 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
360
361 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000362}
Paul Bakker997bbd12011-03-13 15:45:42 +0000363
364/**
365 * Info structure for the pseudo random function
366 *
367 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000368 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000369 * State( v0, v1 ) should be set to zero.
370 */
371typedef struct
372{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000373 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000374 uint32_t v0, v1;
375} rnd_pseudo_info;
376
377/**
378 * This function returns random based on a pseudo random function.
379 * This means the results should be identical on all systems.
380 * Pseudo random is based on the XTEA encryption algorithm to
381 * generate pseudorandom.
382 *
383 * rng_state shall be a pointer to a rnd_pseudo_info structure.
384 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000385static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000386{
387 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000388 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100389 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000390
391 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000392 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000393
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000394 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000395
396 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000397 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000398 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000399 sum = 0;
400
Paul Bakkera3d195c2011-11-27 21:07:34 +0000401 for( i = 0; i < 32; i++ )
402 {
Rich Evans42914452015-02-02 12:09:25 +0000403 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
404 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000405 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000406 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
407 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000408 }
409
Paul Bakker5c2364c2012-10-01 14:41:15 +0000410 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100411 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000412 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100413 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000414 }
415
Paul Bakkera3d195c2011-11-27 21:07:34 +0000416 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000417}
SimonB0269dad2016-02-17 23:34:30 +0000418
Simon Butcherd96924d2016-05-06 00:22:18 +0100419static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000420{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100421 test_info.failed = 1;
422 test_info.test = test;
423 test_info.line_no = line_no;
424 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000425}