blob: 1df450d055092197a1fcd8921427dbec90ab17f1 [file] [log] [blame]
Azim Khanec024482017-05-09 17:20:21 +01001#line 2 "suites/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
Janos Follath8ca53b52016-10-05 10:57:49 +010037#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
38#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000039#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010040#endif
SimonB0269dad2016-02-17 23:34:30 +000041
42/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010043/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000044
Azim Khanee6c0182017-05-19 17:34:17 +010045#define DEPENDENCY_SUPPORTED 0
46#define KEY_VALUE_MAPPING_FOUND 0
47#define DISPATCH_TEST_SUCCESS 0
SimonB8ca7bc42016-04-17 23:24:50 +010048
Azim Khanee6c0182017-05-19 17:34:17 +010049#define KEY_VALUE_MAPPING_NOT_FOUND -1
50#define DEPENDENCY_NOT_SUPPORTED -2
51#define DISPATCH_TEST_FN_NOT_FOUND -3
52#define DISPATCH_INVALID_TEST_DATA -4
53#define DISPATCH_UNSUPPORTED_SUITE -5
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
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100102
103static struct
104{
105 int failed;
106 const char *test;
107 const char *filename;
108 int line_no;
109}
110test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100111
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400112#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400113mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400114#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100115
116/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100117/* Helper flags for complex dependencies */
118
119/* Indicates whether we expect mbedtls_entropy_init
120 * to initialize some strong entropy source. */
121#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
122 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
123 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
124 defined(MBEDTLS_HAVEGE_C) || \
125 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
126 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100127#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100128#endif
129
130
131/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000132/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400133static int platform_setup()
134{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400135 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400136#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400137 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400138#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400139 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400140}
141
142static void platform_teardown()
143{
144#if defined(MBEDTLS_PLATFORM_C)
145 mbedtls_platform_teardown( &platform_ctx );
146#endif /* MBEDTLS_PLATFORM_C */
147}
SimonB0269dad2016-02-17 23:34:30 +0000148
Janos Follath8ca53b52016-10-05 10:57:49 +0100149#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
150static int redirect_output( FILE** out_stream, const char* path )
151{
152 int stdout_fd = dup( fileno( *out_stream ) );
153
154 if( stdout_fd == -1 )
155 {
156 return -1;
157 }
158
159 fflush( *out_stream );
160 fclose( *out_stream );
161 *out_stream = fopen( path, "w" );
162
163 if( *out_stream == NULL )
164 {
165 return -1;
166 }
167
168 return stdout_fd;
169}
170
171static int restore_output( FILE** out_stream, int old_fd )
172{
173 fflush( *out_stream );
174 fclose( *out_stream );
175
176 *out_stream = fdopen( old_fd, "w" );
177 if( *out_stream == NULL )
178 {
179 return -1;
180 }
181
182 return 0;
183}
Simon Butchere0192962016-10-12 23:07:30 +0100184
Janos Follathe709f7c2016-10-13 11:26:29 +0100185static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100186{
Janos Follathe709f7c2016-10-13 11:26:29 +0100187 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100188}
Janos Follath8ca53b52016-10-05 10:57:49 +0100189#endif /* __unix__ || __APPLE__ __MACH__ */
190
Rich Evans4c091142015-02-02 12:04:10 +0000191static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000192{
193 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000194 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000195 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000196
Rich Evans4c091142015-02-02 12:04:10 +0000197 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000198 {
199 c = *ibuf++;
200 if( c >= '0' && c <= '9' )
201 c -= '0';
202 else if( c >= 'a' && c <= 'f' )
203 c -= 'a' - 10;
204 else if( c >= 'A' && c <= 'F' )
205 c -= 'A' - 10;
206 else
207 assert( 0 );
208
209 c2 = *ibuf++;
210 if( c2 >= '0' && c2 <= '9' )
211 c2 -= '0';
212 else if( c2 >= 'a' && c2 <= 'f' )
213 c2 -= 'a' - 10;
214 else if( c2 >= 'A' && c2 <= 'F' )
215 c2 -= 'A' - 10;
216 else
217 assert( 0 );
218
219 *obuf++ = ( c << 4 ) | c2;
220 }
221
222 return len;
223}
224
Rich Evans42914452015-02-02 12:09:25 +0000225static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000226{
227 unsigned char l, h;
228
Rich Evans42914452015-02-02 12:09:25 +0000229 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000230 {
Rich Evans42914452015-02-02 12:09:25 +0000231 h = *ibuf / 16;
232 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000233
234 if( h < 10 )
235 *obuf++ = '0' + h;
236 else
237 *obuf++ = 'a' + h - 10;
238
239 if( l < 10 )
240 *obuf++ = '0' + l;
241 else
242 *obuf++ = 'a' + l - 10;
243
244 ++ibuf;
245 len--;
246 }
247}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000248
249/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200250 * Allocate and zeroize a buffer.
251 *
252 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
253 *
254 * For convenience, dies if allocation fails.
255 */
256static unsigned char *zero_alloc( size_t len )
257{
258 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000259 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200260
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200261 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200262 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200263
264 memset( p, 0x00, actual_len );
265
266 return( p );
267}
268
269/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200270 * Allocate and fill a buffer from hex data.
271 *
272 * The buffer is sized exactly as needed. This allows to detect buffer
273 * overruns (including overreads) when running the test suite under valgrind.
274 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200275 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
276 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200277 * For convenience, dies if allocation fails.
278 */
279static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
280{
281 unsigned char *obuf;
282
Rich Evans42914452015-02-02 12:09:25 +0000283 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200284
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200285 if( *olen == 0 )
286 return( zero_alloc( *olen ) );
287
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200288 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200289 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200290
291 (void) unhexify( obuf, ibuf );
292
293 return( obuf );
294}
295
296/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000297 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000298 * Although predictable and often similar on multiple
299 * runs, this does not result in identical random on
300 * each run. So do not use this if the results of a
301 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000302 *
303 * rng_state shall be NULL.
304 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000305static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000306{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200307#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000308 size_t i;
309
Paul Bakker9dcc3222011-03-08 14:16:06 +0000310 if( rng_state != NULL )
311 rng_state = NULL;
312
Paul Bakkera3d195c2011-11-27 21:07:34 +0000313 for( i = 0; i < len; ++i )
314 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200315#else
316 if( rng_state != NULL )
317 rng_state = NULL;
318
319 arc4random_buf( output, len );
320#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000321
322 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000323}
324
325/**
326 * This function only returns zeros
327 *
328 * rng_state shall be NULL.
329 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000330static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000331{
332 if( rng_state != NULL )
333 rng_state = NULL;
334
Paul Bakkera3d195c2011-11-27 21:07:34 +0000335 memset( output, 0, len );
336
Paul Bakker9dcc3222011-03-08 14:16:06 +0000337 return( 0 );
338}
339
340typedef struct
341{
342 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000343 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000344} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000345
346/**
347 * This function returns random based on a buffer it receives.
348 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000349 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100350 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000351 * The number of bytes released from the buffer on each call to
352 * the random function is specified by per_call. (Can be between
353 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000354 *
355 * After the buffer is empty it will return rand();
356 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000357static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000358{
Paul Bakker997bbd12011-03-13 15:45:42 +0000359 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000360 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000361
362 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000363 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000364
Paul Bakkera3d195c2011-11-27 21:07:34 +0000365 use_len = len;
366 if( len > info->length )
367 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000368
Paul Bakkera3d195c2011-11-27 21:07:34 +0000369 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000370 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000371 memcpy( output, info->buf, use_len );
372 info->buf += use_len;
373 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000374 }
375
Paul Bakkera3d195c2011-11-27 21:07:34 +0000376 if( len - use_len > 0 )
377 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
378
379 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000380}
Paul Bakker997bbd12011-03-13 15:45:42 +0000381
382/**
383 * Info structure for the pseudo random function
384 *
385 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000386 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000387 * State( v0, v1 ) should be set to zero.
388 */
389typedef struct
390{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000391 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000392 uint32_t v0, v1;
393} rnd_pseudo_info;
394
395/**
396 * This function returns random based on a pseudo random function.
397 * This means the results should be identical on all systems.
398 * Pseudo random is based on the XTEA encryption algorithm to
399 * generate pseudorandom.
400 *
401 * rng_state shall be a pointer to a rnd_pseudo_info structure.
402 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000403static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000404{
405 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000406 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100407 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000408
409 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000410 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000411
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000412 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000413
414 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000415 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000416 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000417 sum = 0;
418
Paul Bakkera3d195c2011-11-27 21:07:34 +0000419 for( i = 0; i < 32; i++ )
420 {
Rich Evans42914452015-02-02 12:09:25 +0000421 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
422 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000423 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000424 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
425 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000426 }
427
Paul Bakker5c2364c2012-10-01 14:41:15 +0000428 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100429 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000430 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100431 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000432 }
433
Paul Bakkera3d195c2011-11-27 21:07:34 +0000434 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000435}
SimonB0269dad2016-02-17 23:34:30 +0000436
Simon Butcherd96924d2016-05-06 00:22:18 +0100437static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000438{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100439 test_info.failed = 1;
440 test_info.test = test;
441 test_info.line_no = line_no;
442 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000443}