Routing keeps its structural tables between calls and runs its hot loops as small functions, identical results
compute() was one 33 KB function that V8 never kept optimised: it ran in baseline code, boxing every number, and was recompiled in the background (about a second of compile each time on a loaded machine) only to deopt. Its stages now run as closures of their own (compute's own bytecode: 7.7 KB) and the money is computeMoney(). The shortest paths and the exit lists (okBy, reach, BRJ/LIST, DSEL) are kept between calls under keys built from everything they depend on (29-route-cache.js). Exits and paths have one object shape each. The equivalence tests compare cached against uncached routing; tests/route-cache.test.js checks the keys.
This commit is contained in:
parent
935c08839f
commit
a428ed817f
6 changed files with 209 additions and 44 deletions
|
|
@ -26,7 +26,10 @@ function network(ev) {
|
|||
const start = source.indexOf(' for(const pass of PASSES)for(const rank of RANKS){');
|
||||
const end = source.indexOf(' for(const i of NORD)', start);
|
||||
assert.ok(start >= 0 && end > start, 'allocation loop boundaries must exist');
|
||||
ev(`window.referenceCompute=eval('('+${JSON.stringify(source.slice(0,start)+referenceAllocation+source.slice(end))}+')')`);
|
||||
// The reference also builds every table afresh, so the comparison covers what routing keeps between calls.
|
||||
assert.ok(source.includes('RCON=RC.on'), 'compute() can be told not to keep its tables');
|
||||
const ref = (source.slice(0,start)+referenceAllocation+source.slice(end)).replace('RCON=RC.on', 'RCON=false');
|
||||
ev(`window.referenceCompute=eval('('+${JSON.stringify(ref)}+')')`);
|
||||
}
|
||||
|
||||
test('indexed routing matches the simple allocation loop across network changes', () => {
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue