Changeset View

Standalone View

	Show All 30 Lines
	* @(#)random.c 8.1 (Berkeley) 6/10/93			* @(#)random.c 8.1 (Berkeley) 6/10/93
	*/			*/

	#include <sys/cdefs.h>			#include <sys/cdefs.h>
	__FBSDID("$FreeBSD$");			__FBSDID("$FreeBSD$");

	#include <sys/types.h>			#include <sys/types.h>
	#include <sys/libkern.h>			#include <sys/libkern.h>
				#include <sys/prng.h>
	#include <sys/systm.h>			#include <sys/systm.h>

	static u_long randseed = 937186357; /* after srandom(1), NSHUFF counted */

	/*			/*
	* Pseudo-random number generator for perturbing the profiling clock,			* Pseudo-random number generator. The result is uniform in [0, 2^31 - 1].
	* and whatever else we might use it for. The result is uniform on
	* [0, 2^31 - 1].
	*/			*/
	u_long			u_long
	random(void)			random(void)
	{			{
	static bool warned = false;			return (prng32());

	long x, hi, lo, t;

	/* Warn only once, or it gets very spammy. */
	if (!warned) {
	gone_in(13,
	"random(9) is the obsolete Park-Miller LCG from 1988");
	warned = true;
	}

	/*
	* Compute x[n + 1] = (7^5 * x[n]) mod (2^31 - 1).
	* From "Random number generators: good ones are hard to find",
	* Park and Miller, Communications of the ACM, vol. 31, no. 10,
	* October 1988, p. 1195.
	*/
	/* Can't be initialized with 0, so use another value. */
	if ((x = randseed) == 0)
	x = 123459876;
	hi = x / 127773;
	lo = x % 127773;
	t = 16807 * lo - 2836 * hi;
	if (t < 0)
	t += 0x7fffffff;
	randseed = t;
	return (t);
	}			}