blob: d12be75cec5fb603cc02f3129aff552fba48bb1f [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_printf printf
12#define mbedtls_fprintf fprintf
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +020013#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
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020018#define mbedtls_fprintf fprintf
19#define mbedtls_printf printf
20#define mbedtls_snprintf snprintf
Janos Follath55abc212016-04-18 18:18:48 +010021#define MBEDTLS_EXIT_SUCCESS EXIT_SUCCESS
22#define MBEDTLS_EXIT_FAILURE EXIT_FAILURE
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020023#endif
24
SimonB0269dad2016-02-17 23:34:30 +000025#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
26#include "mbedtls/memory_buffer_alloc.h"
27#endif
28
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000029#ifdef _MSC_VER
30#include <basetsd.h>
31typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000032#define strncasecmp _strnicmp
33#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000034#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020035#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000036#endif
37
Paul Bakker19343182013-08-16 13:31:10 +020038#include <string.h>
39
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
Rich Evans4c091142015-02-02 12:04:10 +0000108static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000109{
110 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000111 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000112 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000113
Rich Evans4c091142015-02-02 12:04:10 +0000114 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000115 {
116 c = *ibuf++;
117 if( c >= '0' && c <= '9' )
118 c -= '0';
119 else if( c >= 'a' && c <= 'f' )
120 c -= 'a' - 10;
121 else if( c >= 'A' && c <= 'F' )
122 c -= 'A' - 10;
123 else
124 assert( 0 );
125
126 c2 = *ibuf++;
127 if( c2 >= '0' && c2 <= '9' )
128 c2 -= '0';
129 else if( c2 >= 'a' && c2 <= 'f' )
130 c2 -= 'a' - 10;
131 else if( c2 >= 'A' && c2 <= 'F' )
132 c2 -= 'A' - 10;
133 else
134 assert( 0 );
135
136 *obuf++ = ( c << 4 ) | c2;
137 }
138
139 return len;
140}
141
Rich Evans42914452015-02-02 12:09:25 +0000142static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000143{
144 unsigned char l, h;
145
Rich Evans42914452015-02-02 12:09:25 +0000146 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000147 {
Rich Evans42914452015-02-02 12:09:25 +0000148 h = *ibuf / 16;
149 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000150
151 if( h < 10 )
152 *obuf++ = '0' + h;
153 else
154 *obuf++ = 'a' + h - 10;
155
156 if( l < 10 )
157 *obuf++ = '0' + l;
158 else
159 *obuf++ = 'a' + l - 10;
160
161 ++ibuf;
162 len--;
163 }
164}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000165
166/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200167 * Allocate and zeroize a buffer.
168 *
169 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
170 *
171 * For convenience, dies if allocation fails.
172 */
173static unsigned char *zero_alloc( size_t len )
174{
175 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000176 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200177
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200178 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200179 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200180
181 memset( p, 0x00, actual_len );
182
183 return( p );
184}
185
186/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200187 * Allocate and fill a buffer from hex data.
188 *
189 * The buffer is sized exactly as needed. This allows to detect buffer
190 * overruns (including overreads) when running the test suite under valgrind.
191 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200192 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
193 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200194 * For convenience, dies if allocation fails.
195 */
196static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
197{
198 unsigned char *obuf;
199
Rich Evans42914452015-02-02 12:09:25 +0000200 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200201
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200202 if( *olen == 0 )
203 return( zero_alloc( *olen ) );
204
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200205 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200206 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200207
208 (void) unhexify( obuf, ibuf );
209
210 return( obuf );
211}
212
213/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000214 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000215 * Although predictable and often similar on multiple
216 * runs, this does not result in identical random on
217 * each run. So do not use this if the results of a
218 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000219 *
220 * rng_state shall be NULL.
221 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000222static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000223{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200224#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000225 size_t i;
226
Paul Bakker9dcc3222011-03-08 14:16:06 +0000227 if( rng_state != NULL )
228 rng_state = NULL;
229
Paul Bakkera3d195c2011-11-27 21:07:34 +0000230 for( i = 0; i < len; ++i )
231 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200232#else
233 if( rng_state != NULL )
234 rng_state = NULL;
235
236 arc4random_buf( output, len );
237#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000238
239 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000240}
241
242/**
243 * This function only returns zeros
244 *
245 * rng_state shall be NULL.
246 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000247static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000248{
249 if( rng_state != NULL )
250 rng_state = NULL;
251
Paul Bakkera3d195c2011-11-27 21:07:34 +0000252 memset( output, 0, len );
253
Paul Bakker9dcc3222011-03-08 14:16:06 +0000254 return( 0 );
255}
256
257typedef struct
258{
259 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000260 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000261} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000262
263/**
264 * This function returns random based on a buffer it receives.
265 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000266 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100267 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000268 * The number of bytes released from the buffer on each call to
269 * the random function is specified by per_call. (Can be between
270 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000271 *
272 * After the buffer is empty it will return rand();
273 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000274static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000275{
Paul Bakker997bbd12011-03-13 15:45:42 +0000276 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000277 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000278
279 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000280 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000281
Paul Bakkera3d195c2011-11-27 21:07:34 +0000282 use_len = len;
283 if( len > info->length )
284 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000285
Paul Bakkera3d195c2011-11-27 21:07:34 +0000286 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000287 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000288 memcpy( output, info->buf, use_len );
289 info->buf += use_len;
290 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000291 }
292
Paul Bakkera3d195c2011-11-27 21:07:34 +0000293 if( len - use_len > 0 )
294 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
295
296 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000297}
Paul Bakker997bbd12011-03-13 15:45:42 +0000298
299/**
300 * Info structure for the pseudo random function
301 *
302 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000303 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000304 * State( v0, v1 ) should be set to zero.
305 */
306typedef struct
307{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000308 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000309 uint32_t v0, v1;
310} rnd_pseudo_info;
311
312/**
313 * This function returns random based on a pseudo random function.
314 * This means the results should be identical on all systems.
315 * Pseudo random is based on the XTEA encryption algorithm to
316 * generate pseudorandom.
317 *
318 * rng_state shall be a pointer to a rnd_pseudo_info structure.
319 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000320static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000321{
322 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000323 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100324 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000325
326 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000327 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000328
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000329 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000330
331 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000332 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000333 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000334 sum = 0;
335
Paul Bakkera3d195c2011-11-27 21:07:34 +0000336 for( i = 0; i < 32; i++ )
337 {
Rich Evans42914452015-02-02 12:09:25 +0000338 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
339 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000340 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000341 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
342 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000343 }
344
Paul Bakker5c2364c2012-10-01 14:41:15 +0000345 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100346 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000347 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100348 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000349 }
350
Paul Bakkera3d195c2011-11-27 21:07:34 +0000351 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000352}
SimonB0269dad2016-02-17 23:34:30 +0000353
Simon Butcherd96924d2016-05-06 00:22:18 +0100354static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000355{
356 test_errors++;
357 if( test_errors == 1 )
358 mbedtls_printf( "FAILED\n" );
SimonB31a6c492016-05-02 21:32:44 +0100359 mbedtls_printf( " %s\n at line %d, %s\n", test, line_no, filename );
SimonB0269dad2016-02-17 23:34:30 +0000360}
361