mirror of
https://github.com/nodejs/node.git
synced 2025-05-15 14:12:28 +00:00
7b802685c4
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>
124 lines
2.2 KiB
JavaScript
124 lines
2.2 KiB
JavaScript
'use strict';
|
|
const common = require('../common.js');
|
|
|
|
const types = [
|
|
'BigUInt64LE',
|
|
'BigUInt64BE',
|
|
'BigInt64LE',
|
|
'BigInt64BE',
|
|
'UInt8',
|
|
'UInt16LE',
|
|
'UInt16BE',
|
|
'UInt32LE',
|
|
'UInt32BE',
|
|
'UIntLE',
|
|
'UIntBE',
|
|
'Int8',
|
|
'Int16LE',
|
|
'Int16BE',
|
|
'Int32LE',
|
|
'Int32BE',
|
|
'IntLE',
|
|
'IntBE',
|
|
'FloatLE',
|
|
'FloatBE',
|
|
'DoubleLE',
|
|
'DoubleBE',
|
|
];
|
|
|
|
const bench = common.createBenchmark(main, {
|
|
buffer: ['fast'],
|
|
type: types,
|
|
n: [1e6]
|
|
});
|
|
|
|
const INT8 = 0x7f;
|
|
const INT16 = 0x7fff;
|
|
const INT32 = 0x7fffffff;
|
|
const INT48 = 0x7fffffffffff;
|
|
const INT64 = 0x7fffffffffffffffn;
|
|
const UINT8 = 0xff;
|
|
const UINT16 = 0xffff;
|
|
const UINT32 = 0xffffffff;
|
|
const UINT64 = 0xffffffffffffffffn;
|
|
|
|
const mod = {
|
|
writeBigInt64BE: INT64,
|
|
writeBigInt64LE: INT64,
|
|
writeBigUInt64BE: UINT64,
|
|
writeBigUInt64LE: UINT64,
|
|
writeInt8: INT8,
|
|
writeInt16BE: INT16,
|
|
writeInt16LE: INT16,
|
|
writeInt32BE: INT32,
|
|
writeInt32LE: INT32,
|
|
writeUInt8: UINT8,
|
|
writeUInt16BE: UINT16,
|
|
writeUInt16LE: UINT16,
|
|
writeUInt32BE: UINT32,
|
|
writeUInt32LE: UINT32,
|
|
writeUIntLE: INT8,
|
|
writeUIntBE: INT16,
|
|
writeIntLE: INT32,
|
|
writeIntBE: INT48
|
|
};
|
|
|
|
const byteLength = {
|
|
writeUIntLE: 1,
|
|
writeUIntBE: 2,
|
|
writeIntLE: 4,
|
|
writeIntBE: 6
|
|
};
|
|
|
|
function main({ n, buf, type }) {
|
|
const buff = buf === 'fast' ?
|
|
Buffer.alloc(8) :
|
|
require('buffer').SlowBuffer(8);
|
|
const fn = `write${type || 'UInt8'}`;
|
|
|
|
if (!/\d/.test(fn))
|
|
benchSpecialInt(buff, fn, n);
|
|
else if (/BigU?Int/.test(fn))
|
|
benchBigInt(buff, fn, BigInt(n));
|
|
else if (/Int/.test(fn))
|
|
benchInt(buff, fn, n);
|
|
else
|
|
benchFloat(buff, fn, n);
|
|
}
|
|
|
|
function benchBigInt(buff, fn, n) {
|
|
const m = mod[fn];
|
|
bench.start();
|
|
for (var i = 0n; i !== n; i++) {
|
|
buff[fn](i & m, 0);
|
|
}
|
|
bench.end(Number(n));
|
|
}
|
|
|
|
function benchInt(buff, fn, n) {
|
|
const m = mod[fn];
|
|
bench.start();
|
|
for (var i = 0; i !== n; i++) {
|
|
buff[fn](i & m, 0);
|
|
}
|
|
bench.end(n);
|
|
}
|
|
|
|
function benchSpecialInt(buff, fn, n) {
|
|
const m = mod[fn];
|
|
const byte = byteLength[fn];
|
|
bench.start();
|
|
for (var i = 0; i !== n; i++) {
|
|
buff[fn](i & m, 0, byte);
|
|
}
|
|
bench.end(n);
|
|
}
|
|
|
|
function benchFloat(buff, fn, n) {
|
|
bench.start();
|
|
for (var i = 0; i !== n; i++) {
|
|
buff[fn](i, 0);
|
|
}
|
|
bench.end(n);
|
|
}
|