polymech-astro/packages/node-murmurhash-native/bench/bench.async.js
2025-08-25 08:22:26 +02:00

120 lines
3.5 KiB
JavaScript

#!/usr/bin/env node
"use strict";
var os = require('os')
, assert = require('assert')
, parben = require('./parben').parallel
, hash = require('..')
, incr = require('../incremental')
, duration = 1000
, parallel = os.cpus().length
, stringEncoding = 'binary'
, outputType = 'number';
var program = require('commander');
program
.version(require(__dirname + '/../package.json').version)
.usage('[options] [seconds=1]')
.option('-n, --no-crypto', 'do not benchmark crypto hashers')
.option('-p, --parallel <n>', 'number of parallel threads', parseInt)
.option('-s, --small <chars>', 'small string size in chars', 80)
.option('-l, --large <kilos>', 'large string/buffer size in kilos', 128)
.option('-o, --output [type]', 'output type')
.option('-e, --encoding [enc]', 'input string encoding')
.parse(process.argv);
if (program.args.length > 0) duration = 1000*program.args[0]>>>0;
if (program.encoding) {
stringEncoding = program.encoding;
console.log('string encoding: %s', stringEncoding);
}
if (program.output) {
outputType = program.output;
console.log('output type: %s', outputType);
}
if (program.parallel) {
parallel = Math.max(0, program.parallel>>>0);
}
console.log('parallel threads: %d', parallel);
console.log('test duration: %d ms', duration);
function incremental(constr) {
return function(data, encoding, outputType, next) {
var hash = new constr();
return hash.update(data, encoding, function(err) {
next(err, hash.digest(outputType));
});
};
}
var funmatrix = [
[hash.murmurHash, 'murmurHash '],
[hash.murmurHash64x86, 'murmurHash64x86 '],
[hash.murmurHash64x64, 'murmurHash64x64 '],
[hash.murmurHash128x86, 'murmurHash128x86 '],
[hash.murmurHash128x64, 'murmurHash128x64 '],
[incremental(incr.MurmurHash), 'MurmurHash '],
[incremental(incr.MurmurHash128x86), 'MurmurHash128x86 '],
[incremental(incr.MurmurHash128x64), 'MurmurHash128x64 ']
];
var queued = [];
function fillrandom(buffer) {
for(var i = 0; i < buffer.length; ++i)
buffer[i] = (Math.random()*0x100)|0;
return buffer;
}
function randomstring(length) {
var buffer = fillrandom(Buffer.allocUnsafe(length));
return buffer.toString('binary');
}
function bench(size, inputStr, duration) {
var input = inputStr
? randomstring(size)
: fillrandom(Buffer.allocUnsafe(size));
funmatrix.forEach(function(args) {
var fun = args[0], name = args[1];
queue(measure, inputStr ? "string" : "buffer", fun, name, duration, parallel, size, input);
});
}
bench(+program.small, true, duration);
bench(program.large*1024, true, duration);
bench(program.large*1024, false, duration);
next();
function measure(label, fun, name, duration, parallel, size, arg) {
var cb = function(next) { fun(arg, stringEncoding, outputType, next); };
parben.calibrate(duration, parallel, cb)
.then(function(iters) {
return parben(iters, parallel, cb);
})
.then(function(res) {
fun(arg, stringEncoding, outputType, function(err, digest) {
assert.ifError(err);
console.log(name + "(" + label + "[" + size + "]): single: %s avg: %s %s",
(size / res.single / 1000).toFixed(4) + 'MB/s',
(size / res.avg / 1000).toFixed(4) + 'MB/s',
digest);
next();
});
});
}
function queue() {
queued.push([].slice.call(arguments, 0));
}
function next() {
if (queued.length > 0) setImmediate.apply(null, queued.shift());
}