blob: 39cd3c76873669b7ea6aeacf75f3bfee7d41f7dd [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
102static int test_errors = 0;
103
104
105/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100106/* Helper flags for complex dependencies */
107
108/* Indicates whether we expect mbedtls_entropy_init
109 * to initialize some strong entropy source. */
110#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
111 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
112 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
113 defined(MBEDTLS_HAVEGE_C) || \
114 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
115 defined(ENTROPY_NV_SEED) ) )
116#define MBEDTLS_ENTROPY_HAVE_STRONG
117#endif
118
119
120/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000121/* Helper Functions */
122
Janos Follath8ca53b52016-10-05 10:57:49 +0100123#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
124static int redirect_output( FILE** out_stream, const char* path )
125{
126 int stdout_fd = dup( fileno( *out_stream ) );
127
128 if( stdout_fd == -1 )
129 {
130 return -1;
131 }
132
133 fflush( *out_stream );
134 fclose( *out_stream );
135 *out_stream = fopen( path, "w" );
136
137 if( *out_stream == NULL )
138 {
139 return -1;
140 }
141
142 return stdout_fd;
143}
144
145static int restore_output( FILE** out_stream, int old_fd )
146{
147 fflush( *out_stream );
148 fclose( *out_stream );
149
150 *out_stream = fdopen( old_fd, "w" );
151 if( *out_stream == NULL )
152 {
153 return -1;
154 }
155
156 return 0;
157}
Simon Butchere0192962016-10-12 23:07:30 +0100158
Janos Follathe709f7c2016-10-13 11:26:29 +0100159static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100160{
Janos Follathe709f7c2016-10-13 11:26:29 +0100161 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100162}
Janos Follath8ca53b52016-10-05 10:57:49 +0100163#endif /* __unix__ || __APPLE__ __MACH__ */
164
Rich Evans4c091142015-02-02 12:04:10 +0000165static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000166{
167 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000168 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000169 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000170
Rich Evans4c091142015-02-02 12:04:10 +0000171 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000172 {
173 c = *ibuf++;
174 if( c >= '0' && c <= '9' )
175 c -= '0';
176 else if( c >= 'a' && c <= 'f' )
177 c -= 'a' - 10;
178 else if( c >= 'A' && c <= 'F' )
179 c -= 'A' - 10;
180 else
181 assert( 0 );
182
183 c2 = *ibuf++;
184 if( c2 >= '0' && c2 <= '9' )
185 c2 -= '0';
186 else if( c2 >= 'a' && c2 <= 'f' )
187 c2 -= 'a' - 10;
188 else if( c2 >= 'A' && c2 <= 'F' )
189 c2 -= 'A' - 10;
190 else
191 assert( 0 );
192
193 *obuf++ = ( c << 4 ) | c2;
194 }
195
196 return len;
197}
198
Rich Evans42914452015-02-02 12:09:25 +0000199static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000200{
201 unsigned char l, h;
202
Rich Evans42914452015-02-02 12:09:25 +0000203 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000204 {
Rich Evans42914452015-02-02 12:09:25 +0000205 h = *ibuf / 16;
206 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000207
208 if( h < 10 )
209 *obuf++ = '0' + h;
210 else
211 *obuf++ = 'a' + h - 10;
212
213 if( l < 10 )
214 *obuf++ = '0' + l;
215 else
216 *obuf++ = 'a' + l - 10;
217
218 ++ibuf;
219 len--;
220 }
221}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000222
223/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200224 * Allocate and zeroize a buffer.
225 *
226 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
227 *
228 * For convenience, dies if allocation fails.
229 */
230static unsigned char *zero_alloc( size_t len )
231{
232 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000233 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200234
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200235 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200236 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200237
238 memset( p, 0x00, actual_len );
239
240 return( p );
241}
242
243/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200244 * Allocate and fill a buffer from hex data.
245 *
246 * The buffer is sized exactly as needed. This allows to detect buffer
247 * overruns (including overreads) when running the test suite under valgrind.
248 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200249 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
250 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200251 * For convenience, dies if allocation fails.
252 */
253static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
254{
255 unsigned char *obuf;
256
Rich Evans42914452015-02-02 12:09:25 +0000257 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200258
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200259 if( *olen == 0 )
260 return( zero_alloc( *olen ) );
261
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200262 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200263 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200264
265 (void) unhexify( obuf, ibuf );
266
267 return( obuf );
268}
269
270/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000271 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000272 * Although predictable and often similar on multiple
273 * runs, this does not result in identical random on
274 * each run. So do not use this if the results of a
275 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000276 *
277 * rng_state shall be NULL.
278 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000279static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000280{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200281#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000282 size_t i;
283
Paul Bakker9dcc3222011-03-08 14:16:06 +0000284 if( rng_state != NULL )
285 rng_state = NULL;
286
Paul Bakkera3d195c2011-11-27 21:07:34 +0000287 for( i = 0; i < len; ++i )
288 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200289#else
290 if( rng_state != NULL )
291 rng_state = NULL;
292
293 arc4random_buf( output, len );
294#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000295
296 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000297}
298
299/**
300 * This function only returns zeros
301 *
302 * rng_state shall be NULL.
303 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000304static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000305{
306 if( rng_state != NULL )
307 rng_state = NULL;
308
Paul Bakkera3d195c2011-11-27 21:07:34 +0000309 memset( output, 0, len );
310
Paul Bakker9dcc3222011-03-08 14:16:06 +0000311 return( 0 );
312}
313
314typedef struct
315{
316 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000317 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000318} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000319
320/**
321 * This function returns random based on a buffer it receives.
322 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000323 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100324 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000325 * The number of bytes released from the buffer on each call to
326 * the random function is specified by per_call. (Can be between
327 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000328 *
329 * After the buffer is empty it will return rand();
330 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000331static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000332{
Paul Bakker997bbd12011-03-13 15:45:42 +0000333 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000334 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000335
336 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000337 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000338
Paul Bakkera3d195c2011-11-27 21:07:34 +0000339 use_len = len;
340 if( len > info->length )
341 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000342
Paul Bakkera3d195c2011-11-27 21:07:34 +0000343 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000344 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000345 memcpy( output, info->buf, use_len );
346 info->buf += use_len;
347 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000348 }
349
Paul Bakkera3d195c2011-11-27 21:07:34 +0000350 if( len - use_len > 0 )
351 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
352
353 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000354}
Paul Bakker997bbd12011-03-13 15:45:42 +0000355
356/**
357 * Info structure for the pseudo random function
358 *
359 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000360 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000361 * State( v0, v1 ) should be set to zero.
362 */
363typedef struct
364{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000365 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000366 uint32_t v0, v1;
367} rnd_pseudo_info;
368
369/**
370 * This function returns random based on a pseudo random function.
371 * This means the results should be identical on all systems.
372 * Pseudo random is based on the XTEA encryption algorithm to
373 * generate pseudorandom.
374 *
375 * rng_state shall be a pointer to a rnd_pseudo_info structure.
376 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000377static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000378{
379 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000380 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100381 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000382
383 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000384 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000385
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000386 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000387
388 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000389 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000390 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000391 sum = 0;
392
Paul Bakkera3d195c2011-11-27 21:07:34 +0000393 for( i = 0; i < 32; i++ )
394 {
Rich Evans42914452015-02-02 12:09:25 +0000395 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
396 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000397 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000398 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
399 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000400 }
401
Paul Bakker5c2364c2012-10-01 14:41:15 +0000402 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100403 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000404 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100405 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000406 }
407
Paul Bakkera3d195c2011-11-27 21:07:34 +0000408 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000409}
SimonB0269dad2016-02-17 23:34:30 +0000410
Simon Butcherd96924d2016-05-06 00:22:18 +0100411static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000412{
413 test_errors++;
414 if( test_errors == 1 )
Simon Butcher25731362016-09-30 13:11:29 +0100415 mbedtls_fprintf( stdout, "FAILED\n" );
416 mbedtls_fprintf( stdout, " %s\n at line %d, %s\n", test, line_no,
417 filename );
SimonB0269dad2016-02-17 23:34:30 +0000418}