random_r.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362
  1. /*
  2. * Copyright (c) 1983 Regents of the University of California.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms are permitted
  6. * provided that the above copyright notice and this paragraph are
  7. * duplicated in all such forms and that any documentation,
  8. * advertising materials, and other materials related to such
  9. * distribution and use acknowledge that the software was developed
  10. * by the University of California, Berkeley. The name of the
  11. * University may not be used to endorse or promote products derived
  12. * from this software without specific prior written permission.
  13. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
  14. * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
  15. * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
  16. */
  17. /*
  18. * This is derived from the Berkeley source:
  19. * @(#)random.c 5.5 (Berkeley) 7/6/88
  20. * It was reworked for the GNU C Library by Roland McGrath.
  21. * Rewritten to be reentrant by Ulrich Drepper, 1995
  22. */
  23. #define _GNU_SOURCE
  24. #include <features.h>
  25. #include <errno.h>
  26. #include <limits.h>
  27. #include <stddef.h>
  28. #include <stdlib.h>
  29. /* An improved random number generation package. In addition to the standard
  30. rand()/srand() like interface, this package also has a special state info
  31. interface. The initstate() routine is called with a seed, an array of
  32. bytes, and a count of how many bytes are being passed in; this array is
  33. then initialized to contain information for random number generation with
  34. that much state information. Good sizes for the amount of state
  35. information are 32, 64, 128, and 256 bytes. The state can be switched by
  36. calling the setstate() function with the same array as was initialized
  37. with initstate(). By default, the package runs with 128 bytes of state
  38. information and generates far better random numbers than a linear
  39. congruential generator. If the amount of state information is less than
  40. 32 bytes, a simple linear congruential R.N.G. is used. Internally, the
  41. state information is treated as an array of longs; the zeroth element of
  42. the array is the type of R.N.G. being used (small integer); the remainder
  43. of the array is the state information for the R.N.G. Thus, 32 bytes of
  44. state information will give 7 longs worth of state information, which will
  45. allow a degree seven polynomial. (Note: The zeroth word of state
  46. information also has some other information stored in it; see setstate
  47. for details). The random number generation technique is a linear feedback
  48. shift register approach, employing trinomials (since there are fewer terms
  49. to sum up that way). In this approach, the least significant bit of all
  50. the numbers in the state table will act as a linear feedback shift register,
  51. and will have period 2^deg - 1 (where deg is the degree of the polynomial
  52. being used, assuming that the polynomial is irreducible and primitive).
  53. The higher order bits will have longer periods, since their values are
  54. also influenced by pseudo-random carries out of the lower bits. The
  55. total period of the generator is approximately deg*(2**deg - 1); thus
  56. doubling the amount of state information has a vast influence on the
  57. period of the generator. Note: The deg*(2**deg - 1) is an approximation
  58. only good for large deg, when the period of the shift register is the
  59. dominant factor. With deg equal to seven, the period is actually much
  60. longer than the 7*(2**7 - 1) predicted by this formula. */
  61. /* For each of the currently supported random number generators, we have a
  62. break value on the amount of state information (you need at least this many
  63. bytes of state info to support this random number generator), a degree for
  64. the polynomial (actually a trinomial) that the R.N.G. is based on, and
  65. separation between the two lower order coefficients of the trinomial. */
  66. /* Linear congruential. */
  67. #define TYPE_0 0
  68. #define BREAK_0 8
  69. #define DEG_0 0
  70. #define SEP_0 0
  71. /* x**7 + x**3 + 1. */
  72. #define TYPE_1 1
  73. #define BREAK_1 32
  74. #define DEG_1 7
  75. #define SEP_1 3
  76. /* x**15 + x + 1. */
  77. #define TYPE_2 2
  78. #define BREAK_2 64
  79. #define DEG_2 15
  80. #define SEP_2 1
  81. /* x**31 + x**3 + 1. */
  82. #define TYPE_3 3
  83. #define BREAK_3 128
  84. #define DEG_3 31
  85. #define SEP_3 3
  86. /* x**63 + x + 1. */
  87. #define TYPE_4 4
  88. #define BREAK_4 256
  89. #define DEG_4 63
  90. #define SEP_4 1
  91. /* Array versions of the above information to make code run faster.
  92. Relies on fact that TYPE_i == i. */
  93. #define MAX_TYPES 5 /* Max number of types above. */
  94. struct random_poly_info
  95. {
  96. int seps[MAX_TYPES];
  97. int degrees[MAX_TYPES];
  98. };
  99. static const struct random_poly_info random_poly_info =
  100. {
  101. { SEP_0, SEP_1, SEP_2, SEP_3, SEP_4 },
  102. { DEG_0, DEG_1, DEG_2, DEG_3, DEG_4 }
  103. };
  104. /* If we are using the trivial TYPE_0 R.N.G., just do the old linear
  105. congruential bit. Otherwise, we do our fancy trinomial stuff, which is the
  106. same in all the other cases due to all the global variables that have been
  107. set up. The basic operation is to add the number at the rear pointer into
  108. the one at the front pointer. Then both pointers are advanced to the next
  109. location cyclically in the table. The value returned is the sum generated,
  110. reduced to 31 bits by throwing away the "least random" low bit.
  111. Note: The code takes advantage of the fact that both the front and
  112. rear pointers can't wrap on the same call by not testing the rear
  113. pointer if the front one has wrapped. Returns a 31-bit random number. */
  114. int attribute_hidden __random_r(struct random_data *buf, int32_t *result)
  115. {
  116. int32_t *state;
  117. if (buf == NULL || result == NULL)
  118. goto fail;
  119. state = buf->state;
  120. if (buf->rand_type == TYPE_0)
  121. {
  122. int32_t val = state[0];
  123. val = ((state[0] * 1103515245) + 12345) & 0x7fffffff;
  124. state[0] = val;
  125. *result = val;
  126. }
  127. else
  128. {
  129. int32_t *fptr = buf->fptr;
  130. int32_t *rptr = buf->rptr;
  131. int32_t *end_ptr = buf->end_ptr;
  132. int32_t val;
  133. val = *fptr += *rptr;
  134. /* Chucking least random bit. */
  135. *result = (val >> 1) & 0x7fffffff;
  136. ++fptr;
  137. if (fptr >= end_ptr)
  138. {
  139. fptr = state;
  140. ++rptr;
  141. }
  142. else
  143. {
  144. ++rptr;
  145. if (rptr >= end_ptr)
  146. rptr = state;
  147. }
  148. buf->fptr = fptr;
  149. buf->rptr = rptr;
  150. }
  151. return 0;
  152. fail:
  153. __set_errno (EINVAL);
  154. return -1;
  155. }
  156. strong_alias(__random_r,random_r)
  157. /* Initialize the random number generator based on the given seed. If the
  158. type is the trivial no-state-information type, just remember the seed.
  159. Otherwise, initializes state[] based on the given "seed" via a linear
  160. congruential generator. Then, the pointers are set to known locations
  161. that are exactly rand_sep places apart. Lastly, it cycles the state
  162. information a given number of times to get rid of any initial dependencies
  163. introduced by the L.C.R.N.G. Note that the initialization of randtbl[]
  164. for default usage relies on values produced by this routine. */
  165. int attribute_hidden __srandom_r (unsigned int seed, struct random_data *buf)
  166. {
  167. int type;
  168. int32_t *state;
  169. long int i;
  170. long int word;
  171. int32_t *dst;
  172. int kc;
  173. if (buf == NULL)
  174. goto fail;
  175. type = buf->rand_type;
  176. if ((unsigned int) type >= MAX_TYPES)
  177. goto fail;
  178. state = buf->state;
  179. /* We must make sure the seed is not 0. Take arbitrarily 1 in this case. */
  180. if (seed == 0)
  181. seed = 1;
  182. state[0] = seed;
  183. if (type == TYPE_0)
  184. goto done;
  185. dst = state;
  186. word = seed;
  187. kc = buf->rand_deg;
  188. for (i = 1; i < kc; ++i)
  189. {
  190. /* This does:
  191. state[i] = (16807 * state[i - 1]) % 2147483647;
  192. but avoids overflowing 31 bits. */
  193. long int hi = word / 127773;
  194. long int lo = word % 127773;
  195. word = 16807 * lo - 2836 * hi;
  196. if (word < 0)
  197. word += 2147483647;
  198. *++dst = word;
  199. }
  200. buf->fptr = &state[buf->rand_sep];
  201. buf->rptr = &state[0];
  202. kc *= 10;
  203. while (--kc >= 0)
  204. {
  205. int32_t discard;
  206. (void) __random_r (buf, &discard);
  207. }
  208. done:
  209. return 0;
  210. fail:
  211. return -1;
  212. }
  213. strong_alias(__srandom_r,srandom_r)
  214. /* Initialize the state information in the given array of N bytes for
  215. future random number generation. Based on the number of bytes we
  216. are given, and the break values for the different R.N.G.'s, we choose
  217. the best (largest) one we can and set things up for it. srandom is
  218. then called to initialize the state information. Note that on return
  219. from srandom, we set state[-1] to be the type multiplexed with the current
  220. value of the rear pointer; this is so successive calls to initstate won't
  221. lose this information and will be able to restart with setstate.
  222. Note: The first thing we do is save the current state, if any, just like
  223. setstate so that it doesn't matter when initstate is called.
  224. Returns a pointer to the old state. */
  225. int attribute_hidden __initstate_r (unsigned int seed, char *arg_state, size_t n, struct random_data *buf)
  226. {
  227. int type;
  228. int degree;
  229. int separation;
  230. int32_t *state;
  231. if (buf == NULL)
  232. goto fail;
  233. if (n >= BREAK_3)
  234. type = n < BREAK_4 ? TYPE_3 : TYPE_4;
  235. else if (n < BREAK_1)
  236. {
  237. if (n < BREAK_0)
  238. {
  239. __set_errno (EINVAL);
  240. goto fail;
  241. }
  242. type = TYPE_0;
  243. }
  244. else
  245. type = n < BREAK_2 ? TYPE_1 : TYPE_2;
  246. degree = random_poly_info.degrees[type];
  247. separation = random_poly_info.seps[type];
  248. buf->rand_type = type;
  249. buf->rand_sep = separation;
  250. buf->rand_deg = degree;
  251. state = &((int32_t *) arg_state)[1]; /* First location. */
  252. /* Must set END_PTR before srandom. */
  253. buf->end_ptr = &state[degree];
  254. buf->state = state;
  255. __srandom_r (seed, buf);
  256. state[-1] = TYPE_0;
  257. if (type != TYPE_0)
  258. state[-1] = (buf->rptr - state) * MAX_TYPES + type;
  259. return 0;
  260. fail:
  261. __set_errno (EINVAL);
  262. return -1;
  263. }
  264. strong_alias(__initstate_r,initstate_r)
  265. /* Restore the state from the given state array.
  266. Note: It is important that we also remember the locations of the pointers
  267. in the current state information, and restore the locations of the pointers
  268. from the old state information. This is done by multiplexing the pointer
  269. location into the zeroth word of the state information. Note that due
  270. to the order in which things are done, it is OK to call setstate with the
  271. same state as the current state
  272. Returns a pointer to the old state information. */
  273. int attribute_hidden __setstate_r (char *arg_state, struct random_data *buf)
  274. {
  275. int32_t *new_state = 1 + (int32_t *) arg_state;
  276. int type;
  277. int old_type;
  278. int32_t *old_state;
  279. int degree;
  280. int separation;
  281. if (arg_state == NULL || buf == NULL)
  282. goto fail;
  283. old_type = buf->rand_type;
  284. old_state = buf->state;
  285. if (old_type == TYPE_0)
  286. old_state[-1] = TYPE_0;
  287. else
  288. old_state[-1] = (MAX_TYPES * (buf->rptr - old_state)) + old_type;
  289. type = new_state[-1] % MAX_TYPES;
  290. if (type < TYPE_0 || type > TYPE_4)
  291. goto fail;
  292. buf->rand_deg = degree = random_poly_info.degrees[type];
  293. buf->rand_sep = separation = random_poly_info.seps[type];
  294. buf->rand_type = type;
  295. if (type != TYPE_0)
  296. {
  297. int rear = new_state[-1] / MAX_TYPES;
  298. buf->rptr = &new_state[rear];
  299. buf->fptr = &new_state[(rear + separation) % degree];
  300. }
  301. buf->state = new_state;
  302. /* Set end_ptr too. */
  303. buf->end_ptr = &new_state[degree];
  304. return 0;
  305. fail:
  306. __set_errno (EINVAL);
  307. return -1;
  308. }
  309. strong_alias(__setstate_r,setstate_r)