1 /* Copyright (c) 2007, 2008, 2009, 2010. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "surf/random_mgr.h"
8 #include "xbt/sysdep.h"
9 #include "gras_config.h" /*_XBT_WIN32*/
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(random, surf, "Random part of surf");
17 static unsigned int _seed = 2147483647;
20 typedef unsigned __int64 uint64_t;
21 typedef unsigned int uint32_t;
25 unsigned short int __x[3]; /* Current state. */
26 unsigned short int __old_x[3]; /* Old state. */
27 unsigned short int __c; /* Additive const. in congruential formula. */
28 unsigned short int __init; /* Flag for initializing. */
29 unsigned long long int __a; /* Factor in congruential formula. */
32 static struct drand48_data __libc_drand48_data = { 0 };
34 union ieee754_double {
37 /* This is the IEEE 754 double-precision format. */
39 /* Together these comprise the mantissa. */
40 unsigned int mantissa1:32;
41 unsigned int mantissa0:20;
42 unsigned int exponent:11;
43 unsigned int negative:1;
47 /* This format makes it easier to see if a NaN is a signalling NaN. */
49 /* Together these comprise the mantissa. */
50 unsigned int mantissa1:32;
51 unsigned int mantissa0:19;
52 unsigned int quiet_nan:1;
53 unsigned int exponent:11;
54 unsigned int negative:1;
59 #define IEEE754_DOUBLE_BIAS 0x3ff /* Added to exponent. */
64 _drand48_iterate(unsigned short int xsubi[3], struct drand48_data *buffer);
67 _erand48_r(unsigned short int xsubi[3], struct drand48_data *buffer,
72 _erand48_r(unsigned short int xsubi[3], struct drand48_data *buffer,
75 union ieee754_double temp;
77 /* Compute next state. */
78 if (_drand48_iterate(xsubi, buffer) < 0)
81 /* Construct a positive double with the 48 random bits distributed over
82 its fractional part so the resulting FP number is [0.0,1.0). */
84 temp.ieee.negative = 0;
85 temp.ieee.exponent = IEEE754_DOUBLE_BIAS;
86 temp.ieee.mantissa0 = (xsubi[2] << 4) | (xsubi[1] >> 12);
87 temp.ieee.mantissa1 = ((xsubi[1] & 0xfff) << 20) | (xsubi[0] << 4);
89 /* Please note the lower 4 bits of mantissa1 are always 0. */
90 *result = temp.d - 1.0;
95 int _drand48_iterate(unsigned short int xsubi[3],
96 struct drand48_data *buffer)
101 /* Initialize buffer, if not yet done. */
103 if (buffer->__init == 0) {
104 buffer->__a = 0x5deece66dull;
109 /* Do the real work. We choose a data type which contains at least
110 48 bits. Because we compute the modulus it does not care how
111 many bits really are computed. */
113 X = (uint64_t) xsubi[2] << 32 | (uint32_t) xsubi[1] << 16 | xsubi[0];
115 result = X * buffer->__a + buffer->__c;
118 xsubi[0] = result & 0xffff;
119 xsubi[1] = (result >> 16) & 0xffff;
120 xsubi[2] = (result >> 32) & 0xffff;
126 double _drand48(void)
130 (void) _erand48_r(__libc_drand48_data.__x, &__libc_drand48_data,
136 void _srand(unsigned int seed)
143 const long a = 16807;
144 const long m = 2147483647;
145 const long q = 127773; /* (m/a) */
146 const long r = 2836; /* (m%a) */
161 _seed = (int) (s & RAND_MAX);
166 int _rand_r(unsigned int *pseed)
168 const long a = 16807;
169 const long m = 2147483647;
170 const long q = 127773; /* (m/a) */
171 const long r = 2836; /* (m%a) */
186 return (int) (s & RAND_MAX);
191 #define rand_r _rand_r
192 #define drand48 _drand48
196 static double custom_random(e_random_generator_t generator, long int *seed)
203 return (double) rand_r((unsigned int *) seed) / RAND_MAX;
205 XBT_INFO("Seen RNGSTREAM");
212 /* Generate numbers between min and max with a given mean and standard deviation */
213 double random_generate(random_data_t random)
216 double alpha, beta, gamma;
217 double U1, U2, V, W, X;
222 if (random->std == 0)
223 return random->mean * (random->max - random->min) + random->min;
225 a = random->mean * (random->mean * (1 - random->mean) /
226 (random->std * random->std) - 1);
228 random->mean) * (random->mean * (1 -
229 random->mean) / (random->std *
233 if (a <= 1. || b <= 1.)
234 beta = ((1. / a) > (1. / b)) ? (1. / a) : (1. / b);
236 beta = sqrt((alpha - 2.) / (2. * a * b - alpha));
237 gamma = a + 1. / beta;
240 /* Random generation for the Beta distribution based on
241 * R. C. H. Cheng (1978). Generating beta variates with nonintegral shape parameters. _Communications of the ACM_, *21*, 317-322.
242 * It is good for speed because it does not call math functions many times and respect the 4 given constraints
244 U1 = custom_random(random->generator, &(random->seed));
245 U2 = custom_random(random->generator, &(random->seed));
247 V = beta * log(U1 / (1 - U1));
249 } while (alpha * log(alpha / (b + W)) + gamma * V - log(4) <
254 return X * (random->max - random->min) + random->min;
257 random_data_t random_new(e_random_generator_t generator, long int seed,
258 double min, double max, double mean, double std)
260 random_data_t random = xbt_new0(s_random_data_t, 1);
262 random->generator = generator;
267 /* Check user stupidities */
269 THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
271 THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean,
274 THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean,
277 /* normalize the mean and standard deviation before storing */
278 random->mean = (mean - min) / (max - min);
279 random->std = std / (max - min);
281 if (random->mean * (1 - random->mean) < random->std * random->std)
282 THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
283 random->mean, random->std);