Something went wrong. Try again.
Cider Isn't Darwin Emulation, Really
Something went wrong. Try again.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237.\" Copyright (c) 1983, 1991, 1993.\" The Regents of the University of California. All rights reserved..\".\" Redistribution and use in source and binary forms, with or without.\" modification, are permitted provided that the following conditions.\" are met:.\" 1. Redistributions of source code must retain the above copyright.\" notice, this list of conditions and the following disclaimer..\" 2. 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..\" 4. Neither the name of the University 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 REGENTS 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 REGENTS 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..\".\" @(#)random.3 8.1 (Berkeley) 6/4/93.\" $FreeBSD: src/lib/libc/stdlib/random.3,v 1.22 2007/01/09 00:28:10 imp Exp $.\".Dd June 4, 1993.Dt RANDOM 3.Os.Sh NAME.Nm initstate ,.Nm random ,.Nm setstate ,.Nm srandom ,.Nm srandomdev.Nd better random number generator; routines for changing generators.Sh LIBRARY.Lb libc.Sh SYNOPSIS.In stdlib.h.Ft char *.Fo initstate.Fa "unsigned seed".Fa "char *state".Fa "size_t size".Fc.Ft long.Fo random.Fa void.Fc.Ft char *.Fo setstate.Fa "const char *state".Fc.Ft void.Fo srandom.Fa "unsigned seed".Fc.Ft void.Fo srandomdev.Fa void.Fc.Sh DESCRIPTIONThe.Fn randomfunctionuses a non-linear, additive feedback, random number generator, employing adefault table of size 31 long integers.It returns successive pseudo-randomnumbers in the range from 0 to.if t 2\u\s731\s10\d\(mi1..if n (2**31)\(mi1.The period of this random number generator is very large, approximately.if t 16\(mu(2\u\s731\s10\d\(mi1)..if n 16*((2**31)\(mi1)..PpThe.Fn randomand.Fn srandomfunctions have (almost) the same calling sequence and initialization properties as the.Xr rand 3and.Xr srand 3functions.The difference is that.Xr rand 3produces a much less random sequence \(em in fact, the low dozen bitsgenerated by rand go through a cyclic pattern.All of the bits generated by.Fn randomare usable.For example,.Sq Li random()&01will produce a random binaryvalue..PpLike.Xr srand 3 ,.Fn srandomsets the initial seed value for future calls to.Fn random .Like.Xr rand 3 ,.Fn randomwill by default produce a sequence of numbers that can be duplicatedby calling.Fn srandomwith the same seed..PpThe.Fn srandomdevroutine initializes a state array, using the.Xr random 4random number device which returns good random numbers,suitable for cryptographic use.Note that this particular seedingprocedure can generate states which are impossible to reproduce bycalling.Fn srandomwith any value, since the succeeding terms in thestate buffer are no longer derived from the LC algorithm applied toa fixed seed..PpThe.Fn initstateroutine allows a state array, passed in as an argument, to be initializedfor future use.The size of the state array (in bytes) is used by.Fn initstateto decide how sophisticated a random number generator it should use \(em themore state, the better the random numbers will be.(Current "optimal" values for the amount of state information are8, 32, 64, 128, and 256 bytes; other amounts will be rounded down tothe nearest known amount.Using less than 8 bytes will cause an error.)The seed for the initialization (which specifies a starting point forthe random number sequence and provides for restarting at the samepoint) is also an argument.The.Fn initstatefunctionreturns a pointer to the previous state information array..PpOnce a state has been initialized, the.Fn setstateroutine provides for rapid switching between states.The.Fn setstatefunctionreturns a pointer to the previous state array; itsargument state array is used for further random number generationuntil the next call to.Fn initstateor.Fn setstate ..PpOnce a state array has been initialized, it may be restarted at adifferent point either by calling.Fn initstate(with the desired seed, the state array, and its size) or by callingboth.Fn setstate(with the state array) and.Fn srandom(with the desired seed).The advantage of calling both.Fn setstateand.Fn srandomis that the size of the state array does not have to be remembered afterit is initialized..PpWith 256 bytes of state information, the period of the random numbergenerator is greater than.if t 2\u\s769\s10\d,.if n 2**69 ,which should be sufficient for most purposes..Sh DIAGNOSTICSIf.Fn initstateis called with less than 8 bytes of state information, or if.Fn setstatedetects that the state information has been garbled, errormessages are printed on the standard error output..Sh LEGACY SYNOPSIS.Fd #include <stdlib.h>.Pp.Ft char *.br.Fo initstate.Fa "unsigned long seed".Fa "char *state".Fa "long size".Fc ;.Pp.Ft char *.br.Fo setstate.Fa "char *state".Fc ;.Pp.Ft void.br.Fo srandom.Fa "unsigned long seed".Fc ;.PpThe type of each parameter is different in the legacy version..Sh SEE ALSO.Xr arc4random 3 ,.Xr rand 3 ,.Xr srand 3 ,.Xr random 4 ,.Xr compat 5.Sh HISTORYThesefunctions appeared in.Bx 4.2 ..Sh AUTHORS.An Earl T. Cohen.Sh BUGSAbout 2/3 the speed of.Xr rand 3 ..PpThe historical implementation used to have a very weak seeding; therandom sequence did not vary much with the seed.The current implementation employs a better pseudo-random numbergenerator for the initial state calculation..PpApplications requiring cryptographic quality randomness should use.Xr arc4random 3 .