blob: ff3ab99e489d345a58ce1ca0d09a8b1835e06f44 [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/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000106/* Helper Functions */
107
Janos Follath8ca53b52016-10-05 10:57:49 +0100108#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
109static int redirect_output( FILE** out_stream, const char* path )
110{
111 int stdout_fd = dup( fileno( *out_stream ) );
112
113 if( stdout_fd == -1 )
114 {
115 return -1;
116 }
117
118 fflush( *out_stream );
119 fclose( *out_stream );
120 *out_stream = fopen( path, "w" );
121
122 if( *out_stream == NULL )
123 {
124 return -1;
125 }
126
127 return stdout_fd;
128}
129
130static int restore_output( FILE** out_stream, int old_fd )
131{
132 fflush( *out_stream );
133 fclose( *out_stream );
134
135 *out_stream = fdopen( old_fd, "w" );
136 if( *out_stream == NULL )
137 {
138 return -1;
139 }
140
141 return 0;
142}
Simon Butchere0192962016-10-12 23:07:30 +0100143
144static void close_output( FILE* stdout )
145{
146 fclose( stdout );
147}
Janos Follath8ca53b52016-10-05 10:57:49 +0100148#endif /* __unix__ || __APPLE__ __MACH__ */
149
Rich Evans4c091142015-02-02 12:04:10 +0000150static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000151{
152 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000153 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000154 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000155
Rich Evans4c091142015-02-02 12:04:10 +0000156 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000157 {
158 c = *ibuf++;
159 if( c >= '0' && c <= '9' )
160 c -= '0';
161 else if( c >= 'a' && c <= 'f' )
162 c -= 'a' - 10;
163 else if( c >= 'A' && c <= 'F' )
164 c -= 'A' - 10;
165 else
166 assert( 0 );
167
168 c2 = *ibuf++;
169 if( c2 >= '0' && c2 <= '9' )
170 c2 -= '0';
171 else if( c2 >= 'a' && c2 <= 'f' )
172 c2 -= 'a' - 10;
173 else if( c2 >= 'A' && c2 <= 'F' )
174 c2 -= 'A' - 10;
175 else
176 assert( 0 );
177
178 *obuf++ = ( c << 4 ) | c2;
179 }
180
181 return len;
182}
183
Rich Evans42914452015-02-02 12:09:25 +0000184static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000185{
186 unsigned char l, h;
187
Rich Evans42914452015-02-02 12:09:25 +0000188 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000189 {
Rich Evans42914452015-02-02 12:09:25 +0000190 h = *ibuf / 16;
191 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000192
193 if( h < 10 )
194 *obuf++ = '0' + h;
195 else
196 *obuf++ = 'a' + h - 10;
197
198 if( l < 10 )
199 *obuf++ = '0' + l;
200 else
201 *obuf++ = 'a' + l - 10;
202
203 ++ibuf;
204 len--;
205 }
206}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000207
208/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200209 * Allocate and zeroize a buffer.
210 *
211 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
212 *
213 * For convenience, dies if allocation fails.
214 */
215static unsigned char *zero_alloc( size_t len )
216{
217 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000218 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200219
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200220 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200221 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200222
223 memset( p, 0x00, actual_len );
224
225 return( p );
226}
227
228/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200229 * Allocate and fill a buffer from hex data.
230 *
231 * The buffer is sized exactly as needed. This allows to detect buffer
232 * overruns (including overreads) when running the test suite under valgrind.
233 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200234 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
235 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200236 * For convenience, dies if allocation fails.
237 */
238static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
239{
240 unsigned char *obuf;
241
Rich Evans42914452015-02-02 12:09:25 +0000242 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200243
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200244 if( *olen == 0 )
245 return( zero_alloc( *olen ) );
246
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200247 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200248 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200249
250 (void) unhexify( obuf, ibuf );
251
252 return( obuf );
253}
254
255/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000256 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000257 * Although predictable and often similar on multiple
258 * runs, this does not result in identical random on
259 * each run. So do not use this if the results of a
260 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000261 *
262 * rng_state shall be NULL.
263 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000264static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000265{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200266#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000267 size_t i;
268
Paul Bakker9dcc3222011-03-08 14:16:06 +0000269 if( rng_state != NULL )
270 rng_state = NULL;
271
Paul Bakkera3d195c2011-11-27 21:07:34 +0000272 for( i = 0; i < len; ++i )
273 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200274#else
275 if( rng_state != NULL )
276 rng_state = NULL;
277
278 arc4random_buf( output, len );
279#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000280
281 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000282}
283
284/**
285 * This function only returns zeros
286 *
287 * rng_state shall be NULL.
288 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000289static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000290{
291 if( rng_state != NULL )
292 rng_state = NULL;
293
Paul Bakkera3d195c2011-11-27 21:07:34 +0000294 memset( output, 0, len );
295
Paul Bakker9dcc3222011-03-08 14:16:06 +0000296 return( 0 );
297}
298
299typedef struct
300{
301 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000302 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000303} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000304
305/**
306 * This function returns random based on a buffer it receives.
307 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000308 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100309 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000310 * The number of bytes released from the buffer on each call to
311 * the random function is specified by per_call. (Can be between
312 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000313 *
314 * After the buffer is empty it will return rand();
315 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000316static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000317{
Paul Bakker997bbd12011-03-13 15:45:42 +0000318 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000319 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000320
321 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000322 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000323
Paul Bakkera3d195c2011-11-27 21:07:34 +0000324 use_len = len;
325 if( len > info->length )
326 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000327
Paul Bakkera3d195c2011-11-27 21:07:34 +0000328 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000329 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000330 memcpy( output, info->buf, use_len );
331 info->buf += use_len;
332 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000333 }
334
Paul Bakkera3d195c2011-11-27 21:07:34 +0000335 if( len - use_len > 0 )
336 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
337
338 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000339}
Paul Bakker997bbd12011-03-13 15:45:42 +0000340
341/**
342 * Info structure for the pseudo random function
343 *
344 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000345 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000346 * State( v0, v1 ) should be set to zero.
347 */
348typedef struct
349{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000350 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000351 uint32_t v0, v1;
352} rnd_pseudo_info;
353
354/**
355 * This function returns random based on a pseudo random function.
356 * This means the results should be identical on all systems.
357 * Pseudo random is based on the XTEA encryption algorithm to
358 * generate pseudorandom.
359 *
360 * rng_state shall be a pointer to a rnd_pseudo_info structure.
361 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000362static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000363{
364 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000365 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100366 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000367
368 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000369 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000370
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000371 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000372
373 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000374 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000375 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000376 sum = 0;
377
Paul Bakkera3d195c2011-11-27 21:07:34 +0000378 for( i = 0; i < 32; i++ )
379 {
Rich Evans42914452015-02-02 12:09:25 +0000380 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
381 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000382 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000383 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
384 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000385 }
386
Paul Bakker5c2364c2012-10-01 14:41:15 +0000387 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100388 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000389 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100390 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000391 }
392
Paul Bakkera3d195c2011-11-27 21:07:34 +0000393 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000394}
SimonB0269dad2016-02-17 23:34:30 +0000395
Simon Butcherd96924d2016-05-06 00:22:18 +0100396static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000397{
398 test_errors++;
399 if( test_errors == 1 )
Simon Butcher25731362016-09-30 13:11:29 +0100400 mbedtls_fprintf( stdout, "FAILED\n" );
401 mbedtls_fprintf( stdout, " %s\n at line %d, %s\n", test, line_no,
402 filename );
SimonB0269dad2016-02-17 23:34:30 +0000403}
404