blob: cac104a3b8fb01dca3e8d56a498adaa33f4370ac [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/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000114/* Helper Functions */
115
Janos Follath8ca53b52016-10-05 10:57:49 +0100116#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
117static int redirect_output( FILE** out_stream, const char* path )
118{
119 int stdout_fd = dup( fileno( *out_stream ) );
120
121 if( stdout_fd == -1 )
122 {
123 return -1;
124 }
125
126 fflush( *out_stream );
127 fclose( *out_stream );
128 *out_stream = fopen( path, "w" );
129
130 if( *out_stream == NULL )
131 {
132 return -1;
133 }
134
135 return stdout_fd;
136}
137
138static int restore_output( FILE** out_stream, int old_fd )
139{
140 fflush( *out_stream );
141 fclose( *out_stream );
142
143 *out_stream = fdopen( old_fd, "w" );
144 if( *out_stream == NULL )
145 {
146 return -1;
147 }
148
149 return 0;
150}
Simon Butchere0192962016-10-12 23:07:30 +0100151
Janos Follathe709f7c2016-10-13 11:26:29 +0100152static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100153{
Janos Follathe709f7c2016-10-13 11:26:29 +0100154 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100155}
Janos Follath8ca53b52016-10-05 10:57:49 +0100156#endif /* __unix__ || __APPLE__ __MACH__ */
157
Rich Evans4c091142015-02-02 12:04:10 +0000158static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000159{
160 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000161 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000162 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000163
Rich Evans4c091142015-02-02 12:04:10 +0000164 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000165 {
166 c = *ibuf++;
167 if( c >= '0' && c <= '9' )
168 c -= '0';
169 else if( c >= 'a' && c <= 'f' )
170 c -= 'a' - 10;
171 else if( c >= 'A' && c <= 'F' )
172 c -= 'A' - 10;
173 else
174 assert( 0 );
175
176 c2 = *ibuf++;
177 if( c2 >= '0' && c2 <= '9' )
178 c2 -= '0';
179 else if( c2 >= 'a' && c2 <= 'f' )
180 c2 -= 'a' - 10;
181 else if( c2 >= 'A' && c2 <= 'F' )
182 c2 -= 'A' - 10;
183 else
184 assert( 0 );
185
186 *obuf++ = ( c << 4 ) | c2;
187 }
188
189 return len;
190}
191
Rich Evans42914452015-02-02 12:09:25 +0000192static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000193{
194 unsigned char l, h;
195
Rich Evans42914452015-02-02 12:09:25 +0000196 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000197 {
Rich Evans42914452015-02-02 12:09:25 +0000198 h = *ibuf / 16;
199 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000200
201 if( h < 10 )
202 *obuf++ = '0' + h;
203 else
204 *obuf++ = 'a' + h - 10;
205
206 if( l < 10 )
207 *obuf++ = '0' + l;
208 else
209 *obuf++ = 'a' + l - 10;
210
211 ++ibuf;
212 len--;
213 }
214}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000215
216/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200217 * Allocate and zeroize a buffer.
218 *
219 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
220 *
221 * For convenience, dies if allocation fails.
222 */
223static unsigned char *zero_alloc( size_t len )
224{
225 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000226 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200227
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200228 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200229 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200230
231 memset( p, 0x00, actual_len );
232
233 return( p );
234}
235
236/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200237 * Allocate and fill a buffer from hex data.
238 *
239 * The buffer is sized exactly as needed. This allows to detect buffer
240 * overruns (including overreads) when running the test suite under valgrind.
241 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200242 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
243 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200244 * For convenience, dies if allocation fails.
245 */
246static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
247{
248 unsigned char *obuf;
249
Rich Evans42914452015-02-02 12:09:25 +0000250 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200251
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200252 if( *olen == 0 )
253 return( zero_alloc( *olen ) );
254
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200255 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200256 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200257
258 (void) unhexify( obuf, ibuf );
259
260 return( obuf );
261}
262
263/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000264 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000265 * Although predictable and often similar on multiple
266 * runs, this does not result in identical random on
267 * each run. So do not use this if the results of a
268 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000269 *
270 * rng_state shall be NULL.
271 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000272static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000273{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200274#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000275 size_t i;
276
Paul Bakker9dcc3222011-03-08 14:16:06 +0000277 if( rng_state != NULL )
278 rng_state = NULL;
279
Paul Bakkera3d195c2011-11-27 21:07:34 +0000280 for( i = 0; i < len; ++i )
281 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200282#else
283 if( rng_state != NULL )
284 rng_state = NULL;
285
286 arc4random_buf( output, len );
287#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000288
289 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000290}
291
292/**
293 * This function only returns zeros
294 *
295 * rng_state shall be NULL.
296 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000297static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000298{
299 if( rng_state != NULL )
300 rng_state = NULL;
301
Paul Bakkera3d195c2011-11-27 21:07:34 +0000302 memset( output, 0, len );
303
Paul Bakker9dcc3222011-03-08 14:16:06 +0000304 return( 0 );
305}
306
307typedef struct
308{
309 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000310 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000311} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000312
313/**
314 * This function returns random based on a buffer it receives.
315 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000316 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100317 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000318 * The number of bytes released from the buffer on each call to
319 * the random function is specified by per_call. (Can be between
320 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000321 *
322 * After the buffer is empty it will return rand();
323 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000324static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000325{
Paul Bakker997bbd12011-03-13 15:45:42 +0000326 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000327 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000328
329 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000330 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000331
Paul Bakkera3d195c2011-11-27 21:07:34 +0000332 use_len = len;
333 if( len > info->length )
334 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000335
Paul Bakkera3d195c2011-11-27 21:07:34 +0000336 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000337 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000338 memcpy( output, info->buf, use_len );
339 info->buf += use_len;
340 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000341 }
342
Paul Bakkera3d195c2011-11-27 21:07:34 +0000343 if( len - use_len > 0 )
344 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
345
346 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000347}
Paul Bakker997bbd12011-03-13 15:45:42 +0000348
349/**
350 * Info structure for the pseudo random function
351 *
352 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000353 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000354 * State( v0, v1 ) should be set to zero.
355 */
356typedef struct
357{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000358 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000359 uint32_t v0, v1;
360} rnd_pseudo_info;
361
362/**
363 * This function returns random based on a pseudo random function.
364 * This means the results should be identical on all systems.
365 * Pseudo random is based on the XTEA encryption algorithm to
366 * generate pseudorandom.
367 *
368 * rng_state shall be a pointer to a rnd_pseudo_info structure.
369 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000370static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000371{
372 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000373 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100374 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000375
376 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000377 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000378
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000379 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000380
381 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000382 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000383 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000384 sum = 0;
385
Paul Bakkera3d195c2011-11-27 21:07:34 +0000386 for( i = 0; i < 32; i++ )
387 {
Rich Evans42914452015-02-02 12:09:25 +0000388 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
389 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000390 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000391 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
392 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000393 }
394
Paul Bakker5c2364c2012-10-01 14:41:15 +0000395 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100396 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000397 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100398 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000399 }
400
Paul Bakkera3d195c2011-11-27 21:07:34 +0000401 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000402}
SimonB0269dad2016-02-17 23:34:30 +0000403
Simon Butcherd96924d2016-05-06 00:22:18 +0100404static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000405{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100406 test_info.failed = 1;
407 test_info.test = test;
408 test_info.line_no = line_no;
409 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000410}
411