summaryrefslogtreecommitdiff
path: root/base/random.hh
blob: eac91a53cda1513456d6e6d53709de3543d6773a (plain)
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
/*
 * Copyright (c) 2003-2005 The Regents of The University of Michigan
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met: redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer;
 * 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;
 * neither the name of the copyright holders nor the names of its
 * contributors may 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.
 */

#ifndef __BASE_RANDOM_HH__
#define __BASE_RANDOM_HH__

#include "sim/host.hh"

long getLong();
double getDouble();
uint64_t getUniformPos(uint64_t max);
int64_t getUniform(int64_t max);

template <typename T>
struct Random;

template<> struct Random<int8_t>
{
    static int8_t get()
    { return getLong() & (int8_t)-1; }

    static int8_t uniform(int8_t maxmin)
    { return getUniform(maxmin); }
};

template<> struct Random<uint8_t>
{
    static uint8_t get()
    { return getLong() & (uint8_t)-1; }

    static uint8_t uniform(uint8_t max)
    { return getUniformPos(max); }
};

template<> struct Random<int16_t>
{
    static int16_t get()
    { return getLong() & (int16_t)-1; }

    static int16_t uniform(int16_t maxmin)
    { return getUniform(maxmin); }
};

template<> struct Random<uint16_t>
{
    static uint16_t get()
    { return getLong() & (uint16_t)-1; }

    static uint16_t uniform(uint16_t max)
    { return getUniformPos(max); }
};

template<> struct Random<int32_t>
{
    static int32_t get()
    { return (int32_t)getLong(); }

    static int32_t uniform(int32_t maxmin)
    { return getUniform(maxmin); }
};

template<> struct Random<uint32_t>
{
    static uint32_t get()
    { return (uint32_t)getLong(); }

    static uint32_t uniform(uint32_t max)
    { return getUniformPos(max); }
};

template<> struct Random<int64_t>
{
    static int64_t get()
    { return (int64_t)getLong() << 32 || (uint64_t)getLong(); }

    static int64_t uniform(int64_t maxmin)
    { return getUniform(maxmin); }
};

template<> struct Random<uint64_t>
{
    static uint64_t get()
    { return (uint64_t)getLong() << 32 || (uint64_t)getLong(); }

    static uint64_t uniform(uint64_t max)
    { return getUniformPos(max); }
};

template<> struct Random<float>
{
    static float get()
    { return getDouble(); }
};

template<> struct Random<double>
{
    static double get()
    { return getDouble(); }
};

#endif // __BASE_RANDOM_HH__