1 files changed, 146 insertions, 0 deletions
diff --git a/src/others/irrlicht-1.8.1/source/Irrlicht/aesGladman/prng.cpp b/src/others/irrlicht-1.8.1/source/Irrlicht/aesGladman/prng.cpp
new file mode 100644
index 0000000..d5800b3
--- /dev/null
+++ b/src/others/irrlicht-1.8.1/source/Irrlicht/aesGladman/prng.cpp
@@ -0,0 +1,146 @@
+/*
+ ---------------------------------------------------------------------------
+ Copyright (c) 2002, Dr Brian Gladman <                 >, Worcester, UK.
+ All rights reserved.
+ LICENSE TERMS
+ The free distribution and use of this software in both source and binary
+ form is allowed (with or without changes) provided that:
+   1. distributions of this source code include the above copyright
+      notice, this list of conditions and the following disclaimer;
+   2. distributions in binary form include the above copyright
+      notice, this list of conditions and the following disclaimer
+      in the documentation and/or other associated materials;
+   3. the copyright holder's name is not used to endorse products
+      built using this software without specific written permission.
+ ALTERNATIVELY, provided that this notice is retained in full, this product
+ may be distributed under the terms of the GNU General Public License (GPL),
+ in which case the provisions of the GPL apply INSTEAD OF those given above.
+ DISCLAIMER
+ This software is provided 'as is' with no explicit or implied warranties
+ in respect of its properties, including, but not limited to, correctness
+ and/or fitness for purpose.
+ ---------------------------------------------------------------------------
+ Issue Date: 24/01/2003
+ This file implements a random data pool based on the use of an external
+ entropy function.  It is based on the ideas advocated by Peter Gutmann in
+ his work on pseudo random sequence generators.  It is not a 'paranoid'
+ random sequence generator and no attempt is made to protect the pool
+ from prying eyes either by memory locking or by techniques to obscure
+ its location in memory.
+*/
+#include <memory.h>
+#include "prng.h"
+/* mix a random data pool using the SHA1 compression function (as   */
+/* suggested by Peter Gutmann in his paper on random pools)         */
+static void prng_mix(unsigned char buf[])
+{   unsigned int    i, len;
+    sha1_ctx        ctx[1];
+    /*lint -e{663}  unusual array to pointer conversion */
+    for(i = 0; i < PRNG_POOL_SIZE; i += SHA1_DIGEST_SIZE)
+    {
+        /* copy digest size pool block into SHA1 hash block */
+        memcpy(ctx->hash, buf + (i ? i : PRNG_POOL_SIZE)
+                            - SHA1_DIGEST_SIZE, SHA1_DIGEST_SIZE);
+        /* copy data from pool into the SHA1 data buffer    */
+        len = PRNG_POOL_SIZE - i;
+        memcpy(ctx->wbuf, buf + i, (len > SHA1_BLOCK_SIZE ? SHA1_BLOCK_SIZE : len));
+        if(len < SHA1_BLOCK_SIZE)
+            memcpy(((char*)ctx->wbuf) + len, buf, SHA1_BLOCK_SIZE - len);
+        /* compress using the SHA1 compression function     */
+        sha1_compile(ctx);
+        /* put digest size block back into the random pool  */
+        memcpy(buf + i, ctx->hash, SHA1_DIGEST_SIZE);
+    }
+}
+/* refresh the output buffer and update the random pool by adding   */
+/* entropy and remixing                                             */
+static void update_pool(prng_ctx ctx[1])
+{   unsigned int    i = 0;
+    /* transfer random pool data to the output buffer   */
+    memcpy(ctx->obuf, ctx->rbuf, PRNG_POOL_SIZE);
+    /* enter entropy data into the pool */
+    while(i < PRNG_POOL_SIZE)
+        i += ctx->entropy(ctx->rbuf + i, PRNG_POOL_SIZE - i);
+    /* invert and xor the original pool data into the pool  */
+    for(i = 0; i < PRNG_POOL_SIZE; ++i)
+        ctx->rbuf[i] ^= ~ctx->obuf[i];
+    /* mix the pool and the output buffer   */
+    prng_mix(ctx->rbuf);
+    prng_mix(ctx->obuf);
+}
+void prng_init(prng_entropy_fn fun, prng_ctx ctx[1])
+{   int i;
+    /* clear the buffers and the counter in the context     */
+    memset(ctx, 0, sizeof(prng_ctx));
+    /* set the pointer to the entropy collection function   */
+    ctx->entropy = fun;
+    /* initialise the random data pool                      */
+    update_pool(ctx);
+    /* mix the pool a minimum number of times               */
+    for(i = 0; i < PRNG_MIN_MIX; ++i)
+        prng_mix(ctx->rbuf);
+    /* update the pool to prime the pool output buffer      */
+    update_pool(ctx);
+}
+/* provide random bytes from the random data pool   */
+void prng_rand(unsigned char data[], unsigned int data_len, prng_ctx ctx[1])
+{   unsigned char   *rp = data;
+    unsigned int    len, pos = ctx->pos;
+    while(data_len)
+    {
+        /* transfer 'data_len' bytes (or the number of bytes remaining  */
+        /* the pool output buffer if less) into the output              */
+        len = (data_len < PRNG_POOL_SIZE - pos ? data_len : PRNG_POOL_SIZE - pos);
+        memcpy(rp, ctx->obuf + pos, len);
+        rp += len;          /* update ouput buffer position pointer     */
+        pos += len;         /* update pool output buffer pointer        */
+        data_len -= len;    /* update the remaining data count          */
+        /* refresh the random pool if necessary */
+        if(pos == PRNG_POOL_SIZE)
+        {
+            update_pool(ctx); pos = 0;
+        }
+    }
+    ctx->pos = pos;
+}
+void prng_end(prng_ctx ctx[1])
+{
+    /* ensure the data in the context is destroyed  */
+    memset(ctx, 0, sizeof(prng_ctx));
+}

