mirror of
https://github.com/nodejs/node.git
synced 2025-05-11 19:50:13 +00:00

Currently the buffer benchmarks take significantly too long to complete. This drastically reduces the overall runtime by removing obsolete checked variations and reducing the iteration count. It also improves the benchmarks by removing the deprecated `new Buffer(size)` usage and some other small improvements. PR-URL: https://github.com/nodejs/node/pull/26418 Reviewed-By: Matteo Collina <matteo.collina@gmail.com> Reviewed-By: Gireesh Punathil <gpunathi@in.ibm.com> Reviewed-By: Peter Marshall <petermarshall@chromium.org> Reviewed-By: Franziska Hinkelmann <franziska.hinkelmann@gmail.com> Reviewed-By: Anatoli Papirovski <apapirovski@mac.com> Reviewed-By: Rich Trott <rtrott@gmail.com>
61 lines
1.2 KiB
JavaScript
61 lines
1.2 KiB
JavaScript
'use strict';
|
|
const common = require('../common.js');
|
|
|
|
const bench = common.createBenchmark(main, {
|
|
size: [16, 512, 4096, 16386],
|
|
args: [1, 2, 5],
|
|
n: [1e6]
|
|
});
|
|
|
|
function main({ n, size, args }) {
|
|
const b0 = Buffer.alloc(size, 'a');
|
|
const b1 = Buffer.alloc(size, 'a');
|
|
const b0Len = b0.length;
|
|
const b1Len = b1.length;
|
|
var i;
|
|
|
|
b1[size - 1] = 'b'.charCodeAt(0);
|
|
|
|
switch (args) {
|
|
case 2:
|
|
b0.compare(b1, 0);
|
|
bench.start();
|
|
for (i = 0; i < n; i++) {
|
|
b0.compare(b1, 0);
|
|
}
|
|
bench.end(n);
|
|
break;
|
|
case 3:
|
|
b0.compare(b1, 0, b1Len);
|
|
bench.start();
|
|
for (i = 0; i < n; i++) {
|
|
b0.compare(b1, 0, b1Len);
|
|
}
|
|
bench.end(n);
|
|
break;
|
|
case 4:
|
|
b0.compare(b1, 0, b1Len, 0);
|
|
bench.start();
|
|
for (i = 0; i < n; i++) {
|
|
b0.compare(b1, 0, b1Len, 0);
|
|
}
|
|
bench.end(n);
|
|
break;
|
|
case 5:
|
|
b0.compare(b1, 0, b1Len, 0, b0Len);
|
|
bench.start();
|
|
for (i = 0; i < n; i++) {
|
|
b0.compare(b1, 0, b1Len, 0, b0Len);
|
|
}
|
|
bench.end(n);
|
|
break;
|
|
default:
|
|
b0.compare(b1);
|
|
bench.start();
|
|
for (i = 0; i < n; i++) {
|
|
b0.compare(b1);
|
|
}
|
|
bench.end(n);
|
|
}
|
|
}
|