File size: 5,243 Bytes
2eae90c |
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 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 |
/*
* $Id: rnd.c,v 1.7 2006/07/31 17:23:09 jms Exp $
*
* Revision History
* ===================
* $Log: rnd.c,v $
* Revision 1.7 2006/07/31 17:23:09 jms
* fix to parallelism problem
*
* Revision 1.6 2005/10/25 17:26:38 jms
* check in integration between microsoft changes and baseline code
*
* Revision 1.5 2005/10/14 23:16:54 jms
* fix for answer set compliance
*
* Revision 1.4 2005/09/23 22:29:35 jms
* fix to assume 64b support in the 32b RNG calls. Should speed generation, and corrects a problem with FK between Customer and Orders
*
* Revision 1.3 2005/03/04 21:43:23 jms
* correct segfult in random()
*
* Revision 1.2 2005/01/03 20:08:59 jms
* change line terminations
*
* Revision 1.1.1.1 2004/11/24 23:31:47 jms
* re-establish external server
*
* Revision 1.7 2004/04/08 17:34:15 jms
* cleanup SOLARIS/SUN ifdefs; now all use SUN
*
* Revision 1.6 2004/03/26 20:22:56 jms
* correct Solaris header
*
* Revision 1.5 2004/03/02 20:50:50 jms
* MP/RAS porting changes
*
* Revision 1.4 2004/02/18 16:37:33 jms
* add int32_t for solaris
*
* Revision 1.3 2004/02/18 16:26:49 jms
* 32/64 bit changes for overflow handling needed additional changes when ported back to windows
*
* Revision 1.2 2004/02/18 16:17:32 jms
* add 32bit specific changes to UnifInt
*
* Revision 1.1.1.1 2003/08/08 21:50:34 jms
* recreation after CVS crash
*
* Revision 1.3 2003/08/08 21:35:26 jms
* first integration of rng64 for o_custkey and l_partkey
*
* Revision 1.2 2003/08/07 17:58:34 jms
* Convery RNG to 64bit space as preparation for new large scale RNG
*
* Revision 1.1.1.1 2003/04/03 18:54:21 jms
* initial checkin
*
*
*/
/*
* RANDOM.C -- Implements Park & Miller's "Minimum Standard" RNG
*
* (Reference: CACM, Oct 1988, pp 1192-1201)
*
* NextRand: Computes next random integer
* UnifInt: Yields an long uniformly distributed between given bounds
* UnifReal: ields a real uniformly distributed between given bounds
* Exponential: Yields a real exponentially distributed with given mean
*
*/
#include "config.h"
#include <stdio.h>
#include <math.h>
#ifdef LINUX
#include <stdint.h>
#endif
#ifdef IBM
#include <inttypes.h>
#endif
#ifdef SUN
#include <inttypes.h>
#endif
#ifdef ATT
#include <sys/bitypes.h>
#endif
#ifdef WIN32
#define int32_t __int32
#endif
#include "dss.h"
#include "rnd.h"
char *env_config PROTO((char *tag, char *dflt));
void NthElement(DSS_HUGE, DSS_HUGE *);
void
dss_random(DSS_HUGE *tgt, DSS_HUGE lower, DSS_HUGE upper, long stream)
{
*tgt = UnifInt(lower, upper, stream);
Seed[stream].usage += 1;
return;
}
void
row_start(int t) \
{
int i;
for (i=0; i <= MAX_STREAM; i++)
Seed[i].usage = 0 ;
return;
}
void
row_stop(int t) \
{
int i;
/* need to allow for handling the master and detail together */
if (t == ORDER_LINE)
t = ORDER;
if (t == PART_PSUPP)
t = PART;
for (i=0; i <= MAX_STREAM; i++)
if ((Seed[i].table == t) || (Seed[i].table == tdefs[t].child))
{
if (set_seeds && (Seed[i].usage > Seed[i].boundary))
{
fprintf(stderr, "\nSEED CHANGE: seed[%d].usage = %d\n",
i, Seed[i].usage);
Seed[i].boundary = Seed[i].usage;
}
else
{
NthElement((Seed[i].boundary - Seed[i].usage), &Seed[i].value);
#ifdef RNG_TEST
Seed[i].nCalls += Seed[i].boundary - Seed[i].usage;
#endif
}
}
return;
}
void
dump_seeds(int tbl)
{
int i;
for (i=0; i <= MAX_STREAM; i++)
if (Seed[i].table == tbl)
#ifdef RNG_TEST
printf("%d(%ld):\t%ld\n", i, Seed[i].nCalls, Seed[i].value);
#else
printf("%d:\t%ld\n", i, Seed[i].value);
#endif
return;
}
/******************************************************************
NextRand: Computes next random integer
*******************************************************************/
/*
* long NextRand( long nSeed )
*/
DSS_HUGE
NextRand(DSS_HUGE nSeed)
/*
* nSeed is the previous random number; the returned value is the
* next random number. The routine generates all numbers in the
* range 1 .. nM-1.
*/
{
nSeed = (nSeed * 16807) % 2147483647;
return (nSeed);
}
/******************************************************************
UnifInt: Yields an long uniformly distributed between given bounds
*******************************************************************/
/*
* long UnifInt( long nLow, long nHigh, long nStream )
*/
DSS_HUGE
UnifInt(DSS_HUGE nLow, DSS_HUGE nHigh, long nStream)
/*
* Returns an integer uniformly distributed between nLow and nHigh,
* including * the endpoints. nStream is the random number stream.
* Stream 0 is used if nStream is not in the range 0..MAX_STREAM.
*/
{
double dRange;
DSS_HUGE nTemp,
nRange;
int32_t nLow32 = (int32_t)nLow,
nHigh32 = (int32_t)nHigh;
if (nStream < 0 || nStream > MAX_STREAM)
nStream = 0;
if ((nHigh == MAX_LONG) && (nLow == 0))
{
dRange = DOUBLE_CAST (nHigh32 - nLow32 + 1);
nRange = nHigh32 - nLow32 + 1;
}
else
{
dRange = DOUBLE_CAST (nHigh - nLow + 1);
nRange = nHigh - nLow + 1;
}
Seed[nStream].value = NextRand(Seed[nStream].value);
#ifdef RNG_TEST
Seed[nStream].nCalls += 1;
#endif
nTemp = (DSS_HUGE) (((double) Seed[nStream].value / dM) * (dRange));
return (nLow + nTemp);
}
|