-
-
Notifications
You must be signed in to change notification settings - Fork 32k
buffers: speed up swap16/32, add swap64 #7157
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Closed
Closed
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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 |
---|---|---|
@@ -1,61 +1,90 @@ | ||
'use strict'; | ||
|
||
const common = require('../common.js'); | ||
|
||
const bench = common.createBenchmark(main, { | ||
method: ['swap16', 'swap32', 'htons', 'htonl'], | ||
len: [4, 64, 512, 768, 1024, 1536, 2056, 4096, 8192], | ||
n: [1e6] | ||
}); | ||
|
||
// The htons and htonl methods below are used to benchmark the | ||
// performance difference between doing the byteswap in pure | ||
// javascript regardless of Buffer size as opposed to dropping | ||
// down to the native layer for larger Buffer sizes. | ||
|
||
Buffer.prototype.htons = function htons() { | ||
if (this.length % 2 !== 0) | ||
throw new RangeError(); | ||
for (var i = 0, n = 0; i < this.length; i += 2) { | ||
n = this[i]; | ||
this[i] = this[i + 1]; | ||
this[i + 1] = n; | ||
} | ||
return this; | ||
}; | ||
|
||
Buffer.prototype.htonl = function htonl() { | ||
if (this.length % 2 !== 0) | ||
throw new RangeError(); | ||
for (var i = 0, n = 0; i < this.length; i += 4) { | ||
n = this[i]; | ||
this[i] = this[i + 3]; | ||
this[i + 3] = n; | ||
n = this[i + 1]; | ||
this[i + 1] = this[i + 2]; | ||
this[i + 2] = n; | ||
} | ||
return this; | ||
}; | ||
|
||
function createBuffer(len) { | ||
const buf = Buffer.allocUnsafe(len); | ||
for (var i = 1; i <= len; i++) | ||
buf[i - 1] = i; | ||
return buf; | ||
} | ||
|
||
function bufferSwap(n, buf, method) { | ||
for (var i = 1; i <= n; i++) | ||
buf[method](); | ||
} | ||
|
||
function main(conf) { | ||
const method = conf.method; | ||
const len = conf.len | 0; | ||
const n = conf.n | 0; | ||
const buf = createBuffer(len); | ||
bench.start(); | ||
bufferSwap(n, buf, method); | ||
bench.end(n); | ||
} | ||
'use strict'; | ||
|
||
const common = require('../common.js'); | ||
const v8 = require('v8'); | ||
|
||
const bench = common.createBenchmark(main, { | ||
aligned: ['true', 'false'], | ||
method: ['swap16', 'swap32', 'swap64'/*, 'htons', 'htonl', 'htonll'*/], | ||
len: [8, 64, 128, 256, 512, 768, 1024, 1536, 2056, 4096, 8192], | ||
n: [5e7] | ||
}); | ||
|
||
// The htons and htonl methods below are used to benchmark the | ||
// performance difference between doing the byteswap in pure | ||
// javascript regardless of Buffer size as opposed to dropping | ||
// down to the native layer for larger Buffer sizes. Commented | ||
// out by default because they are slow for big buffers. If | ||
// re-evaluating the crossover point, uncomment those methods | ||
// and comment out their implementations in lib/buffer.js so | ||
// C++ version will always be used. | ||
|
||
function swap(b, n, m) { | ||
const i = b[n]; | ||
b[n] = b[m]; | ||
b[m] = i; | ||
} | ||
|
||
Buffer.prototype.htons = function htons() { | ||
if (this.length % 2 !== 0) | ||
throw new RangeError(); | ||
for (var i = 0; i < this.length; i += 2) { | ||
swap(this, i, i + 1); | ||
} | ||
return this; | ||
}; | ||
|
||
Buffer.prototype.htonl = function htonl() { | ||
if (this.length % 4 !== 0) | ||
throw new RangeError(); | ||
for (var i = 0; i < this.length; i += 4) { | ||
swap(this, i, i + 3); | ||
swap(this, i + 1, i + 2); | ||
} | ||
return this; | ||
}; | ||
|
||
Buffer.prototype.htonll = function htonl() { | ||
if (this.length % 8 !== 0) | ||
throw new RangeError(); | ||
for (var i = 0; i < this.length; i += 8) { | ||
swap(this, i, i + 7); | ||
swap(this, i + 1, i + 6); | ||
swap(this, i + 2, i + 5); | ||
swap(this, i + 3, i + 4); | ||
} | ||
return this; | ||
}; | ||
|
||
function createBuffer(len, aligned) { | ||
len += aligned ? 0 : 1; | ||
const buf = Buffer.allocUnsafe(len); | ||
for (var i = 1; i <= len; i++) | ||
buf[i - 1] = i; | ||
return aligned ? buf : buf.slice(1); | ||
} | ||
|
||
function genMethod(method) { | ||
const fnString = | ||
'return function ' + method + '(n, buf) {' + | ||
' for (var i = 0; i <= n; i++)' + | ||
' buf.' + method + '();' + | ||
'}'; | ||
return (new Function(fnString))(); | ||
} | ||
|
||
function main(conf) { | ||
const method = conf.method; | ||
const len = conf.len | 0; | ||
const n = conf.n | 0; | ||
const aligned = conf.aligned || 'true'; | ||
const buf = createBuffer(len, aligned === 'true'); | ||
const bufferSwap = genMethod(method); | ||
|
||
v8.setFlagsFromString('--allow_natives_syntax'); | ||
eval('%OptimizeFunctionOnNextCall(bufferSwap)'); | ||
|
||
bench.start(); | ||
bufferSwap(n, buf); | ||
bench.end(n); | ||
} |
This file contains hidden or 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 hidden or 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.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I note that this is using the same
192
length asswap32
, did you verify that it's still the optimal value for swap64?There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yep. See the benchmarks in the PR message -- also did some finer-grained benchmarks to arrive at 192 though.