blob: c772af9a5e2b6b0a27e9abc97c3b9bb9e422087c [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
Azim Khand30ca132017-06-09 04:32:58 +010042/* Type for Hex parameters */
43typedef struct HexParam_tag
44{
45 uint8_t * x;
46 uint32_t len;
47} HexParam_t;
48
SimonB0269dad2016-02-17 23:34:30 +000049/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010050/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000051
Azim Khanee6c0182017-05-19 17:34:17 +010052#define DEPENDENCY_SUPPORTED 0
53#define KEY_VALUE_MAPPING_FOUND 0
54#define DISPATCH_TEST_SUCCESS 0
SimonB8ca7bc42016-04-17 23:24:50 +010055
Azim Khanee6c0182017-05-19 17:34:17 +010056#define KEY_VALUE_MAPPING_NOT_FOUND -1
57#define DEPENDENCY_NOT_SUPPORTED -2
58#define DISPATCH_TEST_FN_NOT_FOUND -3
59#define DISPATCH_INVALID_TEST_DATA -4
60#define DISPATCH_UNSUPPORTED_SUITE -5
SimonB0269dad2016-02-17 23:34:30 +000061
62
63/*----------------------------------------------------------------------------*/
64/* Macros */
65
66#define TEST_ASSERT( TEST ) \
67 do { \
68 if( ! (TEST) ) \
69 { \
SimonB31a6c492016-05-02 21:32:44 +010070 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000071 goto exit; \
72 } \
73 } while( 0 )
74
Rich Evans4c091142015-02-02 12:04:10 +000075#define assert(a) if( !( a ) ) \
76{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020077 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000078 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020079 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000080}
81
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000082/*
83 * 32-bit integer manipulation macros (big endian)
84 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000085#ifndef GET_UINT32_BE
86#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000087{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000088 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
89 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
90 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
91 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000092}
93#endif
94
Paul Bakker5c2364c2012-10-01 14:41:15 +000095#ifndef PUT_UINT32_BE
96#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000097{ \
98 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
99 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
100 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
101 (b)[(i) + 3] = (unsigned char) ( (n) ); \
102}
103#endif
104
SimonB0269dad2016-02-17 23:34:30 +0000105
106/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100107/* Global variables */
108
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100109
110static struct
111{
112 int failed;
113 const char *test;
114 const char *filename;
115 int line_no;
116}
117test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100118
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400119#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400120mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400121#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100122
123/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100124/* Helper flags for complex dependencies */
125
126/* Indicates whether we expect mbedtls_entropy_init
127 * to initialize some strong entropy source. */
128#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
129 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
130 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
131 defined(MBEDTLS_HAVEGE_C) || \
132 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
133 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100134#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100135#endif
136
137
138/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000139/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400140static int platform_setup()
141{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400142 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400143#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400144 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400145#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400146 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400147}
148
149static void platform_teardown()
150{
151#if defined(MBEDTLS_PLATFORM_C)
152 mbedtls_platform_teardown( &platform_ctx );
153#endif /* MBEDTLS_PLATFORM_C */
154}
SimonB0269dad2016-02-17 23:34:30 +0000155
Janos Follath8ca53b52016-10-05 10:57:49 +0100156#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
157static int redirect_output( FILE** out_stream, const char* path )
158{
159 int stdout_fd = dup( fileno( *out_stream ) );
160
161 if( stdout_fd == -1 )
162 {
163 return -1;
164 }
165
166 fflush( *out_stream );
167 fclose( *out_stream );
168 *out_stream = fopen( path, "w" );
169
170 if( *out_stream == NULL )
171 {
172 return -1;
173 }
174
175 return stdout_fd;
176}
177
178static int restore_output( FILE** out_stream, int old_fd )
179{
180 fflush( *out_stream );
181 fclose( *out_stream );
182
183 *out_stream = fdopen( old_fd, "w" );
184 if( *out_stream == NULL )
185 {
186 return -1;
187 }
188
189 return 0;
190}
Simon Butchere0192962016-10-12 23:07:30 +0100191
Janos Follathe709f7c2016-10-13 11:26:29 +0100192static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100193{
Janos Follathe709f7c2016-10-13 11:26:29 +0100194 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100195}
Janos Follath8ca53b52016-10-05 10:57:49 +0100196#endif /* __unix__ || __APPLE__ __MACH__ */
197
Rich Evans4c091142015-02-02 12:04:10 +0000198static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000199{
200 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000201 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000202 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000203
Rich Evans4c091142015-02-02 12:04:10 +0000204 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000205 {
206 c = *ibuf++;
207 if( c >= '0' && c <= '9' )
208 c -= '0';
209 else if( c >= 'a' && c <= 'f' )
210 c -= 'a' - 10;
211 else if( c >= 'A' && c <= 'F' )
212 c -= 'A' - 10;
213 else
214 assert( 0 );
215
216 c2 = *ibuf++;
217 if( c2 >= '0' && c2 <= '9' )
218 c2 -= '0';
219 else if( c2 >= 'a' && c2 <= 'f' )
220 c2 -= 'a' - 10;
221 else if( c2 >= 'A' && c2 <= 'F' )
222 c2 -= 'A' - 10;
223 else
224 assert( 0 );
225
226 *obuf++ = ( c << 4 ) | c2;
227 }
228
229 return len;
230}
231
Rich Evans42914452015-02-02 12:09:25 +0000232static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000233{
234 unsigned char l, h;
235
Rich Evans42914452015-02-02 12:09:25 +0000236 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000237 {
Rich Evans42914452015-02-02 12:09:25 +0000238 h = *ibuf / 16;
239 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000240
241 if( h < 10 )
242 *obuf++ = '0' + h;
243 else
244 *obuf++ = 'a' + h - 10;
245
246 if( l < 10 )
247 *obuf++ = '0' + l;
248 else
249 *obuf++ = 'a' + l - 10;
250
251 ++ibuf;
252 len--;
253 }
254}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000255
256/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200257 * Allocate and zeroize a buffer.
258 *
259 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
260 *
261 * For convenience, dies if allocation fails.
262 */
263static unsigned char *zero_alloc( size_t len )
264{
265 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000266 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200267
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200268 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200269 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200270
271 memset( p, 0x00, actual_len );
272
273 return( p );
274}
275
276/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200277 * Allocate and fill a buffer from hex data.
278 *
279 * The buffer is sized exactly as needed. This allows to detect buffer
280 * overruns (including overreads) when running the test suite under valgrind.
281 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200282 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
283 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200284 * For convenience, dies if allocation fails.
285 */
286static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
287{
288 unsigned char *obuf;
289
Rich Evans42914452015-02-02 12:09:25 +0000290 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200291
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200292 if( *olen == 0 )
293 return( zero_alloc( *olen ) );
294
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200295 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200296 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200297
298 (void) unhexify( obuf, ibuf );
299
300 return( obuf );
301}
302
303/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000304 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000305 * Although predictable and often similar on multiple
306 * runs, this does not result in identical random on
307 * each run. So do not use this if the results of a
308 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000309 *
310 * rng_state shall be NULL.
311 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000312static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000313{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200314#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000315 size_t i;
316
Paul Bakker9dcc3222011-03-08 14:16:06 +0000317 if( rng_state != NULL )
318 rng_state = NULL;
319
Paul Bakkera3d195c2011-11-27 21:07:34 +0000320 for( i = 0; i < len; ++i )
321 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200322#else
323 if( rng_state != NULL )
324 rng_state = NULL;
325
326 arc4random_buf( output, len );
327#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000328
329 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000330}
331
332/**
333 * This function only returns zeros
334 *
335 * rng_state shall be NULL.
336 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000337static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000338{
339 if( rng_state != NULL )
340 rng_state = NULL;
341
Paul Bakkera3d195c2011-11-27 21:07:34 +0000342 memset( output, 0, len );
343
Paul Bakker9dcc3222011-03-08 14:16:06 +0000344 return( 0 );
345}
346
347typedef struct
348{
349 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000350 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000351} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000352
353/**
354 * This function returns random based on a buffer it receives.
355 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000356 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100357 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000358 * The number of bytes released from the buffer on each call to
359 * the random function is specified by per_call. (Can be between
360 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000361 *
362 * After the buffer is empty it will return rand();
363 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000364static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000365{
Paul Bakker997bbd12011-03-13 15:45:42 +0000366 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000367 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000368
369 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000370 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000371
Paul Bakkera3d195c2011-11-27 21:07:34 +0000372 use_len = len;
373 if( len > info->length )
374 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000375
Paul Bakkera3d195c2011-11-27 21:07:34 +0000376 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000377 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000378 memcpy( output, info->buf, use_len );
379 info->buf += use_len;
380 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000381 }
382
Paul Bakkera3d195c2011-11-27 21:07:34 +0000383 if( len - use_len > 0 )
384 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
385
386 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000387}
Paul Bakker997bbd12011-03-13 15:45:42 +0000388
389/**
390 * Info structure for the pseudo random function
391 *
392 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000393 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000394 * State( v0, v1 ) should be set to zero.
395 */
396typedef struct
397{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000398 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000399 uint32_t v0, v1;
400} rnd_pseudo_info;
401
402/**
403 * This function returns random based on a pseudo random function.
404 * This means the results should be identical on all systems.
405 * Pseudo random is based on the XTEA encryption algorithm to
406 * generate pseudorandom.
407 *
408 * rng_state shall be a pointer to a rnd_pseudo_info structure.
409 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000410static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000411{
412 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000413 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100414 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000415
416 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000417 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000418
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000419 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000420
421 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000422 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000423 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000424 sum = 0;
425
Paul Bakkera3d195c2011-11-27 21:07:34 +0000426 for( i = 0; i < 32; i++ )
427 {
Rich Evans42914452015-02-02 12:09:25 +0000428 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
429 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000430 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000431 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
432 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000433 }
434
Paul Bakker5c2364c2012-10-01 14:41:15 +0000435 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100436 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000437 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100438 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000439 }
440
Paul Bakkera3d195c2011-11-27 21:07:34 +0000441 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000442}
SimonB0269dad2016-02-17 23:34:30 +0000443
Simon Butcherd96924d2016-05-06 00:22:18 +0100444static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000445{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100446 test_info.failed = 1;
447 test_info.test = test;
448 test_info.line_no = line_no;
449 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000450}
Azim Khan3499a9e2017-05-30 00:06:49 +0100451
452int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len)
453{
454 int ret = 0;
455 uint32_t i = 0;
456
457 if ( a_len != b_len )
458 return( a_len - b_len );
459
460 for( i = 0; i < a_len; i++ )
461 {
462 if ( a[i] != b[i] )
463 {
464 ret = -1;
465 break;
466 }
467 }
468 return ret;
469}
470