| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
calls to libc's arc4random. Minus about 3k lines.
prodding deraadt@
|
| | |
|
| |
|
|
|
|
|
|
|
| |
We only use this tree to build dig and nslookup. Our previous version
predated edns0 support in those tools, and we want that. This is the worst
code I've looked at in years, with layers and layers of spaghetti abstraction
clearly unfit for reuse, but then reused anyways, and the old ones remain
behind. So this is a 8MB diff.
florian, sthen, and otto tried this merge before but failed.
|
| |
|
|
| |
stupid seed that bind has decided on..
|
| |
|
|
|
|
| |
Jinmei_Tatuya AT isc.org via jakob@
empirically verified for entire domain of upper_bound
|
| |
|
|
|
|
|
| |
(2^30,2^31). Nothing in the tree yet requests random numbers bounded
by this range.
report jakob!deraadt; ok deraadt@
|
| |
|
|
|
|
|
| |
number 0 < x <= upper_bound and use it to correct the last tiny bias in the
shuffle initialisation
feedback & ok deraadt@
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|