NAME

drand48, erand48, jrand48, lcong48, lrand48, mrand48, nrand48, seed48, srand48 — generate uniformly distributed pseudo-random numbers

SYNOPSIS

[XSI] #include <stdlib.h>

double drand48(void);
double erand48(unsigned short xsubi[3]);
long jrand48(unsigned short xsubi[3]);
void lcong48(unsigned short param[7]);
long lrand48(void);
long mrand48(void);
long nrand48(unsigned short xsubi[3]);
unsigned short *seed48(unsigned short seed16v[3]);
void srand48(long seedval);

DESCRIPTION

This family of functions shall generate pseudo-random numbers using a linear congruential algorithm and 48-bit integer arithmetic.

The drand48() and erand48() functions shall return non-negative, double-precision, floating-point values, uniformly distributed over the interval [0.0,1.0).

The lrand48() and nrand48() functions shall return non-negative, long integers, uniformly distributed over the interval [0,2³¹).

The mrand48() and jrand48() functions shall return signed long integers uniformly distributed over the interval [-2³¹,2³¹).

The srand48(), seed48(), and lcong48() functions are initialization entry points, one of which should be invoked before either drand48(), lrand48(), or mrand48() is called. (Although it is not recommended practice, constant default initializer values shall be supplied automatically if drand48(), lrand48(), or mrand48() is called without a prior call to an initialization entry point.) The erand48(), nrand48(), and jrand48() functions do not require an initialization entry point to be called first.

All the routines work by generating a sequence of 48-bit integer values, \(X_{i}\), according to the linear congruential formula:

\(X_{n+1}=\left(a X_n+c\right)_{\bmod m} \quad n \geq 0\)

The parameter m=2⁴⁸; hence 48-bit integer arithmetic is performed. Unless lcong48() is invoked, the multiplier value a and the addend value c are given by:

\( \begin{aligned} & a= \text { 5DEECE66D }_{16}=273673163155_8 \\ & c=\mathrm{B}_{16}=13_8 \end{aligned} \)

The value returned by any of the drand48(), erand48(), jrand48(), lrand48(), mrand48(), or nrand48() functions is computed by first generating the next 48-bit \(X_{i}\) in the sequence. \(X_{i}\) is then converted to the return value as follows:

• For drand48() and erand48() the value shall be 2^-48 times \(X_{i}\).

• For jrand48() and mrand48() the value shall be the largest integer not greater than 2^-16 times \(X_{i}\).

• For lrand48() and nrand48() the value shall be the largest integer not greater than 2^-17 times \(X_{i}\).

The drand48(), lrand48(), and mrand48() functions store the last 48-bit \(X_{i}\) generated in an internal buffer; that is why the application shall ensure that these are initialized prior to being invoked. The erand48(), nrand48(), and jrand48() functions require the calling program to provide storage for the successive \(X_{i}\) values in the array specified as an argument when the functions are invoked. That is why these routines do not have to be initialized; the calling program merely has to place the desired initial value of \(X_{i}\) into the array and pass it as an argument. By using different arguments, erand48(), nrand48(), and jrand48() allow separate modules of a large program to generate several independent streams of pseudo-random numbers; that is, the sequence of numbers in each stream shall not depend upon how many times the routines are called to generate numbers for the other streams.

The initializer function srand48() sets the high-order 32 bits of \(X_{i}\) to the low-order 32 bits contained in its argument. The low-order 16 bits of \(X_{i}\) are set to the arbitrary value 330E₁₆.

The initializer function seed48() sets the value of \(X_{i}\) to the 48-bit value specified in the argument array. The low-order 16 bits of \(X_{i}\) are set to the low-order 16 bits of seed16v[0]. The mid-order 16 bits of \(X_{i}\) are set to the low-order 16 bits of seed16v[1]. The high-order 16 bits of \(X_{i}\) are set to the low-order 16 bits of seed16v[2]. In addition, the previous value of \(X_{i}\) is copied into a 48-bit internal buffer, used only by seed48(), and a pointer to this buffer is the value returned by seed48(). This returned pointer, which can just be ignored if not needed, is useful if a program is to be restarted from a given point at some future time—use the pointer to get at and store the last \(X_{i}\) value, and then use this value to reinitialize via seed48() when the program is restarted.

The initializer function lcong48() allows the user to specify the initial \(X_{i}\), the multiplier value a, and the addend value c. Argument array elements param[0-2] specify \(X_{i}\), param[3-5] specify the multiplier a, and param[6] specifies the 16-bit addend c. After lcong48() is called, a subsequent call to either srand48() or seed48() shall restore the standard multiplier and addend values, a and c, specified above.

