-
Notifications
You must be signed in to change notification settings - Fork 30k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Remove micro-optimizations that no longer yield any benefits, restructure timers & immediates to be a bit more straightforward. Adjust timers benchmarks to run long enough to offer meaningful data. PR-URL: #17279 Reviewed-By: James M Snell <[email protected]> Reviewed-By: Refael Ackermann <[email protected]> Reviewed-By: Timothy Gu <[email protected]>
- Loading branch information
1 parent
0db1f87
commit bd79c37
Showing
10 changed files
with
148 additions
and
174 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,23 +1,35 @@ | ||
'use strict'; | ||
const common = require('../common.js'); | ||
|
||
// The following benchmark measures setting up n * 1e6 timeouts, | ||
// which then get executed on the next uv tick | ||
|
||
const bench = common.createBenchmark(main, { | ||
thousands: [500], | ||
millions: [10], | ||
}); | ||
|
||
function main(conf) { | ||
const iterations = +conf.thousands * 1e3; | ||
var count = 0; | ||
const iterations = +conf.millions * 1e6; | ||
let count = 0; | ||
|
||
for (var i = 0; i < iterations; i++) { | ||
setTimeout(cb, 1); | ||
} | ||
|
||
bench.start(); | ||
// Function tracking on the hidden class in V8 can cause misleading | ||
// results in this benchmark if only a single function is used — | ||
// alternate between two functions for a fairer benchmark | ||
|
||
function cb() { | ||
count++; | ||
if (count === iterations) | ||
bench.end(iterations / 1e3); | ||
bench.end(iterations / 1e6); | ||
} | ||
function cb2() { | ||
count++; | ||
if (count === iterations) | ||
bench.end(iterations / 1e6); | ||
} | ||
|
||
for (var i = 0; i < iterations; i++) { | ||
setTimeout(i % 2 ? cb : cb2, 1); | ||
} | ||
|
||
bench.start(); | ||
} |
Oops, something went wrong.