blob: 3c2a6db66fb9a226ef670acf81d42b645deb0db9 [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/*----------------------------------------------------------------------------*/
Azim Khan62a5d7d2018-06-29 10:02:54 +010052/* Status and error constants */
SimonB0269dad2016-02-17 23:34:30 +000053
Azim Khan62a5d7d2018-06-29 10:02:54 +010054#define DEPENDENCY_SUPPORTED 0 /* Dependency supported by build */
55#define KEY_VALUE_MAPPING_FOUND 0 /* Integer expression found */
56#define DISPATCH_TEST_SUCCESS 0 /* Test dispatch successful */
SimonB8ca7bc42016-04-17 23:24:50 +010057
Azim Khan62a5d7d2018-06-29 10:02:54 +010058#define KEY_VALUE_MAPPING_NOT_FOUND -1 /* Integer expression not found */
59#define DEPENDENCY_NOT_SUPPORTED -2 /* Dependency not supported */
60#define DISPATCH_TEST_FN_NOT_FOUND -3 /* Test function not found */
61#define DISPATCH_INVALID_TEST_DATA -4 /* Invalid test parameter type.
62 Only int, string, binary data
63 and integer expressions are
64 allowed */
65#define DISPATCH_UNSUPPORTED_SUITE -5 /* Test suite not supported by the
66 build */
SimonB0269dad2016-02-17 23:34:30 +000067
68
69/*----------------------------------------------------------------------------*/
70/* Macros */
71
72#define TEST_ASSERT( TEST ) \
73 do { \
74 if( ! (TEST) ) \
75 { \
SimonB31a6c492016-05-02 21:32:44 +010076 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +000077 goto exit; \
78 } \
79 } while( 0 )
80
Rich Evans4c091142015-02-02 12:04:10 +000081#define assert(a) if( !( a ) ) \
82{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020083 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000084 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020085 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000086}
87
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000088/*
89 * 32-bit integer manipulation macros (big endian)
90 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000091#ifndef GET_UINT32_BE
92#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000093{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000094 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
95 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
96 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
97 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000098}
99#endif
100
Paul Bakker5c2364c2012-10-01 14:41:15 +0000101#ifndef PUT_UINT32_BE
102#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000103{ \
104 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
105 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
106 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
107 (b)[(i) + 3] = (unsigned char) ( (n) ); \
108}
109#endif
110
SimonB0269dad2016-02-17 23:34:30 +0000111
112/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100113/* Global variables */
114
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100115
116static struct
117{
118 int failed;
119 const char *test;
120 const char *filename;
121 int line_no;
122}
123test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100124
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400125#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurek1152fa82018-04-13 05:15:17 -0400126mbedtls_platform_context platform_ctx;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400127#endif
SimonB8ca7bc42016-04-17 23:24:50 +0100128
129/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100130/* Helper flags for complex dependencies */
131
132/* Indicates whether we expect mbedtls_entropy_init
133 * to initialize some strong entropy source. */
134#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
135 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
136 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
137 defined(MBEDTLS_HAVEGE_C) || \
138 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
139 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100140#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100141#endif
142
143
144/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000145/* Helper Functions */
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400146static int platform_setup()
147{
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400148 int ret = 0;
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400149#if defined(MBEDTLS_PLATFORM_C)
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400150 ret = mbedtls_platform_setup( &platform_ctx );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400151#endif /* MBEDTLS_PLATFORM_C */
Andrzej Kurekf13ca952018-04-18 04:14:31 -0400152 return( ret );
Andrzej Kurek32a675f2018-04-13 06:16:04 -0400153}
154
155static void platform_teardown()
156{
157#if defined(MBEDTLS_PLATFORM_C)
158 mbedtls_platform_teardown( &platform_ctx );
159#endif /* MBEDTLS_PLATFORM_C */
160}
SimonB0269dad2016-02-17 23:34:30 +0000161
Janos Follath8ca53b52016-10-05 10:57:49 +0100162#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
163static int redirect_output( FILE** out_stream, const char* path )
164{
165 int stdout_fd = dup( fileno( *out_stream ) );
166
167 if( stdout_fd == -1 )
168 {
169 return -1;
170 }
171
172 fflush( *out_stream );
173 fclose( *out_stream );
174 *out_stream = fopen( path, "w" );
175
176 if( *out_stream == NULL )
177 {
178 return -1;
179 }
180
181 return stdout_fd;
182}
183
184static int restore_output( FILE** out_stream, int old_fd )
185{
186 fflush( *out_stream );
187 fclose( *out_stream );
188
189 *out_stream = fdopen( old_fd, "w" );
190 if( *out_stream == NULL )
191 {
192 return -1;
193 }
194
195 return 0;
196}
Simon Butchere0192962016-10-12 23:07:30 +0100197
Janos Follathe709f7c2016-10-13 11:26:29 +0100198static void close_output( FILE* out_stream )
Simon Butchere0192962016-10-12 23:07:30 +0100199{
Janos Follathe709f7c2016-10-13 11:26:29 +0100200 fclose( out_stream );
Simon Butchere0192962016-10-12 23:07:30 +0100201}
Janos Follath8ca53b52016-10-05 10:57:49 +0100202#endif /* __unix__ || __APPLE__ __MACH__ */
203
Rich Evans4c091142015-02-02 12:04:10 +0000204static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000205{
206 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000207 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000208 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000209
Rich Evans4c091142015-02-02 12:04:10 +0000210 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000211 {
212 c = *ibuf++;
213 if( c >= '0' && c <= '9' )
214 c -= '0';
215 else if( c >= 'a' && c <= 'f' )
216 c -= 'a' - 10;
217 else if( c >= 'A' && c <= 'F' )
218 c -= 'A' - 10;
219 else
220 assert( 0 );
221
222 c2 = *ibuf++;
223 if( c2 >= '0' && c2 <= '9' )
224 c2 -= '0';
225 else if( c2 >= 'a' && c2 <= 'f' )
226 c2 -= 'a' - 10;
227 else if( c2 >= 'A' && c2 <= 'F' )
228 c2 -= 'A' - 10;
229 else
230 assert( 0 );
231
232 *obuf++ = ( c << 4 ) | c2;
233 }
234
235 return len;
236}
237
Rich Evans42914452015-02-02 12:09:25 +0000238static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000239{
240 unsigned char l, h;
241
Rich Evans42914452015-02-02 12:09:25 +0000242 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000243 {
Rich Evans42914452015-02-02 12:09:25 +0000244 h = *ibuf / 16;
245 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000246
247 if( h < 10 )
248 *obuf++ = '0' + h;
249 else
250 *obuf++ = 'a' + h - 10;
251
252 if( l < 10 )
253 *obuf++ = '0' + l;
254 else
255 *obuf++ = 'a' + l - 10;
256
257 ++ibuf;
258 len--;
259 }
260}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000261
262/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200263 * Allocate and zeroize a buffer.
264 *
265 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
266 *
267 * For convenience, dies if allocation fails.
268 */
269static unsigned char *zero_alloc( size_t len )
270{
271 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000272 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200273
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200274 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200275 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200276
277 memset( p, 0x00, actual_len );
278
279 return( p );
280}
281
282/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200283 * Allocate and fill a buffer from hex data.
284 *
285 * The buffer is sized exactly as needed. This allows to detect buffer
286 * overruns (including overreads) when running the test suite under valgrind.
287 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200288 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
289 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200290 * For convenience, dies if allocation fails.
291 */
292static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
293{
294 unsigned char *obuf;
295
Rich Evans42914452015-02-02 12:09:25 +0000296 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200297
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200298 if( *olen == 0 )
299 return( zero_alloc( *olen ) );
300
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200301 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200302 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200303
304 (void) unhexify( obuf, ibuf );
305
306 return( obuf );
307}
308
309/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000310 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000311 * Although predictable and often similar on multiple
312 * runs, this does not result in identical random on
313 * each run. So do not use this if the results of a
314 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000315 *
316 * rng_state shall be NULL.
317 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000318static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000319{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200320#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000321 size_t i;
322
Paul Bakker9dcc3222011-03-08 14:16:06 +0000323 if( rng_state != NULL )
324 rng_state = NULL;
325
Paul Bakkera3d195c2011-11-27 21:07:34 +0000326 for( i = 0; i < len; ++i )
327 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200328#else
329 if( rng_state != NULL )
330 rng_state = NULL;
331
332 arc4random_buf( output, len );
333#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000334
335 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000336}
337
338/**
339 * This function only returns zeros
340 *
341 * rng_state shall be NULL.
342 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000343static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000344{
345 if( rng_state != NULL )
346 rng_state = NULL;
347
Paul Bakkera3d195c2011-11-27 21:07:34 +0000348 memset( output, 0, len );
349
Paul Bakker9dcc3222011-03-08 14:16:06 +0000350 return( 0 );
351}
352
353typedef struct
354{
355 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000356 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000357} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000358
359/**
360 * This function returns random based on a buffer it receives.
361 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000362 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100363 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000364 * The number of bytes released from the buffer on each call to
365 * the random function is specified by per_call. (Can be between
366 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000367 *
368 * After the buffer is empty it will return rand();
369 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000370static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000371{
Paul Bakker997bbd12011-03-13 15:45:42 +0000372 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000373 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000374
375 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000376 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000377
Paul Bakkera3d195c2011-11-27 21:07:34 +0000378 use_len = len;
379 if( len > info->length )
380 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000381
Paul Bakkera3d195c2011-11-27 21:07:34 +0000382 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000383 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000384 memcpy( output, info->buf, use_len );
385 info->buf += use_len;
386 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000387 }
388
Paul Bakkera3d195c2011-11-27 21:07:34 +0000389 if( len - use_len > 0 )
390 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
391
392 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000393}
Paul Bakker997bbd12011-03-13 15:45:42 +0000394
395/**
396 * Info structure for the pseudo random function
397 *
398 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000399 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000400 * State( v0, v1 ) should be set to zero.
401 */
402typedef struct
403{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000404 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000405 uint32_t v0, v1;
406} rnd_pseudo_info;
407
408/**
409 * This function returns random based on a pseudo random function.
410 * This means the results should be identical on all systems.
411 * Pseudo random is based on the XTEA encryption algorithm to
412 * generate pseudorandom.
413 *
414 * rng_state shall be a pointer to a rnd_pseudo_info structure.
415 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000416static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000417{
418 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000419 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100420 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000421
422 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000423 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000424
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000425 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000426
427 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000428 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000429 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000430 sum = 0;
431
Paul Bakkera3d195c2011-11-27 21:07:34 +0000432 for( i = 0; i < 32; i++ )
433 {
Rich Evans42914452015-02-02 12:09:25 +0000434 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
435 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000436 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000437 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
438 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000439 }
440
Paul Bakker5c2364c2012-10-01 14:41:15 +0000441 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100442 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000443 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100444 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000445 }
446
Paul Bakkera3d195c2011-11-27 21:07:34 +0000447 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000448}
SimonB0269dad2016-02-17 23:34:30 +0000449
Simon Butcherd96924d2016-05-06 00:22:18 +0100450static void test_fail( const char *test, int line_no, const char* filename )
SimonB0269dad2016-02-17 23:34:30 +0000451{
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100452 test_info.failed = 1;
453 test_info.test = test;
454 test_info.line_no = line_no;
455 test_info.filename = filename;
SimonB0269dad2016-02-17 23:34:30 +0000456}
Azim Khan3499a9e2017-05-30 00:06:49 +0100457
458int hexcmp( uint8_t * a, uint8_t * b, uint32_t a_len, uint32_t b_len)
459{
460 int ret = 0;
461 uint32_t i = 0;
462
463 if ( a_len != b_len )
464 return( a_len - b_len );
465
466 for( i = 0; i < a_len; i++ )
467 {
468 if ( a[i] != b[i] )
469 {
470 ret = -1;
471 break;
472 }
473 }
474 return ret;
475}
476