blob: c1c76ec09fb889b87296708405236e2500dbc2ad [file] [log] [blame]
SimonB15942102016-04-25 21:34:49 +01001#line 1 "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>
39#endif
SimonB0269dad2016-02-17 23:34:30 +000040
Manuel Pégourié-Gonnard426c2d42020-08-25 11:26:37 +020041/*
42 * Define the two macros
43 *
44 * #define TEST_CF_SECRET(ptr, size)
45 * #define TEST_CF_PUBLIC(ptr, size)
46 *
47 * that can be used in tests to mark a memory area as secret (no branch or
48 * memory access should depend on it) or public (default, only needs to be
49 * marked explicitly when it was derived from secret data).
50 *
51 * Arguments:
52 * - ptr: a pointer to the memory area to be marked
53 * - size: the size in bytes of the memory area
54 *
55 * Implementation:
56 * The basic idea is that of ctgrind <https://github.com/agl/ctgrind>: we can
57 * re-use tools that were designed for checking use of uninitialized memory.
58 * This file contains two implementations: one based on MemorySanitizer, the
59 * other on valgrind's memcheck. If none of them is enabled, dummy macros that
60 * do nothing are defined for convenience.
61 */
Manuel Pégourié-Gonnard40597ce2020-07-28 10:53:06 +020062#if defined(MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN)
63#include <sanitizer/msan_interface.h>
64
65/* Use macros to avoid messing up with origin tracking */
66#define TEST_CF_SECRET __msan_allocated_memory
67// void __msan_allocated_memory(const volatile void* data, size_t size);
68#define TEST_CF_PUBLIC __msan_unpoison
69// void __msan_unpoison(const volatile void *a, size_t size);
70
Manuel Pégourié-Gonnard426c2d42020-08-25 11:26:37 +020071#elif defined(MBEDTLS_TEST_CONSTANT_FLOW_VALGRIND)
72#include <valgrind/memcheck.h>
73
74#define TEST_CF_SECRET VALGRIND_MAKE_MEM_UNDEFINED
75// VALGRIND_MAKE_MEM_UNDEFINED(_qzz_addr, _qzz_len)
76#define TEST_CF_PUBLIC VALGRIND_MAKE_MEM_DEFINED
77// VALGRIND_MAKE_MEM_DEFINED(_qzz_addr, _qzz_len)
78
79#else /* MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN ||
80 MBEDTLS_TEST_CONSTANT_FLOW_VALGRIND */
Manuel Pégourié-Gonnard40597ce2020-07-28 10:53:06 +020081
82#define TEST_CF_SECRET(ptr, size)
83#define TEST_CF_PUBLIC(ptr, size)
84
85#endif /* MBEDTLS_TEST_CONSTANT_FLOW_MEMSAN */
86
SimonB0269dad2016-02-17 23:34:30 +000087/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +010088/* Constants */
SimonB0269dad2016-02-17 23:34:30 +000089
SimonB8ca7bc42016-04-17 23:24:50 +010090#define DEPENDENCY_SUPPORTED 0
91#define DEPENDENCY_NOT_SUPPORTED 1
92
93#define KEY_VALUE_MAPPING_FOUND 0
94#define KEY_VALUE_MAPPING_NOT_FOUND -1
95
96#define DISPATCH_TEST_SUCCESS 0
97#define DISPATCH_TEST_FN_NOT_FOUND 1
98#define DISPATCH_INVALID_TEST_DATA 2
99#define DISPATCH_UNSUPPORTED_SUITE 3
SimonB0269dad2016-02-17 23:34:30 +0000100
101
102/*----------------------------------------------------------------------------*/
103/* Macros */
104
105#define TEST_ASSERT( TEST ) \
106 do { \
107 if( ! (TEST) ) \
108 { \
SimonB31a6c492016-05-02 21:32:44 +0100109 test_fail( #TEST, __LINE__, __FILE__ ); \
SimonB0269dad2016-02-17 23:34:30 +0000110 goto exit; \
111 } \
112 } while( 0 )
113
Rich Evans4c091142015-02-02 12:04:10 +0000114#define assert(a) if( !( a ) ) \
115{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200116 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +0000117 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200118 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +0000119}
120
Ronald Croneb5d0e92020-04-06 10:34:22 +0200121#if defined(__GNUC__)
122/* Test if arg and &(arg)[0] have the same type. This is true if arg is
123 * an array but not if it's a pointer. */
124#define IS_ARRAY_NOT_POINTER( arg ) \
125 ( ! __builtin_types_compatible_p( __typeof__( arg ), \
126 __typeof__( &( arg )[0] ) ) )
127#else
128/* On platforms where we don't know how to implement this check,
129 * omit it. Oh well, a non-portable check is better than nothing. */
130#define IS_ARRAY_NOT_POINTER( arg ) 1
131#endif
132
133/* A compile-time constant with the value 0. If `const_expr` is not a
134 * compile-time constant with a nonzero value, cause a compile-time error. */
135#define STATIC_ASSERT_EXPR( const_expr ) \
makise-homura03c2b8f2020-08-23 00:28:45 +0300136 ( 0 && sizeof( struct { unsigned int STATIC_ASSERT : 1 - 2 * ! ( const_expr ); } ) )
Ronald Croneb5d0e92020-04-06 10:34:22 +0200137/* Return the scalar value `value` (possibly promoted). This is a compile-time
138 * constant if `value` is. `condition` must be a compile-time constant.
139 * If `condition` is false, arrange to cause a compile-time error. */
140#define STATIC_ASSERT_THEN_RETURN( condition, value ) \
141 ( STATIC_ASSERT_EXPR( condition ) ? 0 : ( value ) )
142
143#define ARRAY_LENGTH_UNSAFE( array ) \
144 ( sizeof( array ) / sizeof( *( array ) ) )
145/** Return the number of elements of a static or stack array.
146 *
147 * \param array A value of array (not pointer) type.
148 *
149 * \return The number of elements of the array.
150 */
151#define ARRAY_LENGTH( array ) \
152 ( STATIC_ASSERT_THEN_RETURN( IS_ARRAY_NOT_POINTER( array ), \
153 ARRAY_LENGTH_UNSAFE( array ) ) )
154
155
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000156/*
157 * 32-bit integer manipulation macros (big endian)
158 */
Paul Bakker5c2364c2012-10-01 14:41:15 +0000159#ifndef GET_UINT32_BE
160#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000161{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +0000162 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
163 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
164 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
165 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000166}
167#endif
168
Paul Bakker5c2364c2012-10-01 14:41:15 +0000169#ifndef PUT_UINT32_BE
170#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000171{ \
172 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
173 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
174 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
175 (b)[(i) + 3] = (unsigned char) ( (n) ); \
176}
177#endif
178
SimonB0269dad2016-02-17 23:34:30 +0000179
180/*----------------------------------------------------------------------------*/
SimonB8ca7bc42016-04-17 23:24:50 +0100181/* Global variables */
182
Andres Amaya Garcia3f50f512017-10-01 16:42:29 +0100183
184static struct
185{
186 int failed;
187 const char *test;
188 const char *filename;
189 int line_no;
190}
191test_info;
SimonB8ca7bc42016-04-17 23:24:50 +0100192
193
194/*----------------------------------------------------------------------------*/
Hanno Becker47deec42017-07-24 12:27:09 +0100195/* Helper flags for complex dependencies */
196
197/* Indicates whether we expect mbedtls_entropy_init
198 * to initialize some strong entropy source. */
199#if defined(MBEDTLS_TEST_NULL_ENTROPY) || \
200 ( !defined(MBEDTLS_NO_DEFAULT_ENTROPY_SOURCES) && \
201 ( !defined(MBEDTLS_NO_PLATFORM_ENTROPY) || \
202 defined(MBEDTLS_HAVEGE_C) || \
203 defined(MBEDTLS_ENTROPY_HARDWARE_ALT) || \
204 defined(ENTROPY_NV_SEED) ) )
Hanno Beckerd4a872e2017-09-07 08:09:33 +0100205#define ENTROPY_HAVE_STRONG
Hanno Becker47deec42017-07-24 12:27:09 +0100206#endif
207
208
209/*----------------------------------------------------------------------------*/
SimonB0269dad2016-02-17 23:34:30 +0000210/* Helper Functions */
211
Simon Butcher638dceb2018-10-03 16:17:41 +0100212void test_fail( const char *test, int line_no, const char* filename )
213{
214 test_info.failed = 1;
215 test_info.test = test;
216 test_info.line_no = line_no;
217 test_info.filename = filename;
218}
219
Janos Follath8ca53b52016-10-05 10:57:49 +0100220#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
gufe44b0ab8c22020-07-30 09:02:27 +0200221static int redirect_output( FILE* out_stream, const char* path )
Janos Follath8ca53b52016-10-05 10:57:49 +0100222{
gufe44b0ab8c22020-07-30 09:02:27 +0200223 int out_fd, dup_fd;
224 FILE* path_stream;
Janos Follath8ca53b52016-10-05 10:57:49 +0100225
gufe44b0ab8c22020-07-30 09:02:27 +0200226 out_fd = fileno( out_stream );
227 dup_fd = dup( out_fd );
228
229 if( dup_fd == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100230 {
gufe44b0ab8c22020-07-30 09:02:27 +0200231 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100232 }
233
gufe44b0ab8c22020-07-30 09:02:27 +0200234 path_stream = fopen( path, "w" );
235 if( path_stream == NULL )
Janos Follath8ca53b52016-10-05 10:57:49 +0100236 {
gufe44b0ab8c22020-07-30 09:02:27 +0200237 close( dup_fd );
238 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100239 }
240
gufe44b0ab8c22020-07-30 09:02:27 +0200241 fflush( out_stream );
242 if( dup2( fileno( path_stream ), out_fd ) == -1 )
243 {
244 close( dup_fd );
245 fclose( path_stream );
246 return( -1 );
247 }
248
249 fclose( path_stream );
250 return( dup_fd );
Janos Follath8ca53b52016-10-05 10:57:49 +0100251}
252
gufe44b0ab8c22020-07-30 09:02:27 +0200253static int restore_output( FILE* out_stream, int dup_fd )
Janos Follath8ca53b52016-10-05 10:57:49 +0100254{
gufe44b0ab8c22020-07-30 09:02:27 +0200255 int out_fd = fileno( out_stream );
Janos Follath8ca53b52016-10-05 10:57:49 +0100256
gufe44b0ab8c22020-07-30 09:02:27 +0200257 fflush( out_stream );
258 if( dup2( dup_fd, out_fd ) == -1 )
Janos Follath8ca53b52016-10-05 10:57:49 +0100259 {
gufe44b0ab8c22020-07-30 09:02:27 +0200260 close( out_fd );
261 close( dup_fd );
262 return( -1 );
Janos Follath8ca53b52016-10-05 10:57:49 +0100263 }
264
gufe44b0ab8c22020-07-30 09:02:27 +0200265 close( dup_fd );
266 return( 0 );
Simon Butchere0192962016-10-12 23:07:30 +0100267}
Janos Follath8ca53b52016-10-05 10:57:49 +0100268#endif /* __unix__ || __APPLE__ __MACH__ */
269
Simon Butcher638dceb2018-10-03 16:17:41 +0100270int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +0000271{
272 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +0000273 int len = strlen( ibuf ) / 2;
SimonB0269dad2016-02-17 23:34:30 +0000274 assert( strlen( ibuf ) % 2 == 0 ); /* must be even number of bytes */
Paul Bakker367dae42009-06-28 21:50:27 +0000275
Rich Evans4c091142015-02-02 12:04:10 +0000276 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000277 {
278 c = *ibuf++;
279 if( c >= '0' && c <= '9' )
280 c -= '0';
281 else if( c >= 'a' && c <= 'f' )
282 c -= 'a' - 10;
283 else if( c >= 'A' && c <= 'F' )
284 c -= 'A' - 10;
285 else
286 assert( 0 );
287
288 c2 = *ibuf++;
289 if( c2 >= '0' && c2 <= '9' )
290 c2 -= '0';
291 else if( c2 >= 'a' && c2 <= 'f' )
292 c2 -= 'a' - 10;
293 else if( c2 >= 'A' && c2 <= 'F' )
294 c2 -= 'A' - 10;
295 else
296 assert( 0 );
297
298 *obuf++ = ( c << 4 ) | c2;
299 }
300
301 return len;
302}
303
Simon Butcher638dceb2018-10-03 16:17:41 +0100304void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +0000305{
306 unsigned char l, h;
307
Rich Evans42914452015-02-02 12:09:25 +0000308 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +0000309 {
Rich Evans42914452015-02-02 12:09:25 +0000310 h = *ibuf / 16;
311 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +0000312
313 if( h < 10 )
314 *obuf++ = '0' + h;
315 else
316 *obuf++ = 'a' + h - 10;
317
318 if( l < 10 )
319 *obuf++ = '0' + l;
320 else
321 *obuf++ = 'a' + l - 10;
322
323 ++ibuf;
324 len--;
325 }
326}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000327
328/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200329 * Allocate and zeroize a buffer.
330 *
331 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
332 *
333 * For convenience, dies if allocation fails.
334 */
335static unsigned char *zero_alloc( size_t len )
336{
337 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000338 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200339
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200340 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200341 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200342
343 memset( p, 0x00, actual_len );
344
345 return( p );
346}
347
348/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200349 * Allocate and fill a buffer from hex data.
350 *
351 * The buffer is sized exactly as needed. This allows to detect buffer
352 * overruns (including overreads) when running the test suite under valgrind.
353 *
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200354 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
355 *
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200356 * For convenience, dies if allocation fails.
357 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100358unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200359{
360 unsigned char *obuf;
361
Rich Evans42914452015-02-02 12:09:25 +0000362 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200363
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200364 if( *olen == 0 )
365 return( zero_alloc( *olen ) );
366
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200367 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200368 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200369
370 (void) unhexify( obuf, ibuf );
371
372 return( obuf );
373}
374
375/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000376 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000377 * Although predictable and often similar on multiple
378 * runs, this does not result in identical random on
379 * each run. So do not use this if the results of a
380 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000381 *
382 * rng_state shall be NULL.
383 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000384static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000385{
gufe44206cb392020-08-03 17:56:50 +0200386#if !defined(__OpenBSD__) && !defined(__NetBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000387 size_t i;
388
Paul Bakker9dcc3222011-03-08 14:16:06 +0000389 if( rng_state != NULL )
390 rng_state = NULL;
391
Paul Bakkera3d195c2011-11-27 21:07:34 +0000392 for( i = 0; i < len; ++i )
393 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200394#else
395 if( rng_state != NULL )
396 rng_state = NULL;
397
398 arc4random_buf( output, len );
gufe44206cb392020-08-03 17:56:50 +0200399#endif /* !OpenBSD && !NetBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000400
401 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000402}
403
404/**
405 * This function only returns zeros
406 *
407 * rng_state shall be NULL.
408 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100409int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000410{
411 if( rng_state != NULL )
412 rng_state = NULL;
413
Paul Bakkera3d195c2011-11-27 21:07:34 +0000414 memset( output, 0, len );
415
Paul Bakker9dcc3222011-03-08 14:16:06 +0000416 return( 0 );
417}
418
419typedef struct
420{
421 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000422 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000423} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000424
425/**
426 * This function returns random based on a buffer it receives.
427 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000428 * rng_state shall be a pointer to a rnd_buf_info structure.
Manuel Pégourié-Gonnarde670f902015-10-30 09:23:19 +0100429 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000430 * The number of bytes released from the buffer on each call to
431 * the random function is specified by per_call. (Can be between
432 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000433 *
434 * After the buffer is empty it will return rand();
435 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100436int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000437{
Paul Bakker997bbd12011-03-13 15:45:42 +0000438 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000439 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000440
441 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000442 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000443
Paul Bakkera3d195c2011-11-27 21:07:34 +0000444 use_len = len;
445 if( len > info->length )
446 use_len = info->length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000447
Paul Bakkera3d195c2011-11-27 21:07:34 +0000448 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000449 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000450 memcpy( output, info->buf, use_len );
451 info->buf += use_len;
452 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000453 }
454
Paul Bakkera3d195c2011-11-27 21:07:34 +0000455 if( len - use_len > 0 )
456 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
457
458 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000459}
Paul Bakker997bbd12011-03-13 15:45:42 +0000460
461/**
462 * Info structure for the pseudo random function
463 *
464 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000465 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000466 * State( v0, v1 ) should be set to zero.
467 */
468typedef struct
469{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000470 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000471 uint32_t v0, v1;
472} rnd_pseudo_info;
473
474/**
475 * This function returns random based on a pseudo random function.
476 * This means the results should be identical on all systems.
477 * Pseudo random is based on the XTEA encryption algorithm to
478 * generate pseudorandom.
479 *
480 * rng_state shall be a pointer to a rnd_pseudo_info structure.
481 */
Simon Butcher638dceb2018-10-03 16:17:41 +0100482int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000483{
484 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000485 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100486 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000487
488 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000489 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000490
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000491 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000492
493 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000494 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000495 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000496 sum = 0;
497
Paul Bakkera3d195c2011-11-27 21:07:34 +0000498 for( i = 0; i < 32; i++ )
499 {
Rich Evans42914452015-02-02 12:09:25 +0000500 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
501 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000502 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000503 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
504 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000505 }
506
Paul Bakker5c2364c2012-10-01 14:41:15 +0000507 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100508 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000509 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100510 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000511 }
512
Paul Bakkera3d195c2011-11-27 21:07:34 +0000513 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000514}
SimonB0269dad2016-02-17 23:34:30 +0000515