blob: e716318b1d1b12d5215c346c231641f681ff18de [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
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400112#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400113mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400114#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100115
116/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100117/* Helper flags for complex dependencies */
118
119/* Indicates whether we expect mbedtls_entropy_init
120 * to initialize some strong entropy source. */
121#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
122 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
123 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
124 defined(MBEDTLS_HAVEGE_C) || \
125 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
126 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100127#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100128#endif
129
130
131/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000132/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400133static int platform_setup()
134{
135#if defined(MBEDTLS_PLATFORM_C)
136 if( mbedtls_platform_setup( &platform_ctx ) )
137 {
138 return -1;
139 }
140#endif /* MBEDTLS_PLATFORM_C */
141 return 0;
142}
143
144static void platform_teardown()
145{
146#if defined(MBEDTLS_PLATFORM_C)
147 mbedtls_platform_teardown( &platform_ctx );
148#endif /* MBEDTLS_PLATFORM_C */
149}
SimonB0269dad2016-02-17 23:34:30 +0000150
Janos Follath8ca53b52016-10-05 10:57:49 +0100151#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
152static int redirect_output( FILE** out_stream, const char* path )
153{
154 int stdout_fd = dup( fileno( *out_stream ) );
155
156 if( stdout_fd == -1 )
157 {
158 return -1;
159 }
160
161 fflush( *out_stream );
162 fclose( *out_stream );
163 *out_stream = fopen( path, "w" );
164
165 if( *out_stream == NULL )
166 {
167 return -1;
168 }
169
170 return stdout_fd;
171}
172
173static int restore_output( FILE** out_stream, int old_fd )
174{
175 fflush( *out_stream );
176 fclose( *out_stream );
177
178 *out_stream = fdopen( old_fd, "w" );
179 if( *out_stream == NULL )
180 {
181 return -1;
182 }
183
184 return 0;
185}
Simon Butchere0192962016-10-12 23:07:30 +0100186
Janos Follathe709f7c2016-10-13 11:26:29 +0100187static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100188{
Janos Follathe709f7c2016-10-13 11:26:29 +0100189 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100190}
Janos Follath8ca53b52016-10-05 10:57:49 +0100191#endif /* __unix__ || __APPLE__ __MACH__ */
192
Rich Evans4c091142015-02-02 12:04:10 +0000193static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000194{
195 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000196 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000197 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000198
Rich Evans4c091142015-02-02 12:04:10 +0000199 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000200 {
201 c = *ibuf++;
202 if( c >= '0' && c <= '9' )
203 c -= '0';
204 else if( c >= 'a' && c <= 'f' )
205 c -= 'a' - 10;
206 else if( c >= 'A' && c <= 'F' )
207 c -= 'A' - 10;
208 else
209 assert( 0 );
210
211 c2 = *ibuf++;
212 if( c2 >= '0' && c2 <= '9' )
213 c2 -= '0';
214 else if( c2 >= 'a' && c2 <= 'f' )
215 c2 -= 'a' - 10;
216 else if( c2 >= 'A' && c2 <= 'F' )
217 c2 -= 'A' - 10;
218 else
219 assert( 0 );
220
221 *obuf++ = ( c << 4 ) | c2;
222 }
223
224 return len;
225}
226
Rich Evans42914452015-02-02 12:09:25 +0000227static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000228{
229 unsigned char l, h;
230
Rich Evans42914452015-02-02 12:09:25 +0000231 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000232 {
Rich Evans42914452015-02-02 12:09:25 +0000233 h = *ibuf / 16;
234 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000235
236 if( h < 10 )
237 *obuf++ = '0' + h;
238 else
239 *obuf++ = 'a' + h - 10;
240
241 if( l < 10 )
242 *obuf++ = '0' + l;
243 else
244 *obuf++ = 'a' + l - 10;
245
246 ++ibuf;
247 len--;
248 }
249}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000250
251/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200252 * Allocate and zeroize a buffer.
253 *
254 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
255 *
256 * For convenience, dies if allocation fails.
257 */
258static unsigned char *zero_alloc( size_t len )
259{
260 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000261 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200262
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200263 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200264 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200265
266 memset( p, 0x00, actual_len );
267
268 return( p );
269}
270
271/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200272 * Allocate and fill a buffer from hex data.
273 *
274 * The buffer is sized exactly as needed. This allows to detect buffer
275 * overruns (including overreads) when running the test suite under valgrind.
276 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200277 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
278 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200279 * For convenience, dies if allocation fails.
280 */
281static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
282{
283 unsigned char *obuf;
284
Rich Evans42914452015-02-02 12:09:25 +0000285 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200286
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200287 if( *olen == 0 )
288 return( zero_alloc( *olen ) );
289
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200290 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200291 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200292
293 (void) unhexify( obuf, ibuf );
294
295 return( obuf );
296}
297
298/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000299 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000300 * Although predictable and often similar on multiple
301 * runs, this does not result in identical random on
302 * each run. So do not use this if the results of a
303 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000304 *
305 * rng_state shall be NULL.
306 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000307static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000308{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200309#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000310 size_t i;
311
Paul Bakker9dcc3222011-03-08 14:16:06 +0000312 if( rng_state != NULL )
313 rng_state = NULL;
314
Paul Bakkera3d195c2011-11-27 21:07:34 +0000315 for( i = 0; i < len; ++i )
316 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200317#else
318 if( rng_state != NULL )
319 rng_state = NULL;
320
321 arc4random_buf( output, len );
322#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000323
324 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000325}
326
327/**
328 * This function only returns zeros
329 *
330 * rng_state shall be NULL.
331 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000332static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000333{
334 if( rng_state != NULL )
335 rng_state = NULL;
336
Paul Bakkera3d195c2011-11-27 21:07:34 +0000337 memset( output, 0, len );
338
Paul Bakker9dcc3222011-03-08 14:16:06 +0000339 return( 0 );
340}
341
342typedef struct
343{
344 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000345 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000346} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000347
348/**
349 * This function returns random based on a buffer it receives.
350 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000351 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100352 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000353 * The number of bytes released from the buffer on each call to
354 * the random function is specified by per_call. (Can be between
355 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000356 *
357 * After the buffer is empty it will return rand();
358 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000359static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000360{
Paul Bakker997bbd12011-03-13 15:45:42 +0000361 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000362 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000363
364 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000365 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000366
Paul Bakkera3d195c2011-11-27 21:07:34 +0000367 use_len = len;
368 if( len > info->length )
369 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000370
Paul Bakkera3d195c2011-11-27 21:07:34 +0000371 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000372 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000373 memcpy( output, info->buf, use_len );
374 info->buf += use_len;
375 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000376 }
377
Paul Bakkera3d195c2011-11-27 21:07:34 +0000378 if( len - use_len > 0 )
379 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
380
381 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000382}
Paul Bakker997bbd12011-03-13 15:45:42 +0000383
384/**
385 * Info structure for the pseudo random function
386 *
387 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000388 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000389 * State( v0, v1 ) should be set to zero.
390 */
391typedef struct
392{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000393 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000394 uint32_t v0, v1;
395} rnd_pseudo_info;
396
397/**
398 * This function returns random based on a pseudo random function.
399 * This means the results should be identical on all systems.
400 * Pseudo random is based on the XTEA encryption algorithm to
401 * generate pseudorandom.
402 *
403 * rng_state shall be a pointer to a rnd_pseudo_info structure.
404 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000405static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000406{
407 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000408 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100409 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000410
411 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000412 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000413
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000414 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000415
416 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000417 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000418 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000419 sum = 0;
420
Paul Bakkera3d195c2011-11-27 21:07:34 +0000421 for( i = 0; i < 32; i++ )
422 {
Rich Evans42914452015-02-02 12:09:25 +0000423 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
424 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000425 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000426 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
427 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000428 }
429
Paul Bakker5c2364c2012-10-01 14:41:15 +0000430 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100431 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000432 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100433 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000434 }
435
Paul Bakkera3d195c2011-11-27 21:07:34 +0000436 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000437}
SimonB0269dad2016-02-17 23:34:30 +0000438
Simon Butcherd96924d2016-05-06 00:22:18 +0100439static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000440{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100441 test_info.failed = 1;
442 test_info.test = test;
443 test_info.line_no = line_no;
444 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000445}