mirror of
https://github.com/isc-projects/bind9.git
synced 2026-02-26 11:32:01 -05:00
Replace the ISC_LIST based deadnodes implementation with isc_queue which is wait-free and we don't have to acquire neither the tree nor node lock to append nodes to the queue and the cleaning process can also copy (splice) the list into a local copy without acquiring the list. Currently, there's little benefit to this as we need to hold those locks anyway, but in the future as we move to RCU based implementation, this will be ready. To align the cleaning with our event loop based model, remove the hardcoded count for the node locks and use the number of the event loops instead. This way, each event loop can have its own cleaning as part of the process. Use uniform random numbers to spread the nodes evenly between the buckets (instead of hashing the domain name). |
||
|---|---|---|
| .. | ||
| dns | ||
| isc | ||
| isccc | ||
| isccfg | ||
| ns | ||
| .gitignore | ||
| Makefile.am | ||