mirror of
https://github.com/nodejs/node.git
synced 2025-05-03 02:06:12 +00:00

read() performance is improved most by switching from an array to a linked list for storing buffered data. However, other changes that also contribute include: making some hot functions inlinable, faster read() argument checking, and misc code rearrangement to avoid unnecessary code execution. PR-URL: https://github.com/nodejs/node/pull/7077 Reviewed-By: Calvin Metcalf <calvin.metcalf@gmail.com> Reviewed-By: Matteo Collina <matteo.collina@gmail.com>
73 lines
1.4 KiB
JavaScript
73 lines
1.4 KiB
JavaScript
'use strict';
|
|
|
|
const Buffer = require('buffer').Buffer;
|
|
|
|
module.exports = BufferList;
|
|
|
|
function BufferList() {
|
|
this.head = null;
|
|
this.tail = null;
|
|
this.length = 0;
|
|
}
|
|
|
|
BufferList.prototype.push = function(v) {
|
|
const entry = { data: v, next: null };
|
|
if (this.length > 0)
|
|
this.tail.next = entry;
|
|
else
|
|
this.head = entry;
|
|
this.tail = entry;
|
|
++this.length;
|
|
};
|
|
|
|
BufferList.prototype.unshift = function(v) {
|
|
const entry = { data: v, next: this.head };
|
|
if (this.length === 0)
|
|
this.tail = entry;
|
|
this.head = entry;
|
|
++this.length;
|
|
};
|
|
|
|
BufferList.prototype.shift = function() {
|
|
if (this.length === 0)
|
|
return;
|
|
const ret = this.head.data;
|
|
if (this.length === 1)
|
|
this.head = this.tail = null;
|
|
else
|
|
this.head = this.head.next;
|
|
--this.length;
|
|
return ret;
|
|
};
|
|
|
|
BufferList.prototype.clear = function() {
|
|
this.head = this.tail = null;
|
|
this.length = 0;
|
|
};
|
|
|
|
BufferList.prototype.join = function(s) {
|
|
if (this.length === 0)
|
|
return '';
|
|
var p = this.head;
|
|
var ret = '' + p.data;
|
|
while (p = p.next)
|
|
ret += s + p.data;
|
|
return ret;
|
|
};
|
|
|
|
BufferList.prototype.concat = function(n) {
|
|
if (this.length === 0)
|
|
return Buffer.alloc(0);
|
|
if (this.length === 1)
|
|
return this.head.data;
|
|
const ret = Buffer.allocUnsafe(n >>> 0);
|
|
var p = this.head;
|
|
var i = 0;
|
|
while (p) {
|
|
p.data.copy(ret, i);
|
|
i += p.data.length;
|
|
p = p.next;
|
|
}
|
|
return ret;
|
|
};
|