RAND(3POSIX)

💖 RAND(3POSIX) — the POSIX Programmer's Manual page, but make it cute 💖

okay bestie, so this is RAND(3POSIX) from the POSIX Programmer's Manual, and we're gonna go through the whole thing together. no skimming, no skipping, we're eating every crumb. 🍓

🫶 PROLOG (read this first, fr)

This manual page is part of the POSIX Programmer's Manual. Heads up though: the Linux implementation of this interface may differ (so like, go consult the corresponding Linux manual page for details of Linux behavior), or — plot twist — the interface may not be implemented on Linux at all. 🙈

---

✨ NAME ✨

rand, rand_r, srand — pseudo-random number generator. that's the whole vibe. 🎲

🌸 SYNOPSIS 🌸

#include <stdlib.h>

int rand(void);
int rand_r(unsigned *seed);
void srand(unsigned seed);

👑 DESCRIPTION 👑

okay so for rand() and srand(): the functionality described on this reference page is aligned with the ISO C standard. Any conflict between the requirements described here and the ISO C standard is unintentional — no drama intended. This volume of POSIX.1‐2017 defers to the ISO C standard. periodt. 💅

The rand() function shall compute a sequence of pseudo-random integers in the range [0,{RAND_MAX}] with a period of at least 232 — and yes bestie, that's 2^32, the superscript just got absolutely demolished on its way into man-page format. 😭

rand() need not be thread-safe. so like, don't come for it. it's not that kind of function.

The rand_r() function shall compute a sequence of pseudo-random integers in the range [0,{RAND_MAX}]. (And the value of the {RAND_MAX} macro shall be at least 32767.)

If rand_r() is called with the same initial value for the object pointed to by seed and that object is not modified between successive returns and calls to rand_r(), the same sequence shall be generated. iconic behavior honestly. 🔥

The srand() function uses the argument as a seed for a new sequence of pseudo-random numbers to be returned by subsequent calls to rand(). If srand() is then called with the same seed value, the sequence of pseudo-random numbers shall be repeated. If rand() is called before any calls to srand() are made, the same sequence shall be generated as when srand() is first called with a seed value of 1. (yes, 1. that's the secret default. iykyk. 🤫)

The implementation shall behave as if no function defined in this volume of POSIX.1‐2017 calls rand() or srand(). like, nobody's secretly touching your generator behind your back. 🧚

⭐ RETURN VALUE ⭐

• The rand() function shall return the next pseudo-random number in the sequence. 🎀
• The rand_r() function shall return a pseudo-random integer.
• The srand() function shall not return a value. it gives nothing and that's valid. 💀

🦋 ERRORS 🦋

No errors are defined.

The following sections are informative.

🌈 EXAMPLES 🌈

Generating a Pseudo-Random Number Sequence

The following example demonstrates how to generate a sequence of pseudo-random numbers.

#include <stdio.h>
#include <stdlib.h>
...
    long count, i;
    char *keystr;
    int elementlen, len;
    char c;
...
/* Initial random number generator. */
    srand(1);

    /* Create keys using only lowercase characters */
    len = 0;
    for (i=0; i<count; i++) {
        while (len < elementlen) {
            c = (char) (rand() % 128);
            if (islower(c))
                keystr[len++] = c;
        }

        keystr[len] = '\0';
        printf("%s Element%0*ld\n", keystr, elementlen, i);
        len = 0;
    }

Generating the Same Sequence on Different Machines

The following code defines a pair of functions that could be incorporated into applications wishing to ensure that the same sequence of numbers is generated across different machines. (portable randomness?? we love to see it. 🫶)

static unsigned long next = 1;
int myrand(void)  /* RAND_MAX assumed to be 32767. */
{
    next = next * 1103515245 + 12345;
    return((unsigned)(next/65536) % 32768);
}

void mysrand(unsigned seed)
{
    next = seed;
}

💜 APPLICATION USAGE 💜

The drand48() and random() functions provide much more elaborate pseudo-random number generators. like, they went to college for this. 🎓

The limitations on the amount of state that can be carried between one function call and another mean the rand_r() function can never be implemented in a way which satisfies all of the requirements on a pseudo-random number generator. so like, it's structurally not beating the allegations. 😭

These functions should be avoided whenever non-trivial requirements (including safety) have to be fulfilled. bestie. seriously. do NOT use these for anything that actually matters. 🚨

🎀 RATIONALE 🎀

The ISO C standard rand() and srand() functions allow per-process pseudo-random streams shared by all threads. Those two functions need not change, but there has to be mutual-exclusion that prevents interference between two threads concurrently accessing the random number generator.

With regard to rand(), there are two different behaviors that may be wanted in a multi-threaded program:

1. A single per-process sequence of pseudo-random numbers that is shared by all threads that call rand()
2. A different sequence of pseudo-random numbers for each thread that calls rand()

This is provided by the modified thread-safe function based on whether the seed value is global to the entire process or local to each thread. main character energy for the seed, honestly. 👑

This does not address the known deficiencies of the rand() function implementations, which have been approached by maintaining more state. In effect, this specifies new thread-safe forms of a deficient function. yeah. we said what we said. 💀

🌸 FUTURE DIRECTIONS 🌸

The rand_r() function may be removed in a future version. so like, enjoy it while it lasts bestie. 🥀

⭐ SEE ALSO ⭐

• drand48()
• initstate()

The Base Definitions volume of POSIX.1‐2017, <stdlib.h>

💅 COPYRIGHT 💅

Portions of this text are reprinted and reproduced in electronic form from IEEE Std 1003.1-2017, Standard for Information Technology -- Portable Operating System Interface (POSIX), The Open Group Base Specifications Issue 7, 2018 Edition, Copyright (C) 2018 by the Institute of Electrical and Electronics Engineers, Inc and The Open Group. In the event of any discrepancy between this version and the original IEEE and The Open Group Standard, the original IEEE and The Open Group Standard is the referee document. The original Standard can be obtained online at http://www.opengroup.org/unix/online.html .

Any typographical or formatting errors that appear in this page are most likely to have been introduced during the conversion of the source files to man page format. To report such errors, see https://www.kernel.org/doc/man-pages/reporting_bugs.html .

---

okay that's the whole thing, no notes, we read every single line together 🥹 this little masterpiece is brought to you by IEEE/The Open Group, 2017 — yes, the RAND(3POSIX) of it all — and that's a wrap. slay, bye bestie! 💖✨🎀🦋