blob: 6d4438de5a1584d7b673d6dec28af12bec5733ae [file] [log] [blame]
SimonB0269dad2016-02-17 23:34:30 +00001/*----------------------------------------------------------------------------*/
2/* Headers */
3
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02004#if defined(MBEDTLS_PLATFORM_C)
Manuel Pégourié-Gonnard7f809972015-03-09 17:05:11 +00005#include "mbedtls/platform.h"
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +02006#else
Rich Evans00ab4702015-02-06 13:43:58 +00007#include <stdio.h>
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02008#define mbedtls_printf printf
9#define mbedtls_fprintf fprintf
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +020010#define mbedtls_calloc calloc
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020011#define mbedtls_free free
12#define mbedtls_exit exit
13#define mbedtls_fprintf fprintf
14#define mbedtls_printf printf
15#define mbedtls_snprintf snprintf
Janos Follath55abc212016-04-18 18:18:48 +010016#define MBEDTLS_EXIT_SUCCESS EXIT_SUCCESS
17#define MBEDTLS_EXIT_FAILURE EXIT_FAILURE
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020018#endif
19
SimonB0269dad2016-02-17 23:34:30 +000020#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
21#include "mbedtls/memory_buffer_alloc.h"
22#endif
23
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000024#ifdef _MSC_VER
25#include <basetsd.h>
26typedef UINT32 uint32_t;
27#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020028#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000029#endif
30
Rich Evans3d62e722015-02-03 11:48:59 +000031#include <stdio.h>
Paul Bakker19343182013-08-16 13:31:10 +020032#include <stdlib.h>
33#include <string.h>
34
SimonB0269dad2016-02-17 23:34:30 +000035
36/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010037/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000038
SimonB8ca7bc42016-04-17 23:24:50 +010039#define DEPENDENCY_SUPPORTED 0
40#define DEPENDENCY_NOT_SUPPORTED 1
41
42#define KEY_VALUE_MAPPING_FOUND 0
43#define KEY_VALUE_MAPPING_NOT_FOUND -1
44
45#define DISPATCH_TEST_SUCCESS 0
46#define DISPATCH_TEST_FN_NOT_FOUND 1
47#define DISPATCH_INVALID_TEST_DATA 2
48#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000049
50
51/*----------------------------------------------------------------------------*/
52/* Macros */
53
54#define TEST_ASSERT( TEST ) \
55 do { \
56 if( ! (TEST) ) \
57 { \
58 test_fail( #TEST ); \
59 goto exit; \
60 } \
61 } while( 0 )
62
Rich Evans4c091142015-02-02 12:04:10 +000063#define assert(a) if( !( a ) ) \
64{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020065 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000066 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020067 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000068}
69
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000070/*
71 * 32-bit integer manipulation macros (big endian)
72 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000073#ifndef GET_UINT32_BE
74#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000075{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000076 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
77 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
78 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
79 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000080}
81#endif
82
Paul Bakker5c2364c2012-10-01 14:41:15 +000083#ifndef PUT_UINT32_BE
84#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000085{ \
86 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
87 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
88 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
89 (b)[(i) + 3] = (unsigned char) ( (n) ); \
90}
91#endif
92
SimonB0269dad2016-02-17 23:34:30 +000093
94/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010095/* Global variables */
96
97static int test_errors = 0;
98
99
100/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000101/* Helper Functions */
102
Rich Evans4c091142015-02-02 12:04:10 +0000103static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000104{
105 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000106 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000107 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000108
Rich Evans4c091142015-02-02 12:04:10 +0000109 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000110 {
111 c = *ibuf++;
112 if( c >= '0' && c <= '9' )
113 c -= '0';
114 else if( c >= 'a' && c <= 'f' )
115 c -= 'a' - 10;
116 else if( c >= 'A' && c <= 'F' )
117 c -= 'A' - 10;
118 else
119 assert( 0 );
120
121 c2 = *ibuf++;
122 if( c2 >= '0' && c2 <= '9' )
123 c2 -= '0';
124 else if( c2 >= 'a' && c2 <= 'f' )
125 c2 -= 'a' - 10;
126 else if( c2 >= 'A' && c2 <= 'F' )
127 c2 -= 'A' - 10;
128 else
129 assert( 0 );
130
131 *obuf++ = ( c << 4 ) | c2;
132 }
133
134 return len;
135}
136
Rich Evans42914452015-02-02 12:09:25 +0000137static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000138{
139 unsigned char l, h;
140
Rich Evans42914452015-02-02 12:09:25 +0000141 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000142 {
Rich Evans42914452015-02-02 12:09:25 +0000143 h = *ibuf / 16;
144 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000145
146 if( h < 10 )
147 *obuf++ = '0' + h;
148 else
149 *obuf++ = 'a' + h - 10;
150
151 if( l < 10 )
152 *obuf++ = '0' + l;
153 else
154 *obuf++ = 'a' + l - 10;
155
156 ++ibuf;
157 len--;
158 }
159}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000160
161/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200162 * Allocate and zeroize a buffer.
163 *
164 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
165 *
166 * For convenience, dies if allocation fails.
167 */
168static unsigned char *zero_alloc( size_t len )
169{
170 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000171 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200172
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200173 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200174 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200175
176 memset( p, 0x00, actual_len );
177
178 return( p );
179}
180
181/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200182 * Allocate and fill a buffer from hex data.
183 *
184 * The buffer is sized exactly as needed. This allows to detect buffer
185 * overruns (including overreads) when running the test suite under valgrind.
186 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200187 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
188 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200189 * For convenience, dies if allocation fails.
190 */
191static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
192{
193 unsigned char *obuf;
194
Rich Evans42914452015-02-02 12:09:25 +0000195 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200196
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200197 if( *olen == 0 )
198 return( zero_alloc( *olen ) );
199
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200200 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200201 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200202
203 (void) unhexify( obuf, ibuf );
204
205 return( obuf );
206}
207
208/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000209 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000210 * Although predictable and often similar on multiple
211 * runs, this does not result in identical random on
212 * each run. So do not use this if the results of a
213 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000214 *
215 * rng_state shall be NULL.
216 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000217static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000218{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200219#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000220 size_t i;
221
Paul Bakker9dcc3222011-03-08 14:16:06 +0000222 if( rng_state != NULL )
223 rng_state = NULL;
224
Paul Bakkera3d195c2011-11-27 21:07:34 +0000225 for( i = 0; i < len; ++i )
226 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200227#else
228 if( rng_state != NULL )
229 rng_state = NULL;
230
231 arc4random_buf( output, len );
232#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000233
234 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000235}
236
237/**
238 * This function only returns zeros
239 *
240 * rng_state shall be NULL.
241 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000242static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000243{
244 if( rng_state != NULL )
245 rng_state = NULL;
246
Paul Bakkera3d195c2011-11-27 21:07:34 +0000247 memset( output, 0, len );
248
Paul Bakker9dcc3222011-03-08 14:16:06 +0000249 return( 0 );
250}
251
252typedef struct
253{
254 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000255 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000256} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000257
258/**
259 * This function returns random based on a buffer it receives.
260 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000261 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100262 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000263 * The number of bytes released from the buffer on each call to
264 * the random function is specified by per_call. (Can be between
265 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000266 *
267 * After the buffer is empty it will return rand();
268 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000269static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000270{
Paul Bakker997bbd12011-03-13 15:45:42 +0000271 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000272 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000273
274 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000275 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000276
Paul Bakkera3d195c2011-11-27 21:07:34 +0000277 use_len = len;
278 if( len > info->length )
279 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000280
Paul Bakkera3d195c2011-11-27 21:07:34 +0000281 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000282 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000283 memcpy( output, info->buf, use_len );
284 info->buf += use_len;
285 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000286 }
287
Paul Bakkera3d195c2011-11-27 21:07:34 +0000288 if( len - use_len > 0 )
289 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
290
291 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000292}
Paul Bakker997bbd12011-03-13 15:45:42 +0000293
294/**
295 * Info structure for the pseudo random function
296 *
297 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000298 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000299 * State( v0, v1 ) should be set to zero.
300 */
301typedef struct
302{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000303 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000304 uint32_t v0, v1;
305} rnd_pseudo_info;
306
307/**
308 * This function returns random based on a pseudo random function.
309 * This means the results should be identical on all systems.
310 * Pseudo random is based on the XTEA encryption algorithm to
311 * generate pseudorandom.
312 *
313 * rng_state shall be a pointer to a rnd_pseudo_info structure.
314 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000315static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000316{
317 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000318 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100319 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000320
321 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000322 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000323
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000324 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000325
326 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000327 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000328 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000329 sum = 0;
330
Paul Bakkera3d195c2011-11-27 21:07:34 +0000331 for( i = 0; i < 32; i++ )
332 {
Rich Evans42914452015-02-02 12:09:25 +0000333 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
334 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000335 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000336 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
337 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000338 }
339
Paul Bakker5c2364c2012-10-01 14:41:15 +0000340 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100341 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000342 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100343 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000344 }
345
Paul Bakkera3d195c2011-11-27 21:07:34 +0000346 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000347}
SimonB0269dad2016-02-17 23:34:30 +0000348
349static void test_fail( const char *test )
350{
351 test_errors++;
352 if( test_errors == 1 )
353 mbedtls_printf( "FAILED\n" );
354 mbedtls_printf( " %s\n", test );
355}
356