blob: edf1d12b3537fbedb925278c186df72636c80feb [file] [log] [blame]
SimonB15942102016-04-25 21:34:49 +01001#line 1 "helpers.function"
SimonB0269dad2016-02-17 23:34:30 +00002/*----------------------------------------------------------------------------*/
3/* Headers */
4
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02005#if defined(MBEDTLS_PLATFORM_C)
Manuel Pégourié-Gonnard7f809972015-03-09 17:05:11 +00006#include "mbedtls/platform.h"
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +02007#else
Rich Evans00ab4702015-02-06 13:43:58 +00008#include <stdio.h>
Simon Butcherb2d5dd12016-04-27 13:35:37 +01009#include <stdlib.h>
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020010#define mbedtls_printf printf
11#define mbedtls_fprintf fprintf
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +020012#define mbedtls_calloc calloc
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020013#define mbedtls_free free
14#define mbedtls_exit exit
Simon Butcherb2d5dd12016-04-27 13:35:37 +010015#define mbedtls_time time
16#define mbedtls_time_t time_t
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020017#define mbedtls_fprintf fprintf
18#define mbedtls_printf printf
19#define mbedtls_snprintf snprintf
Janos Follath55abc212016-04-18 18:18:48 +010020#define MBEDTLS_EXIT_SUCCESS EXIT_SUCCESS
21#define MBEDTLS_EXIT_FAILURE EXIT_FAILURE
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020022#endif
23
SimonB0269dad2016-02-17 23:34:30 +000024#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
25#include "mbedtls/memory_buffer_alloc.h"
26#endif
27
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000028#ifdef _MSC_VER
29#include <basetsd.h>
30typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000031#define strncasecmp _strnicmp
32#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020034#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000035#endif
36
Paul Bakker19343182013-08-16 13:31:10 +020037#include <string.h>
38
SimonB0269dad2016-02-17 23:34:30 +000039
40/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010041/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000042
SimonB8ca7bc42016-04-17 23:24:50 +010043#define DEPENDENCY_SUPPORTED 0
44#define DEPENDENCY_NOT_SUPPORTED 1
45
46#define KEY_VALUE_MAPPING_FOUND 0
47#define KEY_VALUE_MAPPING_NOT_FOUND -1
48
49#define DISPATCH_TEST_SUCCESS 0
50#define DISPATCH_TEST_FN_NOT_FOUND 1
51#define DISPATCH_INVALID_TEST_DATA 2
52#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000053
54
55/*----------------------------------------------------------------------------*/
56/* Macros */
57
58#define TEST_ASSERT( TEST ) \
59 do { \
60 if( ! (TEST) ) \
61 { \
SimonB31a6c492016-05-02 21:32:44 +010062 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000063 goto exit; \
64 } \
65 } while( 0 )
66
Rich Evans4c091142015-02-02 12:04:10 +000067#define assert(a) if( !( a ) ) \
68{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020069 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000070 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020071 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000072}
73
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000074/*
75 * 32-bit integer manipulation macros (big endian)
76 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000077#ifndef GET_UINT32_BE
78#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000079{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000080 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
81 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
82 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
83 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000084}
85#endif
86
Paul Bakker5c2364c2012-10-01 14:41:15 +000087#ifndef PUT_UINT32_BE
88#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000089{ \
90 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
91 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
92 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
93 (b)[(i) + 3] = (unsigned char) ( (n) ); \
94}
95#endif
96
SimonB0269dad2016-02-17 23:34:30 +000097
98/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010099/* Global variables */
100
101static int test_errors = 0;
102
103
104/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000105/* Helper Functions */
106
Rich Evans4c091142015-02-02 12:04:10 +0000107static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000108{
109 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000110 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000111 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000112
Rich Evans4c091142015-02-02 12:04:10 +0000113 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000114 {
115 c = *ibuf++;
116 if( c >= '0' && c <= '9' )
117 c -= '0';
118 else if( c >= 'a' && c <= 'f' )
119 c -= 'a' - 10;
120 else if( c >= 'A' && c <= 'F' )
121 c -= 'A' - 10;
122 else
123 assert( 0 );
124
125 c2 = *ibuf++;
126 if( c2 >= '0' && c2 <= '9' )
127 c2 -= '0';
128 else if( c2 >= 'a' && c2 <= 'f' )
129 c2 -= 'a' - 10;
130 else if( c2 >= 'A' && c2 <= 'F' )
131 c2 -= 'A' - 10;
132 else
133 assert( 0 );
134
135 *obuf++ = ( c << 4 ) | c2;
136 }
137
138 return len;
139}
140
Rich Evans42914452015-02-02 12:09:25 +0000141static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000142{
143 unsigned char l, h;
144
Rich Evans42914452015-02-02 12:09:25 +0000145 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000146 {
Rich Evans42914452015-02-02 12:09:25 +0000147 h = *ibuf / 16;
148 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000149
150 if( h < 10 )
151 *obuf++ = '0' + h;
152 else
153 *obuf++ = 'a' + h - 10;
154
155 if( l < 10 )
156 *obuf++ = '0' + l;
157 else
158 *obuf++ = 'a' + l - 10;
159
160 ++ibuf;
161 len--;
162 }
163}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000164
165/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200166 * Allocate and zeroize a buffer.
167 *
168 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
169 *
170 * For convenience, dies if allocation fails.
171 */
172static unsigned char *zero_alloc( size_t len )
173{
174 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000175 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200176
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200177 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200178 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200179
180 memset( p, 0x00, actual_len );
181
182 return( p );
183}
184
185/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200186 * Allocate and fill a buffer from hex data.
187 *
188 * The buffer is sized exactly as needed. This allows to detect buffer
189 * overruns (including overreads) when running the test suite under valgrind.
190 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200191 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
192 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200193 * For convenience, dies if allocation fails.
194 */
195static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
196{
197 unsigned char *obuf;
198
Rich Evans42914452015-02-02 12:09:25 +0000199 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200200
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200201 if( *olen == 0 )
202 return( zero_alloc( *olen ) );
203
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200204 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200205 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200206
207 (void) unhexify( obuf, ibuf );
208
209 return( obuf );
210}
211
212/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000213 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000214 * Although predictable and often similar on multiple
215 * runs, this does not result in identical random on
216 * each run. So do not use this if the results of a
217 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000218 *
219 * rng_state shall be NULL.
220 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000221static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000222{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200223#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000224 size_t i;
225
Paul Bakker9dcc3222011-03-08 14:16:06 +0000226 if( rng_state != NULL )
227 rng_state = NULL;
228
Paul Bakkera3d195c2011-11-27 21:07:34 +0000229 for( i = 0; i < len; ++i )
230 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200231#else
232 if( rng_state != NULL )
233 rng_state = NULL;
234
235 arc4random_buf( output, len );
236#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000237
238 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000239}
240
241/**
242 * This function only returns zeros
243 *
244 * rng_state shall be NULL.
245 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000246static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000247{
248 if( rng_state != NULL )
249 rng_state = NULL;
250
Paul Bakkera3d195c2011-11-27 21:07:34 +0000251 memset( output, 0, len );
252
Paul Bakker9dcc3222011-03-08 14:16:06 +0000253 return( 0 );
254}
255
256typedef struct
257{
258 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000259 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000260} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000261
262/**
263 * This function returns random based on a buffer it receives.
264 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000265 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100266 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000267 * The number of bytes released from the buffer on each call to
268 * the random function is specified by per_call. (Can be between
269 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000270 *
271 * After the buffer is empty it will return rand();
272 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000273static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000274{
Paul Bakker997bbd12011-03-13 15:45:42 +0000275 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000276 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000277
278 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000279 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000280
Paul Bakkera3d195c2011-11-27 21:07:34 +0000281 use_len = len;
282 if( len > info->length )
283 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000284
Paul Bakkera3d195c2011-11-27 21:07:34 +0000285 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000286 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000287 memcpy( output, info->buf, use_len );
288 info->buf += use_len;
289 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000290 }
291
Paul Bakkera3d195c2011-11-27 21:07:34 +0000292 if( len - use_len > 0 )
293 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
294
295 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000296}
Paul Bakker997bbd12011-03-13 15:45:42 +0000297
298/**
299 * Info structure for the pseudo random function
300 *
301 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000302 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000303 * State( v0, v1 ) should be set to zero.
304 */
305typedef struct
306{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000307 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000308 uint32_t v0, v1;
309} rnd_pseudo_info;
310
311/**
312 * This function returns random based on a pseudo random function.
313 * This means the results should be identical on all systems.
314 * Pseudo random is based on the XTEA encryption algorithm to
315 * generate pseudorandom.
316 *
317 * rng_state shall be a pointer to a rnd_pseudo_info structure.
318 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000319static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000320{
321 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000322 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100323 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000324
325 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000326 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000327
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000328 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000329
330 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000331 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000332 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000333 sum = 0;
334
Paul Bakkera3d195c2011-11-27 21:07:34 +0000335 for( i = 0; i < 32; i++ )
336 {
Rich Evans42914452015-02-02 12:09:25 +0000337 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
338 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000339 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000340 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
341 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000342 }
343
Paul Bakker5c2364c2012-10-01 14:41:15 +0000344 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100345 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000346 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100347 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000348 }
349
Paul Bakkera3d195c2011-11-27 21:07:34 +0000350 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000351}
SimonB0269dad2016-02-17 23:34:30 +0000352
Simon Butcherd96924d2016-05-06 00:22:18 +0100353static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000354{
355 test_errors++;
356 if( test_errors == 1 )
357 mbedtls_printf( "FAILED\n" );
SimonB31a6c492016-05-02 21:32:44 +0100358 mbedtls_printf( " %s\n at line %d, %s\n", test, line_no, filename );
SimonB0269dad2016-02-17 23:34:30 +0000359}
360