blob: 7f5a6f29a5de052d9097825c156ade22210f07be [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>
Azim Khan0fa35042018-06-22 11:34:33 +010028typedef UINT8 uint8_t;
29typedef INT32 int32_t;
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000030typedef UINT32 uint32_t;
Nicholas Wilson733676b2015-11-14 13:09:01 +000031#define strncasecmp _strnicmp
32#define strcasecmp _stricmp
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020034#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000035#endif
36
Paul Bakker19343182013-08-16 13:31:10 +020037#include <string.h>
38
Janos Follath8ca53b52016-10-05 10:57:49 +010039#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
40#include <unistd.h>
Nicholas Wilson2682edf2017-12-05 12:08:15 +000041#include <strings.h>
Janos Follath8ca53b52016-10-05 10:57:49 +010042#endif
SimonB0269dad2016-02-17 23:34:30 +000043
Azim Khand30ca132017-06-09 04:32:58 +010044/* Type for Hex parameters */
45typedef struct HexParam_tag
46{
47 uint8_t * x;
48 uint32_t len;
49} HexParam_t;
50
SimonB0269dad2016-02-17 23:34:30 +000051/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010052/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000053
Azim Khanee6c0182017-05-19 17:34:17 +010054#define DEPENDENCY_SUPPORTED 0
55#define KEY_VALUE_MAPPING_FOUND 0
56#define DISPATCH_TEST_SUCCESS 0
SimonB8ca7bc42016-04-17 23:24:50 +010057
Azim Khanee6c0182017-05-19 17:34:17 +010058#define KEY_VALUE_MAPPING_NOT_FOUND -1
59#define DEPENDENCY_NOT_SUPPORTED -2
60#define DISPATCH_TEST_FN_NOT_FOUND -3
61#define DISPATCH_INVALID_TEST_DATA -4
62#define DISPATCH_UNSUPPORTED_SUITE -5
SimonB0269dad2016-02-17 23:34:30 +000063
64
65/*----------------------------------------------------------------------------*/
66/* Macros */
67
68#define TEST_ASSERT( TEST ) \
69 do { \
70 if( ! (TEST) ) \
71 { \
SimonB31a6c492016-05-02 21:32:44 +010072 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000073 goto exit; \
74 } \
75 } while( 0 )
76
Rich Evans4c091142015-02-02 12:04:10 +000077#define assert(a) if( !( a ) ) \
78{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020079 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000080 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020081 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000082}
83
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000084/*
85 * 32-bit integer manipulation macros (big endian)
86 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000087#ifndef GET_UINT32_BE
88#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000089{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000090 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
91 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
92 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
93 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000094}
95#endif
96
Paul Bakker5c2364c2012-10-01 14:41:15 +000097#ifndef PUT_UINT32_BE
98#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000099{ \
100 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
101 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
102 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
103 (b)[(i) + 3] = (unsigned char) ( (n) ); \
104}
105#endif
106
SimonB0269dad2016-02-17 23:34:30 +0000107
108/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100109/* Global variables */
110
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100111
112static struct
113{
114 int failed;
115 const char *test;
116 const char *filename;
117 int line_no;
118}
119test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100120
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400121#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400122mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400123#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100124
125/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100126/* Helper flags for complex dependencies */
127
128/* Indicates whether we expect mbedtls_entropy_init
129 * to initialize some strong entropy source. */
130#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
131 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
132 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
133 defined(MBEDTLS_HAVEGE_C) || \
134 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
135 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100136#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100137#endif
138
139
140/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000141/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400142static int platform_setup()
143{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400144 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400145#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400146 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400147#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400148 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400149}
150
151static void platform_teardown()
152{
153#if defined(MBEDTLS_PLATFORM_C)
154 mbedtls_platform_teardown( &platform_ctx );
155#endif /* MBEDTLS_PLATFORM_C */
156}
SimonB0269dad2016-02-17 23:34:30 +0000157
Janos Follath8ca53b52016-10-05 10:57:49 +0100158#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
159static int redirect_output( FILE** out_stream, const char* path )
160{
161 int stdout_fd = dup( fileno( *out_stream ) );
162
163 if( stdout_fd == -1 )
164 {
165 return -1;
166 }
167
168 fflush( *out_stream );
169 fclose( *out_stream );
170 *out_stream = fopen( path, "w" );
171
172 if( *out_stream == NULL )
173 {
174 return -1;
175 }
176
177 return stdout_fd;
178}
179
180static int restore_output( FILE** out_stream, int old_fd )
181{
182 fflush( *out_stream );
183 fclose( *out_stream );
184
185 *out_stream = fdopen( old_fd, "w" );
186 if( *out_stream == NULL )
187 {
188 return -1;
189 }
190
191 return 0;
192}
Simon Butchere0192962016-10-12 23:07:30 +0100193
Janos Follathe709f7c2016-10-13 11:26:29 +0100194static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100195{
Janos Follathe709f7c2016-10-13 11:26:29 +0100196 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100197}
Janos Follath8ca53b52016-10-05 10:57:49 +0100198#endif /* __unix__ || __APPLE__ __MACH__ */
199
Rich Evans4c091142015-02-02 12:04:10 +0000200static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000201{
202 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000203 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000204 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000205
Rich Evans4c091142015-02-02 12:04:10 +0000206 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000207 {
208 c = *ibuf++;
209 if( c >= '0' && c <= '9' )
210 c -= '0';
211 else if( c >= 'a' && c <= 'f' )
212 c -= 'a' - 10;
213 else if( c >= 'A' && c <= 'F' )
214 c -= 'A' - 10;
215 else
216 assert( 0 );
217
218 c2 = *ibuf++;
219 if( c2 >= '0' && c2 <= '9' )
220 c2 -= '0';
221 else if( c2 >= 'a' && c2 <= 'f' )
222 c2 -= 'a' - 10;
223 else if( c2 >= 'A' && c2 <= 'F' )
224 c2 -= 'A' - 10;
225 else
226 assert( 0 );
227
228 *obuf++ = ( c << 4 ) | c2;
229 }
230
231 return len;
232}
233
Rich Evans42914452015-02-02 12:09:25 +0000234static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000235{
236 unsigned char l, h;
237
Rich Evans42914452015-02-02 12:09:25 +0000238 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000239 {
Rich Evans42914452015-02-02 12:09:25 +0000240 h = *ibuf / 16;
241 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000242
243 if( h < 10 )
244 *obuf++ = '0' + h;
245 else
246 *obuf++ = 'a' + h - 10;
247
248 if( l < 10 )
249 *obuf++ = '0' + l;
250 else
251 *obuf++ = 'a' + l - 10;
252
253 ++ibuf;
254 len--;
255 }
256}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000257
258/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200259 * Allocate and zeroize a buffer.
260 *
261 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
262 *
263 * For convenience, dies if allocation fails.
264 */
265static unsigned char *zero_alloc( size_t len )
266{
267 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000268 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200269
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200270 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200271 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200272
273 memset( p, 0x00, actual_len );
274
275 return( p );
276}
277
278/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200279 * Allocate and fill a buffer from hex data.
280 *
281 * The buffer is sized exactly as needed. This allows to detect buffer
282 * overruns (including overreads) when running the test suite under valgrind.
283 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200284 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
285 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200286 * For convenience, dies if allocation fails.
287 */
288static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
289{
290 unsigned char *obuf;
291
Rich Evans42914452015-02-02 12:09:25 +0000292 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200293
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200294 if( *olen == 0 )
295 return( zero_alloc( *olen ) );
296
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200297 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200298 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200299
300 (void) unhexify( obuf, ibuf );
301
302 return( obuf );
303}
304
305/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000306 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000307 * Although predictable and often similar on multiple
308 * runs, this does not result in identical random on
309 * each run. So do not use this if the results of a
310 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000311 *
312 * rng_state shall be NULL.
313 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000314static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000315{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200316#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000317 size_t i;
318
Paul Bakker9dcc3222011-03-08 14:16:06 +0000319 if( rng_state != NULL )
320 rng_state = NULL;
321
Paul Bakkera3d195c2011-11-27 21:07:34 +0000322 for( i = 0; i < len; ++i )
323 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200324#else
325 if( rng_state != NULL )
326 rng_state = NULL;
327
328 arc4random_buf( output, len );
329#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000330
331 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000332}
333
334/**
335 * This function only returns zeros
336 *
337 * rng_state shall be NULL.
338 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000339static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000340{
341 if( rng_state != NULL )
342 rng_state = NULL;
343
Paul Bakkera3d195c2011-11-27 21:07:34 +0000344 memset( output, 0, len );
345
Paul Bakker9dcc3222011-03-08 14:16:06 +0000346 return( 0 );
347}
348
349typedef struct
350{
351 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000352 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000353} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000354
355/**
356 * This function returns random based on a buffer it receives.
357 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000358 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100359 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000360 * The number of bytes released from the buffer on each call to
361 * the random function is specified by per_call. (Can be between
362 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000363 *
364 * After the buffer is empty it will return rand();
365 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000366static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000367{
Paul Bakker997bbd12011-03-13 15:45:42 +0000368 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000369 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000370
371 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000372 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000373
Paul Bakkera3d195c2011-11-27 21:07:34 +0000374 use_len = len;
375 if( len > info->length )
376 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000377
Paul Bakkera3d195c2011-11-27 21:07:34 +0000378 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000379 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000380 memcpy( output, info->buf, use_len );
381 info->buf += use_len;
382 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000383 }
384
Paul Bakkera3d195c2011-11-27 21:07:34 +0000385 if( len - use_len > 0 )
386 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
387
388 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000389}
Paul Bakker997bbd12011-03-13 15:45:42 +0000390
391/**
392 * Info structure for the pseudo random function
393 *
394 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000395 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000396 * State( v0, v1 ) should be set to zero.
397 */
398typedef struct
399{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000400 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000401 uint32_t v0, v1;
402} rnd_pseudo_info;
403
404/**
405 * This function returns random based on a pseudo random function.
406 * This means the results should be identical on all systems.
407 * Pseudo random is based on the XTEA encryption algorithm to
408 * generate pseudorandom.
409 *
410 * rng_state shall be a pointer to a rnd_pseudo_info structure.
411 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000412static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000413{
414 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000415 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100416 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000417
418 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000419 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000420
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000421 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000422
423 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000424 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000425 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000426 sum = 0;
427
Paul Bakkera3d195c2011-11-27 21:07:34 +0000428 for( i = 0; i < 32; i++ )
429 {
Rich Evans42914452015-02-02 12:09:25 +0000430 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
431 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000432 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000433 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
434 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000435 }
436
Paul Bakker5c2364c2012-10-01 14:41:15 +0000437 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100438 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000439 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100440 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000441 }
442
Paul Bakkera3d195c2011-11-27 21:07:34 +0000443 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000444}
SimonB0269dad2016-02-17 23:34:30 +0000445
Simon Butcherd96924d2016-05-06 00:22:18 +0100446static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000447{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100448 test_info.failed = 1;
449 test_info.test = test;
450 test_info.line_no = line_no;
451 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000452}
Azim Khan3499a9e2017-05-30 00:06:49 +0100453
454int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len)
455{
456 int ret = 0;
457 uint32_t i = 0;
458
459 if ( a_len != b_len )
460 return( a_len - b_len );
461
462 for( i = 0; i < a_len; i++ )
463 {
464 if ( a[i] != b[i] )
465 {
466 ret = -1;
467 break;
468 }
469 }
470 return ret;
471}
472