1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/* ldrand.c
*
* Pseudorandom number generator
*
*
*
* SYNOPSIS:
*
* double y;
* int ldrand();
*
* ldrand( &y );
*
*
*
* DESCRIPTION:
*
* Yields a random number 1.0 <= y < 2.0.
*
* The three-generator congruential algorithm by Brian
* Wichmann and David Hill (BYTE magazine, March, 1987,
* pp 127-8) is used.
*
* Versions invoked by the different arithmetic compile
* time options IBMPC, and MIEEE, produce the same sequences.
*
*/
#include <math.h>
#ifdef ANSIPROT
int ranwh ( void );
#else
int ranwh();
#endif
#ifdef UNK
#undef UNK
#if BIGENDIAN
#define MIEEE
#else
#define IBMPC
#endif
#endif
/* Three-generator random number algorithm
* of Brian Wichmann and David Hill
* BYTE magazine, March, 1987 pp 127-8
*
* The period, given by them, is (p-1)(q-1)(r-1)/4 = 6.95e12.
*/
static int sx = 1;
static int sy = 10000;
static int sz = 3000;
static union {
long double d;
unsigned short s[8];
} unkans;
/* This function implements the three
* congruential generators.
*/
int ranwh()
{
int r, s;
/* sx = sx * 171 mod 30269 */
r = sx/177;
s = sx - 177 * r;
sx = 171 * s - 2 * r;
if( sx < 0 )
sx += 30269;
/* sy = sy * 172 mod 30307 */
r = sy/176;
s = sy - 176 * r;
sy = 172 * s - 35 * r;
if( sy < 0 )
sy += 30307;
/* sz = 170 * sz mod 30323 */
r = sz/178;
s = sz - 178 * r;
sz = 170 * s - 63 * r;
if( sz < 0 )
sz += 30323;
/* The results are in static sx, sy, sz. */
return 0;
}
/* ldrand.c
*
* Random double precision floating point number between 1 and 2.
*
* C callable:
* drand( &x );
*/
int ldrand( a )
long double *a;
{
unsigned short r;
/* This algorithm of Wichmann and Hill computes a floating point
* result:
*/
ranwh();
unkans.d = sx/30269.0L + sy/30307.0L + sz/30323.0L;
r = unkans.d;
unkans.d -= r;
unkans.d += 1.0L;
if( sizeof(long double) == 16 )
{
#ifdef MIEEE
ranwh();
r = sx * sy + sz;
unkans.s[7] = r;
ranwh();
r = sx * sy + sz;
unkans.s[6] = r;
ranwh();
r = sx * sy + sz;
unkans.s[5] = r;
ranwh();
r = sx * sy + sz;
unkans.s[4] = r;
ranwh();
r = sx * sy + sz;
unkans.s[3] = r;
#endif
#ifdef IBMPC
ranwh();
r = sx * sy + sz;
unkans.s[0] = r;
ranwh();
r = sx * sy + sz;
unkans.s[1] = r;
ranwh();
r = sx * sy + sz;
unkans.s[2] = r;
ranwh();
r = sx * sy + sz;
unkans.s[3] = r;
ranwh();
r = sx * sy + sz;
unkans.s[4] = r;
#endif
}
else
{
#ifdef MIEEE
ranwh();
r = sx * sy + sz;
unkans.s[5] = r;
ranwh();
r = sx * sy + sz;
unkans.s[4] = r;
#endif
#ifdef IBMPC
ranwh();
r = sx * sy + sz;
unkans.s[0] = r;
ranwh();
r = sx * sy + sz;
unkans.s[1] = r;
#endif
}
*a = unkans.d;
return 0;
}
|
