WebSVN – gelsvn – Diff – /branches/cpp11-devel/apps/Pathtracer/mt19937ar.cpp


/* 
   A C-program for MT19937, with initialization improved 2002/1/26.
   Coded by Takuji Nishimura and Makoto Matsumoto.
 
   Before using, initialize the state by using init_genrand(seed)  
   or init_by_array(init_key, key_length).
 
   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
   All rights reserved.                          
   Copyright (C) 2005, Mutsuo Saito,
   All rights reserved.                          
 
   Redistribution and use in source and binary forms, with or without
   modification, are permitted provided that the following conditions
   are met:
 
     1. Redistributions of source code must retain the above copyright
        notice, this list of conditions and the following disclaimer.
 
     2. Redistributions in binary form must reproduce the above copyright
        notice, this list of conditions and the following disclaimer in the
        documentation and/or other materials provided with the distribution.
 
     3. The names of its contributors may not be used to endorse or promote 
        products derived from this software without specific prior written 
        permission.
 
   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 
   Any feedback is very welcome.
   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
 
#include <stdio.h>
#include "mt19937ar.h"
 
/* Period parameters */  
#define N 624
#define M 397
#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
 
static unsigned long mt[N]; /* the array for the state vector  */
static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
 
/* initializes mt[N] with a seed */
void init_genrand(unsigned long s)
{
    mt[0]= s & 0xffffffffUL;
    for (mti=1; mti<N; mti++) {
        mt[mti] = 
	    (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti); 
        /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
        /* In the previous versions, MSBs of the seed affect   */
        /* only MSBs of the array mt[].                        */
        /* 2002/01/09 modified by Makoto Matsumoto             */
        mt[mti] &= 0xffffffffUL;
        /* for >32 bit machines */
    }
}
 
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
void init_by_array(unsigned long init_key[], int key_length)
{
    int i, j, k;
    init_genrand(19650218UL);
    i=1; j=0;
    k = (N>key_length ? N : key_length);
    for (; k; k--) {
        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
          + init_key[j] + j; /* non linear */
        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
        i++; j++;
        if (i>=N) { mt[0] = mt[N-1]; i=1; }
        if (j>=key_length) j=0;
    }
    for (k=N-1; k; k--) {
        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
          - i; /* non linear */
        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
        i++;
        if (i>=N) { mt[0] = mt[N-1]; i=1; }
    }
 
    mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */ 
}
 
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
    unsigned long y;
    static unsigned long mag01[2]={0x0UL, MATRIX_A};
    /* mag01[x] = x * MATRIX_A  for x=0,1 */
 
    if (mti >= N) { /* generate N words at one time */
        int kk;
 
        if (mti == N+1)   /* if init_genrand() has not been called, */
            init_genrand(5489UL); /* a default initial seed is used */
 
        for (kk=0;kk<N-M;kk++) {
            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
            mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
        }
        for (;kk<N-1;kk++) {
            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
            mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
        }
        y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
        mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
 
        mti = 0;
    }
  
    y = mt[mti++];
 
    /* Tempering */
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
 
    return y;
}
 
/* generates a random number on [0,0x7fffffff]-interval */
long genrand_int31(void)
{
    return (long)(genrand_int32()>>1);
}
 
/* generates a random number on [0,1]-real-interval */
double genrand_real1(void)
{
    return genrand_int32()*(1.0/4294967295.0); 
    /* divided by 2^32-1 */ 
}
 
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
    return genrand_int32()*(1.0/4294967296.0); 
    /* divided by 2^32 */
}
 
/* generates a random number on (0,1)-real-interval */
double genrand_real3(void)
{
    return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0); 
    /* divided by 2^32 */
}
 
/* generates a random number on [0,1) with 53-bit resolution*/
double genrand_res53(void) 
{ 
    unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6; 
    return(a*67108864.0+b)*(1.0/9007199254740992.0); 
} 
/* These real versions are due to Isaku Wada, 2002/01/09 added */
 

Subversion Repositories gelsvn

(root)/branches/cpp11-devel/apps/Pathtracer/mt19937ar.cpp – Rev 348 → 630

Rev 348		Rev 630
1	`/*`	1	`/*`
2	`A C-program for MT19937, with initialization improved 2002/1/26.`	2	`A C-program for MT19937, with initialization improved 2002/1/26.`
3	`Coded by Takuji Nishimura and Makoto Matsumoto.`	3	`Coded by Takuji Nishimura and Makoto Matsumoto.`
4		4
5	`Before using, initialize the state by using init_genrand(seed)`	5	`Before using, initialize the state by using init_genrand(seed)`
6	`or init_by_array(init_key, key_length).`	6	`or init_by_array(init_key, key_length).`
7		7
8	`Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,`	8	`Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,`
9	`All rights reserved.`	9	`All rights reserved.`
10	`Copyright (C) 2005, Mutsuo Saito,`	10	`Copyright (C) 2005, Mutsuo Saito,`
11	`All rights reserved.`	11	`All rights reserved.`
12		12
13	`Redistribution and use in source and binary forms, with or without`	13	`Redistribution and use in source and binary forms, with or without`
14	`modification, are permitted provided that the following conditions`	14	`modification, are permitted provided that the following conditions`
15	`are met:`	15	`are met:`
16		16
17	`1. Redistributions of source code must retain the above copyright`	17	`1. Redistributions of source code must retain the above copyright`
18	`notice, this list of conditions and the following disclaimer.`	18	`notice, this list of conditions and the following disclaimer.`
19		19
20	`2. Redistributions in binary form must reproduce the above copyright`	20	`2. Redistributions in binary form must reproduce the above copyright`
21	`notice, this list of conditions and the following disclaimer in the`	21	`notice, this list of conditions and the following disclaimer in the`
22	`documentation and/or other materials provided with the distribution.`	22	`documentation and/or other materials provided with the distribution.`
23		23
24	`3. The names of its contributors may not be used to endorse or promote`	24	`3. The names of its contributors may not be used to endorse or promote`
25	`products derived from this software without specific prior written`	25	`products derived from this software without specific prior written`
26	`permission.`	26	`permission.`
27		27
28	`THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS`	28	`THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS`
29	`"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT`	29	`"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT`
30	`LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR`	30	`LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR`
31	`A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR`	31	`A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR`
32	`CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,`	32	`CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,`
33	`EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,`	33	`EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,`
34	`PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR`	34	`PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR`
35	`PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF`	35	`PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF`
36	`LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING`	36	`LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING`
37	`NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS`	37	`NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS`
38	`SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.`	38	`SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.`
39		39
40		40
41	`Any feedback is very welcome.`	41	`Any feedback is very welcome.`
42	`http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html`	42	`http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html`
43	`email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)`	43	`email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)`
44	`*/`	44	`*/`
45		45
46	`#include <stdio.h>`	46	`#include <stdio.h>`
47	`#include "mt19937ar.h"`	47	`#include "mt19937ar.h"`
48		48
49	`/* Period parameters */`	49	`/* Period parameters */`
50	`#define N 624`	50	`#define N 624`
51	`#define M 397`	51	`#define M 397`
52	`#define MATRIX_A 0x9908b0dfUL /* constant vector a */`	52	`#define MATRIX_A 0x9908b0dfUL /* constant vector a */`
53	`#define UPPER_MASK 0x80000000UL /* most significant w-r bits */`	53	`#define UPPER_MASK 0x80000000UL /* most significant w-r bits */`
54	`#define LOWER_MASK 0x7fffffffUL /* least significant r bits */`	54	`#define LOWER_MASK 0x7fffffffUL /* least significant r bits */`
55		55
56	`static unsigned long mt[N]; /* the array for the state vector */`	56	`static unsigned long mt[N]; /* the array for the state vector */`
57	`static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */`	57	`static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */`
58		58
59	`/* initializes mt[N] with a seed */`	59	`/* initializes mt[N] with a seed */`
60	`void init_genrand(unsigned long s)`	60	`void init_genrand(unsigned long s)`
61	`{`	61	`{`
62	`mt[0]= s & 0xffffffffUL;`	62	`mt[0]= s & 0xffffffffUL;`
63	`for (mti=1; mti<N; mti++) {`	63	`for (mti=1; mti<N; mti++) {`
64	`mt[mti] =`	64	`mt[mti] =`
65	`(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);`	65	`(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);`
66	`/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */`	66	`/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */`
67	`/* In the previous versions, MSBs of the seed affect */`	67	`/* In the previous versions, MSBs of the seed affect */`
68	`/* only MSBs of the array mt[]. */`	68	`/* only MSBs of the array mt[]. */`
69	`/* 2002/01/09 modified by Makoto Matsumoto */`	69	`/* 2002/01/09 modified by Makoto Matsumoto */`
70	`mt[mti] &= 0xffffffffUL;`	70	`mt[mti] &= 0xffffffffUL;`
71	`/* for >32 bit machines */`	71	`/* for >32 bit machines */`
72	`}`	72	`}`
73	`}`	73	`}`
74		74
75	`/* initialize by an array with array-length */`	75	`/* initialize by an array with array-length */`
76	`/* init_key is the array for initializing keys */`	76	`/* init_key is the array for initializing keys */`
77	`/* key_length is its length */`	77	`/* key_length is its length */`
78	`/* slight change for C++, 2004/2/26 */`	78	`/* slight change for C++, 2004/2/26 */`
79	`void init_by_array(unsigned long init_key[], int key_length)`	79	`void init_by_array(unsigned long init_key[], int key_length)`
80	`{`	80	`{`
81	`int i, j, k;`	81	`int i, j, k;`
82	`init_genrand(19650218UL);`	82	`init_genrand(19650218UL);`
83	`i=1; j=0;`	83	`i=1; j=0;`
84	`k = (N>key_length ? N : key_length);`	84	`k = (N>key_length ? N : key_length);`
85	`for (; k; k--) {`	85	`for (; k; k--) {`
86	`mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))`	86	`mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))`
87	`+ init_key[j] + j; /* non linear */`	87	`+ init_key[j] + j; /* non linear */`
88	`mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */`	88	`mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */`
89	`i++; j++;`	89	`i++; j++;`
90	`if (i>=N) { mt[0] = mt[N-1]; i=1; }`	90	`if (i>=N) { mt[0] = mt[N-1]; i=1; }`
91	`if (j>=key_length) j=0;`	91	`if (j>=key_length) j=0;`
92	`}`	92	`}`
93	`for (k=N-1; k; k--) {`	93	`for (k=N-1; k; k--) {`
94	`mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))`	94	`mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))`
95	`- i; /* non linear */`	95	`- i; /* non linear */`
96	`mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */`	96	`mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */`
97	`i++;`	97	`i++;`
98	`if (i>=N) { mt[0] = mt[N-1]; i=1; }`	98	`if (i>=N) { mt[0] = mt[N-1]; i=1; }`
99	`}`	99	`}`
100		100
101	`mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */`	101	`mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */`
102	`}`	102	`}`
103		103
104	`/* generates a random number on [0,0xffffffff]-interval */`	104	`/* generates a random number on [0,0xffffffff]-interval */`
105	`unsigned long genrand_int32(void)`	105	`unsigned long genrand_int32(void)`
106	`{`	106	`{`
107	`unsigned long y;`	107	`unsigned long y;`
108	`static unsigned long mag01[2]={0x0UL, MATRIX_A};`	108	`static unsigned long mag01[2]={0x0UL, MATRIX_A};`
109	`/* mag01[x] = x * MATRIX_A for x=0,1 */`	109	`/* mag01[x] = x * MATRIX_A for x=0,1 */`
110		110
111	`if (mti >= N) { /* generate N words at one time */`	111	`if (mti >= N) { /* generate N words at one time */`
112	`int kk;`	112	`int kk;`
113		113
114	`if (mti == N+1) /* if init_genrand() has not been called, */`	114	`if (mti == N+1) /* if init_genrand() has not been called, */`
115	`init_genrand(5489UL); /* a default initial seed is used */`	115	`init_genrand(5489UL); /* a default initial seed is used */`
116		116
117	`for (kk=0;kk<N-M;kk++) {`	117	`for (kk=0;kk<N-M;kk++) {`
118	`y = (mt[kk]&UPPER_MASK)\|(mt[kk+1]&LOWER_MASK);`	118	`y = (mt[kk]&UPPER_MASK)\|(mt[kk+1]&LOWER_MASK);`
119	`mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];`	119	`mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];`
120	`}`	120	`}`
121	`for (;kk<N-1;kk++) {`	121	`for (;kk<N-1;kk++) {`
122	`y = (mt[kk]&UPPER_MASK)\|(mt[kk+1]&LOWER_MASK);`	122	`y = (mt[kk]&UPPER_MASK)\|(mt[kk+1]&LOWER_MASK);`
123	`mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];`	123	`mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];`
124	`}`	124	`}`
125	`y = (mt[N-1]&UPPER_MASK)\|(mt[0]&LOWER_MASK);`	125	`y = (mt[N-1]&UPPER_MASK)\|(mt[0]&LOWER_MASK);`
126	`mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];`	126	`mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];`
127		127
128	`mti = 0;`	128	`mti = 0;`
129	`}`	129	`}`
130		130
131	`y = mt[mti++];`	131	`y = mt[mti++];`
132		132
133	`/* Tempering */`	133	`/* Tempering */`
134	`y ^= (y >> 11);`	134	`y ^= (y >> 11);`
135	`y ^= (y << 7) & 0x9d2c5680UL;`	135	`y ^= (y << 7) & 0x9d2c5680UL;`
136	`y ^= (y << 15) & 0xefc60000UL;`	136	`y ^= (y << 15) & 0xefc60000UL;`
137	`y ^= (y >> 18);`	137	`y ^= (y >> 18);`
138		138
139	`return y;`	139	`return y;`
140	`}`	140	`}`
141		141
142	`/* generates a random number on [0,0x7fffffff]-interval */`	142	`/* generates a random number on [0,0x7fffffff]-interval */`
143	`long genrand_int31(void)`	143	`long genrand_int31(void)`
144	`{`	144	`{`
145	`return (long)(genrand_int32()>>1);`	145	`return (long)(genrand_int32()>>1);`
146	`}`	146	`}`
147		147
148	`/* generates a random number on [0,1]-real-interval */`	148	`/* generates a random number on [0,1]-real-interval */`
149	`double genrand_real1(void)`	149	`double genrand_real1(void)`
150	`{`	150	`{`
151	`return genrand_int32()*(1.0/4294967295.0);`	151	`return genrand_int32()*(1.0/4294967295.0);`
152	`/* divided by 2^32-1 */`	152	`/* divided by 2^32-1 */`
153	`}`	153	`}`
154		154
155	`/* generates a random number on [0,1)-real-interval */`	155	`/* generates a random number on [0,1)-real-interval */`
156	`double genrand_real2(void)`	156	`double genrand_real2(void)`
157	`{`	157	`{`
158	`return genrand_int32()*(1.0/4294967296.0);`	158	`return genrand_int32()*(1.0/4294967296.0);`
159	`/* divided by 2^32 */`	159	`/* divided by 2^32 */`
160	`}`	160	`}`
161		161
162	`/* generates a random number on (0,1)-real-interval */`	162	`/* generates a random number on (0,1)-real-interval */`
163	`double genrand_real3(void)`	163	`double genrand_real3(void)`
164	`{`	164	`{`
165	`return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);`	165	`return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);`
166	`/* divided by 2^32 */`	166	`/* divided by 2^32 */`
167	`}`	167	`}`
168		168
169	`/* generates a random number on [0,1) with 53-bit resolution*/`	169	`/* generates a random number on [0,1) with 53-bit resolution*/`
170	`double genrand_res53(void)`	170	`double genrand_res53(void)`
171	`{`	171	`{`
172	`unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;`	172	`unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;`
173	`return(a67108864.0+b)(1.0/9007199254740992.0);`	173	`return(a67108864.0+b)(1.0/9007199254740992.0);`
174	`}`	174	`}`
175	`/* These real versions are due to Isaku Wada, 2002/01/09 added */`	175	`/* These real versions are due to Isaku Wada, 2002/01/09 added */`
176		176