summaryrefslogtreecommitdiffstats
path: root/lib/libpthread/thread/thr_rwlockattr.c
diff options
context:
space:
mode:
authorache <ache@FreeBSD.org>2003-02-17 03:52:35 +0000
committerache <ache@FreeBSD.org>2003-02-17 03:52:35 +0000
commit54d6accf9d69c94d02bb319d998640d79ee83250 (patch)
tree00af365d9446378d7e5847aa6f4d8a8eee4791d1 /lib/libpthread/thread/thr_rwlockattr.c
parenteadbecd88b3b77b4c6e00192f699b8048748ae57 (diff)
downloadFreeBSD-src-54d6accf9d69c94d02bb319d998640d79ee83250.zip
FreeBSD-src-54d6accf9d69c94d02bb319d998640d79ee83250.tar.gz
Back out "drop first N values" method of removing monotonically increased
seed->first value correlation. It breaks rand_r()... Other possible methods like shuffling inside aray will breaks rand_r() too, because it assumes only one word state, i.e. nothing extra can be added after seed assignment in srand(). BTW, for old formulae seed->first value correlation is not so monotonically increased as with other Linear Congruential Generators of this type only becase arithmetic overflow happens. But overflow affects distribution and lower bits very badly, as many articles says, such type of overflow not improves PRNG. So, monotonically increased seed->first value correlation problem remains...
Diffstat (limited to 'lib/libpthread/thread/thr_rwlockattr.c')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud