rand, rand_r, srand − pseudo-random number generator


#include <stdlib.h>

int rand(void);

int rand_r(unsigned int *seedp);

void srand(unsigned int seed);

Feature Test Macro Requirements for glibc (see feature_test_macros(7)):



The rand() function returns a pseudo-random integer in the range 0 to RAND_MAX inclusive (i.e., the mathematical range [0, RAND_MAX]).

The srand() function sets its argument as the seed for a new sequence of pseudo-random integers to be returned by rand(). These sequences are repeatable by calling srand() with the same seed value.

If no seed value is provided, the rand() function is automatically seeded with a value of 1.

The function rand() is not reentrant or thread-safe, since it uses hidden state that is modified on each call. This might just be the seed value to be used by the next call, or it might be something more elaborate. In order to get reproducible behavior in a threaded application, this state must be made explicit; this can be done using the reentrant function rand_r().

Like rand(), rand_r() returns a pseudo-random integer in the range [0, RAND_MAX]. The seedp argument is a pointer to an unsigned int that is used to store state between calls. If rand_r() is called with the same initial value for the integer pointed to by seedp, and that value is not modified between calls, then the same pseudo-random sequence will result.

The value pointed to by the seedp argument of rand_r() provides only a very small amount of state, so this function will be a weak pseudo-random generator. Try drand48_r(3) instead.


The rand() and rand_r() functions return a value between 0 and RAND_MAX (inclusive). The srand() function returns no value.


The functions rand() and srand() conform to SVr4, 4.3BSD, C89, C99, POSIX.1-2001. The function rand_r() is from POSIX.1-2001. POSIX.1-2008 marks rand_r() as obsolete.


The versions of rand() and srand() in the Linux C Library use the same random number generator as random(3) and srandom(3), so the lower-order bits should be as random as the higher-order bits. However, on older rand() implementations, and on current implementations on different systems, the lower-order bits are much less random than the higher-order bits. Do not use this function in applications intended to be portable when good randomness is needed. (Use random(3) instead.)


POSIX.1-2001 gives the following example of an implementation of rand() and srand(), possibly useful when one needs the same sequence on two different machines.

static unsigned long next = 1;

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

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

The following program can be used to display the pseudo-random sequence produced by rand() when given a particular seed.

#include <stdlib.h>
#include <stdio.h>

main(int argc, char *argv[])
int j, r, nloops;
unsigned int seed;

if (argc != 3) {
fprintf(stderr, "Usage: %s <seed> <nloops>\n", argv[0]);

seed = atoi(argv[1]);
nloops = atoi(argv[2]);

for (j = 0; j < nloops; j++) {
r = rand();
printf("%d\n", r);



drand48(3), random(3)


This page is part of release 3.69 of the Linux man-pages project. A description of the project, information about reporting bugs, and the latest version of this page, can be found at http://www.kernel.org/doc/man−pages/.

More Linux Commands

pthread_yield(3) - yield the processor - Linux manual page
pthread_yield() causes the calling thread to relinquish the CPU. The thread is placed at the end of the run queue for its static priority and another thread is

set_menu_userptr(3menu) - associate application data with a
Every menu and every menu item has a field that can be used to hold application-specific data (that is, the menu-driver code leaves it alone). These functions g

rpms2solv(1) convert one or more rpms into a solv file......
The rpms2solv tool converts the header data from one or more rpms into the solv file written to standard output. -m MANIFESTFILE Read the rpm file names from th

readahead(2) - perform file readahead into page cache.......
readahead() initiates readahead on a file so that subsequent reads from that file will be satisfied from the cache, and not block on disk I/O (assuming the read

mrtg-ipv6(1) IPv6 support in MRTG - Linux manual page.......
MRTG and cfgmaker support SNMP over IPv6. IPv6 targets can be specified by hostname or IPv6 address, and if the required libraries are present (see below), quer

snmpusm(1) - creates and maintains SNMPv3 users on a network
snmpusm is an SNMP application that can be used to do simple maintenance on the users known to an SNMP agent, by manipulating the agents User-based Security Mod

XGravityEvent(3) - GravityNotify event structure (Man Page)
The structure for GravityNotify events contains: typedef struct { int type; /* GravityNotify */ unsigned long serial; /* # of last request processed by server *

lremovexattr(2) - remove an extended attribute (Man Page)...
Extended attributes are name:value pairs associated with inodes (files, directories, symbolic links, etc.). They are extensions to the normal attributes which a

addstr(3ncurses) - add a string of characters to a curses wi
These functions write the (null-terminated) character string str on the given window. It is similar to calling waddch once for each character in the string. The

getgrent_r(3) - get group file entry reentrantly (Man Page)
The functions getgrent_r() and fgetgrent_r() are the reentrant versions of getgrent(3) and fgetgrent(3). The former reads the next group entry from the stream i

pesign-client(1) command line tool for signing UEFI applicat
pesign is a command line tool for manipulating signatures and cryptographic digests of UEFI applications. OPTIONS --unlock Unlock the specified token. A PIN - s

XCompositeRedirectWindow(3) - X Composite Extension library
The composite extension provides several related mechanisms: Per-hierarchy storage The rendering of an entire hierarchy of windows is redirected to off-screen s

We can't live, work or learn in freedom unless the software we use is free.