mirror of
https://github.com/nodejs/node.git
synced 2025-08-15 13:48:44 +02:00
benchmark: add benchmark for NODE_V8_COVERAGE
PR-URL: https://github.com/nodejs/node/pull/36972 Reviewed-By: Rich Trott <rtrott@gmail.com> Reviewed-By: Benjamin Gruenbaum <benjamingr@gmail.com> Reviewed-By: James M Snell <jasnell@gmail.com> Reviewed-By: Joyee Cheung <joyeec9h3@gmail.com> Reviewed-By: Richard Lau <rlau@redhat.com>
This commit is contained in:
parent
0aaa804f43
commit
8c9dc4e9e6
2 changed files with 147 additions and 0 deletions
115
benchmark/fixtures/coverage-many-branches.js
Normal file
115
benchmark/fixtures/coverage-many-branches.js
Normal file
|
@ -0,0 +1,115 @@
|
|||
'use strict';
|
||||
|
||||
// Exercise coverage of a class. Note, this logic is silly and exists solely
|
||||
// to generate branch coverage code paths:
|
||||
class CoveredClass {
|
||||
constructor(x, y, opts) {
|
||||
this.x = x;
|
||||
this.y = y;
|
||||
// Exercise coverage of nullish coalescing:
|
||||
this.opts = opts ?? (Math.random() > 0.5 ? {} : undefined);
|
||||
}
|
||||
add() {
|
||||
return this.x + this.y;
|
||||
}
|
||||
addSpecial() {
|
||||
// Exercise coverage of optional chains:
|
||||
if (this.opts?.special && this.opts?.special?.x && this.opts?.special?.y) {
|
||||
return this.opts.special.x + this.opts.special.y;
|
||||
}
|
||||
return add();
|
||||
}
|
||||
mult() {
|
||||
return this.x * this.y;
|
||||
}
|
||||
multSpecial() {
|
||||
if (this.opts?.special && this.opts?.special?.x && this.opts?.special?.y) {
|
||||
return this.opts.special.x * this.opts.special.y;
|
||||
}
|
||||
return mult();
|
||||
}
|
||||
}
|
||||
|
||||
// Excercise coverage of functions:
|
||||
function add(x, y) {
|
||||
const mt = new CoveredClass(x, y);
|
||||
return mt.add();
|
||||
}
|
||||
|
||||
function addSpecial(x, y) {
|
||||
let mt;
|
||||
if (Math.random() > 0.5) {
|
||||
mt = new CoveredClass(x, y);
|
||||
} else {
|
||||
mt = new CoveredClass(x, y, {
|
||||
special: {
|
||||
x: Math.random() * x,
|
||||
y: Math.random() * y
|
||||
}
|
||||
});
|
||||
}
|
||||
return mt.addSpecial();
|
||||
}
|
||||
|
||||
function mult(x, y) {
|
||||
const mt = new CoveredClass(x, y);
|
||||
return mt.mult();
|
||||
}
|
||||
|
||||
function multSpecial(x, y) {
|
||||
let mt;
|
||||
if (Math.random() > 0.5) {
|
||||
mt = new CoveredClass(x, y);
|
||||
} else {
|
||||
mt = new CoveredClass(x, y, {
|
||||
special: {
|
||||
x: Math.random() * x,
|
||||
y: Math.random() * y
|
||||
}
|
||||
});
|
||||
}
|
||||
return mt.multSpecial();
|
||||
}
|
||||
|
||||
for (let i = 0; i < parseInt(process.env.N); i++) {
|
||||
const operations = ['add', 'addSpecial', 'mult', 'multSpecial'];
|
||||
for (const operation of operations) {
|
||||
// Exercise coverage of switch statements:
|
||||
switch (operation) {
|
||||
case 'add':
|
||||
if (add(Math.random() * 10, Math.random() * 10) > 10) {
|
||||
// Exercise coverage of ternary operations:
|
||||
let r = addSpecial(Math.random() * 10, Math.random() * 10) > 10 ?
|
||||
mult(Math.random() * 10, Math.random() * 10) :
|
||||
add(Math.random() * 10, Math.random() * 10);
|
||||
// Exercise && and ||
|
||||
if (r && Math.random() > 0.5 || Math.random() < 0.5) r++;
|
||||
}
|
||||
break;
|
||||
case 'addSpecial':
|
||||
if (addSpecial(Math.random() * 10, Math.random() * 10) > 10 &&
|
||||
add(Math.random() * 10, Math.random() * 10) > 10) {
|
||||
let r = mult(Math.random() * 10, Math.random() * 10) > 10 ?
|
||||
add(Math.random() * 10, Math.random() * 10) > 10 :
|
||||
mult(Math.random() * 10, Math.random() * 10);
|
||||
if (r && Math.random() > 0.5 || Math.random() < 0.5) r++;
|
||||
}
|
||||
break;
|
||||
case 'mult':
|
||||
if (mult(Math.random() * 10, Math.random() * 10) > 10) {
|
||||
let r = multSpecial(Math.random() * 10, Math.random() * 10) > 10 ?
|
||||
add(Math.random() * 10, Math.random() * 10) :
|
||||
mult(Math.random() * 10, Math.random() * 10);
|
||||
if (r && Math.random() > 0.5 || Math.random() < 0.5) r++;
|
||||
}
|
||||
break;
|
||||
case 'multSpecial':
|
||||
while (multSpecial(Math.random() * 10, Math.random() * 10) < 10) {
|
||||
mult(Math.random() * 10, Math.random() * 10);
|
||||
}
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
32
benchmark/process/coverage.js
Normal file
32
benchmark/process/coverage.js
Normal file
|
@ -0,0 +1,32 @@
|
|||
// This benchmark is meant to exercise a grab bag of code paths that would
|
||||
// be expected to run slower under coverage.
|
||||
'use strict';
|
||||
|
||||
const common = require('../common.js');
|
||||
const bench = common.createBenchmark(main, {
|
||||
n: [1e5]
|
||||
});
|
||||
const path = require('path');
|
||||
const { rmSync } = require('fs');
|
||||
const { spawnSync } = require('child_process');
|
||||
const tmpdir = require('../../test/common/tmpdir');
|
||||
|
||||
const coverageDir = path.join(tmpdir.path, `./cov-${Date.now()}`);
|
||||
|
||||
function main({ n }) {
|
||||
bench.start();
|
||||
const result = spawnSync(process.execPath, [
|
||||
require.resolve('../fixtures/coverage-many-branches'),
|
||||
], {
|
||||
env: {
|
||||
NODE_V8_COVERAGE: coverageDir,
|
||||
N: n,
|
||||
...process.env
|
||||
}
|
||||
});
|
||||
bench.end(n);
|
||||
rmSync(coverageDir, { recursive: true, force: true });
|
||||
if (result.status !== 0) {
|
||||
throw new Error(result.stderr.toString('utf8'));
|
||||
}
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue