blob: 8f04885a52b6309a3514f27635b580d3ae9d3323 [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>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000039#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010040#endif
SimonB0269dad2016-02-17 23:34:30 +000041
42/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010043/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000044
SimonB8ca7bc42016-04-17 23:24:50 +010045#define DEPENDENCY_SUPPORTED 0
46#define DEPENDENCY_NOT_SUPPORTED 1
47
48#define KEY_VALUE_MAPPING_FOUND 0
49#define KEY_VALUE_MAPPING_NOT_FOUND -1
50
51#define DISPATCH_TEST_SUCCESS 0
52#define DISPATCH_TEST_FN_NOT_FOUND 1
53#define DISPATCH_INVALID_TEST_DATA 2
54#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000055
56
57/*----------------------------------------------------------------------------*/
58/* Macros */
59
60#define TEST_ASSERT( TEST ) \
61 do { \
62 if( ! (TEST) ) \
63 { \
SimonB31a6c492016-05-02 21:32:44 +010064 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000065 goto exit; \
66 } \
67 } while( 0 )
68
Rich Evans4c091142015-02-02 12:04:10 +000069#define assert(a) if( !( a ) ) \
70{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020071 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000072 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020073 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000074}
75
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000076/*
77 * 32-bit integer manipulation macros (big endian)
78 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000079#ifndef GET_UINT32_BE
80#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000081{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000082 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
83 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
84 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
85 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000086}
87#endif
88
Paul Bakker5c2364c2012-10-01 14:41:15 +000089#ifndef PUT_UINT32_BE
90#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000091{ \
92 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
93 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
94 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
95 (b)[(i) + 3] = (unsigned char) ( (n) ); \
96}
97#endif
98
SimonB0269dad2016-02-17 23:34:30 +000099
100/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100101/* Global variables */
102
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100103
104static struct
105{
106 int failed;
107 const char *test;
108 const char *filename;
109 int line_no;
110}
111test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100112
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400113#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400114mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400115#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100116
117/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100118/* Helper flags for complex dependencies */
119
120/* Indicates whether we expect mbedtls_entropy_init
121 * to initialize some strong entropy source. */
122#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
123 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
124 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
125 defined(MBEDTLS_HAVEGE_C) || \
126 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
127 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100128#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100129#endif
130
131
132/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000133/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400134static int platform_setup()
135{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400136 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400137#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400138 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400139#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400140 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400141}
142
143static void platform_teardown()
144{
145#if defined(MBEDTLS_PLATFORM_C)
146 mbedtls_platform_teardown( &platform_ctx );
147#endif /* MBEDTLS_PLATFORM_C */
148}
SimonB0269dad2016-02-17 23:34:30 +0000149
Janos Follath8ca53b52016-10-05 10:57:49 +0100150#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
151static int redirect_output( FILE** out_stream, const char* path )
152{
153 int stdout_fd = dup( fileno( *out_stream ) );
154
155 if( stdout_fd == -1 )
156 {
157 return -1;
158 }
159
160 fflush( *out_stream );
161 fclose( *out_stream );
162 *out_stream = fopen( path, "w" );
163
164 if( *out_stream == NULL )
165 {
166 return -1;
167 }
168
169 return stdout_fd;
170}
171
172static int restore_output( FILE** out_stream, int old_fd )
173{
174 fflush( *out_stream );
175 fclose( *out_stream );
176
177 *out_stream = fdopen( old_fd, "w" );
178 if( *out_stream == NULL )
179 {
180 return -1;
181 }
182
183 return 0;
184}
Simon Butchere0192962016-10-12 23:07:30 +0100185
Janos Follathe709f7c2016-10-13 11:26:29 +0100186static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100187{
Janos Follathe709f7c2016-10-13 11:26:29 +0100188 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100189}
Janos Follath8ca53b52016-10-05 10:57:49 +0100190#endif /* __unix__ || __APPLE__ __MACH__ */
191
Rich Evans4c091142015-02-02 12:04:10 +0000192static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000193{
194 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000195 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000196 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000197
Rich Evans4c091142015-02-02 12:04:10 +0000198 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000199 {
200 c = *ibuf++;
201 if( c >= '0' && c <= '9' )
202 c -= '0';
203 else if( c >= 'a' && c <= 'f' )
204 c -= 'a' - 10;
205 else if( c >= 'A' && c <= 'F' )
206 c -= 'A' - 10;
207 else
208 assert( 0 );
209
210 c2 = *ibuf++;
211 if( c2 >= '0' && c2 <= '9' )
212 c2 -= '0';
213 else if( c2 >= 'a' && c2 <= 'f' )
214 c2 -= 'a' - 10;
215 else if( c2 >= 'A' && c2 <= 'F' )
216 c2 -= 'A' - 10;
217 else
218 assert( 0 );
219
220 *obuf++ = ( c << 4 ) | c2;
221 }
222
223 return len;
224}
225
Rich Evans42914452015-02-02 12:09:25 +0000226static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000227{
228 unsigned char l, h;
229
Rich Evans42914452015-02-02 12:09:25 +0000230 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000231 {
Rich Evans42914452015-02-02 12:09:25 +0000232 h = *ibuf / 16;
233 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000234
235 if( h < 10 )
236 *obuf++ = '0' + h;
237 else
238 *obuf++ = 'a' + h - 10;
239
240 if( l < 10 )
241 *obuf++ = '0' + l;
242 else
243 *obuf++ = 'a' + l - 10;
244
245 ++ibuf;
246 len--;
247 }
248}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000249
250/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200251 * Allocate and zeroize a buffer.
252 *
253 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
254 *
255 * For convenience, dies if allocation fails.
256 */
257static unsigned char *zero_alloc( size_t len )
258{
259 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000260 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200261
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200262 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200263 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200264
265 memset( p, 0x00, actual_len );
266
267 return( p );
268}
269
270/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200271 * Allocate and fill a buffer from hex data.
272 *
273 * The buffer is sized exactly as needed. This allows to detect buffer
274 * overruns (including overreads) when running the test suite under valgrind.
275 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200276 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
277 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200278 * For convenience, dies if allocation fails.
279 */
280static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
281{
282 unsigned char *obuf;
283
Rich Evans42914452015-02-02 12:09:25 +0000284 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200285
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200286 if( *olen == 0 )
287 return( zero_alloc( *olen ) );
288
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200289 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200290 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200291
292 (void) unhexify( obuf, ibuf );
293
294 return( obuf );
295}
296
297/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000298 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000299 * Although predictable and often similar on multiple
300 * runs, this does not result in identical random on
301 * each run. So do not use this if the results of a
302 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000303 *
304 * rng_state shall be NULL.
305 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000306static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000307{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200308#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000309 size_t i;
310
Paul Bakker9dcc3222011-03-08 14:16:06 +0000311 if( rng_state != NULL )
312 rng_state = NULL;
313
Paul Bakkera3d195c2011-11-27 21:07:34 +0000314 for( i = 0; i < len; ++i )
315 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200316#else
317 if( rng_state != NULL )
318 rng_state = NULL;
319
320 arc4random_buf( output, len );
321#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000322
323 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000324}
325
326/**
327 * This function only returns zeros
328 *
329 * rng_state shall be NULL.
330 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000331static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000332{
333 if( rng_state != NULL )
334 rng_state = NULL;
335
Paul Bakkera3d195c2011-11-27 21:07:34 +0000336 memset( output, 0, len );
337
Paul Bakker9dcc3222011-03-08 14:16:06 +0000338 return( 0 );
339}
340
341typedef struct
342{
343 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000344 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000345} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000346
347/**
348 * This function returns random based on a buffer it receives.
349 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000350 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100351 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000352 * The number of bytes released from the buffer on each call to
353 * the random function is specified by per_call. (Can be between
354 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000355 *
356 * After the buffer is empty it will return rand();
357 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000358static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000359{
Paul Bakker997bbd12011-03-13 15:45:42 +0000360 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000361 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000362
363 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000364 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000365
Paul Bakkera3d195c2011-11-27 21:07:34 +0000366 use_len = len;
367 if( len > info->length )
368 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000369
Paul Bakkera3d195c2011-11-27 21:07:34 +0000370 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000371 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000372 memcpy( output, info->buf, use_len );
373 info->buf += use_len;
374 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000375 }
376
Paul Bakkera3d195c2011-11-27 21:07:34 +0000377 if( len - use_len > 0 )
378 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
379
380 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000381}
Paul Bakker997bbd12011-03-13 15:45:42 +0000382
383/**
384 * Info structure for the pseudo random function
385 *
386 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000387 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000388 * State( v0, v1 ) should be set to zero.
389 */
390typedef struct
391{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000392 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000393 uint32_t v0, v1;
394} rnd_pseudo_info;
395
396/**
397 * This function returns random based on a pseudo random function.
398 * This means the results should be identical on all systems.
399 * Pseudo random is based on the XTEA encryption algorithm to
400 * generate pseudorandom.
401 *
402 * rng_state shall be a pointer to a rnd_pseudo_info structure.
403 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000404static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000405{
406 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000407 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100408 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000409
410 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000411 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000412
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000413 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000414
415 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000416 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000417 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000418 sum = 0;
419
Paul Bakkera3d195c2011-11-27 21:07:34 +0000420 for( i = 0; i < 32; i++ )
421 {
Rich Evans42914452015-02-02 12:09:25 +0000422 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
423 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000424 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000425 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
426 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000427 }
428
Paul Bakker5c2364c2012-10-01 14:41:15 +0000429 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100430 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000431 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100432 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000433 }
434
Paul Bakkera3d195c2011-11-27 21:07:34 +0000435 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000436}
SimonB0269dad2016-02-17 23:34:30 +0000437
Simon Butcherd96924d2016-05-06 00:22:18 +0100438static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000439{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100440 test_info.failed = 1;
441 test_info.test = test;
442 test_info.line_no = line_no;
443 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000444}