-
Notifications
You must be signed in to change notification settings - Fork 30.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
42 changed files
with
731 additions
and
339 deletions.
There are no files selected for viewing
File renamed without changes.
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 |
---|---|---|
@@ -0,0 +1,66 @@ | ||
'use strict'; | ||
|
||
const common = require('../common'); | ||
const assert = require('assert'); | ||
|
||
const bench = common.createBenchmark(main, { | ||
n: [1e6], | ||
code: [ | ||
'built-in', | ||
'ERR_HTTP2_STREAM_SELF_DEPENDENCY', | ||
'ERR_INVALID_STATE', | ||
'ERR_INVALID_URL', | ||
], | ||
stackTraceLimit: [0, 10], | ||
}, { | ||
flags: ['--expose-internals'], | ||
}); | ||
|
||
function getErrorFactory(code) { | ||
const { | ||
ERR_HTTP2_STREAM_SELF_DEPENDENCY, | ||
ERR_INVALID_STATE, | ||
ERR_INVALID_URL, | ||
} = require('internal/errors').codes; | ||
|
||
switch (code) { | ||
case 'built-in': | ||
return (n) => new Error(); | ||
case 'ERR_HTTP2_STREAM_SELF_DEPENDENCY': | ||
return (n) => new ERR_HTTP2_STREAM_SELF_DEPENDENCY(); | ||
case 'ERR_INVALID_STATE': | ||
return (n) => new ERR_INVALID_STATE(n + ''); | ||
case 'ERR_INVALID_URL': | ||
return (n) => new ERR_INVALID_URL({ input: n + '' }); | ||
default: | ||
throw new Error(`${code} not supported`); | ||
} | ||
} | ||
|
||
function main({ n, code, stackTraceLimit }) { | ||
const getError = getErrorFactory(code); | ||
|
||
Error.stackTraceLimit = stackTraceLimit; | ||
|
||
// Warm up. | ||
const length = 1024; | ||
const array = []; | ||
for (let i = 0; i < length; ++i) { | ||
array.push(getError(i)); | ||
} | ||
|
||
bench.start(); | ||
|
||
for (let i = 0; i < n; ++i) { | ||
const index = i % length; | ||
array[index] = getError(index); | ||
} | ||
|
||
bench.end(n); | ||
|
||
// Verify the entries to prevent dead code elimination from making | ||
// the benchmark invalid. | ||
for (let i = 0; i < length; ++i) { | ||
assert.strictEqual(typeof array[i], 'object'); | ||
} | ||
} |
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 |
---|---|---|
@@ -0,0 +1,62 @@ | ||
'use strict'; | ||
|
||
const common = require('../common'); | ||
const assert = require('assert'); | ||
|
||
const bench = common.createBenchmark(main, { | ||
n: [1e6], | ||
code: [ | ||
'built-in', | ||
'ERR_HTTP2_STREAM_SELF_DEPENDENCY', | ||
'ERR_INVALID_STATE', | ||
], | ||
stackTraceLimit: [0, 10], | ||
}, { | ||
flags: ['--expose-internals'], | ||
}); | ||
|
||
function getErrorStackFactory(code) { | ||
const { | ||
ERR_INVALID_STATE, | ||
ERR_HTTP2_STREAM_SELF_DEPENDENCY, | ||
} = require('internal/errors').codes; | ||
|
||
switch (code) { | ||
case 'built-in': | ||
return (n) => new Error().stack; | ||
case 'ERR_HTTP2_STREAM_SELF_DEPENDENCY': | ||
return (n) => new ERR_HTTP2_STREAM_SELF_DEPENDENCY().stack; | ||
case 'ERR_INVALID_STATE': | ||
return (n) => new ERR_INVALID_STATE(n + '').stack; | ||
default: | ||
throw new Error(`${code} not supported`); | ||
} | ||
} | ||
|
||
function main({ n, code, stackTraceLimit }) { | ||
const getStack = getErrorStackFactory(code); | ||
|
||
Error.stackTraceLimit = stackTraceLimit; | ||
|
||
// Warm up. | ||
const length = 1024; | ||
const array = []; | ||
for (let i = 0; i < length; ++i) { | ||
array.push(getStack(i)); | ||
} | ||
|
||
bench.start(); | ||
|
||
for (let i = 0; i < n; ++i) { | ||
const index = i % length; | ||
array[index] = getStack(index); | ||
} | ||
|
||
bench.end(n); | ||
|
||
// Verify the entries to prevent dead code elimination from making | ||
// the benchmark invalid. | ||
for (let i = 0; i < length; ++i) { | ||
assert.strictEqual(typeof array[i], 'string'); | ||
} | ||
} |
This file was deleted.
Oops, something went wrong.
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 |
---|---|---|
@@ -0,0 +1,43 @@ | ||
'use strict'; | ||
|
||
const common = require('../common'); | ||
const fs = require('fs'); | ||
const tmpdir = require('../../test/common/tmpdir'); | ||
tmpdir.refresh(); | ||
|
||
const bench = common.createBenchmark(main, { | ||
type: ['existing', 'non-existing'], | ||
n: [1e3], | ||
}); | ||
|
||
function main({ n, type }) { | ||
let files; | ||
|
||
switch (type) { | ||
case 'existing': | ||
files = []; | ||
|
||
// Populate tmpdir with mock files | ||
for (let i = 0; i < n; i++) { | ||
const path = tmpdir.resolve(`unlinksync-bench-file-${i}`); | ||
fs.writeFileSync(path, 'bench'); | ||
files.push(path); | ||
} | ||
break; | ||
case 'non-existing': | ||
files = new Array(n).fill(tmpdir.resolve(`.non-existing-file-${Date.now()}`)); | ||
break; | ||
default: | ||
new Error('Invalid type'); | ||
} | ||
|
||
bench.start(); | ||
for (let i = 0; i < n; i++) { | ||
try { | ||
fs.unlinkSync(files[i]); | ||
} catch { | ||
// do nothing | ||
} | ||
} | ||
bench.end(n); | ||
} |
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 |
---|---|---|
@@ -0,0 +1,36 @@ | ||
'use strict'; | ||
|
||
const assert = require('assert'); | ||
const common = require('../common.js'); | ||
|
||
const { | ||
PerformanceObserver, | ||
performance, | ||
} = require('perf_hooks'); | ||
|
||
function randomFn() { | ||
return Math.random(); | ||
} | ||
|
||
const bench = common.createBenchmark(main, { | ||
n: [1e5], | ||
observe: ['function'], | ||
}); | ||
|
||
let _result; | ||
|
||
function main({ n, observe }) { | ||
const obs = new PerformanceObserver(() => { | ||
bench.end(n); | ||
}); | ||
obs.observe({ entryTypes: [observe], buffered: true }); | ||
|
||
const timerfied = performance.timerify(randomFn); | ||
|
||
bench.start(); | ||
for (let i = 0; i < n; i++) | ||
_result = timerfied(); | ||
|
||
// Avoid V8 deadcode (elimination) | ||
assert.ok(_result); | ||
} |
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 |
---|---|---|
@@ -0,0 +1,23 @@ | ||
'use strict'; | ||
const common = require('../common.js'); | ||
const url = require('url'); | ||
const URL = url.URL; | ||
|
||
const bench = common.createBenchmark(main, { | ||
type: ['valid', 'invalid'], | ||
e: [1e5], | ||
}); | ||
|
||
// This benchmark is used to compare the `Invalid URL` path of the URL parser | ||
function main({ type, e }) { | ||
const url = type === 'valid' ? 'https://www.nodejs.org' : 'www.nodejs.org'; | ||
bench.start(); | ||
for (let i = 0; i < e; i++) { | ||
try { | ||
new URL(url); | ||
} catch { | ||
// do nothing | ||
} | ||
} | ||
bench.end(e); | ||
} |
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
Oops, something went wrong.