| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
after srand(1)
|
|
|
|
|
|
|
| |
to remove part of seed -> 1st value correlation. Correlation still remains
because of algorithm limits. Note that old algorithm have even stronger
correlation, especially in the lower bits area, but not eye-visible, as
current one.
|
|
|
|
|
|
|
| |
at 0 as designed. Its BSD adaptation tries to fight it by mapping 0 to
2147483647 after calculation, but this method not works since 2147483647
seed returns to 0 again on the next interation. Instead of after calculation
mapping, map 0 to another value _before_ calculation, so it never stucks.
|
|
|
|
| |
may store less amount bits for seed, than available. Fix it.
|
| |
|
|
|
|
| |
I believe have made all of libc .c's as consistent as possible.
|
|
|
|
|
| |
by asking some things that need unpredictable numbers to read
/dev/random instead.
|
|
|
|
|
|
|
| |
PR: 27858
Submitted by: Yoshihiro Koya <Yoshihiro.Koya@math.yokohama-cu.ac.jp>
Reviewed by: md5(1)
Approved by: markm
|
| |
|
|
|
|
| |
change of high word part too to produce more interesting seed distribution.
|
| |
|
|
|
|
|
|
| |
Even better formula from random() could not be intetgrated because rand_r()
supposed to store its state in the single variable (but table needed for
random() algorithm integration).
|
| |
|
|
|