/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 1996 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984 AT&T */
/* All Rights Reserved */
#pragma ident "%Z%%M% %I% %E% SMI"
/*LINTLIBRARY*/
/*
* drand48, etc. pseudo-random number generator
* This implementation assumes unsigned short integers of at least
* 16 bits, long integers of at least 32 bits, and ignores
* overflows on adding or multiplying two unsigned integers.
* Two's-complement representation is assumed in a few places.
* Some extra masking is done if unsigneds are exactly 16 bits
* or longs are exactly 32 bits, but so what?
* An assembly-language implementation would run significantly faster.
*/
#define N 16
#define MUL(x, y, z) { long l = (long)(x) * (long)(y); \
#define C 0xB
#define REST(v) \
for (i = 0; i < 3; i++) { \
xsubi[i] = x[i]; \
x[i] = temp[i]; \
} \
return (v)
register unsigned short *xsubi; \
{ \
register int i; \
register TYPE v; \
unsigned temp[3]; \
\
for (i = 0; i < 3; i++) { \
temp[i] = x[i]; \
} \
v = F(); \
REST(v); \
}
static void next();
double
drand48()
{
next();
}
long
lrand48()
{
next();
return (((long)x[2] << (N - 1)) + (x[1] >> 1));
}
long
mrand48()
{
next();
return (((long)x[2] << N) + x[1]);
}
static void
next()
{
MUL(a[0], x[0], p);
MUL(a[0], x[1], q);
MUL(a[1], x[0], r);
a[0] * x[2] + a[1] * x[1] + a[2] * x[0]);
x[0] = LOW(p[0]);
}
void
long seedval;
{
}
unsigned short *
unsigned short seed16v[3];
{
return (lastx);
}
void
unsigned short param[7];
{
}
#ifdef DRIVER
/*
* This should print the sequences of integers in Tables 2
* and 1 of the TM:
* 1623, 3442, 1447, 1829, 1305, ...
* 657EB7255101, D72A0C966378, 5A743C062A23, ...
*/
#include <stdio.h>
main()
{
int i;
for (i = 0; i < 80; i++) {
}
}
#endif