The drand48(), lrand48(), and mrand48() functions need not be thread-safe.

RETURN VALUE

As described in the DESCRIPTION above.

ERRORS

No errors are defined.

EXAMPLES

The following program tests that the required pseudo-random number generator is used by these functions.

#include <assert.h>
#include <stdlib.h>


int main() {
  {
    unsigned short xsubi[3] = {37174, 64810, 11603};
    double d = erand48(xsubi);
    assert(d >= 0.896);
    assert(d <= 0.897);
    assert(xsubi[0] == 22537);
    assert(xsubi[1] == 47966);
    assert(xsubi[2] == 58735);
    d = erand48(xsubi);
    assert(d >= 0.337);
    assert(d <= 0.338);
    assert(xsubi[0] == 37344);
    assert(xsubi[1] == 32911);
    assert(xsubi[2] == 22119);
    d = erand48(xsubi);
    assert(d >= 0.647);
    assert(d <= 0.648);
    assert(xsubi[0] == 23659);
    assert(xsubi[1] == 29872);
    assert(xsubi[2] == 42445);
    d = erand48(xsubi);
    assert(d >= 0.500);
    assert(d <= 0.501);
    assert(xsubi[0] == 31642);
    assert(xsubi[1] == 7875);
    assert(xsubi[2] == 32802);
    d = erand48(xsubi);
    assert(d >= 0.506);
    assert(d <= 0.507);
    assert(xsubi[0] == 64669);
    assert(xsubi[1] == 14399);
    assert(xsubi[2] == 33170);
  }


  {
    unsigned short xsubi[3] = {25175, 11052, 45015};
    assert(jrand48(xsubi) == 1699503220);
    assert(xsubi[0] == 2326);
    assert(xsubi[1] == 23668);
    assert(xsubi[2] == 25932);
    assert(jrand48(xsubi) == -992276007);
    assert(xsubi[0] == 41577);
    assert(xsubi[1] == 4569);
    assert(xsubi[2] == 50395);
    assert(jrand48(xsubi) == -19535776);
    assert(xsubi[0] == 31936);
    assert(xsubi[1] == 59488);
    assert(xsubi[2] == 65237);
    assert(jrand48(xsubi) == 79438377);
    assert(xsubi[0] == 40395);
    assert(xsubi[1] == 8745);
    assert(xsubi[2] == 1212);
    assert(jrand48(xsubi) == -1258917728);
    assert(xsubi[0] == 37242);
    assert(xsubi[1] == 28832);
    assert(xsubi[2] == 46326);
  }


  {
    unsigned short xsubi[3] = {546, 33817, 23389};
    assert(nrand48(xsubi) == 914920692);
    assert(xsubi[0] == 29829);
    assert(xsubi[1] == 10728);
    assert(xsubi[2] == 27921);
    assert(nrand48(xsubi) == 754104482);
    assert(xsubi[0] == 6828);
    assert(xsubi[1] == 28997);
    assert(xsubi[2] == 23013);
    assert(nrand48(xsubi) == 609453945);
    assert(xsubi[0] == 58183);
    assert(xsubi[1] == 3826);
    assert(xsubi[2] == 18599);
    assert(nrand48(xsubi) == 1878644360);
    assert(xsubi[0] == 36678);
    assert(xsubi[1] == 44304);
    assert(xsubi[2] == 57331);
    assert(nrand48(xsubi) == 2114923686);
    assert(xsubi[0] == 58585);
    assert(xsubi[1] == 22861);
    assert(xsubi[2] == 64542);
  }
}

APPLICATION USAGE

These functions should be avoided whenever non-trivial requirements (including safety) have to be fulfilled, unless seeded using getentropy().

RATIONALE

None.

FUTURE DIRECTIONS

None.

SEE ALSO

getentropy , initstate , rand

XBD <stdlib.h>

CHANGE HISTORY

First released in Issue 1. Derived from Issue 1 of the SVID.

Issue 5

A note indicating that the drand48(), lrand48(), and mrand48() functions need not be reentrant is added to the DESCRIPTION.

Issue 6

The normative text is updated to avoid use of the term "must" for application requirements.

Issue 7

Austin Group Interpretation 1003.1-2001 #156 is applied.

POSIX.1-2008, Technical Corrigendum 2, XSH/TC2-2008/0083 [743] is applied.

Issue 8

Austin Group Defect 1107 is applied, clarifying how the return value is calculated from \(X_{i}\) for each function.

Austin Group Defect 1134 is applied, adding getentropy().