blob: 797fac27fc0228ae225e183b1933abe554a767b7 [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
Simon Butcher638dceb2018-10-03 16:17:41 +0100131void test_fail( const char *test, int line_no, const char* filename )
132{
133 test_info.failed = 1;
134 test_info.test = test;
135 test_info.line_no = line_no;
136 test_info.filename = filename;
137}
138
Janos Follath8ca53b52016-10-05 10:57:49 +0100139#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
140static int redirect_output( FILE** out_stream, const char* path )
141{
142 int stdout_fd = dup( fileno( *out_stream ) );
143
144 if( stdout_fd == -1 )
145 {
146 return -1;
147 }
148
149 fflush( *out_stream );
150 fclose( *out_stream );
151 *out_stream = fopen( path, "w" );
152
153 if( *out_stream == NULL )
154 {
Andres Amaya Garcia97a184b2018-11-26 21:23:28 +0000155 close( stdout_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100156 return -1;
157 }
158
159 return stdout_fd;
160}
161
162static int restore_output( FILE** out_stream, int old_fd )
163{
164 fflush( *out_stream );
165 fclose( *out_stream );
166
167 *out_stream = fdopen( old_fd, "w" );
168 if( *out_stream == NULL )
169 {
170 return -1;
171 }
172
173 return 0;
174}
Simon Butchere0192962016-10-12 23:07:30 +0100175
Janos Follathe709f7c2016-10-13 11:26:29 +0100176static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100177{
Janos Follathe709f7c2016-10-13 11:26:29 +0100178 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100179}
Janos Follath8ca53b52016-10-05 10:57:49 +0100180#endif /* __unix__ || __APPLE__ __MACH__ */
181
Simon Butcher638dceb2018-10-03 16:17:41 +0100182int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000183{
184 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000185 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000186 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000187
Rich Evans4c091142015-02-02 12:04:10 +0000188 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000189 {
190 c = *ibuf++;
191 if( c >= '0' && c <= '9' )
192 c -= '0';
193 else if( c >= 'a' && c <= 'f' )
194 c -= 'a' - 10;
195 else if( c >= 'A' && c <= 'F' )
196 c -= 'A' - 10;
197 else
198 assert( 0 );
199
200 c2 = *ibuf++;
201 if( c2 >= '0' && c2 <= '9' )
202 c2 -= '0';
203 else if( c2 >= 'a' && c2 <= 'f' )
204 c2 -= 'a' - 10;
205 else if( c2 >= 'A' && c2 <= 'F' )
206 c2 -= 'A' - 10;
207 else
208 assert( 0 );
209
210 *obuf++ = ( c << 4 ) | c2;
211 }
212
213 return len;
214}
215
Simon Butcher638dceb2018-10-03 16:17:41 +0100216void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000217{
218 unsigned char l, h;
219
Rich Evans42914452015-02-02 12:09:25 +0000220 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000221 {
Rich Evans42914452015-02-02 12:09:25 +0000222 h = *ibuf / 16;
223 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000224
225 if( h < 10 )
226 *obuf++ = '0' + h;
227 else
228 *obuf++ = 'a' + h - 10;
229
230 if( l < 10 )
231 *obuf++ = '0' + l;
232 else
233 *obuf++ = 'a' + l - 10;
234
235 ++ibuf;
236 len--;
237 }
238}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000239
240/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200241 * Allocate and zeroize a buffer.
242 *
243 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
244 *
245 * For convenience, dies if allocation fails.
246 */
247static unsigned char *zero_alloc( size_t len )
248{
249 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000250 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200251
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200252 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200253 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200254
255 memset( p, 0x00, actual_len );
256
257 return( p );
258}
259
260/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200261 * Allocate and fill a buffer from hex data.
262 *
263 * The buffer is sized exactly as needed. This allows to detect buffer
264 * overruns (including overreads) when running the test suite under valgrind.
265 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200266 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
267 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200268 * For convenience, dies if allocation fails.
269 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100270unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200271{
272 unsigned char *obuf;
273
Rich Evans42914452015-02-02 12:09:25 +0000274 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200275
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200276 if( *olen == 0 )
277 return( zero_alloc( *olen ) );
278
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200279 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200280 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200281
282 (void) unhexify( obuf, ibuf );
283
284 return( obuf );
285}
286
287/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000288 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000289 * Although predictable and often similar on multiple
290 * runs, this does not result in identical random on
291 * each run. So do not use this if the results of a
292 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000293 *
294 * rng_state shall be NULL.
295 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000296static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000297{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200298#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000299 size_t i;
300
Paul Bakker9dcc3222011-03-08 14:16:06 +0000301 if( rng_state != NULL )
302 rng_state = NULL;
303
Paul Bakkera3d195c2011-11-27 21:07:34 +0000304 for( i = 0; i < len; ++i )
305 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200306#else
307 if( rng_state != NULL )
308 rng_state = NULL;
309
310 arc4random_buf( output, len );
311#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000312
313 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000314}
315
316/**
317 * This function only returns zeros
318 *
319 * rng_state shall be NULL.
320 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100321int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000322{
323 if( rng_state != NULL )
324 rng_state = NULL;
325
Paul Bakkera3d195c2011-11-27 21:07:34 +0000326 memset( output, 0, len );
327
Paul Bakker9dcc3222011-03-08 14:16:06 +0000328 return( 0 );
329}
330
331typedef struct
332{
333 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000334 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000335} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000336
337/**
338 * This function returns random based on a buffer it receives.
339 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000340 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100341 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000342 * The number of bytes released from the buffer on each call to
343 * the random function is specified by per_call. (Can be between
344 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000345 *
346 * After the buffer is empty it will return rand();
347 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100348int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000349{
Paul Bakker997bbd12011-03-13 15:45:42 +0000350 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000351 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000352
353 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000354 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000355
Paul Bakkera3d195c2011-11-27 21:07:34 +0000356 use_len = len;
357 if( len > info->length )
358 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000359
Paul Bakkera3d195c2011-11-27 21:07:34 +0000360 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000361 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000362 memcpy( output, info->buf, use_len );
363 info->buf += use_len;
364 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000365 }
366
Paul Bakkera3d195c2011-11-27 21:07:34 +0000367 if( len - use_len > 0 )
368 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
369
370 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000371}
Paul Bakker997bbd12011-03-13 15:45:42 +0000372
373/**
374 * Info structure for the pseudo random function
375 *
376 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000377 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000378 * State( v0, v1 ) should be set to zero.
379 */
380typedef struct
381{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000382 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000383 uint32_t v0, v1;
384} rnd_pseudo_info;
385
386/**
387 * This function returns random based on a pseudo random function.
388 * This means the results should be identical on all systems.
389 * Pseudo random is based on the XTEA encryption algorithm to
390 * generate pseudorandom.
391 *
392 * rng_state shall be a pointer to a rnd_pseudo_info structure.
393 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100394int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000395{
396 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000397 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100398 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000399
400 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000401 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000402
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000403 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000404
405 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000406 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000407 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000408 sum = 0;
409
Paul Bakkera3d195c2011-11-27 21:07:34 +0000410 for( i = 0; i < 32; i++ )
411 {
Rich Evans42914452015-02-02 12:09:25 +0000412 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
413 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000414 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000415 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
416 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000417 }
418
Paul Bakker5c2364c2012-10-01 14:41:15 +0000419 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100420 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000421 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100422 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000423 }
424
Paul Bakkera3d195c2011-11-27 21:07:34 +0000425 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000426}
SimonB0269dad2016-02-17 23:34:30 +0000427