This is a trick to get much better scheduling and timing guesses. Instead of targeting a specific level, rather a fixed number of nodes is processed in each chunk, yet still always processing complete levels. The final level number to expect can be retrieved from the chain-load graph. With this refactoring, we can now schedule a wake-up job precisely after the expected completion of the last level |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| common.hpp | ||
| DIR_INFO | ||
| enginefacade.cpp | ||
| enginefacade.hpp | ||
| media-access-facade.cpp | ||
| media-access-facade.hpp | ||
| netnodefacade.cpp | ||
| netnodefacade.hpp | ||
| real-clock.cpp | ||
| real-clock.hpp | ||
| scriptrunnerfacade.cpp | ||
| scriptrunnerfacade.hpp | ||