6 this code uses the same lagged fibonacci generator as the
7 original bsd random implementation except for the seeding
8 which was broken in the original
11 static uint32_t init[] = {
12 0x00000000,0x5851f42d,0xc0b18ccf,0xcbb5f646,
13 0xc7033129,0x30705b04,0x20fd5db4,0x9a8b7f78,
14 0x502959d8,0xab894868,0x6c0356a7,0x88cdb7ff,
15 0xb477d43f,0x70a3a52b,0xa8e4baf1,0xfd8341fc,
16 0x8ae16fd9,0x742d2f7a,0x0d1f0796,0x76035e09,
17 0x40f7702c,0x6fa72ca5,0xaaa84157,0x58a0df74,
18 0xc74a0364,0xae533cc4,0x04185faf,0x6de3b115,
19 0x0cab8628,0xf043bfa4,0x398150e9,0x37521657};
24 static uint32_t *x = init+1;
25 static volatile int lock[2];
27 static uint32_t lcg31(uint32_t x) {
28 return (1103515245*x + 12345) & 0x7fffffff;
31 static uint64_t lcg64(uint64_t x) {
32 return 6364136223846793005ull*x + 1;
35 static void *savestate() {
36 x[-1] = (n<<16)|(i<<8)|j;
40 static void loadstate(uint32_t *state) {
47 static void __srandom(unsigned seed) {
55 i = n == 31 || n == 7 ? 3 : 1;
57 for (k = 0; k < n; k++) {
61 /* make sure x contains at least one odd number */
65 void srandom(unsigned seed) {
71 char *initstate(unsigned seed, char *state, size_t size) {
88 x = (uint32_t*)state + 1;
95 char *setstate(char *state) {
100 loadstate((uint32_t*)state);
110 k = x[0] = lcg31(x[0]);