blob: 2eff043fd0f2eb3e62eef16b846acc9fb97502bb [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
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020016#endif
17
SimonB0269dad2016-02-17 23:34:30 +000018#if defined(MBEDTLS_MEMORY_BUFFER_ALLOC_C)
19#include "mbedtls/memory_buffer_alloc.h"
20#endif
21
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000022#ifdef _MSC_VER
23#include <basetsd.h>
24typedef UINT32 uint32_t;
25#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020026#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000027#endif
28
Rich Evans3d62e722015-02-03 11:48:59 +000029#include <stdio.h>
Paul Bakker19343182013-08-16 13:31:10 +020030#include <stdlib.h>
31#include <string.h>
32
SimonB0269dad2016-02-17 23:34:30 +000033
34/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010035/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000036
SimonB8ca7bc42016-04-17 23:24:50 +010037#define DEPENDENCY_SUPPORTED 0
38#define DEPENDENCY_NOT_SUPPORTED 1
39
40#define KEY_VALUE_MAPPING_FOUND 0
41#define KEY_VALUE_MAPPING_NOT_FOUND -1
42
43#define DISPATCH_TEST_SUCCESS 0
44#define DISPATCH_TEST_FN_NOT_FOUND 1
45#define DISPATCH_INVALID_TEST_DATA 2
46#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +000047
48
49/*----------------------------------------------------------------------------*/
50/* Macros */
51
52#define TEST_ASSERT( TEST ) \
53 do { \
54 if( ! (TEST) ) \
55 { \
56 test_fail( #TEST ); \
57 goto exit; \
58 } \
59 } while( 0 )
60
Rich Evans4c091142015-02-02 12:04:10 +000061#define assert(a) if( !( a ) ) \
62{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020063 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000064 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020065 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000066}
67
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000068/*
69 * 32-bit integer manipulation macros (big endian)
70 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000071#ifndef GET_UINT32_BE
72#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000073{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000074 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
75 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
76 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
77 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000078}
79#endif
80
Paul Bakker5c2364c2012-10-01 14:41:15 +000081#ifndef PUT_UINT32_BE
82#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000083{ \
84 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
85 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
86 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
87 (b)[(i) + 3] = (unsigned char) ( (n) ); \
88}
89#endif
90
SimonB0269dad2016-02-17 23:34:30 +000091
92/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010093/* Global variables */
94
95static int test_errors = 0;
96
97
98/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +000099/* Helper Functions */
100
Rich Evans4c091142015-02-02 12:04:10 +0000101static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000102{
103 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000104 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000105 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000106
Rich Evans4c091142015-02-02 12:04:10 +0000107 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000108 {
109 c = *ibuf++;
110 if( c >= '0' && c <= '9' )
111 c -= '0';
112 else if( c >= 'a' && c <= 'f' )
113 c -= 'a' - 10;
114 else if( c >= 'A' && c <= 'F' )
115 c -= 'A' - 10;
116 else
117 assert( 0 );
118
119 c2 = *ibuf++;
120 if( c2 >= '0' && c2 <= '9' )
121 c2 -= '0';
122 else if( c2 >= 'a' && c2 <= 'f' )
123 c2 -= 'a' - 10;
124 else if( c2 >= 'A' && c2 <= 'F' )
125 c2 -= 'A' - 10;
126 else
127 assert( 0 );
128
129 *obuf++ = ( c << 4 ) | c2;
130 }
131
132 return len;
133}
134
Rich Evans42914452015-02-02 12:09:25 +0000135static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000136{
137 unsigned char l, h;
138
Rich Evans42914452015-02-02 12:09:25 +0000139 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000140 {
Rich Evans42914452015-02-02 12:09:25 +0000141 h = *ibuf / 16;
142 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000143
144 if( h < 10 )
145 *obuf++ = '0' + h;
146 else
147 *obuf++ = 'a' + h - 10;
148
149 if( l < 10 )
150 *obuf++ = '0' + l;
151 else
152 *obuf++ = 'a' + l - 10;
153
154 ++ibuf;
155 len--;
156 }
157}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000158
159/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200160 * Allocate and zeroize a buffer.
161 *
162 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
163 *
164 * For convenience, dies if allocation fails.
165 */
166static unsigned char *zero_alloc( size_t len )
167{
168 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000169 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200170
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200171 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200172 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200173
174 memset( p, 0x00, actual_len );
175
176 return( p );
177}
178
179/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200180 * Allocate and fill a buffer from hex data.
181 *
182 * The buffer is sized exactly as needed. This allows to detect buffer
183 * overruns (including overreads) when running the test suite under valgrind.
184 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200185 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
186 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200187 * For convenience, dies if allocation fails.
188 */
189static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
190{
191 unsigned char *obuf;
192
Rich Evans42914452015-02-02 12:09:25 +0000193 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200194
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200195 if( *olen == 0 )
196 return( zero_alloc( *olen ) );
197
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200198 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200199 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200200
201 (void) unhexify( obuf, ibuf );
202
203 return( obuf );
204}
205
206/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000207 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000208 * Although predictable and often similar on multiple
209 * runs, this does not result in identical random on
210 * each run. So do not use this if the results of a
211 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000212 *
213 * rng_state shall be NULL.
214 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000215static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000216{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200217#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000218 size_t i;
219
Paul Bakker9dcc3222011-03-08 14:16:06 +0000220 if( rng_state != NULL )
221 rng_state = NULL;
222
Paul Bakkera3d195c2011-11-27 21:07:34 +0000223 for( i = 0; i < len; ++i )
224 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200225#else
226 if( rng_state != NULL )
227 rng_state = NULL;
228
229 arc4random_buf( output, len );
230#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000231
232 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000233}
234
235/**
236 * This function only returns zeros
237 *
238 * rng_state shall be NULL.
239 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000240static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000241{
242 if( rng_state != NULL )
243 rng_state = NULL;
244
Paul Bakkera3d195c2011-11-27 21:07:34 +0000245 memset( output, 0, len );
246
Paul Bakker9dcc3222011-03-08 14:16:06 +0000247 return( 0 );
248}
249
250typedef struct
251{
252 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000253 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000254} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000255
256/**
257 * This function returns random based on a buffer it receives.
258 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000259 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100260 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000261 * The number of bytes released from the buffer on each call to
262 * the random function is specified by per_call. (Can be between
263 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000264 *
265 * After the buffer is empty it will return rand();
266 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000267static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000268{
Paul Bakker997bbd12011-03-13 15:45:42 +0000269 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000270 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000271
272 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000273 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000274
Paul Bakkera3d195c2011-11-27 21:07:34 +0000275 use_len = len;
276 if( len > info->length )
277 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000278
Paul Bakkera3d195c2011-11-27 21:07:34 +0000279 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000280 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000281 memcpy( output, info->buf, use_len );
282 info->buf += use_len;
283 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000284 }
285
Paul Bakkera3d195c2011-11-27 21:07:34 +0000286 if( len - use_len > 0 )
287 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
288
289 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000290}
Paul Bakker997bbd12011-03-13 15:45:42 +0000291
292/**
293 * Info structure for the pseudo random function
294 *
295 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000296 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000297 * State( v0, v1 ) should be set to zero.
298 */
299typedef struct
300{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000301 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000302 uint32_t v0, v1;
303} rnd_pseudo_info;
304
305/**
306 * This function returns random based on a pseudo random function.
307 * This means the results should be identical on all systems.
308 * Pseudo random is based on the XTEA encryption algorithm to
309 * generate pseudorandom.
310 *
311 * rng_state shall be a pointer to a rnd_pseudo_info structure.
312 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000313static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000314{
315 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000316 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100317 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000318
319 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000320 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000321
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000322 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000323
324 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000325 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000326 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000327 sum = 0;
328
Paul Bakkera3d195c2011-11-27 21:07:34 +0000329 for( i = 0; i < 32; i++ )
330 {
Rich Evans42914452015-02-02 12:09:25 +0000331 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
332 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000333 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000334 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
335 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000336 }
337
Paul Bakker5c2364c2012-10-01 14:41:15 +0000338 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100339 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000340 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100341 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000342 }
343
Paul Bakkera3d195c2011-11-27 21:07:34 +0000344 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000345}
SimonB0269dad2016-02-17 23:34:30 +0000346
347static void test_fail( const char *test )
348{
349 test_errors++;
350 if( test_errors == 1 )
351 mbedtls_printf( "FAILED\n" );
352 mbedtls_printf( " %s\n", test );
353}
354