blob: 2475a3cc6acb9bd1d19c88421486ef851b17a696 [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
SimonB0269dad2016-02-17 23:34:30 +000037
38/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010039/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000040
SimonB8ca7bc42016-04-17 23:24:50 +010041#define DEPENDENCY_SUPPORTED 0
42#define DEPENDENCY_NOT_SUPPORTED 1
43
44#define KEY_VALUE_MAPPING_FOUND 0
45#define KEY_VALUE_MAPPING_NOT_FOUND -1
46
47#define DISPATCH_TEST_SUCCESS 0
48#define DISPATCH_TEST_FN_NOT_FOUND 1
49#define DISPATCH_INVALID_TEST_DATA 2
50#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000051
52
53/*----------------------------------------------------------------------------*/
54/* Macros */
55
56#define TEST_ASSERT( TEST ) \
57 do { \
58 if( ! (TEST) ) \
59 { \
SimonB31a6c492016-05-02 21:32:44 +010060 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000061 goto exit; \
62 } \
63 } while( 0 )
64
Rich Evans4c091142015-02-02 12:04:10 +000065#define assert(a) if( !( a ) ) \
66{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020067 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000068 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020069 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000070}
71
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000072/*
73 * 32-bit integer manipulation macros (big endian)
74 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000075#ifndef GET_UINT32_BE
76#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000077{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000078 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
79 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
80 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
81 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000082}
83#endif
84
Paul Bakker5c2364c2012-10-01 14:41:15 +000085#ifndef PUT_UINT32_BE
86#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000087{ \
88 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
89 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
90 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
91 (b)[(i) + 3] = (unsigned char) ( (n) ); \
92}
93#endif
94
SimonB0269dad2016-02-17 23:34:30 +000095
96/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010097/* Global variables */
98
99static int test_errors = 0;
100
101
102/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000103/* Helper Functions */
104
Rich Evans4c091142015-02-02 12:04:10 +0000105static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000106{
107 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000108 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000109 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000110
Rich Evans4c091142015-02-02 12:04:10 +0000111 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000112 {
113 c = *ibuf++;
114 if( c >= '0' && c <= '9' )
115 c -= '0';
116 else if( c >= 'a' && c <= 'f' )
117 c -= 'a' - 10;
118 else if( c >= 'A' && c <= 'F' )
119 c -= 'A' - 10;
120 else
121 assert( 0 );
122
123 c2 = *ibuf++;
124 if( c2 >= '0' && c2 <= '9' )
125 c2 -= '0';
126 else if( c2 >= 'a' && c2 <= 'f' )
127 c2 -= 'a' - 10;
128 else if( c2 >= 'A' && c2 <= 'F' )
129 c2 -= 'A' - 10;
130 else
131 assert( 0 );
132
133 *obuf++ = ( c << 4 ) | c2;
134 }
135
136 return len;
137}
138
Rich Evans42914452015-02-02 12:09:25 +0000139static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000140{
141 unsigned char l, h;
142
Rich Evans42914452015-02-02 12:09:25 +0000143 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000144 {
Rich Evans42914452015-02-02 12:09:25 +0000145 h = *ibuf / 16;
146 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000147
148 if( h < 10 )
149 *obuf++ = '0' + h;
150 else
151 *obuf++ = 'a' + h - 10;
152
153 if( l < 10 )
154 *obuf++ = '0' + l;
155 else
156 *obuf++ = 'a' + l - 10;
157
158 ++ibuf;
159 len--;
160 }
161}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000162
163/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200164 * Allocate and zeroize a buffer.
165 *
166 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
167 *
168 * For convenience, dies if allocation fails.
169 */
170static unsigned char *zero_alloc( size_t len )
171{
172 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000173 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200174
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200175 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200176 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200177
178 memset( p, 0x00, actual_len );
179
180 return( p );
181}
182
183/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200184 * Allocate and fill a buffer from hex data.
185 *
186 * The buffer is sized exactly as needed. This allows to detect buffer
187 * overruns (including overreads) when running the test suite under valgrind.
188 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200189 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
190 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200191 * For convenience, dies if allocation fails.
192 */
193static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
194{
195 unsigned char *obuf;
196
Rich Evans42914452015-02-02 12:09:25 +0000197 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200198
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200199 if( *olen == 0 )
200 return( zero_alloc( *olen ) );
201
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200202 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200203 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200204
205 (void) unhexify( obuf, ibuf );
206
207 return( obuf );
208}
209
210/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000211 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000212 * Although predictable and often similar on multiple
213 * runs, this does not result in identical random on
214 * each run. So do not use this if the results of a
215 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000216 *
217 * rng_state shall be NULL.
218 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000219static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000220{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200221#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000222 size_t i;
223
Paul Bakker9dcc3222011-03-08 14:16:06 +0000224 if( rng_state != NULL )
225 rng_state = NULL;
226
Paul Bakkera3d195c2011-11-27 21:07:34 +0000227 for( i = 0; i < len; ++i )
228 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200229#else
230 if( rng_state != NULL )
231 rng_state = NULL;
232
233 arc4random_buf( output, len );
234#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000235
236 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000237}
238
239/**
240 * This function only returns zeros
241 *
242 * rng_state shall be NULL.
243 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000244static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000245{
246 if( rng_state != NULL )
247 rng_state = NULL;
248
Paul Bakkera3d195c2011-11-27 21:07:34 +0000249 memset( output, 0, len );
250
Paul Bakker9dcc3222011-03-08 14:16:06 +0000251 return( 0 );
252}
253
254typedef struct
255{
256 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000257 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000258} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000259
260/**
261 * This function returns random based on a buffer it receives.
262 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000263 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100264 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000265 * The number of bytes released from the buffer on each call to
266 * the random function is specified by per_call. (Can be between
267 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000268 *
269 * After the buffer is empty it will return rand();
270 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000271static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000272{
Paul Bakker997bbd12011-03-13 15:45:42 +0000273 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000274 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000275
276 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000277 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000278
Paul Bakkera3d195c2011-11-27 21:07:34 +0000279 use_len = len;
280 if( len > info->length )
281 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000282
Paul Bakkera3d195c2011-11-27 21:07:34 +0000283 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000284 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000285 memcpy( output, info->buf, use_len );
286 info->buf += use_len;
287 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000288 }
289
Paul Bakkera3d195c2011-11-27 21:07:34 +0000290 if( len - use_len > 0 )
291 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
292
293 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000294}
Paul Bakker997bbd12011-03-13 15:45:42 +0000295
296/**
297 * Info structure for the pseudo random function
298 *
299 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000300 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000301 * State( v0, v1 ) should be set to zero.
302 */
303typedef struct
304{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000305 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000306 uint32_t v0, v1;
307} rnd_pseudo_info;
308
309/**
310 * This function returns random based on a pseudo random function.
311 * This means the results should be identical on all systems.
312 * Pseudo random is based on the XTEA encryption algorithm to
313 * generate pseudorandom.
314 *
315 * rng_state shall be a pointer to a rnd_pseudo_info structure.
316 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000317static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000318{
319 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000320 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100321 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000322
323 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000324 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000325
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000326 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000327
328 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000329 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000330 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000331 sum = 0;
332
Paul Bakkera3d195c2011-11-27 21:07:34 +0000333 for( i = 0; i < 32; i++ )
334 {
Rich Evans42914452015-02-02 12:09:25 +0000335 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
336 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000337 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000338 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
339 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000340 }
341
Paul Bakker5c2364c2012-10-01 14:41:15 +0000342 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100343 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000344 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100345 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000346 }
347
Paul Bakkera3d195c2011-11-27 21:07:34 +0000348 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000349}
SimonB0269dad2016-02-17 23:34:30 +0000350
Simon Butcherd96924d2016-05-06 00:22:18 +0100351static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000352{
353 test_errors++;
354 if( test_errors == 1 )
Simon Butcher25731362016-09-30 13:11:29 +0100355 mbedtls_fprintf( stdout, "FAILED\n" );
356 mbedtls_fprintf( stdout, " %s\n at line %d, %s\n", test, line_no,
357 filename );
SimonB0269dad2016-02-17 23:34:30 +0000358}
359