Commit | Line | Data |
---|---|---|
e6e0e332 MW |
1 | /* -*-c-*- |
2 | * | |
3 | * $Id: lcrand.h,v 1.1 2000/05/21 11:28:30 mdw Exp $ | |
4 | * | |
5 | * Simple linear congruential generator | |
6 | * | |
7 | * (c) 1999 Straylight/Edgeware | |
8 | * (c) 2000 Mark Wooding | |
9 | */ | |
10 | ||
11 | /*----- Licensing notice --------------------------------------------------* | |
12 | * | |
13 | * Copyright (c) 2000 Mark Wooding | |
14 | * All rights reserved. | |
15 | * | |
16 | * Redistribution and use in source and binary forms, with or without | |
17 | * modification, are permitted provided that the following conditions are | |
18 | * met: | |
19 | * | |
20 | * 1. Redistributions of source code must retain the above copyright | |
21 | * notice, this list of conditions and the following disclaimer. | |
22 | * | |
23 | * 2, Redistributions in binary form must reproduce the above copyright | |
24 | * notice, this list of conditions and the following disclaimer in the | |
25 | * documentation and/or other materials provided with the distribution. | |
26 | * | |
27 | * 3. The name of the authors may not be used to endorse or promote | |
28 | * products derived from this software without specific prior written | |
29 | * permission. | |
30 | * | |
31 | * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED | |
32 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | |
33 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN | |
34 | * NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, | |
35 | * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
36 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | |
37 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
38 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
39 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN | |
40 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
41 | * POSSIBILITY OF SUCH DAMAGE. | |
42 | * | |
43 | * Instead of accepting the above terms, you may redistribute and/or modify | |
44 | * this software under the terms of either the GNU General Public License, | |
45 | * or the GNU Library General Public License, published by the Free | |
46 | * Software Foundation; either version 2 of the License, or (at your | |
47 | * option) any later version. | |
48 | */ | |
49 | ||
50 | /*----- Revision history --------------------------------------------------* | |
51 | * | |
52 | * $Log: lcrand.h,v $ | |
53 | * Revision 1.1 2000/05/21 11:28:30 mdw | |
54 | * Initial check-in. | |
55 | * | |
56 | * --- Past lives (Catacomb) --- * | |
57 | * | |
58 | * Revision 1.1 1999/12/10 23:15:27 mdw | |
59 | * Noncryptographic random number generator. | |
60 | * | |
61 | */ | |
62 | ||
63 | /*----- Notes on the linear congruential generator ------------------------* | |
64 | * | |
65 | * This pseudorandom number generator is simple, but has absolutely no | |
66 | * cryptographic strength whatever. It may be used whenever random numbers | |
67 | * are required but cryptographic strength is not, for example when | |
68 | * generating numbers for use in primality tests. To be honest, it's not | |
69 | * even particularly fast, although a certain amount of effort has been | |
70 | * expended on making it better than awfully slow. To put things in | |
71 | * perspective, it can't quite spit bytes out as fast as OFB DES. (Then | |
72 | * again, bytes aren't its natural output format.) Its main use is probably | |
73 | * seeding a Fibonacci generator. | |
74 | * | |
75 | * There exists a fixed-point input @LCRAND_FIXEDPT@ -- when fed to the | |
76 | * generator it comes straight back out again. All other inputs less than | |
77 | * the modulus are part of the same sequence of period %$p - 1$%. | |
78 | * | |
79 | * The generator has been tested for its statistical properties. George | |
80 | * Marsaglia's Diehard tests give it a reasonably clean bill of health. | |
81 | * | |
82 | * The modulus %$p$% is chosen as the largest prime number less than | |
83 | * %$2^{32}$%. The multiplier %$a$% and additive constant %$c$% are based on | |
84 | * the decimal expansions of %$\pi$% and %$e$%, with the additional | |
85 | * restriction that the multiplier must be a primitive element modulo %$p$%. | |
86 | * The fixed point value is determined as %$c / (1 - a) \bmod p$%. | |
87 | */ | |
88 | ||
89 | #ifndef LCRAND_H | |
90 | #define LCRAND_H | |
91 | ||
92 | #ifdef __cplusplus | |
93 | extern "C" { | |
94 | #endif | |
95 | ||
96 | /*----- Header files ------------------------------------------------------*/ | |
97 | ||
98 | #ifndef BITS_H | |
99 | # include "bits.h" | |
100 | #endif | |
101 | ||
102 | /*----- Constants ---------------------------------------------------------*/ | |
103 | ||
104 | #define LCRAND_P 4294967291u /* Modulus for the generator */ | |
105 | #define LCRAND_A 314159265u /* Multiplier (primitive mod @p@) */ | |
106 | #define LCRAND_C 271828183u /* Additive constant */ | |
107 | ||
108 | #define LCRAND_FIXEDPT 3223959250u /* Fixed point (only bad input) */ | |
109 | ||
110 | /*----- Functions provided ------------------------------------------------*/ | |
111 | ||
112 | /* --- @lcrand@ --- * | |
113 | * | |
114 | * Arguments: @uint32 x@ = seed value | |
115 | * | |
116 | * Returns: New state of the generator. | |
117 | * | |
118 | * Use: Steps the generator. Returns %$ax + c \bmod p$%. | |
119 | */ | |
120 | ||
121 | extern uint32 lcrand(uint32 /*x*/); | |
122 | ||
123 | /* --- @lcrand_range@ --- * | |
124 | * | |
125 | * Arguments: @uint32 *x@ = pointer to seed value (updated) | |
126 | * @uint32 m@ = limit allowable | |
127 | * | |
128 | * Returns: A uniformly distributed pseudorandom integer in the interval | |
129 | * %$[0, m)$%. | |
130 | */ | |
131 | ||
132 | extern uint32 lcrand_range(uint32 */*x*/, uint32 /*m*/); | |
133 | ||
134 | /*----- That's all, folks -------------------------------------------------*/ | |
135 | ||
136 | #ifdef __cplusplus | |
137 | } | |
138 | #endif | |
139 | ||
140 | #endif |