Tony Finch d20ea4a703 Make isc_random_uniform() nearly divisionless ... It used to require two 32-bit integer divisions to get a random number less than some limit. Now we use Daniel Lemire's "nearly-divisionless" algorithm for unbiased bounded random numbers, which requires one 64-bit integer multiply in the usual case, and one 32-bit integer division in rare slow cases. Even the slow cases are faster than before; there are also fewer branches. I think this algorithm is exceptionally beautiful. It also has more clever tricks than lines of code, so I have done my best to explain how it works.		2022-04-22 16:40:37 +01:00
..
bind9	More explicit dns64 prefix errors	2022-03-25 10:59:15 +01:00
dns	Allow attaching to dns_adb which is shutting down	2022-04-22 16:48:37 +02:00
irs	Update the copyright information in all files in the repository	2022-01-11 09:05:02 +01:00
isc	Make isc_random_uniform() nearly divisionless	2022-04-22 16:40:37 +01:00
isccc	Keep the list of scheduled events on the timer	2022-04-01 23:45:23 +02:00
isccfg	Rename the configuration option to load balance sockets to reuseport	2022-04-06 17:03:57 +02:00
ns	Fix loading plugins using just their filenames	2022-04-22 13:27:12 +02:00
.gitignore	The isc/platform.h header has been completely removed	2021-07-06 05:33:48 +00:00
Makefile.am	move samples/resolve.c to bin/tests/system	2021-04-16 14:29:43 +02:00
unit-test-driver.sh.in	Update the copyright information in all files in the repository	2022-01-11 09:05:02 +01:00