diff --git a/src/others/irrlicht-1.8.1/source/Irrlicht/aesGladman/prng.cpp b/src/others/irrlicht-1.8.1/source/Irrlicht/aesGladman/prng.cpp new file mode 100644 index 0000000..d5800b3 --- /dev/null +++ b/src/others/irrlicht-1.8.1/source/Irrlicht/aesGladman/prng.cpp
@@ -0,0 +1,146 @@
	1	/*
	2	---------------------------------------------------------------------------
	3	Copyright (c) 2002, Dr Brian Gladman < >, Worcester, UK.
	4	All rights reserved.
	5
	6	LICENSE TERMS
	7
	8	The free distribution and use of this software in both source and binary
	9	form is allowed (with or without changes) provided that:
	10
	11	1. distributions of this source code include the above copyright
	12	notice, this list of conditions and the following disclaimer;
	13
	14	2. distributions in binary form include the above copyright
	15	notice, this list of conditions and the following disclaimer
	16	in the documentation and/or other associated materials;
	17
	18	3. the copyright holder's name is not used to endorse products
	19	built using this software without specific written permission.
	20
	21	ALTERNATIVELY, provided that this notice is retained in full, this product
	22	may be distributed under the terms of the GNU General Public License (GPL),
	23	in which case the provisions of the GPL apply INSTEAD OF those given above.
	24
	25	DISCLAIMER
	26
	27	This software is provided 'as is' with no explicit or implied warranties
	28	in respect of its properties, including, but not limited to, correctness
	29	and/or fitness for purpose.
	30	---------------------------------------------------------------------------
	31	Issue Date: 24/01/2003
	32
	33	This file implements a random data pool based on the use of an external
	34	entropy function. It is based on the ideas advocated by Peter Gutmann in
	35	his work on pseudo random sequence generators. It is not a 'paranoid'
	36	random sequence generator and no attempt is made to protect the pool
	37	from prying eyes either by memory locking or by techniques to obscure
	38	its location in memory.
	39	*/
	40
	41	#include <memory.h>
	42	#include "prng.h"
	43
	44	/* mix a random data pool using the SHA1 compression function (as */
	45	/* suggested by Peter Gutmann in his paper on random pools) */
	46
	47	static void prng_mix(unsigned char buf[])
	48	{ unsigned int i, len;
	49	sha1_ctx ctx[1];
	50
	51	/lint -e{663} unusual array to pointer conversion /
	52	for(i = 0; i < PRNG_POOL_SIZE; i += SHA1_DIGEST_SIZE)
	53	{
	54	/* copy digest size pool block into SHA1 hash block */
	55	memcpy(ctx->hash, buf + (i ? i : PRNG_POOL_SIZE)
	56	- SHA1_DIGEST_SIZE, SHA1_DIGEST_SIZE);
	57
	58	/* copy data from pool into the SHA1 data buffer */
	59	len = PRNG_POOL_SIZE - i;
	60	memcpy(ctx->wbuf, buf + i, (len > SHA1_BLOCK_SIZE ? SHA1_BLOCK_SIZE : len));
	61
	62	if(len < SHA1_BLOCK_SIZE)
	63	memcpy(((char*)ctx->wbuf) + len, buf, SHA1_BLOCK_SIZE - len);
	64
	65	/* compress using the SHA1 compression function */
	66	sha1_compile(ctx);
	67
	68	/* put digest size block back into the random pool */
	69	memcpy(buf + i, ctx->hash, SHA1_DIGEST_SIZE);
	70	}
	71	}
	72
	73	/* refresh the output buffer and update the random pool by adding */
	74	/* entropy and remixing */
	75
	76	static void update_pool(prng_ctx ctx[1])
	77	{ unsigned int i = 0;
	78
	79	/* transfer random pool data to the output buffer */
	80	memcpy(ctx->obuf, ctx->rbuf, PRNG_POOL_SIZE);
	81
	82	/* enter entropy data into the pool */
	83	while(i < PRNG_POOL_SIZE)
	84	i += ctx->entropy(ctx->rbuf + i, PRNG_POOL_SIZE - i);
	85
	86	/* invert and xor the original pool data into the pool */
	87	for(i = 0; i < PRNG_POOL_SIZE; ++i)
	88	ctx->rbuf[i] ^= ~ctx->obuf[i];
	89
	90	/* mix the pool and the output buffer */
	91	prng_mix(ctx->rbuf);
	92	prng_mix(ctx->obuf);
	93	}
	94
	95	void prng_init(prng_entropy_fn fun, prng_ctx ctx[1])
	96	{ int i;
	97
	98	/* clear the buffers and the counter in the context */
	99	memset(ctx, 0, sizeof(prng_ctx));
	100
	101	/* set the pointer to the entropy collection function */
	102	ctx->entropy = fun;
	103
	104	/* initialise the random data pool */
	105	update_pool(ctx);
	106
	107	/* mix the pool a minimum number of times */
	108	for(i = 0; i < PRNG_MIN_MIX; ++i)
	109	prng_mix(ctx->rbuf);
	110
	111	/* update the pool to prime the pool output buffer */
	112	update_pool(ctx);
	113	}
	114
	115	/* provide random bytes from the random data pool */
	116
	117	void prng_rand(unsigned char data[], unsigned int data_len, prng_ctx ctx[1])
	118	{ unsigned char *rp = data;
	119	unsigned int len, pos = ctx->pos;
	120
	121	while(data_len)
	122	{
	123	/* transfer 'data_len' bytes (or the number of bytes remaining */
	124	/* the pool output buffer if less) into the output */
	125	len = (data_len < PRNG_POOL_SIZE - pos ? data_len : PRNG_POOL_SIZE - pos);
	126	memcpy(rp, ctx->obuf + pos, len);
	127	rp += len; /* update ouput buffer position pointer */
	128	pos += len; /* update pool output buffer pointer */
	129	data_len -= len; /* update the remaining data count */
	130
	131	/* refresh the random pool if necessary */
	132	if(pos == PRNG_POOL_SIZE)
	133	{
	134	update_pool(ctx); pos = 0;
	135	}
	136	}
	137
	138	ctx->pos = pos;
	139	}
	140
	141	void prng_end(prng_ctx ctx[1])
	142	{
	143	/* ensure the data in the context is destroyed */
	144	memset(ctx, 0, sizeof(prng_ctx));
	145	}
	146