-
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.
PR-URL: #49990 Reviewed-By: Matteo Collina <[email protected]> Reviewed-By: Yagiz Nizipli <[email protected]> Reviewed-By: James M Snell <[email protected]>
- Loading branch information
Showing
41 changed files
with
978 additions
and
566 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,62 @@ | ||
'use strict'; | ||
|
||
const common = require('../common.js'); | ||
const assert = require('assert'); | ||
|
||
const bench = common.createBenchmark(main, { | ||
type: [ | ||
'hide-stackframes', | ||
'direct-call', | ||
], | ||
n: [1e7], | ||
}, { | ||
flags: ['--expose-internals'], | ||
}); | ||
|
||
function main({ n, type }) { | ||
const { | ||
hideStackFrames, | ||
codes: { | ||
ERR_INVALID_ARG_TYPE, | ||
}, | ||
} = require('internal/errors'); | ||
|
||
const testfn = (value) => { | ||
if (typeof value !== 'number') { | ||
throw new ERR_INVALID_ARG_TYPE('Benchmark', 'number', value); | ||
} | ||
}; | ||
|
||
const hideStackFramesTestfn = hideStackFrames((value) => { | ||
if (typeof value !== 'number') { | ||
throw new ERR_INVALID_ARG_TYPE.HideStackFrameError('Benchmark', 'number', value); | ||
} | ||
}); | ||
|
||
const fn = type === 'hide-stackframe' ? hideStackFramesTestfn : testfn; | ||
|
||
const value = 42; | ||
|
||
const length = 1024; | ||
const array = []; | ||
const errCase = false; | ||
|
||
for (let i = 0; i < length; ++i) { | ||
array.push(fn(value)); | ||
} | ||
|
||
bench.start(); | ||
|
||
for (let i = 0; i < n; i++) { | ||
const index = i % length; | ||
array[index] = fn(value); | ||
} | ||
|
||
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], errCase ? 'object' : 'undefined'); | ||
} | ||
} |
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,87 @@ | ||
'use strict'; | ||
|
||
const common = require('../common.js'); | ||
const assert = require('assert'); | ||
|
||
const bench = common.createBenchmark(main, { | ||
type: [ | ||
'hide-stackframes', | ||
'direct-call', | ||
], | ||
double: ['true', 'false'], | ||
n: [1e5], | ||
}, { | ||
flags: ['--expose-internals'], | ||
}); | ||
|
||
function main({ n, type, double }) { | ||
const { | ||
hideStackFrames, | ||
codes: { | ||
ERR_INVALID_ARG_TYPE, | ||
}, | ||
} = require('internal/errors'); | ||
|
||
const value = 'err'; | ||
|
||
const testfn = (value) => { | ||
if (typeof value !== 'number') { | ||
throw new ERR_INVALID_ARG_TYPE('Benchmark', 'number', value); | ||
} | ||
}; | ||
|
||
const hideStackFramesTestfn = hideStackFrames((value) => { | ||
if (typeof value !== 'number') { | ||
throw new ERR_INVALID_ARG_TYPE.HideStackFrameError('Benchmark', 'number', value); | ||
} | ||
}); | ||
|
||
function doubleTestfn(value) { | ||
testfn(value); | ||
} | ||
|
||
const doubleHideStackFramesTestfn = hideStackFrames((value) => { | ||
hideStackFramesTestfn.withoutStackTrace(value); | ||
}); | ||
|
||
const fn = type === 'hide-stackframe' ? | ||
double === 'true' ? | ||
doubleHideStackFramesTestfn : | ||
hideStackFramesTestfn : | ||
double === 'true' ? | ||
doubleTestfn : | ||
testfn; | ||
|
||
const length = 1024; | ||
const array = []; | ||
let errCase = false; | ||
|
||
// Warm up. | ||
for (let i = 0; i < length; ++i) { | ||
try { | ||
fn(value); | ||
} catch (e) { | ||
errCase = true; | ||
array.push(e); | ||
} | ||
} | ||
|
||
bench.start(); | ||
|
||
for (let i = 0; i < n; i++) { | ||
const index = i % length; | ||
try { | ||
fn(value); | ||
} catch (e) { | ||
array[index] = e; | ||
} | ||
} | ||
|
||
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], errCase ? 'object' : 'undefined'); | ||
} | ||
} |
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
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
Oops, something went wrong.