2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
33 #include "base/fenv.hh"
34 #include "base/intmath.hh"
35 #include "base/misc.hh"
36 #include "base/random.hh"
37 #include "sim/serialize.hh"
43 // default random seed taken from original source
47 Random::Random(uint32_t s
)
52 Random::Random(uint32_t init_key
[], int key_length
)
54 init(init_key
, key_length
);
61 // To preserve the uniform random distribution between min and max,
62 // and allow all numbers to be represented, we generate a uniform
63 // random number to the nearest power of two greater than max. If
64 // this number doesn't fall between 0 and max, we try again. Anything
65 // else would skew the distribution.
67 Random::genrand(uint32_t max
)
71 if (max
== std::numeric_limits
<uint32_t>::max())
74 int log
= ceilLog2(max
+ 1);
75 int shift
= (sizeof(uint32_t) * 8 - log
);
79 random
= genrand() >> shift
;
80 } while (random
> max
);
86 Random::genrand(uint64_t max
)
90 if (max
== std::numeric_limits
<uint64_t>::max())
93 int log
= ceilLog2(max
+ 1);
94 int shift
= (sizeof(uint64_t) * 8 - log
);
98 random
= (uint64_t)genrand() << 32 | (uint64_t)genrand();
99 random
= random
>> shift
;
100 } while (random
> max
);
106 Random::serialize(const string
&base
, ostream
&os
)
109 paramOut(os
, base
+ ".mti", mti
);
110 paramOut(os
, base
+ ".length", length
);
111 arrayParamOut(os
, base
+ ".data", mt
, length
);
115 Random::unserialize(const string
&base
, Checkpoint
*cp
, const string
§ion
)
119 paramIn(cp
, section
, base
+ ".mti", mti
);
120 paramIn(cp
, section
, base
+ ".length", length
);
122 panic("cant unserialize random number data. length != %d\n", length
);
124 arrayParamIn(cp
, section
, base
+ ".data", mt
, length
);