d36276d85e
In the random sync algorithm used by the DNS node iterator, we first pick a random tree and then perform one sync action on that tree. This happens in a loop until any node is found. If no trees contain any nodes, the iterator will enter a hot loop spinning at 100% CPU. The fix is complicated. The iterator now checks if a meaningful sync action can be performed on any tree. If there is nothing to do, it waits for the next root record recheck time to arrive and then tries again. Fixes #22306 |
||
|---|---|---|
| .. | ||
| client.go | ||
| client_test.go | ||
| doc.go | ||
| error.go | ||
| sync.go | ||
| sync_test.go | ||
| tree.go | ||
| tree_test.go | ||