rear pointers can't wrap on the same call by not testing the rear
pointer if the front one has wrapped. Returns a 31-bit random number. */
-libc_hidden_proto(random_r)
+/* libc_hidden_proto(random_r) */
int random_r(struct random_data *buf, int32_t *result)
{
int32_t *state;
information a given number of times to get rid of any initial dependencies
introduced by the L.C.R.N.G. Note that the initialization of randtbl[]
for default usage relies on values produced by this routine. */
-libc_hidden_proto(srandom_r)
+/* libc_hidden_proto(srandom_r) */
int srandom_r (unsigned int seed, struct random_data *buf)
{
int type;
Note: The first thing we do is save the current state, if any, just like
setstate so that it doesn't matter when initstate is called.
Returns a pointer to the old state. */
-libc_hidden_proto(initstate_r)
+/* libc_hidden_proto(initstate_r) */
int initstate_r (unsigned int seed, char *arg_state, size_t n, struct random_data *buf)
{
int type;
to the order in which things are done, it is OK to call setstate with the
same state as the current state
Returns a pointer to the old state information. */
-libc_hidden_proto(setstate_r)
+/* libc_hidden_proto(setstate_r) */
int setstate_r (char *arg_state, struct random_data *buf)
{
int32_t *new_state = 1 + (int32_t *) arg_state;