You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
58204 lines
1.6 MiB
58204 lines
1.6 MiB
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.Twister = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){ |
|
module.exports = { |
|
encode: require( './lib/encode' ), |
|
decode: require( './lib/decode' ) |
|
} |
|
|
|
},{"./lib/decode":2,"./lib/encode":4}],2:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var Dict = require("./dict") |
|
|
|
/** |
|
* Decodes bencoded data. |
|
* |
|
* @param {Buffer} data |
|
* @param {String} encoding |
|
* @return {Object|Array|Buffer|String|Number} |
|
*/ |
|
function decode( data, encoding ) { |
|
|
|
decode.position = 0 |
|
decode.encoding = encoding || null |
|
|
|
decode.data = !( Buffer.isBuffer(data) ) |
|
? new Buffer( data ) |
|
: data |
|
|
|
return decode.next() |
|
|
|
} |
|
|
|
decode.position = 0 |
|
decode.data = null |
|
decode.encoding = null |
|
|
|
decode.next = function() { |
|
|
|
switch( decode.data[decode.position] ) { |
|
case 0x64: return decode.dictionary(); break |
|
case 0x6C: return decode.list(); break |
|
case 0x69: return decode.integer(); break |
|
default: return decode.bytes(); break |
|
} |
|
|
|
} |
|
|
|
decode.find = function( chr ) { |
|
|
|
var i = decode.position |
|
var c = decode.data.length |
|
var d = decode.data |
|
|
|
while( i < c ) { |
|
if( d[i] === chr ) |
|
return i |
|
i++ |
|
} |
|
|
|
throw new Error( |
|
'Invalid data: Missing delimiter "' + |
|
String.fromCharCode( chr ) + '" [0x' + |
|
chr.toString( 16 ) + ']' |
|
) |
|
|
|
} |
|
|
|
decode.dictionary = function() { |
|
|
|
decode.position++ |
|
|
|
var dict = new Dict() |
|
|
|
while( decode.data[decode.position] !== 0x65 ) { |
|
dict.binarySet(decode.bytes(), decode.next()) |
|
} |
|
|
|
decode.position++ |
|
|
|
return dict |
|
|
|
} |
|
|
|
decode.list = function() { |
|
|
|
decode.position++ |
|
|
|
var lst = [] |
|
|
|
while( decode.data[decode.position] !== 0x65 ) { |
|
lst.push( decode.next() ) |
|
} |
|
|
|
decode.position++ |
|
|
|
return lst |
|
|
|
} |
|
|
|
decode.integer = function() { |
|
|
|
var end = decode.find( 0x65 ) |
|
var number = decode.data.toString( 'ascii', decode.position + 1, end ) |
|
|
|
decode.position += end + 1 - decode.position |
|
|
|
return parseInt( number, 10 ) |
|
|
|
} |
|
|
|
decode.bytes = function() { |
|
|
|
var sep = decode.find( 0x3A ) |
|
var length = parseInt( decode.data.toString( 'ascii', decode.position, sep ), 10 ) |
|
var end = ++sep + length |
|
|
|
decode.position = end |
|
|
|
return decode.encoding |
|
? decode.data.toString( decode.encoding, sep, end ) |
|
: decode.data.slice( sep, end ) |
|
|
|
} |
|
|
|
// Exports |
|
module.exports = decode |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./dict":3,"buffer":172}],3:[function(require,module,exports){ |
|
var Dict = module.exports = function Dict() { |
|
Object.defineProperty(this, "_keys", { |
|
enumerable: false, |
|
value: [], |
|
}) |
|
} |
|
|
|
Dict.prototype.binaryKeys = function binaryKeys() { |
|
return this._keys.slice() |
|
} |
|
|
|
Dict.prototype.binarySet = function binarySet(key, value) { |
|
this._keys.push(key) |
|
|
|
this[key] = value |
|
} |
|
|
|
},{}],4:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/** |
|
* Encodes data in bencode. |
|
* |
|
* @param {Buffer|Array|String|Object|Number} data |
|
* @return {Buffer} |
|
*/ |
|
function encode( data ) { |
|
var buffers = [] |
|
encode._encode( buffers, data ) |
|
return Buffer.concat( buffers ) |
|
} |
|
|
|
encode._floatConversionDetected = false |
|
|
|
encode._encode = function( buffers, data ) { |
|
|
|
if( Buffer.isBuffer(data) ) { |
|
buffers.push(new Buffer(data.length + ':')) |
|
buffers.push(data) |
|
return; |
|
} |
|
|
|
switch( typeof data ) { |
|
case 'string': |
|
encode.bytes( buffers, data ) |
|
break |
|
case 'number': |
|
encode.number( buffers, data ) |
|
break |
|
case 'object': |
|
data.constructor === Array |
|
? encode.list( buffers, data ) |
|
: encode.dict( buffers, data ) |
|
break |
|
} |
|
|
|
} |
|
|
|
var buff_e = new Buffer('e') |
|
, buff_d = new Buffer('d') |
|
, buff_l = new Buffer('l') |
|
|
|
encode.bytes = function( buffers, data ) { |
|
|
|
buffers.push( new Buffer(Buffer.byteLength( data ) + ':' + data) ) |
|
} |
|
|
|
encode.number = function( buffers, data ) { |
|
var maxLo = 0x80000000 |
|
var hi = ( data / maxLo ) << 0 |
|
var lo = ( data % maxLo ) << 0 |
|
var val = hi * maxLo + lo |
|
|
|
buffers.push( new Buffer( 'i' + val + 'e' )) |
|
|
|
if( val !== data && !encode._floatConversionDetected ) { |
|
encode._floatConversionDetected = true |
|
console.warn( |
|
'WARNING: Possible data corruption detected with value "'+data+'":', |
|
'Bencoding only defines support for integers, value was converted to "'+val+'"' |
|
) |
|
console.trace() |
|
} |
|
|
|
} |
|
|
|
encode.dict = function( buffers, data ) { |
|
|
|
buffers.push( buff_d ) |
|
|
|
var j = 0 |
|
var k |
|
// fix for issue #13 - sorted dicts |
|
var keys = Object.keys( data ).sort() |
|
var kl = keys.length |
|
|
|
for( ; j < kl ; j++) { |
|
k=keys[j] |
|
encode.bytes( buffers, k ) |
|
encode._encode( buffers, data[k] ) |
|
} |
|
|
|
buffers.push( buff_e ) |
|
} |
|
|
|
encode.list = function( buffers, data ) { |
|
|
|
var i = 0, j = 1 |
|
var c = data.length |
|
buffers.push( buff_l ) |
|
|
|
for( ; i < c; i++ ) { |
|
encode._encode( buffers, data[i] ) |
|
} |
|
|
|
buffers.push( buff_e ) |
|
|
|
} |
|
|
|
// Expose |
|
module.exports = encode |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],5:[function(require,module,exports){ |
|
// (public) Constructor |
|
function BigInteger(a, b, c) { |
|
if (!(this instanceof BigInteger)) |
|
return new BigInteger(a, b, c) |
|
|
|
if (a != null) { |
|
if ("number" == typeof a) this.fromNumber(a, b, c) |
|
else if (b == null && "string" != typeof a) this.fromString(a, 256) |
|
else this.fromString(a, b) |
|
} |
|
} |
|
|
|
var proto = BigInteger.prototype |
|
|
|
// duck-typed isBigInteger |
|
proto.__bigi = require('../package.json').version |
|
BigInteger.isBigInteger = function (obj, check_ver) { |
|
return obj && obj.__bigi && (!check_ver || obj.__bigi === proto.__bigi) |
|
} |
|
|
|
// Bits per digit |
|
var dbits |
|
|
|
// am: Compute w_j += (x*this_i), propagate carries, |
|
// c is initial carry, returns final carry. |
|
// c < 3*dvalue, x < 2*dvalue, this_i < dvalue |
|
// We need to select the fastest one that works in this environment. |
|
|
|
// am1: use a single mult and divide to get the high bits, |
|
// max digit bits should be 26 because |
|
// max internal value = 2*dvalue^2-2*dvalue (< 2^53) |
|
function am1(i, x, w, j, c, n) { |
|
while (--n >= 0) { |
|
var v = x * this[i++] + w[j] + c |
|
c = Math.floor(v / 0x4000000) |
|
w[j++] = v & 0x3ffffff |
|
} |
|
return c |
|
} |
|
// am2 avoids a big mult-and-extract completely. |
|
// Max digit bits should be <= 30 because we do bitwise ops |
|
// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31) |
|
function am2(i, x, w, j, c, n) { |
|
var xl = x & 0x7fff, |
|
xh = x >> 15 |
|
while (--n >= 0) { |
|
var l = this[i] & 0x7fff |
|
var h = this[i++] >> 15 |
|
var m = xh * l + h * xl |
|
l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff) |
|
c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30) |
|
w[j++] = l & 0x3fffffff |
|
} |
|
return c |
|
} |
|
// Alternately, set max digit bits to 28 since some |
|
// browsers slow down when dealing with 32-bit numbers. |
|
function am3(i, x, w, j, c, n) { |
|
var xl = x & 0x3fff, |
|
xh = x >> 14 |
|
while (--n >= 0) { |
|
var l = this[i] & 0x3fff |
|
var h = this[i++] >> 14 |
|
var m = xh * l + h * xl |
|
l = xl * l + ((m & 0x3fff) << 14) + w[j] + c |
|
c = (l >> 28) + (m >> 14) + xh * h |
|
w[j++] = l & 0xfffffff |
|
} |
|
return c |
|
} |
|
|
|
// wtf? |
|
BigInteger.prototype.am = am1 |
|
dbits = 26 |
|
|
|
BigInteger.prototype.DB = dbits |
|
BigInteger.prototype.DM = ((1 << dbits) - 1) |
|
var DV = BigInteger.prototype.DV = (1 << dbits) |
|
|
|
var BI_FP = 52 |
|
BigInteger.prototype.FV = Math.pow(2, BI_FP) |
|
BigInteger.prototype.F1 = BI_FP - dbits |
|
BigInteger.prototype.F2 = 2 * dbits - BI_FP |
|
|
|
// Digit conversions |
|
var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz" |
|
var BI_RC = new Array() |
|
var rr, vv |
|
rr = "0".charCodeAt(0) |
|
for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv |
|
rr = "a".charCodeAt(0) |
|
for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv |
|
rr = "A".charCodeAt(0) |
|
for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv |
|
|
|
function int2char(n) { |
|
return BI_RM.charAt(n) |
|
} |
|
|
|
function intAt(s, i) { |
|
var c = BI_RC[s.charCodeAt(i)] |
|
return (c == null) ? -1 : c |
|
} |
|
|
|
// (protected) copy this to r |
|
function bnpCopyTo(r) { |
|
for (var i = this.t - 1; i >= 0; --i) r[i] = this[i] |
|
r.t = this.t |
|
r.s = this.s |
|
} |
|
|
|
// (protected) set from integer value x, -DV <= x < DV |
|
function bnpFromInt(x) { |
|
this.t = 1 |
|
this.s = (x < 0) ? -1 : 0 |
|
if (x > 0) this[0] = x |
|
else if (x < -1) this[0] = x + DV |
|
else this.t = 0 |
|
} |
|
|
|
// return bigint initialized to value |
|
function nbv(i) { |
|
var r = new BigInteger() |
|
r.fromInt(i) |
|
return r |
|
} |
|
|
|
// (protected) set from string and radix |
|
function bnpFromString(s, b) { |
|
var self = this |
|
|
|
var k |
|
if (b == 16) k = 4 |
|
else if (b == 8) k = 3 |
|
else if (b == 256) k = 8; // byte array |
|
else if (b == 2) k = 1 |
|
else if (b == 32) k = 5 |
|
else if (b == 4) k = 2 |
|
else { |
|
self.fromRadix(s, b) |
|
return |
|
} |
|
self.t = 0 |
|
self.s = 0 |
|
var i = s.length, |
|
mi = false, |
|
sh = 0 |
|
while (--i >= 0) { |
|
var x = (k == 8) ? s[i] & 0xff : intAt(s, i) |
|
if (x < 0) { |
|
if (s.charAt(i) == "-") mi = true |
|
continue |
|
} |
|
mi = false |
|
if (sh == 0) |
|
self[self.t++] = x |
|
else if (sh + k > self.DB) { |
|
self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh |
|
self[self.t++] = (x >> (self.DB - sh)) |
|
} else |
|
self[self.t - 1] |= x << sh |
|
sh += k |
|
if (sh >= self.DB) sh -= self.DB |
|
} |
|
if (k == 8 && (s[0] & 0x80) != 0) { |
|
self.s = -1 |
|
if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh |
|
} |
|
self.clamp() |
|
if (mi) BigInteger.ZERO.subTo(self, self) |
|
} |
|
|
|
// (protected) clamp off excess high words |
|
function bnpClamp() { |
|
var c = this.s & this.DM |
|
while (this.t > 0 && this[this.t - 1] == c)--this.t |
|
} |
|
|
|
// (public) return string representation in given radix |
|
function bnToString(b) { |
|
var self = this |
|
if (self.s < 0) return "-" + self.negate() |
|
.toString(b) |
|
var k |
|
if (b == 16) k = 4 |
|
else if (b == 8) k = 3 |
|
else if (b == 2) k = 1 |
|
else if (b == 32) k = 5 |
|
else if (b == 4) k = 2 |
|
else return self.toRadix(b) |
|
var km = (1 << k) - 1, |
|
d, m = false, |
|
r = "", |
|
i = self.t |
|
var p = self.DB - (i * self.DB) % k |
|
if (i-- > 0) { |
|
if (p < self.DB && (d = self[i] >> p) > 0) { |
|
m = true |
|
r = int2char(d) |
|
} |
|
while (i >= 0) { |
|
if (p < k) { |
|
d = (self[i] & ((1 << p) - 1)) << (k - p) |
|
d |= self[--i] >> (p += self.DB - k) |
|
} else { |
|
d = (self[i] >> (p -= k)) & km |
|
if (p <= 0) { |
|
p += self.DB |
|
--i |
|
} |
|
} |
|
if (d > 0) m = true |
|
if (m) r += int2char(d) |
|
} |
|
} |
|
return m ? r : "0" |
|
} |
|
|
|
// (public) -this |
|
function bnNegate() { |
|
var r = new BigInteger() |
|
BigInteger.ZERO.subTo(this, r) |
|
return r |
|
} |
|
|
|
// (public) |this| |
|
function bnAbs() { |
|
return (this.s < 0) ? this.negate() : this |
|
} |
|
|
|
// (public) return + if this > a, - if this < a, 0 if equal |
|
function bnCompareTo(a) { |
|
var r = this.s - a.s |
|
if (r != 0) return r |
|
var i = this.t |
|
r = i - a.t |
|
if (r != 0) return (this.s < 0) ? -r : r |
|
while (--i >= 0) |
|
if ((r = this[i] - a[i]) != 0) return r |
|
return 0 |
|
} |
|
|
|
// returns bit length of the integer x |
|
function nbits(x) { |
|
var r = 1, |
|
t |
|
if ((t = x >>> 16) != 0) { |
|
x = t |
|
r += 16 |
|
} |
|
if ((t = x >> 8) != 0) { |
|
x = t |
|
r += 8 |
|
} |
|
if ((t = x >> 4) != 0) { |
|
x = t |
|
r += 4 |
|
} |
|
if ((t = x >> 2) != 0) { |
|
x = t |
|
r += 2 |
|
} |
|
if ((t = x >> 1) != 0) { |
|
x = t |
|
r += 1 |
|
} |
|
return r |
|
} |
|
|
|
// (public) return the number of bits in "this" |
|
function bnBitLength() { |
|
if (this.t <= 0) return 0 |
|
return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM)) |
|
} |
|
|
|
// (public) return the number of bytes in "this" |
|
function bnByteLength() { |
|
return this.bitLength() >> 3 |
|
} |
|
|
|
// (protected) r = this << n*DB |
|
function bnpDLShiftTo(n, r) { |
|
var i |
|
for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i] |
|
for (i = n - 1; i >= 0; --i) r[i] = 0 |
|
r.t = this.t + n |
|
r.s = this.s |
|
} |
|
|
|
// (protected) r = this >> n*DB |
|
function bnpDRShiftTo(n, r) { |
|
for (var i = n; i < this.t; ++i) r[i - n] = this[i] |
|
r.t = Math.max(this.t - n, 0) |
|
r.s = this.s |
|
} |
|
|
|
// (protected) r = this << n |
|
function bnpLShiftTo(n, r) { |
|
var self = this |
|
var bs = n % self.DB |
|
var cbs = self.DB - bs |
|
var bm = (1 << cbs) - 1 |
|
var ds = Math.floor(n / self.DB), |
|
c = (self.s << bs) & self.DM, |
|
i |
|
for (i = self.t - 1; i >= 0; --i) { |
|
r[i + ds + 1] = (self[i] >> cbs) | c |
|
c = (self[i] & bm) << bs |
|
} |
|
for (i = ds - 1; i >= 0; --i) r[i] = 0 |
|
r[ds] = c |
|
r.t = self.t + ds + 1 |
|
r.s = self.s |
|
r.clamp() |
|
} |
|
|
|
// (protected) r = this >> n |
|
function bnpRShiftTo(n, r) { |
|
var self = this |
|
r.s = self.s |
|
var ds = Math.floor(n / self.DB) |
|
if (ds >= self.t) { |
|
r.t = 0 |
|
return |
|
} |
|
var bs = n % self.DB |
|
var cbs = self.DB - bs |
|
var bm = (1 << bs) - 1 |
|
r[0] = self[ds] >> bs |
|
for (var i = ds + 1; i < self.t; ++i) { |
|
r[i - ds - 1] |= (self[i] & bm) << cbs |
|
r[i - ds] = self[i] >> bs |
|
} |
|
if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs |
|
r.t = self.t - ds |
|
r.clamp() |
|
} |
|
|
|
// (protected) r = this - a |
|
function bnpSubTo(a, r) { |
|
var self = this |
|
var i = 0, |
|
c = 0, |
|
m = Math.min(a.t, self.t) |
|
while (i < m) { |
|
c += self[i] - a[i] |
|
r[i++] = c & self.DM |
|
c >>= self.DB |
|
} |
|
if (a.t < self.t) { |
|
c -= a.s |
|
while (i < self.t) { |
|
c += self[i] |
|
r[i++] = c & self.DM |
|
c >>= self.DB |
|
} |
|
c += self.s |
|
} else { |
|
c += self.s |
|
while (i < a.t) { |
|
c -= a[i] |
|
r[i++] = c & self.DM |
|
c >>= self.DB |
|
} |
|
c -= a.s |
|
} |
|
r.s = (c < 0) ? -1 : 0 |
|
if (c < -1) r[i++] = self.DV + c |
|
else if (c > 0) r[i++] = c |
|
r.t = i |
|
r.clamp() |
|
} |
|
|
|
// (protected) r = this * a, r != this,a (HAC 14.12) |
|
// "this" should be the larger one if appropriate. |
|
function bnpMultiplyTo(a, r) { |
|
var x = this.abs(), |
|
y = a.abs() |
|
var i = x.t |
|
r.t = i + y.t |
|
while (--i >= 0) r[i] = 0 |
|
for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t) |
|
r.s = 0 |
|
r.clamp() |
|
if (this.s != a.s) BigInteger.ZERO.subTo(r, r) |
|
} |
|
|
|
// (protected) r = this^2, r != this (HAC 14.16) |
|
function bnpSquareTo(r) { |
|
var x = this.abs() |
|
var i = r.t = 2 * x.t |
|
while (--i >= 0) r[i] = 0 |
|
for (i = 0; i < x.t - 1; ++i) { |
|
var c = x.am(i, x[i], r, 2 * i, 0, 1) |
|
if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) { |
|
r[i + x.t] -= x.DV |
|
r[i + x.t + 1] = 1 |
|
} |
|
} |
|
if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1) |
|
r.s = 0 |
|
r.clamp() |
|
} |
|
|
|
// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) |
|
// r != q, this != m. q or r may be null. |
|
function bnpDivRemTo(m, q, r) { |
|
var self = this |
|
var pm = m.abs() |
|
if (pm.t <= 0) return |
|
var pt = self.abs() |
|
if (pt.t < pm.t) { |
|
if (q != null) q.fromInt(0) |
|
if (r != null) self.copyTo(r) |
|
return |
|
} |
|
if (r == null) r = new BigInteger() |
|
var y = new BigInteger(), |
|
ts = self.s, |
|
ms = m.s |
|
var nsh = self.DB - nbits(pm[pm.t - 1]); // normalize modulus |
|
if (nsh > 0) { |
|
pm.lShiftTo(nsh, y) |
|
pt.lShiftTo(nsh, r) |
|
} else { |
|
pm.copyTo(y) |
|
pt.copyTo(r) |
|
} |
|
var ys = y.t |
|
var y0 = y[ys - 1] |
|
if (y0 == 0) return |
|
var yt = y0 * (1 << self.F1) + ((ys > 1) ? y[ys - 2] >> self.F2 : 0) |
|
var d1 = self.FV / yt, |
|
d2 = (1 << self.F1) / yt, |
|
e = 1 << self.F2 |
|
var i = r.t, |
|
j = i - ys, |
|
t = (q == null) ? new BigInteger() : q |
|
y.dlShiftTo(j, t) |
|
if (r.compareTo(t) >= 0) { |
|
r[r.t++] = 1 |
|
r.subTo(t, r) |
|
} |
|
BigInteger.ONE.dlShiftTo(ys, t) |
|
t.subTo(y, y); // "negative" y so we can replace sub with am later |
|
while (y.t < ys) y[y.t++] = 0 |
|
while (--j >= 0) { |
|
// Estimate quotient digit |
|
var qd = (r[--i] == y0) ? self.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2) |
|
if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) { // Try it out |
|
y.dlShiftTo(j, t) |
|
r.subTo(t, r) |
|
while (r[i] < --qd) r.subTo(t, r) |
|
} |
|
} |
|
if (q != null) { |
|
r.drShiftTo(ys, q) |
|
if (ts != ms) BigInteger.ZERO.subTo(q, q) |
|
} |
|
r.t = ys |
|
r.clamp() |
|
if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder |
|
if (ts < 0) BigInteger.ZERO.subTo(r, r) |
|
} |
|
|
|
// (public) this mod a |
|
function bnMod(a) { |
|
var r = new BigInteger() |
|
this.abs() |
|
.divRemTo(a, null, r) |
|
if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r) |
|
return r |
|
} |
|
|
|
// Modular reduction using "classic" algorithm |
|
function Classic(m) { |
|
this.m = m |
|
} |
|
|
|
function cConvert(x) { |
|
if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m) |
|
else return x |
|
} |
|
|
|
function cRevert(x) { |
|
return x |
|
} |
|
|
|
function cReduce(x) { |
|
x.divRemTo(this.m, null, x) |
|
} |
|
|
|
function cMulTo(x, y, r) { |
|
x.multiplyTo(y, r) |
|
this.reduce(r) |
|
} |
|
|
|
function cSqrTo(x, r) { |
|
x.squareTo(r) |
|
this.reduce(r) |
|
} |
|
|
|
Classic.prototype.convert = cConvert |
|
Classic.prototype.revert = cRevert |
|
Classic.prototype.reduce = cReduce |
|
Classic.prototype.mulTo = cMulTo |
|
Classic.prototype.sqrTo = cSqrTo |
|
|
|
// (protected) return "-1/this % 2^DB"; useful for Mont. reduction |
|
// justification: |
|
// xy == 1 (mod m) |
|
// xy = 1+km |
|
// xy(2-xy) = (1+km)(1-km) |
|
// x[y(2-xy)] = 1-k^2m^2 |
|
// x[y(2-xy)] == 1 (mod m^2) |
|
// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2 |
|
// should reduce x and y(2-xy) by m^2 at each step to keep size bounded. |
|
// JS multiply "overflows" differently from C/C++, so care is needed here. |
|
function bnpInvDigit() { |
|
if (this.t < 1) return 0 |
|
var x = this[0] |
|
if ((x & 1) == 0) return 0 |
|
var y = x & 3; // y == 1/x mod 2^2 |
|
y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4 |
|
y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8 |
|
y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16 |
|
// last step - calculate inverse mod DV directly |
|
// assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints |
|
y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits |
|
// we really want the negative inverse, and -DV < y < DV |
|
return (y > 0) ? this.DV - y : -y |
|
} |
|
|
|
// Montgomery reduction |
|
function Montgomery(m) { |
|
this.m = m |
|
this.mp = m.invDigit() |
|
this.mpl = this.mp & 0x7fff |
|
this.mph = this.mp >> 15 |
|
this.um = (1 << (m.DB - 15)) - 1 |
|
this.mt2 = 2 * m.t |
|
} |
|
|
|
// xR mod m |
|
function montConvert(x) { |
|
var r = new BigInteger() |
|
x.abs() |
|
.dlShiftTo(this.m.t, r) |
|
r.divRemTo(this.m, null, r) |
|
if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r) |
|
return r |
|
} |
|
|
|
// x/R mod m |
|
function montRevert(x) { |
|
var r = new BigInteger() |
|
x.copyTo(r) |
|
this.reduce(r) |
|
return r |
|
} |
|
|
|
// x = x/R mod m (HAC 14.32) |
|
function montReduce(x) { |
|
while (x.t <= this.mt2) // pad x so am has enough room later |
|
x[x.t++] = 0 |
|
for (var i = 0; i < this.m.t; ++i) { |
|
// faster way of calculating u0 = x[i]*mp mod DV |
|
var j = x[i] & 0x7fff |
|
var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM |
|
// use am to combine the multiply-shift-add into one call |
|
j = i + this.m.t |
|
x[j] += this.m.am(0, u0, x, i, 0, this.m.t) |
|
// propagate carry |
|
while (x[j] >= x.DV) { |
|
x[j] -= x.DV |
|
x[++j]++ |
|
} |
|
} |
|
x.clamp() |
|
x.drShiftTo(this.m.t, x) |
|
if (x.compareTo(this.m) >= 0) x.subTo(this.m, x) |
|
} |
|
|
|
// r = "x^2/R mod m"; x != r |
|
function montSqrTo(x, r) { |
|
x.squareTo(r) |
|
this.reduce(r) |
|
} |
|
|
|
// r = "xy/R mod m"; x,y != r |
|
function montMulTo(x, y, r) { |
|
x.multiplyTo(y, r) |
|
this.reduce(r) |
|
} |
|
|
|
Montgomery.prototype.convert = montConvert |
|
Montgomery.prototype.revert = montRevert |
|
Montgomery.prototype.reduce = montReduce |
|
Montgomery.prototype.mulTo = montMulTo |
|
Montgomery.prototype.sqrTo = montSqrTo |
|
|
|
// (protected) true iff this is even |
|
function bnpIsEven() { |
|
return ((this.t > 0) ? (this[0] & 1) : this.s) == 0 |
|
} |
|
|
|
// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79) |
|
function bnpExp(e, z) { |
|
if (e > 0xffffffff || e < 1) return BigInteger.ONE |
|
var r = new BigInteger(), |
|
r2 = new BigInteger(), |
|
g = z.convert(this), |
|
i = nbits(e) - 1 |
|
g.copyTo(r) |
|
while (--i >= 0) { |
|
z.sqrTo(r, r2) |
|
if ((e & (1 << i)) > 0) z.mulTo(r2, g, r) |
|
else { |
|
var t = r |
|
r = r2 |
|
r2 = t |
|
} |
|
} |
|
return z.revert(r) |
|
} |
|
|
|
// (public) this^e % m, 0 <= e < 2^32 |
|
function bnModPowInt(e, m) { |
|
var z |
|
if (e < 256 || m.isEven()) z = new Classic(m) |
|
else z = new Montgomery(m) |
|
return this.exp(e, z) |
|
} |
|
|
|
// protected |
|
proto.copyTo = bnpCopyTo |
|
proto.fromInt = bnpFromInt |
|
proto.fromString = bnpFromString |
|
proto.clamp = bnpClamp |
|
proto.dlShiftTo = bnpDLShiftTo |
|
proto.drShiftTo = bnpDRShiftTo |
|
proto.lShiftTo = bnpLShiftTo |
|
proto.rShiftTo = bnpRShiftTo |
|
proto.subTo = bnpSubTo |
|
proto.multiplyTo = bnpMultiplyTo |
|
proto.squareTo = bnpSquareTo |
|
proto.divRemTo = bnpDivRemTo |
|
proto.invDigit = bnpInvDigit |
|
proto.isEven = bnpIsEven |
|
proto.exp = bnpExp |
|
|
|
// public |
|
proto.toString = bnToString |
|
proto.negate = bnNegate |
|
proto.abs = bnAbs |
|
proto.compareTo = bnCompareTo |
|
proto.bitLength = bnBitLength |
|
proto.byteLength = bnByteLength |
|
proto.mod = bnMod |
|
proto.modPowInt = bnModPowInt |
|
|
|
// (public) |
|
function bnClone() { |
|
var r = new BigInteger() |
|
this.copyTo(r) |
|
return r |
|
} |
|
|
|
// (public) return value as integer |
|
function bnIntValue() { |
|
if (this.s < 0) { |
|
if (this.t == 1) return this[0] - this.DV |
|
else if (this.t == 0) return -1 |
|
} else if (this.t == 1) return this[0] |
|
else if (this.t == 0) return 0 |
|
// assumes 16 < DB < 32 |
|
return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0] |
|
} |
|
|
|
// (public) return value as byte |
|
function bnByteValue() { |
|
return (this.t == 0) ? this.s : (this[0] << 24) >> 24 |
|
} |
|
|
|
// (public) return value as short (assumes DB>=16) |
|
function bnShortValue() { |
|
return (this.t == 0) ? this.s : (this[0] << 16) >> 16 |
|
} |
|
|
|
// (protected) return x s.t. r^x < DV |
|
function bnpChunkSize(r) { |
|
return Math.floor(Math.LN2 * this.DB / Math.log(r)) |
|
} |
|
|
|
// (public) 0 if this == 0, 1 if this > 0 |
|
function bnSigNum() { |
|
if (this.s < 0) return -1 |
|
else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0 |
|
else return 1 |
|
} |
|
|
|
// (protected) convert to radix string |
|
function bnpToRadix(b) { |
|
if (b == null) b = 10 |
|
if (this.signum() == 0 || b < 2 || b > 36) return "0" |
|
var cs = this.chunkSize(b) |
|
var a = Math.pow(b, cs) |
|
var d = nbv(a), |
|
y = new BigInteger(), |
|
z = new BigInteger(), |
|
r = "" |
|
this.divRemTo(d, y, z) |
|
while (y.signum() > 0) { |
|
r = (a + z.intValue()) |
|
.toString(b) |
|
.substr(1) + r |
|
y.divRemTo(d, y, z) |
|
} |
|
return z.intValue() |
|
.toString(b) + r |
|
} |
|
|
|
// (protected) convert from radix string |
|
function bnpFromRadix(s, b) { |
|
var self = this |
|
self.fromInt(0) |
|
if (b == null) b = 10 |
|
var cs = self.chunkSize(b) |
|
var d = Math.pow(b, cs), |
|
mi = false, |
|
j = 0, |
|
w = 0 |
|
for (var i = 0; i < s.length; ++i) { |
|
var x = intAt(s, i) |
|
if (x < 0) { |
|
if (s.charAt(i) == "-" && self.signum() == 0) mi = true |
|
continue |
|
} |
|
w = b * w + x |
|
if (++j >= cs) { |
|
self.dMultiply(d) |
|
self.dAddOffset(w, 0) |
|
j = 0 |
|
w = 0 |
|
} |
|
} |
|
if (j > 0) { |
|
self.dMultiply(Math.pow(b, j)) |
|
self.dAddOffset(w, 0) |
|
} |
|
if (mi) BigInteger.ZERO.subTo(self, self) |
|
} |
|
|
|
// (protected) alternate constructor |
|
function bnpFromNumber(a, b, c) { |
|
var self = this |
|
if ("number" == typeof b) { |
|
// new BigInteger(int,int,RNG) |
|
if (a < 2) self.fromInt(1) |
|
else { |
|
self.fromNumber(a, c) |
|
if (!self.testBit(a - 1)) // force MSB set |
|
self.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, self) |
|
if (self.isEven()) self.dAddOffset(1, 0); // force odd |
|
while (!self.isProbablePrime(b)) { |
|
self.dAddOffset(2, 0) |
|
if (self.bitLength() > a) self.subTo(BigInteger.ONE.shiftLeft(a - 1), self) |
|
} |
|
} |
|
} else { |
|
// new BigInteger(int,RNG) |
|
var x = new Array(), |
|
t = a & 7 |
|
x.length = (a >> 3) + 1 |
|
b.nextBytes(x) |
|
if (t > 0) x[0] &= ((1 << t) - 1) |
|
else x[0] = 0 |
|
self.fromString(x, 256) |
|
} |
|
} |
|
|
|
// (public) convert to bigendian byte array |
|
function bnToByteArray() { |
|
var self = this |
|
var i = self.t, |
|
r = new Array() |
|
r[0] = self.s |
|
var p = self.DB - (i * self.DB) % 8, |
|
d, k = 0 |
|
if (i-- > 0) { |
|
if (p < self.DB && (d = self[i] >> p) != (self.s & self.DM) >> p) |
|
r[k++] = d | (self.s << (self.DB - p)) |
|
while (i >= 0) { |
|
if (p < 8) { |
|
d = (self[i] & ((1 << p) - 1)) << (8 - p) |
|
d |= self[--i] >> (p += self.DB - 8) |
|
} else { |
|
d = (self[i] >> (p -= 8)) & 0xff |
|
if (p <= 0) { |
|
p += self.DB |
|
--i |
|
} |
|
} |
|
if ((d & 0x80) != 0) d |= -256 |
|
if (k === 0 && (self.s & 0x80) != (d & 0x80))++k |
|
if (k > 0 || d != self.s) r[k++] = d |
|
} |
|
} |
|
return r |
|
} |
|
|
|
function bnEquals(a) { |
|
return (this.compareTo(a) == 0) |
|
} |
|
|
|
function bnMin(a) { |
|
return (this.compareTo(a) < 0) ? this : a |
|
} |
|
|
|
function bnMax(a) { |
|
return (this.compareTo(a) > 0) ? this : a |
|
} |
|
|
|
// (protected) r = this op a (bitwise) |
|
function bnpBitwiseTo(a, op, r) { |
|
var self = this |
|
var i, f, m = Math.min(a.t, self.t) |
|
for (i = 0; i < m; ++i) r[i] = op(self[i], a[i]) |
|
if (a.t < self.t) { |
|
f = a.s & self.DM |
|
for (i = m; i < self.t; ++i) r[i] = op(self[i], f) |
|
r.t = self.t |
|
} else { |
|
f = self.s & self.DM |
|
for (i = m; i < a.t; ++i) r[i] = op(f, a[i]) |
|
r.t = a.t |
|
} |
|
r.s = op(self.s, a.s) |
|
r.clamp() |
|
} |
|
|
|
// (public) this & a |
|
function op_and(x, y) { |
|
return x & y |
|
} |
|
|
|
function bnAnd(a) { |
|
var r = new BigInteger() |
|
this.bitwiseTo(a, op_and, r) |
|
return r |
|
} |
|
|
|
// (public) this | a |
|
function op_or(x, y) { |
|
return x | y |
|
} |
|
|
|
function bnOr(a) { |
|
var r = new BigInteger() |
|
this.bitwiseTo(a, op_or, r) |
|
return r |
|
} |
|
|
|
// (public) this ^ a |
|
function op_xor(x, y) { |
|
return x ^ y |
|
} |
|
|
|
function bnXor(a) { |
|
var r = new BigInteger() |
|
this.bitwiseTo(a, op_xor, r) |
|
return r |
|
} |
|
|
|
// (public) this & ~a |
|
function op_andnot(x, y) { |
|
return x & ~y |
|
} |
|
|
|
function bnAndNot(a) { |
|
var r = new BigInteger() |
|
this.bitwiseTo(a, op_andnot, r) |
|
return r |
|
} |
|
|
|
// (public) ~this |
|
function bnNot() { |
|
var r = new BigInteger() |
|
for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i] |
|
r.t = this.t |
|
r.s = ~this.s |
|
return r |
|
} |
|
|
|
// (public) this << n |
|
function bnShiftLeft(n) { |
|
var r = new BigInteger() |
|
if (n < 0) this.rShiftTo(-n, r) |
|
else this.lShiftTo(n, r) |
|
return r |
|
} |
|
|
|
// (public) this >> n |
|
function bnShiftRight(n) { |
|
var r = new BigInteger() |
|
if (n < 0) this.lShiftTo(-n, r) |
|
else this.rShiftTo(n, r) |
|
return r |
|
} |
|
|
|
// return index of lowest 1-bit in x, x < 2^31 |
|
function lbit(x) { |
|
if (x == 0) return -1 |
|
var r = 0 |
|
if ((x & 0xffff) == 0) { |
|
x >>= 16 |
|
r += 16 |
|
} |
|
if ((x & 0xff) == 0) { |
|
x >>= 8 |
|
r += 8 |
|
} |
|
if ((x & 0xf) == 0) { |
|
x >>= 4 |
|
r += 4 |
|
} |
|
if ((x & 3) == 0) { |
|
x >>= 2 |
|
r += 2 |
|
} |
|
if ((x & 1) == 0)++r |
|
return r |
|
} |
|
|
|
// (public) returns index of lowest 1-bit (or -1 if none) |
|
function bnGetLowestSetBit() { |
|
for (var i = 0; i < this.t; ++i) |
|
if (this[i] != 0) return i * this.DB + lbit(this[i]) |
|
if (this.s < 0) return this.t * this.DB |
|
return -1 |
|
} |
|
|
|
// return number of 1 bits in x |
|
function cbit(x) { |
|
var r = 0 |
|
while (x != 0) { |
|
x &= x - 1 |
|
++r |
|
} |
|
return r |
|
} |
|
|
|
// (public) return number of set bits |
|
function bnBitCount() { |
|
var r = 0, |
|
x = this.s & this.DM |
|
for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x) |
|
return r |
|
} |
|
|
|
// (public) true iff nth bit is set |
|
function bnTestBit(n) { |
|
var j = Math.floor(n / this.DB) |
|
if (j >= this.t) return (this.s != 0) |
|
return ((this[j] & (1 << (n % this.DB))) != 0) |
|
} |
|
|
|
// (protected) this op (1<<n) |
|
function bnpChangeBit(n, op) { |
|
var r = BigInteger.ONE.shiftLeft(n) |
|
this.bitwiseTo(r, op, r) |
|
return r |
|
} |
|
|
|
// (public) this | (1<<n) |
|
function bnSetBit(n) { |
|
return this.changeBit(n, op_or) |
|
} |
|
|
|
// (public) this & ~(1<<n) |
|
function bnClearBit(n) { |
|
return this.changeBit(n, op_andnot) |
|
} |
|
|
|
// (public) this ^ (1<<n) |
|
function bnFlipBit(n) { |
|
return this.changeBit(n, op_xor) |
|
} |
|
|
|
// (protected) r = this + a |
|
function bnpAddTo(a, r) { |
|
var self = this |
|
|
|
var i = 0, |
|
c = 0, |
|
m = Math.min(a.t, self.t) |
|
while (i < m) { |
|
c += self[i] + a[i] |
|
r[i++] = c & self.DM |
|
c >>= self.DB |
|
} |
|
if (a.t < self.t) { |
|
c += a.s |
|
while (i < self.t) { |
|
c += self[i] |
|
r[i++] = c & self.DM |
|
c >>= self.DB |
|
} |
|
c += self.s |
|
} else { |
|
c += self.s |
|
while (i < a.t) { |
|
c += a[i] |
|
r[i++] = c & self.DM |
|
c >>= self.DB |
|
} |
|
c += a.s |
|
} |
|
r.s = (c < 0) ? -1 : 0 |
|
if (c > 0) r[i++] = c |
|
else if (c < -1) r[i++] = self.DV + c |
|
r.t = i |
|
r.clamp() |
|
} |
|
|
|
// (public) this + a |
|
function bnAdd(a) { |
|
var r = new BigInteger() |
|
this.addTo(a, r) |
|
return r |
|
} |
|
|
|
// (public) this - a |
|
function bnSubtract(a) { |
|
var r = new BigInteger() |
|
this.subTo(a, r) |
|
return r |
|
} |
|
|
|
// (public) this * a |
|
function bnMultiply(a) { |
|
var r = new BigInteger() |
|
this.multiplyTo(a, r) |
|
return r |
|
} |
|
|
|
// (public) this^2 |
|
function bnSquare() { |
|
var r = new BigInteger() |
|
this.squareTo(r) |
|
return r |
|
} |
|
|
|
// (public) this / a |
|
function bnDivide(a) { |
|
var r = new BigInteger() |
|
this.divRemTo(a, r, null) |
|
return r |
|
} |
|
|
|
// (public) this % a |
|
function bnRemainder(a) { |
|
var r = new BigInteger() |
|
this.divRemTo(a, null, r) |
|
return r |
|
} |
|
|
|
// (public) [this/a,this%a] |
|
function bnDivideAndRemainder(a) { |
|
var q = new BigInteger(), |
|
r = new BigInteger() |
|
this.divRemTo(a, q, r) |
|
return new Array(q, r) |
|
} |
|
|
|
// (protected) this *= n, this >= 0, 1 < n < DV |
|
function bnpDMultiply(n) { |
|
this[this.t] = this.am(0, n - 1, this, 0, 0, this.t) |
|
++this.t |
|
this.clamp() |
|
} |
|
|
|
// (protected) this += n << w words, this >= 0 |
|
function bnpDAddOffset(n, w) { |
|
if (n == 0) return |
|
while (this.t <= w) this[this.t++] = 0 |
|
this[w] += n |
|
while (this[w] >= this.DV) { |
|
this[w] -= this.DV |
|
if (++w >= this.t) this[this.t++] = 0 |
|
++this[w] |
|
} |
|
} |
|
|
|
// A "null" reducer |
|
function NullExp() {} |
|
|
|
function nNop(x) { |
|
return x |
|
} |
|
|
|
function nMulTo(x, y, r) { |
|
x.multiplyTo(y, r) |
|
} |
|
|
|
function nSqrTo(x, r) { |
|
x.squareTo(r) |
|
} |
|
|
|
NullExp.prototype.convert = nNop |
|
NullExp.prototype.revert = nNop |
|
NullExp.prototype.mulTo = nMulTo |
|
NullExp.prototype.sqrTo = nSqrTo |
|
|
|
// (public) this^e |
|
function bnPow(e) { |
|
return this.exp(e, new NullExp()) |
|
} |
|
|
|
// (protected) r = lower n words of "this * a", a.t <= n |
|
// "this" should be the larger one if appropriate. |
|
function bnpMultiplyLowerTo(a, n, r) { |
|
var i = Math.min(this.t + a.t, n) |
|
r.s = 0; // assumes a,this >= 0 |
|
r.t = i |
|
while (i > 0) r[--i] = 0 |
|
var j |
|
for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t) |
|
for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i) |
|
r.clamp() |
|
} |
|
|
|
// (protected) r = "this * a" without lower n words, n > 0 |
|
// "this" should be the larger one if appropriate. |
|
function bnpMultiplyUpperTo(a, n, r) { |
|
--n |
|
var i = r.t = this.t + a.t - n |
|
r.s = 0; // assumes a,this >= 0 |
|
while (--i >= 0) r[i] = 0 |
|
for (i = Math.max(n - this.t, 0); i < a.t; ++i) |
|
r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n) |
|
r.clamp() |
|
r.drShiftTo(1, r) |
|
} |
|
|
|
// Barrett modular reduction |
|
function Barrett(m) { |
|
// setup Barrett |
|
this.r2 = new BigInteger() |
|
this.q3 = new BigInteger() |
|
BigInteger.ONE.dlShiftTo(2 * m.t, this.r2) |
|
this.mu = this.r2.divide(m) |
|
this.m = m |
|
} |
|
|
|
function barrettConvert(x) { |
|
if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m) |
|
else if (x.compareTo(this.m) < 0) return x |
|
else { |
|
var r = new BigInteger() |
|
x.copyTo(r) |
|
this.reduce(r) |
|
return r |
|
} |
|
} |
|
|
|
function barrettRevert(x) { |
|
return x |
|
} |
|
|
|
// x = x mod m (HAC 14.42) |
|
function barrettReduce(x) { |
|
var self = this |
|
x.drShiftTo(self.m.t - 1, self.r2) |
|
if (x.t > self.m.t + 1) { |
|
x.t = self.m.t + 1 |
|
x.clamp() |
|
} |
|
self.mu.multiplyUpperTo(self.r2, self.m.t + 1, self.q3) |
|
self.m.multiplyLowerTo(self.q3, self.m.t + 1, self.r2) |
|
while (x.compareTo(self.r2) < 0) x.dAddOffset(1, self.m.t + 1) |
|
x.subTo(self.r2, x) |
|
while (x.compareTo(self.m) >= 0) x.subTo(self.m, x) |
|
} |
|
|
|
// r = x^2 mod m; x != r |
|
function barrettSqrTo(x, r) { |
|
x.squareTo(r) |
|
this.reduce(r) |
|
} |
|
|
|
// r = x*y mod m; x,y != r |
|
function barrettMulTo(x, y, r) { |
|
x.multiplyTo(y, r) |
|
this.reduce(r) |
|
} |
|
|
|
Barrett.prototype.convert = barrettConvert |
|
Barrett.prototype.revert = barrettRevert |
|
Barrett.prototype.reduce = barrettReduce |
|
Barrett.prototype.mulTo = barrettMulTo |
|
Barrett.prototype.sqrTo = barrettSqrTo |
|
|
|
// (public) this^e % m (HAC 14.85) |
|
function bnModPow(e, m) { |
|
var i = e.bitLength(), |
|
k, r = nbv(1), |
|
z |
|
if (i <= 0) return r |
|
else if (i < 18) k = 1 |
|
else if (i < 48) k = 3 |
|
else if (i < 144) k = 4 |
|
else if (i < 768) k = 5 |
|
else k = 6 |
|
if (i < 8) |
|
z = new Classic(m) |
|
else if (m.isEven()) |
|
z = new Barrett(m) |
|
else |
|
z = new Montgomery(m) |
|
|
|
// precomputation |
|
var g = new Array(), |
|
n = 3, |
|
k1 = k - 1, |
|
km = (1 << k) - 1 |
|
g[1] = z.convert(this) |
|
if (k > 1) { |
|
var g2 = new BigInteger() |
|
z.sqrTo(g[1], g2) |
|
while (n <= km) { |
|
g[n] = new BigInteger() |
|
z.mulTo(g2, g[n - 2], g[n]) |
|
n += 2 |
|
} |
|
} |
|
|
|
var j = e.t - 1, |
|
w, is1 = true, |
|
r2 = new BigInteger(), |
|
t |
|
i = nbits(e[j]) - 1 |
|
while (j >= 0) { |
|
if (i >= k1) w = (e[j] >> (i - k1)) & km |
|
else { |
|
w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i) |
|
if (j > 0) w |= e[j - 1] >> (this.DB + i - k1) |
|
} |
|
|
|
n = k |
|
while ((w & 1) == 0) { |
|
w >>= 1 |
|
--n |
|
} |
|
if ((i -= n) < 0) { |
|
i += this.DB |
|
--j |
|
} |
|
if (is1) { // ret == 1, don't bother squaring or multiplying it |
|
g[w].copyTo(r) |
|
is1 = false |
|
} else { |
|
while (n > 1) { |
|
z.sqrTo(r, r2) |
|
z.sqrTo(r2, r) |
|
n -= 2 |
|
} |
|
if (n > 0) z.sqrTo(r, r2) |
|
else { |
|
t = r |
|
r = r2 |
|
r2 = t |
|
} |
|
z.mulTo(r2, g[w], r) |
|
} |
|
|
|
while (j >= 0 && (e[j] & (1 << i)) == 0) { |
|
z.sqrTo(r, r2) |
|
t = r |
|
r = r2 |
|
r2 = t |
|
if (--i < 0) { |
|
i = this.DB - 1 |
|
--j |
|
} |
|
} |
|
} |
|
return z.revert(r) |
|
} |
|
|
|
// (public) gcd(this,a) (HAC 14.54) |
|
function bnGCD(a) { |
|
var x = (this.s < 0) ? this.negate() : this.clone() |
|
var y = (a.s < 0) ? a.negate() : a.clone() |
|
if (x.compareTo(y) < 0) { |
|
var t = x |
|
x = y |
|
y = t |
|
} |
|
var i = x.getLowestSetBit(), |
|
g = y.getLowestSetBit() |
|
if (g < 0) return x |
|
if (i < g) g = i |
|
if (g > 0) { |
|
x.rShiftTo(g, x) |
|
y.rShiftTo(g, y) |
|
} |
|
while (x.signum() > 0) { |
|
if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x) |
|
if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y) |
|
if (x.compareTo(y) >= 0) { |
|
x.subTo(y, x) |
|
x.rShiftTo(1, x) |
|
} else { |
|
y.subTo(x, y) |
|
y.rShiftTo(1, y) |
|
} |
|
} |
|
if (g > 0) y.lShiftTo(g, y) |
|
return y |
|
} |
|
|
|
// (protected) this % n, n < 2^26 |
|
function bnpModInt(n) { |
|
if (n <= 0) return 0 |
|
var d = this.DV % n, |
|
r = (this.s < 0) ? n - 1 : 0 |
|
if (this.t > 0) |
|
if (d == 0) r = this[0] % n |
|
else |
|
for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n |
|
return r |
|
} |
|
|
|
// (public) 1/this % m (HAC 14.61) |
|
function bnModInverse(m) { |
|
var ac = m.isEven() |
|
if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO |
|
var u = m.clone(), |
|
v = this.clone() |
|
var a = nbv(1), |
|
b = nbv(0), |
|
c = nbv(0), |
|
d = nbv(1) |
|
while (u.signum() != 0) { |
|
while (u.isEven()) { |
|
u.rShiftTo(1, u) |
|
if (ac) { |
|
if (!a.isEven() || !b.isEven()) { |
|
a.addTo(this, a) |
|
b.subTo(m, b) |
|
} |
|
a.rShiftTo(1, a) |
|
} else if (!b.isEven()) b.subTo(m, b) |
|
b.rShiftTo(1, b) |
|
} |
|
while (v.isEven()) { |
|
v.rShiftTo(1, v) |
|
if (ac) { |
|
if (!c.isEven() || !d.isEven()) { |
|
c.addTo(this, c) |
|
d.subTo(m, d) |
|
} |
|
c.rShiftTo(1, c) |
|
} else if (!d.isEven()) d.subTo(m, d) |
|
d.rShiftTo(1, d) |
|
} |
|
if (u.compareTo(v) >= 0) { |
|
u.subTo(v, u) |
|
if (ac) a.subTo(c, a) |
|
b.subTo(d, b) |
|
} else { |
|
v.subTo(u, v) |
|
if (ac) c.subTo(a, c) |
|
d.subTo(b, d) |
|
} |
|
} |
|
if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO |
|
if (d.compareTo(m) >= 0) return d.subtract(m) |
|
if (d.signum() < 0) d.addTo(m, d) |
|
else return d |
|
if (d.signum() < 0) return d.add(m) |
|
else return d |
|
} |
|
|
|
var lowprimes = [ |
|
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, |
|
73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, |
|
157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, |
|
239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, |
|
331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, |
|
421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, |
|
509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, |
|
613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, |
|
709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, |
|
821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, |
|
919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997 |
|
] |
|
|
|
var lplim = (1 << 26) / lowprimes[lowprimes.length - 1] |
|
|
|
// (public) test primality with certainty >= 1-.5^t |
|
function bnIsProbablePrime(t) { |
|
var i, x = this.abs() |
|
if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) { |
|
for (i = 0; i < lowprimes.length; ++i) |
|
if (x[0] == lowprimes[i]) return true |
|
return false |
|
} |
|
if (x.isEven()) return false |
|
i = 1 |
|
while (i < lowprimes.length) { |
|
var m = lowprimes[i], |
|
j = i + 1 |
|
while (j < lowprimes.length && m < lplim) m *= lowprimes[j++] |
|
m = x.modInt(m) |
|
while (i < j) if (m % lowprimes[i++] == 0) return false |
|
} |
|
return x.millerRabin(t) |
|
} |
|
|
|
// (protected) true if probably prime (HAC 4.24, Miller-Rabin) |
|
function bnpMillerRabin(t) { |
|
var n1 = this.subtract(BigInteger.ONE) |
|
var k = n1.getLowestSetBit() |
|
if (k <= 0) return false |
|
var r = n1.shiftRight(k) |
|
t = (t + 1) >> 1 |
|
if (t > lowprimes.length) t = lowprimes.length |
|
var a = new BigInteger(null) |
|
var j, bases = [] |
|
for (var i = 0; i < t; ++i) { |
|
for (;;) { |
|
j = lowprimes[Math.floor(Math.random() * lowprimes.length)] |
|
if (bases.indexOf(j) == -1) break |
|
} |
|
bases.push(j) |
|
a.fromInt(j) |
|
var y = a.modPow(r, this) |
|
if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) { |
|
var j = 1 |
|
while (j++ < k && y.compareTo(n1) != 0) { |
|
y = y.modPowInt(2, this) |
|
if (y.compareTo(BigInteger.ONE) == 0) return false |
|
} |
|
if (y.compareTo(n1) != 0) return false |
|
} |
|
} |
|
return true |
|
} |
|
|
|
// protected |
|
proto.chunkSize = bnpChunkSize |
|
proto.toRadix = bnpToRadix |
|
proto.fromRadix = bnpFromRadix |
|
proto.fromNumber = bnpFromNumber |
|
proto.bitwiseTo = bnpBitwiseTo |
|
proto.changeBit = bnpChangeBit |
|
proto.addTo = bnpAddTo |
|
proto.dMultiply = bnpDMultiply |
|
proto.dAddOffset = bnpDAddOffset |
|
proto.multiplyLowerTo = bnpMultiplyLowerTo |
|
proto.multiplyUpperTo = bnpMultiplyUpperTo |
|
proto.modInt = bnpModInt |
|
proto.millerRabin = bnpMillerRabin |
|
|
|
// public |
|
proto.clone = bnClone |
|
proto.intValue = bnIntValue |
|
proto.byteValue = bnByteValue |
|
proto.shortValue = bnShortValue |
|
proto.signum = bnSigNum |
|
proto.toByteArray = bnToByteArray |
|
proto.equals = bnEquals |
|
proto.min = bnMin |
|
proto.max = bnMax |
|
proto.and = bnAnd |
|
proto.or = bnOr |
|
proto.xor = bnXor |
|
proto.andNot = bnAndNot |
|
proto.not = bnNot |
|
proto.shiftLeft = bnShiftLeft |
|
proto.shiftRight = bnShiftRight |
|
proto.getLowestSetBit = bnGetLowestSetBit |
|
proto.bitCount = bnBitCount |
|
proto.testBit = bnTestBit |
|
proto.setBit = bnSetBit |
|
proto.clearBit = bnClearBit |
|
proto.flipBit = bnFlipBit |
|
proto.add = bnAdd |
|
proto.subtract = bnSubtract |
|
proto.multiply = bnMultiply |
|
proto.divide = bnDivide |
|
proto.remainder = bnRemainder |
|
proto.divideAndRemainder = bnDivideAndRemainder |
|
proto.modPow = bnModPow |
|
proto.modInverse = bnModInverse |
|
proto.pow = bnPow |
|
proto.gcd = bnGCD |
|
proto.isProbablePrime = bnIsProbablePrime |
|
|
|
// JSBN-specific extension |
|
proto.square = bnSquare |
|
|
|
// constants |
|
BigInteger.ZERO = nbv(0) |
|
BigInteger.ONE = nbv(1) |
|
BigInteger.valueOf = nbv |
|
|
|
module.exports = BigInteger |
|
|
|
},{"../package.json":8}],6:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// FIXME: Kind of a weird way to throw exceptions, consider removing |
|
var assert = require('assert') |
|
var BigInteger = require('./bigi') |
|
|
|
/** |
|
* Turns a byte array into a big integer. |
|
* |
|
* This function will interpret a byte array as a big integer in big |
|
* endian notation. |
|
*/ |
|
BigInteger.fromByteArrayUnsigned = function(byteArray) { |
|
// BigInteger expects a DER integer conformant byte array |
|
if (byteArray[0] & 0x80) { |
|
return new BigInteger([0].concat(byteArray)) |
|
} |
|
|
|
return new BigInteger(byteArray) |
|
} |
|
|
|
/** |
|
* Returns a byte array representation of the big integer. |
|
* |
|
* This returns the absolute of the contained value in big endian |
|
* form. A value of zero results in an empty array. |
|
*/ |
|
BigInteger.prototype.toByteArrayUnsigned = function() { |
|
var byteArray = this.toByteArray() |
|
return byteArray[0] === 0 ? byteArray.slice(1) : byteArray |
|
} |
|
|
|
BigInteger.fromDERInteger = function(byteArray) { |
|
return new BigInteger(byteArray) |
|
} |
|
|
|
/* |
|
* Converts BigInteger to a DER integer representation. |
|
* |
|
* The format for this value uses the most significant bit as a sign |
|
* bit. If the most significant bit is already set and the integer is |
|
* positive, a 0x00 is prepended. |
|
* |
|
* Examples: |
|
* |
|
* 0 => 0x00 |
|
* 1 => 0x01 |
|
* -1 => 0xff |
|
* 127 => 0x7f |
|
* -127 => 0x81 |
|
* 128 => 0x0080 |
|
* -128 => 0x80 |
|
* 255 => 0x00ff |
|
* -255 => 0xff01 |
|
* 16300 => 0x3fac |
|
* -16300 => 0xc054 |
|
* 62300 => 0x00f35c |
|
* -62300 => 0xff0ca4 |
|
*/ |
|
BigInteger.prototype.toDERInteger = BigInteger.prototype.toByteArray |
|
|
|
BigInteger.fromBuffer = function(buffer) { |
|
// BigInteger expects a DER integer conformant byte array |
|
if (buffer[0] & 0x80) { |
|
var byteArray = Array.prototype.slice.call(buffer) |
|
|
|
return new BigInteger([0].concat(byteArray)) |
|
} |
|
|
|
return new BigInteger(buffer) |
|
} |
|
|
|
BigInteger.fromHex = function(hex) { |
|
if (hex === '') return BigInteger.ZERO |
|
|
|
assert.equal(hex, hex.match(/^[A-Fa-f0-9]+/), 'Invalid hex string') |
|
assert.equal(hex.length % 2, 0, 'Incomplete hex') |
|
return new BigInteger(hex, 16) |
|
} |
|
|
|
BigInteger.prototype.toBuffer = function(size) { |
|
var byteArray = this.toByteArrayUnsigned() |
|
var zeros = [] |
|
|
|
var padding = size - byteArray.length |
|
while (zeros.length < padding) zeros.push(0) |
|
|
|
return new Buffer(zeros.concat(byteArray)) |
|
} |
|
|
|
BigInteger.prototype.toHex = function(size) { |
|
return this.toBuffer(size).toString('hex') |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./bigi":5,"assert":157,"buffer":172}],7:[function(require,module,exports){ |
|
var BigInteger = require('./bigi') |
|
|
|
//addons |
|
require('./convert') |
|
|
|
module.exports = BigInteger |
|
},{"./bigi":5,"./convert":6}],8:[function(require,module,exports){ |
|
module.exports={ |
|
"name": "bigi", |
|
"version": "1.4.0", |
|
"description": "Big integers.", |
|
"keywords": [ |
|
"cryptography", |
|
"math", |
|
"bitcoin", |
|
"arbitrary", |
|
"precision", |
|
"arithmetic", |
|
"big", |
|
"integer", |
|
"int", |
|
"number", |
|
"biginteger", |
|
"bigint", |
|
"bignumber", |
|
"decimal", |
|
"float" |
|
], |
|
"devDependencies": { |
|
"mocha": "^1.20.1", |
|
"jshint": "^2.5.1", |
|
"coveralls": "^2.10.0", |
|
"istanbul": "^0.2.11" |
|
}, |
|
"repository": { |
|
"url": "https://github.com/cryptocoinjs/bigi", |
|
"type": "git" |
|
}, |
|
"main": "./lib/index.js", |
|
"scripts": { |
|
"test": "_mocha -- test/*.js", |
|
"jshint": "jshint --config jshint.json lib/*.js ; true", |
|
"unit": "mocha", |
|
"coverage": "istanbul cover ./node_modules/.bin/_mocha -- --reporter list test/*.js", |
|
"coveralls": "npm run-script coverage && node ./node_modules/.bin/coveralls < coverage/lcov.info" |
|
}, |
|
"dependencies": {}, |
|
"testling": { |
|
"files": "test/*.js", |
|
"harness": "mocha", |
|
"browsers": [ |
|
"ie/9..latest", |
|
"firefox/latest", |
|
"chrome/latest", |
|
"safari/6.0..latest", |
|
"iphone/6.0..latest", |
|
"android-browser/4.2..latest" |
|
] |
|
}, |
|
"bugs": { |
|
"url": "https://github.com/cryptocoinjs/bigi/issues" |
|
}, |
|
"homepage": "https://github.com/cryptocoinjs/bigi", |
|
"_id": "bigi@1.4.0", |
|
"dist": { |
|
"shasum": "90ac1aeac0a531216463bdb58f42c1e05c8407ac", |
|
"tarball": "http://registry.npmjs.org/bigi/-/bigi-1.4.0.tgz" |
|
}, |
|
"_from": "bigi@>=1.4.0 <2.0.0", |
|
"_npmVersion": "1.4.3", |
|
"_npmUser": { |
|
"name": "jp", |
|
"email": "jprichardson@gmail.com" |
|
}, |
|
"maintainers": [ |
|
{ |
|
"name": "jp", |
|
"email": "jprichardson@gmail.com" |
|
}, |
|
{ |
|
"name": "midnightlightning", |
|
"email": "boydb@midnightdesign.ws" |
|
}, |
|
{ |
|
"name": "sidazhang", |
|
"email": "sidazhang89@gmail.com" |
|
}, |
|
{ |
|
"name": "nadav", |
|
"email": "npm@shesek.info" |
|
} |
|
], |
|
"directories": {}, |
|
"_shasum": "90ac1aeac0a531216463bdb58f42c1e05c8407ac", |
|
"_resolved": "https://registry.npmjs.org/bigi/-/bigi-1.4.0.tgz" |
|
} |
|
|
|
},{}],9:[function(require,module,exports){ |
|
(function (Buffer){ |
|
'use strict'; |
|
|
|
var base58 = require('bs58') |
|
var createHash = require('create-hash') |
|
|
|
// SHA256(SHA256(buffer)) |
|
function sha256x2(buffer) { |
|
buffer = createHash('sha256').update(buffer).digest() |
|
return createHash('sha256').update(buffer).digest() |
|
} |
|
|
|
// Encode a buffer as a base58-check encoded string |
|
function encode(payload) { |
|
var checksum = sha256x2(payload).slice(0, 4) |
|
|
|
return base58.encode(Buffer.concat([ |
|
payload, |
|
checksum |
|
])) |
|
} |
|
|
|
// Decode a base58-check encoded string to a buffer |
|
function decode(string) { |
|
var buffer = new Buffer(base58.decode(string)) |
|
|
|
var payload = buffer.slice(0, -4) |
|
var checksum = buffer.slice(-4) |
|
var newChecksum = sha256x2(payload).slice(0, 4) |
|
|
|
if (!Array.prototype.every.call(newChecksum, function(x, i) { |
|
return x === checksum[i] |
|
})) { |
|
throw new Error('Invalid checksum') |
|
} |
|
|
|
return payload |
|
} |
|
|
|
module.exports = { |
|
encode: encode, |
|
decode: decode |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"bs58":10,"buffer":172,"create-hash":11}],10:[function(require,module,exports){ |
|
// Base58 encoding/decoding |
|
// Originally written by Mike Hearn for BitcoinJ |
|
// Copyright (c) 2011 Google Inc |
|
// Ported to JavaScript by Stefan Thomas |
|
// Merged Buffer refactorings from base58-native by Stephen Pair |
|
// Copyright (c) 2013 BitPay Inc |
|
|
|
var ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' |
|
var ALPHABET_MAP = {} |
|
for(var i = 0; i < ALPHABET.length; i++) { |
|
ALPHABET_MAP[ALPHABET.charAt(i)] = i |
|
} |
|
var BASE = 58 |
|
|
|
function encode(buffer) { |
|
if (buffer.length === 0) return '' |
|
|
|
var i, j, digits = [0] |
|
for (i = 0; i < buffer.length; i++) { |
|
for (j = 0; j < digits.length; j++) digits[j] <<= 8 |
|
|
|
digits[0] += buffer[i] |
|
|
|
var carry = 0 |
|
for (j = 0; j < digits.length; ++j) { |
|
digits[j] += carry |
|
|
|
carry = (digits[j] / BASE) | 0 |
|
digits[j] %= BASE |
|
} |
|
|
|
while (carry) { |
|
digits.push(carry % BASE) |
|
|
|
carry = (carry / BASE) | 0 |
|
} |
|
} |
|
|
|
// deal with leading zeros |
|
for (i = 0; buffer[i] === 0 && i < buffer.length - 1; i++) digits.push(0) |
|
|
|
// convert digits to a string |
|
var stringOutput = "" |
|
for (var i = digits.length - 1; i >= 0; i--) { |
|
stringOutput = stringOutput + ALPHABET[digits[i]] |
|
} |
|
return stringOutput |
|
} |
|
|
|
function decode(string) { |
|
if (string.length === 0) return [] |
|
|
|
var i, j, bytes = [0] |
|
for (i = 0; i < string.length; i++) { |
|
var c = string[i] |
|
if (!(c in ALPHABET_MAP)) throw new Error('Non-base58 character') |
|
|
|
for (j = 0; j < bytes.length; j++) bytes[j] *= BASE |
|
bytes[0] += ALPHABET_MAP[c] |
|
|
|
var carry = 0 |
|
for (j = 0; j < bytes.length; ++j) { |
|
bytes[j] += carry |
|
|
|
carry = bytes[j] >> 8 |
|
bytes[j] &= 0xff |
|
} |
|
|
|
while (carry) { |
|
bytes.push(carry & 0xff) |
|
|
|
carry >>= 8 |
|
} |
|
} |
|
|
|
// deal with leading zeros |
|
for (i = 0; string[i] === '1' && i < string.length - 1; i++) bytes.push(0) |
|
|
|
return bytes.reverse() |
|
} |
|
|
|
module.exports = { |
|
encode: encode, |
|
decode: decode |
|
} |
|
|
|
},{}],11:[function(require,module,exports){ |
|
(function (Buffer){ |
|
'use strict'; |
|
var inherits = require('inherits') |
|
var md5 = require('./md5') |
|
var rmd160 = require('ripemd160') |
|
var sha = require('sha.js') |
|
|
|
var Transform = require('stream').Transform |
|
|
|
function HashNoConstructor(hash) { |
|
Transform.call(this) |
|
|
|
this._hash = hash |
|
this.buffers = [] |
|
} |
|
|
|
inherits(HashNoConstructor, Transform) |
|
|
|
HashNoConstructor.prototype._transform = function (data, _, next) { |
|
this.buffers.push(data) |
|
|
|
next() |
|
} |
|
|
|
HashNoConstructor.prototype._flush = function (next) { |
|
this.push(this.digest()) |
|
next() |
|
} |
|
|
|
HashNoConstructor.prototype.update = function (data, enc) { |
|
if (typeof data === 'string') { |
|
data = new Buffer(data, enc) |
|
} |
|
|
|
this.buffers.push(data) |
|
return this |
|
} |
|
|
|
HashNoConstructor.prototype.digest = function (enc) { |
|
var buf = Buffer.concat(this.buffers) |
|
var r = this._hash(buf) |
|
this.buffers = null |
|
|
|
return enc ? r.toString(enc) : r |
|
} |
|
|
|
function Hash(hash) { |
|
Transform.call(this) |
|
|
|
this._hash = hash |
|
} |
|
|
|
inherits(Hash, Transform) |
|
|
|
Hash.prototype._transform = function (data, enc, next) { |
|
if (enc) data = new Buffer(data, enc) |
|
|
|
this._hash.update(data) |
|
|
|
next() |
|
} |
|
|
|
Hash.prototype._flush = function (next) { |
|
this.push(this._hash.digest()) |
|
this._hash = null |
|
|
|
next() |
|
} |
|
|
|
Hash.prototype.update = function (data, enc) { |
|
if (typeof data === 'string') { |
|
data = new Buffer(data, enc) |
|
} |
|
|
|
this._hash.update(data) |
|
return this |
|
} |
|
|
|
Hash.prototype.digest = function (enc) { |
|
var outData = this._hash.digest() |
|
|
|
return enc ? outData.toString(enc) : outData |
|
} |
|
|
|
module.exports = function createHash (alg) { |
|
if ('md5' === alg) return new HashNoConstructor(md5) |
|
if ('rmd160' === alg) return new HashNoConstructor(rmd160) |
|
|
|
return new Hash(sha(alg)) |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./md5":13,"buffer":172,"inherits":14,"ripemd160":15,"sha.js":17,"stream":339}],12:[function(require,module,exports){ |
|
(function (Buffer){ |
|
'use strict'; |
|
var intSize = 4; |
|
var zeroBuffer = new Buffer(intSize); zeroBuffer.fill(0); |
|
var chrsz = 8; |
|
|
|
function toArray(buf, bigEndian) { |
|
if ((buf.length % intSize) !== 0) { |
|
var len = buf.length + (intSize - (buf.length % intSize)); |
|
buf = Buffer.concat([buf, zeroBuffer], len); |
|
} |
|
|
|
var arr = []; |
|
var fn = bigEndian ? buf.readInt32BE : buf.readInt32LE; |
|
for (var i = 0; i < buf.length; i += intSize) { |
|
arr.push(fn.call(buf, i)); |
|
} |
|
return arr; |
|
} |
|
|
|
function toBuffer(arr, size, bigEndian) { |
|
var buf = new Buffer(size); |
|
var fn = bigEndian ? buf.writeInt32BE : buf.writeInt32LE; |
|
for (var i = 0; i < arr.length; i++) { |
|
fn.call(buf, arr[i], i * 4, true); |
|
} |
|
return buf; |
|
} |
|
|
|
function hash(buf, fn, hashSize, bigEndian) { |
|
if (!Buffer.isBuffer(buf)) buf = new Buffer(buf); |
|
var arr = fn(toArray(buf, bigEndian), buf.length * chrsz); |
|
return toBuffer(arr, hashSize, bigEndian); |
|
} |
|
exports.hash = hash; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],13:[function(require,module,exports){ |
|
'use strict'; |
|
/* |
|
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message |
|
* Digest Algorithm, as defined in RFC 1321. |
|
* Version 2.1 Copyright (C) Paul Johnston 1999 - 2002. |
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet |
|
* Distributed under the BSD License |
|
* See http://pajhome.org.uk/crypt/md5 for more info. |
|
*/ |
|
|
|
var helpers = require('./helpers'); |
|
|
|
/* |
|
* Calculate the MD5 of an array of little-endian words, and a bit length |
|
*/ |
|
function core_md5(x, len) |
|
{ |
|
/* append padding */ |
|
x[len >> 5] |= 0x80 << ((len) % 32); |
|
x[(((len + 64) >>> 9) << 4) + 14] = len; |
|
|
|
var a = 1732584193; |
|
var b = -271733879; |
|
var c = -1732584194; |
|
var d = 271733878; |
|
|
|
for(var i = 0; i < x.length; i += 16) |
|
{ |
|
var olda = a; |
|
var oldb = b; |
|
var oldc = c; |
|
var oldd = d; |
|
|
|
a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); |
|
d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); |
|
c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); |
|
b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); |
|
a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); |
|
d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); |
|
c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); |
|
b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); |
|
a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); |
|
d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); |
|
c = md5_ff(c, d, a, b, x[i+10], 17, -42063); |
|
b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); |
|
a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); |
|
d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); |
|
c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); |
|
b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); |
|
|
|
a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); |
|
d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); |
|
c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); |
|
b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); |
|
a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); |
|
d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); |
|
c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); |
|
b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); |
|
a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); |
|
d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); |
|
c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); |
|
b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); |
|
a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); |
|
d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); |
|
c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); |
|
b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); |
|
|
|
a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); |
|
d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); |
|
c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); |
|
b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); |
|
a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); |
|
d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); |
|
c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); |
|
b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); |
|
a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); |
|
d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); |
|
c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); |
|
b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); |
|
a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); |
|
d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); |
|
c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); |
|
b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); |
|
|
|
a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); |
|
d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); |
|
c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); |
|
b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); |
|
a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); |
|
d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); |
|
c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); |
|
b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); |
|
a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); |
|
d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); |
|
c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); |
|
b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); |
|
a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); |
|
d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); |
|
c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); |
|
b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); |
|
|
|
a = safe_add(a, olda); |
|
b = safe_add(b, oldb); |
|
c = safe_add(c, oldc); |
|
d = safe_add(d, oldd); |
|
} |
|
return Array(a, b, c, d); |
|
|
|
} |
|
|
|
/* |
|
* These functions implement the four basic operations the algorithm uses. |
|
*/ |
|
function md5_cmn(q, a, b, x, s, t) |
|
{ |
|
return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b); |
|
} |
|
function md5_ff(a, b, c, d, x, s, t) |
|
{ |
|
return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t); |
|
} |
|
function md5_gg(a, b, c, d, x, s, t) |
|
{ |
|
return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t); |
|
} |
|
function md5_hh(a, b, c, d, x, s, t) |
|
{ |
|
return md5_cmn(b ^ c ^ d, a, b, x, s, t); |
|
} |
|
function md5_ii(a, b, c, d, x, s, t) |
|
{ |
|
return md5_cmn(c ^ (b | (~d)), a, b, x, s, t); |
|
} |
|
|
|
/* |
|
* Add integers, wrapping at 2^32. This uses 16-bit operations internally |
|
* to work around bugs in some JS interpreters. |
|
*/ |
|
function safe_add(x, y) |
|
{ |
|
var lsw = (x & 0xFFFF) + (y & 0xFFFF); |
|
var msw = (x >> 16) + (y >> 16) + (lsw >> 16); |
|
return (msw << 16) | (lsw & 0xFFFF); |
|
} |
|
|
|
/* |
|
* Bitwise rotate a 32-bit number to the left. |
|
*/ |
|
function bit_rol(num, cnt) |
|
{ |
|
return (num << cnt) | (num >>> (32 - cnt)); |
|
} |
|
|
|
module.exports = function md5(buf) { |
|
return helpers.hash(buf, core_md5, 16); |
|
}; |
|
},{"./helpers":12}],14:[function(require,module,exports){ |
|
if (typeof Object.create === 'function') { |
|
// implementation from standard node.js 'util' module |
|
module.exports = function inherits(ctor, superCtor) { |
|
ctor.super_ = superCtor |
|
ctor.prototype = Object.create(superCtor.prototype, { |
|
constructor: { |
|
value: ctor, |
|
enumerable: false, |
|
writable: true, |
|
configurable: true |
|
} |
|
}); |
|
}; |
|
} else { |
|
// old school shim for old browsers |
|
module.exports = function inherits(ctor, superCtor) { |
|
ctor.super_ = superCtor |
|
var TempCtor = function () {} |
|
TempCtor.prototype = superCtor.prototype |
|
ctor.prototype = new TempCtor() |
|
ctor.prototype.constructor = ctor |
|
} |
|
} |
|
|
|
},{}],15:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/* |
|
CryptoJS v3.1.2 |
|
code.google.com/p/crypto-js |
|
(c) 2009-2013 by Jeff Mott. All rights reserved. |
|
code.google.com/p/crypto-js/wiki/License |
|
*/ |
|
/** @preserve |
|
(c) 2012 by Cédric Mesnil. All rights reserved. |
|
|
|
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: |
|
|
|
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. |
|
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. |
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
*/ |
|
|
|
// constants table |
|
var zl = [ |
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, |
|
7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, |
|
3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, |
|
1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, |
|
4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13] |
|
|
|
var zr = [ |
|
5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, |
|
6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, |
|
15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, |
|
8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, |
|
12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11] |
|
|
|
var sl = [ |
|
11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, |
|
7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, |
|
11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, |
|
11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, |
|
9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ] |
|
|
|
var sr = [ |
|
8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, |
|
9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, |
|
9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, |
|
15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, |
|
8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ] |
|
|
|
|
|
var hl = [0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E] |
|
var hr = [0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000] |
|
|
|
function bytesToWords(bytes) { |
|
var words = [] |
|
for (var i = 0, b = 0; i < bytes.length; i++, b += 8) { |
|
words[b >>> 5] |= bytes[i] << (24 - b % 32) |
|
} |
|
return words |
|
} |
|
|
|
function wordsToBytes(words) { |
|
var bytes = [] |
|
for (var b = 0; b < words.length * 32; b += 8) { |
|
bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF) |
|
} |
|
return bytes |
|
} |
|
|
|
function processBlock(H, M, offset) { |
|
// swap endian |
|
for (var i = 0; i < 16; i++) { |
|
var offset_i = offset + i; |
|
var M_offset_i = M[offset_i] |
|
|
|
// Swap |
|
M[offset_i] = ( |
|
(((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) | |
|
(((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00) |
|
) |
|
} |
|
|
|
// Working variables |
|
var al, bl, cl, dl, el |
|
var ar, br, cr, dr, er |
|
|
|
ar = al = H[0] |
|
br = bl = H[1] |
|
cr = cl = H[2] |
|
dr = dl = H[3] |
|
er = el = H[4] |
|
|
|
// computation |
|
var t |
|
for (var i = 0; i < 80; i += 1) { |
|
t = (al + M[offset+zl[i]])|0 |
|
if (i<16){ |
|
t += f1(bl,cl,dl) + hl[0] |
|
} else if (i<32) { |
|
t += f2(bl,cl,dl) + hl[1] |
|
} else if (i<48) { |
|
t += f3(bl,cl,dl) + hl[2] |
|
} else if (i<64) { |
|
t += f4(bl,cl,dl) + hl[3] |
|
} else {// if (i<80) { |
|
t += f5(bl,cl,dl) + hl[4] |
|
} |
|
t = t|0 |
|
t = rotl(t,sl[i]) |
|
t = (t+el)|0 |
|
al = el |
|
el = dl |
|
dl = rotl(cl, 10) |
|
cl = bl |
|
bl = t |
|
|
|
t = (ar + M[offset+zr[i]])|0 |
|
if (i<16) { |
|
t += f5(br,cr,dr) + hr[0] |
|
} else if (i<32) { |
|
t += f4(br,cr,dr) + hr[1] |
|
} else if (i<48) { |
|
t += f3(br,cr,dr) + hr[2] |
|
} else if (i<64) { |
|
t += f2(br,cr,dr) + hr[3] |
|
} else {// if (i<80) { |
|
t += f1(br,cr,dr) + hr[4] |
|
} |
|
|
|
t = t|0 |
|
t = rotl(t,sr[i]) |
|
t = (t+er)|0 |
|
ar = er |
|
er = dr |
|
dr = rotl(cr, 10) |
|
cr = br |
|
br = t |
|
} |
|
|
|
// intermediate hash value |
|
t = (H[1] + cl + dr)|0 |
|
H[1] = (H[2] + dl + er)|0 |
|
H[2] = (H[3] + el + ar)|0 |
|
H[3] = (H[4] + al + br)|0 |
|
H[4] = (H[0] + bl + cr)|0 |
|
H[0] = t |
|
} |
|
|
|
function f1(x, y, z) { |
|
return ((x) ^ (y) ^ (z)) |
|
} |
|
|
|
function f2(x, y, z) { |
|
return (((x)&(y)) | ((~x)&(z))) |
|
} |
|
|
|
function f3(x, y, z) { |
|
return (((x) | (~(y))) ^ (z)) |
|
} |
|
|
|
function f4(x, y, z) { |
|
return (((x) & (z)) | ((y)&(~(z)))) |
|
} |
|
|
|
function f5(x, y, z) { |
|
return ((x) ^ ((y) |(~(z)))) |
|
} |
|
|
|
function rotl(x,n) { |
|
return (x<<n) | (x>>>(32-n)) |
|
} |
|
|
|
function ripemd160(message) { |
|
var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0] |
|
|
|
if (typeof message == 'string') |
|
message = new Buffer(message, 'utf8') |
|
|
|
var m = bytesToWords(message) |
|
|
|
var nBitsLeft = message.length * 8 |
|
var nBitsTotal = message.length * 8 |
|
|
|
// Add padding |
|
m[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32) |
|
m[(((nBitsLeft + 64) >>> 9) << 4) + 14] = ( |
|
(((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) | |
|
(((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00) |
|
) |
|
|
|
for (var i=0 ; i<m.length; i += 16) { |
|
processBlock(H, m, i) |
|
} |
|
|
|
// swap endian |
|
for (var i = 0; i < 5; i++) { |
|
// shortcut |
|
var H_i = H[i] |
|
|
|
// Swap |
|
H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) | |
|
(((H_i << 24) | (H_i >>> 8)) & 0xff00ff00) |
|
} |
|
|
|
var digestbytes = wordsToBytes(H) |
|
return new Buffer(digestbytes) |
|
} |
|
|
|
module.exports = ripemd160 |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],16:[function(require,module,exports){ |
|
(function (Buffer){ |
|
//prototype class for hash functions |
|
function Hash (blockSize, finalSize) { |
|
this._block = new Buffer(blockSize) //new Uint32Array(blockSize/4) |
|
this._finalSize = finalSize |
|
this._blockSize = blockSize |
|
this._len = 0 |
|
this._s = 0 |
|
} |
|
|
|
Hash.prototype.update = function (data, enc) { |
|
if ("string" === typeof data) { |
|
enc = enc || "utf8" |
|
data = new Buffer(data, enc) |
|
} |
|
|
|
var l = this._len += data.length |
|
var s = this._s || 0 |
|
var f = 0 |
|
var buffer = this._block |
|
|
|
while (s < l) { |
|
var t = Math.min(data.length, f + this._blockSize - (s % this._blockSize)) |
|
var ch = (t - f) |
|
|
|
for (var i = 0; i < ch; i++) { |
|
buffer[(s % this._blockSize) + i] = data[i + f] |
|
} |
|
|
|
s += ch |
|
f += ch |
|
|
|
if ((s % this._blockSize) === 0) { |
|
this._update(buffer) |
|
} |
|
} |
|
this._s = s |
|
|
|
return this |
|
} |
|
|
|
Hash.prototype.digest = function (enc) { |
|
// Suppose the length of the message M, in bits, is l |
|
var l = this._len * 8 |
|
|
|
// Append the bit 1 to the end of the message |
|
this._block[this._len % this._blockSize] = 0x80 |
|
|
|
// and then k zero bits, where k is the smallest non-negative solution to the equation (l + 1 + k) === finalSize mod blockSize |
|
this._block.fill(0, this._len % this._blockSize + 1) |
|
|
|
if (l % (this._blockSize * 8) >= this._finalSize * 8) { |
|
this._update(this._block) |
|
this._block.fill(0) |
|
} |
|
|
|
// to this append the block which is equal to the number l written in binary |
|
// TODO: handle case where l is > Math.pow(2, 29) |
|
this._block.writeInt32BE(l, this._blockSize - 4) |
|
|
|
var hash = this._update(this._block) || this._hash() |
|
|
|
return enc ? hash.toString(enc) : hash |
|
} |
|
|
|
Hash.prototype._update = function () { |
|
throw new Error('_update must be implemented by subclass') |
|
} |
|
|
|
module.exports = Hash |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],17:[function(require,module,exports){ |
|
var exports = module.exports = function (alg) { |
|
var Alg = exports[alg.toLowerCase()] |
|
if(!Alg) throw new Error(alg + ' is not supported (we accept pull requests)') |
|
return new Alg() |
|
} |
|
|
|
|
|
exports.sha = require('./sha') |
|
exports.sha1 = require('./sha1') |
|
exports.sha224 = require('./sha224') |
|
exports.sha256 = require('./sha256') |
|
exports.sha384 = require('./sha384') |
|
exports.sha512 = require('./sha512') |
|
|
|
},{"./sha":18,"./sha1":19,"./sha224":20,"./sha256":21,"./sha384":22,"./sha512":23}],18:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/* |
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined |
|
* in FIPS PUB 180-1 |
|
* This source code is derived from sha1.js of the same repository. |
|
* The difference between SHA-0 and SHA-1 is just a bitwise rotate left |
|
* operation was added. |
|
*/ |
|
|
|
var inherits = require('inherits') |
|
var Hash = require('./hash') |
|
|
|
var W = new Array(80) |
|
|
|
function Sha() { |
|
this.init() |
|
this._w = W |
|
|
|
Hash.call(this, 64, 56) |
|
} |
|
|
|
inherits(Sha, Hash) |
|
|
|
Sha.prototype.init = function () { |
|
this._a = 0x67452301 |
|
this._b = 0xefcdab89 |
|
this._c = 0x98badcfe |
|
this._d = 0x10325476 |
|
this._e = 0xc3d2e1f0 |
|
|
|
return this |
|
} |
|
|
|
/* |
|
* Bitwise rotate a 32-bit number to the left. |
|
*/ |
|
function rol(num, cnt) { |
|
return (num << cnt) | (num >>> (32 - cnt)); |
|
} |
|
|
|
Sha.prototype._update = function (M) { |
|
var W = this._w |
|
|
|
var a = this._a |
|
var b = this._b |
|
var c = this._c |
|
var d = this._d |
|
var e = this._e |
|
|
|
var j = 0, k |
|
|
|
/* |
|
* SHA-1 has a bitwise rotate left operation. But, SHA is not |
|
* function calcW() { return rol(W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16], 1) } |
|
*/ |
|
function calcW() { return W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16] } |
|
function loop(w, f) { |
|
W[j] = w |
|
|
|
var t = rol(a, 5) + f + e + w + k |
|
|
|
e = d |
|
d = c |
|
c = rol(b, 30) |
|
b = a |
|
a = t |
|
j++ |
|
} |
|
|
|
k = 1518500249 |
|
while (j < 16) loop(M.readInt32BE(j * 4), (b & c) | ((~b) & d)) |
|
while (j < 20) loop(calcW(), (b & c) | ((~b) & d)) |
|
k = 1859775393 |
|
while (j < 40) loop(calcW(), b ^ c ^ d) |
|
k = -1894007588 |
|
while (j < 60) loop(calcW(), (b & c) | (b & d) | (c & d)) |
|
k = -899497514 |
|
while (j < 80) loop(calcW(), b ^ c ^ d) |
|
|
|
this._a = (a + this._a) | 0 |
|
this._b = (b + this._b) | 0 |
|
this._c = (c + this._c) | 0 |
|
this._d = (d + this._d) | 0 |
|
this._e = (e + this._e) | 0 |
|
} |
|
|
|
Sha.prototype._hash = function () { |
|
var H = new Buffer(20) |
|
|
|
H.writeInt32BE(this._a|0, 0) |
|
H.writeInt32BE(this._b|0, 4) |
|
H.writeInt32BE(this._c|0, 8) |
|
H.writeInt32BE(this._d|0, 12) |
|
H.writeInt32BE(this._e|0, 16) |
|
|
|
return H |
|
} |
|
|
|
module.exports = Sha |
|
|
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./hash":16,"buffer":172,"inherits":14}],19:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/* |
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined |
|
* in FIPS PUB 180-1 |
|
* Version 2.1a Copyright Paul Johnston 2000 - 2002. |
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet |
|
* Distributed under the BSD License |
|
* See http://pajhome.org.uk/crypt/md5 for details. |
|
*/ |
|
|
|
var inherits = require('inherits') |
|
var Hash = require('./hash') |
|
|
|
var W = new Array(80) |
|
|
|
function Sha1() { |
|
this.init() |
|
this._w = W |
|
|
|
Hash.call(this, 64, 56) |
|
} |
|
|
|
inherits(Sha1, Hash) |
|
|
|
Sha1.prototype.init = function () { |
|
this._a = 0x67452301 |
|
this._b = 0xefcdab89 |
|
this._c = 0x98badcfe |
|
this._d = 0x10325476 |
|
this._e = 0xc3d2e1f0 |
|
|
|
return this |
|
} |
|
|
|
/* |
|
* Bitwise rotate a 32-bit number to the left. |
|
*/ |
|
function rol(num, cnt) { |
|
return (num << cnt) | (num >>> (32 - cnt)); |
|
} |
|
|
|
Sha1.prototype._update = function (M) { |
|
var W = this._w |
|
|
|
var a = this._a |
|
var b = this._b |
|
var c = this._c |
|
var d = this._d |
|
var e = this._e |
|
|
|
var j = 0, k |
|
|
|
function calcW() { return rol(W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16], 1) } |
|
function loop(w, f) { |
|
W[j] = w |
|
|
|
var t = rol(a, 5) + f + e + w + k |
|
|
|
e = d |
|
d = c |
|
c = rol(b, 30) |
|
b = a |
|
a = t |
|
j++ |
|
} |
|
|
|
k = 1518500249 |
|
while (j < 16) loop(M.readInt32BE(j * 4), (b & c) | ((~b) & d)) |
|
while (j < 20) loop(calcW(), (b & c) | ((~b) & d)) |
|
k = 1859775393 |
|
while (j < 40) loop(calcW(), b ^ c ^ d) |
|
k = -1894007588 |
|
while (j < 60) loop(calcW(), (b & c) | (b & d) | (c & d)) |
|
k = -899497514 |
|
while (j < 80) loop(calcW(), b ^ c ^ d) |
|
|
|
this._a = (a + this._a) | 0 |
|
this._b = (b + this._b) | 0 |
|
this._c = (c + this._c) | 0 |
|
this._d = (d + this._d) | 0 |
|
this._e = (e + this._e) | 0 |
|
} |
|
|
|
Sha1.prototype._hash = function () { |
|
var H = new Buffer(20) |
|
|
|
H.writeInt32BE(this._a|0, 0) |
|
H.writeInt32BE(this._b|0, 4) |
|
H.writeInt32BE(this._c|0, 8) |
|
H.writeInt32BE(this._d|0, 12) |
|
H.writeInt32BE(this._e|0, 16) |
|
|
|
return H |
|
} |
|
|
|
module.exports = Sha1 |
|
|
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./hash":16,"buffer":172,"inherits":14}],20:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/** |
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined |
|
* in FIPS 180-2 |
|
* Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009. |
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet |
|
* |
|
*/ |
|
|
|
var inherits = require('inherits') |
|
var SHA256 = require('./sha256') |
|
var Hash = require('./hash') |
|
|
|
var W = new Array(64) |
|
|
|
function Sha224() { |
|
this.init() |
|
|
|
this._w = W // new Array(64) |
|
|
|
Hash.call(this, 64, 56) |
|
} |
|
|
|
inherits(Sha224, SHA256) |
|
|
|
Sha224.prototype.init = function () { |
|
this._a = 0xc1059ed8|0 |
|
this._b = 0x367cd507|0 |
|
this._c = 0x3070dd17|0 |
|
this._d = 0xf70e5939|0 |
|
this._e = 0xffc00b31|0 |
|
this._f = 0x68581511|0 |
|
this._g = 0x64f98fa7|0 |
|
this._h = 0xbefa4fa4|0 |
|
|
|
return this |
|
} |
|
|
|
Sha224.prototype._hash = function () { |
|
var H = new Buffer(28) |
|
|
|
H.writeInt32BE(this._a, 0) |
|
H.writeInt32BE(this._b, 4) |
|
H.writeInt32BE(this._c, 8) |
|
H.writeInt32BE(this._d, 12) |
|
H.writeInt32BE(this._e, 16) |
|
H.writeInt32BE(this._f, 20) |
|
H.writeInt32BE(this._g, 24) |
|
|
|
return H |
|
} |
|
|
|
module.exports = Sha224 |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./hash":16,"./sha256":21,"buffer":172,"inherits":14}],21:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/** |
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined |
|
* in FIPS 180-2 |
|
* Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009. |
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet |
|
* |
|
*/ |
|
|
|
var inherits = require('inherits') |
|
var Hash = require('./hash') |
|
|
|
var K = [ |
|
0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, |
|
0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5, |
|
0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, |
|
0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, |
|
0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC, |
|
0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA, |
|
0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, |
|
0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967, |
|
0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, |
|
0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, |
|
0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, |
|
0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070, |
|
0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, |
|
0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3, |
|
0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, |
|
0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2 |
|
] |
|
|
|
var W = new Array(64) |
|
|
|
function Sha256() { |
|
this.init() |
|
|
|
this._w = W // new Array(64) |
|
|
|
Hash.call(this, 64, 56) |
|
} |
|
|
|
inherits(Sha256, Hash) |
|
|
|
Sha256.prototype.init = function () { |
|
this._a = 0x6a09e667|0 |
|
this._b = 0xbb67ae85|0 |
|
this._c = 0x3c6ef372|0 |
|
this._d = 0xa54ff53a|0 |
|
this._e = 0x510e527f|0 |
|
this._f = 0x9b05688c|0 |
|
this._g = 0x1f83d9ab|0 |
|
this._h = 0x5be0cd19|0 |
|
|
|
return this |
|
} |
|
|
|
function S (X, n) { |
|
return (X >>> n) | (X << (32 - n)); |
|
} |
|
|
|
function R (X, n) { |
|
return (X >>> n); |
|
} |
|
|
|
function Ch (x, y, z) { |
|
return ((x & y) ^ ((~x) & z)); |
|
} |
|
|
|
function Maj (x, y, z) { |
|
return ((x & y) ^ (x & z) ^ (y & z)); |
|
} |
|
|
|
function Sigma0256 (x) { |
|
return (S(x, 2) ^ S(x, 13) ^ S(x, 22)); |
|
} |
|
|
|
function Sigma1256 (x) { |
|
return (S(x, 6) ^ S(x, 11) ^ S(x, 25)); |
|
} |
|
|
|
function Gamma0256 (x) { |
|
return (S(x, 7) ^ S(x, 18) ^ R(x, 3)); |
|
} |
|
|
|
function Gamma1256 (x) { |
|
return (S(x, 17) ^ S(x, 19) ^ R(x, 10)); |
|
} |
|
|
|
Sha256.prototype._update = function(M) { |
|
var W = this._w |
|
|
|
var a = this._a | 0 |
|
var b = this._b | 0 |
|
var c = this._c | 0 |
|
var d = this._d | 0 |
|
var e = this._e | 0 |
|
var f = this._f | 0 |
|
var g = this._g | 0 |
|
var h = this._h | 0 |
|
|
|
var j = 0 |
|
|
|
function calcW() { return Gamma1256(W[j - 2]) + W[j - 7] + Gamma0256(W[j - 15]) + W[j - 16] } |
|
function loop(w) { |
|
W[j] = w |
|
|
|
var T1 = h + Sigma1256(e) + Ch(e, f, g) + K[j] + w |
|
var T2 = Sigma0256(a) + Maj(a, b, c); |
|
|
|
h = g; |
|
g = f; |
|
f = e; |
|
e = d + T1; |
|
d = c; |
|
c = b; |
|
b = a; |
|
a = T1 + T2; |
|
|
|
j++ |
|
} |
|
|
|
while (j < 16) loop(M.readInt32BE(j * 4)) |
|
while (j < 64) loop(calcW()) |
|
|
|
this._a = (a + this._a) | 0 |
|
this._b = (b + this._b) | 0 |
|
this._c = (c + this._c) | 0 |
|
this._d = (d + this._d) | 0 |
|
this._e = (e + this._e) | 0 |
|
this._f = (f + this._f) | 0 |
|
this._g = (g + this._g) | 0 |
|
this._h = (h + this._h) | 0 |
|
}; |
|
|
|
Sha256.prototype._hash = function () { |
|
var H = new Buffer(32) |
|
|
|
H.writeInt32BE(this._a, 0) |
|
H.writeInt32BE(this._b, 4) |
|
H.writeInt32BE(this._c, 8) |
|
H.writeInt32BE(this._d, 12) |
|
H.writeInt32BE(this._e, 16) |
|
H.writeInt32BE(this._f, 20) |
|
H.writeInt32BE(this._g, 24) |
|
H.writeInt32BE(this._h, 28) |
|
|
|
return H |
|
} |
|
|
|
module.exports = Sha256 |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./hash":16,"buffer":172,"inherits":14}],22:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var inherits = require('inherits') |
|
var SHA512 = require('./sha512'); |
|
var Hash = require('./hash') |
|
|
|
var W = new Array(160) |
|
|
|
function Sha384() { |
|
this.init() |
|
this._w = W |
|
|
|
Hash.call(this, 128, 112) |
|
} |
|
|
|
inherits(Sha384, SHA512) |
|
|
|
Sha384.prototype.init = function () { |
|
this._a = 0xcbbb9d5d|0 |
|
this._b = 0x629a292a|0 |
|
this._c = 0x9159015a|0 |
|
this._d = 0x152fecd8|0 |
|
this._e = 0x67332667|0 |
|
this._f = 0x8eb44a87|0 |
|
this._g = 0xdb0c2e0d|0 |
|
this._h = 0x47b5481d|0 |
|
|
|
this._al = 0xc1059ed8|0 |
|
this._bl = 0x367cd507|0 |
|
this._cl = 0x3070dd17|0 |
|
this._dl = 0xf70e5939|0 |
|
this._el = 0xffc00b31|0 |
|
this._fl = 0x68581511|0 |
|
this._gl = 0x64f98fa7|0 |
|
this._hl = 0xbefa4fa4|0 |
|
|
|
return this |
|
} |
|
|
|
Sha384.prototype._hash = function () { |
|
var H = new Buffer(48) |
|
|
|
function writeInt64BE(h, l, offset) { |
|
H.writeInt32BE(h, offset) |
|
H.writeInt32BE(l, offset + 4) |
|
} |
|
|
|
writeInt64BE(this._a, this._al, 0) |
|
writeInt64BE(this._b, this._bl, 8) |
|
writeInt64BE(this._c, this._cl, 16) |
|
writeInt64BE(this._d, this._dl, 24) |
|
writeInt64BE(this._e, this._el, 32) |
|
writeInt64BE(this._f, this._fl, 40) |
|
|
|
return H |
|
} |
|
|
|
module.exports = Sha384 |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./hash":16,"./sha512":23,"buffer":172,"inherits":14}],23:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var inherits = require('inherits') |
|
var Hash = require('./hash') |
|
|
|
var K = [ |
|
0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, |
|
0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, |
|
0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, |
|
0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, |
|
0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, |
|
0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, |
|
0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, |
|
0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, |
|
0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, |
|
0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, |
|
0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, |
|
0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, |
|
0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, |
|
0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, |
|
0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, |
|
0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, |
|
0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, |
|
0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, |
|
0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, |
|
0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, |
|
0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, |
|
0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, |
|
0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, |
|
0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, |
|
0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, |
|
0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, |
|
0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, |
|
0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, |
|
0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, |
|
0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, |
|
0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, |
|
0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, |
|
0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, |
|
0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, |
|
0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, |
|
0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, |
|
0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, |
|
0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, |
|
0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, |
|
0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817 |
|
] |
|
|
|
var W = new Array(160) |
|
|
|
function Sha512() { |
|
this.init() |
|
this._w = W |
|
|
|
Hash.call(this, 128, 112) |
|
} |
|
|
|
inherits(Sha512, Hash) |
|
|
|
Sha512.prototype.init = function () { |
|
this._a = 0x6a09e667|0 |
|
this._b = 0xbb67ae85|0 |
|
this._c = 0x3c6ef372|0 |
|
this._d = 0xa54ff53a|0 |
|
this._e = 0x510e527f|0 |
|
this._f = 0x9b05688c|0 |
|
this._g = 0x1f83d9ab|0 |
|
this._h = 0x5be0cd19|0 |
|
|
|
this._al = 0xf3bcc908|0 |
|
this._bl = 0x84caa73b|0 |
|
this._cl = 0xfe94f82b|0 |
|
this._dl = 0x5f1d36f1|0 |
|
this._el = 0xade682d1|0 |
|
this._fl = 0x2b3e6c1f|0 |
|
this._gl = 0xfb41bd6b|0 |
|
this._hl = 0x137e2179|0 |
|
|
|
return this |
|
} |
|
|
|
function S (X, Xl, n) { |
|
return (X >>> n) | (Xl << (32 - n)) |
|
} |
|
|
|
function Ch (x, y, z) { |
|
return ((x & y) ^ ((~x) & z)); |
|
} |
|
|
|
function Maj (x, y, z) { |
|
return ((x & y) ^ (x & z) ^ (y & z)); |
|
} |
|
|
|
Sha512.prototype._update = function(M) { |
|
var W = this._w |
|
|
|
var a = this._a | 0 |
|
var b = this._b | 0 |
|
var c = this._c | 0 |
|
var d = this._d | 0 |
|
var e = this._e | 0 |
|
var f = this._f | 0 |
|
var g = this._g | 0 |
|
var h = this._h | 0 |
|
|
|
var al = this._al | 0 |
|
var bl = this._bl | 0 |
|
var cl = this._cl | 0 |
|
var dl = this._dl | 0 |
|
var el = this._el | 0 |
|
var fl = this._fl | 0 |
|
var gl = this._gl | 0 |
|
var hl = this._hl | 0 |
|
|
|
var i = 0, j = 0 |
|
var Wi, Wil |
|
function calcW() { |
|
var x = W[j - 15*2] |
|
var xl = W[j - 15*2 + 1] |
|
var gamma0 = S(x, xl, 1) ^ S(x, xl, 8) ^ (x >>> 7) |
|
var gamma0l = S(xl, x, 1) ^ S(xl, x, 8) ^ S(xl, x, 7) |
|
|
|
x = W[j - 2*2] |
|
xl = W[j - 2*2 + 1] |
|
var gamma1 = S(x, xl, 19) ^ S(xl, x, 29) ^ (x >>> 6) |
|
var gamma1l = S(xl, x, 19) ^ S(x, xl, 29) ^ S(xl, x, 6) |
|
|
|
// W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16] |
|
var Wi7 = W[j - 7*2] |
|
var Wi7l = W[j - 7*2 + 1] |
|
|
|
var Wi16 = W[j - 16*2] |
|
var Wi16l = W[j - 16*2 + 1] |
|
|
|
Wil = gamma0l + Wi7l |
|
Wi = gamma0 + Wi7 + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0) |
|
Wil = Wil + gamma1l |
|
Wi = Wi + gamma1 + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0) |
|
Wil = Wil + Wi16l |
|
Wi = Wi + Wi16 + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0) |
|
} |
|
|
|
function loop() { |
|
W[j] = Wi |
|
W[j + 1] = Wil |
|
|
|
var maj = Maj(a, b, c) |
|
var majl = Maj(al, bl, cl) |
|
|
|
var sigma0h = S(a, al, 28) ^ S(al, a, 2) ^ S(al, a, 7) |
|
var sigma0l = S(al, a, 28) ^ S(a, al, 2) ^ S(a, al, 7) |
|
var sigma1h = S(e, el, 14) ^ S(e, el, 18) ^ S(el, e, 9) |
|
var sigma1l = S(el, e, 14) ^ S(el, e, 18) ^ S(e, el, 9) |
|
|
|
// t1 = h + sigma1 + ch + K[i] + W[i] |
|
var Ki = K[j] |
|
var Kil = K[j + 1] |
|
|
|
var ch = Ch(e, f, g) |
|
var chl = Ch(el, fl, gl) |
|
|
|
var t1l = hl + sigma1l |
|
var t1 = h + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0) |
|
t1l = t1l + chl |
|
t1 = t1 + ch + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0) |
|
t1l = t1l + Kil |
|
t1 = t1 + Ki + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0) |
|
t1l = t1l + Wil |
|
t1 = t1 + Wi + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0) |
|
|
|
// t2 = sigma0 + maj |
|
var t2l = sigma0l + majl |
|
var t2 = sigma0h + maj + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0) |
|
|
|
h = g |
|
hl = gl |
|
g = f |
|
gl = fl |
|
f = e |
|
fl = el |
|
el = (dl + t1l) | 0 |
|
e = (d + t1 + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0 |
|
d = c |
|
dl = cl |
|
c = b |
|
cl = bl |
|
b = a |
|
bl = al |
|
al = (t1l + t2l) | 0 |
|
a = (t1 + t2 + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0 |
|
|
|
i++ |
|
j += 2 |
|
} |
|
|
|
while (i < 16) { |
|
Wi = M.readInt32BE(j * 4) |
|
Wil = M.readInt32BE(j * 4 + 4) |
|
|
|
loop() |
|
} |
|
|
|
while (i < 80) { |
|
calcW() |
|
loop() |
|
} |
|
|
|
this._al = (this._al + al) | 0 |
|
this._bl = (this._bl + bl) | 0 |
|
this._cl = (this._cl + cl) | 0 |
|
this._dl = (this._dl + dl) | 0 |
|
this._el = (this._el + el) | 0 |
|
this._fl = (this._fl + fl) | 0 |
|
this._gl = (this._gl + gl) | 0 |
|
this._hl = (this._hl + hl) | 0 |
|
|
|
this._a = (this._a + a + ((this._al >>> 0) < (al >>> 0) ? 1 : 0)) | 0 |
|
this._b = (this._b + b + ((this._bl >>> 0) < (bl >>> 0) ? 1 : 0)) | 0 |
|
this._c = (this._c + c + ((this._cl >>> 0) < (cl >>> 0) ? 1 : 0)) | 0 |
|
this._d = (this._d + d + ((this._dl >>> 0) < (dl >>> 0) ? 1 : 0)) | 0 |
|
this._e = (this._e + e + ((this._el >>> 0) < (el >>> 0) ? 1 : 0)) | 0 |
|
this._f = (this._f + f + ((this._fl >>> 0) < (fl >>> 0) ? 1 : 0)) | 0 |
|
this._g = (this._g + g + ((this._gl >>> 0) < (gl >>> 0) ? 1 : 0)) | 0 |
|
this._h = (this._h + h + ((this._hl >>> 0) < (hl >>> 0) ? 1 : 0)) | 0 |
|
} |
|
|
|
Sha512.prototype._hash = function () { |
|
var H = new Buffer(64) |
|
|
|
function writeInt64BE(h, l, offset) { |
|
H.writeInt32BE(h, offset) |
|
H.writeInt32BE(l, offset + 4) |
|
} |
|
|
|
writeInt64BE(this._a, this._al, 0) |
|
writeInt64BE(this._b, this._bl, 8) |
|
writeInt64BE(this._c, this._cl, 16) |
|
writeInt64BE(this._d, this._dl, 24) |
|
writeInt64BE(this._e, this._el, 32) |
|
writeInt64BE(this._f, this._fl, 40) |
|
writeInt64BE(this._g, this._gl, 48) |
|
writeInt64BE(this._h, this._hl, 56) |
|
|
|
return H |
|
} |
|
|
|
module.exports = Sha512 |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./hash":16,"buffer":172,"inherits":14}],24:[function(require,module,exports){ |
|
(function (Buffer){ |
|
'use strict'; |
|
var createHash = require('create-hash/browser'); |
|
var inherits = require('inherits') |
|
|
|
var Transform = require('stream').Transform |
|
|
|
var ZEROS = new Buffer(128) |
|
ZEROS.fill(0) |
|
|
|
function Hmac(alg, key) { |
|
Transform.call(this) |
|
|
|
if (typeof key === 'string') { |
|
key = new Buffer(key) |
|
} |
|
|
|
var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64 |
|
|
|
this._alg = alg |
|
this._key = key |
|
|
|
if (key.length > blocksize) { |
|
key = createHash(alg).update(key).digest() |
|
|
|
} else if (key.length < blocksize) { |
|
key = Buffer.concat([key, ZEROS], blocksize) |
|
} |
|
|
|
var ipad = this._ipad = new Buffer(blocksize) |
|
var opad = this._opad = new Buffer(blocksize) |
|
|
|
for (var i = 0; i < blocksize; i++) { |
|
ipad[i] = key[i] ^ 0x36 |
|
opad[i] = key[i] ^ 0x5C |
|
} |
|
|
|
this._hash = createHash(alg).update(ipad) |
|
} |
|
|
|
inherits(Hmac, Transform) |
|
|
|
Hmac.prototype.update = function (data, enc) { |
|
this._hash.update(data, enc) |
|
|
|
return this |
|
} |
|
|
|
Hmac.prototype._transform = function (data, _, next) { |
|
this._hash.update(data) |
|
|
|
next() |
|
} |
|
|
|
Hmac.prototype._flush = function (next) { |
|
this.push(this.digest()) |
|
|
|
next() |
|
} |
|
|
|
Hmac.prototype.digest = function (enc) { |
|
var h = this._hash.digest() |
|
|
|
return createHash(this._alg).update(this._opad).update(h).digest(enc) |
|
} |
|
|
|
module.exports = function createHmac(alg, key) { |
|
return new Hmac(alg, key) |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"create-hash/browser":11,"inherits":25,"stream":339}],25:[function(require,module,exports){ |
|
arguments[4][14][0].apply(exports,arguments) |
|
},{"dup":14}],26:[function(require,module,exports){ |
|
var assert = require('assert') |
|
var BigInteger = require('bigi') |
|
|
|
var Point = require('./point') |
|
|
|
function Curve(p, a, b, Gx, Gy, n, h) { |
|
this.p = p |
|
this.a = a |
|
this.b = b |
|
this.G = Point.fromAffine(this, Gx, Gy) |
|
this.n = n |
|
this.h = h |
|
|
|
this.infinity = new Point(this, null, null, BigInteger.ZERO) |
|
|
|
// result caching |
|
this.pOverFour = p.add(BigInteger.ONE).shiftRight(2) |
|
} |
|
|
|
Curve.prototype.pointFromX = function(isOdd, x) { |
|
var alpha = x.pow(3).add(this.a.multiply(x)).add(this.b).mod(this.p) |
|
var beta = alpha.modPow(this.pOverFour, this.p) // XXX: not compatible with all curves |
|
|
|
var y = beta |
|
if (beta.isEven() ^ !isOdd) { |
|
y = this.p.subtract(y) // -y % p |
|
} |
|
|
|
return Point.fromAffine(this, x, y) |
|
} |
|
|
|
Curve.prototype.isInfinity = function(Q) { |
|
if (Q === this.infinity) return true |
|
|
|
return Q.z.signum() === 0 && Q.y.signum() !== 0 |
|
} |
|
|
|
Curve.prototype.isOnCurve = function(Q) { |
|
if (this.isInfinity(Q)) return true |
|
|
|
var x = Q.affineX |
|
var y = Q.affineY |
|
var a = this.a |
|
var b = this.b |
|
var p = this.p |
|
|
|
// Check that xQ and yQ are integers in the interval [0, p - 1] |
|
if (x.signum() < 0 || x.compareTo(p) >= 0) return false |
|
if (y.signum() < 0 || y.compareTo(p) >= 0) return false |
|
|
|
// and check that y^2 = x^3 + ax + b (mod p) |
|
var lhs = y.square().mod(p) |
|
var rhs = x.pow(3).add(a.multiply(x)).add(b).mod(p) |
|
return lhs.equals(rhs) |
|
} |
|
|
|
/** |
|
* Validate an elliptic curve point. |
|
* |
|
* See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive |
|
*/ |
|
Curve.prototype.validate = function(Q) { |
|
// Check Q != O |
|
assert(!this.isInfinity(Q), 'Point is at infinity') |
|
assert(this.isOnCurve(Q), 'Point is not on the curve') |
|
|
|
// Check nQ = O (where Q is a scalar multiple of G) |
|
var nQ = Q.multiply(this.n) |
|
assert(this.isInfinity(nQ), 'Point is not a scalar multiple of G') |
|
|
|
return true |
|
} |
|
|
|
module.exports = Curve |
|
|
|
},{"./point":30,"assert":157,"bigi":7}],27:[function(require,module,exports){ |
|
module.exports={ |
|
"secp128r1": { |
|
"p": "fffffffdffffffffffffffffffffffff", |
|
"a": "fffffffdfffffffffffffffffffffffc", |
|
"b": "e87579c11079f43dd824993c2cee5ed3", |
|
"n": "fffffffe0000000075a30d1b9038a115", |
|
"h": "01", |
|
"Gx": "161ff7528b899b2d0c28607ca52c5b86", |
|
"Gy": "cf5ac8395bafeb13c02da292dded7a83" |
|
}, |
|
"secp160k1": { |
|
"p": "fffffffffffffffffffffffffffffffeffffac73", |
|
"a": "00", |
|
"b": "07", |
|
"n": "0100000000000000000001b8fa16dfab9aca16b6b3", |
|
"h": "01", |
|
"Gx": "3b4c382ce37aa192a4019e763036f4f5dd4d7ebb", |
|
"Gy": "938cf935318fdced6bc28286531733c3f03c4fee" |
|
}, |
|
"secp160r1": { |
|
"p": "ffffffffffffffffffffffffffffffff7fffffff", |
|
"a": "ffffffffffffffffffffffffffffffff7ffffffc", |
|
"b": "1c97befc54bd7a8b65acf89f81d4d4adc565fa45", |
|
"n": "0100000000000000000001f4c8f927aed3ca752257", |
|
"h": "01", |
|
"Gx": "4a96b5688ef573284664698968c38bb913cbfc82", |
|
"Gy": "23a628553168947d59dcc912042351377ac5fb32" |
|
}, |
|
"secp192k1": { |
|
"p": "fffffffffffffffffffffffffffffffffffffffeffffee37", |
|
"a": "00", |
|
"b": "03", |
|
"n": "fffffffffffffffffffffffe26f2fc170f69466a74defd8d", |
|
"h": "01", |
|
"Gx": "db4ff10ec057e9ae26b07d0280b7f4341da5d1b1eae06c7d", |
|
"Gy": "9b2f2f6d9c5628a7844163d015be86344082aa88d95e2f9d" |
|
}, |
|
"secp192r1": { |
|
"p": "fffffffffffffffffffffffffffffffeffffffffffffffff", |
|
"a": "fffffffffffffffffffffffffffffffefffffffffffffffc", |
|
"b": "64210519e59c80e70fa7e9ab72243049feb8deecc146b9b1", |
|
"n": "ffffffffffffffffffffffff99def836146bc9b1b4d22831", |
|
"h": "01", |
|
"Gx": "188da80eb03090f67cbf20eb43a18800f4ff0afd82ff1012", |
|
"Gy": "07192b95ffc8da78631011ed6b24cdd573f977a11e794811" |
|
}, |
|
"secp256k1": { |
|
"p": "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f", |
|
"a": "00", |
|
"b": "07", |
|
"n": "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141", |
|
"h": "01", |
|
"Gx": "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798", |
|
"Gy": "483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8" |
|
}, |
|
"secp256r1": { |
|
"p": "ffffffff00000001000000000000000000000000ffffffffffffffffffffffff", |
|
"a": "ffffffff00000001000000000000000000000000fffffffffffffffffffffffc", |
|
"b": "5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b", |
|
"n": "ffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551", |
|
"h": "01", |
|
"Gx": "6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296", |
|
"Gy": "4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5" |
|
} |
|
} |
|
|
|
},{}],28:[function(require,module,exports){ |
|
var Point = require('./point') |
|
var Curve = require('./curve') |
|
|
|
var getCurveByName = require('./names') |
|
|
|
module.exports = { |
|
Curve: Curve, |
|
Point: Point, |
|
getCurveByName: getCurveByName |
|
} |
|
|
|
},{"./curve":26,"./names":29,"./point":30}],29:[function(require,module,exports){ |
|
var BigInteger = require('bigi') |
|
|
|
var curves = require('./curves') |
|
var Curve = require('./curve') |
|
|
|
function getCurveByName(name) { |
|
var curve = curves[name] |
|
if (!curve) return null |
|
|
|
var p = new BigInteger(curve.p, 16) |
|
var a = new BigInteger(curve.a, 16) |
|
var b = new BigInteger(curve.b, 16) |
|
var n = new BigInteger(curve.n, 16) |
|
var h = new BigInteger(curve.h, 16) |
|
var Gx = new BigInteger(curve.Gx, 16) |
|
var Gy = new BigInteger(curve.Gy, 16) |
|
|
|
return new Curve(p, a, b, Gx, Gy, n, h) |
|
} |
|
|
|
module.exports = getCurveByName |
|
|
|
},{"./curve":26,"./curves":27,"bigi":7}],30:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var BigInteger = require('bigi') |
|
|
|
var THREE = BigInteger.valueOf(3) |
|
|
|
function Point(curve, x, y, z) { |
|
assert.notStrictEqual(z, undefined, 'Missing Z coordinate') |
|
|
|
this.curve = curve |
|
this.x = x |
|
this.y = y |
|
this.z = z |
|
this._zInv = null |
|
|
|
this.compressed = true |
|
} |
|
|
|
Object.defineProperty(Point.prototype, 'zInv', { |
|
get: function() { |
|
if (this._zInv === null) { |
|
this._zInv = this.z.modInverse(this.curve.p) |
|
} |
|
|
|
return this._zInv |
|
} |
|
}) |
|
|
|
Object.defineProperty(Point.prototype, 'affineX', { |
|
get: function() { |
|
return this.x.multiply(this.zInv).mod(this.curve.p) |
|
} |
|
}) |
|
|
|
Object.defineProperty(Point.prototype, 'affineY', { |
|
get: function() { |
|
return this.y.multiply(this.zInv).mod(this.curve.p) |
|
} |
|
}) |
|
|
|
Point.fromAffine = function(curve, x, y) { |
|
return new Point(curve, x, y, BigInteger.ONE) |
|
} |
|
|
|
Point.prototype.equals = function(other) { |
|
if (other === this) return true |
|
if (this.curve.isInfinity(this)) return this.curve.isInfinity(other) |
|
if (this.curve.isInfinity(other)) return this.curve.isInfinity(this) |
|
|
|
// u = Y2 * Z1 - Y1 * Z2 |
|
var u = other.y.multiply(this.z).subtract(this.y.multiply(other.z)).mod(this.curve.p) |
|
|
|
if (u.signum() !== 0) return false |
|
|
|
// v = X2 * Z1 - X1 * Z2 |
|
var v = other.x.multiply(this.z).subtract(this.x.multiply(other.z)).mod(this.curve.p) |
|
|
|
return v.signum() === 0 |
|
} |
|
|
|
Point.prototype.negate = function() { |
|
var y = this.curve.p.subtract(this.y) |
|
|
|
return new Point(this.curve, this.x, y, this.z) |
|
} |
|
|
|
Point.prototype.add = function(b) { |
|
if (this.curve.isInfinity(this)) return b |
|
if (this.curve.isInfinity(b)) return this |
|
|
|
var x1 = this.x |
|
var y1 = this.y |
|
var x2 = b.x |
|
var y2 = b.y |
|
|
|
// u = Y2 * Z1 - Y1 * Z2 |
|
var u = y2.multiply(this.z).subtract(y1.multiply(b.z)).mod(this.curve.p) |
|
// v = X2 * Z1 - X1 * Z2 |
|
var v = x2.multiply(this.z).subtract(x1.multiply(b.z)).mod(this.curve.p) |
|
|
|
if (v.signum() === 0) { |
|
if (u.signum() === 0) { |
|
return this.twice() // this == b, so double |
|
} |
|
|
|
return this.curve.infinity // this = -b, so infinity |
|
} |
|
|
|
var v2 = v.square() |
|
var v3 = v2.multiply(v) |
|
var x1v2 = x1.multiply(v2) |
|
var zu2 = u.square().multiply(this.z) |
|
|
|
// x3 = v * (z2 * (z1 * u^2 - 2 * x1 * v^2) - v^3) |
|
var x3 = zu2.subtract(x1v2.shiftLeft(1)).multiply(b.z).subtract(v3).multiply(v).mod(this.curve.p) |
|
// y3 = z2 * (3 * x1 * u * v^2 - y1 * v^3 - z1 * u^3) + u * v^3 |
|
var y3 = x1v2.multiply(THREE).multiply(u).subtract(y1.multiply(v3)).subtract(zu2.multiply(u)).multiply(b.z).add(u.multiply(v3)).mod(this.curve.p) |
|
// z3 = v^3 * z1 * z2 |
|
var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.p) |
|
|
|
return new Point(this.curve, x3, y3, z3) |
|
} |
|
|
|
Point.prototype.twice = function() { |
|
if (this.curve.isInfinity(this)) return this |
|
if (this.y.signum() === 0) return this.curve.infinity |
|
|
|
var x1 = this.x |
|
var y1 = this.y |
|
|
|
var y1z1 = y1.multiply(this.z) |
|
var y1sqz1 = y1z1.multiply(y1).mod(this.curve.p) |
|
var a = this.curve.a |
|
|
|
// w = 3 * x1^2 + a * z1^2 |
|
var w = x1.square().multiply(THREE) |
|
|
|
if (a.signum() !== 0) { |
|
w = w.add(this.z.square().multiply(a)) |
|
} |
|
|
|
w = w.mod(this.curve.p) |
|
// x3 = 2 * y1 * z1 * (w^2 - 8 * x1 * y1^2 * z1) |
|
var x3 = w.square().subtract(x1.shiftLeft(3).multiply(y1sqz1)).shiftLeft(1).multiply(y1z1).mod(this.curve.p) |
|
// y3 = 4 * y1^2 * z1 * (3 * w * x1 - 2 * y1^2 * z1) - w^3 |
|
var y3 = w.multiply(THREE).multiply(x1).subtract(y1sqz1.shiftLeft(1)).shiftLeft(2).multiply(y1sqz1).subtract(w.pow(3)).mod(this.curve.p) |
|
// z3 = 8 * (y1 * z1)^3 |
|
var z3 = y1z1.pow(3).shiftLeft(3).mod(this.curve.p) |
|
|
|
return new Point(this.curve, x3, y3, z3) |
|
} |
|
|
|
// Simple NAF (Non-Adjacent Form) multiplication algorithm |
|
// TODO: modularize the multiplication algorithm |
|
Point.prototype.multiply = function(k) { |
|
if (this.curve.isInfinity(this)) return this |
|
if (k.signum() === 0) return this.curve.infinity |
|
|
|
var e = k |
|
var h = e.multiply(THREE) |
|
|
|
var neg = this.negate() |
|
var R = this |
|
|
|
for (var i = h.bitLength() - 2; i > 0; --i) { |
|
R = R.twice() |
|
|
|
var hBit = h.testBit(i) |
|
var eBit = e.testBit(i) |
|
|
|
if (hBit != eBit) { |
|
R = R.add(hBit ? this : neg) |
|
} |
|
} |
|
|
|
return R |
|
} |
|
|
|
// Compute this*j + x*k (simultaneous multiplication) |
|
Point.prototype.multiplyTwo = function(j, x, k) { |
|
var i |
|
|
|
if (j.bitLength() > k.bitLength()) |
|
i = j.bitLength() - 1 |
|
else |
|
i = k.bitLength() - 1 |
|
|
|
var R = this.curve.infinity |
|
var both = this.add(x) |
|
|
|
while (i >= 0) { |
|
R = R.twice() |
|
|
|
var jBit = j.testBit(i) |
|
var kBit = k.testBit(i) |
|
|
|
if (jBit) { |
|
if (kBit) { |
|
R = R.add(both) |
|
|
|
} else { |
|
R = R.add(this) |
|
} |
|
|
|
} else { |
|
if (kBit) { |
|
R = R.add(x) |
|
} |
|
} |
|
--i |
|
} |
|
|
|
return R |
|
} |
|
|
|
Point.prototype.getEncoded = function(compressed) { |
|
if (compressed == undefined) compressed = this.compressed |
|
if (this.curve.isInfinity(this)) return new Buffer('00', 'hex') // Infinity point encoded is simply '00' |
|
|
|
var x = this.affineX |
|
var y = this.affineY |
|
|
|
var buffer |
|
|
|
// Determine size of q in bytes |
|
var byteLength = Math.floor((this.curve.p.bitLength() + 7) / 8) |
|
|
|
// 0x02/0x03 | X |
|
if (compressed) { |
|
buffer = new Buffer(1 + byteLength) |
|
buffer.writeUInt8(y.isEven() ? 0x02 : 0x03, 0) |
|
|
|
// 0x04 | X | Y |
|
} else { |
|
buffer = new Buffer(1 + byteLength + byteLength) |
|
buffer.writeUInt8(0x04, 0) |
|
|
|
y.toBuffer(byteLength).copy(buffer, 1 + byteLength) |
|
} |
|
|
|
x.toBuffer(byteLength).copy(buffer, 1) |
|
|
|
return buffer |
|
} |
|
|
|
Point.decodeFrom = function(curve, buffer) { |
|
var type = buffer.readUInt8(0) |
|
var compressed = (type !== 4) |
|
|
|
var byteLength = Math.floor((curve.p.bitLength() + 7) / 8) |
|
var x = BigInteger.fromBuffer(buffer.slice(1, 1 + byteLength)) |
|
|
|
var Q |
|
if (compressed) { |
|
assert.equal(buffer.length, byteLength + 1, 'Invalid sequence length') |
|
assert(type === 0x02 || type === 0x03, 'Invalid sequence tag') |
|
|
|
var isOdd = (type === 0x03) |
|
Q = curve.pointFromX(isOdd, x) |
|
|
|
} else { |
|
assert.equal(buffer.length, 1 + byteLength + byteLength, 'Invalid sequence length') |
|
|
|
var y = BigInteger.fromBuffer(buffer.slice(1 + byteLength)) |
|
Q = Point.fromAffine(curve, x, y) |
|
} |
|
|
|
Q.compressed = compressed |
|
return Q |
|
} |
|
|
|
Point.prototype.toString = function () { |
|
if (this.curve.isInfinity(this)) return '(INFINITY)' |
|
|
|
return '(' + this.affineX.toString() + ',' + this.affineY.toString() + ')' |
|
} |
|
|
|
module.exports = Point |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"assert":157,"bigi":7,"buffer":172}],31:[function(require,module,exports){ |
|
(function (process,global,Buffer){ |
|
'use strict'; |
|
|
|
var crypto = global.crypto || global.msCrypto |
|
if(crypto && crypto.getRandomValues) { |
|
module.exports = randomBytes; |
|
} else { |
|
module.exports = oldBrowser; |
|
} |
|
function randomBytes(size, cb) { |
|
var bytes = new Buffer(size); //in browserify, this is an extended Uint8Array |
|
/* This will not work in older browsers. |
|
* See https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues |
|
*/ |
|
|
|
crypto.getRandomValues(bytes); |
|
if (typeof cb === 'function') { |
|
return process.nextTick(function () { |
|
cb(null, bytes); |
|
}); |
|
} |
|
return bytes; |
|
} |
|
function oldBrowser() { |
|
throw new Error( |
|
'secure random number generation not supported by this browser\n'+ |
|
'use chrome, FireFox or Internet Explorer 11' |
|
) |
|
} |
|
|
|
}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {},require("buffer").Buffer) |
|
},{"_process":323,"buffer":172}],32:[function(require,module,exports){ |
|
(function (Buffer){ |
|
function getName (value) { |
|
if (value === undefined) return '' |
|
if (value === null) return '' |
|
// if (value.constructor.name !== undefined) return fn.name |
|
|
|
// why not constructor.name: https://kangax.github.io/compat-table/es6/#function_name_property |
|
var match = value.constructor.toString().match(/function (.*?)\(/) |
|
return match ? match[1] : null |
|
} |
|
|
|
module.exports = function enforce (type, value) { |
|
if (typeof type === 'string') { |
|
if (type[0] === '?') { |
|
if (value === null || value === undefined) { |
|
return |
|
} |
|
|
|
type = type.slice(1) |
|
} |
|
} |
|
|
|
switch (type) { |
|
case 'Array': { |
|
if (value !== null && value !== undefined && value.constructor === Array) return |
|
break |
|
} |
|
|
|
case 'Boolean': { |
|
if (typeof value === 'boolean') return |
|
break |
|
} |
|
|
|
case 'Buffer': { |
|
if (Buffer.isBuffer(value)) return |
|
break |
|
} |
|
|
|
case 'Function': { |
|
if (typeof value === 'function') return |
|
break |
|
} |
|
|
|
case 'Number': { |
|
if (typeof value === 'number') return |
|
break |
|
} |
|
|
|
case 'Object': { |
|
if (typeof value === 'object') return |
|
break |
|
} |
|
|
|
case 'String': { |
|
if (typeof value === 'string') return |
|
break |
|
} |
|
|
|
default: { |
|
switch (typeof type) { |
|
case 'string': { |
|
if (type === getName(value)) return |
|
break |
|
} |
|
|
|
// evaluate type templates |
|
case 'object': { |
|
if (Array.isArray(type)) { |
|
var subType = type[0] |
|
|
|
enforce('Array', value) |
|
value.forEach(enforce.bind(undefined, subType)) |
|
|
|
return |
|
} |
|
|
|
enforce('Object', value) |
|
for (var propertyName in type) { |
|
var propertyType = type[propertyName] |
|
var propertyValue = value[propertyName] |
|
|
|
try { |
|
enforce(propertyType, propertyValue) |
|
} catch (e) { |
|
throw new TypeError('Expected property "' + propertyName + '" of type ' + JSON.stringify(propertyType) + ', got ' + getName(propertyValue) + ' ' + propertyValue) |
|
} |
|
} |
|
|
|
return |
|
} |
|
} |
|
} |
|
} |
|
|
|
throw new TypeError('Expected ' + type + ', got ' + getName(value) + ' ' + value) |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],33:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var base58check = require('bs58check') |
|
var typeForce = require('typeforce') |
|
var networks = require('./networks') |
|
var scripts = require('./scripts') |
|
|
|
function findScriptTypeByVersion (version) { |
|
for (var networkName in networks) { |
|
var network = networks[networkName] |
|
|
|
if (version === network.pubKeyHash) return 'pubkeyhash' |
|
if (version === network.scriptHash) return 'scripthash' |
|
} |
|
} |
|
|
|
function Address (hash, version) { |
|
typeForce('Buffer', hash) |
|
|
|
assert.strictEqual(hash.length, 20, 'Invalid hash length') |
|
assert.strictEqual(version & 0xff, version, 'Invalid version byte') |
|
|
|
this.hash = hash |
|
this.version = version |
|
} |
|
|
|
Address.fromBase58Check = function (string) { |
|
var payload = base58check.decode(string) |
|
var version = payload.readUInt8(0) |
|
var hash = payload.slice(1) |
|
|
|
return new Address(hash, version) |
|
} |
|
|
|
Address.fromOutputScript = function (script, network) { |
|
network = network || networks.bitcoin |
|
|
|
if (scripts.isPubKeyHashOutput(script)) return new Address(script.chunks[2], network.pubKeyHash) |
|
if (scripts.isScriptHashOutput(script)) return new Address(script.chunks[1], network.scriptHash) |
|
|
|
assert(false, script.toASM() + ' has no matching Address') |
|
} |
|
|
|
Address.prototype.toBase58Check = function () { |
|
var payload = new Buffer(21) |
|
payload.writeUInt8(this.version, 0) |
|
this.hash.copy(payload, 1) |
|
|
|
return base58check.encode(payload) |
|
} |
|
|
|
Address.prototype.toOutputScript = function () { |
|
var scriptType = findScriptTypeByVersion(this.version) |
|
|
|
if (scriptType === 'pubkeyhash') return scripts.pubKeyHashOutput(this.hash) |
|
if (scriptType === 'scripthash') return scripts.scriptHashOutput(this.hash) |
|
|
|
assert(false, this.toString() + ' has no matching Script') |
|
} |
|
|
|
Address.prototype.toString = Address.prototype.toBase58Check |
|
|
|
module.exports = Address |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./networks":45,"./scripts":48,"assert":157,"bs58check":9,"buffer":172,"typeforce":32}],34:[function(require,module,exports){ |
|
var bs58check = require('bs58check') |
|
|
|
function decode () { |
|
console.warn('bs58check will be removed in 2.0.0. require("bs58check") instead.') |
|
|
|
return bs58check.decode.apply(undefined, arguments) |
|
} |
|
|
|
function encode () { |
|
console.warn('bs58check will be removed in 2.0.0. require("bs58check") instead.') |
|
|
|
return bs58check.encode.apply(undefined, arguments) |
|
} |
|
|
|
module.exports = { |
|
decode: decode, |
|
encode: encode |
|
} |
|
|
|
},{"bs58check":9}],35:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var bufferutils = require('./bufferutils') |
|
var crypto = require('./crypto') |
|
|
|
var Transaction = require('./transaction') |
|
|
|
function Block () { |
|
this.version = 1 |
|
this.prevHash = null |
|
this.merkleRoot = null |
|
this.timestamp = 0 |
|
this.bits = 0 |
|
this.nonce = 0 |
|
} |
|
|
|
Block.fromBuffer = function (buffer) { |
|
assert(buffer.length >= 80, 'Buffer too small (< 80 bytes)') |
|
|
|
var offset = 0 |
|
function readSlice (n) { |
|
offset += n |
|
return buffer.slice(offset - n, offset) |
|
} |
|
|
|
function readUInt32 () { |
|
var i = buffer.readUInt32LE(offset) |
|
offset += 4 |
|
return i |
|
} |
|
|
|
var block = new Block() |
|
block.version = readUInt32() |
|
block.prevHash = readSlice(32) |
|
block.merkleRoot = readSlice(32) |
|
block.timestamp = readUInt32() |
|
block.bits = readUInt32() |
|
block.nonce = readUInt32() |
|
|
|
if (buffer.length === 80) return block |
|
|
|
function readVarInt () { |
|
var vi = bufferutils.readVarInt(buffer, offset) |
|
offset += vi.size |
|
return vi.number |
|
} |
|
|
|
// FIXME: poor performance |
|
function readTransaction () { |
|
var tx = Transaction.fromBuffer(buffer.slice(offset), true) |
|
|
|
offset += tx.toBuffer().length |
|
return tx |
|
} |
|
|
|
var nTransactions = readVarInt() |
|
block.transactions = [] |
|
|
|
for (var i = 0; i < nTransactions; ++i) { |
|
var tx = readTransaction() |
|
block.transactions.push(tx) |
|
} |
|
|
|
return block |
|
} |
|
|
|
Block.fromHex = function (hex) { |
|
return Block.fromBuffer(new Buffer(hex, 'hex')) |
|
} |
|
|
|
Block.prototype.getHash = function () { |
|
return crypto.hash256(this.toBuffer(true)) |
|
} |
|
|
|
Block.prototype.getId = function () { |
|
return bufferutils.reverse(this.getHash()).toString('hex') |
|
} |
|
|
|
Block.prototype.getUTCDate = function () { |
|
var date = new Date(0) // epoch |
|
date.setUTCSeconds(this.timestamp) |
|
|
|
return date |
|
} |
|
|
|
Block.prototype.toBuffer = function (headersOnly) { |
|
var buffer = new Buffer(80) |
|
|
|
var offset = 0 |
|
function writeSlice (slice) { |
|
slice.copy(buffer, offset) |
|
offset += slice.length |
|
} |
|
|
|
function writeUInt32 (i) { |
|
buffer.writeUInt32LE(i, offset) |
|
offset += 4 |
|
} |
|
|
|
writeUInt32(this.version) |
|
writeSlice(this.prevHash) |
|
writeSlice(this.merkleRoot) |
|
writeUInt32(this.timestamp) |
|
writeUInt32(this.bits) |
|
writeUInt32(this.nonce) |
|
|
|
if (headersOnly || !this.transactions) return buffer |
|
|
|
var txLenBuffer = bufferutils.varIntBuffer(this.transactions.length) |
|
var txBuffers = this.transactions.map(function (tx) { |
|
return tx.toBuffer() |
|
}) |
|
|
|
return Buffer.concat([buffer, txLenBuffer].concat(txBuffers)) |
|
} |
|
|
|
Block.prototype.toHex = function (headersOnly) { |
|
return this.toBuffer(headersOnly).toString('hex') |
|
} |
|
|
|
module.exports = Block |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./bufferutils":36,"./crypto":37,"./transaction":49,"assert":157,"buffer":172}],36:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var opcodes = require('./opcodes') |
|
|
|
// https://github.com/feross/buffer/blob/master/index.js#L1127 |
|
function verifuint (value, max) { |
|
assert(typeof value === 'number', 'cannot write a non-number as a number') |
|
assert(value >= 0, 'specified a negative value for writing an unsigned value') |
|
assert(value <= max, 'value is larger than maximum value for type') |
|
assert(Math.floor(value) === value, 'value has a fractional component') |
|
} |
|
|
|
function pushDataSize (i) { |
|
return i < opcodes.OP_PUSHDATA1 ? 1 |
|
: i < 0xff ? 2 |
|
: i < 0xffff ? 3 |
|
: 5 |
|
} |
|
|
|
function readPushDataInt (buffer, offset) { |
|
var opcode = buffer.readUInt8(offset) |
|
var number, size |
|
|
|
// ~6 bit |
|
if (opcode < opcodes.OP_PUSHDATA1) { |
|
number = opcode |
|
size = 1 |
|
|
|
// 8 bit |
|
} else if (opcode === opcodes.OP_PUSHDATA1) { |
|
if (offset + 2 > buffer.length) return null |
|
number = buffer.readUInt8(offset + 1) |
|
size = 2 |
|
|
|
// 16 bit |
|
} else if (opcode === opcodes.OP_PUSHDATA2) { |
|
if (offset + 3 > buffer.length) return null |
|
number = buffer.readUInt16LE(offset + 1) |
|
size = 3 |
|
|
|
// 32 bit |
|
} else { |
|
if (offset + 5 > buffer.length) return null |
|
assert.equal(opcode, opcodes.OP_PUSHDATA4, 'Unexpected opcode') |
|
|
|
number = buffer.readUInt32LE(offset + 1) |
|
size = 5 |
|
} |
|
|
|
return { |
|
opcode: opcode, |
|
number: number, |
|
size: size |
|
} |
|
} |
|
|
|
function readUInt64LE (buffer, offset) { |
|
var a = buffer.readUInt32LE(offset) |
|
var b = buffer.readUInt32LE(offset + 4) |
|
b *= 0x100000000 |
|
|
|
verifuint(b + a, 0x001fffffffffffff) |
|
|
|
return b + a |
|
} |
|
|
|
function readVarInt (buffer, offset) { |
|
var t = buffer.readUInt8(offset) |
|
var number, size |
|
|
|
// 8 bit |
|
if (t < 253) { |
|
number = t |
|
size = 1 |
|
|
|
// 16 bit |
|
} else if (t < 254) { |
|
number = buffer.readUInt16LE(offset + 1) |
|
size = 3 |
|
|
|
// 32 bit |
|
} else if (t < 255) { |
|
number = buffer.readUInt32LE(offset + 1) |
|
size = 5 |
|
|
|
// 64 bit |
|
} else { |
|
number = readUInt64LE(buffer, offset + 1) |
|
size = 9 |
|
} |
|
|
|
return { |
|
number: number, |
|
size: size |
|
} |
|
} |
|
|
|
function writePushDataInt (buffer, number, offset) { |
|
var size = pushDataSize(number) |
|
|
|
// ~6 bit |
|
if (size === 1) { |
|
buffer.writeUInt8(number, offset) |
|
|
|
// 8 bit |
|
} else if (size === 2) { |
|
buffer.writeUInt8(opcodes.OP_PUSHDATA1, offset) |
|
buffer.writeUInt8(number, offset + 1) |
|
|
|
// 16 bit |
|
} else if (size === 3) { |
|
buffer.writeUInt8(opcodes.OP_PUSHDATA2, offset) |
|
buffer.writeUInt16LE(number, offset + 1) |
|
|
|
// 32 bit |
|
} else { |
|
buffer.writeUInt8(opcodes.OP_PUSHDATA4, offset) |
|
buffer.writeUInt32LE(number, offset + 1) |
|
} |
|
|
|
return size |
|
} |
|
|
|
function writeUInt64LE (buffer, value, offset) { |
|
verifuint(value, 0x001fffffffffffff) |
|
|
|
buffer.writeInt32LE(value & -1, offset) |
|
buffer.writeUInt32LE(Math.floor(value / 0x100000000), offset + 4) |
|
} |
|
|
|
function varIntSize (i) { |
|
return i < 253 ? 1 |
|
: i < 0x10000 ? 3 |
|
: i < 0x100000000 ? 5 |
|
: 9 |
|
} |
|
|
|
function writeVarInt (buffer, number, offset) { |
|
var size = varIntSize(number) |
|
|
|
// 8 bit |
|
if (size === 1) { |
|
buffer.writeUInt8(number, offset) |
|
|
|
// 16 bit |
|
} else if (size === 3) { |
|
buffer.writeUInt8(253, offset) |
|
buffer.writeUInt16LE(number, offset + 1) |
|
|
|
// 32 bit |
|
} else if (size === 5) { |
|
buffer.writeUInt8(254, offset) |
|
buffer.writeUInt32LE(number, offset + 1) |
|
|
|
// 64 bit |
|
} else { |
|
buffer.writeUInt8(255, offset) |
|
writeUInt64LE(buffer, number, offset + 1) |
|
} |
|
|
|
return size |
|
} |
|
|
|
function varIntBuffer (i) { |
|
var size = varIntSize(i) |
|
var buffer = new Buffer(size) |
|
writeVarInt(buffer, i, 0) |
|
|
|
return buffer |
|
} |
|
|
|
function reverse (buffer) { |
|
var buffer2 = new Buffer(buffer) |
|
Array.prototype.reverse.call(buffer2) |
|
return buffer2 |
|
} |
|
|
|
module.exports = { |
|
pushDataSize: pushDataSize, |
|
readPushDataInt: readPushDataInt, |
|
readUInt64LE: readUInt64LE, |
|
readVarInt: readVarInt, |
|
reverse: reverse, |
|
varIntBuffer: varIntBuffer, |
|
varIntSize: varIntSize, |
|
writePushDataInt: writePushDataInt, |
|
writeUInt64LE: writeUInt64LE, |
|
writeVarInt: writeVarInt |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./opcodes":46,"assert":157,"buffer":172}],37:[function(require,module,exports){ |
|
var createHash = require('create-hash') |
|
|
|
function hash160 (buffer) { |
|
return ripemd160(sha256(buffer)) |
|
} |
|
|
|
function hash256 (buffer) { |
|
return sha256(sha256(buffer)) |
|
} |
|
|
|
function ripemd160 (buffer) { |
|
return createHash('rmd160').update(buffer).digest() |
|
} |
|
|
|
function sha1 (buffer) { |
|
return createHash('sha1').update(buffer).digest() |
|
} |
|
|
|
function sha256 (buffer) { |
|
return createHash('sha256').update(buffer).digest() |
|
} |
|
|
|
// FIXME: Name not consistent with others |
|
var createHmac = require('create-hmac') |
|
|
|
function HmacSHA256 (buffer, secret) { |
|
console.warn('Hmac* functions are deprecated for removal in 2.0.0, use node crypto instead') |
|
return createHmac('sha256', secret).update(buffer).digest() |
|
} |
|
|
|
function HmacSHA512 (buffer, secret) { |
|
console.warn('Hmac* functions are deprecated for removal in 2.0.0, use node crypto instead') |
|
return createHmac('sha512', secret).update(buffer).digest() |
|
} |
|
|
|
module.exports = { |
|
ripemd160: ripemd160, |
|
sha1: sha1, |
|
sha256: sha256, |
|
hash160: hash160, |
|
hash256: hash256, |
|
HmacSHA256: HmacSHA256, |
|
HmacSHA512: HmacSHA512 |
|
} |
|
|
|
},{"create-hash":11,"create-hmac":24}],38:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var createHmac = require('create-hmac') |
|
var typeForce = require('typeforce') |
|
|
|
var BigInteger = require('bigi') |
|
var ECSignature = require('./ecsignature') |
|
|
|
var ZERO = new Buffer([0]) |
|
var ONE = new Buffer([1]) |
|
|
|
// https://tools.ietf.org/html/rfc6979#section-3.2 |
|
function deterministicGenerateK (curve, hash, d, checkSig) { |
|
typeForce('Buffer', hash) |
|
typeForce('BigInteger', d) |
|
|
|
// FIXME: remove/uncomment for 2.0.0 |
|
// typeForce('Function', checkSig) |
|
|
|
if (typeof checkSig !== 'function') { |
|
console.warn('deterministicGenerateK requires a checkSig callback in 2.0.0, see #337 for more information') |
|
|
|
checkSig = function (k) { |
|
var G = curve.G |
|
var n = curve.n |
|
var e = BigInteger.fromBuffer(hash) |
|
|
|
var Q = G.multiply(k) |
|
|
|
if (curve.isInfinity(Q)) |
|
return false |
|
|
|
var r = Q.affineX.mod(n) |
|
if (r.signum() === 0) |
|
return false |
|
|
|
var s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n) |
|
if (s.signum() === 0) |
|
return false |
|
|
|
return true |
|
} |
|
} |
|
|
|
// sanity check |
|
assert.equal(hash.length, 32, 'Hash must be 256 bit') |
|
|
|
var x = d.toBuffer(32) |
|
var k = new Buffer(32) |
|
var v = new Buffer(32) |
|
|
|
// Step A, ignored as hash already provided |
|
// Step B |
|
v.fill(1) |
|
|
|
// Step C |
|
k.fill(0) |
|
|
|
// Step D |
|
k = createHmac('sha256', k) |
|
.update(v) |
|
.update(ZERO) |
|
.update(x) |
|
.update(hash) |
|
.digest() |
|
|
|
// Step E |
|
v = createHmac('sha256', k).update(v).digest() |
|
|
|
// Step F |
|
k = createHmac('sha256', k) |
|
.update(v) |
|
.update(ONE) |
|
.update(x) |
|
.update(hash) |
|
.digest() |
|
|
|
// Step G |
|
v = createHmac('sha256', k).update(v).digest() |
|
|
|
// Step H1/H2a, ignored as tlen === qlen (256 bit) |
|
// Step H2b |
|
v = createHmac('sha256', k).update(v).digest() |
|
|
|
var T = BigInteger.fromBuffer(v) |
|
|
|
// Step H3, repeat until T is within the interval [1, n - 1] and is suitable for ECDSA |
|
while ((T.signum() <= 0) || (T.compareTo(curve.n) >= 0) || !checkSig(T)) { |
|
k = createHmac('sha256', k) |
|
.update(v) |
|
.update(ZERO) |
|
.digest() |
|
|
|
v = createHmac('sha256', k).update(v).digest() |
|
|
|
// Step H1/H2a, again, ignored as tlen === qlen (256 bit) |
|
// Step H2b again |
|
v = createHmac('sha256', k).update(v).digest() |
|
T = BigInteger.fromBuffer(v) |
|
} |
|
|
|
return T |
|
} |
|
|
|
function sign (curve, hash, d) { |
|
var r, s |
|
|
|
var e = BigInteger.fromBuffer(hash) |
|
var n = curve.n |
|
var G = curve.G |
|
|
|
deterministicGenerateK(curve, hash, d, function (k) { |
|
var Q = G.multiply(k) |
|
|
|
if (curve.isInfinity(Q)) |
|
return false |
|
|
|
r = Q.affineX.mod(n) |
|
if (r.signum() === 0) |
|
return false |
|
|
|
s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n) |
|
if (s.signum() === 0) |
|
return false |
|
|
|
return true |
|
}) |
|
|
|
var N_OVER_TWO = n.shiftRight(1) |
|
|
|
// enforce low S values, see bip62: 'low s values in signatures' |
|
if (s.compareTo(N_OVER_TWO) > 0) { |
|
s = n.subtract(s) |
|
} |
|
|
|
return new ECSignature(r, s) |
|
} |
|
|
|
function verifyRaw (curve, e, signature, Q) { |
|
var n = curve.n |
|
var G = curve.G |
|
|
|
var r = signature.r |
|
var s = signature.s |
|
|
|
// 1.4.1 Enforce r and s are both integers in the interval [1, n − 1] |
|
if (r.signum() <= 0 || r.compareTo(n) >= 0) return false |
|
if (s.signum() <= 0 || s.compareTo(n) >= 0) return false |
|
|
|
// c = s^-1 mod n |
|
var c = s.modInverse(n) |
|
|
|
// 1.4.4 Compute u1 = es^−1 mod n |
|
// u2 = rs^−1 mod n |
|
var u1 = e.multiply(c).mod(n) |
|
var u2 = r.multiply(c).mod(n) |
|
|
|
// 1.4.5 Compute R = (xR, yR) = u1G + u2Q |
|
var R = G.multiplyTwo(u1, Q, u2) |
|
var v = R.affineX.mod(n) |
|
|
|
// 1.4.5 (cont.) Enforce R is not at infinity |
|
if (curve.isInfinity(R)) return false |
|
|
|
// 1.4.8 If v = r, output "valid", and if v != r, output "invalid" |
|
return v.equals(r) |
|
} |
|
|
|
function verify (curve, hash, signature, Q) { |
|
// 1.4.2 H = Hash(M), already done by the user |
|
// 1.4.3 e = H |
|
var e = BigInteger.fromBuffer(hash) |
|
|
|
return verifyRaw(curve, e, signature, Q) |
|
} |
|
|
|
/** |
|
* Recover a public key from a signature. |
|
* |
|
* See SEC 1: Elliptic Curve Cryptography, section 4.1.6, "Public |
|
* Key Recovery Operation". |
|
* |
|
* http://www.secg.org/download/aid-780/sec1-v2.pdf |
|
*/ |
|
function recoverPubKey (curve, e, signature, i) { |
|
assert.strictEqual(i & 3, i, 'Recovery param is more than two bits') |
|
|
|
var n = curve.n |
|
var G = curve.G |
|
|
|
var r = signature.r |
|
var s = signature.s |
|
|
|
assert(r.signum() > 0 && r.compareTo(n) < 0, 'Invalid r value') |
|
assert(s.signum() > 0 && s.compareTo(n) < 0, 'Invalid s value') |
|
|
|
// A set LSB signifies that the y-coordinate is odd |
|
var isYOdd = i & 1 |
|
|
|
// The more significant bit specifies whether we should use the |
|
// first or second candidate key. |
|
var isSecondKey = i >> 1 |
|
|
|
// 1.1 Let x = r + jn |
|
var x = isSecondKey ? r.add(n) : r |
|
var R = curve.pointFromX(isYOdd, x) |
|
|
|
// 1.4 Check that nR is at infinity |
|
var nR = R.multiply(n) |
|
assert(curve.isInfinity(nR), 'nR is not a valid curve point') |
|
|
|
// Compute -e from e |
|
var eNeg = e.negate().mod(n) |
|
|
|
// 1.6.1 Compute Q = r^-1 (sR - eG) |
|
// Q = r^-1 (sR + -eG) |
|
var rInv = r.modInverse(n) |
|
|
|
var Q = R.multiplyTwo(s, G, eNeg).multiply(rInv) |
|
curve.validate(Q) |
|
|
|
return Q |
|
} |
|
|
|
/** |
|
* Calculate pubkey extraction parameter. |
|
* |
|
* When extracting a pubkey from a signature, we have to |
|
* distinguish four different cases. Rather than putting this |
|
* burden on the verifier, Bitcoin includes a 2-bit value with the |
|
* signature. |
|
* |
|
* This function simply tries all four cases and returns the value |
|
* that resulted in a successful pubkey recovery. |
|
*/ |
|
function calcPubKeyRecoveryParam (curve, e, signature, Q) { |
|
for (var i = 0; i < 4; i++) { |
|
var Qprime = recoverPubKey(curve, e, signature, i) |
|
|
|
// 1.6.2 Verify Q |
|
if (Qprime.equals(Q)) { |
|
return i |
|
} |
|
} |
|
|
|
throw new Error('Unable to find valid recovery factor') |
|
} |
|
|
|
module.exports = { |
|
calcPubKeyRecoveryParam: calcPubKeyRecoveryParam, |
|
deterministicGenerateK: deterministicGenerateK, |
|
recoverPubKey: recoverPubKey, |
|
sign: sign, |
|
verify: verify, |
|
verifyRaw: verifyRaw |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./ecsignature":41,"assert":157,"bigi":7,"buffer":172,"create-hmac":24,"typeforce":32}],39:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var base58check = require('bs58check') |
|
var ecdsa = require('./ecdsa') |
|
var networks = require('./networks') |
|
var randomBytes = require('randombytes') |
|
var typeForce = require('typeforce') |
|
|
|
var BigInteger = require('bigi') |
|
var ECPubKey = require('./ecpubkey') |
|
|
|
var ecurve = require('ecurve') |
|
var secp256k1 = ecurve.getCurveByName('secp256k1') |
|
|
|
function ECKey (d, compressed) { |
|
assert(d.signum() > 0, 'Private key must be greater than 0') |
|
assert(d.compareTo(ECKey.curve.n) < 0, 'Private key must be less than the curve order') |
|
|
|
var Q = ECKey.curve.G.multiply(d) |
|
|
|
this.d = d |
|
this.pub = new ECPubKey(Q, compressed) |
|
} |
|
|
|
// Constants |
|
ECKey.curve = secp256k1 |
|
|
|
// Static constructors |
|
ECKey.fromWIF = function (string) { |
|
var payload = base58check.decode(string) |
|
var compressed = false |
|
|
|
// Ignore the version byte |
|
payload = payload.slice(1) |
|
|
|
if (payload.length === 33) { |
|
assert.strictEqual(payload[32], 0x01, 'Invalid compression flag') |
|
|
|
// Truncate the compression flag |
|
payload = payload.slice(0, -1) |
|
compressed = true |
|
} |
|
|
|
assert.equal(payload.length, 32, 'Invalid WIF payload length') |
|
|
|
var d = BigInteger.fromBuffer(payload) |
|
return new ECKey(d, compressed) |
|
} |
|
|
|
ECKey.makeRandom = function (compressed, rng) { |
|
rng = rng || randomBytes |
|
|
|
var buffer = rng(32) |
|
typeForce('Buffer', buffer) |
|
assert.equal(buffer.length, 32, 'Expected 256-bit Buffer from RNG') |
|
|
|
var d = BigInteger.fromBuffer(buffer) |
|
d = d.mod(ECKey.curve.n) |
|
|
|
return new ECKey(d, compressed) |
|
} |
|
|
|
// Export functions |
|
ECKey.prototype.toWIF = function (network) { |
|
network = network || networks.bitcoin |
|
|
|
var bufferLen = this.pub.compressed ? 34 : 33 |
|
var buffer = new Buffer(bufferLen) |
|
|
|
buffer.writeUInt8(network.wif, 0) |
|
this.d.toBuffer(32).copy(buffer, 1) |
|
|
|
if (this.pub.compressed) { |
|
buffer.writeUInt8(0x01, 33) |
|
} |
|
|
|
return base58check.encode(buffer) |
|
} |
|
|
|
// Operations |
|
ECKey.prototype.sign = function (hash) { |
|
return ecdsa.sign(ECKey.curve, hash, this.d) |
|
} |
|
|
|
module.exports = ECKey |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./ecdsa":38,"./ecpubkey":40,"./networks":45,"assert":157,"bigi":7,"bs58check":9,"buffer":172,"ecurve":28,"randombytes":31,"typeforce":32}],40:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var crypto = require('./crypto') |
|
var ecdsa = require('./ecdsa') |
|
var typeForce = require('typeforce') |
|
var networks = require('./networks') |
|
|
|
var Address = require('./address') |
|
|
|
var ecurve = require('ecurve') |
|
var secp256k1 = ecurve.getCurveByName('secp256k1') |
|
|
|
function ECPubKey (Q, compressed) { |
|
if (compressed === undefined) { |
|
compressed = true |
|
} |
|
|
|
typeForce('Point', Q) |
|
typeForce('Boolean', compressed) |
|
|
|
this.compressed = compressed |
|
this.Q = Q |
|
} |
|
|
|
// Constants |
|
ECPubKey.curve = secp256k1 |
|
|
|
// Static constructors |
|
ECPubKey.fromBuffer = function (buffer) { |
|
var Q = ecurve.Point.decodeFrom(ECPubKey.curve, buffer) |
|
return new ECPubKey(Q, Q.compressed) |
|
} |
|
|
|
ECPubKey.fromHex = function (hex) { |
|
return ECPubKey.fromBuffer(new Buffer(hex, 'hex')) |
|
} |
|
|
|
// Operations |
|
ECPubKey.prototype.getAddress = function (network) { |
|
network = network || networks.bitcoin |
|
|
|
return new Address(crypto.hash160(this.toBuffer()), network.pubKeyHash) |
|
} |
|
|
|
ECPubKey.prototype.verify = function (hash, signature) { |
|
return ecdsa.verify(ECPubKey.curve, hash, signature, this.Q) |
|
} |
|
|
|
// Export functions |
|
ECPubKey.prototype.toBuffer = function () { |
|
return this.Q.getEncoded(this.compressed) |
|
} |
|
|
|
ECPubKey.prototype.toHex = function () { |
|
return this.toBuffer().toString('hex') |
|
} |
|
|
|
module.exports = ECPubKey |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./address":33,"./crypto":37,"./ecdsa":38,"./networks":45,"buffer":172,"ecurve":28,"typeforce":32}],41:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var typeForce = require('typeforce') |
|
|
|
var BigInteger = require('bigi') |
|
|
|
function ECSignature (r, s) { |
|
typeForce('BigInteger', r) |
|
typeForce('BigInteger', s) |
|
|
|
this.r = r |
|
this.s = s |
|
} |
|
|
|
ECSignature.parseCompact = function (buffer) { |
|
assert.equal(buffer.length, 65, 'Invalid signature length') |
|
var i = buffer.readUInt8(0) - 27 |
|
|
|
// At most 3 bits |
|
assert.equal(i, i & 7, 'Invalid signature parameter') |
|
var compressed = !!(i & 4) |
|
|
|
// Recovery param only |
|
i = i & 3 |
|
|
|
var r = BigInteger.fromBuffer(buffer.slice(1, 33)) |
|
var s = BigInteger.fromBuffer(buffer.slice(33)) |
|
|
|
return { |
|
compressed: compressed, |
|
i: i, |
|
signature: new ECSignature(r, s) |
|
} |
|
} |
|
|
|
ECSignature.fromDER = function (buffer) { |
|
assert.equal(buffer.readUInt8(0), 0x30, 'Not a DER sequence') |
|
assert.equal(buffer.readUInt8(1), buffer.length - 2, 'Invalid sequence length') |
|
assert.equal(buffer.readUInt8(2), 0x02, 'Expected a DER integer') |
|
|
|
var rLen = buffer.readUInt8(3) |
|
assert(rLen > 0, 'R length is zero') |
|
|
|
var offset = 4 + rLen |
|
assert.equal(buffer.readUInt8(offset), 0x02, 'Expected a DER integer (2)') |
|
|
|
var sLen = buffer.readUInt8(offset + 1) |
|
assert(sLen > 0, 'S length is zero') |
|
|
|
var rB = buffer.slice(4, offset) |
|
var sB = buffer.slice(offset + 2) |
|
offset += 2 + sLen |
|
|
|
if (rLen > 1 && rB.readUInt8(0) === 0x00) { |
|
assert(rB.readUInt8(1) & 0x80, 'R value excessively padded') |
|
} |
|
|
|
if (sLen > 1 && sB.readUInt8(0) === 0x00) { |
|
assert(sB.readUInt8(1) & 0x80, 'S value excessively padded') |
|
} |
|
|
|
assert.equal(offset, buffer.length, 'Invalid DER encoding') |
|
var r = BigInteger.fromDERInteger(rB) |
|
var s = BigInteger.fromDERInteger(sB) |
|
|
|
assert(r.signum() >= 0, 'R value is negative') |
|
assert(s.signum() >= 0, 'S value is negative') |
|
|
|
return new ECSignature(r, s) |
|
} |
|
|
|
// BIP62: 1 byte hashType flag (only 0x01, 0x02, 0x03, 0x81, 0x82 and 0x83 are allowed) |
|
ECSignature.parseScriptSignature = function (buffer) { |
|
var hashType = buffer.readUInt8(buffer.length - 1) |
|
var hashTypeMod = hashType & ~0x80 |
|
|
|
assert(hashTypeMod > 0x00 && hashTypeMod < 0x04, 'Invalid hashType ' + hashType) |
|
|
|
return { |
|
signature: ECSignature.fromDER(buffer.slice(0, -1)), |
|
hashType: hashType |
|
} |
|
} |
|
|
|
ECSignature.prototype.toCompact = function (i, compressed) { |
|
if (compressed) { |
|
i += 4 |
|
} |
|
|
|
i += 27 |
|
|
|
var buffer = new Buffer(65) |
|
buffer.writeUInt8(i, 0) |
|
|
|
this.r.toBuffer(32).copy(buffer, 1) |
|
this.s.toBuffer(32).copy(buffer, 33) |
|
|
|
return buffer |
|
} |
|
|
|
ECSignature.prototype.toDER = function () { |
|
var rBa = this.r.toDERInteger() |
|
var sBa = this.s.toDERInteger() |
|
|
|
var sequence = [] |
|
|
|
// INTEGER |
|
sequence.push(0x02, rBa.length) |
|
sequence = sequence.concat(rBa) |
|
|
|
// INTEGER |
|
sequence.push(0x02, sBa.length) |
|
sequence = sequence.concat(sBa) |
|
|
|
// SEQUENCE |
|
sequence.unshift(0x30, sequence.length) |
|
|
|
return new Buffer(sequence) |
|
} |
|
|
|
ECSignature.prototype.toScriptSignature = function (hashType) { |
|
var hashTypeMod = hashType & ~0x80 |
|
assert(hashTypeMod > 0x00 && hashTypeMod < 0x04, 'Invalid hashType ' + hashType) |
|
|
|
var hashTypeBuffer = new Buffer(1) |
|
hashTypeBuffer.writeUInt8(hashType, 0) |
|
|
|
return Buffer.concat([this.toDER(), hashTypeBuffer]) |
|
} |
|
|
|
module.exports = ECSignature |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"assert":157,"bigi":7,"buffer":172,"typeforce":32}],42:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var base58check = require('bs58check') |
|
var bcrypto = require('./crypto') |
|
var createHmac = require('create-hmac') |
|
var typeForce = require('typeforce') |
|
var networks = require('./networks') |
|
|
|
var BigInteger = require('bigi') |
|
var ECKey = require('./eckey') |
|
var ECPubKey = require('./ecpubkey') |
|
|
|
var ecurve = require('ecurve') |
|
var curve = ecurve.getCurveByName('secp256k1') |
|
|
|
function findBIP32NetworkByVersion (version) { |
|
for (var name in networks) { |
|
var network = networks[name] |
|
|
|
if (version === network.bip32.private || version === network.bip32.public) { |
|
return network |
|
} |
|
} |
|
|
|
assert(false, 'Could not find network for ' + version.toString(16)) |
|
} |
|
|
|
function HDNode (K, chainCode, network) { |
|
network = network || networks.bitcoin |
|
|
|
typeForce('Buffer', chainCode) |
|
|
|
assert.equal(chainCode.length, 32, 'Expected chainCode length of 32, got ' + chainCode.length) |
|
assert(network.bip32, 'Unknown BIP32 constants for network') |
|
|
|
this.chainCode = chainCode |
|
this.depth = 0 |
|
this.index = 0 |
|
this.parentFingerprint = 0x00000000 |
|
this.network = network |
|
|
|
if (K instanceof BigInteger) { |
|
this.privKey = new ECKey(K, true) |
|
this.pubKey = this.privKey.pub |
|
} else if (K instanceof ECKey) { |
|
assert(K.pub.compressed, 'ECKey must be compressed') |
|
this.privKey = K |
|
} else if (K instanceof ECPubKey) { |
|
assert(K.compressed, 'ECPubKey must be compressed') |
|
this.pubKey = K |
|
} else { |
|
this.pubKey = new ECPubKey(K, true) |
|
} |
|
} |
|
|
|
HDNode.MASTER_SECRET = new Buffer('Bitcoin seed') |
|
HDNode.HIGHEST_BIT = 0x80000000 |
|
HDNode.LENGTH = 78 |
|
|
|
HDNode.fromSeedBuffer = function (seed, network) { |
|
typeForce('Buffer', seed) |
|
|
|
assert(seed.length >= 16, 'Seed should be at least 128 bits') |
|
assert(seed.length <= 64, 'Seed should be at most 512 bits') |
|
|
|
var I = createHmac('sha512', HDNode.MASTER_SECRET).update(seed).digest() |
|
var IL = I.slice(0, 32) |
|
var IR = I.slice(32) |
|
|
|
// In case IL is 0 or >= n, the master key is invalid |
|
// This is handled by `new ECKey` in the HDNode constructor |
|
var pIL = BigInteger.fromBuffer(IL) |
|
|
|
return new HDNode(pIL, IR, network) |
|
} |
|
|
|
HDNode.fromSeedHex = function (hex, network) { |
|
return HDNode.fromSeedBuffer(new Buffer(hex, 'hex'), network) |
|
} |
|
|
|
HDNode.fromBase58 = function (string, network) { |
|
return HDNode.fromBuffer(base58check.decode(string), network, true) |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
HDNode.fromBuffer = function (buffer, network, __ignoreDeprecation) { |
|
if (!__ignoreDeprecation) { |
|
console.warn('HDNode.fromBuffer() is deprecated for removal in 2.x.y, use fromBase58 instead') |
|
} |
|
|
|
assert.strictEqual(buffer.length, HDNode.LENGTH, 'Invalid buffer length') |
|
|
|
// 4 byte: version bytes |
|
var version = buffer.readUInt32BE(0) |
|
|
|
if (network) { |
|
assert(version === network.bip32.private || version === network.bip32.public, "Network doesn't match") |
|
|
|
// auto-detect |
|
} else { |
|
network = findBIP32NetworkByVersion(version) |
|
} |
|
|
|
// 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, ... |
|
var depth = buffer.readUInt8(4) |
|
|
|
// 4 bytes: the fingerprint of the parent's key (0x00000000 if master key) |
|
var parentFingerprint = buffer.readUInt32BE(5) |
|
if (depth === 0) { |
|
assert.strictEqual(parentFingerprint, 0x00000000, 'Invalid parent fingerprint') |
|
} |
|
|
|
// 4 bytes: child number. This is the number i in xi = xpar/i, with xi the key being serialized. |
|
// This is encoded in MSB order. (0x00000000 if master key) |
|
var index = buffer.readUInt32BE(9) |
|
assert(depth > 0 || index === 0, 'Invalid index') |
|
|
|
// 32 bytes: the chain code |
|
var chainCode = buffer.slice(13, 45) |
|
var data, hd |
|
|
|
// 33 bytes: private key data (0x00 + k) |
|
if (version === network.bip32.private) { |
|
assert.strictEqual(buffer.readUInt8(45), 0x00, 'Invalid private key') |
|
data = buffer.slice(46, 78) |
|
var d = BigInteger.fromBuffer(data) |
|
hd = new HDNode(d, chainCode, network) |
|
|
|
// 33 bytes: public key data (0x02 + X or 0x03 + X) |
|
} else { |
|
data = buffer.slice(45, 78) |
|
var Q = ecurve.Point.decodeFrom(curve, data) |
|
assert.equal(Q.compressed, true, 'Invalid public key') |
|
|
|
// Verify that the X coordinate in the public point corresponds to a point on the curve. |
|
// If not, the extended public key is invalid. |
|
curve.validate(Q) |
|
|
|
hd = new HDNode(Q, chainCode, network) |
|
} |
|
|
|
hd.depth = depth |
|
hd.index = index |
|
hd.parentFingerprint = parentFingerprint |
|
|
|
return hd |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
HDNode.fromHex = function (hex, network) { |
|
return HDNode.fromBuffer(new Buffer(hex, 'hex'), network) |
|
} |
|
|
|
HDNode.prototype.getIdentifier = function () { |
|
return bcrypto.hash160(this.pubKey.toBuffer()) |
|
} |
|
|
|
HDNode.prototype.getFingerprint = function () { |
|
return this.getIdentifier().slice(0, 4) |
|
} |
|
|
|
HDNode.prototype.getAddress = function () { |
|
return this.pubKey.getAddress(this.network) |
|
} |
|
|
|
HDNode.prototype.neutered = function () { |
|
var neutered = new HDNode(this.pubKey.Q, this.chainCode, this.network) |
|
neutered.depth = this.depth |
|
neutered.index = this.index |
|
neutered.parentFingerprint = this.parentFingerprint |
|
|
|
return neutered |
|
} |
|
|
|
HDNode.prototype.toBase58 = function (isPrivate) { |
|
return base58check.encode(this.toBuffer(isPrivate, true)) |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
HDNode.prototype.toBuffer = function (isPrivate, __ignoreDeprecation) { |
|
if (isPrivate === undefined) { |
|
isPrivate = !!this.privKey |
|
|
|
// FIXME: remove in 2.x.y |
|
} else { |
|
console.warn('isPrivate flag is deprecated, please use the .neutered() method instead') |
|
} |
|
|
|
if (!__ignoreDeprecation) { |
|
console.warn('HDNode.toBuffer() is deprecated for removal in 2.x.y, use toBase58 instead') |
|
} |
|
|
|
// Version |
|
var version = isPrivate ? this.network.bip32.private : this.network.bip32.public |
|
var buffer = new Buffer(HDNode.LENGTH) |
|
|
|
// 4 bytes: version bytes |
|
buffer.writeUInt32BE(version, 0) |
|
|
|
// Depth |
|
// 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, .... |
|
buffer.writeUInt8(this.depth, 4) |
|
|
|
// 4 bytes: the fingerprint of the parent's key (0x00000000 if master key) |
|
buffer.writeUInt32BE(this.parentFingerprint, 5) |
|
|
|
// 4 bytes: child number. This is the number i in xi = xpar/i, with xi the key being serialized. |
|
// This is encoded in Big endian. (0x00000000 if master key) |
|
buffer.writeUInt32BE(this.index, 9) |
|
|
|
// 32 bytes: the chain code |
|
this.chainCode.copy(buffer, 13) |
|
|
|
// 33 bytes: the public key or private key data |
|
if (isPrivate) { |
|
// FIXME: remove in 2.x.y |
|
assert(this.privKey, 'Missing private key') |
|
|
|
// 0x00 + k for private keys |
|
buffer.writeUInt8(0, 45) |
|
this.privKey.d.toBuffer(32).copy(buffer, 46) |
|
} else { |
|
// X9.62 encoding for public keys |
|
this.pubKey.toBuffer().copy(buffer, 45) |
|
} |
|
|
|
return buffer |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
HDNode.prototype.toHex = function (isPrivate) { |
|
return this.toBuffer(isPrivate).toString('hex') |
|
} |
|
|
|
// https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#child-key-derivation-ckd-functions |
|
HDNode.prototype.derive = function (index) { |
|
var isHardened = index >= HDNode.HIGHEST_BIT |
|
var indexBuffer = new Buffer(4) |
|
indexBuffer.writeUInt32BE(index, 0) |
|
|
|
var data |
|
|
|
// Hardened child |
|
if (isHardened) { |
|
assert(this.privKey, 'Could not derive hardened child key') |
|
|
|
// data = 0x00 || ser256(kpar) || ser32(index) |
|
data = Buffer.concat([ |
|
this.privKey.d.toBuffer(33), |
|
indexBuffer |
|
]) |
|
|
|
// Normal child |
|
} else { |
|
// data = serP(point(kpar)) || ser32(index) |
|
// = serP(Kpar) || ser32(index) |
|
data = Buffer.concat([ |
|
this.pubKey.toBuffer(), |
|
indexBuffer |
|
]) |
|
} |
|
|
|
var I = createHmac('sha512', this.chainCode).update(data).digest() |
|
var IL = I.slice(0, 32) |
|
var IR = I.slice(32) |
|
|
|
var pIL = BigInteger.fromBuffer(IL) |
|
|
|
// In case parse256(IL) >= n, proceed with the next value for i |
|
if (pIL.compareTo(curve.n) >= 0) { |
|
return this.derive(index + 1) |
|
} |
|
|
|
// Private parent key -> private child key |
|
var hd |
|
if (this.privKey) { |
|
// ki = parse256(IL) + kpar (mod n) |
|
var ki = pIL.add(this.privKey.d).mod(curve.n) |
|
|
|
// In case ki == 0, proceed with the next value for i |
|
if (ki.signum() === 0) { |
|
return this.derive(index + 1) |
|
} |
|
|
|
hd = new HDNode(ki, IR, this.network) |
|
|
|
// Public parent key -> public child key |
|
} else { |
|
// Ki = point(parse256(IL)) + Kpar |
|
// = G*IL + Kpar |
|
var Ki = curve.G.multiply(pIL).add(this.pubKey.Q) |
|
|
|
// In case Ki is the point at infinity, proceed with the next value for i |
|
if (curve.isInfinity(Ki)) { |
|
return this.derive(index + 1) |
|
} |
|
|
|
hd = new HDNode(Ki, IR, this.network) |
|
} |
|
|
|
hd.depth = this.depth + 1 |
|
hd.index = index |
|
hd.parentFingerprint = this.getFingerprint().readUInt32BE(0) |
|
|
|
return hd |
|
} |
|
|
|
HDNode.prototype.deriveHardened = function (index) { |
|
// Only derives hardened private keys by default |
|
return this.derive(index + HDNode.HIGHEST_BIT) |
|
} |
|
|
|
HDNode.prototype.toString = HDNode.prototype.toBase58 |
|
|
|
module.exports = HDNode |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./crypto":37,"./eckey":39,"./ecpubkey":40,"./networks":45,"assert":157,"bigi":7,"bs58check":9,"buffer":172,"create-hmac":24,"ecurve":28,"typeforce":32}],43:[function(require,module,exports){ |
|
module.exports = { |
|
Address: require('./address'), |
|
base58check: require('./base58check'), |
|
Block: require('./block'), |
|
bufferutils: require('./bufferutils'), |
|
crypto: require('./crypto'), |
|
ecdsa: require('./ecdsa'), |
|
ECKey: require('./eckey'), |
|
ECPubKey: require('./ecpubkey'), |
|
ECSignature: require('./ecsignature'), |
|
Message: require('./message'), |
|
opcodes: require('./opcodes'), |
|
HDNode: require('./hdnode'), |
|
Script: require('./script'), |
|
scripts: require('./scripts'), |
|
Transaction: require('./transaction'), |
|
TransactionBuilder: require('./transaction_builder'), |
|
networks: require('./networks'), |
|
Wallet: require('./wallet') |
|
} |
|
|
|
},{"./address":33,"./base58check":34,"./block":35,"./bufferutils":36,"./crypto":37,"./ecdsa":38,"./eckey":39,"./ecpubkey":40,"./ecsignature":41,"./hdnode":42,"./message":44,"./networks":45,"./opcodes":46,"./script":47,"./scripts":48,"./transaction":49,"./transaction_builder":50,"./wallet":51}],44:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var bufferutils = require('./bufferutils') |
|
var crypto = require('./crypto') |
|
var ecdsa = require('./ecdsa') |
|
var networks = require('./networks') |
|
|
|
var BigInteger = require('bigi') |
|
var ECPubKey = require('./ecpubkey') |
|
var ECSignature = require('./ecsignature') |
|
|
|
var ecurve = require('ecurve') |
|
var ecparams = ecurve.getCurveByName('secp256k1') |
|
|
|
function magicHash (message, network) { |
|
var magicPrefix = new Buffer(network.magicPrefix) |
|
var messageBuffer = new Buffer(message) |
|
var lengthBuffer = bufferutils.varIntBuffer(messageBuffer.length) |
|
|
|
var buffer = Buffer.concat([magicPrefix, lengthBuffer, messageBuffer]) |
|
return crypto.hash256(buffer) |
|
} |
|
|
|
function sign (privKey, message, network) { |
|
network = network || networks.bitcoin |
|
|
|
var hash = magicHash(message, network) |
|
var signature = privKey.sign(hash) |
|
var e = BigInteger.fromBuffer(hash) |
|
var i = ecdsa.calcPubKeyRecoveryParam(ecparams, e, signature, privKey.pub.Q) |
|
|
|
return signature.toCompact(i, privKey.pub.compressed) |
|
} |
|
|
|
// TODO: network could be implied from address |
|
function verify (address, signature, message, network) { |
|
if (!Buffer.isBuffer(signature)) { |
|
signature = new Buffer(signature, 'base64') |
|
} |
|
|
|
network = network || networks.bitcoin |
|
|
|
var hash = magicHash(message, network) |
|
var parsed = ECSignature.parseCompact(signature) |
|
var e = BigInteger.fromBuffer(hash) |
|
var Q = ecdsa.recoverPubKey(ecparams, e, parsed.signature, parsed.i) |
|
|
|
var pubKey = new ECPubKey(Q, parsed.compressed) |
|
return pubKey.getAddress(network).toString() === address.toString() |
|
} |
|
|
|
module.exports = { |
|
magicHash: magicHash, |
|
sign: sign, |
|
verify: verify |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./bufferutils":36,"./crypto":37,"./ecdsa":38,"./ecpubkey":40,"./ecsignature":41,"./networks":45,"bigi":7,"buffer":172,"ecurve":28}],45:[function(require,module,exports){ |
|
// https://en.bitcoin.it/wiki/List_of_address_prefixes |
|
// Dogecoin BIP32 is a proposed standard: https://bitcointalk.org/index.php?topic=409731 |
|
|
|
var networks = { |
|
bitcoin: { |
|
magicPrefix: '\x18Bitcoin Signed Message:\n', |
|
bip32: { |
|
public: 0x0488b21e, |
|
private: 0x0488ade4 |
|
}, |
|
pubKeyHash: 0x00, |
|
scriptHash: 0x05, |
|
wif: 0x80, |
|
dustThreshold: 546, // https://github.com/bitcoin/bitcoin/blob/v0.9.2/src/core.h#L151-L162 |
|
feePerKb: 10000, // https://github.com/bitcoin/bitcoin/blob/v0.9.2/src/main.cpp#L53 |
|
estimateFee: estimateFee('bitcoin') |
|
}, |
|
testnet: { |
|
magicPrefix: '\x18Bitcoin Signed Message:\n', |
|
bip32: { |
|
public: 0x043587cf, |
|
private: 0x04358394 |
|
}, |
|
pubKeyHash: 0x6f, |
|
scriptHash: 0xc4, |
|
wif: 0xef, |
|
dustThreshold: 546, |
|
feePerKb: 10000, |
|
estimateFee: estimateFee('testnet') |
|
}, |
|
litecoin: { |
|
magicPrefix: '\x19Litecoin Signed Message:\n', |
|
bip32: { |
|
public: 0x019da462, |
|
private: 0x019d9cfe |
|
}, |
|
pubKeyHash: 0x30, |
|
scriptHash: 0x05, |
|
wif: 0xb0, |
|
dustThreshold: 0, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.cpp#L360-L365 |
|
dustSoftThreshold: 100000, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.h#L53 |
|
feePerKb: 100000, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.cpp#L56 |
|
estimateFee: estimateFee('litecoin') |
|
}, |
|
dogecoin: { |
|
magicPrefix: '\x19Dogecoin Signed Message:\n', |
|
bip32: { |
|
public: 0x02facafd, |
|
private: 0x02fac398 |
|
}, |
|
pubKeyHash: 0x1e, |
|
scriptHash: 0x16, |
|
wif: 0x9e, |
|
dustThreshold: 0, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/core.h#L155-L160 |
|
dustSoftThreshold: 100000000, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/main.h#L62 |
|
feePerKb: 100000000, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/main.cpp#L58 |
|
estimateFee: estimateFee('dogecoin') |
|
}, |
|
viacoin: { |
|
magicPrefix: '\x18Viacoin Signed Message:\n', |
|
bip32: { |
|
public: 0x0488b21e, |
|
private: 0x0488ade4 |
|
}, |
|
pubKeyHash: 0x47, |
|
scriptHash: 0x21, |
|
wif: 0xc7, |
|
dustThreshold: 560, |
|
dustSoftThreshold: 100000, |
|
feePerKb: 100000, // |
|
estimateFee: estimateFee('viacoin') |
|
}, |
|
viacointestnet: { |
|
magicPrefix: '\x18Viacoin Signed Message:\n', |
|
bip32: { |
|
public: 0x043587cf, |
|
private: 0x04358394 |
|
}, |
|
pubKeyHash: 0x7f, |
|
scriptHash: 0xc4, |
|
wif: 0xff, |
|
dustThreshold: 560, |
|
dustSoftThreshold: 100000, |
|
feePerKb: 100000, |
|
estimateFee: estimateFee('viacointestnet') |
|
}, |
|
gamerscoin: { |
|
magicPrefix: '\x19Gamerscoin Signed Message:\n', |
|
bip32: { |
|
public: 0x019da462, |
|
private: 0x019d9cfe |
|
}, |
|
pubKeyHash: 0x26, |
|
scriptHash: 0x05, |
|
wif: 0xA6, |
|
dustThreshold: 0, // https://github.com/gamers-coin/gamers-coinv3/blob/master/src/main.cpp#L358-L363 |
|
dustSoftThreshold: 100000, // https://github.com/gamers-coin/gamers-coinv3/blob/master/src/main.cpp#L51 |
|
feePerKb: 100000, // https://github.com/gamers-coin/gamers-coinv3/blob/master/src/main.cpp#L54 |
|
estimateFee: estimateFee('gamerscoin') |
|
}, |
|
jumbucks: { |
|
magicPrefix: '\x19Jumbucks Signed Message:\n', |
|
bip32: { |
|
public: 0x037a689a, |
|
private: 0x037a6460 |
|
}, |
|
pubKeyHash: 0x2b, |
|
scriptHash: 0x05, |
|
wif: 0xab, |
|
dustThreshold: 0, |
|
dustSoftThreshold: 10000, |
|
feePerKb: 10000, |
|
estimateFee: estimateFee('jumbucks') |
|
}, |
|
zetacoin: { |
|
magicPrefix: '\x18Zetacoin Signed Message:\n', |
|
bip32: { |
|
public: 0x0488b21e, |
|
private: 0x0488ade4 |
|
}, |
|
pubKeyHash: 0x50, |
|
scriptHash: 0x09, |
|
wif: 0xe0, |
|
dustThreshold: 546, // https://github.com/zetacoin/zetacoin/blob/master/src/core.h#L159 |
|
feePerKb: 10000, // https://github.com/zetacoin/zetacoin/blob/master/src/main.cpp#L54 |
|
estimateFee: estimateFee('zetacoin') |
|
} |
|
} |
|
|
|
function estimateFee (type) { |
|
return function (tx) { |
|
var network = networks[type] |
|
var baseFee = network.feePerKb |
|
var byteSize = tx.toBuffer().length |
|
|
|
var fee = baseFee * Math.ceil(byteSize / 1000) |
|
if (network.dustSoftThreshold === undefined) return fee |
|
|
|
tx.outs.forEach(function (e) { |
|
if (e.value < network.dustSoftThreshold) { |
|
fee += baseFee |
|
} |
|
}) |
|
|
|
return fee |
|
} |
|
} |
|
|
|
module.exports = networks |
|
|
|
},{}],46:[function(require,module,exports){ |
|
module.exports = { |
|
// push value |
|
OP_FALSE: 0, |
|
OP_0: 0, |
|
OP_PUSHDATA1: 76, |
|
OP_PUSHDATA2: 77, |
|
OP_PUSHDATA4: 78, |
|
OP_1NEGATE: 79, |
|
OP_RESERVED: 80, |
|
OP_1: 81, |
|
OP_TRUE: 81, |
|
OP_2: 82, |
|
OP_3: 83, |
|
OP_4: 84, |
|
OP_5: 85, |
|
OP_6: 86, |
|
OP_7: 87, |
|
OP_8: 88, |
|
OP_9: 89, |
|
OP_10: 90, |
|
OP_11: 91, |
|
OP_12: 92, |
|
OP_13: 93, |
|
OP_14: 94, |
|
OP_15: 95, |
|
OP_16: 96, |
|
|
|
// control |
|
OP_NOP: 97, |
|
OP_VER: 98, |
|
OP_IF: 99, |
|
OP_NOTIF: 100, |
|
OP_VERIF: 101, |
|
OP_VERNOTIF: 102, |
|
OP_ELSE: 103, |
|
OP_ENDIF: 104, |
|
OP_VERIFY: 105, |
|
OP_RETURN: 106, |
|
|
|
// stack ops |
|
OP_TOALTSTACK: 107, |
|
OP_FROMALTSTACK: 108, |
|
OP_2DROP: 109, |
|
OP_2DUP: 110, |
|
OP_3DUP: 111, |
|
OP_2OVER: 112, |
|
OP_2ROT: 113, |
|
OP_2SWAP: 114, |
|
OP_IFDUP: 115, |
|
OP_DEPTH: 116, |
|
OP_DROP: 117, |
|
OP_DUP: 118, |
|
OP_NIP: 119, |
|
OP_OVER: 120, |
|
OP_PICK: 121, |
|
OP_ROLL: 122, |
|
OP_ROT: 123, |
|
OP_SWAP: 124, |
|
OP_TUCK: 125, |
|
|
|
// splice ops |
|
OP_CAT: 126, |
|
OP_SUBSTR: 127, |
|
OP_LEFT: 128, |
|
OP_RIGHT: 129, |
|
OP_SIZE: 130, |
|
|
|
// bit logic |
|
OP_INVERT: 131, |
|
OP_AND: 132, |
|
OP_OR: 133, |
|
OP_XOR: 134, |
|
OP_EQUAL: 135, |
|
OP_EQUALVERIFY: 136, |
|
OP_RESERVED1: 137, |
|
OP_RESERVED2: 138, |
|
|
|
// numeric |
|
OP_1ADD: 139, |
|
OP_1SUB: 140, |
|
OP_2MUL: 141, |
|
OP_2DIV: 142, |
|
OP_NEGATE: 143, |
|
OP_ABS: 144, |
|
OP_NOT: 145, |
|
OP_0NOTEQUAL: 146, |
|
|
|
OP_ADD: 147, |
|
OP_SUB: 148, |
|
OP_MUL: 149, |
|
OP_DIV: 150, |
|
OP_MOD: 151, |
|
OP_LSHIFT: 152, |
|
OP_RSHIFT: 153, |
|
|
|
OP_BOOLAND: 154, |
|
OP_BOOLOR: 155, |
|
OP_NUMEQUAL: 156, |
|
OP_NUMEQUALVERIFY: 157, |
|
OP_NUMNOTEQUAL: 158, |
|
OP_LESSTHAN: 159, |
|
OP_GREATERTHAN: 160, |
|
OP_LESSTHANOREQUAL: 161, |
|
OP_GREATERTHANOREQUAL: 162, |
|
OP_MIN: 163, |
|
OP_MAX: 164, |
|
|
|
OP_WITHIN: 165, |
|
|
|
// crypto |
|
OP_RIPEMD160: 166, |
|
OP_SHA1: 167, |
|
OP_SHA256: 168, |
|
OP_HASH160: 169, |
|
OP_HASH256: 170, |
|
OP_CODESEPARATOR: 171, |
|
OP_CHECKSIG: 172, |
|
OP_CHECKSIGVERIFY: 173, |
|
OP_CHECKMULTISIG: 174, |
|
OP_CHECKMULTISIGVERIFY: 175, |
|
|
|
// expansion |
|
OP_NOP1: 176, |
|
OP_NOP2: 177, |
|
OP_NOP3: 178, |
|
OP_NOP4: 179, |
|
OP_NOP5: 180, |
|
OP_NOP6: 181, |
|
OP_NOP7: 182, |
|
OP_NOP8: 183, |
|
OP_NOP9: 184, |
|
OP_NOP10: 185, |
|
|
|
// template matching params |
|
OP_PUBKEYHASH: 253, |
|
OP_PUBKEY: 254, |
|
OP_INVALIDOPCODE: 255 |
|
} |
|
|
|
},{}],47:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var bufferutils = require('./bufferutils') |
|
var crypto = require('./crypto') |
|
var typeForce = require('typeforce') |
|
var opcodes = require('./opcodes') |
|
|
|
function Script (buffer, chunks) { |
|
typeForce('Buffer', buffer) |
|
typeForce('Array', chunks) |
|
|
|
this.buffer = buffer |
|
this.chunks = chunks |
|
} |
|
|
|
Script.fromASM = function (asm) { |
|
var strChunks = asm.split(' ') |
|
var chunks = strChunks.map(function (strChunk) { |
|
// opcode |
|
if (strChunk in opcodes) { |
|
return opcodes[strChunk] |
|
|
|
// data chunk |
|
} else { |
|
return new Buffer(strChunk, 'hex') |
|
} |
|
}) |
|
|
|
return Script.fromChunks(chunks) |
|
} |
|
|
|
Script.fromBuffer = function (buffer) { |
|
var chunks = [] |
|
var i = 0 |
|
|
|
while (i < buffer.length) { |
|
var opcode = buffer.readUInt8(i) |
|
|
|
// data chunk |
|
if ((opcode > opcodes.OP_0) && (opcode <= opcodes.OP_PUSHDATA4)) { |
|
var d = bufferutils.readPushDataInt(buffer, i) |
|
|
|
// did reading a pushDataInt fail? return non-chunked script |
|
if (d === null) return new Script(buffer, []) |
|
i += d.size |
|
|
|
// attempt to read too much data? |
|
if (i + d.number > buffer.length) return new Script(buffer, []) |
|
|
|
var data = buffer.slice(i, i + d.number) |
|
i += d.number |
|
|
|
chunks.push(data) |
|
|
|
// opcode |
|
} else { |
|
chunks.push(opcode) |
|
|
|
i += 1 |
|
} |
|
} |
|
|
|
return new Script(buffer, chunks) |
|
} |
|
|
|
Script.fromChunks = function (chunks) { |
|
typeForce('Array', chunks) |
|
|
|
var bufferSize = chunks.reduce(function (accum, chunk) { |
|
// data chunk |
|
if (Buffer.isBuffer(chunk)) { |
|
return accum + bufferutils.pushDataSize(chunk.length) + chunk.length |
|
} |
|
|
|
// opcode |
|
return accum + 1 |
|
}, 0.0) |
|
|
|
var buffer = new Buffer(bufferSize) |
|
var offset = 0 |
|
|
|
chunks.forEach(function (chunk) { |
|
// data chunk |
|
if (Buffer.isBuffer(chunk)) { |
|
offset += bufferutils.writePushDataInt(buffer, chunk.length, offset) |
|
|
|
chunk.copy(buffer, offset) |
|
offset += chunk.length |
|
|
|
// opcode |
|
} else { |
|
buffer.writeUInt8(chunk, offset) |
|
offset += 1 |
|
} |
|
}) |
|
|
|
assert.equal(offset, buffer.length, 'Could not decode chunks') |
|
return new Script(buffer, chunks) |
|
} |
|
|
|
Script.fromHex = function (hex) { |
|
return Script.fromBuffer(new Buffer(hex, 'hex')) |
|
} |
|
|
|
Script.EMPTY = Script.fromChunks([]) |
|
|
|
Script.prototype.getHash = function () { |
|
return crypto.hash160(this.buffer) |
|
} |
|
|
|
// FIXME: doesn't work for data chunks, maybe time to use buffertools.compare... |
|
Script.prototype.without = function (needle) { |
|
return Script.fromChunks(this.chunks.filter(function (op) { |
|
return op !== needle |
|
})) |
|
} |
|
|
|
var reverseOps = [] |
|
for (var op in opcodes) { |
|
var code = opcodes[op] |
|
reverseOps[code] = op |
|
} |
|
|
|
Script.prototype.toASM = function () { |
|
return this.chunks.map(function (chunk) { |
|
// data chunk |
|
if (Buffer.isBuffer(chunk)) { |
|
return chunk.toString('hex') |
|
|
|
// opcode |
|
} else { |
|
return reverseOps[chunk] |
|
} |
|
}).join(' ') |
|
} |
|
|
|
Script.prototype.toBuffer = function () { |
|
return this.buffer |
|
} |
|
|
|
Script.prototype.toHex = function () { |
|
return this.toBuffer().toString('hex') |
|
} |
|
|
|
module.exports = Script |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./bufferutils":36,"./crypto":37,"./opcodes":46,"assert":157,"buffer":172,"typeforce":32}],48:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var ops = require('./opcodes') |
|
var typeForce = require('typeforce') |
|
|
|
var ecurve = require('ecurve') |
|
var curve = ecurve.getCurveByName('secp256k1') |
|
|
|
var ECSignature = require('./ecsignature') |
|
var Script = require('./script') |
|
|
|
function isCanonicalPubKey (buffer) { |
|
if (!Buffer.isBuffer(buffer)) return false |
|
|
|
try { |
|
ecurve.Point.decodeFrom(curve, buffer) |
|
} catch (e) { |
|
if (!(e.message.match(/Invalid sequence (length|tag)/))) |
|
throw e |
|
|
|
return false |
|
} |
|
|
|
return true |
|
} |
|
|
|
function isCanonicalSignature (buffer) { |
|
if (!Buffer.isBuffer(buffer)) return false |
|
|
|
try { |
|
ECSignature.parseScriptSignature(buffer) |
|
} catch (e) { |
|
if (!(e.message.match(/Not a DER sequence|Invalid sequence length|Expected a DER integer|R length is zero|S length is zero|R value excessively padded|S value excessively padded|R value is negative|S value is negative|Invalid hashType/))) { |
|
throw e |
|
} |
|
|
|
return false |
|
} |
|
|
|
return true |
|
} |
|
|
|
function isPubKeyHashInput (script) { |
|
return script.chunks.length === 2 && |
|
isCanonicalSignature(script.chunks[0]) && |
|
isCanonicalPubKey(script.chunks[1]) |
|
} |
|
|
|
function isPubKeyHashOutput (script) { |
|
return script.chunks.length === 5 && |
|
script.chunks[0] === ops.OP_DUP && |
|
script.chunks[1] === ops.OP_HASH160 && |
|
Buffer.isBuffer(script.chunks[2]) && |
|
script.chunks[2].length === 20 && |
|
script.chunks[3] === ops.OP_EQUALVERIFY && |
|
script.chunks[4] === ops.OP_CHECKSIG |
|
} |
|
|
|
function isPubKeyInput (script) { |
|
return script.chunks.length === 1 && |
|
isCanonicalSignature(script.chunks[0]) |
|
} |
|
|
|
function isPubKeyOutput (script) { |
|
return script.chunks.length === 2 && |
|
isCanonicalPubKey(script.chunks[0]) && |
|
script.chunks[1] === ops.OP_CHECKSIG |
|
} |
|
|
|
function isScriptHashInput (script, allowIncomplete) { |
|
if (script.chunks.length < 2) return false |
|
|
|
var lastChunk = script.chunks[script.chunks.length - 1] |
|
if (!Buffer.isBuffer(lastChunk)) return false |
|
|
|
var scriptSig = Script.fromChunks(script.chunks.slice(0, -1)) |
|
var redeemScript = Script.fromBuffer(lastChunk) |
|
|
|
// is redeemScript a valid script? |
|
if (redeemScript.chunks.length === 0) return false |
|
|
|
return classifyInput(scriptSig, allowIncomplete) === classifyOutput(redeemScript) |
|
} |
|
|
|
function isScriptHashOutput (script) { |
|
return script.chunks.length === 3 && |
|
script.chunks[0] === ops.OP_HASH160 && |
|
Buffer.isBuffer(script.chunks[1]) && |
|
script.chunks[1].length === 20 && |
|
script.chunks[2] === ops.OP_EQUAL |
|
} |
|
|
|
// allowIncomplete is to account for combining signatures |
|
// See https://github.com/bitcoin/bitcoin/blob/f425050546644a36b0b8e0eb2f6934a3e0f6f80f/src/script/sign.cpp#L195-L197 |
|
function isMultisigInput (script, allowIncomplete) { |
|
if (script.chunks.length < 2) return false |
|
if (script.chunks[0] !== ops.OP_0) return false |
|
|
|
if (allowIncomplete) { |
|
return script.chunks.slice(1).every(function (chunk) { |
|
return chunk === ops.OP_0 || isCanonicalSignature(chunk) |
|
}) |
|
} |
|
|
|
return script.chunks.slice(1).every(isCanonicalSignature) |
|
} |
|
|
|
function isMultisigOutput (script) { |
|
if (script.chunks.length < 4) return false |
|
if (script.chunks[script.chunks.length - 1] !== ops.OP_CHECKMULTISIG) return false |
|
|
|
var mOp = script.chunks[0] |
|
if (mOp === ops.OP_0) return false |
|
if (mOp < ops.OP_1) return false |
|
if (mOp > ops.OP_16) return false |
|
|
|
var nOp = script.chunks[script.chunks.length - 2] |
|
if (nOp === ops.OP_0) return false |
|
if (nOp < ops.OP_1) return false |
|
if (nOp > ops.OP_16) return false |
|
|
|
var m = mOp - (ops.OP_1 - 1) |
|
var n = nOp - (ops.OP_1 - 1) |
|
if (n < m) return false |
|
|
|
var pubKeys = script.chunks.slice(1, -2) |
|
if (n < pubKeys.length) return false |
|
|
|
return pubKeys.every(isCanonicalPubKey) |
|
} |
|
|
|
function isNullDataOutput (script) { |
|
return script.chunks[0] === ops.OP_RETURN |
|
} |
|
|
|
function classifyOutput (script) { |
|
typeForce('Script', script) |
|
|
|
if (isPubKeyHashOutput(script)) { |
|
return 'pubkeyhash' |
|
} else if (isScriptHashOutput(script)) { |
|
return 'scripthash' |
|
} else if (isMultisigOutput(script)) { |
|
return 'multisig' |
|
} else if (isPubKeyOutput(script)) { |
|
return 'pubkey' |
|
} else if (isNullDataOutput(script)) { |
|
return 'nulldata' |
|
} |
|
|
|
return 'nonstandard' |
|
} |
|
|
|
function classifyInput (script, allowIncomplete) { |
|
typeForce('Script', script) |
|
|
|
if (isPubKeyHashInput(script)) { |
|
return 'pubkeyhash' |
|
} else if (isMultisigInput(script, allowIncomplete)) { |
|
return 'multisig' |
|
} else if (isScriptHashInput(script, allowIncomplete)) { |
|
return 'scripthash' |
|
} else if (isPubKeyInput(script)) { |
|
return 'pubkey' |
|
} |
|
|
|
return 'nonstandard' |
|
} |
|
|
|
// Standard Script Templates |
|
// {pubKey} OP_CHECKSIG |
|
function pubKeyOutput (pubKey) { |
|
return Script.fromChunks([ |
|
pubKey.toBuffer(), |
|
ops.OP_CHECKSIG |
|
]) |
|
} |
|
|
|
// OP_DUP OP_HASH160 {pubKeyHash} OP_EQUALVERIFY OP_CHECKSIG |
|
function pubKeyHashOutput (hash) { |
|
typeForce('Buffer', hash) |
|
|
|
return Script.fromChunks([ |
|
ops.OP_DUP, |
|
ops.OP_HASH160, |
|
hash, |
|
ops.OP_EQUALVERIFY, |
|
ops.OP_CHECKSIG |
|
]) |
|
} |
|
|
|
// OP_HASH160 {scriptHash} OP_EQUAL |
|
function scriptHashOutput (hash) { |
|
typeForce('Buffer', hash) |
|
|
|
return Script.fromChunks([ |
|
ops.OP_HASH160, |
|
hash, |
|
ops.OP_EQUAL |
|
]) |
|
} |
|
|
|
// m [pubKeys ...] n OP_CHECKMULTISIG |
|
function multisigOutput (m, pubKeys) { |
|
typeForce(['ECPubKey'], pubKeys) |
|
|
|
assert(pubKeys.length >= m, 'Not enough pubKeys provided') |
|
|
|
var pubKeyBuffers = pubKeys.map(function (pubKey) { |
|
return pubKey.toBuffer() |
|
}) |
|
var n = pubKeys.length |
|
|
|
return Script.fromChunks([].concat( |
|
(ops.OP_1 - 1) + m, |
|
pubKeyBuffers, |
|
(ops.OP_1 - 1) + n, |
|
ops.OP_CHECKMULTISIG |
|
)) |
|
} |
|
|
|
// {signature} |
|
function pubKeyInput (signature) { |
|
typeForce('Buffer', signature) |
|
|
|
return Script.fromChunks([signature]) |
|
} |
|
|
|
// {signature} {pubKey} |
|
function pubKeyHashInput (signature, pubKey) { |
|
typeForce('Buffer', signature) |
|
|
|
return Script.fromChunks([signature, pubKey.toBuffer()]) |
|
} |
|
|
|
// <scriptSig> {serialized scriptPubKey script} |
|
function scriptHashInput (scriptSig, scriptPubKey) { |
|
return Script.fromChunks([].concat( |
|
scriptSig.chunks, |
|
scriptPubKey.toBuffer() |
|
)) |
|
} |
|
|
|
// OP_0 [signatures ...] |
|
function multisigInput (signatures, scriptPubKey) { |
|
if (scriptPubKey) { |
|
assert(isMultisigOutput(scriptPubKey)) |
|
|
|
var mOp = scriptPubKey.chunks[0] |
|
var nOp = scriptPubKey.chunks[scriptPubKey.chunks.length - 2] |
|
var m = mOp - (ops.OP_1 - 1) |
|
var n = nOp - (ops.OP_1 - 1) |
|
|
|
assert(signatures.length >= m, 'Not enough signatures provided') |
|
assert(signatures.length <= n, 'Too many signatures provided') |
|
} |
|
|
|
return Script.fromChunks([].concat(ops.OP_0, signatures)) |
|
} |
|
|
|
function nullDataOutput (data) { |
|
return Script.fromChunks([ops.OP_RETURN, data]) |
|
} |
|
|
|
module.exports = { |
|
isCanonicalPubKey: isCanonicalPubKey, |
|
isCanonicalSignature: isCanonicalSignature, |
|
isPubKeyHashInput: isPubKeyHashInput, |
|
isPubKeyHashOutput: isPubKeyHashOutput, |
|
isPubKeyInput: isPubKeyInput, |
|
isPubKeyOutput: isPubKeyOutput, |
|
isScriptHashInput: isScriptHashInput, |
|
isScriptHashOutput: isScriptHashOutput, |
|
isMultisigInput: isMultisigInput, |
|
isMultisigOutput: isMultisigOutput, |
|
isNullDataOutput: isNullDataOutput, |
|
classifyOutput: classifyOutput, |
|
classifyInput: classifyInput, |
|
pubKeyOutput: pubKeyOutput, |
|
pubKeyHashOutput: pubKeyHashOutput, |
|
scriptHashOutput: scriptHashOutput, |
|
multisigOutput: multisigOutput, |
|
pubKeyInput: pubKeyInput, |
|
pubKeyHashInput: pubKeyHashInput, |
|
scriptHashInput: scriptHashInput, |
|
multisigInput: multisigInput, |
|
dataOutput: function (data) { |
|
console.warn('dataOutput is deprecated, use nullDataOutput by 2.0.0') |
|
return nullDataOutput(data) |
|
}, |
|
nullDataOutput: nullDataOutput |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./ecsignature":41,"./opcodes":46,"./script":47,"assert":157,"buffer":172,"ecurve":28,"typeforce":32}],49:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var bufferutils = require('./bufferutils') |
|
var crypto = require('./crypto') |
|
var typeForce = require('typeforce') |
|
var opcodes = require('./opcodes') |
|
var scripts = require('./scripts') |
|
|
|
var Address = require('./address') |
|
var ECSignature = require('./ecsignature') |
|
var Script = require('./script') |
|
|
|
function Transaction () { |
|
this.version = 1 |
|
this.locktime = 0 |
|
this.ins = [] |
|
this.outs = [] |
|
} |
|
|
|
Transaction.DEFAULT_SEQUENCE = 0xffffffff |
|
Transaction.SIGHASH_ALL = 0x01 |
|
Transaction.SIGHASH_NONE = 0x02 |
|
Transaction.SIGHASH_SINGLE = 0x03 |
|
Transaction.SIGHASH_ANYONECANPAY = 0x80 |
|
|
|
Transaction.fromBuffer = function (buffer, __disableAssert) { |
|
var offset = 0 |
|
function readSlice (n) { |
|
offset += n |
|
return buffer.slice(offset - n, offset) |
|
} |
|
|
|
function readUInt32 () { |
|
var i = buffer.readUInt32LE(offset) |
|
offset += 4 |
|
return i |
|
} |
|
|
|
function readUInt64 () { |
|
var i = bufferutils.readUInt64LE(buffer, offset) |
|
offset += 8 |
|
return i |
|
} |
|
|
|
function readVarInt () { |
|
var vi = bufferutils.readVarInt(buffer, offset) |
|
offset += vi.size |
|
return vi.number |
|
} |
|
|
|
function readScript () { |
|
return Script.fromBuffer(readSlice(readVarInt())) |
|
} |
|
|
|
function readGenerationScript () { |
|
return new Script(readSlice(readVarInt()), []) |
|
} |
|
|
|
var tx = new Transaction() |
|
tx.version = readUInt32() |
|
|
|
var vinLen = readVarInt() |
|
for (var i = 0; i < vinLen; ++i) { |
|
var hash = readSlice(32) |
|
|
|
if (Transaction.isCoinbaseHash(hash)) { |
|
tx.ins.push({ |
|
hash: hash, |
|
index: readUInt32(), |
|
script: readGenerationScript(), |
|
sequence: readUInt32() |
|
}) |
|
} else { |
|
tx.ins.push({ |
|
hash: hash, |
|
index: readUInt32(), |
|
script: readScript(), |
|
sequence: readUInt32() |
|
}) |
|
} |
|
} |
|
|
|
var voutLen = readVarInt() |
|
for (i = 0; i < voutLen; ++i) { |
|
tx.outs.push({ |
|
value: readUInt64(), |
|
script: readScript() |
|
}) |
|
} |
|
|
|
tx.locktime = readUInt32() |
|
|
|
if (!__disableAssert) { |
|
assert.equal(offset, buffer.length, 'Transaction has unexpected data') |
|
} |
|
|
|
return tx |
|
} |
|
|
|
Transaction.fromHex = function (hex) { |
|
return Transaction.fromBuffer(new Buffer(hex, 'hex')) |
|
} |
|
|
|
Transaction.isCoinbaseHash = function (buffer) { |
|
return Array.prototype.every.call(buffer, function (x) { |
|
return x === 0 |
|
}) |
|
} |
|
|
|
/** |
|
* Create a new txIn. |
|
* |
|
* Can be called with any of: |
|
* |
|
* - A transaction and an index |
|
* - A transaction hash and an index |
|
* |
|
* Note that this method does not sign the created input. |
|
*/ |
|
Transaction.prototype.addInput = function (hash, index, sequence, script) { |
|
if (sequence === undefined || sequence === null) { |
|
sequence = Transaction.DEFAULT_SEQUENCE |
|
} |
|
|
|
script = script || Script.EMPTY |
|
|
|
if (typeof hash === 'string') { |
|
// TxId hex is big-endian, we need little-endian |
|
hash = bufferutils.reverse(new Buffer(hash, 'hex')) |
|
} else if (hash instanceof Transaction) { |
|
hash = hash.getHash() |
|
} |
|
|
|
typeForce('Buffer', hash) |
|
typeForce('Number', index) |
|
typeForce('Number', sequence) |
|
typeForce('Script', script) |
|
|
|
assert.equal(hash.length, 32, 'Expected hash length of 32, got ' + hash.length) |
|
|
|
// Add the input and return the input's index |
|
return (this.ins.push({ |
|
hash: hash, |
|
index: index, |
|
script: script, |
|
sequence: sequence |
|
}) - 1) |
|
} |
|
|
|
/** |
|
* Create a new txOut. |
|
* |
|
* Can be called with: |
|
* |
|
* - A base58 address string and a value |
|
* - An Address object and a value |
|
* - A scriptPubKey Script and a value |
|
*/ |
|
Transaction.prototype.addOutput = function (scriptPubKey, value) { |
|
// Attempt to get a valid address if it's a base58 address string |
|
if (typeof scriptPubKey === 'string') { |
|
scriptPubKey = Address.fromBase58Check(scriptPubKey) |
|
} |
|
|
|
// Attempt to get a valid script if it's an Address object |
|
if (scriptPubKey instanceof Address) { |
|
scriptPubKey = scriptPubKey.toOutputScript() |
|
} |
|
|
|
typeForce('Script', scriptPubKey) |
|
typeForce('Number', value) |
|
|
|
// Add the output and return the output's index |
|
return (this.outs.push({ |
|
script: scriptPubKey, |
|
value: value |
|
}) - 1) |
|
} |
|
|
|
Transaction.prototype.clone = function () { |
|
var newTx = new Transaction() |
|
newTx.version = this.version |
|
newTx.locktime = this.locktime |
|
|
|
newTx.ins = this.ins.map(function (txIn) { |
|
return { |
|
hash: txIn.hash, |
|
index: txIn.index, |
|
script: txIn.script, |
|
sequence: txIn.sequence |
|
} |
|
}) |
|
|
|
newTx.outs = this.outs.map(function (txOut) { |
|
return { |
|
script: txOut.script, |
|
value: txOut.value |
|
} |
|
}) |
|
|
|
return newTx |
|
} |
|
|
|
/** |
|
* Hash transaction for signing a specific input. |
|
* |
|
* Bitcoin uses a different hash for each signed transaction input. This |
|
* method copies the transaction, makes the necessary changes based on the |
|
* hashType, serializes and finally hashes the result. This hash can then be |
|
* used to sign the transaction input in question. |
|
*/ |
|
Transaction.prototype.hashForSignature = function (inIndex, prevOutScript, hashType) { |
|
// FIXME: remove in 2.x.y |
|
if (arguments[0] instanceof Script) { |
|
console.warn('hashForSignature(prevOutScript, inIndex, ...) has been deprecated. Use hashForSignature(inIndex, prevOutScript, ...)') |
|
|
|
// swap the arguments (must be stored in tmp, arguments is special) |
|
var tmp = arguments[0] |
|
inIndex = arguments[1] |
|
prevOutScript = tmp |
|
} |
|
|
|
typeForce('Number', inIndex) |
|
typeForce('Script', prevOutScript) |
|
typeForce('Number', hashType) |
|
|
|
assert(inIndex >= 0, 'Invalid vin index') |
|
assert(inIndex < this.ins.length, 'Invalid vin index') |
|
|
|
var txTmp = this.clone() |
|
var hashScript = prevOutScript.without(opcodes.OP_CODESEPARATOR) |
|
|
|
// Blank out other inputs' signatures |
|
txTmp.ins.forEach(function (txIn) { |
|
txIn.script = Script.EMPTY |
|
}) |
|
txTmp.ins[inIndex].script = hashScript |
|
|
|
var hashTypeModifier = hashType & 0x1f |
|
|
|
if (hashTypeModifier === Transaction.SIGHASH_NONE) { |
|
assert(false, 'SIGHASH_NONE not yet supported') |
|
} else if (hashTypeModifier === Transaction.SIGHASH_SINGLE) { |
|
assert(false, 'SIGHASH_SINGLE not yet supported') |
|
} |
|
|
|
if (hashType & Transaction.SIGHASH_ANYONECANPAY) { |
|
assert(false, 'SIGHASH_ANYONECANPAY not yet supported') |
|
} |
|
|
|
var hashTypeBuffer = new Buffer(4) |
|
hashTypeBuffer.writeInt32LE(hashType, 0) |
|
|
|
var buffer = Buffer.concat([txTmp.toBuffer(), hashTypeBuffer]) |
|
return crypto.hash256(buffer) |
|
} |
|
|
|
Transaction.prototype.getHash = function () { |
|
return crypto.hash256(this.toBuffer()) |
|
} |
|
|
|
Transaction.prototype.getId = function () { |
|
// TxHash is little-endian, we need big-endian |
|
return bufferutils.reverse(this.getHash()).toString('hex') |
|
} |
|
|
|
Transaction.prototype.toBuffer = function () { |
|
function scriptSize (script) { |
|
var length = script.buffer.length |
|
|
|
return bufferutils.varIntSize(length) + length |
|
} |
|
|
|
var buffer = new Buffer( |
|
8 + |
|
bufferutils.varIntSize(this.ins.length) + |
|
bufferutils.varIntSize(this.outs.length) + |
|
this.ins.reduce(function (sum, input) { return sum + 40 + scriptSize(input.script) }, 0) + |
|
this.outs.reduce(function (sum, output) { return sum + 8 + scriptSize(output.script) }, 0) |
|
) |
|
|
|
var offset = 0 |
|
function writeSlice (slice) { |
|
slice.copy(buffer, offset) |
|
offset += slice.length |
|
} |
|
|
|
function writeUInt32 (i) { |
|
buffer.writeUInt32LE(i, offset) |
|
offset += 4 |
|
} |
|
|
|
function writeUInt64 (i) { |
|
bufferutils.writeUInt64LE(buffer, i, offset) |
|
offset += 8 |
|
} |
|
|
|
function writeVarInt (i) { |
|
var n = bufferutils.writeVarInt(buffer, i, offset) |
|
offset += n |
|
} |
|
|
|
writeUInt32(this.version) |
|
writeVarInt(this.ins.length) |
|
|
|
this.ins.forEach(function (txIn) { |
|
writeSlice(txIn.hash) |
|
writeUInt32(txIn.index) |
|
writeVarInt(txIn.script.buffer.length) |
|
writeSlice(txIn.script.buffer) |
|
writeUInt32(txIn.sequence) |
|
}) |
|
|
|
writeVarInt(this.outs.length) |
|
this.outs.forEach(function (txOut) { |
|
writeUInt64(txOut.value) |
|
writeVarInt(txOut.script.buffer.length) |
|
writeSlice(txOut.script.buffer) |
|
}) |
|
|
|
writeUInt32(this.locktime) |
|
|
|
return buffer |
|
} |
|
|
|
Transaction.prototype.toHex = function () { |
|
return this.toBuffer().toString('hex') |
|
} |
|
|
|
Transaction.prototype.setInputScript = function (index, script) { |
|
typeForce('Number', index) |
|
typeForce('Script', script) |
|
|
|
this.ins[index].script = script |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
Transaction.prototype.sign = function (index, privKey, hashType) { |
|
console.warn('Transaction.prototype.sign is deprecated. Use TransactionBuilder instead.') |
|
|
|
var prevOutScript = privKey.pub.getAddress().toOutputScript() |
|
var signature = this.signInput(index, prevOutScript, privKey, hashType) |
|
|
|
var scriptSig = scripts.pubKeyHashInput(signature, privKey.pub) |
|
this.setInputScript(index, scriptSig) |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
Transaction.prototype.signInput = function (index, prevOutScript, privKey, hashType) { |
|
console.warn('Transaction.prototype.signInput is deprecated. Use TransactionBuilder instead.') |
|
|
|
hashType = hashType || Transaction.SIGHASH_ALL |
|
|
|
var hash = this.hashForSignature(index, prevOutScript, hashType) |
|
var signature = privKey.sign(hash) |
|
|
|
return signature.toScriptSignature(hashType) |
|
} |
|
|
|
// FIXME: remove in 2.x.y |
|
Transaction.prototype.validateInput = function (index, prevOutScript, pubKey, buffer) { |
|
console.warn('Transaction.prototype.validateInput is deprecated. Use TransactionBuilder instead.') |
|
|
|
var parsed = ECSignature.parseScriptSignature(buffer) |
|
var hash = this.hashForSignature(index, prevOutScript, parsed.hashType) |
|
|
|
return pubKey.verify(hash, parsed.signature) |
|
} |
|
|
|
module.exports = Transaction |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./address":33,"./bufferutils":36,"./crypto":37,"./ecsignature":41,"./opcodes":46,"./script":47,"./scripts":48,"assert":157,"buffer":172,"typeforce":32}],50:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var ops = require('./opcodes') |
|
var scripts = require('./scripts') |
|
|
|
var ECPubKey = require('./ecpubkey') |
|
var ECSignature = require('./ecsignature') |
|
var Script = require('./script') |
|
var Transaction = require('./transaction') |
|
|
|
function extractInput (txIn) { |
|
var redeemScript |
|
var scriptSig = txIn.script |
|
var prevOutScript |
|
var prevOutType = scripts.classifyInput(scriptSig, true) |
|
var scriptType |
|
|
|
// Re-classify if scriptHash |
|
if (prevOutType === 'scripthash') { |
|
redeemScript = Script.fromBuffer(scriptSig.chunks.slice(-1)[0]) |
|
prevOutScript = scripts.scriptHashOutput(redeemScript.getHash()) |
|
|
|
scriptSig = Script.fromChunks(scriptSig.chunks.slice(0, -1)) |
|
scriptType = scripts.classifyInput(scriptSig, true) |
|
} else { |
|
scriptType = prevOutType |
|
} |
|
|
|
// Extract hashType, pubKeys and signatures |
|
var hashType, parsed, pubKeys, signatures |
|
|
|
switch (scriptType) { |
|
case 'pubkeyhash': { |
|
parsed = ECSignature.parseScriptSignature(scriptSig.chunks[0]) |
|
hashType = parsed.hashType |
|
pubKeys = [ECPubKey.fromBuffer(scriptSig.chunks[1])] |
|
signatures = [parsed.signature] |
|
prevOutScript = pubKeys[0].getAddress().toOutputScript() |
|
|
|
break |
|
} |
|
|
|
case 'pubkey': { |
|
parsed = ECSignature.parseScriptSignature(scriptSig.chunks[0]) |
|
hashType = parsed.hashType |
|
signatures = [parsed.signature] |
|
|
|
if (redeemScript) { |
|
pubKeys = [ECPubKey.fromBuffer(redeemScript.chunks[0])] |
|
} |
|
|
|
break |
|
} |
|
|
|
case 'multisig': { |
|
signatures = scriptSig.chunks.slice(1).map(function (chunk) { |
|
if (chunk === ops.OP_0) return chunk |
|
|
|
var parsed = ECSignature.parseScriptSignature(chunk) |
|
hashType = parsed.hashType |
|
|
|
return parsed.signature |
|
}) |
|
|
|
if (redeemScript) { |
|
pubKeys = redeemScript.chunks.slice(1, -2).map(ECPubKey.fromBuffer) |
|
} |
|
|
|
break |
|
} |
|
} |
|
|
|
return { |
|
hashType: hashType, |
|
prevOutScript: prevOutScript, |
|
prevOutType: prevOutType, |
|
pubKeys: pubKeys, |
|
redeemScript: redeemScript, |
|
scriptType: scriptType, |
|
signatures: signatures |
|
} |
|
} |
|
|
|
function TransactionBuilder () { |
|
this.prevTxMap = {} |
|
this.prevOutScripts = {} |
|
this.prevOutTypes = {} |
|
|
|
this.inputs = [] |
|
this.tx = new Transaction() |
|
} |
|
|
|
TransactionBuilder.fromTransaction = function (transaction) { |
|
var txb = new TransactionBuilder() |
|
|
|
// Copy other transaction fields |
|
txb.tx.version = transaction.version |
|
txb.tx.locktime = transaction.locktime |
|
|
|
// Extract/add inputs |
|
transaction.ins.forEach(function (txIn) { |
|
txb.addInput(txIn.hash, txIn.index, txIn.sequence) |
|
}) |
|
|
|
// Extract/add outputs |
|
transaction.outs.forEach(function (txOut) { |
|
txb.addOutput(txOut.script, txOut.value) |
|
}) |
|
|
|
// Extract/add signatures |
|
txb.inputs = transaction.ins.map(function (txIn) { |
|
// TODO: remove me after testcase added |
|
assert(!Transaction.isCoinbaseHash(txIn.hash), 'coinbase inputs not supported') |
|
|
|
// Ignore empty scripts |
|
if (txIn.script.buffer.length === 0) return {} |
|
|
|
return extractInput(txIn) |
|
}) |
|
|
|
return txb |
|
} |
|
|
|
TransactionBuilder.prototype.addInput = function (prevTx, index, sequence, prevOutScript) { |
|
var prevOutHash |
|
|
|
// txId |
|
if (typeof prevTx === 'string') { |
|
prevOutHash = new Buffer(prevTx, 'hex') |
|
|
|
// TxId hex is big-endian, we want little-endian hash |
|
Array.prototype.reverse.call(prevOutHash) |
|
|
|
// Transaction |
|
} else if (prevTx instanceof Transaction) { |
|
prevOutHash = prevTx.getHash() |
|
prevOutScript = prevTx.outs[index].script |
|
|
|
// txHash |
|
} else { |
|
prevOutHash = prevTx |
|
} |
|
|
|
var input = {} |
|
if (prevOutScript) { |
|
var prevOutType = scripts.classifyOutput(prevOutScript) |
|
|
|
// if we can, extract pubKey information |
|
switch (prevOutType) { |
|
case 'multisig': { |
|
input.pubKeys = prevOutScript.chunks.slice(1, -2).map(ECPubKey.fromBuffer) |
|
break |
|
} |
|
|
|
case 'pubkey': { |
|
input.pubKeys = prevOutScript.chunks.slice(0, 1).map(ECPubKey.fromBuffer) |
|
break |
|
} |
|
} |
|
|
|
if (prevOutType !== 'scripthash') { |
|
input.scriptType = prevOutType |
|
} |
|
|
|
input.prevOutScript = prevOutScript |
|
input.prevOutType = prevOutType |
|
} |
|
|
|
assert(this.inputs.every(function (input2) { |
|
if (input2.hashType === undefined) return true |
|
|
|
return input2.hashType & Transaction.SIGHASH_ANYONECANPAY |
|
}), 'No, this would invalidate signatures') |
|
|
|
var prevOut = prevOutHash.toString('hex') + ':' + index |
|
assert(!(prevOut in this.prevTxMap), 'Transaction is already an input') |
|
|
|
var vin = this.tx.addInput(prevOutHash, index, sequence) |
|
this.inputs[vin] = input |
|
this.prevTxMap[prevOut] = vin |
|
|
|
return vin |
|
} |
|
|
|
TransactionBuilder.prototype.addOutput = function (scriptPubKey, value) { |
|
assert(this.inputs.every(function (input) { |
|
if (input.hashType === undefined) return true |
|
|
|
return (input.hashType & 0x1f) === Transaction.SIGHASH_SINGLE |
|
}), 'No, this would invalidate signatures') |
|
|
|
return this.tx.addOutput(scriptPubKey, value) |
|
} |
|
|
|
TransactionBuilder.prototype.build = function () { |
|
return this.__build(false) |
|
} |
|
TransactionBuilder.prototype.buildIncomplete = function () { |
|
return this.__build(true) |
|
} |
|
|
|
var canSignTypes = { |
|
'pubkeyhash': true, |
|
'multisig': true, |
|
'pubkey': true |
|
} |
|
|
|
TransactionBuilder.prototype.__build = function (allowIncomplete) { |
|
if (!allowIncomplete) { |
|
assert(this.tx.ins.length > 0, 'Transaction has no inputs') |
|
assert(this.tx.outs.length > 0, 'Transaction has no outputs') |
|
} |
|
|
|
var tx = this.tx.clone() |
|
|
|
// Create script signatures from signature meta-data |
|
this.inputs.forEach(function (input, index) { |
|
var scriptType = input.scriptType |
|
var scriptSig |
|
|
|
if (!allowIncomplete) { |
|
assert(!!scriptType, 'Transaction is not complete') |
|
assert(scriptType in canSignTypes, scriptType + ' not supported') |
|
assert(input.signatures, 'Transaction is missing signatures') |
|
} |
|
|
|
if (input.signatures) { |
|
switch (scriptType) { |
|
case 'pubkeyhash': { |
|
var pkhSignature = input.signatures[0].toScriptSignature(input.hashType) |
|
scriptSig = scripts.pubKeyHashInput(pkhSignature, input.pubKeys[0]) |
|
break |
|
} |
|
|
|
case 'multisig': { |
|
// Array.prototype.map is sparse-compatible |
|
var msSignatures = input.signatures.map(function (signature) { |
|
return signature && signature.toScriptSignature(input.hashType) |
|
}) |
|
|
|
// fill in blanks with OP_0 |
|
if (allowIncomplete) { |
|
for (var i = 0; i < msSignatures.length; ++i) { |
|
if (msSignatures[i]) continue |
|
|
|
msSignatures[i] = ops.OP_0 |
|
} |
|
} else { |
|
// Array.prototype.filter returns non-sparse array |
|
msSignatures = msSignatures.filter(function (x) { return x }) |
|
} |
|
|
|
var redeemScript = allowIncomplete ? undefined : input.redeemScript |
|
scriptSig = scripts.multisigInput(msSignatures, redeemScript) |
|
break |
|
} |
|
|
|
case 'pubkey': { |
|
var pkSignature = input.signatures[0].toScriptSignature(input.hashType) |
|
scriptSig = scripts.pubKeyInput(pkSignature) |
|
break |
|
} |
|
} |
|
} |
|
|
|
// did we build a scriptSig? |
|
if (scriptSig) { |
|
// wrap as scriptHash if necessary |
|
if (input.prevOutType === 'scripthash') { |
|
scriptSig = scripts.scriptHashInput(scriptSig, input.redeemScript) |
|
} |
|
|
|
tx.setInputScript(index, scriptSig) |
|
} |
|
}) |
|
|
|
return tx |
|
} |
|
|
|
TransactionBuilder.prototype.sign = function (index, privKey, redeemScript, hashType) { |
|
assert(index in this.inputs, 'No input at index: ' + index) |
|
hashType = hashType || Transaction.SIGHASH_ALL |
|
|
|
var input = this.inputs[index] |
|
var canSign = input.hashType && |
|
input.prevOutScript && |
|
input.prevOutType && |
|
input.pubKeys && |
|
input.scriptType && |
|
input.signatures |
|
|
|
// are we almost ready to sign? |
|
if (canSign) { |
|
// if redeemScript was provided, enforce consistency |
|
if (redeemScript) { |
|
assert.deepEqual(input.redeemScript, redeemScript, 'Inconsistent redeemScript') |
|
} |
|
|
|
assert.equal(input.hashType, hashType, 'Inconsistent hashType') |
|
|
|
// no? prepare |
|
} else { |
|
// must be pay-to-scriptHash? |
|
if (redeemScript) { |
|
// if we have a prevOutScript, enforce scriptHash equality to the redeemScript |
|
if (input.prevOutScript) { |
|
assert.equal(input.prevOutType, 'scripthash', 'PrevOutScript must be P2SH') |
|
|
|
var scriptHash = input.prevOutScript.chunks[1] |
|
assert.deepEqual(scriptHash, redeemScript.getHash(), 'RedeemScript does not match ' + scriptHash.toString('hex')) |
|
} |
|
|
|
var scriptType = scripts.classifyOutput(redeemScript) |
|
assert(scriptType in canSignTypes, 'RedeemScript not supported (' + scriptType + ')') |
|
|
|
var pubKeys = [] |
|
switch (scriptType) { |
|
case 'multisig': { |
|
pubKeys = redeemScript.chunks.slice(1, -2).map(ECPubKey.fromBuffer) |
|
break |
|
} |
|
|
|
case 'pubkeyhash': { |
|
var pkh1 = redeemScript.chunks[2] |
|
var pkh2 = privKey.pub.getAddress().hash |
|
|
|
assert.deepEqual(pkh1, pkh2, 'privateKey cannot sign for this input') |
|
pubKeys = [privKey.pub] |
|
break |
|
} |
|
|
|
case 'pubkey': { |
|
pubKeys = redeemScript.chunks.slice(0, 1).map(ECPubKey.fromBuffer) |
|
break |
|
} |
|
} |
|
|
|
if (!input.prevOutScript) { |
|
input.prevOutScript = scripts.scriptHashOutput(redeemScript.getHash()) |
|
input.prevOutType = 'scripthash' |
|
} |
|
|
|
input.pubKeys = pubKeys |
|
input.redeemScript = redeemScript |
|
input.scriptType = scriptType |
|
|
|
// cannot be pay-to-scriptHash |
|
} else { |
|
assert.notEqual(input.prevOutType, 'scripthash', 'PrevOutScript is P2SH, missing redeemScript') |
|
|
|
// can we otherwise sign this? |
|
if (input.scriptType) { |
|
assert(input.pubKeys, input.scriptType + ' not supported') |
|
|
|
// we know nothin' Jon Snow, assume pubKeyHash |
|
} else { |
|
input.prevOutScript = privKey.pub.getAddress().toOutputScript() |
|
input.prevOutType = 'pubkeyhash' |
|
input.pubKeys = [privKey.pub] |
|
input.scriptType = input.prevOutType |
|
} |
|
} |
|
|
|
input.hashType = hashType |
|
input.signatures = input.signatures || [] |
|
} |
|
|
|
var signatureScript = input.redeemScript || input.prevOutScript |
|
var signatureHash = this.tx.hashForSignature(index, signatureScript, hashType) |
|
|
|
// enforce signature order matches public keys |
|
if (input.scriptType === 'multisig' && input.redeemScript && input.signatures.length !== input.pubKeys.length) { |
|
// maintain a local copy of unmatched signatures |
|
var unmatched = input.signatures.slice() |
|
|
|
input.signatures = input.pubKeys.map(function (pubKey) { |
|
var match |
|
|
|
// check for any matching signatures |
|
unmatched.some(function (signature, i) { |
|
if (!pubKey.verify(signatureHash, signature)) return false |
|
match = signature |
|
|
|
// remove matched signature from unmatched |
|
unmatched.splice(i, 1) |
|
|
|
return true |
|
}) |
|
|
|
return match || undefined |
|
}) |
|
} |
|
|
|
// enforce in order signing of public keys |
|
assert(input.pubKeys.some(function (pubKey, i) { |
|
if (!privKey.pub.Q.equals(pubKey.Q)) return false |
|
|
|
assert(!input.signatures[i], 'Signature already exists') |
|
var signature = privKey.sign(signatureHash) |
|
input.signatures[i] = signature |
|
|
|
return true |
|
}, this), 'privateKey cannot sign for this input') |
|
} |
|
|
|
module.exports = TransactionBuilder |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./ecpubkey":40,"./ecsignature":41,"./opcodes":46,"./script":47,"./scripts":48,"./transaction":49,"assert":157,"buffer":172}],51:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var assert = require('assert') |
|
var bufferutils = require('./bufferutils') |
|
var typeForce = require('typeforce') |
|
var networks = require('./networks') |
|
var randomBytes = require('randombytes') |
|
|
|
var Address = require('./address') |
|
var HDNode = require('./hdnode') |
|
var TransactionBuilder = require('./transaction_builder') |
|
var Script = require('./script') |
|
|
|
function Wallet (seed, network) { |
|
console.warn('Wallet is deprecated and will be removed in 2.0.0, see #296') |
|
|
|
seed = seed || randomBytes(32) |
|
network = network || networks.bitcoin |
|
|
|
// Stored in a closure to make accidental serialization less likely |
|
var masterKey = HDNode.fromSeedBuffer(seed, network) |
|
|
|
// HD first-level child derivation method should be hardened |
|
// See https://bitcointalk.org/index.php?topic=405179.msg4415254#msg4415254 |
|
var accountZero = masterKey.deriveHardened(0) |
|
var externalAccount = accountZero.derive(0) |
|
var internalAccount = accountZero.derive(1) |
|
|
|
this.addresses = [] |
|
this.changeAddresses = [] |
|
this.network = network |
|
this.unspents = [] |
|
|
|
// FIXME: remove in 2.0.0 |
|
this.unspentMap = {} |
|
|
|
// FIXME: remove in 2.0.0 |
|
var me = this |
|
this.newMasterKey = function (seed) { |
|
console.warn('newMasterKey is deprecated, please make a new Wallet instance instead') |
|
|
|
seed = seed || randomBytes(32) |
|
masterKey = HDNode.fromSeedBuffer(seed, network) |
|
|
|
accountZero = masterKey.deriveHardened(0) |
|
externalAccount = accountZero.derive(0) |
|
internalAccount = accountZero.derive(1) |
|
|
|
me.addresses = [] |
|
me.changeAddresses = [] |
|
|
|
me.unspents = [] |
|
me.unspentMap = {} |
|
} |
|
|
|
this.getMasterKey = function () { |
|
return masterKey |
|
} |
|
this.getAccountZero = function () { |
|
return accountZero |
|
} |
|
this.getExternalAccount = function () { |
|
return externalAccount |
|
} |
|
this.getInternalAccount = function () { |
|
return internalAccount |
|
} |
|
} |
|
|
|
Wallet.prototype.createTransaction = function (to, value, options) { |
|
// FIXME: remove in 2.0.0 |
|
if (typeof options !== 'object') { |
|
if (options !== undefined) { |
|
console.warn('Non options object parameters are deprecated, use options object instead') |
|
|
|
options = { |
|
fixedFee: arguments[2], |
|
changeAddress: arguments[3] |
|
} |
|
} |
|
} |
|
|
|
options = options || {} |
|
|
|
assert(value > this.network.dustThreshold, value + ' must be above dust threshold (' + this.network.dustThreshold + ' Satoshis)') |
|
|
|
var changeAddress = options.changeAddress |
|
var fixedFee = options.fixedFee |
|
var minConf = options.minConf === undefined ? 0 : options.minConf // FIXME: change minConf:1 by default in 2.0.0 |
|
|
|
// filter by minConf, then pending and sort by descending value |
|
var unspents = this.unspents.filter(function (unspent) { |
|
return unspent.confirmations >= minConf |
|
}).filter(function (unspent) { |
|
return !unspent.pending |
|
}).sort(function (o1, o2) { |
|
return o2.value - o1.value |
|
}) |
|
|
|
var accum = 0 |
|
var addresses = [] |
|
var subTotal = value |
|
|
|
var txb = new TransactionBuilder() |
|
txb.addOutput(to, value) |
|
|
|
for (var i = 0; i < unspents.length; ++i) { |
|
var unspent = unspents[i] |
|
addresses.push(unspent.address) |
|
|
|
txb.addInput(unspent.txHash, unspent.index) |
|
|
|
var fee = fixedFee === undefined ? estimatePaddedFee(txb.buildIncomplete(), this.network) : fixedFee |
|
|
|
accum += unspent.value |
|
subTotal = value + fee |
|
|
|
if (accum >= subTotal) { |
|
var change = accum - subTotal |
|
|
|
if (change > this.network.dustThreshold) { |
|
txb.addOutput(changeAddress || this.getChangeAddress(), change) |
|
} |
|
|
|
break |
|
} |
|
} |
|
|
|
assert(accum >= subTotal, 'Not enough funds (incl. fee): ' + accum + ' < ' + subTotal) |
|
|
|
return this.signWith(txb, addresses).build() |
|
} |
|
|
|
// FIXME: remove in 2.0.0 |
|
Wallet.prototype.processPendingTx = function (tx) { |
|
this.__processTx(tx, true) |
|
} |
|
|
|
// FIXME: remove in 2.0.0 |
|
Wallet.prototype.processConfirmedTx = function (tx) { |
|
this.__processTx(tx, false) |
|
} |
|
|
|
// FIXME: remove in 2.0.0 |
|
Wallet.prototype.__processTx = function (tx, isPending) { |
|
console.warn('processTransaction is considered harmful, see issue #260 for more information') |
|
|
|
var txId = tx.getId() |
|
var txHash = tx.getHash() |
|
|
|
tx.outs.forEach(function (txOut, i) { |
|
var address |
|
|
|
try { |
|
address = Address.fromOutputScript(txOut.script, this.network).toString() |
|
} catch (e) { |
|
if (!(e.message.match(/has no matching Address/))) |
|
throw e |
|
} |
|
|
|
var myAddresses = this.addresses.concat(this.changeAddresses) |
|
if (myAddresses.indexOf(address) > -1) { |
|
var lookup = txId + ':' + i |
|
if (lookup in this.unspentMap) return |
|
|
|
// its unique, add it |
|
var unspent = { |
|
address: address, |
|
confirmations: 0, // no way to determine this without more information |
|
index: i, |
|
txHash: txHash, |
|
txId: txId, |
|
value: txOut.value, |
|
pending: isPending |
|
} |
|
|
|
this.unspentMap[lookup] = unspent |
|
this.unspents.push(unspent) |
|
} |
|
}, this) |
|
|
|
tx.ins.forEach(function (txIn) { |
|
// copy and convert to big-endian hex |
|
var txInId = bufferutils.reverse(txIn.hash).toString('hex') |
|
|
|
var lookup = txInId + ':' + txIn.index |
|
if (!(lookup in this.unspentMap)) return |
|
|
|
var unspent = this.unspentMap[lookup] |
|
|
|
if (isPending) { |
|
unspent.pending = true |
|
unspent.spent = true |
|
} else { |
|
delete this.unspentMap[lookup] |
|
|
|
this.unspents = this.unspents.filter(function (unspent2) { |
|
return unspent !== unspent2 |
|
}) |
|
} |
|
}, this) |
|
} |
|
|
|
Wallet.prototype.generateAddress = function () { |
|
var k = this.addresses.length |
|
var address = this.getExternalAccount().derive(k).getAddress() |
|
|
|
this.addresses.push(address.toString()) |
|
|
|
return this.getReceiveAddress() |
|
} |
|
|
|
Wallet.prototype.generateChangeAddress = function () { |
|
var k = this.changeAddresses.length |
|
var address = this.getInternalAccount().derive(k).getAddress() |
|
|
|
this.changeAddresses.push(address.toString()) |
|
|
|
return this.getChangeAddress() |
|
} |
|
|
|
Wallet.prototype.getAddress = function () { |
|
if (this.addresses.length === 0) { |
|
this.generateAddress() |
|
} |
|
|
|
return this.addresses[this.addresses.length - 1] |
|
} |
|
|
|
Wallet.prototype.getBalance = function (minConf) { |
|
minConf = minConf || 0 |
|
|
|
return this.unspents.filter(function (unspent) { |
|
return unspent.confirmations >= minConf |
|
|
|
// FIXME: remove spent filter in 2.0.0 |
|
}).filter(function (unspent) { |
|
return !unspent.spent |
|
}).reduce(function (accum, unspent) { |
|
return accum + unspent.value |
|
}, 0) |
|
} |
|
|
|
Wallet.prototype.getChangeAddress = function () { |
|
if (this.changeAddresses.length === 0) { |
|
this.generateChangeAddress() |
|
} |
|
|
|
return this.changeAddresses[this.changeAddresses.length - 1] |
|
} |
|
|
|
Wallet.prototype.getInternalPrivateKey = function (index) { |
|
return this.getInternalAccount().derive(index).privKey |
|
} |
|
|
|
Wallet.prototype.getPrivateKey = function (index) { |
|
return this.getExternalAccount().derive(index).privKey |
|
} |
|
|
|
Wallet.prototype.getPrivateKeyForAddress = function (address) { |
|
var index |
|
|
|
if ((index = this.addresses.indexOf(address)) > -1) { |
|
return this.getPrivateKey(index) |
|
} |
|
|
|
if ((index = this.changeAddresses.indexOf(address)) > -1) { |
|
return this.getInternalPrivateKey(index) |
|
} |
|
|
|
assert(false, 'Unknown address. Make sure the address is from the keychain and has been generated') |
|
} |
|
|
|
Wallet.prototype.getUnspentOutputs = function (minConf) { |
|
minConf = minConf || 0 |
|
|
|
return this.unspents.filter(function (unspent) { |
|
return unspent.confirmations >= minConf |
|
|
|
// FIXME: remove spent filter in 2.0.0 |
|
}).filter(function (unspent) { |
|
return !unspent.spent |
|
}).map(function (unspent) { |
|
return { |
|
address: unspent.address, |
|
confirmations: unspent.confirmations, |
|
index: unspent.index, |
|
txId: unspent.txId, |
|
value: unspent.value, |
|
|
|
// FIXME: remove in 2.0.0 |
|
hash: unspent.txId, |
|
pending: unspent.pending |
|
} |
|
}) |
|
} |
|
|
|
Wallet.prototype.setUnspentOutputs = function (unspents) { |
|
this.unspentMap = {} |
|
this.unspents = unspents.map(function (unspent) { |
|
// FIXME: remove unspent.hash in 2.0.0 |
|
var txId = unspent.txId || unspent.hash |
|
var index = unspent.index |
|
|
|
// FIXME: remove in 2.0.0 |
|
if (unspent.hash !== undefined) { |
|
console.warn('unspent.hash is deprecated, use unspent.txId instead') |
|
} |
|
|
|
// FIXME: remove in 2.0.0 |
|
if (index === undefined) { |
|
console.warn('unspent.outputIndex is deprecated, use unspent.index instead') |
|
index = unspent.outputIndex |
|
} |
|
|
|
typeForce('String', txId) |
|
typeForce('Number', index) |
|
typeForce('Number', unspent.value) |
|
|
|
assert.equal(txId.length, 64, 'Expected valid txId, got ' + txId) |
|
assert.doesNotThrow(function () { |
|
Address.fromBase58Check(unspent.address) |
|
}, 'Expected Base58 Address, got ' + unspent.address) |
|
assert(isFinite(index), 'Expected finite index, got ' + index) |
|
|
|
// FIXME: remove branch in 2.0.0 |
|
if (unspent.confirmations !== undefined) { |
|
typeForce('Number', unspent.confirmations) |
|
} |
|
|
|
var txHash = bufferutils.reverse(new Buffer(txId, 'hex')) |
|
|
|
unspent = { |
|
address: unspent.address, |
|
confirmations: unspent.confirmations || 0, |
|
index: index, |
|
txHash: txHash, |
|
txId: txId, |
|
value: unspent.value, |
|
|
|
// FIXME: remove in 2.0.0 |
|
pending: unspent.pending || false |
|
} |
|
|
|
// FIXME: remove in 2.0.0 |
|
this.unspentMap[txId + ':' + index] = unspent |
|
|
|
return unspent |
|
}, this) |
|
} |
|
|
|
Wallet.prototype.signWith = function (tx, addresses) { |
|
addresses.forEach(function (address, i) { |
|
var privKey = this.getPrivateKeyForAddress(address) |
|
|
|
tx.sign(i, privKey) |
|
}, this) |
|
|
|
return tx |
|
} |
|
|
|
function estimatePaddedFee (tx, network) { |
|
var tmpTx = tx.clone() |
|
tmpTx.addOutput(Script.EMPTY, network.dustSoftThreshold || 0) |
|
|
|
return network.estimateFee(tmpTx) |
|
} |
|
|
|
// FIXME: 1.0.0 shims, remove in 2.0.0 |
|
Wallet.prototype.getReceiveAddress = Wallet.prototype.getAddress |
|
Wallet.prototype.createTx = Wallet.prototype.createTransaction |
|
|
|
module.exports = Wallet |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./address":33,"./bufferutils":36,"./hdnode":42,"./networks":45,"./script":47,"./transaction_builder":50,"assert":157,"buffer":172,"randombytes":31,"typeforce":32}],52:[function(require,module,exports){ |
|
arguments[4][14][0].apply(exports,arguments) |
|
},{"dup":14}],53:[function(require,module,exports){ |
|
// Copyright 2010-2012 Mikeal Rogers |
|
// |
|
// Licensed under the Apache License, Version 2.0 (the "License"); |
|
// you may not use this file except in compliance with the License. |
|
// You may obtain a copy of the License at |
|
// |
|
// http://www.apache.org/licenses/LICENSE-2.0 |
|
// |
|
// Unless required by applicable law or agreed to in writing, software |
|
// distributed under the License is distributed on an "AS IS" BASIS, |
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
|
// See the License for the specific language governing permissions and |
|
// limitations under the License. |
|
|
|
'use strict' |
|
|
|
var extend = require('util')._extend |
|
, cookies = require('./lib/cookies') |
|
, helpers = require('./lib/helpers') |
|
|
|
var isFunction = helpers.isFunction |
|
, paramsHaveRequestBody = helpers.paramsHaveRequestBody |
|
|
|
|
|
// organize params for patch, post, put, head, del |
|
function initParams(uri, options, callback) { |
|
if (typeof options === 'function') { |
|
callback = options |
|
} |
|
|
|
var params = {} |
|
if (typeof options === 'object') { |
|
params = extend({}, options) |
|
params = extend(params, {uri: uri}) |
|
} else if (typeof uri === 'string') { |
|
params = extend({}, {uri: uri}) |
|
} else { |
|
params = extend({}, uri) |
|
} |
|
|
|
params.callback = callback |
|
return params |
|
} |
|
|
|
function request (uri, options, callback) { |
|
if (typeof uri === 'undefined') { |
|
throw new Error('undefined is not a valid uri or options object.') |
|
} |
|
|
|
var params = initParams(uri, options, callback) |
|
|
|
if (params.method === 'HEAD' && paramsHaveRequestBody(params)) { |
|
throw new Error('HTTP HEAD requests MUST NOT include a request body.') |
|
} |
|
|
|
return new request.Request(params) |
|
} |
|
|
|
var verbs = ['get', 'head', 'post', 'put', 'patch', 'del'] |
|
|
|
verbs.forEach(function(verb) { |
|
var method = verb === 'del' ? 'DELETE' : verb.toUpperCase() |
|
request[verb] = function (uri, options, callback) { |
|
var params = initParams(uri, options, callback) |
|
params.method = method |
|
return request(params, params.callback) |
|
} |
|
}) |
|
|
|
request.jar = function (store) { |
|
return cookies.jar(store) |
|
} |
|
|
|
request.cookie = function (str) { |
|
return cookies.parse(str) |
|
} |
|
|
|
function wrapRequestMethod (method, options, requester) { |
|
|
|
return function (uri, opts, callback) { |
|
var params = initParams(uri, opts, callback) |
|
|
|
var headerlessOptions = extend({}, options) |
|
delete headerlessOptions.headers |
|
params = extend(headerlessOptions, params) |
|
|
|
if (options.headers) { |
|
var headers = extend({}, options.headers) |
|
params.headers = extend(headers, params.headers) |
|
} |
|
|
|
if (typeof method === 'string') { |
|
params.method = (method === 'del' ? 'DELETE' : method.toUpperCase()) |
|
method = request[method] |
|
} |
|
|
|
if (isFunction(requester)) { |
|
method = requester |
|
} |
|
|
|
return method(params, params.callback) |
|
} |
|
} |
|
|
|
request.defaults = function (options, requester) { |
|
var self = this |
|
|
|
if (typeof options === 'function') { |
|
requester = options |
|
options = {} |
|
} |
|
|
|
var defaults = wrapRequestMethod(self, options, requester) |
|
|
|
var verbs = ['get', 'head', 'post', 'put', 'patch', 'del'] |
|
verbs.forEach(function(verb) { |
|
defaults[verb] = wrapRequestMethod(verb, options, requester) |
|
}) |
|
|
|
defaults.cookie = wrapRequestMethod(self.cookie, options, requester) |
|
defaults.jar = self.jar |
|
defaults.defaults = self.defaults |
|
return defaults |
|
} |
|
|
|
request.forever = function (agentOptions, optionsArg) { |
|
var options = {} |
|
if (optionsArg) { |
|
options = extend({}, optionsArg) |
|
} |
|
if (agentOptions) { |
|
options.agentOptions = agentOptions |
|
} |
|
|
|
options.forever = true |
|
return request.defaults(options) |
|
} |
|
|
|
// Exports |
|
|
|
module.exports = request |
|
request.Request = require('./request') |
|
request.initParams = initParams |
|
|
|
// Backwards compatibility for request.debug |
|
Object.defineProperty(request, 'debug', { |
|
enumerable : true, |
|
get : function() { |
|
return request.Request.debug |
|
}, |
|
set : function(debug) { |
|
request.Request.debug = debug |
|
} |
|
}) |
|
|
|
},{"./lib/cookies":55,"./lib/helpers":59,"./request":138,"util":343}],54:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var caseless = require('caseless') |
|
, uuid = require('node-uuid') |
|
, helpers = require('./helpers') |
|
|
|
var md5 = helpers.md5 |
|
, toBase64 = helpers.toBase64 |
|
|
|
|
|
function Auth (request) { |
|
// define all public properties here |
|
this.request = request |
|
this.hasAuth = false |
|
this.sentAuth = false |
|
this.bearerToken = null |
|
this.user = null |
|
this.pass = null |
|
} |
|
|
|
Auth.prototype.basic = function (user, pass, sendImmediately) { |
|
var self = this |
|
if (typeof user !== 'string' || (pass !== undefined && typeof pass !== 'string')) { |
|
throw new Error('auth() received invalid user or password') |
|
} |
|
self.user = user |
|
self.pass = pass |
|
self.hasAuth = true |
|
var header = user + ':' + (pass || '') |
|
if (sendImmediately || typeof sendImmediately === 'undefined') { |
|
var authHeader = 'Basic ' + toBase64(header) |
|
self.sentAuth = true |
|
return authHeader |
|
} |
|
} |
|
|
|
Auth.prototype.bearer = function (bearer, sendImmediately) { |
|
var self = this |
|
self.bearerToken = bearer |
|
self.hasAuth = true |
|
if (sendImmediately || typeof sendImmediately === 'undefined') { |
|
if (typeof bearer === 'function') { |
|
bearer = bearer() |
|
} |
|
var authHeader = 'Bearer ' + (bearer || '') |
|
self.sentAuth = true |
|
return authHeader |
|
} |
|
} |
|
|
|
Auth.prototype.digest = function (method, path, authHeader) { |
|
// TODO: More complete implementation of RFC 2617. |
|
// - check challenge.algorithm |
|
// - support algorithm="MD5-sess" |
|
// - handle challenge.domain |
|
// - support qop="auth-int" only |
|
// - handle Authentication-Info (not necessarily?) |
|
// - check challenge.stale (not necessarily?) |
|
// - increase nc (not necessarily?) |
|
// For reference: |
|
// http://tools.ietf.org/html/rfc2617#section-3 |
|
// https://github.com/bagder/curl/blob/master/lib/http_digest.c |
|
|
|
var self = this |
|
|
|
var challenge = {} |
|
var re = /([a-z0-9_-]+)=(?:"([^"]+)"|([a-z0-9_-]+))/gi |
|
for (;;) { |
|
var match = re.exec(authHeader) |
|
if (!match) { |
|
break |
|
} |
|
challenge[match[1]] = match[2] || match[3] |
|
} |
|
|
|
var ha1 = md5(self.user + ':' + challenge.realm + ':' + self.pass) |
|
var ha2 = md5(method + ':' + path) |
|
var qop = /(^|,)\s*auth\s*($|,)/.test(challenge.qop) && 'auth' |
|
var nc = qop && '00000001' |
|
var cnonce = qop && uuid().replace(/-/g, '') |
|
var digestResponse = qop |
|
? md5(ha1 + ':' + challenge.nonce + ':' + nc + ':' + cnonce + ':' + qop + ':' + ha2) |
|
: md5(ha1 + ':' + challenge.nonce + ':' + ha2) |
|
var authValues = { |
|
username: self.user, |
|
realm: challenge.realm, |
|
nonce: challenge.nonce, |
|
uri: path, |
|
qop: qop, |
|
response: digestResponse, |
|
nc: nc, |
|
cnonce: cnonce, |
|
algorithm: challenge.algorithm, |
|
opaque: challenge.opaque |
|
} |
|
|
|
authHeader = [] |
|
for (var k in authValues) { |
|
if (authValues[k]) { |
|
if (k === 'qop' || k === 'nc' || k === 'algorithm') { |
|
authHeader.push(k + '=' + authValues[k]) |
|
} else { |
|
authHeader.push(k + '="' + authValues[k] + '"') |
|
} |
|
} |
|
} |
|
authHeader = 'Digest ' + authHeader.join(', ') |
|
self.sentAuth = true |
|
return authHeader |
|
} |
|
|
|
Auth.prototype.onRequest = function (user, pass, sendImmediately, bearer) { |
|
var self = this |
|
, request = self.request |
|
|
|
var authHeader |
|
if (bearer === undefined && user === undefined) { |
|
throw new Error('no auth mechanism defined') |
|
} else if (bearer !== undefined) { |
|
authHeader = self.bearer(bearer, sendImmediately) |
|
} else { |
|
authHeader = self.basic(user, pass, sendImmediately) |
|
} |
|
if (authHeader) { |
|
request.setHeader('authorization', authHeader) |
|
} |
|
} |
|
|
|
Auth.prototype.onResponse = function (response) { |
|
var self = this |
|
, request = self.request |
|
|
|
if (!self.hasAuth || self.sentAuth) { return null } |
|
|
|
var c = caseless(response.headers) |
|
|
|
var authHeader = c.get('www-authenticate') |
|
var authVerb = authHeader && authHeader.split(' ')[0].toLowerCase() |
|
// debug('reauth', authVerb) |
|
|
|
switch (authVerb) { |
|
case 'basic': |
|
return self.basic(self.user, self.pass, true) |
|
|
|
case 'bearer': |
|
return self.bearer(self.bearerToken, true) |
|
|
|
case 'digest': |
|
return self.digest(request.method, request.path, authHeader) |
|
} |
|
} |
|
|
|
exports.Auth = Auth |
|
|
|
},{"./helpers":59,"caseless":73,"node-uuid":125}],55:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var tough = require('tough-cookie') |
|
|
|
var Cookie = tough.Cookie |
|
, CookieJar = tough.CookieJar |
|
|
|
|
|
exports.parse = function(str) { |
|
if (str && str.uri) { |
|
str = str.uri |
|
} |
|
if (typeof str !== 'string') { |
|
throw new Error('The cookie function only accepts STRING as param') |
|
} |
|
return Cookie.parse(str) |
|
} |
|
|
|
// Adapt the sometimes-Async api of tough.CookieJar to our requirements |
|
function RequestJar(store) { |
|
var self = this |
|
self._jar = new CookieJar(store) |
|
} |
|
RequestJar.prototype.setCookie = function(cookieOrStr, uri, options) { |
|
var self = this |
|
return self._jar.setCookieSync(cookieOrStr, uri, options || {}) |
|
} |
|
RequestJar.prototype.getCookieString = function(uri) { |
|
var self = this |
|
return self._jar.getCookieStringSync(uri) |
|
} |
|
RequestJar.prototype.getCookies = function(uri) { |
|
var self = this |
|
return self._jar.getCookiesSync(uri) |
|
} |
|
|
|
exports.jar = function(store) { |
|
return new RequestJar(store) |
|
} |
|
|
|
},{"tough-cookie":133}],56:[function(require,module,exports){ |
|
'use strict' |
|
|
|
module.exports = |
|
function copy (obj) { |
|
var o = {} |
|
Object.keys(obj).forEach(function (i) { |
|
o[i] = obj[i] |
|
}) |
|
return o |
|
} |
|
|
|
},{}],57:[function(require,module,exports){ |
|
(function (process){ |
|
'use strict' |
|
|
|
function formatHostname(hostname) { |
|
// canonicalize the hostname, so that 'oogle.com' won't match 'google.com' |
|
return hostname.replace(/^\.*/, '.').toLowerCase() |
|
} |
|
|
|
function parseNoProxyZone(zone) { |
|
zone = zone.trim().toLowerCase() |
|
|
|
var zoneParts = zone.split(':', 2) |
|
, zoneHost = formatHostname(zoneParts[0]) |
|
, zonePort = zoneParts[1] |
|
, hasPort = zone.indexOf(':') > -1 |
|
|
|
return {hostname: zoneHost, port: zonePort, hasPort: hasPort} |
|
} |
|
|
|
function uriInNoProxy(uri, noProxy) { |
|
var port = uri.port || (uri.protocol === 'https:' ? '443' : '80') |
|
, hostname = formatHostname(uri.hostname) |
|
, noProxyList = noProxy.split(',') |
|
|
|
// iterate through the noProxyList until it finds a match. |
|
return noProxyList.map(parseNoProxyZone).some(function(noProxyZone) { |
|
var isMatchedAt = hostname.indexOf(noProxyZone.hostname) |
|
, hostnameMatched = ( |
|
isMatchedAt > -1 && |
|
(isMatchedAt === hostname.length - noProxyZone.hostname.length) |
|
) |
|
|
|
if (noProxyZone.hasPort) { |
|
return (port === noProxyZone.port) && hostnameMatched |
|
} |
|
|
|
return hostnameMatched |
|
}) |
|
} |
|
|
|
function getProxyFromURI(uri) { |
|
// Decide the proper request proxy to use based on the request URI object and the |
|
// environmental variables (NO_PROXY, HTTP_PROXY, etc.) |
|
// respect NO_PROXY environment variables (see: http://lynx.isc.org/current/breakout/lynx_help/keystrokes/environments.html) |
|
|
|
var noProxy = process.env.NO_PROXY || process.env.no_proxy || '' |
|
|
|
// if the noProxy is a wildcard then return null |
|
|
|
if (noProxy === '*') { |
|
return null |
|
} |
|
|
|
// if the noProxy is not empty and the uri is found return null |
|
|
|
if (noProxy !== '' && uriInNoProxy(uri, noProxy)) { |
|
return null |
|
} |
|
|
|
// Check for HTTP or HTTPS Proxy in environment Else default to null |
|
|
|
if (uri.protocol === 'http:') { |
|
return process.env.HTTP_PROXY || |
|
process.env.http_proxy || null |
|
} |
|
|
|
if (uri.protocol === 'https:') { |
|
return process.env.HTTPS_PROXY || |
|
process.env.https_proxy || |
|
process.env.HTTP_PROXY || |
|
process.env.http_proxy || null |
|
} |
|
|
|
// if none of that works, return null |
|
// (What uri protocol are you using then?) |
|
|
|
return null |
|
} |
|
|
|
module.exports = getProxyFromURI |
|
|
|
}).call(this,require('_process')) |
|
},{"_process":323}],58:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var fs = require('fs') |
|
var qs = require('querystring') |
|
var validate = require('har-validator') |
|
var util = require('util') |
|
|
|
function Har (request) { |
|
this.request = request |
|
} |
|
|
|
Har.prototype.reducer = function (obj, pair) { |
|
// new property ? |
|
if (obj[pair.name] === undefined) { |
|
obj[pair.name] = pair.value |
|
return obj |
|
} |
|
|
|
// existing? convert to array |
|
var arr = [ |
|
obj[pair.name], |
|
pair.value |
|
] |
|
|
|
obj[pair.name] = arr |
|
|
|
return obj |
|
} |
|
|
|
Har.prototype.prep = function (data) { |
|
// construct utility properties |
|
data.queryObj = {} |
|
data.headersObj = {} |
|
data.postData.jsonObj = false |
|
data.postData.paramsObj = false |
|
|
|
// construct query objects |
|
if (data.queryString && data.queryString.length) { |
|
data.queryObj = data.queryString.reduce(this.reducer, {}) |
|
} |
|
|
|
// construct headers objects |
|
if (data.headers && data.headers.length) { |
|
// loweCase header keys |
|
data.headersObj = data.headers.reduceRight(function (headers, header) { |
|
headers[header.name] = header.value |
|
return headers |
|
}, {}) |
|
} |
|
|
|
// construct Cookie header |
|
if (data.cookies && data.cookies.length) { |
|
var cookies = data.cookies.map(function (cookie) { |
|
return cookie.name + '=' + cookie.value |
|
}) |
|
|
|
if (cookies.length) { |
|
data.headersObj.cookie = cookies.join('; ') |
|
} |
|
} |
|
|
|
// prep body |
|
switch (data.postData.mimeType) { |
|
case 'multipart/mixed': |
|
case 'multipart/related': |
|
case 'multipart/form-data': |
|
case 'multipart/alternative': |
|
// reset values |
|
data.postData.mimeType = 'multipart/form-data' |
|
break |
|
|
|
case 'application/x-www-form-urlencoded': |
|
if (!data.postData.params) { |
|
data.postData.text = '' |
|
} else { |
|
data.postData.paramsObj = data.postData.params.reduce(this.reducer, {}) |
|
|
|
// always overwrite |
|
data.postData.text = qs.stringify(data.postData.paramsObj) |
|
} |
|
break |
|
|
|
case 'text/json': |
|
case 'text/x-json': |
|
case 'application/json': |
|
case 'application/x-json': |
|
data.postData.mimeType = 'application/json' |
|
|
|
if (data.postData.text) { |
|
try { |
|
data.postData.jsonObj = JSON.parse(data.postData.text) |
|
} catch (e) { |
|
this.request.debug(e) |
|
|
|
// force back to text/plain |
|
data.postData.mimeType = 'text/plain' |
|
} |
|
} |
|
break |
|
} |
|
|
|
return data |
|
} |
|
|
|
Har.prototype.options = function (options) { |
|
// skip if no har property defined |
|
if (!options.har) { |
|
return options |
|
} |
|
|
|
var har = util._extend({}, options.har) |
|
|
|
// only process the first entry |
|
if (har.log && har.log.entries) { |
|
har = har.log.entries[0] |
|
} |
|
|
|
// add optional properties to make validation successful |
|
har.url = har.url || options.url || options.uri || options.baseUrl || '/' |
|
har.httpVersion = har.httpVersion || 'HTTP/1.1' |
|
har.queryString = har.queryString || [] |
|
har.headers = har.headers || [] |
|
har.cookies = har.cookies || [] |
|
har.postData = har.postData || {} |
|
har.postData.mimeType = har.postData.mimeType || 'application/octet-stream' |
|
|
|
har.bodySize = 0 |
|
har.headersSize = 0 |
|
har.postData.size = 0 |
|
|
|
if (!validate.request(har)) { |
|
return options |
|
} |
|
|
|
// clean up and get some utility properties |
|
var req = this.prep(har) |
|
|
|
// construct new options |
|
if (req.url) { |
|
options.url = req.url |
|
} |
|
|
|
if (req.method) { |
|
options.method = req.method |
|
} |
|
|
|
if (Object.keys(req.queryObj).length) { |
|
options.qs = req.queryObj |
|
} |
|
|
|
if (Object.keys(req.headersObj).length) { |
|
options.headers = req.headersObj |
|
} |
|
|
|
switch (req.postData.mimeType) { |
|
case 'application/x-www-form-urlencoded': |
|
options.form = req.postData.paramsObj |
|
break |
|
|
|
case 'application/json': |
|
if (req.postData.jsonObj) { |
|
options.body = req.postData.jsonObj |
|
options.json = true |
|
} |
|
break |
|
|
|
case 'multipart/form-data': |
|
options.formData = {} |
|
|
|
req.postData.params.forEach(function (param) { |
|
var attachment = {} |
|
|
|
if (!param.fileName && !param.fileName && !param.contentType) { |
|
options.formData[param.name] = param.value |
|
return |
|
} |
|
|
|
// attempt to read from disk! |
|
if (param.fileName && !param.value) { |
|
attachment.value = fs.createReadStream(param.fileName) |
|
} else if (param.value) { |
|
attachment.value = param.value |
|
} |
|
|
|
if (param.fileName) { |
|
attachment.options = { |
|
filename: param.fileName, |
|
contentType: param.contentType ? param.contentType : null |
|
} |
|
} |
|
|
|
options.formData[param.name] = attachment |
|
}) |
|
break |
|
|
|
default: |
|
if (req.postData.text) { |
|
options.body = req.postData.text |
|
} |
|
} |
|
|
|
return options |
|
} |
|
|
|
exports.Har = Har |
|
|
|
},{"fs":156,"har-validator":87,"querystring":327,"util":343}],59:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
'use strict' |
|
|
|
var jsonSafeStringify = require('json-stringify-safe') |
|
, crypto = require('crypto') |
|
|
|
function deferMethod() { |
|
if(typeof setImmediate === 'undefined') { |
|
return process.nextTick |
|
} |
|
|
|
return setImmediate |
|
} |
|
|
|
function isFunction(value) { |
|
return typeof value === 'function' |
|
} |
|
|
|
function paramsHaveRequestBody(params) { |
|
return ( |
|
params.body || |
|
params.requestBodyStream || |
|
(params.json && typeof params.json !== 'boolean') || |
|
params.multipart |
|
) |
|
} |
|
|
|
function safeStringify (obj) { |
|
var ret |
|
try { |
|
ret = JSON.stringify(obj) |
|
} catch (e) { |
|
ret = jsonSafeStringify(obj) |
|
} |
|
return ret |
|
} |
|
|
|
function md5 (str) { |
|
return crypto.createHash('md5').update(str).digest('hex') |
|
} |
|
|
|
function isReadStream (rs) { |
|
return rs.readable && rs.path && rs.mode |
|
} |
|
|
|
function toBase64 (str) { |
|
return (new Buffer(str || '', 'utf8')).toString('base64') |
|
} |
|
|
|
exports.isFunction = isFunction |
|
exports.paramsHaveRequestBody = paramsHaveRequestBody |
|
exports.safeStringify = safeStringify |
|
exports.md5 = md5 |
|
exports.isReadStream = isReadStream |
|
exports.toBase64 = toBase64 |
|
exports.defer = deferMethod() |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"_process":323,"buffer":172,"crypto":178,"json-stringify-safe":121}],60:[function(require,module,exports){ |
|
(function (Buffer){ |
|
'use strict' |
|
|
|
var uuid = require('node-uuid') |
|
, CombinedStream = require('combined-stream') |
|
, isstream = require('isstream') |
|
|
|
|
|
function Multipart (request) { |
|
this.request = request |
|
this.boundary = uuid() |
|
this.chunked = false |
|
this.body = null |
|
} |
|
|
|
Multipart.prototype.isChunked = function (options) { |
|
var self = this |
|
, chunked = false |
|
, parts = options.data || options |
|
|
|
if (!parts.forEach) { |
|
throw new Error('Argument error, options.multipart.') |
|
} |
|
|
|
if (options.chunked !== undefined) { |
|
chunked = options.chunked |
|
} |
|
|
|
if (self.request.getHeader('transfer-encoding') === 'chunked') { |
|
chunked = true |
|
} |
|
|
|
if (!chunked) { |
|
parts.forEach(function (part) { |
|
if(typeof part.body === 'undefined') { |
|
throw new Error('Body attribute missing in multipart.') |
|
} |
|
if (isstream(part.body)) { |
|
chunked = true |
|
} |
|
}) |
|
} |
|
|
|
return chunked |
|
} |
|
|
|
Multipart.prototype.setHeaders = function (chunked) { |
|
var self = this |
|
|
|
if (chunked && !self.request.hasHeader('transfer-encoding')) { |
|
self.request.setHeader('transfer-encoding', 'chunked') |
|
} |
|
|
|
var header = self.request.getHeader('content-type') |
|
|
|
if (!header || header.indexOf('multipart') === -1) { |
|
self.request.setHeader('content-type', 'multipart/related; boundary=' + self.boundary) |
|
} else { |
|
if (header.indexOf('boundary') !== -1) { |
|
self.boundary = header.replace(/.*boundary=([^\s;]+).*/, '$1') |
|
} else { |
|
self.request.setHeader('content-type', header + '; boundary=' + self.boundary) |
|
} |
|
} |
|
} |
|
|
|
Multipart.prototype.build = function (parts, chunked) { |
|
var self = this |
|
var body = chunked ? new CombinedStream() : [] |
|
|
|
function add (part) { |
|
return chunked ? body.append(part) : body.push(new Buffer(part)) |
|
} |
|
|
|
if (self.request.preambleCRLF) { |
|
add('\r\n') |
|
} |
|
|
|
parts.forEach(function (part) { |
|
var preamble = '--' + self.boundary + '\r\n' |
|
Object.keys(part).forEach(function (key) { |
|
if (key === 'body') { return } |
|
preamble += key + ': ' + part[key] + '\r\n' |
|
}) |
|
preamble += '\r\n' |
|
add(preamble) |
|
add(part.body) |
|
add('\r\n') |
|
}) |
|
add('--' + self.boundary + '--') |
|
|
|
if (self.request.postambleCRLF) { |
|
add('\r\n') |
|
} |
|
|
|
return body |
|
} |
|
|
|
Multipart.prototype.onRequest = function (options) { |
|
var self = this |
|
|
|
var chunked = self.isChunked(options) |
|
, parts = options.data || options |
|
|
|
self.setHeaders(chunked) |
|
self.chunked = chunked |
|
self.body = self.build(parts, chunked) |
|
} |
|
|
|
exports.Multipart = Multipart |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"combined-stream":74,"isstream":120,"node-uuid":125}],61:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var qs = require('qs') |
|
, caseless = require('caseless') |
|
, uuid = require('node-uuid') |
|
, oauth = require('oauth-sign') |
|
|
|
|
|
function OAuth (request) { |
|
this.request = request |
|
} |
|
|
|
OAuth.prototype.buildParams = function (_oauth, uri, method, query, form, qsLib) { |
|
var oa = {} |
|
for (var i in _oauth) { |
|
oa['oauth_' + i] = _oauth[i] |
|
} |
|
if (!oa.oauth_version) { |
|
oa.oauth_version = '1.0' |
|
} |
|
if (!oa.oauth_timestamp) { |
|
oa.oauth_timestamp = Math.floor( Date.now() / 1000 ).toString() |
|
} |
|
if (!oa.oauth_nonce) { |
|
oa.oauth_nonce = uuid().replace(/-/g, '') |
|
} |
|
if (!oa.oauth_signature_method) { |
|
oa.oauth_signature_method = 'HMAC-SHA1' |
|
} |
|
|
|
var consumer_secret_or_private_key = oa.oauth_consumer_secret || oa.oauth_private_key |
|
delete oa.oauth_consumer_secret |
|
delete oa.oauth_private_key |
|
|
|
var token_secret = oa.oauth_token_secret |
|
delete oa.oauth_token_secret |
|
|
|
var realm = oa.oauth_realm |
|
delete oa.oauth_realm |
|
delete oa.oauth_transport_method |
|
|
|
var baseurl = uri.protocol + '//' + uri.host + uri.pathname |
|
var params = qsLib.parse([].concat(query, form, qsLib.stringify(oa)).join('&')) |
|
|
|
oa.oauth_signature = oauth.sign( |
|
oa.oauth_signature_method, |
|
method, |
|
baseurl, |
|
params, |
|
consumer_secret_or_private_key, |
|
token_secret) |
|
|
|
if (realm) { |
|
oa.realm = realm |
|
} |
|
|
|
return oa |
|
} |
|
|
|
OAuth.prototype.concatParams = function (oa, sep, wrap) { |
|
wrap = wrap || '' |
|
|
|
var params = Object.keys(oa).filter(function (i) { |
|
return i !== 'realm' && i !== 'oauth_signature' |
|
}).sort() |
|
|
|
if (oa.realm) { |
|
params.splice(0, 1, 'realm') |
|
} |
|
params.push('oauth_signature') |
|
|
|
return params.map(function (i) { |
|
return i + '=' + wrap + oauth.rfc3986(oa[i]) + wrap |
|
}).join(sep) |
|
} |
|
|
|
OAuth.prototype.onRequest = function (_oauth) { |
|
var self = this |
|
, request = self.request |
|
|
|
var uri = request.uri || {} |
|
, method = request.method || '' |
|
, headers = caseless(request.headers) |
|
, body = request.body || '' |
|
, qsLib = request.qsLib || qs |
|
|
|
var form |
|
, query |
|
, contentType = headers.get('content-type') || '' |
|
, formContentType = 'application/x-www-form-urlencoded' |
|
, transport = _oauth.transport_method || 'header' |
|
|
|
if (contentType.slice(0, formContentType.length) === formContentType) { |
|
contentType = formContentType |
|
form = body |
|
} |
|
if (uri.query) { |
|
query = uri.query |
|
} |
|
if (transport === 'body' && (method !== 'POST' || contentType !== formContentType)) { |
|
throw new Error('oauth: transport_method of \'body\' requires \'POST\' ' + |
|
'and content-type \'' + formContentType + '\'') |
|
} |
|
|
|
var oa = this.buildParams(_oauth, uri, method, query, form, qsLib) |
|
|
|
switch (transport) { |
|
case 'header': |
|
request.setHeader('Authorization', 'OAuth ' + this.concatParams(oa, ',', '"')) |
|
break |
|
|
|
case 'query': |
|
request.path = (query ? '&' : '?') + this.concatParams(oa, '&') |
|
break |
|
|
|
case 'body': |
|
request.body = (form ? form + '&' : '') + this.concatParams(oa, '&') |
|
break |
|
|
|
default: |
|
throw new Error('oauth: transport_method invalid') |
|
} |
|
} |
|
|
|
exports.OAuth = OAuth |
|
|
|
},{"caseless":73,"node-uuid":125,"oauth-sign":126,"qs":127}],62:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var url = require('url') |
|
var isUrl = /^https?:/ |
|
|
|
function Redirect (request) { |
|
this.request = request |
|
this.followRedirect = true |
|
this.followRedirects = true |
|
this.followAllRedirects = false |
|
this.allowRedirect = function () {return true} |
|
this.maxRedirects = 10 |
|
this.redirects = [] |
|
this.redirectsFollowed = 0 |
|
this.removeRefererHeader = false |
|
} |
|
|
|
Redirect.prototype.onRequest = function () { |
|
var self = this |
|
, request = self.request |
|
|
|
if (request.maxRedirects !== undefined) { |
|
self.maxRedirects = request.maxRedirects |
|
} |
|
if (typeof request.followRedirect === 'function') { |
|
self.allowRedirect = request.followRedirect |
|
} |
|
if (request.followRedirect !== undefined) { |
|
self.followRedirects = !!request.followRedirect |
|
} |
|
if (request.followAllRedirects !== undefined) { |
|
self.followAllRedirects = request.followAllRedirects |
|
} |
|
if (self.followRedirects || self.followAllRedirects) { |
|
self.redirects = self.redirects || [] |
|
} |
|
if (request.removeRefererHeader !== undefined) { |
|
self.removeRefererHeader = request.removeRefererHeader |
|
} |
|
} |
|
|
|
Redirect.prototype.redirectTo = function (response) { |
|
var self = this |
|
, request = self.request |
|
|
|
var redirectTo = null |
|
if (response.statusCode >= 300 && response.statusCode < 400 && response.caseless.has('location')) { |
|
var location = response.caseless.get('location') |
|
// debug('redirect', location) |
|
|
|
if (self.followAllRedirects) { |
|
redirectTo = location |
|
} else if (self.followRedirects) { |
|
switch (request.method) { |
|
case 'PATCH': |
|
case 'PUT': |
|
case 'POST': |
|
case 'DELETE': |
|
// Do not follow redirects |
|
break |
|
default: |
|
redirectTo = location |
|
break |
|
} |
|
} |
|
} else if (response.statusCode === 401) { |
|
var authHeader = request._auth.onResponse(response) |
|
if (authHeader) { |
|
request.setHeader('authorization', authHeader) |
|
redirectTo = request.uri |
|
} |
|
} |
|
return redirectTo |
|
} |
|
|
|
Redirect.prototype.onResponse = function (response) { |
|
var self = this |
|
, request = self.request |
|
|
|
var redirectTo = self.redirectTo(response) |
|
if (!redirectTo || !self.allowRedirect.call(request, response)) { |
|
return false |
|
} |
|
|
|
|
|
// debug('redirect to', redirectTo) |
|
|
|
// ignore any potential response body. it cannot possibly be useful |
|
// to us at this point. |
|
if (request._paused) { |
|
response.resume() |
|
} |
|
|
|
if (self.redirectsFollowed >= self.maxRedirects) { |
|
request.emit('error', new Error('Exceeded maxRedirects. Probably stuck in a redirect loop ' + request.uri.href)) |
|
return false |
|
} |
|
self.redirectsFollowed += 1 |
|
|
|
if (!isUrl.test(redirectTo)) { |
|
redirectTo = url.resolve(request.uri.href, redirectTo) |
|
} |
|
|
|
var uriPrev = request.uri |
|
request.uri = url.parse(redirectTo) |
|
|
|
// handle the case where we change protocol from https to http or vice versa |
|
if (request.uri.protocol !== uriPrev.protocol) { |
|
request._updateProtocol() |
|
} |
|
|
|
self.redirects.push( |
|
{ statusCode : response.statusCode |
|
, redirectUri: redirectTo |
|
} |
|
) |
|
if (self.followAllRedirects && response.statusCode !== 401 && response.statusCode !== 307) { |
|
request.method = 'GET' |
|
} |
|
// request.method = 'GET' // Force all redirects to use GET || commented out fixes #215 |
|
delete request.src |
|
delete request.req |
|
delete request.agent |
|
delete request._started |
|
if (response.statusCode !== 401 && response.statusCode !== 307) { |
|
// Remove parameters from the previous response, unless this is the second request |
|
// for a server that requires digest authentication. |
|
delete request.body |
|
delete request._form |
|
if (request.headers) { |
|
request.removeHeader('host') |
|
request.removeHeader('content-type') |
|
request.removeHeader('content-length') |
|
if (request.uri.hostname !== request.originalHost.split(':')[0]) { |
|
// Remove authorization if changing hostnames (but not if just |
|
// changing ports or protocols). This matches the behavior of curl: |
|
// https://github.com/bagder/curl/blob/6beb0eee/lib/http.c#L710 |
|
request.removeHeader('authorization') |
|
} |
|
} |
|
} |
|
|
|
if (!self.removeRefererHeader) { |
|
request.setHeader('referer', request.uri.href) |
|
} |
|
|
|
request.emit('redirect') |
|
|
|
request.init() |
|
|
|
return true |
|
} |
|
|
|
exports.Redirect = Redirect |
|
|
|
},{"url":341}],63:[function(require,module,exports){ |
|
|
|
/*! |
|
* knox - auth |
|
* Copyright(c) 2010 LearnBoost <dev@learnboost.com> |
|
* MIT Licensed |
|
*/ |
|
|
|
/** |
|
* Module dependencies. |
|
*/ |
|
|
|
var crypto = require('crypto') |
|
, parse = require('url').parse |
|
; |
|
|
|
/** |
|
* Valid keys. |
|
*/ |
|
|
|
var keys = |
|
[ 'acl' |
|
, 'location' |
|
, 'logging' |
|
, 'notification' |
|
, 'partNumber' |
|
, 'policy' |
|
, 'requestPayment' |
|
, 'torrent' |
|
, 'uploadId' |
|
, 'uploads' |
|
, 'versionId' |
|
, 'versioning' |
|
, 'versions' |
|
, 'website' |
|
] |
|
|
|
/** |
|
* Return an "Authorization" header value with the given `options` |
|
* in the form of "AWS <key>:<signature>" |
|
* |
|
* @param {Object} options |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function authorization (options) { |
|
return 'AWS ' + options.key + ':' + sign(options) |
|
} |
|
|
|
module.exports = authorization |
|
module.exports.authorization = authorization |
|
|
|
/** |
|
* Simple HMAC-SHA1 Wrapper |
|
* |
|
* @param {Object} options |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function hmacSha1 (options) { |
|
return crypto.createHmac('sha1', options.secret).update(options.message).digest('base64') |
|
} |
|
|
|
module.exports.hmacSha1 = hmacSha1 |
|
|
|
/** |
|
* Create a base64 sha1 HMAC for `options`. |
|
* |
|
* @param {Object} options |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function sign (options) { |
|
options.message = stringToSign(options) |
|
return hmacSha1(options) |
|
} |
|
module.exports.sign = sign |
|
|
|
/** |
|
* Create a base64 sha1 HMAC for `options`. |
|
* |
|
* Specifically to be used with S3 presigned URLs |
|
* |
|
* @param {Object} options |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function signQuery (options) { |
|
options.message = queryStringToSign(options) |
|
return hmacSha1(options) |
|
} |
|
module.exports.signQuery= signQuery |
|
|
|
/** |
|
* Return a string for sign() with the given `options`. |
|
* |
|
* Spec: |
|
* |
|
* <verb>\n |
|
* <md5>\n |
|
* <content-type>\n |
|
* <date>\n |
|
* [headers\n] |
|
* <resource> |
|
* |
|
* @param {Object} options |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function stringToSign (options) { |
|
var headers = options.amazonHeaders || '' |
|
if (headers) headers += '\n' |
|
var r = |
|
[ options.verb |
|
, options.md5 |
|
, options.contentType |
|
, options.date ? options.date.toUTCString() : '' |
|
, headers + options.resource |
|
] |
|
return r.join('\n') |
|
} |
|
module.exports.queryStringToSign = stringToSign |
|
|
|
/** |
|
* Return a string for sign() with the given `options`, but is meant exclusively |
|
* for S3 presigned URLs |
|
* |
|
* Spec: |
|
* |
|
* <date>\n |
|
* <resource> |
|
* |
|
* @param {Object} options |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function queryStringToSign (options){ |
|
return 'GET\n\n\n' + options.date + '\n' + options.resource |
|
} |
|
module.exports.queryStringToSign = queryStringToSign |
|
|
|
/** |
|
* Perform the following: |
|
* |
|
* - ignore non-amazon headers |
|
* - lowercase fields |
|
* - sort lexicographically |
|
* - trim whitespace between ":" |
|
* - join with newline |
|
* |
|
* @param {Object} headers |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function canonicalizeHeaders (headers) { |
|
var buf = [] |
|
, fields = Object.keys(headers) |
|
; |
|
for (var i = 0, len = fields.length; i < len; ++i) { |
|
var field = fields[i] |
|
, val = headers[field] |
|
, field = field.toLowerCase() |
|
; |
|
if (0 !== field.indexOf('x-amz')) continue |
|
buf.push(field + ':' + val) |
|
} |
|
return buf.sort().join('\n') |
|
} |
|
module.exports.canonicalizeHeaders = canonicalizeHeaders |
|
|
|
/** |
|
* Perform the following: |
|
* |
|
* - ignore non sub-resources |
|
* - sort lexicographically |
|
* |
|
* @param {String} resource |
|
* @return {String} |
|
* @api private |
|
*/ |
|
|
|
function canonicalizeResource (resource) { |
|
var url = parse(resource, true) |
|
, path = url.pathname |
|
, buf = [] |
|
; |
|
|
|
Object.keys(url.query).forEach(function(key){ |
|
if (!~keys.indexOf(key)) return |
|
var val = '' == url.query[key] ? '' : '=' + encodeURIComponent(url.query[key]) |
|
buf.push(key + val) |
|
}) |
|
|
|
return path + (buf.length ? '?' + buf.sort().join('&') : '') |
|
} |
|
module.exports.canonicalizeResource = canonicalizeResource |
|
|
|
},{"crypto":178,"url":341}],64:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var DuplexStream = require('readable-stream/duplex') |
|
, util = require('util') |
|
|
|
function BufferList (callback) { |
|
if (!(this instanceof BufferList)) |
|
return new BufferList(callback) |
|
|
|
this._bufs = [] |
|
this.length = 0 |
|
|
|
if (typeof callback == 'function') { |
|
this._callback = callback |
|
|
|
var piper = function (err) { |
|
if (this._callback) { |
|
this._callback(err) |
|
this._callback = null |
|
} |
|
}.bind(this) |
|
|
|
this.on('pipe', function (src) { |
|
src.on('error', piper) |
|
}) |
|
this.on('unpipe', function (src) { |
|
src.removeListener('error', piper) |
|
}) |
|
} |
|
else if (Buffer.isBuffer(callback)) |
|
this.append(callback) |
|
else if (Array.isArray(callback)) { |
|
callback.forEach(function (b) { |
|
Buffer.isBuffer(b) && this.append(b) |
|
}.bind(this)) |
|
} |
|
|
|
DuplexStream.call(this) |
|
} |
|
|
|
util.inherits(BufferList, DuplexStream) |
|
|
|
BufferList.prototype._offset = function (offset) { |
|
var tot = 0, i = 0, _t |
|
for (; i < this._bufs.length; i++) { |
|
_t = tot + this._bufs[i].length |
|
if (offset < _t) |
|
return [ i, offset - tot ] |
|
tot = _t |
|
} |
|
} |
|
|
|
BufferList.prototype.append = function (buf) { |
|
var isBuffer = Buffer.isBuffer(buf) || |
|
buf instanceof BufferList |
|
|
|
this._bufs.push(isBuffer ? buf : new Buffer(buf)) |
|
this.length += buf.length |
|
return this |
|
} |
|
|
|
BufferList.prototype._write = function (buf, encoding, callback) { |
|
this.append(buf) |
|
if (callback) |
|
callback() |
|
} |
|
|
|
BufferList.prototype._read = function (size) { |
|
if (!this.length) |
|
return this.push(null) |
|
size = Math.min(size, this.length) |
|
this.push(this.slice(0, size)) |
|
this.consume(size) |
|
} |
|
|
|
BufferList.prototype.end = function (chunk) { |
|
DuplexStream.prototype.end.call(this, chunk) |
|
|
|
if (this._callback) { |
|
this._callback(null, this.slice()) |
|
this._callback = null |
|
} |
|
} |
|
|
|
BufferList.prototype.get = function (index) { |
|
return this.slice(index, index + 1)[0] |
|
} |
|
|
|
BufferList.prototype.slice = function (start, end) { |
|
return this.copy(null, 0, start, end) |
|
} |
|
|
|
BufferList.prototype.copy = function (dst, dstStart, srcStart, srcEnd) { |
|
if (typeof srcStart != 'number' || srcStart < 0) |
|
srcStart = 0 |
|
if (typeof srcEnd != 'number' || srcEnd > this.length) |
|
srcEnd = this.length |
|
if (srcStart >= this.length) |
|
return dst || new Buffer(0) |
|
if (srcEnd <= 0) |
|
return dst || new Buffer(0) |
|
|
|
var copy = !!dst |
|
, off = this._offset(srcStart) |
|
, len = srcEnd - srcStart |
|
, bytes = len |
|
, bufoff = (copy && dstStart) || 0 |
|
, start = off[1] |
|
, l |
|
, i |
|
|
|
// copy/slice everything |
|
if (srcStart === 0 && srcEnd == this.length) { |
|
if (!copy) // slice, just return a full concat |
|
return Buffer.concat(this._bufs) |
|
|
|
// copy, need to copy individual buffers |
|
for (i = 0; i < this._bufs.length; i++) { |
|
this._bufs[i].copy(dst, bufoff) |
|
bufoff += this._bufs[i].length |
|
} |
|
|
|
return dst |
|
} |
|
|
|
// easy, cheap case where it's a subset of one of the buffers |
|
if (bytes <= this._bufs[off[0]].length - start) { |
|
return copy |
|
? this._bufs[off[0]].copy(dst, dstStart, start, start + bytes) |
|
: this._bufs[off[0]].slice(start, start + bytes) |
|
} |
|
|
|
if (!copy) // a slice, we need something to copy in to |
|
dst = new Buffer(len) |
|
|
|
for (i = off[0]; i < this._bufs.length; i++) { |
|
l = this._bufs[i].length - start |
|
|
|
if (bytes > l) { |
|
this._bufs[i].copy(dst, bufoff, start) |
|
} else { |
|
this._bufs[i].copy(dst, bufoff, start, start + bytes) |
|
break |
|
} |
|
|
|
bufoff += l |
|
bytes -= l |
|
|
|
if (start) |
|
start = 0 |
|
} |
|
|
|
return dst |
|
} |
|
|
|
BufferList.prototype.toString = function (encoding, start, end) { |
|
return this.slice(start, end).toString(encoding) |
|
} |
|
|
|
BufferList.prototype.consume = function (bytes) { |
|
while (this._bufs.length) { |
|
if (bytes > this._bufs[0].length) { |
|
bytes -= this._bufs[0].length |
|
this.length -= this._bufs[0].length |
|
this._bufs.shift() |
|
} else { |
|
this._bufs[0] = this._bufs[0].slice(bytes) |
|
this.length -= bytes |
|
break |
|
} |
|
} |
|
return this |
|
} |
|
|
|
BufferList.prototype.duplicate = function () { |
|
var i = 0 |
|
, copy = new BufferList() |
|
|
|
for (; i < this._bufs.length; i++) |
|
copy.append(this._bufs[i]) |
|
|
|
return copy |
|
} |
|
|
|
BufferList.prototype.destroy = function () { |
|
this._bufs.length = 0; |
|
this.length = 0; |
|
this.push(null); |
|
} |
|
|
|
;(function () { |
|
var methods = { |
|
'readDoubleBE' : 8 |
|
, 'readDoubleLE' : 8 |
|
, 'readFloatBE' : 4 |
|
, 'readFloatLE' : 4 |
|
, 'readInt32BE' : 4 |
|
, 'readInt32LE' : 4 |
|
, 'readUInt32BE' : 4 |
|
, 'readUInt32LE' : 4 |
|
, 'readInt16BE' : 2 |
|
, 'readInt16LE' : 2 |
|
, 'readUInt16BE' : 2 |
|
, 'readUInt16LE' : 2 |
|
, 'readInt8' : 1 |
|
, 'readUInt8' : 1 |
|
} |
|
|
|
for (var m in methods) { |
|
(function (m) { |
|
BufferList.prototype[m] = function (offset) { |
|
return this.slice(offset, offset + methods[m])[m](0) |
|
} |
|
}(m)) |
|
} |
|
}()) |
|
|
|
module.exports = BufferList |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"readable-stream/duplex":65,"util":343}],65:[function(require,module,exports){ |
|
module.exports = require("./lib/_stream_duplex.js") |
|
|
|
},{"./lib/_stream_duplex.js":66}],66:[function(require,module,exports){ |
|
(function (process){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// a duplex stream is just a stream that is both readable and writable. |
|
// Since JS doesn't have multiple prototypal inheritance, this class |
|
// prototypally inherits from Readable, and then parasitically from |
|
// Writable. |
|
|
|
module.exports = Duplex; |
|
|
|
/*<replacement>*/ |
|
var objectKeys = Object.keys || function (obj) { |
|
var keys = []; |
|
for (var key in obj) keys.push(key); |
|
return keys; |
|
} |
|
/*</replacement>*/ |
|
|
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
var Readable = require('./_stream_readable'); |
|
var Writable = require('./_stream_writable'); |
|
|
|
util.inherits(Duplex, Readable); |
|
|
|
forEach(objectKeys(Writable.prototype), function(method) { |
|
if (!Duplex.prototype[method]) |
|
Duplex.prototype[method] = Writable.prototype[method]; |
|
}); |
|
|
|
function Duplex(options) { |
|
if (!(this instanceof Duplex)) |
|
return new Duplex(options); |
|
|
|
Readable.call(this, options); |
|
Writable.call(this, options); |
|
|
|
if (options && options.readable === false) |
|
this.readable = false; |
|
|
|
if (options && options.writable === false) |
|
this.writable = false; |
|
|
|
this.allowHalfOpen = true; |
|
if (options && options.allowHalfOpen === false) |
|
this.allowHalfOpen = false; |
|
|
|
this.once('end', onend); |
|
} |
|
|
|
// the no-half-open enforcer |
|
function onend() { |
|
// if we allow half-open state, or if the writable side ended, |
|
// then we're ok. |
|
if (this.allowHalfOpen || this._writableState.ended) |
|
return; |
|
|
|
// no more data can be written. |
|
// But allow more writes to happen in this tick. |
|
process.nextTick(this.end.bind(this)); |
|
} |
|
|
|
function forEach (xs, f) { |
|
for (var i = 0, l = xs.length; i < l; i++) { |
|
f(xs[i], i); |
|
} |
|
} |
|
|
|
}).call(this,require('_process')) |
|
},{"./_stream_readable":67,"./_stream_writable":68,"_process":323,"core-util-is":69,"inherits":70}],67:[function(require,module,exports){ |
|
(function (process){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
module.exports = Readable; |
|
|
|
/*<replacement>*/ |
|
var isArray = require('isarray'); |
|
/*</replacement>*/ |
|
|
|
|
|
/*<replacement>*/ |
|
var Buffer = require('buffer').Buffer; |
|
/*</replacement>*/ |
|
|
|
Readable.ReadableState = ReadableState; |
|
|
|
var EE = require('events').EventEmitter; |
|
|
|
/*<replacement>*/ |
|
if (!EE.listenerCount) EE.listenerCount = function(emitter, type) { |
|
return emitter.listeners(type).length; |
|
}; |
|
/*</replacement>*/ |
|
|
|
var Stream = require('stream'); |
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
var StringDecoder; |
|
|
|
util.inherits(Readable, Stream); |
|
|
|
function ReadableState(options, stream) { |
|
options = options || {}; |
|
|
|
// the point at which it stops calling _read() to fill the buffer |
|
// Note: 0 is a valid value, means "don't call _read preemptively ever" |
|
var hwm = options.highWaterMark; |
|
this.highWaterMark = (hwm || hwm === 0) ? hwm : 16 * 1024; |
|
|
|
// cast to ints. |
|
this.highWaterMark = ~~this.highWaterMark; |
|
|
|
this.buffer = []; |
|
this.length = 0; |
|
this.pipes = null; |
|
this.pipesCount = 0; |
|
this.flowing = false; |
|
this.ended = false; |
|
this.endEmitted = false; |
|
this.reading = false; |
|
|
|
// In streams that never have any data, and do push(null) right away, |
|
// the consumer can miss the 'end' event if they do some I/O before |
|
// consuming the stream. So, we don't emit('end') until some reading |
|
// happens. |
|
this.calledRead = false; |
|
|
|
// a flag to be able to tell if the onwrite cb is called immediately, |
|
// or on a later tick. We set this to true at first, becuase any |
|
// actions that shouldn't happen until "later" should generally also |
|
// not happen before the first write call. |
|
this.sync = true; |
|
|
|
// whenever we return null, then we set a flag to say |
|
// that we're awaiting a 'readable' event emission. |
|
this.needReadable = false; |
|
this.emittedReadable = false; |
|
this.readableListening = false; |
|
|
|
|
|
// object stream flag. Used to make read(n) ignore n and to |
|
// make all the buffer merging and length checks go away |
|
this.objectMode = !!options.objectMode; |
|
|
|
// Crypto is kind of old and crusty. Historically, its default string |
|
// encoding is 'binary' so we have to make this configurable. |
|
// Everything else in the universe uses 'utf8', though. |
|
this.defaultEncoding = options.defaultEncoding || 'utf8'; |
|
|
|
// when piping, we only care about 'readable' events that happen |
|
// after read()ing all the bytes and not getting any pushback. |
|
this.ranOut = false; |
|
|
|
// the number of writers that are awaiting a drain event in .pipe()s |
|
this.awaitDrain = 0; |
|
|
|
// if true, a maybeReadMore has been scheduled |
|
this.readingMore = false; |
|
|
|
this.decoder = null; |
|
this.encoding = null; |
|
if (options.encoding) { |
|
if (!StringDecoder) |
|
StringDecoder = require('string_decoder/').StringDecoder; |
|
this.decoder = new StringDecoder(options.encoding); |
|
this.encoding = options.encoding; |
|
} |
|
} |
|
|
|
function Readable(options) { |
|
if (!(this instanceof Readable)) |
|
return new Readable(options); |
|
|
|
this._readableState = new ReadableState(options, this); |
|
|
|
// legacy |
|
this.readable = true; |
|
|
|
Stream.call(this); |
|
} |
|
|
|
// Manually shove something into the read() buffer. |
|
// This returns true if the highWaterMark has not been hit yet, |
|
// similar to how Writable.write() returns true if you should |
|
// write() some more. |
|
Readable.prototype.push = function(chunk, encoding) { |
|
var state = this._readableState; |
|
|
|
if (typeof chunk === 'string' && !state.objectMode) { |
|
encoding = encoding || state.defaultEncoding; |
|
if (encoding !== state.encoding) { |
|
chunk = new Buffer(chunk, encoding); |
|
encoding = ''; |
|
} |
|
} |
|
|
|
return readableAddChunk(this, state, chunk, encoding, false); |
|
}; |
|
|
|
// Unshift should *always* be something directly out of read() |
|
Readable.prototype.unshift = function(chunk) { |
|
var state = this._readableState; |
|
return readableAddChunk(this, state, chunk, '', true); |
|
}; |
|
|
|
function readableAddChunk(stream, state, chunk, encoding, addToFront) { |
|
var er = chunkInvalid(state, chunk); |
|
if (er) { |
|
stream.emit('error', er); |
|
} else if (chunk === null || chunk === undefined) { |
|
state.reading = false; |
|
if (!state.ended) |
|
onEofChunk(stream, state); |
|
} else if (state.objectMode || chunk && chunk.length > 0) { |
|
if (state.ended && !addToFront) { |
|
var e = new Error('stream.push() after EOF'); |
|
stream.emit('error', e); |
|
} else if (state.endEmitted && addToFront) { |
|
var e = new Error('stream.unshift() after end event'); |
|
stream.emit('error', e); |
|
} else { |
|
if (state.decoder && !addToFront && !encoding) |
|
chunk = state.decoder.write(chunk); |
|
|
|
// update the buffer info. |
|
state.length += state.objectMode ? 1 : chunk.length; |
|
if (addToFront) { |
|
state.buffer.unshift(chunk); |
|
} else { |
|
state.reading = false; |
|
state.buffer.push(chunk); |
|
} |
|
|
|
if (state.needReadable) |
|
emitReadable(stream); |
|
|
|
maybeReadMore(stream, state); |
|
} |
|
} else if (!addToFront) { |
|
state.reading = false; |
|
} |
|
|
|
return needMoreData(state); |
|
} |
|
|
|
|
|
|
|
// if it's past the high water mark, we can push in some more. |
|
// Also, if we have no data yet, we can stand some |
|
// more bytes. This is to work around cases where hwm=0, |
|
// such as the repl. Also, if the push() triggered a |
|
// readable event, and the user called read(largeNumber) such that |
|
// needReadable was set, then we ought to push more, so that another |
|
// 'readable' event will be triggered. |
|
function needMoreData(state) { |
|
return !state.ended && |
|
(state.needReadable || |
|
state.length < state.highWaterMark || |
|
state.length === 0); |
|
} |
|
|
|
// backwards compatibility. |
|
Readable.prototype.setEncoding = function(enc) { |
|
if (!StringDecoder) |
|
StringDecoder = require('string_decoder/').StringDecoder; |
|
this._readableState.decoder = new StringDecoder(enc); |
|
this._readableState.encoding = enc; |
|
}; |
|
|
|
// Don't raise the hwm > 128MB |
|
var MAX_HWM = 0x800000; |
|
function roundUpToNextPowerOf2(n) { |
|
if (n >= MAX_HWM) { |
|
n = MAX_HWM; |
|
} else { |
|
// Get the next highest power of 2 |
|
n--; |
|
for (var p = 1; p < 32; p <<= 1) n |= n >> p; |
|
n++; |
|
} |
|
return n; |
|
} |
|
|
|
function howMuchToRead(n, state) { |
|
if (state.length === 0 && state.ended) |
|
return 0; |
|
|
|
if (state.objectMode) |
|
return n === 0 ? 0 : 1; |
|
|
|
if (n === null || isNaN(n)) { |
|
// only flow one buffer at a time |
|
if (state.flowing && state.buffer.length) |
|
return state.buffer[0].length; |
|
else |
|
return state.length; |
|
} |
|
|
|
if (n <= 0) |
|
return 0; |
|
|
|
// If we're asking for more than the target buffer level, |
|
// then raise the water mark. Bump up to the next highest |
|
// power of 2, to prevent increasing it excessively in tiny |
|
// amounts. |
|
if (n > state.highWaterMark) |
|
state.highWaterMark = roundUpToNextPowerOf2(n); |
|
|
|
// don't have that much. return null, unless we've ended. |
|
if (n > state.length) { |
|
if (!state.ended) { |
|
state.needReadable = true; |
|
return 0; |
|
} else |
|
return state.length; |
|
} |
|
|
|
return n; |
|
} |
|
|
|
// you can override either this method, or the async _read(n) below. |
|
Readable.prototype.read = function(n) { |
|
var state = this._readableState; |
|
state.calledRead = true; |
|
var nOrig = n; |
|
var ret; |
|
|
|
if (typeof n !== 'number' || n > 0) |
|
state.emittedReadable = false; |
|
|
|
// if we're doing read(0) to trigger a readable event, but we |
|
// already have a bunch of data in the buffer, then just trigger |
|
// the 'readable' event and move on. |
|
if (n === 0 && |
|
state.needReadable && |
|
(state.length >= state.highWaterMark || state.ended)) { |
|
emitReadable(this); |
|
return null; |
|
} |
|
|
|
n = howMuchToRead(n, state); |
|
|
|
// if we've ended, and we're now clear, then finish it up. |
|
if (n === 0 && state.ended) { |
|
ret = null; |
|
|
|
// In cases where the decoder did not receive enough data |
|
// to produce a full chunk, then immediately received an |
|
// EOF, state.buffer will contain [<Buffer >, <Buffer 00 ...>]. |
|
// howMuchToRead will see this and coerce the amount to |
|
// read to zero (because it's looking at the length of the |
|
// first <Buffer > in state.buffer), and we'll end up here. |
|
// |
|
// This can only happen via state.decoder -- no other venue |
|
// exists for pushing a zero-length chunk into state.buffer |
|
// and triggering this behavior. In this case, we return our |
|
// remaining data and end the stream, if appropriate. |
|
if (state.length > 0 && state.decoder) { |
|
ret = fromList(n, state); |
|
state.length -= ret.length; |
|
} |
|
|
|
if (state.length === 0) |
|
endReadable(this); |
|
|
|
return ret; |
|
} |
|
|
|
// All the actual chunk generation logic needs to be |
|
// *below* the call to _read. The reason is that in certain |
|
// synthetic stream cases, such as passthrough streams, _read |
|
// may be a completely synchronous operation which may change |
|
// the state of the read buffer, providing enough data when |
|
// before there was *not* enough. |
|
// |
|
// So, the steps are: |
|
// 1. Figure out what the state of things will be after we do |
|
// a read from the buffer. |
|
// |
|
// 2. If that resulting state will trigger a _read, then call _read. |
|
// Note that this may be asynchronous, or synchronous. Yes, it is |
|
// deeply ugly to write APIs this way, but that still doesn't mean |
|
// that the Readable class should behave improperly, as streams are |
|
// designed to be sync/async agnostic. |
|
// Take note if the _read call is sync or async (ie, if the read call |
|
// has returned yet), so that we know whether or not it's safe to emit |
|
// 'readable' etc. |
|
// |
|
// 3. Actually pull the requested chunks out of the buffer and return. |
|
|
|
// if we need a readable event, then we need to do some reading. |
|
var doRead = state.needReadable; |
|
|
|
// if we currently have less than the highWaterMark, then also read some |
|
if (state.length - n <= state.highWaterMark) |
|
doRead = true; |
|
|
|
// however, if we've ended, then there's no point, and if we're already |
|
// reading, then it's unnecessary. |
|
if (state.ended || state.reading) |
|
doRead = false; |
|
|
|
if (doRead) { |
|
state.reading = true; |
|
state.sync = true; |
|
// if the length is currently zero, then we *need* a readable event. |
|
if (state.length === 0) |
|
state.needReadable = true; |
|
// call internal read method |
|
this._read(state.highWaterMark); |
|
state.sync = false; |
|
} |
|
|
|
// If _read called its callback synchronously, then `reading` |
|
// will be false, and we need to re-evaluate how much data we |
|
// can return to the user. |
|
if (doRead && !state.reading) |
|
n = howMuchToRead(nOrig, state); |
|
|
|
if (n > 0) |
|
ret = fromList(n, state); |
|
else |
|
ret = null; |
|
|
|
if (ret === null) { |
|
state.needReadable = true; |
|
n = 0; |
|
} |
|
|
|
state.length -= n; |
|
|
|
// If we have nothing in the buffer, then we want to know |
|
// as soon as we *do* get something into the buffer. |
|
if (state.length === 0 && !state.ended) |
|
state.needReadable = true; |
|
|
|
// If we happened to read() exactly the remaining amount in the |
|
// buffer, and the EOF has been seen at this point, then make sure |
|
// that we emit 'end' on the very next tick. |
|
if (state.ended && !state.endEmitted && state.length === 0) |
|
endReadable(this); |
|
|
|
return ret; |
|
}; |
|
|
|
function chunkInvalid(state, chunk) { |
|
var er = null; |
|
if (!Buffer.isBuffer(chunk) && |
|
'string' !== typeof chunk && |
|
chunk !== null && |
|
chunk !== undefined && |
|
!state.objectMode) { |
|
er = new TypeError('Invalid non-string/buffer chunk'); |
|
} |
|
return er; |
|
} |
|
|
|
|
|
function onEofChunk(stream, state) { |
|
if (state.decoder && !state.ended) { |
|
var chunk = state.decoder.end(); |
|
if (chunk && chunk.length) { |
|
state.buffer.push(chunk); |
|
state.length += state.objectMode ? 1 : chunk.length; |
|
} |
|
} |
|
state.ended = true; |
|
|
|
// if we've ended and we have some data left, then emit |
|
// 'readable' now to make sure it gets picked up. |
|
if (state.length > 0) |
|
emitReadable(stream); |
|
else |
|
endReadable(stream); |
|
} |
|
|
|
// Don't emit readable right away in sync mode, because this can trigger |
|
// another read() call => stack overflow. This way, it might trigger |
|
// a nextTick recursion warning, but that's not so bad. |
|
function emitReadable(stream) { |
|
var state = stream._readableState; |
|
state.needReadable = false; |
|
if (state.emittedReadable) |
|
return; |
|
|
|
state.emittedReadable = true; |
|
if (state.sync) |
|
process.nextTick(function() { |
|
emitReadable_(stream); |
|
}); |
|
else |
|
emitReadable_(stream); |
|
} |
|
|
|
function emitReadable_(stream) { |
|
stream.emit('readable'); |
|
} |
|
|
|
|
|
// at this point, the user has presumably seen the 'readable' event, |
|
// and called read() to consume some data. that may have triggered |
|
// in turn another _read(n) call, in which case reading = true if |
|
// it's in progress. |
|
// However, if we're not ended, or reading, and the length < hwm, |
|
// then go ahead and try to read some more preemptively. |
|
function maybeReadMore(stream, state) { |
|
if (!state.readingMore) { |
|
state.readingMore = true; |
|
process.nextTick(function() { |
|
maybeReadMore_(stream, state); |
|
}); |
|
} |
|
} |
|
|
|
function maybeReadMore_(stream, state) { |
|
var len = state.length; |
|
while (!state.reading && !state.flowing && !state.ended && |
|
state.length < state.highWaterMark) { |
|
stream.read(0); |
|
if (len === state.length) |
|
// didn't get any data, stop spinning. |
|
break; |
|
else |
|
len = state.length; |
|
} |
|
state.readingMore = false; |
|
} |
|
|
|
// abstract method. to be overridden in specific implementation classes. |
|
// call cb(er, data) where data is <= n in length. |
|
// for virtual (non-string, non-buffer) streams, "length" is somewhat |
|
// arbitrary, and perhaps not very meaningful. |
|
Readable.prototype._read = function(n) { |
|
this.emit('error', new Error('not implemented')); |
|
}; |
|
|
|
Readable.prototype.pipe = function(dest, pipeOpts) { |
|
var src = this; |
|
var state = this._readableState; |
|
|
|
switch (state.pipesCount) { |
|
case 0: |
|
state.pipes = dest; |
|
break; |
|
case 1: |
|
state.pipes = [state.pipes, dest]; |
|
break; |
|
default: |
|
state.pipes.push(dest); |
|
break; |
|
} |
|
state.pipesCount += 1; |
|
|
|
var doEnd = (!pipeOpts || pipeOpts.end !== false) && |
|
dest !== process.stdout && |
|
dest !== process.stderr; |
|
|
|
var endFn = doEnd ? onend : cleanup; |
|
if (state.endEmitted) |
|
process.nextTick(endFn); |
|
else |
|
src.once('end', endFn); |
|
|
|
dest.on('unpipe', onunpipe); |
|
function onunpipe(readable) { |
|
if (readable !== src) return; |
|
cleanup(); |
|
} |
|
|
|
function onend() { |
|
dest.end(); |
|
} |
|
|
|
// when the dest drains, it reduces the awaitDrain counter |
|
// on the source. This would be more elegant with a .once() |
|
// handler in flow(), but adding and removing repeatedly is |
|
// too slow. |
|
var ondrain = pipeOnDrain(src); |
|
dest.on('drain', ondrain); |
|
|
|
function cleanup() { |
|
// cleanup event handlers once the pipe is broken |
|
dest.removeListener('close', onclose); |
|
dest.removeListener('finish', onfinish); |
|
dest.removeListener('drain', ondrain); |
|
dest.removeListener('error', onerror); |
|
dest.removeListener('unpipe', onunpipe); |
|
src.removeListener('end', onend); |
|
src.removeListener('end', cleanup); |
|
|
|
// if the reader is waiting for a drain event from this |
|
// specific writer, then it would cause it to never start |
|
// flowing again. |
|
// So, if this is awaiting a drain, then we just call it now. |
|
// If we don't know, then assume that we are waiting for one. |
|
if (!dest._writableState || dest._writableState.needDrain) |
|
ondrain(); |
|
} |
|
|
|
// if the dest has an error, then stop piping into it. |
|
// however, don't suppress the throwing behavior for this. |
|
function onerror(er) { |
|
unpipe(); |
|
dest.removeListener('error', onerror); |
|
if (EE.listenerCount(dest, 'error') === 0) |
|
dest.emit('error', er); |
|
} |
|
// This is a brutally ugly hack to make sure that our error handler |
|
// is attached before any userland ones. NEVER DO THIS. |
|
if (!dest._events || !dest._events.error) |
|
dest.on('error', onerror); |
|
else if (isArray(dest._events.error)) |
|
dest._events.error.unshift(onerror); |
|
else |
|
dest._events.error = [onerror, dest._events.error]; |
|
|
|
|
|
|
|
// Both close and finish should trigger unpipe, but only once. |
|
function onclose() { |
|
dest.removeListener('finish', onfinish); |
|
unpipe(); |
|
} |
|
dest.once('close', onclose); |
|
function onfinish() { |
|
dest.removeListener('close', onclose); |
|
unpipe(); |
|
} |
|
dest.once('finish', onfinish); |
|
|
|
function unpipe() { |
|
src.unpipe(dest); |
|
} |
|
|
|
// tell the dest that it's being piped to |
|
dest.emit('pipe', src); |
|
|
|
// start the flow if it hasn't been started already. |
|
if (!state.flowing) { |
|
// the handler that waits for readable events after all |
|
// the data gets sucked out in flow. |
|
// This would be easier to follow with a .once() handler |
|
// in flow(), but that is too slow. |
|
this.on('readable', pipeOnReadable); |
|
|
|
state.flowing = true; |
|
process.nextTick(function() { |
|
flow(src); |
|
}); |
|
} |
|
|
|
return dest; |
|
}; |
|
|
|
function pipeOnDrain(src) { |
|
return function() { |
|
var dest = this; |
|
var state = src._readableState; |
|
state.awaitDrain--; |
|
if (state.awaitDrain === 0) |
|
flow(src); |
|
}; |
|
} |
|
|
|
function flow(src) { |
|
var state = src._readableState; |
|
var chunk; |
|
state.awaitDrain = 0; |
|
|
|
function write(dest, i, list) { |
|
var written = dest.write(chunk); |
|
if (false === written) { |
|
state.awaitDrain++; |
|
} |
|
} |
|
|
|
while (state.pipesCount && null !== (chunk = src.read())) { |
|
|
|
if (state.pipesCount === 1) |
|
write(state.pipes, 0, null); |
|
else |
|
forEach(state.pipes, write); |
|
|
|
src.emit('data', chunk); |
|
|
|
// if anyone needs a drain, then we have to wait for that. |
|
if (state.awaitDrain > 0) |
|
return; |
|
} |
|
|
|
// if every destination was unpiped, either before entering this |
|
// function, or in the while loop, then stop flowing. |
|
// |
|
// NB: This is a pretty rare edge case. |
|
if (state.pipesCount === 0) { |
|
state.flowing = false; |
|
|
|
// if there were data event listeners added, then switch to old mode. |
|
if (EE.listenerCount(src, 'data') > 0) |
|
emitDataEvents(src); |
|
return; |
|
} |
|
|
|
// at this point, no one needed a drain, so we just ran out of data |
|
// on the next readable event, start it over again. |
|
state.ranOut = true; |
|
} |
|
|
|
function pipeOnReadable() { |
|
if (this._readableState.ranOut) { |
|
this._readableState.ranOut = false; |
|
flow(this); |
|
} |
|
} |
|
|
|
|
|
Readable.prototype.unpipe = function(dest) { |
|
var state = this._readableState; |
|
|
|
// if we're not piping anywhere, then do nothing. |
|
if (state.pipesCount === 0) |
|
return this; |
|
|
|
// just one destination. most common case. |
|
if (state.pipesCount === 1) { |
|
// passed in one, but it's not the right one. |
|
if (dest && dest !== state.pipes) |
|
return this; |
|
|
|
if (!dest) |
|
dest = state.pipes; |
|
|
|
// got a match. |
|
state.pipes = null; |
|
state.pipesCount = 0; |
|
this.removeListener('readable', pipeOnReadable); |
|
state.flowing = false; |
|
if (dest) |
|
dest.emit('unpipe', this); |
|
return this; |
|
} |
|
|
|
// slow case. multiple pipe destinations. |
|
|
|
if (!dest) { |
|
// remove all. |
|
var dests = state.pipes; |
|
var len = state.pipesCount; |
|
state.pipes = null; |
|
state.pipesCount = 0; |
|
this.removeListener('readable', pipeOnReadable); |
|
state.flowing = false; |
|
|
|
for (var i = 0; i < len; i++) |
|
dests[i].emit('unpipe', this); |
|
return this; |
|
} |
|
|
|
// try to find the right one. |
|
var i = indexOf(state.pipes, dest); |
|
if (i === -1) |
|
return this; |
|
|
|
state.pipes.splice(i, 1); |
|
state.pipesCount -= 1; |
|
if (state.pipesCount === 1) |
|
state.pipes = state.pipes[0]; |
|
|
|
dest.emit('unpipe', this); |
|
|
|
return this; |
|
}; |
|
|
|
// set up data events if they are asked for |
|
// Ensure readable listeners eventually get something |
|
Readable.prototype.on = function(ev, fn) { |
|
var res = Stream.prototype.on.call(this, ev, fn); |
|
|
|
if (ev === 'data' && !this._readableState.flowing) |
|
emitDataEvents(this); |
|
|
|
if (ev === 'readable' && this.readable) { |
|
var state = this._readableState; |
|
if (!state.readableListening) { |
|
state.readableListening = true; |
|
state.emittedReadable = false; |
|
state.needReadable = true; |
|
if (!state.reading) { |
|
this.read(0); |
|
} else if (state.length) { |
|
emitReadable(this, state); |
|
} |
|
} |
|
} |
|
|
|
return res; |
|
}; |
|
Readable.prototype.addListener = Readable.prototype.on; |
|
|
|
// pause() and resume() are remnants of the legacy readable stream API |
|
// If the user uses them, then switch into old mode. |
|
Readable.prototype.resume = function() { |
|
emitDataEvents(this); |
|
this.read(0); |
|
this.emit('resume'); |
|
}; |
|
|
|
Readable.prototype.pause = function() { |
|
emitDataEvents(this, true); |
|
this.emit('pause'); |
|
}; |
|
|
|
function emitDataEvents(stream, startPaused) { |
|
var state = stream._readableState; |
|
|
|
if (state.flowing) { |
|
// https://github.com/isaacs/readable-stream/issues/16 |
|
throw new Error('Cannot switch to old mode now.'); |
|
} |
|
|
|
var paused = startPaused || false; |
|
var readable = false; |
|
|
|
// convert to an old-style stream. |
|
stream.readable = true; |
|
stream.pipe = Stream.prototype.pipe; |
|
stream.on = stream.addListener = Stream.prototype.on; |
|
|
|
stream.on('readable', function() { |
|
readable = true; |
|
|
|
var c; |
|
while (!paused && (null !== (c = stream.read()))) |
|
stream.emit('data', c); |
|
|
|
if (c === null) { |
|
readable = false; |
|
stream._readableState.needReadable = true; |
|
} |
|
}); |
|
|
|
stream.pause = function() { |
|
paused = true; |
|
this.emit('pause'); |
|
}; |
|
|
|
stream.resume = function() { |
|
paused = false; |
|
if (readable) |
|
process.nextTick(function() { |
|
stream.emit('readable'); |
|
}); |
|
else |
|
this.read(0); |
|
this.emit('resume'); |
|
}; |
|
|
|
// now make it start, just in case it hadn't already. |
|
stream.emit('readable'); |
|
} |
|
|
|
// wrap an old-style stream as the async data source. |
|
// This is *not* part of the readable stream interface. |
|
// It is an ugly unfortunate mess of history. |
|
Readable.prototype.wrap = function(stream) { |
|
var state = this._readableState; |
|
var paused = false; |
|
|
|
var self = this; |
|
stream.on('end', function() { |
|
if (state.decoder && !state.ended) { |
|
var chunk = state.decoder.end(); |
|
if (chunk && chunk.length) |
|
self.push(chunk); |
|
} |
|
|
|
self.push(null); |
|
}); |
|
|
|
stream.on('data', function(chunk) { |
|
if (state.decoder) |
|
chunk = state.decoder.write(chunk); |
|
|
|
// don't skip over falsy values in objectMode |
|
//if (state.objectMode && util.isNullOrUndefined(chunk)) |
|
if (state.objectMode && (chunk === null || chunk === undefined)) |
|
return; |
|
else if (!state.objectMode && (!chunk || !chunk.length)) |
|
return; |
|
|
|
var ret = self.push(chunk); |
|
if (!ret) { |
|
paused = true; |
|
stream.pause(); |
|
} |
|
}); |
|
|
|
// proxy all the other methods. |
|
// important when wrapping filters and duplexes. |
|
for (var i in stream) { |
|
if (typeof stream[i] === 'function' && |
|
typeof this[i] === 'undefined') { |
|
this[i] = function(method) { return function() { |
|
return stream[method].apply(stream, arguments); |
|
}}(i); |
|
} |
|
} |
|
|
|
// proxy certain important events. |
|
var events = ['error', 'close', 'destroy', 'pause', 'resume']; |
|
forEach(events, function(ev) { |
|
stream.on(ev, self.emit.bind(self, ev)); |
|
}); |
|
|
|
// when we try to consume some more bytes, simply unpause the |
|
// underlying stream. |
|
self._read = function(n) { |
|
if (paused) { |
|
paused = false; |
|
stream.resume(); |
|
} |
|
}; |
|
|
|
return self; |
|
}; |
|
|
|
|
|
|
|
// exposed for testing purposes only. |
|
Readable._fromList = fromList; |
|
|
|
// Pluck off n bytes from an array of buffers. |
|
// Length is the combined lengths of all the buffers in the list. |
|
function fromList(n, state) { |
|
var list = state.buffer; |
|
var length = state.length; |
|
var stringMode = !!state.decoder; |
|
var objectMode = !!state.objectMode; |
|
var ret; |
|
|
|
// nothing in the list, definitely empty. |
|
if (list.length === 0) |
|
return null; |
|
|
|
if (length === 0) |
|
ret = null; |
|
else if (objectMode) |
|
ret = list.shift(); |
|
else if (!n || n >= length) { |
|
// read it all, truncate the array. |
|
if (stringMode) |
|
ret = list.join(''); |
|
else |
|
ret = Buffer.concat(list, length); |
|
list.length = 0; |
|
} else { |
|
// read just some of it. |
|
if (n < list[0].length) { |
|
// just take a part of the first list item. |
|
// slice is the same for buffers and strings. |
|
var buf = list[0]; |
|
ret = buf.slice(0, n); |
|
list[0] = buf.slice(n); |
|
} else if (n === list[0].length) { |
|
// first list is a perfect match |
|
ret = list.shift(); |
|
} else { |
|
// complex case. |
|
// we have enough to cover it, but it spans past the first buffer. |
|
if (stringMode) |
|
ret = ''; |
|
else |
|
ret = new Buffer(n); |
|
|
|
var c = 0; |
|
for (var i = 0, l = list.length; i < l && c < n; i++) { |
|
var buf = list[0]; |
|
var cpy = Math.min(n - c, buf.length); |
|
|
|
if (stringMode) |
|
ret += buf.slice(0, cpy); |
|
else |
|
buf.copy(ret, c, 0, cpy); |
|
|
|
if (cpy < buf.length) |
|
list[0] = buf.slice(cpy); |
|
else |
|
list.shift(); |
|
|
|
c += cpy; |
|
} |
|
} |
|
} |
|
|
|
return ret; |
|
} |
|
|
|
function endReadable(stream) { |
|
var state = stream._readableState; |
|
|
|
// If we get here before consuming all the bytes, then that is a |
|
// bug in node. Should never happen. |
|
if (state.length > 0) |
|
throw new Error('endReadable called on non-empty stream'); |
|
|
|
if (!state.endEmitted && state.calledRead) { |
|
state.ended = true; |
|
process.nextTick(function() { |
|
// Check that we didn't get one last unshift. |
|
if (!state.endEmitted && state.length === 0) { |
|
state.endEmitted = true; |
|
stream.readable = false; |
|
stream.emit('end'); |
|
} |
|
}); |
|
} |
|
} |
|
|
|
function forEach (xs, f) { |
|
for (var i = 0, l = xs.length; i < l; i++) { |
|
f(xs[i], i); |
|
} |
|
} |
|
|
|
function indexOf (xs, x) { |
|
for (var i = 0, l = xs.length; i < l; i++) { |
|
if (xs[i] === x) return i; |
|
} |
|
return -1; |
|
} |
|
|
|
}).call(this,require('_process')) |
|
},{"_process":323,"buffer":172,"core-util-is":69,"events":314,"inherits":70,"isarray":71,"stream":339,"string_decoder/":72}],68:[function(require,module,exports){ |
|
(function (process){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// A bit simpler than readable streams. |
|
// Implement an async ._write(chunk, cb), and it'll handle all |
|
// the drain event emission and buffering. |
|
|
|
module.exports = Writable; |
|
|
|
/*<replacement>*/ |
|
var Buffer = require('buffer').Buffer; |
|
/*</replacement>*/ |
|
|
|
Writable.WritableState = WritableState; |
|
|
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
var Stream = require('stream'); |
|
|
|
util.inherits(Writable, Stream); |
|
|
|
function WriteReq(chunk, encoding, cb) { |
|
this.chunk = chunk; |
|
this.encoding = encoding; |
|
this.callback = cb; |
|
} |
|
|
|
function WritableState(options, stream) { |
|
options = options || {}; |
|
|
|
// the point at which write() starts returning false |
|
// Note: 0 is a valid value, means that we always return false if |
|
// the entire buffer is not flushed immediately on write() |
|
var hwm = options.highWaterMark; |
|
this.highWaterMark = (hwm || hwm === 0) ? hwm : 16 * 1024; |
|
|
|
// object stream flag to indicate whether or not this stream |
|
// contains buffers or objects. |
|
this.objectMode = !!options.objectMode; |
|
|
|
// cast to ints. |
|
this.highWaterMark = ~~this.highWaterMark; |
|
|
|
this.needDrain = false; |
|
// at the start of calling end() |
|
this.ending = false; |
|
// when end() has been called, and returned |
|
this.ended = false; |
|
// when 'finish' is emitted |
|
this.finished = false; |
|
|
|
// should we decode strings into buffers before passing to _write? |
|
// this is here so that some node-core streams can optimize string |
|
// handling at a lower level. |
|
var noDecode = options.decodeStrings === false; |
|
this.decodeStrings = !noDecode; |
|
|
|
// Crypto is kind of old and crusty. Historically, its default string |
|
// encoding is 'binary' so we have to make this configurable. |
|
// Everything else in the universe uses 'utf8', though. |
|
this.defaultEncoding = options.defaultEncoding || 'utf8'; |
|
|
|
// not an actual buffer we keep track of, but a measurement |
|
// of how much we're waiting to get pushed to some underlying |
|
// socket or file. |
|
this.length = 0; |
|
|
|
// a flag to see when we're in the middle of a write. |
|
this.writing = false; |
|
|
|
// a flag to be able to tell if the onwrite cb is called immediately, |
|
// or on a later tick. We set this to true at first, becuase any |
|
// actions that shouldn't happen until "later" should generally also |
|
// not happen before the first write call. |
|
this.sync = true; |
|
|
|
// a flag to know if we're processing previously buffered items, which |
|
// may call the _write() callback in the same tick, so that we don't |
|
// end up in an overlapped onwrite situation. |
|
this.bufferProcessing = false; |
|
|
|
// the callback that's passed to _write(chunk,cb) |
|
this.onwrite = function(er) { |
|
onwrite(stream, er); |
|
}; |
|
|
|
// the callback that the user supplies to write(chunk,encoding,cb) |
|
this.writecb = null; |
|
|
|
// the amount that is being written when _write is called. |
|
this.writelen = 0; |
|
|
|
this.buffer = []; |
|
|
|
// True if the error was already emitted and should not be thrown again |
|
this.errorEmitted = false; |
|
} |
|
|
|
function Writable(options) { |
|
var Duplex = require('./_stream_duplex'); |
|
|
|
// Writable ctor is applied to Duplexes, though they're not |
|
// instanceof Writable, they're instanceof Readable. |
|
if (!(this instanceof Writable) && !(this instanceof Duplex)) |
|
return new Writable(options); |
|
|
|
this._writableState = new WritableState(options, this); |
|
|
|
// legacy. |
|
this.writable = true; |
|
|
|
Stream.call(this); |
|
} |
|
|
|
// Otherwise people can pipe Writable streams, which is just wrong. |
|
Writable.prototype.pipe = function() { |
|
this.emit('error', new Error('Cannot pipe. Not readable.')); |
|
}; |
|
|
|
|
|
function writeAfterEnd(stream, state, cb) { |
|
var er = new Error('write after end'); |
|
// TODO: defer error events consistently everywhere, not just the cb |
|
stream.emit('error', er); |
|
process.nextTick(function() { |
|
cb(er); |
|
}); |
|
} |
|
|
|
// If we get something that is not a buffer, string, null, or undefined, |
|
// and we're not in objectMode, then that's an error. |
|
// Otherwise stream chunks are all considered to be of length=1, and the |
|
// watermarks determine how many objects to keep in the buffer, rather than |
|
// how many bytes or characters. |
|
function validChunk(stream, state, chunk, cb) { |
|
var valid = true; |
|
if (!Buffer.isBuffer(chunk) && |
|
'string' !== typeof chunk && |
|
chunk !== null && |
|
chunk !== undefined && |
|
!state.objectMode) { |
|
var er = new TypeError('Invalid non-string/buffer chunk'); |
|
stream.emit('error', er); |
|
process.nextTick(function() { |
|
cb(er); |
|
}); |
|
valid = false; |
|
} |
|
return valid; |
|
} |
|
|
|
Writable.prototype.write = function(chunk, encoding, cb) { |
|
var state = this._writableState; |
|
var ret = false; |
|
|
|
if (typeof encoding === 'function') { |
|
cb = encoding; |
|
encoding = null; |
|
} |
|
|
|
if (Buffer.isBuffer(chunk)) |
|
encoding = 'buffer'; |
|
else if (!encoding) |
|
encoding = state.defaultEncoding; |
|
|
|
if (typeof cb !== 'function') |
|
cb = function() {}; |
|
|
|
if (state.ended) |
|
writeAfterEnd(this, state, cb); |
|
else if (validChunk(this, state, chunk, cb)) |
|
ret = writeOrBuffer(this, state, chunk, encoding, cb); |
|
|
|
return ret; |
|
}; |
|
|
|
function decodeChunk(state, chunk, encoding) { |
|
if (!state.objectMode && |
|
state.decodeStrings !== false && |
|
typeof chunk === 'string') { |
|
chunk = new Buffer(chunk, encoding); |
|
} |
|
return chunk; |
|
} |
|
|
|
// if we're already writing something, then just put this |
|
// in the queue, and wait our turn. Otherwise, call _write |
|
// If we return false, then we need a drain event, so set that flag. |
|
function writeOrBuffer(stream, state, chunk, encoding, cb) { |
|
chunk = decodeChunk(state, chunk, encoding); |
|
if (Buffer.isBuffer(chunk)) |
|
encoding = 'buffer'; |
|
var len = state.objectMode ? 1 : chunk.length; |
|
|
|
state.length += len; |
|
|
|
var ret = state.length < state.highWaterMark; |
|
// we must ensure that previous needDrain will not be reset to false. |
|
if (!ret) |
|
state.needDrain = true; |
|
|
|
if (state.writing) |
|
state.buffer.push(new WriteReq(chunk, encoding, cb)); |
|
else |
|
doWrite(stream, state, len, chunk, encoding, cb); |
|
|
|
return ret; |
|
} |
|
|
|
function doWrite(stream, state, len, chunk, encoding, cb) { |
|
state.writelen = len; |
|
state.writecb = cb; |
|
state.writing = true; |
|
state.sync = true; |
|
stream._write(chunk, encoding, state.onwrite); |
|
state.sync = false; |
|
} |
|
|
|
function onwriteError(stream, state, sync, er, cb) { |
|
if (sync) |
|
process.nextTick(function() { |
|
cb(er); |
|
}); |
|
else |
|
cb(er); |
|
|
|
stream._writableState.errorEmitted = true; |
|
stream.emit('error', er); |
|
} |
|
|
|
function onwriteStateUpdate(state) { |
|
state.writing = false; |
|
state.writecb = null; |
|
state.length -= state.writelen; |
|
state.writelen = 0; |
|
} |
|
|
|
function onwrite(stream, er) { |
|
var state = stream._writableState; |
|
var sync = state.sync; |
|
var cb = state.writecb; |
|
|
|
onwriteStateUpdate(state); |
|
|
|
if (er) |
|
onwriteError(stream, state, sync, er, cb); |
|
else { |
|
// Check if we're actually ready to finish, but don't emit yet |
|
var finished = needFinish(stream, state); |
|
|
|
if (!finished && !state.bufferProcessing && state.buffer.length) |
|
clearBuffer(stream, state); |
|
|
|
if (sync) { |
|
process.nextTick(function() { |
|
afterWrite(stream, state, finished, cb); |
|
}); |
|
} else { |
|
afterWrite(stream, state, finished, cb); |
|
} |
|
} |
|
} |
|
|
|
function afterWrite(stream, state, finished, cb) { |
|
if (!finished) |
|
onwriteDrain(stream, state); |
|
cb(); |
|
if (finished) |
|
finishMaybe(stream, state); |
|
} |
|
|
|
// Must force callback to be called on nextTick, so that we don't |
|
// emit 'drain' before the write() consumer gets the 'false' return |
|
// value, and has a chance to attach a 'drain' listener. |
|
function onwriteDrain(stream, state) { |
|
if (state.length === 0 && state.needDrain) { |
|
state.needDrain = false; |
|
stream.emit('drain'); |
|
} |
|
} |
|
|
|
|
|
// if there's something in the buffer waiting, then process it |
|
function clearBuffer(stream, state) { |
|
state.bufferProcessing = true; |
|
|
|
for (var c = 0; c < state.buffer.length; c++) { |
|
var entry = state.buffer[c]; |
|
var chunk = entry.chunk; |
|
var encoding = entry.encoding; |
|
var cb = entry.callback; |
|
var len = state.objectMode ? 1 : chunk.length; |
|
|
|
doWrite(stream, state, len, chunk, encoding, cb); |
|
|
|
// if we didn't call the onwrite immediately, then |
|
// it means that we need to wait until it does. |
|
// also, that means that the chunk and cb are currently |
|
// being processed, so move the buffer counter past them. |
|
if (state.writing) { |
|
c++; |
|
break; |
|
} |
|
} |
|
|
|
state.bufferProcessing = false; |
|
if (c < state.buffer.length) |
|
state.buffer = state.buffer.slice(c); |
|
else |
|
state.buffer.length = 0; |
|
} |
|
|
|
Writable.prototype._write = function(chunk, encoding, cb) { |
|
cb(new Error('not implemented')); |
|
}; |
|
|
|
Writable.prototype.end = function(chunk, encoding, cb) { |
|
var state = this._writableState; |
|
|
|
if (typeof chunk === 'function') { |
|
cb = chunk; |
|
chunk = null; |
|
encoding = null; |
|
} else if (typeof encoding === 'function') { |
|
cb = encoding; |
|
encoding = null; |
|
} |
|
|
|
if (typeof chunk !== 'undefined' && chunk !== null) |
|
this.write(chunk, encoding); |
|
|
|
// ignore unnecessary end() calls. |
|
if (!state.ending && !state.finished) |
|
endWritable(this, state, cb); |
|
}; |
|
|
|
|
|
function needFinish(stream, state) { |
|
return (state.ending && |
|
state.length === 0 && |
|
!state.finished && |
|
!state.writing); |
|
} |
|
|
|
function finishMaybe(stream, state) { |
|
var need = needFinish(stream, state); |
|
if (need) { |
|
state.finished = true; |
|
stream.emit('finish'); |
|
} |
|
return need; |
|
} |
|
|
|
function endWritable(stream, state, cb) { |
|
state.ending = true; |
|
finishMaybe(stream, state); |
|
if (cb) { |
|
if (state.finished) |
|
process.nextTick(cb); |
|
else |
|
stream.once('finish', cb); |
|
} |
|
state.ended = true; |
|
} |
|
|
|
}).call(this,require('_process')) |
|
},{"./_stream_duplex":66,"_process":323,"buffer":172,"core-util-is":69,"inherits":70,"stream":339}],69:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// NOTE: These type checking functions intentionally don't use `instanceof` |
|
// because it is fragile and can be easily faked with `Object.create()`. |
|
function isArray(ar) { |
|
return Array.isArray(ar); |
|
} |
|
exports.isArray = isArray; |
|
|
|
function isBoolean(arg) { |
|
return typeof arg === 'boolean'; |
|
} |
|
exports.isBoolean = isBoolean; |
|
|
|
function isNull(arg) { |
|
return arg === null; |
|
} |
|
exports.isNull = isNull; |
|
|
|
function isNullOrUndefined(arg) { |
|
return arg == null; |
|
} |
|
exports.isNullOrUndefined = isNullOrUndefined; |
|
|
|
function isNumber(arg) { |
|
return typeof arg === 'number'; |
|
} |
|
exports.isNumber = isNumber; |
|
|
|
function isString(arg) { |
|
return typeof arg === 'string'; |
|
} |
|
exports.isString = isString; |
|
|
|
function isSymbol(arg) { |
|
return typeof arg === 'symbol'; |
|
} |
|
exports.isSymbol = isSymbol; |
|
|
|
function isUndefined(arg) { |
|
return arg === void 0; |
|
} |
|
exports.isUndefined = isUndefined; |
|
|
|
function isRegExp(re) { |
|
return isObject(re) && objectToString(re) === '[object RegExp]'; |
|
} |
|
exports.isRegExp = isRegExp; |
|
|
|
function isObject(arg) { |
|
return typeof arg === 'object' && arg !== null; |
|
} |
|
exports.isObject = isObject; |
|
|
|
function isDate(d) { |
|
return isObject(d) && objectToString(d) === '[object Date]'; |
|
} |
|
exports.isDate = isDate; |
|
|
|
function isError(e) { |
|
return isObject(e) && |
|
(objectToString(e) === '[object Error]' || e instanceof Error); |
|
} |
|
exports.isError = isError; |
|
|
|
function isFunction(arg) { |
|
return typeof arg === 'function'; |
|
} |
|
exports.isFunction = isFunction; |
|
|
|
function isPrimitive(arg) { |
|
return arg === null || |
|
typeof arg === 'boolean' || |
|
typeof arg === 'number' || |
|
typeof arg === 'string' || |
|
typeof arg === 'symbol' || // ES6 symbol |
|
typeof arg === 'undefined'; |
|
} |
|
exports.isPrimitive = isPrimitive; |
|
|
|
function isBuffer(arg) { |
|
return Buffer.isBuffer(arg); |
|
} |
|
exports.isBuffer = isBuffer; |
|
|
|
function objectToString(o) { |
|
return Object.prototype.toString.call(o); |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],70:[function(require,module,exports){ |
|
arguments[4][14][0].apply(exports,arguments) |
|
},{"dup":14}],71:[function(require,module,exports){ |
|
module.exports = Array.isArray || function (arr) { |
|
return Object.prototype.toString.call(arr) == '[object Array]'; |
|
}; |
|
|
|
},{}],72:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
var Buffer = require('buffer').Buffer; |
|
|
|
var isBufferEncoding = Buffer.isEncoding |
|
|| function(encoding) { |
|
switch (encoding && encoding.toLowerCase()) { |
|
case 'hex': case 'utf8': case 'utf-8': case 'ascii': case 'binary': case 'base64': case 'ucs2': case 'ucs-2': case 'utf16le': case 'utf-16le': case 'raw': return true; |
|
default: return false; |
|
} |
|
} |
|
|
|
|
|
function assertEncoding(encoding) { |
|
if (encoding && !isBufferEncoding(encoding)) { |
|
throw new Error('Unknown encoding: ' + encoding); |
|
} |
|
} |
|
|
|
// StringDecoder provides an interface for efficiently splitting a series of |
|
// buffers into a series of JS strings without breaking apart multi-byte |
|
// characters. CESU-8 is handled as part of the UTF-8 encoding. |
|
// |
|
// @TODO Handling all encodings inside a single object makes it very difficult |
|
// to reason about this code, so it should be split up in the future. |
|
// @TODO There should be a utf8-strict encoding that rejects invalid UTF-8 code |
|
// points as used by CESU-8. |
|
var StringDecoder = exports.StringDecoder = function(encoding) { |
|
this.encoding = (encoding || 'utf8').toLowerCase().replace(/[-_]/, ''); |
|
assertEncoding(encoding); |
|
switch (this.encoding) { |
|
case 'utf8': |
|
// CESU-8 represents each of Surrogate Pair by 3-bytes |
|
this.surrogateSize = 3; |
|
break; |
|
case 'ucs2': |
|
case 'utf16le': |
|
// UTF-16 represents each of Surrogate Pair by 2-bytes |
|
this.surrogateSize = 2; |
|
this.detectIncompleteChar = utf16DetectIncompleteChar; |
|
break; |
|
case 'base64': |
|
// Base-64 stores 3 bytes in 4 chars, and pads the remainder. |
|
this.surrogateSize = 3; |
|
this.detectIncompleteChar = base64DetectIncompleteChar; |
|
break; |
|
default: |
|
this.write = passThroughWrite; |
|
return; |
|
} |
|
|
|
// Enough space to store all bytes of a single character. UTF-8 needs 4 |
|
// bytes, but CESU-8 may require up to 6 (3 bytes per surrogate). |
|
this.charBuffer = new Buffer(6); |
|
// Number of bytes received for the current incomplete multi-byte character. |
|
this.charReceived = 0; |
|
// Number of bytes expected for the current incomplete multi-byte character. |
|
this.charLength = 0; |
|
}; |
|
|
|
|
|
// write decodes the given buffer and returns it as JS string that is |
|
// guaranteed to not contain any partial multi-byte characters. Any partial |
|
// character found at the end of the buffer is buffered up, and will be |
|
// returned when calling write again with the remaining bytes. |
|
// |
|
// Note: Converting a Buffer containing an orphan surrogate to a String |
|
// currently works, but converting a String to a Buffer (via `new Buffer`, or |
|
// Buffer#write) will replace incomplete surrogates with the unicode |
|
// replacement character. See https://codereview.chromium.org/121173009/ . |
|
StringDecoder.prototype.write = function(buffer) { |
|
var charStr = ''; |
|
// if our last write ended with an incomplete multibyte character |
|
while (this.charLength) { |
|
// determine how many remaining bytes this buffer has to offer for this char |
|
var available = (buffer.length >= this.charLength - this.charReceived) ? |
|
this.charLength - this.charReceived : |
|
buffer.length; |
|
|
|
// add the new bytes to the char buffer |
|
buffer.copy(this.charBuffer, this.charReceived, 0, available); |
|
this.charReceived += available; |
|
|
|
if (this.charReceived < this.charLength) { |
|
// still not enough chars in this buffer? wait for more ... |
|
return ''; |
|
} |
|
|
|
// remove bytes belonging to the current character from the buffer |
|
buffer = buffer.slice(available, buffer.length); |
|
|
|
// get the character that was split |
|
charStr = this.charBuffer.slice(0, this.charLength).toString(this.encoding); |
|
|
|
// CESU-8: lead surrogate (D800-DBFF) is also the incomplete character |
|
var charCode = charStr.charCodeAt(charStr.length - 1); |
|
if (charCode >= 0xD800 && charCode <= 0xDBFF) { |
|
this.charLength += this.surrogateSize; |
|
charStr = ''; |
|
continue; |
|
} |
|
this.charReceived = this.charLength = 0; |
|
|
|
// if there are no more bytes in this buffer, just emit our char |
|
if (buffer.length === 0) { |
|
return charStr; |
|
} |
|
break; |
|
} |
|
|
|
// determine and set charLength / charReceived |
|
this.detectIncompleteChar(buffer); |
|
|
|
var end = buffer.length; |
|
if (this.charLength) { |
|
// buffer the incomplete character bytes we got |
|
buffer.copy(this.charBuffer, 0, buffer.length - this.charReceived, end); |
|
end -= this.charReceived; |
|
} |
|
|
|
charStr += buffer.toString(this.encoding, 0, end); |
|
|
|
var end = charStr.length - 1; |
|
var charCode = charStr.charCodeAt(end); |
|
// CESU-8: lead surrogate (D800-DBFF) is also the incomplete character |
|
if (charCode >= 0xD800 && charCode <= 0xDBFF) { |
|
var size = this.surrogateSize; |
|
this.charLength += size; |
|
this.charReceived += size; |
|
this.charBuffer.copy(this.charBuffer, size, 0, size); |
|
buffer.copy(this.charBuffer, 0, 0, size); |
|
return charStr.substring(0, end); |
|
} |
|
|
|
// or just emit the charStr |
|
return charStr; |
|
}; |
|
|
|
// detectIncompleteChar determines if there is an incomplete UTF-8 character at |
|
// the end of the given buffer. If so, it sets this.charLength to the byte |
|
// length that character, and sets this.charReceived to the number of bytes |
|
// that are available for this character. |
|
StringDecoder.prototype.detectIncompleteChar = function(buffer) { |
|
// determine how many bytes we have to check at the end of this buffer |
|
var i = (buffer.length >= 3) ? 3 : buffer.length; |
|
|
|
// Figure out if one of the last i bytes of our buffer announces an |
|
// incomplete char. |
|
for (; i > 0; i--) { |
|
var c = buffer[buffer.length - i]; |
|
|
|
// See http://en.wikipedia.org/wiki/UTF-8#Description |
|
|
|
// 110XXXXX |
|
if (i == 1 && c >> 5 == 0x06) { |
|
this.charLength = 2; |
|
break; |
|
} |
|
|
|
// 1110XXXX |
|
if (i <= 2 && c >> 4 == 0x0E) { |
|
this.charLength = 3; |
|
break; |
|
} |
|
|
|
// 11110XXX |
|
if (i <= 3 && c >> 3 == 0x1E) { |
|
this.charLength = 4; |
|
break; |
|
} |
|
} |
|
this.charReceived = i; |
|
}; |
|
|
|
StringDecoder.prototype.end = function(buffer) { |
|
var res = ''; |
|
if (buffer && buffer.length) |
|
res = this.write(buffer); |
|
|
|
if (this.charReceived) { |
|
var cr = this.charReceived; |
|
var buf = this.charBuffer; |
|
var enc = this.encoding; |
|
res += buf.slice(0, cr).toString(enc); |
|
} |
|
|
|
return res; |
|
}; |
|
|
|
function passThroughWrite(buffer) { |
|
return buffer.toString(this.encoding); |
|
} |
|
|
|
function utf16DetectIncompleteChar(buffer) { |
|
this.charReceived = buffer.length % 2; |
|
this.charLength = this.charReceived ? 2 : 0; |
|
} |
|
|
|
function base64DetectIncompleteChar(buffer) { |
|
this.charReceived = buffer.length % 3; |
|
this.charLength = this.charReceived ? 3 : 0; |
|
} |
|
|
|
},{"buffer":172}],73:[function(require,module,exports){ |
|
function Caseless (dict) { |
|
this.dict = dict || {} |
|
} |
|
Caseless.prototype.set = function (name, value, clobber) { |
|
if (typeof name === 'object') { |
|
for (var i in name) { |
|
this.set(i, name[i], value) |
|
} |
|
} else { |
|
if (typeof clobber === 'undefined') clobber = true |
|
var has = this.has(name) |
|
|
|
if (!clobber && has) this.dict[has] = this.dict[has] + ',' + value |
|
else this.dict[has || name] = value |
|
return has |
|
} |
|
} |
|
Caseless.prototype.has = function (name) { |
|
var keys = Object.keys(this.dict) |
|
, name = name.toLowerCase() |
|
; |
|
for (var i=0;i<keys.length;i++) { |
|
if (keys[i].toLowerCase() === name) return keys[i] |
|
} |
|
return false |
|
} |
|
Caseless.prototype.get = function (name) { |
|
name = name.toLowerCase() |
|
var result, _key |
|
var headers = this.dict |
|
Object.keys(headers).forEach(function (key) { |
|
_key = key.toLowerCase() |
|
if (name === _key) result = headers[key] |
|
}) |
|
return result |
|
} |
|
Caseless.prototype.swap = function (name) { |
|
var has = this.has(name) |
|
if (!has) throw new Error('There is no header than matches "'+name+'"') |
|
this.dict[name] = this.dict[has] |
|
delete this.dict[has] |
|
} |
|
Caseless.prototype.del = function (name) { |
|
var has = this.has(name) |
|
return delete this.dict[has || name] |
|
} |
|
|
|
module.exports = function (dict) {return new Caseless(dict)} |
|
module.exports.httpify = function (resp, headers) { |
|
var c = new Caseless(headers) |
|
resp.setHeader = function (key, value, clobber) { |
|
return c.set(key, value, clobber) |
|
} |
|
resp.hasHeader = function (key) { |
|
return c.has(key) |
|
} |
|
resp.getHeader = function (key) { |
|
return c.get(key) |
|
} |
|
resp.removeHeader = function (key) { |
|
return c.del(key) |
|
} |
|
resp.headers = c.dict |
|
return c |
|
} |
|
|
|
},{}],74:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var util = require('util'); |
|
var Stream = require('stream').Stream; |
|
var DelayedStream = require('delayed-stream'); |
|
|
|
module.exports = CombinedStream; |
|
function CombinedStream() { |
|
this.writable = false; |
|
this.readable = true; |
|
this.dataSize = 0; |
|
this.maxDataSize = 2 * 1024 * 1024; |
|
this.pauseStreams = true; |
|
|
|
this._released = false; |
|
this._streams = []; |
|
this._currentStream = null; |
|
} |
|
util.inherits(CombinedStream, Stream); |
|
|
|
CombinedStream.create = function(options) { |
|
var combinedStream = new this(); |
|
|
|
options = options || {}; |
|
for (var option in options) { |
|
combinedStream[option] = options[option]; |
|
} |
|
|
|
return combinedStream; |
|
}; |
|
|
|
CombinedStream.isStreamLike = function(stream) { |
|
return (typeof stream !== 'function') |
|
&& (typeof stream !== 'string') |
|
&& (typeof stream !== 'boolean') |
|
&& (typeof stream !== 'number') |
|
&& (!Buffer.isBuffer(stream)); |
|
}; |
|
|
|
CombinedStream.prototype.append = function(stream) { |
|
var isStreamLike = CombinedStream.isStreamLike(stream); |
|
|
|
if (isStreamLike) { |
|
if (!(stream instanceof DelayedStream)) { |
|
var newStream = DelayedStream.create(stream, { |
|
maxDataSize: Infinity, |
|
pauseStream: this.pauseStreams, |
|
}); |
|
stream.on('data', this._checkDataSize.bind(this)); |
|
stream = newStream; |
|
} |
|
|
|
this._handleErrors(stream); |
|
|
|
if (this.pauseStreams) { |
|
stream.pause(); |
|
} |
|
} |
|
|
|
this._streams.push(stream); |
|
return this; |
|
}; |
|
|
|
CombinedStream.prototype.pipe = function(dest, options) { |
|
Stream.prototype.pipe.call(this, dest, options); |
|
this.resume(); |
|
return dest; |
|
}; |
|
|
|
CombinedStream.prototype._getNext = function() { |
|
this._currentStream = null; |
|
var stream = this._streams.shift(); |
|
|
|
|
|
if (typeof stream == 'undefined') { |
|
this.end(); |
|
return; |
|
} |
|
|
|
if (typeof stream !== 'function') { |
|
this._pipeNext(stream); |
|
return; |
|
} |
|
|
|
var getStream = stream; |
|
getStream(function(stream) { |
|
var isStreamLike = CombinedStream.isStreamLike(stream); |
|
if (isStreamLike) { |
|
stream.on('data', this._checkDataSize.bind(this)); |
|
this._handleErrors(stream); |
|
} |
|
|
|
this._pipeNext(stream); |
|
}.bind(this)); |
|
}; |
|
|
|
CombinedStream.prototype._pipeNext = function(stream) { |
|
this._currentStream = stream; |
|
|
|
var isStreamLike = CombinedStream.isStreamLike(stream); |
|
if (isStreamLike) { |
|
stream.on('end', this._getNext.bind(this)); |
|
stream.pipe(this, {end: false}); |
|
return; |
|
} |
|
|
|
var value = stream; |
|
this.write(value); |
|
this._getNext(); |
|
}; |
|
|
|
CombinedStream.prototype._handleErrors = function(stream) { |
|
var self = this; |
|
stream.on('error', function(err) { |
|
self._emitError(err); |
|
}); |
|
}; |
|
|
|
CombinedStream.prototype.write = function(data) { |
|
this.emit('data', data); |
|
}; |
|
|
|
CombinedStream.prototype.pause = function() { |
|
if (!this.pauseStreams) { |
|
return; |
|
} |
|
|
|
if(this.pauseStreams && this._currentStream && typeof(this._currentStream.pause) == 'function') this._currentStream.pause(); |
|
this.emit('pause'); |
|
}; |
|
|
|
CombinedStream.prototype.resume = function() { |
|
if (!this._released) { |
|
this._released = true; |
|
this.writable = true; |
|
this._getNext(); |
|
} |
|
|
|
if(this.pauseStreams && this._currentStream && typeof(this._currentStream.resume) == 'function') this._currentStream.resume(); |
|
this.emit('resume'); |
|
}; |
|
|
|
CombinedStream.prototype.end = function() { |
|
this._reset(); |
|
this.emit('end'); |
|
}; |
|
|
|
CombinedStream.prototype.destroy = function() { |
|
this._reset(); |
|
this.emit('close'); |
|
}; |
|
|
|
CombinedStream.prototype._reset = function() { |
|
this.writable = false; |
|
this._streams = []; |
|
this._currentStream = null; |
|
}; |
|
|
|
CombinedStream.prototype._checkDataSize = function() { |
|
this._updateDataSize(); |
|
if (this.dataSize <= this.maxDataSize) { |
|
return; |
|
} |
|
|
|
var message = |
|
'DelayedStream#maxDataSize of ' + this.maxDataSize + ' bytes exceeded.'; |
|
this._emitError(new Error(message)); |
|
}; |
|
|
|
CombinedStream.prototype._updateDataSize = function() { |
|
this.dataSize = 0; |
|
|
|
var self = this; |
|
this._streams.forEach(function(stream) { |
|
if (!stream.dataSize) { |
|
return; |
|
} |
|
|
|
self.dataSize += stream.dataSize; |
|
}); |
|
|
|
if (this._currentStream && this._currentStream.dataSize) { |
|
this.dataSize += this._currentStream.dataSize; |
|
} |
|
}; |
|
|
|
CombinedStream.prototype._emitError = function(err) { |
|
this._reset(); |
|
this.emit('error', err); |
|
}; |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"delayed-stream":75,"stream":339,"util":343}],75:[function(require,module,exports){ |
|
var Stream = require('stream').Stream; |
|
var util = require('util'); |
|
|
|
module.exports = DelayedStream; |
|
function DelayedStream() { |
|
this.source = null; |
|
this.dataSize = 0; |
|
this.maxDataSize = 1024 * 1024; |
|
this.pauseStream = true; |
|
|
|
this._maxDataSizeExceeded = false; |
|
this._released = false; |
|
this._bufferedEvents = []; |
|
} |
|
util.inherits(DelayedStream, Stream); |
|
|
|
DelayedStream.create = function(source, options) { |
|
var delayedStream = new this(); |
|
|
|
options = options || {}; |
|
for (var option in options) { |
|
delayedStream[option] = options[option]; |
|
} |
|
|
|
delayedStream.source = source; |
|
|
|
var realEmit = source.emit; |
|
source.emit = function() { |
|
delayedStream._handleEmit(arguments); |
|
return realEmit.apply(source, arguments); |
|
}; |
|
|
|
source.on('error', function() {}); |
|
if (delayedStream.pauseStream) { |
|
source.pause(); |
|
} |
|
|
|
return delayedStream; |
|
}; |
|
|
|
DelayedStream.prototype.__defineGetter__('readable', function() { |
|
return this.source.readable; |
|
}); |
|
|
|
DelayedStream.prototype.resume = function() { |
|
if (!this._released) { |
|
this.release(); |
|
} |
|
|
|
this.source.resume(); |
|
}; |
|
|
|
DelayedStream.prototype.pause = function() { |
|
this.source.pause(); |
|
}; |
|
|
|
DelayedStream.prototype.release = function() { |
|
this._released = true; |
|
|
|
this._bufferedEvents.forEach(function(args) { |
|
this.emit.apply(this, args); |
|
}.bind(this)); |
|
this._bufferedEvents = []; |
|
}; |
|
|
|
DelayedStream.prototype.pipe = function() { |
|
var r = Stream.prototype.pipe.apply(this, arguments); |
|
this.resume(); |
|
return r; |
|
}; |
|
|
|
DelayedStream.prototype._handleEmit = function(args) { |
|
if (this._released) { |
|
this.emit.apply(this, args); |
|
return; |
|
} |
|
|
|
if (args[0] === 'data') { |
|
this.dataSize += args[1].length; |
|
this._checkIfMaxDataSizeExceeded(); |
|
} |
|
|
|
this._bufferedEvents.push(args); |
|
}; |
|
|
|
DelayedStream.prototype._checkIfMaxDataSizeExceeded = function() { |
|
if (this._maxDataSizeExceeded) { |
|
return; |
|
} |
|
|
|
if (this.dataSize <= this.maxDataSize) { |
|
return; |
|
} |
|
|
|
this._maxDataSizeExceeded = true; |
|
var message = |
|
'DelayedStream#maxDataSize of ' + this.maxDataSize + ' bytes exceeded.' |
|
this.emit('error', new Error(message)); |
|
}; |
|
|
|
},{"stream":339,"util":343}],76:[function(require,module,exports){ |
|
module.exports = ForeverAgent |
|
ForeverAgent.SSL = ForeverAgentSSL |
|
|
|
var util = require('util') |
|
, Agent = require('http').Agent |
|
, net = require('net') |
|
, tls = require('tls') |
|
, AgentSSL = require('https').Agent |
|
|
|
function getConnectionName(host, port) { |
|
var name = '' |
|
if (typeof host === 'string') { |
|
name = host + ':' + port |
|
} else { |
|
// For node.js v012.0 and iojs-v1.5.1, host is an object. And any existing localAddress is part of the connection name. |
|
name = host.host + ':' + host.port + ':' + (host.localAddress ? (host.localAddress + ':') : ':') |
|
} |
|
return name |
|
} |
|
|
|
function ForeverAgent(options) { |
|
var self = this |
|
self.options = options || {} |
|
self.requests = {} |
|
self.sockets = {} |
|
self.freeSockets = {} |
|
self.maxSockets = self.options.maxSockets || Agent.defaultMaxSockets |
|
self.minSockets = self.options.minSockets || ForeverAgent.defaultMinSockets |
|
self.on('free', function(socket, host, port) { |
|
var name = getConnectionName(host, port) |
|
|
|
if (self.requests[name] && self.requests[name].length) { |
|
self.requests[name].shift().onSocket(socket) |
|
} else if (self.sockets[name].length < self.minSockets) { |
|
if (!self.freeSockets[name]) self.freeSockets[name] = [] |
|
self.freeSockets[name].push(socket) |
|
|
|
// if an error happens while we don't use the socket anyway, meh, throw the socket away |
|
var onIdleError = function() { |
|
socket.destroy() |
|
} |
|
socket._onIdleError = onIdleError |
|
socket.on('error', onIdleError) |
|
} else { |
|
// If there are no pending requests just destroy the |
|
// socket and it will get removed from the pool. This |
|
// gets us out of timeout issues and allows us to |
|
// default to Connection:keep-alive. |
|
socket.destroy() |
|
} |
|
}) |
|
|
|
} |
|
util.inherits(ForeverAgent, Agent) |
|
|
|
ForeverAgent.defaultMinSockets = 5 |
|
|
|
|
|
ForeverAgent.prototype.createConnection = net.createConnection |
|
ForeverAgent.prototype.addRequestNoreuse = Agent.prototype.addRequest |
|
ForeverAgent.prototype.addRequest = function(req, host, port) { |
|
var name = getConnectionName(host, port) |
|
|
|
if (typeof host !== 'string') { |
|
var options = host |
|
port = options.port |
|
host = options.host |
|
} |
|
|
|
if (this.freeSockets[name] && this.freeSockets[name].length > 0 && !req.useChunkedEncodingByDefault) { |
|
var idleSocket = this.freeSockets[name].pop() |
|
idleSocket.removeListener('error', idleSocket._onIdleError) |
|
delete idleSocket._onIdleError |
|
req._reusedSocket = true |
|
req.onSocket(idleSocket) |
|
} else { |
|
this.addRequestNoreuse(req, host, port) |
|
} |
|
} |
|
|
|
ForeverAgent.prototype.removeSocket = function(s, name, host, port) { |
|
if (this.sockets[name]) { |
|
var index = this.sockets[name].indexOf(s) |
|
if (index !== -1) { |
|
this.sockets[name].splice(index, 1) |
|
} |
|
} else if (this.sockets[name] && this.sockets[name].length === 0) { |
|
// don't leak |
|
delete this.sockets[name] |
|
delete this.requests[name] |
|
} |
|
|
|
if (this.freeSockets[name]) { |
|
var index = this.freeSockets[name].indexOf(s) |
|
if (index !== -1) { |
|
this.freeSockets[name].splice(index, 1) |
|
if (this.freeSockets[name].length === 0) { |
|
delete this.freeSockets[name] |
|
} |
|
} |
|
} |
|
|
|
if (this.requests[name] && this.requests[name].length) { |
|
// If we have pending requests and a socket gets closed a new one |
|
// needs to be created to take over in the pool for the one that closed. |
|
this.createSocket(name, host, port).emit('free') |
|
} |
|
} |
|
|
|
function ForeverAgentSSL (options) { |
|
ForeverAgent.call(this, options) |
|
} |
|
util.inherits(ForeverAgentSSL, ForeverAgent) |
|
|
|
ForeverAgentSSL.prototype.createConnection = createConnectionSSL |
|
ForeverAgentSSL.prototype.addRequestNoreuse = AgentSSL.prototype.addRequest |
|
|
|
function createConnectionSSL (port, host, options) { |
|
if (typeof port === 'object') { |
|
options = port; |
|
} else if (typeof host === 'object') { |
|
options = host; |
|
} else if (typeof options === 'object') { |
|
options = options; |
|
} else { |
|
options = {}; |
|
} |
|
|
|
if (typeof port === 'number') { |
|
options.port = port; |
|
} |
|
|
|
if (typeof host === 'string') { |
|
options.host = host; |
|
} |
|
|
|
return tls.connect(options); |
|
} |
|
|
|
},{"http":315,"https":319,"net":156,"tls":156,"util":343}],77:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
var CombinedStream = require('combined-stream'); |
|
var util = require('util'); |
|
var path = require('path'); |
|
var http = require('http'); |
|
var https = require('https'); |
|
var parseUrl = require('url').parse; |
|
var fs = require('fs'); |
|
var mime = require('mime-types'); |
|
var async = require('async'); |
|
|
|
module.exports = FormData; |
|
function FormData() { |
|
this._overheadLength = 0; |
|
this._valueLength = 0; |
|
this._lengthRetrievers = []; |
|
|
|
CombinedStream.call(this); |
|
} |
|
util.inherits(FormData, CombinedStream); |
|
|
|
FormData.LINE_BREAK = '\r\n'; |
|
|
|
FormData.prototype.append = function(field, value, options) { |
|
options = options || {}; |
|
|
|
var append = CombinedStream.prototype.append.bind(this); |
|
|
|
// all that streamy business can't handle numbers |
|
if (typeof value == 'number') value = ''+value; |
|
|
|
// https://github.com/felixge/node-form-data/issues/38 |
|
if (util.isArray(value)) { |
|
// Please convert your array into string |
|
// the way web server expects it |
|
this._error(new Error('Arrays are not supported.')); |
|
return; |
|
} |
|
|
|
var header = this._multiPartHeader(field, value, options); |
|
var footer = this._multiPartFooter(field, value, options); |
|
|
|
append(header); |
|
append(value); |
|
append(footer); |
|
|
|
// pass along options.knownLength |
|
this._trackLength(header, value, options); |
|
}; |
|
|
|
FormData.prototype._trackLength = function(header, value, options) { |
|
var valueLength = 0; |
|
|
|
// used w/ getLengthSync(), when length is known. |
|
// e.g. for streaming directly from a remote server, |
|
// w/ a known file a size, and not wanting to wait for |
|
// incoming file to finish to get its size. |
|
if (options.knownLength != null) { |
|
valueLength += +options.knownLength; |
|
} else if (Buffer.isBuffer(value)) { |
|
valueLength = value.length; |
|
} else if (typeof value === 'string') { |
|
valueLength = Buffer.byteLength(value); |
|
} |
|
|
|
this._valueLength += valueLength; |
|
|
|
// @check why add CRLF? does this account for custom/multiple CRLFs? |
|
this._overheadLength += |
|
Buffer.byteLength(header) + |
|
+ FormData.LINE_BREAK.length; |
|
|
|
// empty or either doesn't have path or not an http response |
|
if (!value || ( !value.path && !(value.readable && value.hasOwnProperty('httpVersion')) )) { |
|
return; |
|
} |
|
|
|
// no need to bother with the length |
|
if (!options.knownLength) |
|
this._lengthRetrievers.push(function(next) { |
|
|
|
if (value.hasOwnProperty('fd')) { |
|
|
|
// take read range into a account |
|
// `end` = Infinity –> read file till the end |
|
// |
|
// TODO: Looks like there is bug in Node fs.createReadStream |
|
// it doesn't respect `end` options without `start` options |
|
// Fix it when node fixes it. |
|
// https://github.com/joyent/node/issues/7819 |
|
if (value.end != undefined && value.end != Infinity && value.start != undefined) { |
|
|
|
// when end specified |
|
// no need to calculate range |
|
// inclusive, starts with 0 |
|
next(null, value.end+1 - (value.start ? value.start : 0)); |
|
|
|
// not that fast snoopy |
|
} else { |
|
// still need to fetch file size from fs |
|
fs.stat(value.path, function(err, stat) { |
|
|
|
var fileSize; |
|
|
|
if (err) { |
|
next(err); |
|
return; |
|
} |
|
|
|
// update final size based on the range options |
|
fileSize = stat.size - (value.start ? value.start : 0); |
|
next(null, fileSize); |
|
}); |
|
} |
|
|
|
// or http response |
|
} else if (value.hasOwnProperty('httpVersion')) { |
|
next(null, +value.headers['content-length']); |
|
|
|
// or request stream http://github.com/mikeal/request |
|
} else if (value.hasOwnProperty('httpModule')) { |
|
// wait till response come back |
|
value.on('response', function(response) { |
|
value.pause(); |
|
next(null, +response.headers['content-length']); |
|
}); |
|
value.resume(); |
|
|
|
// something else |
|
} else { |
|
next('Unknown stream'); |
|
} |
|
}); |
|
}; |
|
|
|
FormData.prototype._multiPartHeader = function(field, value, options) { |
|
var boundary = this.getBoundary(); |
|
var header = ''; |
|
|
|
// custom header specified (as string)? |
|
// it becomes responsible for boundary |
|
// (e.g. to handle extra CRLFs on .NET servers) |
|
if (options.header != null) { |
|
header = options.header; |
|
} else { |
|
header += '--' + boundary + FormData.LINE_BREAK + |
|
'Content-Disposition: form-data; name="' + field + '"'; |
|
|
|
// fs- and request- streams have path property |
|
// or use custom filename and/or contentType |
|
// TODO: Use request's response mime-type |
|
if (options.filename || value.path) { |
|
header += |
|
'; filename="' + path.basename(options.filename || value.path) + '"' + FormData.LINE_BREAK + |
|
'Content-Type: ' + (options.contentType || mime.lookup(options.filename || value.path)); |
|
|
|
// http response has not |
|
} else if (value.readable && value.hasOwnProperty('httpVersion')) { |
|
header += |
|
'; filename="' + path.basename(value.client._httpMessage.path) + '"' + FormData.LINE_BREAK + |
|
'Content-Type: ' + value.headers['content-type']; |
|
} |
|
|
|
header += FormData.LINE_BREAK + FormData.LINE_BREAK; |
|
} |
|
|
|
return header; |
|
}; |
|
|
|
FormData.prototype._multiPartFooter = function(field, value, options) { |
|
return function(next) { |
|
var footer = FormData.LINE_BREAK; |
|
|
|
var lastPart = (this._streams.length === 0); |
|
if (lastPart) { |
|
footer += this._lastBoundary(); |
|
} |
|
|
|
next(footer); |
|
}.bind(this); |
|
}; |
|
|
|
FormData.prototype._lastBoundary = function() { |
|
return '--' + this.getBoundary() + '--'; |
|
}; |
|
|
|
FormData.prototype.getHeaders = function(userHeaders) { |
|
var formHeaders = { |
|
'content-type': 'multipart/form-data; boundary=' + this.getBoundary() |
|
}; |
|
|
|
for (var header in userHeaders) { |
|
formHeaders[header.toLowerCase()] = userHeaders[header]; |
|
} |
|
|
|
return formHeaders; |
|
} |
|
|
|
FormData.prototype.getCustomHeaders = function(contentType) { |
|
contentType = contentType ? contentType : 'multipart/form-data'; |
|
|
|
var formHeaders = { |
|
'content-type': contentType + '; boundary=' + this.getBoundary(), |
|
'content-length': this.getLengthSync() |
|
}; |
|
|
|
return formHeaders; |
|
} |
|
|
|
FormData.prototype.getBoundary = function() { |
|
if (!this._boundary) { |
|
this._generateBoundary(); |
|
} |
|
|
|
return this._boundary; |
|
}; |
|
|
|
FormData.prototype._generateBoundary = function() { |
|
// This generates a 50 character boundary similar to those used by Firefox. |
|
// They are optimized for boyer-moore parsing. |
|
var boundary = '--------------------------'; |
|
for (var i = 0; i < 24; i++) { |
|
boundary += Math.floor(Math.random() * 10).toString(16); |
|
} |
|
|
|
this._boundary = boundary; |
|
}; |
|
|
|
// Note: getLengthSync DOESN'T calculate streams length |
|
// As workaround one can calculate file size manually |
|
// and add it as knownLength option |
|
FormData.prototype.getLengthSync = function(debug) { |
|
var knownLength = this._overheadLength + this._valueLength; |
|
|
|
// Don't get confused, there are 3 "internal" streams for each keyval pair |
|
// so it basically checks if there is any value added to the form |
|
if (this._streams.length) { |
|
knownLength += this._lastBoundary().length; |
|
} |
|
|
|
// https://github.com/felixge/node-form-data/issues/40 |
|
if (this._lengthRetrievers.length) { |
|
// Some async length retrivers are present |
|
// therefore synchronous length calculation is false. |
|
// Please use getLength(callback) to get proper length |
|
this._error(new Error('Cannot calculate proper length in synchronous way.')); |
|
} |
|
|
|
return knownLength; |
|
}; |
|
|
|
FormData.prototype.getLength = function(cb) { |
|
var knownLength = this._overheadLength + this._valueLength; |
|
|
|
if (this._streams.length) { |
|
knownLength += this._lastBoundary().length; |
|
} |
|
|
|
if (!this._lengthRetrievers.length) { |
|
process.nextTick(cb.bind(this, null, knownLength)); |
|
return; |
|
} |
|
|
|
async.parallel(this._lengthRetrievers, function(err, values) { |
|
if (err) { |
|
cb(err); |
|
return; |
|
} |
|
|
|
values.forEach(function(length) { |
|
knownLength += length; |
|
}); |
|
|
|
cb(null, knownLength); |
|
}); |
|
}; |
|
|
|
FormData.prototype.submit = function(params, cb) { |
|
|
|
var request |
|
, options |
|
, defaults = { |
|
method : 'post' |
|
}; |
|
|
|
// parse provided url if it's string |
|
// or treat it as options object |
|
if (typeof params == 'string') { |
|
params = parseUrl(params); |
|
|
|
options = populate({ |
|
port: params.port, |
|
path: params.pathname, |
|
host: params.hostname |
|
}, defaults); |
|
} |
|
else // use custom params |
|
{ |
|
options = populate(params, defaults); |
|
// if no port provided use default one |
|
if (!options.port) { |
|
options.port = options.protocol == 'https:' ? 443 : 80; |
|
} |
|
} |
|
|
|
// put that good code in getHeaders to some use |
|
options.headers = this.getHeaders(params.headers); |
|
|
|
// https if specified, fallback to http in any other case |
|
if (params.protocol == 'https:') { |
|
request = https.request(options); |
|
} else { |
|
request = http.request(options); |
|
} |
|
|
|
// get content length and fire away |
|
this.getLength(function(err, length) { |
|
|
|
// TODO: Add chunked encoding when no length (if err) |
|
|
|
// add content length |
|
request.setHeader('Content-Length', length); |
|
|
|
this.pipe(request); |
|
if (cb) { |
|
request.on('error', cb); |
|
request.on('response', cb.bind(this, null)); |
|
} |
|
}.bind(this)); |
|
|
|
return request; |
|
}; |
|
|
|
FormData.prototype._error = function(err) { |
|
if (this.error) return; |
|
|
|
this.error = err; |
|
this.pause(); |
|
this.emit('error', err); |
|
}; |
|
|
|
/* |
|
* Santa's little helpers |
|
*/ |
|
|
|
// populates missing values |
|
function populate(dst, src) { |
|
for (var prop in src) { |
|
if (!dst[prop]) dst[prop] = src[prop]; |
|
} |
|
return dst; |
|
} |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"_process":323,"async":78,"buffer":172,"combined-stream":74,"fs":156,"http":315,"https":319,"mime-types":122,"path":322,"url":341,"util":343}],78:[function(require,module,exports){ |
|
(function (process){ |
|
/*! |
|
* async |
|
* https://github.com/caolan/async |
|
* |
|
* Copyright 2010-2014 Caolan McMahon |
|
* Released under the MIT license |
|
*/ |
|
/*jshint onevar: false, indent:4 */ |
|
/*global setImmediate: false, setTimeout: false, console: false */ |
|
(function () { |
|
|
|
var async = {}; |
|
|
|
// global on the server, window in the browser |
|
var root, previous_async; |
|
|
|
root = this; |
|
if (root != null) { |
|
previous_async = root.async; |
|
} |
|
|
|
async.noConflict = function () { |
|
root.async = previous_async; |
|
return async; |
|
}; |
|
|
|
function only_once(fn) { |
|
var called = false; |
|
return function() { |
|
if (called) throw new Error("Callback was already called."); |
|
called = true; |
|
fn.apply(root, arguments); |
|
} |
|
} |
|
|
|
//// cross-browser compatiblity functions //// |
|
|
|
var _toString = Object.prototype.toString; |
|
|
|
var _isArray = Array.isArray || function (obj) { |
|
return _toString.call(obj) === '[object Array]'; |
|
}; |
|
|
|
var _each = function (arr, iterator) { |
|
if (arr.forEach) { |
|
return arr.forEach(iterator); |
|
} |
|
for (var i = 0; i < arr.length; i += 1) { |
|
iterator(arr[i], i, arr); |
|
} |
|
}; |
|
|
|
var _map = function (arr, iterator) { |
|
if (arr.map) { |
|
return arr.map(iterator); |
|
} |
|
var results = []; |
|
_each(arr, function (x, i, a) { |
|
results.push(iterator(x, i, a)); |
|
}); |
|
return results; |
|
}; |
|
|
|
var _reduce = function (arr, iterator, memo) { |
|
if (arr.reduce) { |
|
return arr.reduce(iterator, memo); |
|
} |
|
_each(arr, function (x, i, a) { |
|
memo = iterator(memo, x, i, a); |
|
}); |
|
return memo; |
|
}; |
|
|
|
var _keys = function (obj) { |
|
if (Object.keys) { |
|
return Object.keys(obj); |
|
} |
|
var keys = []; |
|
for (var k in obj) { |
|
if (obj.hasOwnProperty(k)) { |
|
keys.push(k); |
|
} |
|
} |
|
return keys; |
|
}; |
|
|
|
//// exported async module functions //// |
|
|
|
//// nextTick implementation with browser-compatible fallback //// |
|
if (typeof process === 'undefined' || !(process.nextTick)) { |
|
if (typeof setImmediate === 'function') { |
|
async.nextTick = function (fn) { |
|
// not a direct alias for IE10 compatibility |
|
setImmediate(fn); |
|
}; |
|
async.setImmediate = async.nextTick; |
|
} |
|
else { |
|
async.nextTick = function (fn) { |
|
setTimeout(fn, 0); |
|
}; |
|
async.setImmediate = async.nextTick; |
|
} |
|
} |
|
else { |
|
async.nextTick = process.nextTick; |
|
if (typeof setImmediate !== 'undefined') { |
|
async.setImmediate = function (fn) { |
|
// not a direct alias for IE10 compatibility |
|
setImmediate(fn); |
|
}; |
|
} |
|
else { |
|
async.setImmediate = async.nextTick; |
|
} |
|
} |
|
|
|
async.each = function (arr, iterator, callback) { |
|
callback = callback || function () {}; |
|
if (!arr.length) { |
|
return callback(); |
|
} |
|
var completed = 0; |
|
_each(arr, function (x) { |
|
iterator(x, only_once(done) ); |
|
}); |
|
function done(err) { |
|
if (err) { |
|
callback(err); |
|
callback = function () {}; |
|
} |
|
else { |
|
completed += 1; |
|
if (completed >= arr.length) { |
|
callback(); |
|
} |
|
} |
|
} |
|
}; |
|
async.forEach = async.each; |
|
|
|
async.eachSeries = function (arr, iterator, callback) { |
|
callback = callback || function () {}; |
|
if (!arr.length) { |
|
return callback(); |
|
} |
|
var completed = 0; |
|
var iterate = function () { |
|
iterator(arr[completed], function (err) { |
|
if (err) { |
|
callback(err); |
|
callback = function () {}; |
|
} |
|
else { |
|
completed += 1; |
|
if (completed >= arr.length) { |
|
callback(); |
|
} |
|
else { |
|
iterate(); |
|
} |
|
} |
|
}); |
|
}; |
|
iterate(); |
|
}; |
|
async.forEachSeries = async.eachSeries; |
|
|
|
async.eachLimit = function (arr, limit, iterator, callback) { |
|
var fn = _eachLimit(limit); |
|
fn.apply(null, [arr, iterator, callback]); |
|
}; |
|
async.forEachLimit = async.eachLimit; |
|
|
|
var _eachLimit = function (limit) { |
|
|
|
return function (arr, iterator, callback) { |
|
callback = callback || function () {}; |
|
if (!arr.length || limit <= 0) { |
|
return callback(); |
|
} |
|
var completed = 0; |
|
var started = 0; |
|
var running = 0; |
|
|
|
(function replenish () { |
|
if (completed >= arr.length) { |
|
return callback(); |
|
} |
|
|
|
while (running < limit && started < arr.length) { |
|
started += 1; |
|
running += 1; |
|
iterator(arr[started - 1], function (err) { |
|
if (err) { |
|
callback(err); |
|
callback = function () {}; |
|
} |
|
else { |
|
completed += 1; |
|
running -= 1; |
|
if (completed >= arr.length) { |
|
callback(); |
|
} |
|
else { |
|
replenish(); |
|
} |
|
} |
|
}); |
|
} |
|
})(); |
|
}; |
|
}; |
|
|
|
|
|
var doParallel = function (fn) { |
|
return function () { |
|
var args = Array.prototype.slice.call(arguments); |
|
return fn.apply(null, [async.each].concat(args)); |
|
}; |
|
}; |
|
var doParallelLimit = function(limit, fn) { |
|
return function () { |
|
var args = Array.prototype.slice.call(arguments); |
|
return fn.apply(null, [_eachLimit(limit)].concat(args)); |
|
}; |
|
}; |
|
var doSeries = function (fn) { |
|
return function () { |
|
var args = Array.prototype.slice.call(arguments); |
|
return fn.apply(null, [async.eachSeries].concat(args)); |
|
}; |
|
}; |
|
|
|
|
|
var _asyncMap = function (eachfn, arr, iterator, callback) { |
|
arr = _map(arr, function (x, i) { |
|
return {index: i, value: x}; |
|
}); |
|
if (!callback) { |
|
eachfn(arr, function (x, callback) { |
|
iterator(x.value, function (err) { |
|
callback(err); |
|
}); |
|
}); |
|
} else { |
|
var results = []; |
|
eachfn(arr, function (x, callback) { |
|
iterator(x.value, function (err, v) { |
|
results[x.index] = v; |
|
callback(err); |
|
}); |
|
}, function (err) { |
|
callback(err, results); |
|
}); |
|
} |
|
}; |
|
async.map = doParallel(_asyncMap); |
|
async.mapSeries = doSeries(_asyncMap); |
|
async.mapLimit = function (arr, limit, iterator, callback) { |
|
return _mapLimit(limit)(arr, iterator, callback); |
|
}; |
|
|
|
var _mapLimit = function(limit) { |
|
return doParallelLimit(limit, _asyncMap); |
|
}; |
|
|
|
// reduce only has a series version, as doing reduce in parallel won't |
|
// work in many situations. |
|
async.reduce = function (arr, memo, iterator, callback) { |
|
async.eachSeries(arr, function (x, callback) { |
|
iterator(memo, x, function (err, v) { |
|
memo = v; |
|
callback(err); |
|
}); |
|
}, function (err) { |
|
callback(err, memo); |
|
}); |
|
}; |
|
// inject alias |
|
async.inject = async.reduce; |
|
// foldl alias |
|
async.foldl = async.reduce; |
|
|
|
async.reduceRight = function (arr, memo, iterator, callback) { |
|
var reversed = _map(arr, function (x) { |
|
return x; |
|
}).reverse(); |
|
async.reduce(reversed, memo, iterator, callback); |
|
}; |
|
// foldr alias |
|
async.foldr = async.reduceRight; |
|
|
|
var _filter = function (eachfn, arr, iterator, callback) { |
|
var results = []; |
|
arr = _map(arr, function (x, i) { |
|
return {index: i, value: x}; |
|
}); |
|
eachfn(arr, function (x, callback) { |
|
iterator(x.value, function (v) { |
|
if (v) { |
|
results.push(x); |
|
} |
|
callback(); |
|
}); |
|
}, function (err) { |
|
callback(_map(results.sort(function (a, b) { |
|
return a.index - b.index; |
|
}), function (x) { |
|
return x.value; |
|
})); |
|
}); |
|
}; |
|
async.filter = doParallel(_filter); |
|
async.filterSeries = doSeries(_filter); |
|
// select alias |
|
async.select = async.filter; |
|
async.selectSeries = async.filterSeries; |
|
|
|
var _reject = function (eachfn, arr, iterator, callback) { |
|
var results = []; |
|
arr = _map(arr, function (x, i) { |
|
return {index: i, value: x}; |
|
}); |
|
eachfn(arr, function (x, callback) { |
|
iterator(x.value, function (v) { |
|
if (!v) { |
|
results.push(x); |
|
} |
|
callback(); |
|
}); |
|
}, function (err) { |
|
callback(_map(results.sort(function (a, b) { |
|
return a.index - b.index; |
|
}), function (x) { |
|
return x.value; |
|
})); |
|
}); |
|
}; |
|
async.reject = doParallel(_reject); |
|
async.rejectSeries = doSeries(_reject); |
|
|
|
var _detect = function (eachfn, arr, iterator, main_callback) { |
|
eachfn(arr, function (x, callback) { |
|
iterator(x, function (result) { |
|
if (result) { |
|
main_callback(x); |
|
main_callback = function () {}; |
|
} |
|
else { |
|
callback(); |
|
} |
|
}); |
|
}, function (err) { |
|
main_callback(); |
|
}); |
|
}; |
|
async.detect = doParallel(_detect); |
|
async.detectSeries = doSeries(_detect); |
|
|
|
async.some = function (arr, iterator, main_callback) { |
|
async.each(arr, function (x, callback) { |
|
iterator(x, function (v) { |
|
if (v) { |
|
main_callback(true); |
|
main_callback = function () {}; |
|
} |
|
callback(); |
|
}); |
|
}, function (err) { |
|
main_callback(false); |
|
}); |
|
}; |
|
// any alias |
|
async.any = async.some; |
|
|
|
async.every = function (arr, iterator, main_callback) { |
|
async.each(arr, function (x, callback) { |
|
iterator(x, function (v) { |
|
if (!v) { |
|
main_callback(false); |
|
main_callback = function () {}; |
|
} |
|
callback(); |
|
}); |
|
}, function (err) { |
|
main_callback(true); |
|
}); |
|
}; |
|
// all alias |
|
async.all = async.every; |
|
|
|
async.sortBy = function (arr, iterator, callback) { |
|
async.map(arr, function (x, callback) { |
|
iterator(x, function (err, criteria) { |
|
if (err) { |
|
callback(err); |
|
} |
|
else { |
|
callback(null, {value: x, criteria: criteria}); |
|
} |
|
}); |
|
}, function (err, results) { |
|
if (err) { |
|
return callback(err); |
|
} |
|
else { |
|
var fn = function (left, right) { |
|
var a = left.criteria, b = right.criteria; |
|
return a < b ? -1 : a > b ? 1 : 0; |
|
}; |
|
callback(null, _map(results.sort(fn), function (x) { |
|
return x.value; |
|
})); |
|
} |
|
}); |
|
}; |
|
|
|
async.auto = function (tasks, callback) { |
|
callback = callback || function () {}; |
|
var keys = _keys(tasks); |
|
var remainingTasks = keys.length |
|
if (!remainingTasks) { |
|
return callback(); |
|
} |
|
|
|
var results = {}; |
|
|
|
var listeners = []; |
|
var addListener = function (fn) { |
|
listeners.unshift(fn); |
|
}; |
|
var removeListener = function (fn) { |
|
for (var i = 0; i < listeners.length; i += 1) { |
|
if (listeners[i] === fn) { |
|
listeners.splice(i, 1); |
|
return; |
|
} |
|
} |
|
}; |
|
var taskComplete = function () { |
|
remainingTasks-- |
|
_each(listeners.slice(0), function (fn) { |
|
fn(); |
|
}); |
|
}; |
|
|
|
addListener(function () { |
|
if (!remainingTasks) { |
|
var theCallback = callback; |
|
// prevent final callback from calling itself if it errors |
|
callback = function () {}; |
|
|
|
theCallback(null, results); |
|
} |
|
}); |
|
|
|
_each(keys, function (k) { |
|
var task = _isArray(tasks[k]) ? tasks[k]: [tasks[k]]; |
|
var taskCallback = function (err) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (args.length <= 1) { |
|
args = args[0]; |
|
} |
|
if (err) { |
|
var safeResults = {}; |
|
_each(_keys(results), function(rkey) { |
|
safeResults[rkey] = results[rkey]; |
|
}); |
|
safeResults[k] = args; |
|
callback(err, safeResults); |
|
// stop subsequent errors hitting callback multiple times |
|
callback = function () {}; |
|
} |
|
else { |
|
results[k] = args; |
|
async.setImmediate(taskComplete); |
|
} |
|
}; |
|
var requires = task.slice(0, Math.abs(task.length - 1)) || []; |
|
var ready = function () { |
|
return _reduce(requires, function (a, x) { |
|
return (a && results.hasOwnProperty(x)); |
|
}, true) && !results.hasOwnProperty(k); |
|
}; |
|
if (ready()) { |
|
task[task.length - 1](taskCallback, results); |
|
} |
|
else { |
|
var listener = function () { |
|
if (ready()) { |
|
removeListener(listener); |
|
task[task.length - 1](taskCallback, results); |
|
} |
|
}; |
|
addListener(listener); |
|
} |
|
}); |
|
}; |
|
|
|
async.retry = function(times, task, callback) { |
|
var DEFAULT_TIMES = 5; |
|
var attempts = []; |
|
// Use defaults if times not passed |
|
if (typeof times === 'function') { |
|
callback = task; |
|
task = times; |
|
times = DEFAULT_TIMES; |
|
} |
|
// Make sure times is a number |
|
times = parseInt(times, 10) || DEFAULT_TIMES; |
|
var wrappedTask = function(wrappedCallback, wrappedResults) { |
|
var retryAttempt = function(task, finalAttempt) { |
|
return function(seriesCallback) { |
|
task(function(err, result){ |
|
seriesCallback(!err || finalAttempt, {err: err, result: result}); |
|
}, wrappedResults); |
|
}; |
|
}; |
|
while (times) { |
|
attempts.push(retryAttempt(task, !(times-=1))); |
|
} |
|
async.series(attempts, function(done, data){ |
|
data = data[data.length - 1]; |
|
(wrappedCallback || callback)(data.err, data.result); |
|
}); |
|
} |
|
// If a callback is passed, run this as a controll flow |
|
return callback ? wrappedTask() : wrappedTask |
|
}; |
|
|
|
async.waterfall = function (tasks, callback) { |
|
callback = callback || function () {}; |
|
if (!_isArray(tasks)) { |
|
var err = new Error('First argument to waterfall must be an array of functions'); |
|
return callback(err); |
|
} |
|
if (!tasks.length) { |
|
return callback(); |
|
} |
|
var wrapIterator = function (iterator) { |
|
return function (err) { |
|
if (err) { |
|
callback.apply(null, arguments); |
|
callback = function () {}; |
|
} |
|
else { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
var next = iterator.next(); |
|
if (next) { |
|
args.push(wrapIterator(next)); |
|
} |
|
else { |
|
args.push(callback); |
|
} |
|
async.setImmediate(function () { |
|
iterator.apply(null, args); |
|
}); |
|
} |
|
}; |
|
}; |
|
wrapIterator(async.iterator(tasks))(); |
|
}; |
|
|
|
var _parallel = function(eachfn, tasks, callback) { |
|
callback = callback || function () {}; |
|
if (_isArray(tasks)) { |
|
eachfn.map(tasks, function (fn, callback) { |
|
if (fn) { |
|
fn(function (err) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (args.length <= 1) { |
|
args = args[0]; |
|
} |
|
callback.call(null, err, args); |
|
}); |
|
} |
|
}, callback); |
|
} |
|
else { |
|
var results = {}; |
|
eachfn.each(_keys(tasks), function (k, callback) { |
|
tasks[k](function (err) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (args.length <= 1) { |
|
args = args[0]; |
|
} |
|
results[k] = args; |
|
callback(err); |
|
}); |
|
}, function (err) { |
|
callback(err, results); |
|
}); |
|
} |
|
}; |
|
|
|
async.parallel = function (tasks, callback) { |
|
_parallel({ map: async.map, each: async.each }, tasks, callback); |
|
}; |
|
|
|
async.parallelLimit = function(tasks, limit, callback) { |
|
_parallel({ map: _mapLimit(limit), each: _eachLimit(limit) }, tasks, callback); |
|
}; |
|
|
|
async.series = function (tasks, callback) { |
|
callback = callback || function () {}; |
|
if (_isArray(tasks)) { |
|
async.mapSeries(tasks, function (fn, callback) { |
|
if (fn) { |
|
fn(function (err) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (args.length <= 1) { |
|
args = args[0]; |
|
} |
|
callback.call(null, err, args); |
|
}); |
|
} |
|
}, callback); |
|
} |
|
else { |
|
var results = {}; |
|
async.eachSeries(_keys(tasks), function (k, callback) { |
|
tasks[k](function (err) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (args.length <= 1) { |
|
args = args[0]; |
|
} |
|
results[k] = args; |
|
callback(err); |
|
}); |
|
}, function (err) { |
|
callback(err, results); |
|
}); |
|
} |
|
}; |
|
|
|
async.iterator = function (tasks) { |
|
var makeCallback = function (index) { |
|
var fn = function () { |
|
if (tasks.length) { |
|
tasks[index].apply(null, arguments); |
|
} |
|
return fn.next(); |
|
}; |
|
fn.next = function () { |
|
return (index < tasks.length - 1) ? makeCallback(index + 1): null; |
|
}; |
|
return fn; |
|
}; |
|
return makeCallback(0); |
|
}; |
|
|
|
async.apply = function (fn) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
return function () { |
|
return fn.apply( |
|
null, args.concat(Array.prototype.slice.call(arguments)) |
|
); |
|
}; |
|
}; |
|
|
|
var _concat = function (eachfn, arr, fn, callback) { |
|
var r = []; |
|
eachfn(arr, function (x, cb) { |
|
fn(x, function (err, y) { |
|
r = r.concat(y || []); |
|
cb(err); |
|
}); |
|
}, function (err) { |
|
callback(err, r); |
|
}); |
|
}; |
|
async.concat = doParallel(_concat); |
|
async.concatSeries = doSeries(_concat); |
|
|
|
async.whilst = function (test, iterator, callback) { |
|
if (test()) { |
|
iterator(function (err) { |
|
if (err) { |
|
return callback(err); |
|
} |
|
async.whilst(test, iterator, callback); |
|
}); |
|
} |
|
else { |
|
callback(); |
|
} |
|
}; |
|
|
|
async.doWhilst = function (iterator, test, callback) { |
|
iterator(function (err) { |
|
if (err) { |
|
return callback(err); |
|
} |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (test.apply(null, args)) { |
|
async.doWhilst(iterator, test, callback); |
|
} |
|
else { |
|
callback(); |
|
} |
|
}); |
|
}; |
|
|
|
async.until = function (test, iterator, callback) { |
|
if (!test()) { |
|
iterator(function (err) { |
|
if (err) { |
|
return callback(err); |
|
} |
|
async.until(test, iterator, callback); |
|
}); |
|
} |
|
else { |
|
callback(); |
|
} |
|
}; |
|
|
|
async.doUntil = function (iterator, test, callback) { |
|
iterator(function (err) { |
|
if (err) { |
|
return callback(err); |
|
} |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (!test.apply(null, args)) { |
|
async.doUntil(iterator, test, callback); |
|
} |
|
else { |
|
callback(); |
|
} |
|
}); |
|
}; |
|
|
|
async.queue = function (worker, concurrency) { |
|
if (concurrency === undefined) { |
|
concurrency = 1; |
|
} |
|
function _insert(q, data, pos, callback) { |
|
if (!q.started){ |
|
q.started = true; |
|
} |
|
if (!_isArray(data)) { |
|
data = [data]; |
|
} |
|
if(data.length == 0) { |
|
// call drain immediately if there are no tasks |
|
return async.setImmediate(function() { |
|
if (q.drain) { |
|
q.drain(); |
|
} |
|
}); |
|
} |
|
_each(data, function(task) { |
|
var item = { |
|
data: task, |
|
callback: typeof callback === 'function' ? callback : null |
|
}; |
|
|
|
if (pos) { |
|
q.tasks.unshift(item); |
|
} else { |
|
q.tasks.push(item); |
|
} |
|
|
|
if (q.saturated && q.tasks.length === q.concurrency) { |
|
q.saturated(); |
|
} |
|
async.setImmediate(q.process); |
|
}); |
|
} |
|
|
|
var workers = 0; |
|
var q = { |
|
tasks: [], |
|
concurrency: concurrency, |
|
saturated: null, |
|
empty: null, |
|
drain: null, |
|
started: false, |
|
paused: false, |
|
push: function (data, callback) { |
|
_insert(q, data, false, callback); |
|
}, |
|
kill: function () { |
|
q.drain = null; |
|
q.tasks = []; |
|
}, |
|
unshift: function (data, callback) { |
|
_insert(q, data, true, callback); |
|
}, |
|
process: function () { |
|
if (!q.paused && workers < q.concurrency && q.tasks.length) { |
|
var task = q.tasks.shift(); |
|
if (q.empty && q.tasks.length === 0) { |
|
q.empty(); |
|
} |
|
workers += 1; |
|
var next = function () { |
|
workers -= 1; |
|
if (task.callback) { |
|
task.callback.apply(task, arguments); |
|
} |
|
if (q.drain && q.tasks.length + workers === 0) { |
|
q.drain(); |
|
} |
|
q.process(); |
|
}; |
|
var cb = only_once(next); |
|
worker(task.data, cb); |
|
} |
|
}, |
|
length: function () { |
|
return q.tasks.length; |
|
}, |
|
running: function () { |
|
return workers; |
|
}, |
|
idle: function() { |
|
return q.tasks.length + workers === 0; |
|
}, |
|
pause: function () { |
|
if (q.paused === true) { return; } |
|
q.paused = true; |
|
q.process(); |
|
}, |
|
resume: function () { |
|
if (q.paused === false) { return; } |
|
q.paused = false; |
|
q.process(); |
|
} |
|
}; |
|
return q; |
|
}; |
|
|
|
async.priorityQueue = function (worker, concurrency) { |
|
|
|
function _compareTasks(a, b){ |
|
return a.priority - b.priority; |
|
}; |
|
|
|
function _binarySearch(sequence, item, compare) { |
|
var beg = -1, |
|
end = sequence.length - 1; |
|
while (beg < end) { |
|
var mid = beg + ((end - beg + 1) >>> 1); |
|
if (compare(item, sequence[mid]) >= 0) { |
|
beg = mid; |
|
} else { |
|
end = mid - 1; |
|
} |
|
} |
|
return beg; |
|
} |
|
|
|
function _insert(q, data, priority, callback) { |
|
if (!q.started){ |
|
q.started = true; |
|
} |
|
if (!_isArray(data)) { |
|
data = [data]; |
|
} |
|
if(data.length == 0) { |
|
// call drain immediately if there are no tasks |
|
return async.setImmediate(function() { |
|
if (q.drain) { |
|
q.drain(); |
|
} |
|
}); |
|
} |
|
_each(data, function(task) { |
|
var item = { |
|
data: task, |
|
priority: priority, |
|
callback: typeof callback === 'function' ? callback : null |
|
}; |
|
|
|
q.tasks.splice(_binarySearch(q.tasks, item, _compareTasks) + 1, 0, item); |
|
|
|
if (q.saturated && q.tasks.length === q.concurrency) { |
|
q.saturated(); |
|
} |
|
async.setImmediate(q.process); |
|
}); |
|
} |
|
|
|
// Start with a normal queue |
|
var q = async.queue(worker, concurrency); |
|
|
|
// Override push to accept second parameter representing priority |
|
q.push = function (data, priority, callback) { |
|
_insert(q, data, priority, callback); |
|
}; |
|
|
|
// Remove unshift function |
|
delete q.unshift; |
|
|
|
return q; |
|
}; |
|
|
|
async.cargo = function (worker, payload) { |
|
var working = false, |
|
tasks = []; |
|
|
|
var cargo = { |
|
tasks: tasks, |
|
payload: payload, |
|
saturated: null, |
|
empty: null, |
|
drain: null, |
|
drained: true, |
|
push: function (data, callback) { |
|
if (!_isArray(data)) { |
|
data = [data]; |
|
} |
|
_each(data, function(task) { |
|
tasks.push({ |
|
data: task, |
|
callback: typeof callback === 'function' ? callback : null |
|
}); |
|
cargo.drained = false; |
|
if (cargo.saturated && tasks.length === payload) { |
|
cargo.saturated(); |
|
} |
|
}); |
|
async.setImmediate(cargo.process); |
|
}, |
|
process: function process() { |
|
if (working) return; |
|
if (tasks.length === 0) { |
|
if(cargo.drain && !cargo.drained) cargo.drain(); |
|
cargo.drained = true; |
|
return; |
|
} |
|
|
|
var ts = typeof payload === 'number' |
|
? tasks.splice(0, payload) |
|
: tasks.splice(0, tasks.length); |
|
|
|
var ds = _map(ts, function (task) { |
|
return task.data; |
|
}); |
|
|
|
if(cargo.empty) cargo.empty(); |
|
working = true; |
|
worker(ds, function () { |
|
working = false; |
|
|
|
var args = arguments; |
|
_each(ts, function (data) { |
|
if (data.callback) { |
|
data.callback.apply(null, args); |
|
} |
|
}); |
|
|
|
process(); |
|
}); |
|
}, |
|
length: function () { |
|
return tasks.length; |
|
}, |
|
running: function () { |
|
return working; |
|
} |
|
}; |
|
return cargo; |
|
}; |
|
|
|
var _console_fn = function (name) { |
|
return function (fn) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
fn.apply(null, args.concat([function (err) { |
|
var args = Array.prototype.slice.call(arguments, 1); |
|
if (typeof console !== 'undefined') { |
|
if (err) { |
|
if (console.error) { |
|
console.error(err); |
|
} |
|
} |
|
else if (console[name]) { |
|
_each(args, function (x) { |
|
console[name](x); |
|
}); |
|
} |
|
} |
|
}])); |
|
}; |
|
}; |
|
async.log = _console_fn('log'); |
|
async.dir = _console_fn('dir'); |
|
/*async.info = _console_fn('info'); |
|
async.warn = _console_fn('warn'); |
|
async.error = _console_fn('error');*/ |
|
|
|
async.memoize = function (fn, hasher) { |
|
var memo = {}; |
|
var queues = {}; |
|
hasher = hasher || function (x) { |
|
return x; |
|
}; |
|
var memoized = function () { |
|
var args = Array.prototype.slice.call(arguments); |
|
var callback = args.pop(); |
|
var key = hasher.apply(null, args); |
|
if (key in memo) { |
|
async.nextTick(function () { |
|
callback.apply(null, memo[key]); |
|
}); |
|
} |
|
else if (key in queues) { |
|
queues[key].push(callback); |
|
} |
|
else { |
|
queues[key] = [callback]; |
|
fn.apply(null, args.concat([function () { |
|
memo[key] = arguments; |
|
var q = queues[key]; |
|
delete queues[key]; |
|
for (var i = 0, l = q.length; i < l; i++) { |
|
q[i].apply(null, arguments); |
|
} |
|
}])); |
|
} |
|
}; |
|
memoized.memo = memo; |
|
memoized.unmemoized = fn; |
|
return memoized; |
|
}; |
|
|
|
async.unmemoize = function (fn) { |
|
return function () { |
|
return (fn.unmemoized || fn).apply(null, arguments); |
|
}; |
|
}; |
|
|
|
async.times = function (count, iterator, callback) { |
|
var counter = []; |
|
for (var i = 0; i < count; i++) { |
|
counter.push(i); |
|
} |
|
return async.map(counter, iterator, callback); |
|
}; |
|
|
|
async.timesSeries = function (count, iterator, callback) { |
|
var counter = []; |
|
for (var i = 0; i < count; i++) { |
|
counter.push(i); |
|
} |
|
return async.mapSeries(counter, iterator, callback); |
|
}; |
|
|
|
async.seq = function (/* functions... */) { |
|
var fns = arguments; |
|
return function () { |
|
var that = this; |
|
var args = Array.prototype.slice.call(arguments); |
|
var callback = args.pop(); |
|
async.reduce(fns, args, function (newargs, fn, cb) { |
|
fn.apply(that, newargs.concat([function () { |
|
var err = arguments[0]; |
|
var nextargs = Array.prototype.slice.call(arguments, 1); |
|
cb(err, nextargs); |
|
}])) |
|
}, |
|
function (err, results) { |
|
callback.apply(that, [err].concat(results)); |
|
}); |
|
}; |
|
}; |
|
|
|
async.compose = function (/* functions... */) { |
|
return async.seq.apply(null, Array.prototype.reverse.call(arguments)); |
|
}; |
|
|
|
var _applyEach = function (eachfn, fns /*args...*/) { |
|
var go = function () { |
|
var that = this; |
|
var args = Array.prototype.slice.call(arguments); |
|
var callback = args.pop(); |
|
return eachfn(fns, function (fn, cb) { |
|
fn.apply(that, args.concat([cb])); |
|
}, |
|
callback); |
|
}; |
|
if (arguments.length > 2) { |
|
var args = Array.prototype.slice.call(arguments, 2); |
|
return go.apply(this, args); |
|
} |
|
else { |
|
return go; |
|
} |
|
}; |
|
async.applyEach = doParallel(_applyEach); |
|
async.applyEachSeries = doSeries(_applyEach); |
|
|
|
async.forever = function (fn, callback) { |
|
function next(err) { |
|
if (err) { |
|
if (callback) { |
|
return callback(err); |
|
} |
|
throw err; |
|
} |
|
fn(next); |
|
} |
|
next(); |
|
}; |
|
|
|
// Node.js |
|
if (typeof module !== 'undefined' && module.exports) { |
|
module.exports = async; |
|
} |
|
// AMD / RequireJS |
|
else if (typeof define !== 'undefined' && define.amd) { |
|
define([], function () { |
|
return async; |
|
}); |
|
} |
|
// included directly via <script> tag |
|
else { |
|
root.async = async; |
|
} |
|
|
|
}()); |
|
|
|
}).call(this,require('_process')) |
|
},{"_process":323}],79:[function(require,module,exports){ |
|
exports['date-time'] = /^\d{4}-(?:0[0-9]{1}|1[0-2]{1})-[0-9]{2}[tT ]\d{2}:\d{2}:\d{2}(\.\d+)?([zZ]|[+-]\d{2}:\d{2})$/ |
|
exports['date'] = /^\d{4}-(?:0[0-9]{1}|1[0-2]{1})-[0-9]{2}$/ |
|
exports['time'] = /^\d{2}:\d{2}:\d{2}$/ |
|
exports['email'] = /^\S+@\S+$/ |
|
exports['ip-address'] = exports['ipv4'] = /^(?:(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.){3}(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)$/ |
|
exports['ipv6'] = /^\s*((([0-9A-Fa-f]{1,4}:){7}([0-9A-Fa-f]{1,4}|:))|(([0-9A-Fa-f]{1,4}:){6}(:[0-9A-Fa-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9A-Fa-f]{1,4}:){5}(((:[0-9A-Fa-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9A-Fa-f]{1,4}:){4}(((:[0-9A-Fa-f]{1,4}){1,3})|((:[0-9A-Fa-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9A-Fa-f]{1,4}:){3}(((:[0-9A-Fa-f]{1,4}){1,4})|((:[0-9A-Fa-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9A-Fa-f]{1,4}:){2}(((:[0-9A-Fa-f]{1,4}){1,5})|((:[0-9A-Fa-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9A-Fa-f]{1,4}:){1}(((:[0-9A-Fa-f]{1,4}){1,6})|((:[0-9A-Fa-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9A-Fa-f]{1,4}){1,7})|((:[0-9A-Fa-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))(%.+)?\s*$/ |
|
exports['uri'] = /^[a-zA-Z][a-zA-Z0-9+-.]*:[^\s]*$/ |
|
exports['color'] = /(#?([0-9A-Fa-f]{3,6})\b)|(aqua)|(black)|(blue)|(fuchsia)|(gray)|(green)|(lime)|(maroon)|(navy)|(olive)|(orange)|(purple)|(red)|(silver)|(teal)|(white)|(yellow)|(rgb\(\s*\b([0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])\b\s*,\s*\b([0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])\b\s*,\s*\b([0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])\b\s*\))|(rgb\(\s*(\d?\d%|100%)+\s*,\s*(\d?\d%|100%)+\s*,\s*(\d?\d%|100%)+\s*\))/ |
|
exports['hostname'] = /^([a-zA-Z0-9]|[a-zA-Z0-9][a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])(\.([a-zA-Z0-9]|[a-zA-Z0-9][a-zA-Z0-9\-]{0,61}[a-zA-Z0-9]))*$/ |
|
exports['alpha'] = /^[a-zA-Z]+$/ |
|
exports['alphanumeric'] = /^[a-zA-Z0-9]+$/ |
|
exports['style'] = /\s*(.+?):\s*([^;]+);?/g |
|
exports['phone'] = /^\+(?:[0-9] ?){6,14}[0-9]$/ |
|
exports['utc-millisec'] = /^[0-9]+(\.?[0-9]+)?$/ |
|
|
|
},{}],80:[function(require,module,exports){ |
|
var genobj = require('generate-object-property') |
|
var genfun = require('generate-function') |
|
var jsonpointer = require('jsonpointer') |
|
var xtend = require('xtend') |
|
var formats = require('./formats') |
|
|
|
var get = function(obj, additionalSchemas, ptr) { |
|
if (/^https?:\/\//.test(ptr)) return null |
|
|
|
var visit = function(sub) { |
|
if (sub && sub.id === ptr) return sub |
|
if (typeof sub !== 'object' || !sub) return null |
|
return Object.keys(sub).reduce(function(res, k) { |
|
return res || visit(sub[k]) |
|
}, null) |
|
} |
|
|
|
var res = visit(obj) |
|
if (res) return res |
|
|
|
ptr = ptr.replace(/^#/, '') |
|
ptr = ptr.replace(/\/$/, '') |
|
|
|
try { |
|
return jsonpointer.get(obj, decodeURI(ptr)) |
|
} catch (err) { |
|
var other = additionalSchemas[ptr] || additionalSchemas[ptr.replace(/^#/, '')] |
|
return other || null |
|
} |
|
} |
|
|
|
var formatName = function(field) { |
|
var pattern = /\[[^\[\]"]+\]/ |
|
while (pattern.test(field)) field = field.replace(pattern, '.*') |
|
return field |
|
} |
|
|
|
var types = {} |
|
|
|
types.any = function() { |
|
return 'true' |
|
} |
|
|
|
types.null = function(name) { |
|
return name+' === null' |
|
} |
|
|
|
types.boolean = function(name) { |
|
return 'typeof '+name+' === "boolean"' |
|
} |
|
|
|
types.array = function(name) { |
|
return 'Array.isArray('+name+')' |
|
} |
|
|
|
types.object = function(name) { |
|
return 'typeof '+name+' === "object" && '+name+' && !Array.isArray('+name+')' |
|
} |
|
|
|
types.number = function(name) { |
|
return 'typeof '+name+' === "number"' |
|
} |
|
|
|
types.integer = function(name) { |
|
return 'typeof '+name+' === "number" && (Math.floor('+name+') === '+name+' || '+name+' > 9007199254740992 || '+name+' < -9007199254740992)' |
|
} |
|
|
|
types.string = function(name) { |
|
return 'typeof '+name+' === "string"' |
|
} |
|
|
|
var unique = function(array) { |
|
var list = [] |
|
for (var i = 0; i < array.length; i++) { |
|
list.push(typeof array[i] === 'object' ? JSON.stringify(array[i]) : array[i]) |
|
} |
|
for (var i = 1; i < list.length; i++) { |
|
if (list.indexOf(list[i]) !== i) return false |
|
} |
|
return true |
|
} |
|
|
|
var toType = function(node) { |
|
return node.type |
|
} |
|
|
|
var compile = function(schema, cache, root, reporter, opts) { |
|
var fmts = opts ? xtend(formats, opts.formats) : formats |
|
var scope = {unique:unique, formats:fmts} |
|
var verbose = opts ? !!opts.verbose : false; |
|
var greedy = opts && opts.greedy !== undefined ? |
|
opts.greedy : false; |
|
|
|
var syms = {} |
|
var gensym = function(name) { |
|
return name+(syms[name] = (syms[name] || 0)+1) |
|
} |
|
|
|
var reversePatterns = {} |
|
var patterns = function(p) { |
|
if (reversePatterns[p]) return reversePatterns[p] |
|
var n = gensym('pattern') |
|
scope[n] = new RegExp(p) |
|
reversePatterns[p] = n |
|
return n |
|
} |
|
|
|
var vars = ['i','j','k','l','m','n','o','p','q','r','s','t','u','v','x','y','z'] |
|
var genloop = function() { |
|
var v = vars.shift() |
|
vars.push(v+v[0]) |
|
return v |
|
} |
|
|
|
var visit = function(name, node, reporter, filter) { |
|
var properties = node.properties |
|
var type = node.type |
|
var tuple = false |
|
|
|
if (Array.isArray(node.items)) { // tuple type |
|
properties = {} |
|
node.items.forEach(function(item, i) { |
|
properties[i] = item |
|
}) |
|
type = 'array' |
|
tuple = true |
|
} |
|
|
|
var indent = 0 |
|
var error = function(msg, prop, value) { |
|
validate('errors++') |
|
if (reporter === true) { |
|
validate('if (validate.errors === null) validate.errors = []') |
|
if (verbose) { |
|
validate('validate.errors.push({field:%s,message:%s,value:%s})', JSON.stringify(formatName(prop || name)), JSON.stringify(msg), value || name) |
|
} else { |
|
var n = gensym('error') |
|
scope[n] = {field:formatName(prop || name), message:msg} |
|
validate('validate.errors.push(%s)', n) |
|
} |
|
} |
|
} |
|
|
|
if (node.required === true) { |
|
indent++ |
|
validate('if (%s === undefined) {', name) |
|
error('is required') |
|
validate('} else {') |
|
} else { |
|
indent++ |
|
validate('if (%s !== undefined) {', name) |
|
} |
|
|
|
var valid = [].concat(type) |
|
.map(function(t) { |
|
return types[t || 'any'](name) |
|
}) |
|
.join(' || ') || 'true' |
|
|
|
if (valid !== 'true') { |
|
indent++ |
|
validate('if (!(%s)) {', valid) |
|
error('is the wrong type') |
|
validate('} else {') |
|
} |
|
|
|
if (tuple) { |
|
if (node.additionalItems === false) { |
|
validate('if (%s.length > %d) {', name, node.items.length) |
|
error('has additional items') |
|
validate('}') |
|
} else if (node.additionalItems) { |
|
var i = genloop() |
|
validate('for (var %s = %d; %s < %s.length; %s++) {', i, node.items.length, i, name, i) |
|
visit(name+'['+i+']', node.additionalItems, reporter, filter) |
|
validate('}') |
|
} |
|
} |
|
|
|
if (node.format && fmts[node.format]) { |
|
if (type !== 'string' && formats[node.format]) validate('if (%s) {', types.string(name)) |
|
var n = gensym('format') |
|
scope[n] = fmts[node.format] |
|
|
|
if (typeof scope[n] === 'function') validate('if (!%s(%s)) {', n, name) |
|
else validate('if (!%s.test(%s)) {', n, name) |
|
error('must be '+node.format+' format') |
|
validate('}') |
|
if (type !== 'string' && formats[node.format]) validate('}') |
|
} |
|
|
|
if (Array.isArray(node.required)) { |
|
var isUndefined = function(req) { |
|
return genobj(name, req) + ' === undefined' |
|
} |
|
|
|
var checkRequired = function (req) { |
|
var prop = genobj(name, req); |
|
validate('if (%s === undefined) {', prop) |
|
error('is required', prop) |
|
validate('missing++') |
|
validate('}') |
|
} |
|
validate('if ((%s)) {', type !== 'object' ? types.object(name) : 'true') |
|
validate('var missing = 0') |
|
node.required.map(checkRequired) |
|
validate('}'); |
|
if (!greedy) { |
|
validate('if (missing === 0) {') |
|
indent++ |
|
} |
|
} |
|
|
|
if (node.uniqueItems) { |
|
if (type !== 'array') validate('if (%s) {', types.array(name)) |
|
validate('if (!(unique(%s))) {', name) |
|
error('must be unique') |
|
validate('}') |
|
if (type !== 'array') validate('}') |
|
} |
|
|
|
if (node.enum) { |
|
var complex = node.enum.some(function(e) { |
|
return typeof e === 'object' |
|
}) |
|
|
|
var compare = complex ? |
|
function(e) { |
|
return 'JSON.stringify('+name+')'+' !== JSON.stringify('+JSON.stringify(e)+')' |
|
} : |
|
function(e) { |
|
return name+' !== '+JSON.stringify(e) |
|
} |
|
|
|
validate('if (%s) {', node.enum.map(compare).join(' && ') || 'false') |
|
error('must be an enum value') |
|
validate('}') |
|
} |
|
|
|
if (node.dependencies) { |
|
if (type !== 'object') validate('if (%s) {', types.object(name)) |
|
|
|
Object.keys(node.dependencies).forEach(function(key) { |
|
var deps = node.dependencies[key] |
|
if (typeof deps === 'string') deps = [deps] |
|
|
|
var exists = function(k) { |
|
return genobj(name, k) + ' !== undefined' |
|
} |
|
|
|
if (Array.isArray(deps)) { |
|
validate('if (%s !== undefined && !(%s)) {', genobj(name, key), deps.map(exists).join(' && ') || 'true') |
|
error('dependencies not set') |
|
validate('}') |
|
} |
|
if (typeof deps === 'object') { |
|
validate('if (%s !== undefined) {', genobj(name, key)) |
|
visit(name, deps, reporter, filter) |
|
validate('}') |
|
} |
|
}) |
|
|
|
if (type !== 'object') validate('}') |
|
} |
|
|
|
if (node.additionalProperties || node.additionalProperties === false) { |
|
if (type !== 'object') validate('if (%s) {', types.object(name)) |
|
|
|
var i = genloop() |
|
var keys = gensym('keys') |
|
|
|
var toCompare = function(p) { |
|
return keys+'['+i+'] !== '+JSON.stringify(p) |
|
} |
|
|
|
var toTest = function(p) { |
|
return '!'+patterns(p)+'.test('+keys+'['+i+'])' |
|
} |
|
|
|
var additionalProp = Object.keys(properties || {}).map(toCompare) |
|
.concat(Object.keys(node.patternProperties || {}).map(toTest)) |
|
.join(' && ') || 'true' |
|
|
|
validate('var %s = Object.keys(%s)', keys, name) |
|
('for (var %s = 0; %s < %s.length; %s++) {', i, i, keys, i) |
|
('if (%s) {', additionalProp) |
|
|
|
if (node.additionalProperties === false) { |
|
if (filter) validate('delete %s', name+'['+keys+'['+i+']]') |
|
error('has additional properties', null, JSON.stringify(name+'.') + ' + ' + keys + '['+i+']') |
|
} else { |
|
visit(name+'['+keys+'['+i+']]', node.additionalProperties, reporter, filter) |
|
} |
|
|
|
validate |
|
('}') |
|
('}') |
|
|
|
if (type !== 'object') validate('}') |
|
} |
|
|
|
if (node.$ref) { |
|
var sub = get(root, opts && opts.schemas || {}, node.$ref) |
|
if (sub) { |
|
var fn = cache[node.$ref] |
|
if (!fn) { |
|
cache[node.$ref] = function proxy(data) { |
|
return fn(data) |
|
} |
|
fn = compile(sub, cache, root, false, opts) |
|
} |
|
var n = gensym('ref') |
|
scope[n] = fn |
|
validate('if (!(%s(%s))) {', n, name) |
|
error('referenced schema does not match') |
|
validate('}') |
|
} |
|
} |
|
|
|
if (node.not) { |
|
var prev = gensym('prev') |
|
validate('var %s = errors', prev) |
|
visit(name, node.not, false, filter) |
|
validate('if (%s === errors) {', prev) |
|
error('negative schema matches') |
|
validate('} else {') |
|
('errors = %s', prev) |
|
('}') |
|
} |
|
|
|
if (node.items && !tuple) { |
|
if (type !== 'array') validate('if (%s) {', types.array(name)) |
|
|
|
var i = genloop() |
|
validate('for (var %s = 0; %s < %s.length; %s++) {', i, i, name, i) |
|
visit(name+'['+i+']', node.items, reporter, filter) |
|
validate('}') |
|
|
|
if (type !== 'array') validate('}') |
|
} |
|
|
|
if (node.patternProperties) { |
|
if (type !== 'object') validate('if (%s) {', types.object(name)) |
|
var keys = gensym('keys') |
|
var i = genloop() |
|
validate |
|
('var %s = Object.keys(%s)', keys, name) |
|
('for (var %s = 0; %s < %s.length; %s++) {', i, i, keys, i) |
|
|
|
Object.keys(node.patternProperties).forEach(function(key) { |
|
var p = patterns(key) |
|
validate('if (%s.test(%s)) {', p, keys+'['+i+']') |
|
visit(name+'['+keys+'['+i+']]', node.patternProperties[key], reporter, filter) |
|
validate('}') |
|
}) |
|
|
|
validate('}') |
|
if (type !== 'object') validate('}') |
|
} |
|
|
|
if (node.pattern) { |
|
var p = patterns(node.pattern) |
|
if (type !== 'string') validate('if (%s) {', types.string(name)) |
|
validate('if (!(%s.test(%s))) {', p, name) |
|
error('pattern mismatch') |
|
validate('}') |
|
if (type !== 'string') validate('}') |
|
} |
|
|
|
if (node.allOf) { |
|
node.allOf.forEach(function(sch) { |
|
visit(name, sch, reporter, filter) |
|
}) |
|
} |
|
|
|
if (node.anyOf && node.anyOf.length) { |
|
var prev = gensym('prev') |
|
|
|
node.anyOf.forEach(function(sch, i) { |
|
if (i === 0) { |
|
validate('var %s = errors', prev) |
|
} else { |
|
validate('if (errors !== %s) {', prev) |
|
('errors = %s', prev) |
|
} |
|
visit(name, sch, false, false) |
|
}) |
|
node.anyOf.forEach(function(sch, i) { |
|
if (i) validate('}') |
|
}) |
|
validate('if (%s !== errors) {', prev) |
|
error('no schemas match') |
|
validate('}') |
|
} |
|
|
|
if (node.oneOf && node.oneOf.length) { |
|
var prev = gensym('prev') |
|
var passes = gensym('passes') |
|
|
|
validate |
|
('var %s = errors', prev) |
|
('var %s = 0', passes) |
|
|
|
node.oneOf.forEach(function(sch, i) { |
|
visit(name, sch, false, false) |
|
validate('if (%s === errors) {', prev) |
|
('%s++', passes) |
|
('} else {') |
|
('errors = %s', prev) |
|
('}') |
|
}) |
|
|
|
validate('if (%s !== 1) {', passes) |
|
error('no (or more than one) schemas match') |
|
validate('}') |
|
} |
|
|
|
if (node.multipleOf !== undefined) { |
|
if (type !== 'number' && type !== 'integer') validate('if (%s) {', types.number(name)) |
|
|
|
var factor = ((node.multipleOf | 0) !== node.multipleOf) ? Math.pow(10, node.multipleOf.toString().split('.').pop().length) : 1 |
|
if (factor > 1) validate('if ((%d*%s) % %d) {', factor, name, factor*node.multipleOf) |
|
else validate('if (%s % %d) {', name, node.multipleOf) |
|
|
|
error('has a remainder') |
|
validate('}') |
|
|
|
if (type !== 'number' && type !== 'integer') validate('}') |
|
} |
|
|
|
if (node.maxProperties !== undefined) { |
|
if (type !== 'object') validate('if (%s) {', types.object(name)) |
|
|
|
validate('if (Object.keys(%s).length > %d) {', name, node.maxProperties) |
|
error('has more properties than allowed') |
|
validate('}') |
|
|
|
if (type !== 'object') validate('}') |
|
} |
|
|
|
if (node.minProperties !== undefined) { |
|
if (type !== 'object') validate('if (%s) {', types.object(name)) |
|
|
|
validate('if (Object.keys(%s).length < %d) {', name, node.minProperties) |
|
error('has less properties than allowed') |
|
validate('}') |
|
|
|
if (type !== 'object') validate('}') |
|
} |
|
|
|
if (node.maxItems !== undefined) { |
|
if (type !== 'array') validate('if (%s) {', types.array(name)) |
|
|
|
validate('if (%s.length > %d) {', name, node.maxItems) |
|
error('has more items than allowed') |
|
validate('}') |
|
|
|
if (type !== 'array') validate('}') |
|
} |
|
|
|
if (node.minItems !== undefined) { |
|
if (type !== 'array') validate('if (%s) {', types.array(name)) |
|
|
|
validate('if (%s.length < %d) {', name, node.minItems) |
|
error('has less items than allowed') |
|
validate('}') |
|
|
|
if (type !== 'array') validate('}') |
|
} |
|
|
|
if (node.maxLength !== undefined) { |
|
if (type !== 'string') validate('if (%s) {', types.string(name)) |
|
|
|
validate('if (%s.length > %d) {', name, node.maxLength) |
|
error('has longer length than allowed') |
|
validate('}') |
|
|
|
if (type !== 'string') validate('}') |
|
} |
|
|
|
if (node.minLength !== undefined) { |
|
if (type !== 'string') validate('if (%s) {', types.string(name)) |
|
|
|
validate('if (%s.length < %d) {', name, node.minLength) |
|
error('has less length than allowed') |
|
validate('}') |
|
|
|
if (type !== 'string') validate('}') |
|
} |
|
|
|
if (node.minimum !== undefined) { |
|
validate('if (%s %s %d) {', name, node.exclusiveMinimum ? '<=' : '<', node.minimum) |
|
error('is less than minimum') |
|
validate('}') |
|
} |
|
|
|
if (node.maximum !== undefined) { |
|
validate('if (%s %s %d) {', name, node.exclusiveMaximum ? '>=' : '>', node.maximum) |
|
error('is more than maximum') |
|
validate('}') |
|
} |
|
|
|
if (properties) { |
|
Object.keys(properties).forEach(function(p) { |
|
visit(genobj(name, p), properties[p], reporter, filter) |
|
}) |
|
} |
|
|
|
while (indent--) validate('}') |
|
} |
|
|
|
var validate = genfun |
|
('function validate(data) {') |
|
('validate.errors = null') |
|
('var errors = 0') |
|
|
|
visit('data', schema, reporter, opts && opts.filter) |
|
|
|
validate |
|
('return errors === 0') |
|
('}') |
|
|
|
validate = validate.toFunction(scope) |
|
validate.errors = null |
|
|
|
validate.__defineGetter__('error', function() { |
|
if (!validate.errors) return '' |
|
return validate.errors |
|
.map(function(err) { |
|
return err.field+' '+err.message |
|
}) |
|
.join('\n') |
|
}) |
|
|
|
validate.toJSON = function() { |
|
return schema |
|
} |
|
|
|
return validate |
|
} |
|
|
|
module.exports = function(schema, opts) { |
|
if (typeof schema === 'string') schema = JSON.parse(schema) |
|
return compile(schema, {}, schema, true, opts) |
|
} |
|
|
|
module.exports.filter = function(schema, opts) { |
|
var validate = module.exports(schema, xtend(opts, {filter: true})) |
|
return function(sch) { |
|
validate(sch) |
|
return sch |
|
} |
|
} |
|
|
|
},{"./formats":79,"generate-function":81,"generate-object-property":82,"jsonpointer":84,"xtend":85}],81:[function(require,module,exports){ |
|
var util = require('util') |
|
|
|
var INDENT_START = /[\{\[]/ |
|
var INDENT_END = /[\}\]]/ |
|
|
|
module.exports = function() { |
|
var lines = [] |
|
var indent = 0 |
|
|
|
var push = function(str) { |
|
var spaces = '' |
|
while (spaces.length < indent*2) spaces += ' ' |
|
lines.push(spaces+str) |
|
} |
|
|
|
var line = function(fmt) { |
|
if (!fmt) return line |
|
|
|
if (INDENT_END.test(fmt.trim()[0]) && INDENT_START.test(fmt[fmt.length-1])) { |
|
indent-- |
|
push(util.format.apply(util, arguments)) |
|
indent++ |
|
return line |
|
} |
|
if (INDENT_START.test(fmt[fmt.length-1])) { |
|
push(util.format.apply(util, arguments)) |
|
indent++ |
|
return line |
|
} |
|
if (INDENT_END.test(fmt.trim()[0])) { |
|
indent-- |
|
push(util.format.apply(util, arguments)) |
|
return line |
|
} |
|
|
|
push(util.format.apply(util, arguments)) |
|
return line |
|
} |
|
|
|
line.toString = function() { |
|
return lines.join('\n') |
|
} |
|
|
|
line.toFunction = function(scope) { |
|
var src = 'return ('+line.toString()+')' |
|
|
|
var keys = Object.keys(scope || {}).map(function(key) { |
|
return key |
|
}) |
|
|
|
var vals = keys.map(function(key) { |
|
return scope[key] |
|
}) |
|
|
|
return Function.apply(null, keys.concat(src)).apply(null, vals) |
|
} |
|
|
|
if (arguments.length) line.apply(null, arguments) |
|
|
|
return line |
|
} |
|
|
|
},{"util":343}],82:[function(require,module,exports){ |
|
var isProperty = require('is-property') |
|
|
|
var gen = function(obj, prop) { |
|
return isProperty(prop) ? obj+'.'+prop : obj+'['+JSON.stringify(prop)+']' |
|
} |
|
|
|
gen.valid = isProperty |
|
module.exports = gen |
|
},{"is-property":83}],83:[function(require,module,exports){ |
|
"use strict" |
|
function isProperty(str) { |
|
return /^[$A-Z\_a-z\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0\u08a2-\u08ac\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0977\u0979-\u097f\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c33\u0c35-\u0c39\u0c3d\u0c58\u0c59\u0c60\u0c61\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d60\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f4\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f0\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191c\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19c1-\u19c7\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2119-\u211d\u2124\u2126\u2128\u212a-\u212d\u212f-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u2e2f\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309d-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fcc\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua697\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua78e\ua790-\ua793\ua7a0-\ua7aa\ua7f8-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa80-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uabc0-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc][$A-Z\_a-z\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0\u08a2-\u08ac\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0977\u0979-\u097f\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c33\u0c35-\u0c39\u0c3d\u0c58\u0c59\u0c60\u0c61\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d60\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f4\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f0\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191c\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19c1-\u19c7\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2119-\u211d\u2124\u2126\u2128\u212a-\u212d\u212f-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u2e2f\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309d-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fcc\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua697\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua78e\ua790-\ua793\ua7a0-\ua7aa\ua7f8-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa80-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uabc0-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc0-9\u0300-\u036f\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08e4-\u08fe\u0900-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c01-\u0c03\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c82\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d02\u0d03\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0eb9\u0ebb\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19b0-\u19c0\u19c8\u19c9\u19d0-\u19d9\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf2-\u1cf4\u1dc0-\u1de6\u1dfc-\u1dff\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c4\ua8d0-\ua8d9\ua8e0-\ua8f1\ua900-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe26\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f]*$/.test(str) |
|
} |
|
module.exports = isProperty |
|
},{}],84:[function(require,module,exports){ |
|
var console = require("console"); |
|
|
|
var untilde = function(str) { |
|
return str.replace(/~./g, function(m) { |
|
switch (m) { |
|
case "~0": |
|
return "~"; |
|
case "~1": |
|
return "/"; |
|
} |
|
throw("Invalid tilde escape: " + m); |
|
}); |
|
} |
|
|
|
var traverse = function(obj, pointer, value) { |
|
// assert(isArray(pointer)) |
|
var part = untilde(pointer.shift()); |
|
if(typeof obj[part] === "undefined") { |
|
throw("Value for pointer '" + pointer + "' not found."); |
|
return; |
|
} |
|
if(pointer.length !== 0) { // keep traversin! |
|
return traverse(obj[part], pointer, value); |
|
} |
|
// we're done |
|
if(typeof value === "undefined") { |
|
// just reading |
|
return obj[part]; |
|
} |
|
// set new value, return old value |
|
var old_value = obj[part]; |
|
if(value === null) { |
|
delete obj[part]; |
|
} else { |
|
obj[part] = value; |
|
} |
|
return old_value; |
|
} |
|
|
|
var validate_input = function(obj, pointer) { |
|
if(typeof obj !== "object") { |
|
throw("Invalid input object."); |
|
} |
|
|
|
if(pointer === "") { |
|
return []; |
|
} |
|
|
|
if(!pointer) { |
|
throw("Invalid JSON pointer."); |
|
} |
|
|
|
pointer = pointer.split("/"); |
|
var first = pointer.shift(); |
|
if (first !== "") { |
|
throw("Invalid JSON pointer."); |
|
} |
|
|
|
return pointer; |
|
} |
|
|
|
var get = function(obj, pointer) { |
|
pointer = validate_input(obj, pointer); |
|
if (pointer.length === 0) { |
|
return obj; |
|
} |
|
return traverse(obj, pointer); |
|
} |
|
|
|
var set = function(obj, pointer, value) { |
|
pointer = validate_input(obj, pointer); |
|
if (pointer.length === 0) { |
|
throw("Invalid JSON pointer for set.") |
|
} |
|
return traverse(obj, pointer, value); |
|
} |
|
|
|
exports.get = get |
|
exports.set = set |
|
|
|
},{"console":176}],85:[function(require,module,exports){ |
|
module.exports = extend |
|
|
|
function extend() { |
|
var target = {} |
|
|
|
for (var i = 0; i < arguments.length; i++) { |
|
var source = arguments[i] |
|
|
|
for (var key in source) { |
|
if (source.hasOwnProperty(key)) { |
|
target[key] = source[key] |
|
} |
|
} |
|
} |
|
|
|
return target |
|
} |
|
|
|
},{}],86:[function(require,module,exports){ |
|
'use strict' |
|
|
|
function ValidationError (errors) { |
|
this.name = 'ValidationError' |
|
this.errors = errors |
|
} |
|
|
|
ValidationError.prototype = Error.prototype |
|
|
|
module.exports = ValidationError |
|
|
|
},{}],87:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var schemas = require('./schemas') |
|
var ValidationError = require('./error') |
|
var validator = require('is-my-json-valid') |
|
|
|
var runner = function (schema, data, cb) { |
|
var validate = validator(schema, { |
|
greedy: true, |
|
verbose: true, |
|
schemas: schemas |
|
}) |
|
|
|
var valid = false |
|
|
|
if (data !== undefined) { |
|
// execute is-my-json-valid |
|
valid = validate(data) |
|
} |
|
|
|
// callback? |
|
if (!cb) { |
|
return validate.errors ? false : true |
|
} else { |
|
return cb(validate.errors ? new ValidationError(validate.errors) : null, valid) |
|
} |
|
|
|
return valid |
|
} |
|
|
|
module.exports = function (data, cb) { |
|
return runner(schemas.har, data, cb) |
|
} |
|
|
|
Object.keys(schemas).map(function (name) { |
|
module.exports[name] = function (data, cb) { |
|
return runner(schemas[name], data, cb) |
|
} |
|
}) |
|
|
|
},{"./error":86,"./schemas":95,"is-my-json-valid":80}],88:[function(require,module,exports){ |
|
module.exports={ |
|
"properties": { |
|
"beforeRequest": { |
|
"$ref": "#cacheEntry" |
|
}, |
|
"afterRequest": { |
|
"$ref": "#cacheEntry" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],89:[function(require,module,exports){ |
|
module.exports={ |
|
"optional": true, |
|
"required": [ |
|
"lastAccess", |
|
"eTag", |
|
"hitCount" |
|
], |
|
"properties": { |
|
"expires": { |
|
"type": "string" |
|
}, |
|
"lastAccess": { |
|
"type": "string" |
|
}, |
|
"eTag": { |
|
"type": "string" |
|
}, |
|
"hitCount": { |
|
"type": "integer" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],90:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"size", |
|
"mimeType" |
|
], |
|
"properties": { |
|
"size": { |
|
"type": "integer" |
|
}, |
|
"compression": { |
|
"type": "integer" |
|
}, |
|
"mimeType": { |
|
"type": "string" |
|
}, |
|
"text": { |
|
"type": "string" |
|
}, |
|
"encoding": { |
|
"type": "string" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],91:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"name", |
|
"value" |
|
], |
|
"properties": { |
|
"name": { |
|
"type": "string" |
|
}, |
|
"value": { |
|
"type": "string" |
|
}, |
|
"path": { |
|
"type": "string" |
|
}, |
|
"domain": { |
|
"type": "string" |
|
}, |
|
"expires": { |
|
"type": ["string", "null"], |
|
"format": "date-time" |
|
}, |
|
"httpOnly": { |
|
"type": "boolean" |
|
}, |
|
"secure": { |
|
"type": "boolean" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],92:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"name", |
|
"version" |
|
], |
|
"properties": { |
|
"name": { |
|
"type": "string" |
|
}, |
|
"version": { |
|
"type": "string" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],93:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"optional": true, |
|
"required": [ |
|
"startedDateTime", |
|
"time", |
|
"request", |
|
"response", |
|
"cache", |
|
"timings" |
|
], |
|
"properties": { |
|
"pageref": { |
|
"type": "string" |
|
}, |
|
"startedDateTime": { |
|
"type": "string", |
|
"format": "date-time", |
|
"pattern": "^(\\d{4})(-)?(\\d\\d)(-)?(\\d\\d)(T)?(\\d\\d)(:)?(\\d\\d)(:)?(\\d\\d)(\\.\\d+)?(Z|([+-])(\\d\\d)(:)?(\\d\\d))" |
|
}, |
|
"time": { |
|
"type": "number", |
|
"min": 0 |
|
}, |
|
"request": { |
|
"$ref": "#request" |
|
}, |
|
"response": { |
|
"$ref": "#response" |
|
}, |
|
"cache": { |
|
"$ref": "#cache" |
|
}, |
|
"timings": { |
|
"$ref": "#timings" |
|
}, |
|
"serverIPAddress": { |
|
"type": "string", |
|
"format": "ipv4" |
|
}, |
|
"connection": { |
|
"type": "string" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],94:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"log" |
|
], |
|
"properties": { |
|
"log": { |
|
"$ref": "#log" |
|
} |
|
} |
|
} |
|
|
|
},{}],95:[function(require,module,exports){ |
|
'use strict' |
|
|
|
var schemas = { |
|
cache: require('./cache.json'), |
|
cacheEntry: require('./cacheEntry.json'), |
|
content: require('./content.json'), |
|
cookie: require('./cookie.json'), |
|
creator: require('./creator.json'), |
|
entry: require('./entry.json'), |
|
har: require('./har.json'), |
|
log: require('./log.json'), |
|
page: require('./page.json'), |
|
pageTimings: require('./pageTimings.json'), |
|
postData: require('./postData.json'), |
|
record: require('./record.json'), |
|
request: require('./request.json'), |
|
response: require('./response.json'), |
|
timings: require('./timings.json') |
|
} |
|
|
|
// is-my-json-valid does not provide meaningful error messages for external schemas |
|
// this is a workaround |
|
schemas.cache.properties.beforeRequest = schemas.cacheEntry |
|
schemas.cache.properties.afterRequest = schemas.cacheEntry |
|
|
|
schemas.page.properties.pageTimings = schemas.pageTimings |
|
|
|
schemas.request.properties.cookies.items = schemas.cookie |
|
schemas.request.properties.headers.items = schemas.record |
|
schemas.request.properties.queryString.items = schemas.record |
|
schemas.request.properties.postData = schemas.postData |
|
|
|
schemas.response.properties.cookies.items = schemas.cookie |
|
schemas.response.properties.headers.items = schemas.record |
|
schemas.response.properties.content = schemas.content |
|
|
|
schemas.entry.properties.request = schemas.request |
|
schemas.entry.properties.response = schemas.response |
|
schemas.entry.properties.cache = schemas.cache |
|
schemas.entry.properties.timings = schemas.timings |
|
|
|
schemas.log.properties.creator = schemas.creator |
|
schemas.log.properties.browser = schemas.creator |
|
schemas.log.properties.pages.items = schemas.page |
|
schemas.log.properties.entries.items = schemas.entry |
|
|
|
schemas.har.properties.log = schemas.log |
|
|
|
module.exports = schemas |
|
|
|
},{"./cache.json":88,"./cacheEntry.json":89,"./content.json":90,"./cookie.json":91,"./creator.json":92,"./entry.json":93,"./har.json":94,"./log.json":96,"./page.json":97,"./pageTimings.json":98,"./postData.json":99,"./record.json":100,"./request.json":101,"./response.json":102,"./timings.json":103}],96:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"version", |
|
"creator", |
|
"entries" |
|
], |
|
"properties": { |
|
"version": { |
|
"type": "string" |
|
}, |
|
"creator": { |
|
"$ref": "#creator" |
|
}, |
|
"browser": { |
|
"$ref": "#creator" |
|
}, |
|
"pages": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#page" |
|
} |
|
}, |
|
"entries": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#entry" |
|
} |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],97:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"optional": true, |
|
"required": [ |
|
"startedDateTime", |
|
"id", |
|
"title", |
|
"pageTimings" |
|
], |
|
"properties": { |
|
"startedDateTime": { |
|
"type": "string", |
|
"format": "date-time", |
|
"pattern": "^(\\d{4})(-)?(\\d\\d)(-)?(\\d\\d)(T)?(\\d\\d)(:)?(\\d\\d)(:)?(\\d\\d)(\\.\\d+)?(Z|([+-])(\\d\\d)(:)?(\\d\\d))" |
|
}, |
|
"id": { |
|
"type": "string", |
|
"unique": true |
|
}, |
|
"title": { |
|
"type": "string" |
|
}, |
|
"pageTimings": { |
|
"$ref": "#pageTimings" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],98:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"properties": { |
|
"onContentLoad": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"onLoad": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],99:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"optional": true, |
|
"required": [ |
|
"mimeType" |
|
], |
|
"properties": { |
|
"mimeType": { |
|
"type": "string" |
|
}, |
|
"text": { |
|
"type": "string" |
|
}, |
|
"params": { |
|
"type": "array", |
|
"required": [ |
|
"name" |
|
], |
|
"properties": { |
|
"name": { |
|
"type": "string" |
|
}, |
|
"value": { |
|
"type": "string" |
|
}, |
|
"fileName": { |
|
"type": "string" |
|
}, |
|
"contentType": { |
|
"type": "string" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],100:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"name", |
|
"value" |
|
], |
|
"properties": { |
|
"name": { |
|
"type": "string" |
|
}, |
|
"value": { |
|
"type": "string" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],101:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"method", |
|
"url", |
|
"httpVersion", |
|
"cookies", |
|
"headers", |
|
"queryString", |
|
"headersSize", |
|
"bodySize" |
|
], |
|
"properties": { |
|
"method": { |
|
"type": "string" |
|
}, |
|
"url": { |
|
"type": "string", |
|
"format": "uri" |
|
}, |
|
"httpVersion": { |
|
"type": "string" |
|
}, |
|
"cookies": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#cookie" |
|
} |
|
}, |
|
"headers": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#record" |
|
} |
|
}, |
|
"queryString": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#record" |
|
} |
|
}, |
|
"postData": { |
|
"$ref": "#postData" |
|
}, |
|
"headersSize": { |
|
"type": "integer" |
|
}, |
|
"bodySize": { |
|
"type": "integer" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],102:[function(require,module,exports){ |
|
module.exports={ |
|
"type": "object", |
|
"required": [ |
|
"status", |
|
"statusText", |
|
"httpVersion", |
|
"cookies", |
|
"headers", |
|
"content", |
|
"redirectURL", |
|
"headersSize", |
|
"bodySize" |
|
], |
|
"properties": { |
|
"status": { |
|
"type": "integer" |
|
}, |
|
"statusText": { |
|
"type": "string" |
|
}, |
|
"httpVersion": { |
|
"type": "string" |
|
}, |
|
"cookies": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#cookie" |
|
} |
|
}, |
|
"headers": { |
|
"type": "array", |
|
"items": { |
|
"$ref": "#record" |
|
} |
|
}, |
|
"content": { |
|
"$ref": "#content" |
|
}, |
|
"redirectURL": { |
|
"type": "string" |
|
}, |
|
"headersSize": { |
|
"type": "integer" |
|
}, |
|
"bodySize": { |
|
"type": "integer" |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],103:[function(require,module,exports){ |
|
module.exports={ |
|
"required": [ |
|
"send", |
|
"wait", |
|
"receive" |
|
], |
|
"properties": { |
|
"dns": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"connect": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"blocked": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"send": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"wait": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"receive": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"ssl": { |
|
"type": "number", |
|
"min": -1 |
|
}, |
|
"comment": { |
|
"type": "string" |
|
} |
|
} |
|
} |
|
|
|
},{}],104:[function(require,module,exports){ |
|
/* |
|
HTTP Hawk Authentication Scheme |
|
Copyright (c) 2012-2014, Eran Hammer <eran@hammer.io> |
|
BSD Licensed |
|
*/ |
|
|
|
|
|
// Declare namespace |
|
|
|
var hawk = { |
|
internals: {} |
|
}; |
|
|
|
|
|
hawk.client = { |
|
|
|
// Generate an Authorization header for a given request |
|
|
|
/* |
|
uri: 'http://example.com/resource?a=b' or object generated by hawk.utils.parseUri() |
|
method: HTTP verb (e.g. 'GET', 'POST') |
|
options: { |
|
|
|
// Required |
|
|
|
credentials: { |
|
id: 'dh37fgj492je', |
|
key: 'aoijedoaijsdlaksjdl', |
|
algorithm: 'sha256' // 'sha1', 'sha256' |
|
}, |
|
|
|
// Optional |
|
|
|
ext: 'application-specific', // Application specific data sent via the ext attribute |
|
timestamp: Date.now() / 1000, // A pre-calculated timestamp in seconds |
|
nonce: '2334f34f', // A pre-generated nonce |
|
localtimeOffsetMsec: 400, // Time offset to sync with server time (ignored if timestamp provided) |
|
payload: '{"some":"payload"}', // UTF-8 encoded string for body hash generation (ignored if hash provided) |
|
contentType: 'application/json', // Payload content-type (ignored if hash provided) |
|
hash: 'U4MKKSmiVxk37JCCrAVIjV=', // Pre-calculated payload hash |
|
app: '24s23423f34dx', // Oz application id |
|
dlg: '234sz34tww3sd' // Oz delegated-by application id |
|
} |
|
*/ |
|
|
|
header: function (uri, method, options) { |
|
|
|
var result = { |
|
field: '', |
|
artifacts: {} |
|
}; |
|
|
|
// Validate inputs |
|
|
|
if (!uri || (typeof uri !== 'string' && typeof uri !== 'object') || |
|
!method || typeof method !== 'string' || |
|
!options || typeof options !== 'object') { |
|
|
|
result.err = 'Invalid argument type'; |
|
return result; |
|
} |
|
|
|
// Application time |
|
|
|
var timestamp = options.timestamp || hawk.utils.now(options.localtimeOffsetMsec); |
|
|
|
// Validate credentials |
|
|
|
var credentials = options.credentials; |
|
if (!credentials || |
|
!credentials.id || |
|
!credentials.key || |
|
!credentials.algorithm) { |
|
|
|
result.err = 'Invalid credentials object'; |
|
return result; |
|
} |
|
|
|
if (hawk.crypto.algorithms.indexOf(credentials.algorithm) === -1) { |
|
result.err = 'Unknown algorithm'; |
|
return result; |
|
} |
|
|
|
// Parse URI |
|
|
|
if (typeof uri === 'string') { |
|
uri = hawk.utils.parseUri(uri); |
|
} |
|
|
|
// Calculate signature |
|
|
|
var artifacts = { |
|
ts: timestamp, |
|
nonce: options.nonce || hawk.utils.randomString(6), |
|
method: method, |
|
resource: uri.relative, |
|
host: uri.hostname, |
|
port: uri.port, |
|
hash: options.hash, |
|
ext: options.ext, |
|
app: options.app, |
|
dlg: options.dlg |
|
}; |
|
|
|
result.artifacts = artifacts; |
|
|
|
// Calculate payload hash |
|
|
|
if (!artifacts.hash && |
|
(options.payload || options.payload === '')) { |
|
|
|
artifacts.hash = hawk.crypto.calculatePayloadHash(options.payload, credentials.algorithm, options.contentType); |
|
} |
|
|
|
var mac = hawk.crypto.calculateMac('header', credentials, artifacts); |
|
|
|
// Construct header |
|
|
|
var hasExt = artifacts.ext !== null && artifacts.ext !== undefined && artifacts.ext !== ''; // Other falsey values allowed |
|
var header = 'Hawk id="' + credentials.id + |
|
'", ts="' + artifacts.ts + |
|
'", nonce="' + artifacts.nonce + |
|
(artifacts.hash ? '", hash="' + artifacts.hash : '') + |
|
(hasExt ? '", ext="' + hawk.utils.escapeHeaderAttribute(artifacts.ext) : '') + |
|
'", mac="' + mac + '"'; |
|
|
|
if (artifacts.app) { |
|
header += ', app="' + artifacts.app + |
|
(artifacts.dlg ? '", dlg="' + artifacts.dlg : '') + '"'; |
|
} |
|
|
|
result.field = header; |
|
|
|
return result; |
|
}, |
|
|
|
// Generate a bewit value for a given URI |
|
|
|
/* |
|
uri: 'http://example.com/resource?a=b' |
|
options: { |
|
|
|
// Required |
|
|
|
credentials: { |
|
id: 'dh37fgj492je', |
|
key: 'aoijedoaijsdlaksjdl', |
|
algorithm: 'sha256' // 'sha1', 'sha256' |
|
}, |
|
ttlSec: 60 * 60, // TTL in seconds |
|
|
|
// Optional |
|
|
|
ext: 'application-specific', // Application specific data sent via the ext attribute |
|
localtimeOffsetMsec: 400 // Time offset to sync with server time |
|
}; |
|
*/ |
|
|
|
bewit: function (uri, options) { |
|
|
|
// Validate inputs |
|
|
|
if (!uri || |
|
(typeof uri !== 'string') || |
|
!options || |
|
typeof options !== 'object' || |
|
!options.ttlSec) { |
|
|
|
return ''; |
|
} |
|
|
|
options.ext = (options.ext === null || options.ext === undefined ? '' : options.ext); // Zero is valid value |
|
|
|
// Application time |
|
|
|
var now = hawk.utils.now(options.localtimeOffsetMsec); |
|
|
|
// Validate credentials |
|
|
|
var credentials = options.credentials; |
|
if (!credentials || |
|
!credentials.id || |
|
!credentials.key || |
|
!credentials.algorithm) { |
|
|
|
return ''; |
|
} |
|
|
|
if (hawk.crypto.algorithms.indexOf(credentials.algorithm) === -1) { |
|
return ''; |
|
} |
|
|
|
// Parse URI |
|
|
|
uri = hawk.utils.parseUri(uri); |
|
|
|
// Calculate signature |
|
|
|
var exp = now + options.ttlSec; |
|
var mac = hawk.crypto.calculateMac('bewit', credentials, { |
|
ts: exp, |
|
nonce: '', |
|
method: 'GET', |
|
resource: uri.relative, // Maintain trailing '?' and query params |
|
host: uri.hostname, |
|
port: uri.port, |
|
ext: options.ext |
|
}); |
|
|
|
// Construct bewit: id\exp\mac\ext |
|
|
|
var bewit = credentials.id + '\\' + exp + '\\' + mac + '\\' + options.ext; |
|
return hawk.utils.base64urlEncode(bewit); |
|
}, |
|
|
|
// Validate server response |
|
|
|
/* |
|
request: object created via 'new XMLHttpRequest()' after response received |
|
artifacts: object received from header().artifacts |
|
options: { |
|
payload: optional payload received |
|
required: specifies if a Server-Authorization header is required. Defaults to 'false' |
|
} |
|
*/ |
|
|
|
authenticate: function (request, credentials, artifacts, options) { |
|
|
|
options = options || {}; |
|
|
|
var getHeader = function (name) { |
|
|
|
return request.getResponseHeader ? request.getResponseHeader(name) : request.getHeader(name); |
|
}; |
|
|
|
var wwwAuthenticate = getHeader('www-authenticate'); |
|
if (wwwAuthenticate) { |
|
|
|
// Parse HTTP WWW-Authenticate header |
|
|
|
var attributes = hawk.utils.parseAuthorizationHeader(wwwAuthenticate, ['ts', 'tsm', 'error']); |
|
if (!attributes) { |
|
return false; |
|
} |
|
|
|
if (attributes.ts) { |
|
var tsm = hawk.crypto.calculateTsMac(attributes.ts, credentials); |
|
if (tsm !== attributes.tsm) { |
|
return false; |
|
} |
|
|
|
hawk.utils.setNtpOffset(attributes.ts - Math.floor((new Date()).getTime() / 1000)); // Keep offset at 1 second precision |
|
} |
|
} |
|
|
|
// Parse HTTP Server-Authorization header |
|
|
|
var serverAuthorization = getHeader('server-authorization'); |
|
if (!serverAuthorization && |
|
!options.required) { |
|
|
|
return true; |
|
} |
|
|
|
var attributes = hawk.utils.parseAuthorizationHeader(serverAuthorization, ['mac', 'ext', 'hash']); |
|
if (!attributes) { |
|
return false; |
|
} |
|
|
|
var modArtifacts = { |
|
ts: artifacts.ts, |
|
nonce: artifacts.nonce, |
|
method: artifacts.method, |
|
resource: artifacts.resource, |
|
host: artifacts.host, |
|
port: artifacts.port, |
|
hash: attributes.hash, |
|
ext: attributes.ext, |
|
app: artifacts.app, |
|
dlg: artifacts.dlg |
|
}; |
|
|
|
var mac = hawk.crypto.calculateMac('response', credentials, modArtifacts); |
|
if (mac !== attributes.mac) { |
|
return false; |
|
} |
|
|
|
if (!options.payload && |
|
options.payload !== '') { |
|
|
|
return true; |
|
} |
|
|
|
if (!attributes.hash) { |
|
return false; |
|
} |
|
|
|
var calculatedHash = hawk.crypto.calculatePayloadHash(options.payload, credentials.algorithm, getHeader('content-type')); |
|
return (calculatedHash === attributes.hash); |
|
}, |
|
|
|
message: function (host, port, message, options) { |
|
|
|
// Validate inputs |
|
|
|
if (!host || typeof host !== 'string' || |
|
!port || typeof port !== 'number' || |
|
message === null || message === undefined || typeof message !== 'string' || |
|
!options || typeof options !== 'object') { |
|
|
|
return null; |
|
} |
|
|
|
// Application time |
|
|
|
var timestamp = options.timestamp || hawk.utils.now(options.localtimeOffsetMsec); |
|
|
|
// Validate credentials |
|
|
|
var credentials = options.credentials; |
|
if (!credentials || |
|
!credentials.id || |
|
!credentials.key || |
|
!credentials.algorithm) { |
|
|
|
// Invalid credential object |
|
return null; |
|
} |
|
|
|
if (hawk.crypto.algorithms.indexOf(credentials.algorithm) === -1) { |
|
return null; |
|
} |
|
|
|
// Calculate signature |
|
|
|
var artifacts = { |
|
ts: timestamp, |
|
nonce: options.nonce || hawk.utils.randomString(6), |
|
host: host, |
|
port: port, |
|
hash: hawk.crypto.calculatePayloadHash(message, credentials.algorithm) |
|
}; |
|
|
|
// Construct authorization |
|
|
|
var result = { |
|
id: credentials.id, |
|
ts: artifacts.ts, |
|
nonce: artifacts.nonce, |
|
hash: artifacts.hash, |
|
mac: hawk.crypto.calculateMac('message', credentials, artifacts) |
|
}; |
|
|
|
return result; |
|
}, |
|
|
|
authenticateTimestamp: function (message, credentials, updateClock) { // updateClock defaults to true |
|
|
|
var tsm = hawk.crypto.calculateTsMac(message.ts, credentials); |
|
if (tsm !== message.tsm) { |
|
return false; |
|
} |
|
|
|
if (updateClock !== false) { |
|
hawk.utils.setNtpOffset(message.ts - Math.floor((new Date()).getTime() / 1000)); // Keep offset at 1 second precision |
|
} |
|
|
|
return true; |
|
} |
|
}; |
|
|
|
|
|
hawk.crypto = { |
|
|
|
headerVersion: '1', |
|
|
|
algorithms: ['sha1', 'sha256'], |
|
|
|
calculateMac: function (type, credentials, options) { |
|
|
|
var normalized = hawk.crypto.generateNormalizedString(type, options); |
|
|
|
var hmac = CryptoJS['Hmac' + credentials.algorithm.toUpperCase()](normalized, credentials.key); |
|
return hmac.toString(CryptoJS.enc.Base64); |
|
}, |
|
|
|
generateNormalizedString: function (type, options) { |
|
|
|
var normalized = 'hawk.' + hawk.crypto.headerVersion + '.' + type + '\n' + |
|
options.ts + '\n' + |
|
options.nonce + '\n' + |
|
(options.method || '').toUpperCase() + '\n' + |
|
(options.resource || '') + '\n' + |
|
options.host.toLowerCase() + '\n' + |
|
options.port + '\n' + |
|
(options.hash || '') + '\n'; |
|
|
|
if (options.ext) { |
|
normalized += options.ext.replace('\\', '\\\\').replace('\n', '\\n'); |
|
} |
|
|
|
normalized += '\n'; |
|
|
|
if (options.app) { |
|
normalized += options.app + '\n' + |
|
(options.dlg || '') + '\n'; |
|
} |
|
|
|
return normalized; |
|
}, |
|
|
|
calculatePayloadHash: function (payload, algorithm, contentType) { |
|
|
|
var hash = CryptoJS.algo[algorithm.toUpperCase()].create(); |
|
hash.update('hawk.' + hawk.crypto.headerVersion + '.payload\n'); |
|
hash.update(hawk.utils.parseContentType(contentType) + '\n'); |
|
hash.update(payload); |
|
hash.update('\n'); |
|
return hash.finalize().toString(CryptoJS.enc.Base64); |
|
}, |
|
|
|
calculateTsMac: function (ts, credentials) { |
|
|
|
var hash = CryptoJS['Hmac' + credentials.algorithm.toUpperCase()]('hawk.' + hawk.crypto.headerVersion + '.ts\n' + ts + '\n', credentials.key); |
|
return hash.toString(CryptoJS.enc.Base64); |
|
} |
|
}; |
|
|
|
|
|
// localStorage compatible interface |
|
|
|
hawk.internals.LocalStorage = function () { |
|
|
|
this._cache = {}; |
|
this.length = 0; |
|
|
|
this.getItem = function (key) { |
|
|
|
return this._cache.hasOwnProperty(key) ? String(this._cache[key]) : null; |
|
}; |
|
|
|
this.setItem = function (key, value) { |
|
|
|
this._cache[key] = String(value); |
|
this.length = Object.keys(this._cache).length; |
|
}; |
|
|
|
this.removeItem = function (key) { |
|
|
|
delete this._cache[key]; |
|
this.length = Object.keys(this._cache).length; |
|
}; |
|
|
|
this.clear = function () { |
|
|
|
this._cache = {}; |
|
this.length = 0; |
|
}; |
|
|
|
this.key = function (i) { |
|
|
|
return Object.keys(this._cache)[i || 0]; |
|
}; |
|
}; |
|
|
|
|
|
hawk.utils = { |
|
|
|
storage: new hawk.internals.LocalStorage(), |
|
|
|
setStorage: function (storage) { |
|
|
|
var ntpOffset = hawk.utils.storage.getItem('hawk_ntp_offset'); |
|
hawk.utils.storage = storage; |
|
if (ntpOffset) { |
|
hawk.utils.setNtpOffset(ntpOffset); |
|
} |
|
}, |
|
|
|
setNtpOffset: function (offset) { |
|
|
|
try { |
|
hawk.utils.storage.setItem('hawk_ntp_offset', offset); |
|
} |
|
catch (err) { |
|
console.error('[hawk] could not write to storage.'); |
|
console.error(err); |
|
} |
|
}, |
|
|
|
getNtpOffset: function () { |
|
|
|
var offset = hawk.utils.storage.getItem('hawk_ntp_offset'); |
|
if (!offset) { |
|
return 0; |
|
} |
|
|
|
return parseInt(offset, 10); |
|
}, |
|
|
|
now: function (localtimeOffsetMsec) { |
|
|
|
return Math.floor(((new Date()).getTime() + (localtimeOffsetMsec || 0)) / 1000) + hawk.utils.getNtpOffset(); |
|
}, |
|
|
|
escapeHeaderAttribute: function (attribute) { |
|
|
|
return attribute.replace(/\\/g, '\\\\').replace(/\"/g, '\\"'); |
|
}, |
|
|
|
parseContentType: function (header) { |
|
|
|
if (!header) { |
|
return ''; |
|
} |
|
|
|
return header.split(';')[0].replace(/^\s+|\s+$/g, '').toLowerCase(); |
|
}, |
|
|
|
parseAuthorizationHeader: function (header, keys) { |
|
|
|
if (!header) { |
|
return null; |
|
} |
|
|
|
var headerParts = header.match(/^(\w+)(?:\s+(.*))?$/); // Header: scheme[ something] |
|
if (!headerParts) { |
|
return null; |
|
} |
|
|
|
var scheme = headerParts[1]; |
|
if (scheme.toLowerCase() !== 'hawk') { |
|
return null; |
|
} |
|
|
|
var attributesString = headerParts[2]; |
|
if (!attributesString) { |
|
return null; |
|
} |
|
|
|
var attributes = {}; |
|
var verify = attributesString.replace(/(\w+)="([^"\\]*)"\s*(?:,\s*|$)/g, function ($0, $1, $2) { |
|
|
|
// Check valid attribute names |
|
|
|
if (keys.indexOf($1) === -1) { |
|
return; |
|
} |
|
|
|
// Allowed attribute value characters: !#$%&'()*+,-./:;<=>?@[]^_`{|}~ and space, a-z, A-Z, 0-9 |
|
|
|
if ($2.match(/^[ \w\!#\$%&'\(\)\*\+,\-\.\/\:;<\=>\?@\[\]\^`\{\|\}~]+$/) === null) { |
|
return; |
|
} |
|
|
|
// Check for duplicates |
|
|
|
if (attributes.hasOwnProperty($1)) { |
|
return; |
|
} |
|
|
|
attributes[$1] = $2; |
|
return ''; |
|
}); |
|
|
|
if (verify !== '') { |
|
return null; |
|
} |
|
|
|
return attributes; |
|
}, |
|
|
|
randomString: function (size) { |
|
|
|
var randomSource = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'; |
|
var len = randomSource.length; |
|
|
|
var result = []; |
|
for (var i = 0; i < size; ++i) { |
|
result[i] = randomSource[Math.floor(Math.random() * len)]; |
|
} |
|
|
|
return result.join(''); |
|
}, |
|
|
|
parseUri: function (input) { |
|
|
|
// Based on: parseURI 1.2.2 |
|
// http://blog.stevenlevithan.com/archives/parseuri |
|
// (c) Steven Levithan <stevenlevithan.com> |
|
// MIT License |
|
|
|
var keys = ['source', 'protocol', 'authority', 'userInfo', 'user', 'password', 'hostname', 'port', 'resource', 'relative', 'pathname', 'directory', 'file', 'query', 'fragment']; |
|
|
|
var uriRegex = /^(?:([^:\/?#]+):)?(?:\/\/((?:(([^:@]*)(?::([^:@]*))?)?@)?([^:\/?#]*)(?::(\d*))?))?(((((?:[^?#\/]*\/)*)([^?#]*))(?:\?([^#]*))?)(?:#(.*))?)/; |
|
var uriByNumber = input.match(uriRegex); |
|
var uri = {}; |
|
|
|
for (var i = 0, il = keys.length; i < il; ++i) { |
|
uri[keys[i]] = uriByNumber[i] || ''; |
|
} |
|
|
|
if (uri.port === '') { |
|
uri.port = (uri.protocol.toLowerCase() === 'http' ? '80' : (uri.protocol.toLowerCase() === 'https' ? '443' : '')); |
|
} |
|
|
|
return uri; |
|
}, |
|
|
|
base64urlEncode: function (value) { |
|
|
|
var wordArray = CryptoJS.enc.Utf8.parse(value); |
|
var encoded = CryptoJS.enc.Base64.stringify(wordArray); |
|
return encoded.replace(/\+/g, '-').replace(/\//g, '_').replace(/\=/g, ''); |
|
} |
|
}; |
|
|
|
|
|
// $lab:coverage:off$ |
|
|
|
// Based on: Crypto-JS v3.1.2 |
|
// Copyright (c) 2009-2013, Jeff Mott. All rights reserved. |
|
// http://code.google.com/p/crypto-js/ |
|
// http://code.google.com/p/crypto-js/wiki/License |
|
|
|
var CryptoJS = CryptoJS || function (h, r) { var k = {}, l = k.lib = {}, n = function () { }, f = l.Base = { extend: function (a) { n.prototype = this; var b = new n; a && b.mixIn(a); b.hasOwnProperty("init") || (b.init = function () { b.$super.init.apply(this, arguments) }); b.init.prototype = b; b.$super = this; return b }, create: function () { var a = this.extend(); a.init.apply(a, arguments); return a }, init: function () { }, mixIn: function (a) { for (var b in a) a.hasOwnProperty(b) && (this[b] = a[b]); a.hasOwnProperty("toString") && (this.toString = a.toString) }, clone: function () { return this.init.prototype.extend(this) } }, j = l.WordArray = f.extend({ init: function (a, b) { a = this.words = a || []; this.sigBytes = b != r ? b : 4 * a.length }, toString: function (a) { return (a || s).stringify(this) }, concat: function (a) { var b = this.words, d = a.words, c = this.sigBytes; a = a.sigBytes; this.clamp(); if (c % 4) for (var e = 0; e < a; e++) b[c + e >>> 2] |= (d[e >>> 2] >>> 24 - 8 * (e % 4) & 255) << 24 - 8 * ((c + e) % 4); else if (65535 < d.length) for (e = 0; e < a; e += 4) b[c + e >>> 2] = d[e >>> 2]; else b.push.apply(b, d); this.sigBytes += a; return this }, clamp: function () { var a = this.words, b = this.sigBytes; a[b >>> 2] &= 4294967295 << 32 - 8 * (b % 4); a.length = h.ceil(b / 4) }, clone: function () { var a = f.clone.call(this); a.words = this.words.slice(0); return a }, random: function (a) { for (var b = [], d = 0; d < a; d += 4) b.push(4294967296 * h.random() | 0); return new j.init(b, a) } }), m = k.enc = {}, s = m.Hex = { stringify: function (a) { var b = a.words; a = a.sigBytes; for (var d = [], c = 0; c < a; c++) { var e = b[c >>> 2] >>> 24 - 8 * (c % 4) & 255; d.push((e >>> 4).toString(16)); d.push((e & 15).toString(16)) } return d.join("") }, parse: function (a) { for (var b = a.length, d = [], c = 0; c < b; c += 2) d[c >>> 3] |= parseInt(a.substr(c, 2), 16) << 24 - 4 * (c % 8); return new j.init(d, b / 2) } }, p = m.Latin1 = { stringify: function (a) { var b = a.words; a = a.sigBytes; for (var d = [], c = 0; c < a; c++) d.push(String.fromCharCode(b[c >>> 2] >>> 24 - 8 * (c % 4) & 255)); return d.join("") }, parse: function (a) { for (var b = a.length, d = [], c = 0; c < b; c++) d[c >>> 2] |= (a.charCodeAt(c) & 255) << 24 - 8 * (c % 4); return new j.init(d, b) } }, t = m.Utf8 = { stringify: function (a) { try { return decodeURIComponent(escape(p.stringify(a))) } catch (b) { throw Error("Malformed UTF-8 data"); } }, parse: function (a) { return p.parse(unescape(encodeURIComponent(a))) } }, q = l.BufferedBlockAlgorithm = f.extend({ reset: function () { this._data = new j.init; this._nDataBytes = 0 }, _append: function (a) { "string" == typeof a && (a = t.parse(a)); this._data.concat(a); this._nDataBytes += a.sigBytes }, _process: function (a) { var b = this._data, d = b.words, c = b.sigBytes, e = this.blockSize, f = c / (4 * e), f = a ? h.ceil(f) : h.max((f | 0) - this._minBufferSize, 0); a = f * e; c = h.min(4 * a, c); if (a) { for (var g = 0; g < a; g += e) this._doProcessBlock(d, g); g = d.splice(0, a); b.sigBytes -= c } return new j.init(g, c) }, clone: function () { var a = f.clone.call(this); a._data = this._data.clone(); return a }, _minBufferSize: 0 }); l.Hasher = q.extend({ cfg: f.extend(), init: function (a) { this.cfg = this.cfg.extend(a); this.reset() }, reset: function () { q.reset.call(this); this._doReset() }, update: function (a) { this._append(a); this._process(); return this }, finalize: function (a) { a && this._append(a); return this._doFinalize() }, blockSize: 16, _createHelper: function (a) { return function (b, d) { return (new a.init(d)).finalize(b) } }, _createHmacHelper: function (a) { return function (b, d) { return (new u.HMAC.init(a, d)).finalize(b) } } }); var u = k.algo = {}; return k }(Math); |
|
(function () { var k = CryptoJS, b = k.lib, m = b.WordArray, l = b.Hasher, d = [], b = k.algo.SHA1 = l.extend({ _doReset: function () { this._hash = new m.init([1732584193, 4023233417, 2562383102, 271733878, 3285377520]) }, _doProcessBlock: function (n, p) { for (var a = this._hash.words, e = a[0], f = a[1], h = a[2], j = a[3], b = a[4], c = 0; 80 > c; c++) { if (16 > c) d[c] = n[p + c] | 0; else { var g = d[c - 3] ^ d[c - 8] ^ d[c - 14] ^ d[c - 16]; d[c] = g << 1 | g >>> 31 } g = (e << 5 | e >>> 27) + b + d[c]; g = 20 > c ? g + ((f & h | ~f & j) + 1518500249) : 40 > c ? g + ((f ^ h ^ j) + 1859775393) : 60 > c ? g + ((f & h | f & j | h & j) - 1894007588) : g + ((f ^ h ^ j) - 899497514); b = j; j = h; h = f << 30 | f >>> 2; f = e; e = g } a[0] = a[0] + e | 0; a[1] = a[1] + f | 0; a[2] = a[2] + h | 0; a[3] = a[3] + j | 0; a[4] = a[4] + b | 0 }, _doFinalize: function () { var b = this._data, d = b.words, a = 8 * this._nDataBytes, e = 8 * b.sigBytes; d[e >>> 5] |= 128 << 24 - e % 32; d[(e + 64 >>> 9 << 4) + 14] = Math.floor(a / 4294967296); d[(e + 64 >>> 9 << 4) + 15] = a; b.sigBytes = 4 * d.length; this._process(); return this._hash }, clone: function () { var b = l.clone.call(this); b._hash = this._hash.clone(); return b } }); k.SHA1 = l._createHelper(b); k.HmacSHA1 = l._createHmacHelper(b) })(); |
|
(function (k) { for (var g = CryptoJS, h = g.lib, v = h.WordArray, j = h.Hasher, h = g.algo, s = [], t = [], u = function (q) { return 4294967296 * (q - (q | 0)) | 0 }, l = 2, b = 0; 64 > b;) { var d; a: { d = l; for (var w = k.sqrt(d), r = 2; r <= w; r++) if (!(d % r)) { d = !1; break a } d = !0 } d && (8 > b && (s[b] = u(k.pow(l, 0.5))), t[b] = u(k.pow(l, 1 / 3)), b++); l++ } var n = [], h = h.SHA256 = j.extend({ _doReset: function () { this._hash = new v.init(s.slice(0)) }, _doProcessBlock: function (q, h) { for (var a = this._hash.words, c = a[0], d = a[1], b = a[2], k = a[3], f = a[4], g = a[5], j = a[6], l = a[7], e = 0; 64 > e; e++) { if (16 > e) n[e] = q[h + e] | 0; else { var m = n[e - 15], p = n[e - 2]; n[e] = ((m << 25 | m >>> 7) ^ (m << 14 | m >>> 18) ^ m >>> 3) + n[e - 7] + ((p << 15 | p >>> 17) ^ (p << 13 | p >>> 19) ^ p >>> 10) + n[e - 16] } m = l + ((f << 26 | f >>> 6) ^ (f << 21 | f >>> 11) ^ (f << 7 | f >>> 25)) + (f & g ^ ~f & j) + t[e] + n[e]; p = ((c << 30 | c >>> 2) ^ (c << 19 | c >>> 13) ^ (c << 10 | c >>> 22)) + (c & d ^ c & b ^ d & b); l = j; j = g; g = f; f = k + m | 0; k = b; b = d; d = c; c = m + p | 0 } a[0] = a[0] + c | 0; a[1] = a[1] + d | 0; a[2] = a[2] + b | 0; a[3] = a[3] + k | 0; a[4] = a[4] + f | 0; a[5] = a[5] + g | 0; a[6] = a[6] + j | 0; a[7] = a[7] + l | 0 }, _doFinalize: function () { var d = this._data, b = d.words, a = 8 * this._nDataBytes, c = 8 * d.sigBytes; b[c >>> 5] |= 128 << 24 - c % 32; b[(c + 64 >>> 9 << 4) + 14] = k.floor(a / 4294967296); b[(c + 64 >>> 9 << 4) + 15] = a; d.sigBytes = 4 * b.length; this._process(); return this._hash }, clone: function () { var b = j.clone.call(this); b._hash = this._hash.clone(); return b } }); g.SHA256 = j._createHelper(h); g.HmacSHA256 = j._createHmacHelper(h) })(Math); |
|
(function () { var c = CryptoJS, k = c.enc.Utf8; c.algo.HMAC = c.lib.Base.extend({ init: function (a, b) { a = this._hasher = new a.init; "string" == typeof b && (b = k.parse(b)); var c = a.blockSize, e = 4 * c; b.sigBytes > e && (b = a.finalize(b)); b.clamp(); for (var f = this._oKey = b.clone(), g = this._iKey = b.clone(), h = f.words, j = g.words, d = 0; d < c; d++) h[d] ^= 1549556828, j[d] ^= 909522486; f.sigBytes = g.sigBytes = e; this.reset() }, reset: function () { var a = this._hasher; a.reset(); a.update(this._iKey) }, update: function (a) { this._hasher.update(a); return this }, finalize: function (a) { var b = this._hasher; a = b.finalize(a); b.reset(); return b.finalize(this._oKey.clone().concat(a)) } }) })(); |
|
(function () { var h = CryptoJS, j = h.lib.WordArray; h.enc.Base64 = { stringify: function (b) { var e = b.words, f = b.sigBytes, c = this._map; b.clamp(); b = []; for (var a = 0; a < f; a += 3) for (var d = (e[a >>> 2] >>> 24 - 8 * (a % 4) & 255) << 16 | (e[a + 1 >>> 2] >>> 24 - 8 * ((a + 1) % 4) & 255) << 8 | e[a + 2 >>> 2] >>> 24 - 8 * ((a + 2) % 4) & 255, g = 0; 4 > g && a + 0.75 * g < f; g++) b.push(c.charAt(d >>> 6 * (3 - g) & 63)); if (e = c.charAt(64)) for (; b.length % 4;) b.push(e); return b.join("") }, parse: function (b) { var e = b.length, f = this._map, c = f.charAt(64); c && (c = b.indexOf(c), -1 != c && (e = c)); for (var c = [], a = 0, d = 0; d < e; d++) if (d % 4) { var g = f.indexOf(b.charAt(d - 1)) << 2 * (d % 4), h = f.indexOf(b.charAt(d)) >>> 6 - 2 * (d % 4); c[a >>> 2] |= (g | h) << 24 - 8 * (a % 4); a++ } return j.create(c, a) }, _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=" } })(); |
|
|
|
hawk.crypto.internals = CryptoJS; |
|
|
|
|
|
// Export if used as a module |
|
|
|
if (typeof module !== 'undefined' && module.exports) { |
|
module.exports = hawk; |
|
} |
|
|
|
// $lab:coverage:on$ |
|
|
|
},{}],105:[function(require,module,exports){ |
|
// Copyright 2011 Joyent, Inc. All rights reserved. |
|
|
|
var parser = require('./parser'); |
|
var signer = require('./signer'); |
|
var verify = require('./verify'); |
|
var util = require('./util'); |
|
|
|
|
|
|
|
///--- API |
|
|
|
module.exports = { |
|
|
|
parse: parser.parseRequest, |
|
parseRequest: parser.parseRequest, |
|
|
|
sign: signer.signRequest, |
|
signRequest: signer.signRequest, |
|
|
|
sshKeyToPEM: util.sshKeyToPEM, |
|
sshKeyFingerprint: util.fingerprint, |
|
pemToRsaSSHKey: util.pemToRsaSSHKey, |
|
|
|
verify: verify.verifySignature, |
|
verifySignature: verify.verifySignature |
|
}; |
|
|
|
},{"./parser":106,"./signer":107,"./util":108,"./verify":109}],106:[function(require,module,exports){ |
|
// Copyright 2012 Joyent, Inc. All rights reserved. |
|
|
|
var assert = require('assert-plus'); |
|
var util = require('util'); |
|
|
|
|
|
|
|
///--- Globals |
|
|
|
var Algorithms = { |
|
'rsa-sha1': true, |
|
'rsa-sha256': true, |
|
'rsa-sha512': true, |
|
'dsa-sha1': true, |
|
'hmac-sha1': true, |
|
'hmac-sha256': true, |
|
'hmac-sha512': true |
|
}; |
|
|
|
var State = { |
|
New: 0, |
|
Params: 1 |
|
}; |
|
|
|
var ParamsState = { |
|
Name: 0, |
|
Quote: 1, |
|
Value: 2, |
|
Comma: 3 |
|
}; |
|
|
|
|
|
|
|
///--- Specific Errors |
|
|
|
function HttpSignatureError(message, caller) { |
|
if (Error.captureStackTrace) |
|
Error.captureStackTrace(this, caller || HttpSignatureError); |
|
|
|
this.message = message; |
|
this.name = caller.name; |
|
} |
|
util.inherits(HttpSignatureError, Error); |
|
|
|
function ExpiredRequestError(message) { |
|
HttpSignatureError.call(this, message, ExpiredRequestError); |
|
} |
|
util.inherits(ExpiredRequestError, HttpSignatureError); |
|
|
|
|
|
function InvalidHeaderError(message) { |
|
HttpSignatureError.call(this, message, InvalidHeaderError); |
|
} |
|
util.inherits(InvalidHeaderError, HttpSignatureError); |
|
|
|
|
|
function InvalidParamsError(message) { |
|
HttpSignatureError.call(this, message, InvalidParamsError); |
|
} |
|
util.inherits(InvalidParamsError, HttpSignatureError); |
|
|
|
|
|
function MissingHeaderError(message) { |
|
HttpSignatureError.call(this, message, MissingHeaderError); |
|
} |
|
util.inherits(MissingHeaderError, HttpSignatureError); |
|
|
|
|
|
|
|
///--- Exported API |
|
|
|
module.exports = { |
|
|
|
/** |
|
* Parses the 'Authorization' header out of an http.ServerRequest object. |
|
* |
|
* Note that this API will fully validate the Authorization header, and throw |
|
* on any error. It will not however check the signature, or the keyId format |
|
* as those are specific to your environment. You can use the options object |
|
* to pass in extra constraints. |
|
* |
|
* As a response object you can expect this: |
|
* |
|
* { |
|
* "scheme": "Signature", |
|
* "params": { |
|
* "keyId": "foo", |
|
* "algorithm": "rsa-sha256", |
|
* "headers": [ |
|
* "date" or "x-date", |
|
* "content-md5" |
|
* ], |
|
* "signature": "base64" |
|
* }, |
|
* "signingString": "ready to be passed to crypto.verify()" |
|
* } |
|
* |
|
* @param {Object} request an http.ServerRequest. |
|
* @param {Object} options an optional options object with: |
|
* - clockSkew: allowed clock skew in seconds (default 300). |
|
* - headers: required header names (def: date or x-date) |
|
* - algorithms: algorithms to support (default: all). |
|
* @return {Object} parsed out object (see above). |
|
* @throws {TypeError} on invalid input. |
|
* @throws {InvalidHeaderError} on an invalid Authorization header error. |
|
* @throws {InvalidParamsError} if the params in the scheme are invalid. |
|
* @throws {MissingHeaderError} if the params indicate a header not present, |
|
* either in the request headers from the params, |
|
* or not in the params from a required header |
|
* in options. |
|
* @throws {ExpiredRequestError} if the value of date or x-date exceeds skew. |
|
*/ |
|
parseRequest: function parseRequest(request, options) { |
|
assert.object(request, 'request'); |
|
assert.object(request.headers, 'request.headers'); |
|
if (options === undefined) { |
|
options = {}; |
|
} |
|
if (options.headers === undefined) { |
|
options.headers = [request.headers['x-date'] ? 'x-date' : 'date']; |
|
} |
|
assert.object(options, 'options'); |
|
assert.arrayOfString(options.headers, 'options.headers'); |
|
assert.optionalNumber(options.clockSkew, 'options.clockSkew'); |
|
|
|
if (!request.headers.authorization) |
|
throw new MissingHeaderError('no authorization header present in ' + |
|
'the request'); |
|
|
|
options.clockSkew = options.clockSkew || 300; |
|
|
|
|
|
var i = 0; |
|
var state = State.New; |
|
var substate = ParamsState.Name; |
|
var tmpName = ''; |
|
var tmpValue = ''; |
|
|
|
var parsed = { |
|
scheme: '', |
|
params: {}, |
|
signingString: '', |
|
|
|
get algorithm() { |
|
return this.params.algorithm.toUpperCase(); |
|
}, |
|
|
|
get keyId() { |
|
return this.params.keyId; |
|
} |
|
|
|
}; |
|
|
|
var authz = request.headers.authorization; |
|
for (i = 0; i < authz.length; i++) { |
|
var c = authz.charAt(i); |
|
|
|
switch (Number(state)) { |
|
|
|
case State.New: |
|
if (c !== ' ') parsed.scheme += c; |
|
else state = State.Params; |
|
break; |
|
|
|
case State.Params: |
|
switch (Number(substate)) { |
|
|
|
case ParamsState.Name: |
|
var code = c.charCodeAt(0); |
|
// restricted name of A-Z / a-z |
|
if ((code >= 0x41 && code <= 0x5a) || // A-Z |
|
(code >= 0x61 && code <= 0x7a)) { // a-z |
|
tmpName += c; |
|
} else if (c === '=') { |
|
if (tmpName.length === 0) |
|
throw new InvalidHeaderError('bad param format'); |
|
substate = ParamsState.Quote; |
|
} else { |
|
throw new InvalidHeaderError('bad param format'); |
|
} |
|
break; |
|
|
|
case ParamsState.Quote: |
|
if (c === '"') { |
|
tmpValue = ''; |
|
substate = ParamsState.Value; |
|
} else { |
|
throw new InvalidHeaderError('bad param format'); |
|
} |
|
break; |
|
|
|
case ParamsState.Value: |
|
if (c === '"') { |
|
parsed.params[tmpName] = tmpValue; |
|
substate = ParamsState.Comma; |
|
} else { |
|
tmpValue += c; |
|
} |
|
break; |
|
|
|
case ParamsState.Comma: |
|
if (c === ',') { |
|
tmpName = ''; |
|
substate = ParamsState.Name; |
|
} else { |
|
throw new InvalidHeaderError('bad param format'); |
|
} |
|
break; |
|
|
|
default: |
|
throw new Error('Invalid substate'); |
|
} |
|
break; |
|
|
|
default: |
|
throw new Error('Invalid substate'); |
|
} |
|
|
|
} |
|
|
|
if (!parsed.params.headers || parsed.params.headers === '') { |
|
if (request.headers['x-date']) { |
|
parsed.params.headers = ['x-date']; |
|
} else { |
|
parsed.params.headers = ['date']; |
|
} |
|
} else { |
|
parsed.params.headers = parsed.params.headers.split(' '); |
|
} |
|
|
|
// Minimally validate the parsed object |
|
if (!parsed.scheme || parsed.scheme !== 'Signature') |
|
throw new InvalidHeaderError('scheme was not "Signature"'); |
|
|
|
if (!parsed.params.keyId) |
|
throw new InvalidHeaderError('keyId was not specified'); |
|
|
|
if (!parsed.params.algorithm) |
|
throw new InvalidHeaderError('algorithm was not specified'); |
|
|
|
if (!parsed.params.signature) |
|
throw new InvalidHeaderError('signature was not specified'); |
|
|
|
// Check the algorithm against the official list |
|
parsed.params.algorithm = parsed.params.algorithm.toLowerCase(); |
|
if (!Algorithms[parsed.params.algorithm]) |
|
throw new InvalidParamsError(parsed.params.algorithm + |
|
' is not supported'); |
|
|
|
// Build the signingString |
|
for (i = 0; i < parsed.params.headers.length; i++) { |
|
var h = parsed.params.headers[i].toLowerCase(); |
|
parsed.params.headers[i] = h; |
|
|
|
if (h !== 'request-line') { |
|
var value = request.headers[h]; |
|
if (!value) |
|
throw new MissingHeaderError(h + ' was not in the request'); |
|
parsed.signingString += h + ': ' + value; |
|
} else { |
|
parsed.signingString += |
|
request.method + ' ' + request.url + ' HTTP/' + request.httpVersion; |
|
} |
|
|
|
if ((i + 1) < parsed.params.headers.length) |
|
parsed.signingString += '\n'; |
|
} |
|
|
|
// Check against the constraints |
|
var date; |
|
if (request.headers.date || request.headers['x-date']) { |
|
if (request.headers['x-date']) { |
|
date = new Date(request.headers['x-date']); |
|
} else { |
|
date = new Date(request.headers.date); |
|
} |
|
var now = new Date(); |
|
var skew = Math.abs(now.getTime() - date.getTime()); |
|
|
|
if (skew > options.clockSkew * 1000) { |
|
throw new ExpiredRequestError('clock skew of ' + |
|
(skew / 1000) + |
|
's was greater than ' + |
|
options.clockSkew + 's'); |
|
} |
|
} |
|
|
|
options.headers.forEach(function (hdr) { |
|
// Remember that we already checked any headers in the params |
|
// were in the request, so if this passes we're good. |
|
if (parsed.params.headers.indexOf(hdr) < 0) |
|
throw new MissingHeaderError(hdr + ' was not a signed header'); |
|
}); |
|
|
|
if (options.algorithms) { |
|
if (options.algorithms.indexOf(parsed.params.algorithm) === -1) |
|
throw new InvalidParamsError(parsed.params.algorithm + |
|
' is not a supported algorithm'); |
|
} |
|
|
|
return parsed; |
|
} |
|
|
|
}; |
|
|
|
},{"assert-plus":116,"util":343}],107:[function(require,module,exports){ |
|
// Copyright 2012 Joyent, Inc. All rights reserved. |
|
|
|
var assert = require('assert-plus'); |
|
var crypto = require('crypto'); |
|
var http = require('http'); |
|
|
|
var sprintf = require('util').format; |
|
|
|
|
|
|
|
///--- Globals |
|
|
|
var Algorithms = { |
|
'rsa-sha1': true, |
|
'rsa-sha256': true, |
|
'rsa-sha512': true, |
|
'dsa-sha1': true, |
|
'hmac-sha1': true, |
|
'hmac-sha256': true, |
|
'hmac-sha512': true |
|
}; |
|
|
|
var Authorization = |
|
'Signature keyId="%s",algorithm="%s",headers="%s",signature="%s"'; |
|
|
|
|
|
|
|
///--- Specific Errors |
|
|
|
function MissingHeaderError(message) { |
|
this.name = 'MissingHeaderError'; |
|
this.message = message; |
|
this.stack = (new Error()).stack; |
|
} |
|
MissingHeaderError.prototype = new Error(); |
|
|
|
|
|
function InvalidAlgorithmError(message) { |
|
this.name = 'InvalidAlgorithmError'; |
|
this.message = message; |
|
this.stack = (new Error()).stack; |
|
} |
|
InvalidAlgorithmError.prototype = new Error(); |
|
|
|
|
|
|
|
///--- Internal Functions |
|
|
|
function _pad(val) { |
|
if (parseInt(val, 10) < 10) { |
|
val = '0' + val; |
|
} |
|
return val; |
|
} |
|
|
|
|
|
function _rfc1123() { |
|
var date = new Date(); |
|
|
|
var months = ['Jan', |
|
'Feb', |
|
'Mar', |
|
'Apr', |
|
'May', |
|
'Jun', |
|
'Jul', |
|
'Aug', |
|
'Sep', |
|
'Oct', |
|
'Nov', |
|
'Dec']; |
|
var days = ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat']; |
|
return days[date.getUTCDay()] + ', ' + |
|
_pad(date.getUTCDate()) + ' ' + |
|
months[date.getUTCMonth()] + ' ' + |
|
date.getUTCFullYear() + ' ' + |
|
_pad(date.getUTCHours()) + ':' + |
|
_pad(date.getUTCMinutes()) + ':' + |
|
_pad(date.getUTCSeconds()) + |
|
' GMT'; |
|
} |
|
|
|
|
|
|
|
///--- Exported API |
|
|
|
module.exports = { |
|
|
|
/** |
|
* Adds an 'Authorization' header to an http.ClientRequest object. |
|
* |
|
* Note that this API will add a Date header if it's not already set. Any |
|
* other headers in the options.headers array MUST be present, or this |
|
* will throw. |
|
* |
|
* You shouldn't need to check the return type; it's just there if you want |
|
* to be pedantic. |
|
* |
|
* @param {Object} request an instance of http.ClientRequest. |
|
* @param {Object} options signing parameters object: |
|
* - {String} keyId required. |
|
* - {String} key required (either a PEM or HMAC key). |
|
* - {Array} headers optional; defaults to ['date']. |
|
* - {String} algorithm optional; defaults to 'rsa-sha256'. |
|
* - {String} httpVersion optional; defaults to '1.1'. |
|
* @return {Boolean} true if Authorization (and optionally Date) were added. |
|
* @throws {TypeError} on bad parameter types (input). |
|
* @throws {InvalidAlgorithmError} if algorithm was bad. |
|
* @throws {MissingHeaderError} if a header to be signed was specified but |
|
* was not present. |
|
*/ |
|
signRequest: function signRequest(request, options) { |
|
assert.object(request, 'request'); |
|
assert.object(options, 'options'); |
|
assert.optionalString(options.algorithm, 'options.algorithm'); |
|
assert.string(options.keyId, 'options.keyId'); |
|
assert.optionalArrayOfString(options.headers, 'options.headers'); |
|
assert.optionalString(options.httpVersion, 'options.httpVersion'); |
|
|
|
if (!request.getHeader('Date')) |
|
request.setHeader('Date', _rfc1123()); |
|
if (!options.headers) |
|
options.headers = ['date']; |
|
if (!options.algorithm) |
|
options.algorithm = 'rsa-sha256'; |
|
if (!options.httpVersion) |
|
options.httpVersion = '1.1'; |
|
|
|
options.algorithm = options.algorithm.toLowerCase(); |
|
|
|
if (!Algorithms[options.algorithm]) |
|
throw new InvalidAlgorithmError(options.algorithm + ' is not supported'); |
|
|
|
var i; |
|
var stringToSign = ''; |
|
for (i = 0; i < options.headers.length; i++) { |
|
if (typeof (options.headers[i]) !== 'string') |
|
throw new TypeError('options.headers must be an array of Strings'); |
|
|
|
var h = options.headers[i].toLowerCase(); |
|
|
|
if (h !== 'request-line') { |
|
var value = request.getHeader(h); |
|
if (!value) { |
|
throw new MissingHeaderError(h + ' was not in the request'); |
|
} |
|
stringToSign += h + ': ' + value; |
|
} else { |
|
stringToSign += |
|
request.method + ' ' + request.path + ' HTTP/' + options.httpVersion; |
|
} |
|
|
|
if ((i + 1) < options.headers.length) |
|
stringToSign += '\n'; |
|
} |
|
|
|
var alg = options.algorithm.match(/(hmac|rsa)-(\w+)/); |
|
var signature; |
|
if (alg[1] === 'hmac') { |
|
var hmac = crypto.createHmac(alg[2].toUpperCase(), options.key); |
|
hmac.update(stringToSign); |
|
signature = hmac.digest('base64'); |
|
} else { |
|
var signer = crypto.createSign(options.algorithm.toUpperCase()); |
|
signer.update(stringToSign); |
|
signature = signer.sign(options.key, 'base64'); |
|
} |
|
|
|
request.setHeader('Authorization', sprintf(Authorization, |
|
options.keyId, |
|
options.algorithm, |
|
options.headers.join(' '), |
|
signature)); |
|
|
|
return true; |
|
} |
|
|
|
}; |
|
|
|
},{"assert-plus":116,"crypto":178,"http":315,"util":343}],108:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// Copyright 2012 Joyent, Inc. All rights reserved. |
|
|
|
var assert = require('assert-plus'); |
|
var crypto = require('crypto'); |
|
|
|
var asn1 = require('asn1'); |
|
var ctype = require('ctype'); |
|
|
|
|
|
|
|
///--- Helpers |
|
|
|
function readNext(buffer, offset) { |
|
var len = ctype.ruint32(buffer, 'big', offset); |
|
offset += 4; |
|
|
|
var newOffset = offset + len; |
|
|
|
return { |
|
data: buffer.slice(offset, newOffset), |
|
offset: newOffset |
|
}; |
|
} |
|
|
|
|
|
function writeInt(writer, buffer) { |
|
writer.writeByte(0x02); // ASN1.Integer |
|
writer.writeLength(buffer.length); |
|
|
|
for (var i = 0; i < buffer.length; i++) |
|
writer.writeByte(buffer[i]); |
|
|
|
return writer; |
|
} |
|
|
|
|
|
function rsaToPEM(key) { |
|
var buffer; |
|
var der; |
|
var exponent; |
|
var i; |
|
var modulus; |
|
var newKey = ''; |
|
var offset = 0; |
|
var type; |
|
var tmp; |
|
|
|
try { |
|
buffer = new Buffer(key.split(' ')[1], 'base64'); |
|
|
|
tmp = readNext(buffer, offset); |
|
type = tmp.data.toString(); |
|
offset = tmp.offset; |
|
|
|
if (type !== 'ssh-rsa') |
|
throw new Error('Invalid ssh key type: ' + type); |
|
|
|
tmp = readNext(buffer, offset); |
|
exponent = tmp.data; |
|
offset = tmp.offset; |
|
|
|
tmp = readNext(buffer, offset); |
|
modulus = tmp.data; |
|
} catch (e) { |
|
throw new Error('Invalid ssh key: ' + key); |
|
} |
|
|
|
// DER is a subset of BER |
|
der = new asn1.BerWriter(); |
|
|
|
der.startSequence(); |
|
|
|
der.startSequence(); |
|
der.writeOID('1.2.840.113549.1.1.1'); |
|
der.writeNull(); |
|
der.endSequence(); |
|
|
|
der.startSequence(0x03); // bit string |
|
der.writeByte(0x00); |
|
|
|
// Actual key |
|
der.startSequence(); |
|
writeInt(der, modulus); |
|
writeInt(der, exponent); |
|
der.endSequence(); |
|
|
|
// bit string |
|
der.endSequence(); |
|
|
|
der.endSequence(); |
|
|
|
tmp = der.buffer.toString('base64'); |
|
for (i = 0; i < tmp.length; i++) { |
|
if ((i % 64) === 0) |
|
newKey += '\n'; |
|
newKey += tmp.charAt(i); |
|
} |
|
|
|
if (!/\\n$/.test(newKey)) |
|
newKey += '\n'; |
|
|
|
return '-----BEGIN PUBLIC KEY-----' + newKey + '-----END PUBLIC KEY-----\n'; |
|
} |
|
|
|
|
|
function dsaToPEM(key) { |
|
var buffer; |
|
var offset = 0; |
|
var tmp; |
|
var der; |
|
var newKey = ''; |
|
|
|
var type; |
|
var p; |
|
var q; |
|
var g; |
|
var y; |
|
|
|
try { |
|
buffer = new Buffer(key.split(' ')[1], 'base64'); |
|
|
|
tmp = readNext(buffer, offset); |
|
type = tmp.data.toString(); |
|
offset = tmp.offset; |
|
|
|
/* JSSTYLED */ |
|
if (!/^ssh-ds[as].*/.test(type)) |
|
throw new Error('Invalid ssh key type: ' + type); |
|
|
|
tmp = readNext(buffer, offset); |
|
p = tmp.data; |
|
offset = tmp.offset; |
|
|
|
tmp = readNext(buffer, offset); |
|
q = tmp.data; |
|
offset = tmp.offset; |
|
|
|
tmp = readNext(buffer, offset); |
|
g = tmp.data; |
|
offset = tmp.offset; |
|
|
|
tmp = readNext(buffer, offset); |
|
y = tmp.data; |
|
} catch (e) { |
|
console.log(e.stack); |
|
throw new Error('Invalid ssh key: ' + key); |
|
} |
|
|
|
// DER is a subset of BER |
|
der = new asn1.BerWriter(); |
|
|
|
der.startSequence(); |
|
|
|
der.startSequence(); |
|
der.writeOID('1.2.840.10040.4.1'); |
|
|
|
der.startSequence(); |
|
writeInt(der, p); |
|
writeInt(der, q); |
|
writeInt(der, g); |
|
der.endSequence(); |
|
|
|
der.endSequence(); |
|
|
|
der.startSequence(0x03); // bit string |
|
der.writeByte(0x00); |
|
writeInt(der, y); |
|
der.endSequence(); |
|
|
|
der.endSequence(); |
|
|
|
tmp = der.buffer.toString('base64'); |
|
for (var i = 0; i < tmp.length; i++) { |
|
if ((i % 64) === 0) |
|
newKey += '\n'; |
|
newKey += tmp.charAt(i); |
|
} |
|
|
|
if (!/\\n$/.test(newKey)) |
|
newKey += '\n'; |
|
|
|
return '-----BEGIN PUBLIC KEY-----' + newKey + '-----END PUBLIC KEY-----\n'; |
|
} |
|
|
|
|
|
///--- API |
|
|
|
module.exports = { |
|
|
|
/** |
|
* Converts an OpenSSH public key (rsa only) to a PKCS#8 PEM file. |
|
* |
|
* The intent of this module is to interoperate with OpenSSL only, |
|
* specifically the node crypto module's `verify` method. |
|
* |
|
* @param {String} key an OpenSSH public key. |
|
* @return {String} PEM encoded form of the RSA public key. |
|
* @throws {TypeError} on bad input. |
|
* @throws {Error} on invalid ssh key formatted data. |
|
*/ |
|
sshKeyToPEM: function sshKeyToPEM(key) { |
|
assert.string(key, 'ssh_key'); |
|
|
|
/* JSSTYLED */ |
|
if (/^ssh-rsa.*/.test(key)) |
|
return rsaToPEM(key); |
|
|
|
/* JSSTYLED */ |
|
if (/^ssh-ds[as].*/.test(key)) |
|
return dsaToPEM(key); |
|
|
|
throw new Error('Only RSA and DSA public keys are allowed'); |
|
}, |
|
|
|
|
|
/** |
|
* Generates an OpenSSH fingerprint from an ssh public key. |
|
* |
|
* @param {String} key an OpenSSH public key. |
|
* @return {String} key fingerprint. |
|
* @throws {TypeError} on bad input. |
|
* @throws {Error} if what you passed doesn't look like an ssh public key. |
|
*/ |
|
fingerprint: function fingerprint(key) { |
|
assert.string(key, 'ssh_key'); |
|
|
|
var pieces = key.split(' '); |
|
if (!pieces || !pieces.length || pieces.length < 2) |
|
throw new Error('invalid ssh key'); |
|
|
|
var data = new Buffer(pieces[1], 'base64'); |
|
|
|
var hash = crypto.createHash('md5'); |
|
hash.update(data); |
|
var digest = hash.digest('hex'); |
|
|
|
var fp = ''; |
|
for (var i = 0; i < digest.length; i++) { |
|
if (i && i % 2 === 0) |
|
fp += ':'; |
|
|
|
fp += digest[i]; |
|
} |
|
|
|
return fp; |
|
}, |
|
|
|
/** |
|
* Converts a PKGCS#8 PEM file to an OpenSSH public key (rsa) |
|
* |
|
* The reverse of the above function. |
|
*/ |
|
pemToRsaSSHKey: function pemToRsaSSHKey(pem, comment) { |
|
assert.equal('string', typeof pem, 'typeof pem'); |
|
|
|
// chop off the BEGIN PUBLIC KEY and END PUBLIC KEY portion |
|
var cleaned = pem.split('\n').slice(1, -2).join(''); |
|
|
|
var buf = new Buffer(cleaned, 'base64'); |
|
|
|
var der = new asn1.BerReader(buf); |
|
|
|
der.readSequence(); |
|
der.readSequence(); |
|
|
|
var oid = der.readOID(); |
|
assert.equal(oid, '1.2.840.113549.1.1.1', 'pem not in RSA format'); |
|
|
|
// Null -- XXX this probably isn't good practice |
|
der.readByte(); |
|
der.readByte(); |
|
|
|
// bit string sequence |
|
der.readSequence(0x03); |
|
der.readByte(); |
|
der.readSequence(); |
|
|
|
// modulus |
|
assert.equal(der.peek(), asn1.Ber.Integer, 'modulus not an integer'); |
|
der._offset = der.readLength(der.offset + 1); |
|
var modulus = der._buf.slice(der.offset, der.offset + der.length); |
|
der._offset += der.length; |
|
|
|
// exponent |
|
assert.equal(der.peek(), asn1.Ber.Integer, 'exponent not an integer'); |
|
der._offset = der.readLength(der.offset + 1); |
|
var exponent = der._buf.slice(der.offset, der.offset + der.length); |
|
der._offset += der.length; |
|
|
|
// now, make the key |
|
var type = new Buffer('ssh-rsa'); |
|
var buffer = new Buffer(4 + type.length + 4 + modulus.length + 4 + exponent.length); |
|
var i = 0; |
|
buffer.writeUInt32BE(type.length, i); i += 4; |
|
type.copy(buffer, i); i += type.length; |
|
buffer.writeUInt32BE(exponent.length, i); i += 4; |
|
exponent.copy(buffer, i); i += exponent.length; |
|
buffer.writeUInt32BE(modulus.length, i); i += 4; |
|
modulus.copy(buffer, i); i += modulus.length; |
|
|
|
var s = type.toString() + ' ' + buffer.toString('base64') + ' ' + (comment || ''); |
|
return s; |
|
} |
|
}; |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"asn1":115,"assert-plus":116,"buffer":172,"crypto":178,"ctype":119}],109:[function(require,module,exports){ |
|
// Copyright 2011 Joyent, Inc. All rights reserved. |
|
|
|
var assert = require('assert-plus'); |
|
var crypto = require('crypto'); |
|
|
|
|
|
|
|
///--- Exported API |
|
|
|
module.exports = { |
|
|
|
/** |
|
* Simply wraps up the node crypto operations for you, and returns |
|
* true or false. You are expected to pass in an object that was |
|
* returned from `parse()`. |
|
* |
|
* @param {Object} parsedSignature the object you got from `parse`. |
|
* @param {String} key either an RSA private key PEM or HMAC secret. |
|
* @return {Boolean} true if valid, false otherwise. |
|
* @throws {TypeError} if you pass in bad arguments. |
|
*/ |
|
verifySignature: function verifySignature(parsedSignature, key) { |
|
assert.object(parsedSignature, 'parsedSignature'); |
|
assert.string(key, 'key'); |
|
|
|
var alg = parsedSignature.algorithm.match(/(HMAC|RSA|DSA)-(\w+)/); |
|
if (!alg || alg.length !== 3) |
|
throw new TypeError('parsedSignature: unsupported algorithm ' + |
|
parsedSignature.algorithm); |
|
|
|
if (alg[1] === 'HMAC') { |
|
var hmac = crypto.createHmac(alg[2].toUpperCase(), key); |
|
hmac.update(parsedSignature.signingString); |
|
return (hmac.digest('base64') === parsedSignature.params.signature); |
|
} else { |
|
var verify = crypto.createVerify(alg[0]); |
|
verify.update(parsedSignature.signingString); |
|
return verify.verify(key, parsedSignature.params.signature, 'base64'); |
|
} |
|
} |
|
|
|
}; |
|
|
|
},{"assert-plus":116,"crypto":178}],110:[function(require,module,exports){ |
|
// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved. |
|
|
|
|
|
module.exports = { |
|
|
|
newInvalidAsn1Error: function(msg) { |
|
var e = new Error(); |
|
e.name = 'InvalidAsn1Error'; |
|
e.message = msg || ''; |
|
return e; |
|
} |
|
|
|
}; |
|
|
|
},{}],111:[function(require,module,exports){ |
|
// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved. |
|
|
|
var errors = require('./errors'); |
|
var types = require('./types'); |
|
|
|
var Reader = require('./reader'); |
|
var Writer = require('./writer'); |
|
|
|
|
|
///--- Exports |
|
|
|
module.exports = { |
|
|
|
Reader: Reader, |
|
|
|
Writer: Writer |
|
|
|
}; |
|
|
|
for (var t in types) { |
|
if (types.hasOwnProperty(t)) |
|
module.exports[t] = types[t]; |
|
} |
|
for (var e in errors) { |
|
if (errors.hasOwnProperty(e)) |
|
module.exports[e] = errors[e]; |
|
} |
|
|
|
},{"./errors":110,"./reader":112,"./types":113,"./writer":114}],112:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved. |
|
|
|
var assert = require('assert'); |
|
|
|
var ASN1 = require('./types'); |
|
var errors = require('./errors'); |
|
|
|
|
|
///--- Globals |
|
|
|
var newInvalidAsn1Error = errors.newInvalidAsn1Error; |
|
|
|
|
|
|
|
///--- API |
|
|
|
function Reader(data) { |
|
if (!data || !Buffer.isBuffer(data)) |
|
throw new TypeError('data must be a node Buffer'); |
|
|
|
this._buf = data; |
|
this._size = data.length; |
|
|
|
// These hold the "current" state |
|
this._len = 0; |
|
this._offset = 0; |
|
|
|
var self = this; |
|
this.__defineGetter__('length', function() { return self._len; }); |
|
this.__defineGetter__('offset', function() { return self._offset; }); |
|
this.__defineGetter__('remain', function() { |
|
return self._size - self._offset; |
|
}); |
|
this.__defineGetter__('buffer', function() { |
|
return self._buf.slice(self._offset); |
|
}); |
|
} |
|
|
|
|
|
/** |
|
* Reads a single byte and advances offset; you can pass in `true` to make this |
|
* a "peek" operation (i.e., get the byte, but don't advance the offset). |
|
* |
|
* @param {Boolean} peek true means don't move offset. |
|
* @return {Number} the next byte, null if not enough data. |
|
*/ |
|
Reader.prototype.readByte = function(peek) { |
|
if (this._size - this._offset < 1) |
|
return null; |
|
|
|
var b = this._buf[this._offset] & 0xff; |
|
|
|
if (!peek) |
|
this._offset += 1; |
|
|
|
return b; |
|
}; |
|
|
|
|
|
Reader.prototype.peek = function() { |
|
return this.readByte(true); |
|
}; |
|
|
|
|
|
/** |
|
* Reads a (potentially) variable length off the BER buffer. This call is |
|
* not really meant to be called directly, as callers have to manipulate |
|
* the internal buffer afterwards. |
|
* |
|
* As a result of this call, you can call `Reader.length`, until the |
|
* next thing called that does a readLength. |
|
* |
|
* @return {Number} the amount of offset to advance the buffer. |
|
* @throws {InvalidAsn1Error} on bad ASN.1 |
|
*/ |
|
Reader.prototype.readLength = function(offset) { |
|
if (offset === undefined) |
|
offset = this._offset; |
|
|
|
if (offset >= this._size) |
|
return null; |
|
|
|
var lenB = this._buf[offset++] & 0xff; |
|
if (lenB === null) |
|
return null; |
|
|
|
if ((lenB & 0x80) == 0x80) { |
|
lenB &= 0x7f; |
|
|
|
if (lenB == 0) |
|
throw newInvalidAsn1Error('Indefinite length not supported'); |
|
|
|
if (lenB > 4) |
|
throw newInvalidAsn1Error('encoding too long'); |
|
|
|
if (this._size - offset < lenB) |
|
return null; |
|
|
|
this._len = 0; |
|
for (var i = 0; i < lenB; i++) |
|
this._len = (this._len << 8) + (this._buf[offset++] & 0xff); |
|
|
|
} else { |
|
// Wasn't a variable length |
|
this._len = lenB; |
|
} |
|
|
|
return offset; |
|
}; |
|
|
|
|
|
/** |
|
* Parses the next sequence in this BER buffer. |
|
* |
|
* To get the length of the sequence, call `Reader.length`. |
|
* |
|
* @return {Number} the sequence's tag. |
|
*/ |
|
Reader.prototype.readSequence = function(tag) { |
|
var seq = this.peek(); |
|
if (seq === null) |
|
return null; |
|
if (tag !== undefined && tag !== seq) |
|
throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) + |
|
': got 0x' + seq.toString(16)); |
|
|
|
var o = this.readLength(this._offset + 1); // stored in `length` |
|
if (o === null) |
|
return null; |
|
|
|
this._offset = o; |
|
return seq; |
|
}; |
|
|
|
|
|
Reader.prototype.readInt = function() { |
|
return this._readTag(ASN1.Integer); |
|
}; |
|
|
|
|
|
Reader.prototype.readBoolean = function() { |
|
return (this._readTag(ASN1.Boolean) === 0 ? false : true); |
|
}; |
|
|
|
|
|
Reader.prototype.readEnumeration = function() { |
|
return this._readTag(ASN1.Enumeration); |
|
}; |
|
|
|
|
|
Reader.prototype.readString = function(tag, retbuf) { |
|
if (!tag) |
|
tag = ASN1.OctetString; |
|
|
|
var b = this.peek(); |
|
if (b === null) |
|
return null; |
|
|
|
if (b !== tag) |
|
throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) + |
|
': got 0x' + b.toString(16)); |
|
|
|
var o = this.readLength(this._offset + 1); // stored in `length` |
|
|
|
if (o === null) |
|
return null; |
|
|
|
if (this.length > this._size - o) |
|
return null; |
|
|
|
this._offset = o; |
|
|
|
if (this.length === 0) |
|
return ''; |
|
|
|
var str = this._buf.slice(this._offset, this._offset + this.length); |
|
this._offset += this.length; |
|
|
|
return retbuf ? str : str.toString('utf8'); |
|
}; |
|
|
|
Reader.prototype.readOID = function(tag) { |
|
if (!tag) |
|
tag = ASN1.OID; |
|
|
|
var b = this.peek(); |
|
if (b === null) |
|
return null; |
|
|
|
if (b !== tag) |
|
throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) + |
|
': got 0x' + b.toString(16)); |
|
|
|
var o = this.readLength(this._offset + 1); // stored in `length` |
|
if (o === null) |
|
return null; |
|
|
|
if (this.length > this._size - o) |
|
return null; |
|
|
|
this._offset = o; |
|
|
|
var values = []; |
|
var value = 0; |
|
|
|
for (var i = 0; i < this.length; i++) { |
|
var byte = this._buf[this._offset++] & 0xff; |
|
|
|
value <<= 7; |
|
value += byte & 0x7f; |
|
if ((byte & 0x80) == 0) { |
|
values.push(value); |
|
value = 0; |
|
} |
|
} |
|
|
|
value = values.shift(); |
|
values.unshift(value % 40); |
|
values.unshift((value / 40) >> 0); |
|
|
|
return values.join('.'); |
|
}; |
|
|
|
|
|
Reader.prototype._readTag = function(tag) { |
|
assert.ok(tag !== undefined); |
|
|
|
var b = this.peek(); |
|
|
|
if (b === null) |
|
return null; |
|
|
|
if (b !== tag) |
|
throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) + |
|
': got 0x' + b.toString(16)); |
|
|
|
var o = this.readLength(this._offset + 1); // stored in `length` |
|
if (o === null) |
|
return null; |
|
|
|
if (this.length > 4) |
|
throw newInvalidAsn1Error('Integer too long: ' + this.length); |
|
|
|
if (this.length > this._size - o) |
|
return null; |
|
this._offset = o; |
|
|
|
var fb = this._buf[this._offset++]; |
|
var value = 0; |
|
|
|
value = fb & 0x7F; |
|
for (var i = 1; i < this.length; i++) { |
|
value <<= 8; |
|
value |= (this._buf[this._offset++] & 0xff); |
|
} |
|
|
|
if ((fb & 0x80) == 0x80) |
|
value = -value; |
|
|
|
return value; |
|
}; |
|
|
|
|
|
|
|
///--- Exported API |
|
|
|
module.exports = Reader; |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./errors":110,"./types":113,"assert":157,"buffer":172}],113:[function(require,module,exports){ |
|
// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved. |
|
|
|
|
|
module.exports = { |
|
EOC: 0, |
|
Boolean: 1, |
|
Integer: 2, |
|
BitString: 3, |
|
OctetString: 4, |
|
Null: 5, |
|
OID: 6, |
|
ObjectDescriptor: 7, |
|
External: 8, |
|
Real: 9, // float |
|
Enumeration: 10, |
|
PDV: 11, |
|
Utf8String: 12, |
|
RelativeOID: 13, |
|
Sequence: 16, |
|
Set: 17, |
|
NumericString: 18, |
|
PrintableString: 19, |
|
T61String: 20, |
|
VideotexString: 21, |
|
IA5String: 22, |
|
UTCTime: 23, |
|
GeneralizedTime: 24, |
|
GraphicString: 25, |
|
VisibleString: 26, |
|
GeneralString: 28, |
|
UniversalString: 29, |
|
CharacterString: 30, |
|
BMPString: 31, |
|
Constructor: 32, |
|
Context: 128 |
|
}; |
|
|
|
},{}],114:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved. |
|
|
|
var assert = require('assert'); |
|
var ASN1 = require('./types'); |
|
var errors = require('./errors'); |
|
|
|
|
|
///--- Globals |
|
|
|
var newInvalidAsn1Error = errors.newInvalidAsn1Error; |
|
|
|
var DEFAULT_OPTS = { |
|
size: 1024, |
|
growthFactor: 8 |
|
}; |
|
|
|
|
|
///--- Helpers |
|
|
|
function merge(from, to) { |
|
assert.ok(from); |
|
assert.equal(typeof(from), 'object'); |
|
assert.ok(to); |
|
assert.equal(typeof(to), 'object'); |
|
|
|
var keys = Object.getOwnPropertyNames(from); |
|
keys.forEach(function(key) { |
|
if (to[key]) |
|
return; |
|
|
|
var value = Object.getOwnPropertyDescriptor(from, key); |
|
Object.defineProperty(to, key, value); |
|
}); |
|
|
|
return to; |
|
} |
|
|
|
|
|
|
|
///--- API |
|
|
|
function Writer(options) { |
|
options = merge(DEFAULT_OPTS, options || {}); |
|
|
|
this._buf = new Buffer(options.size || 1024); |
|
this._size = this._buf.length; |
|
this._offset = 0; |
|
this._options = options; |
|
|
|
// A list of offsets in the buffer where we need to insert |
|
// sequence tag/len pairs. |
|
this._seq = []; |
|
|
|
var self = this; |
|
this.__defineGetter__('buffer', function() { |
|
if (self._seq.length) |
|
throw new InvalidAsn1Error(self._seq.length + ' unended sequence(s)'); |
|
|
|
return self._buf.slice(0, self._offset); |
|
}); |
|
} |
|
|
|
|
|
Writer.prototype.writeByte = function(b) { |
|
if (typeof(b) !== 'number') |
|
throw new TypeError('argument must be a Number'); |
|
|
|
this._ensure(1); |
|
this._buf[this._offset++] = b; |
|
}; |
|
|
|
|
|
Writer.prototype.writeInt = function(i, tag) { |
|
if (typeof(i) !== 'number') |
|
throw new TypeError('argument must be a Number'); |
|
if (typeof(tag) !== 'number') |
|
tag = ASN1.Integer; |
|
|
|
var sz = 4; |
|
|
|
while ((((i & 0xff800000) === 0) || ((i & 0xff800000) === 0xff800000)) && |
|
(sz > 1)) { |
|
sz--; |
|
i <<= 8; |
|
} |
|
|
|
if (sz > 4) |
|
throw new InvalidAsn1Error('BER ints cannot be > 0xffffffff'); |
|
|
|
this._ensure(2 + sz); |
|
this._buf[this._offset++] = tag; |
|
this._buf[this._offset++] = sz; |
|
|
|
while (sz-- > 0) { |
|
this._buf[this._offset++] = ((i & 0xff000000) >> 24); |
|
i <<= 8; |
|
} |
|
|
|
}; |
|
|
|
|
|
Writer.prototype.writeNull = function() { |
|
this.writeByte(ASN1.Null); |
|
this.writeByte(0x00); |
|
}; |
|
|
|
|
|
Writer.prototype.writeEnumeration = function(i, tag) { |
|
if (typeof(i) !== 'number') |
|
throw new TypeError('argument must be a Number'); |
|
if (typeof(tag) !== 'number') |
|
tag = ASN1.Enumeration; |
|
|
|
return this.writeInt(i, tag); |
|
}; |
|
|
|
|
|
Writer.prototype.writeBoolean = function(b, tag) { |
|
if (typeof(b) !== 'boolean') |
|
throw new TypeError('argument must be a Boolean'); |
|
if (typeof(tag) !== 'number') |
|
tag = ASN1.Boolean; |
|
|
|
this._ensure(3); |
|
this._buf[this._offset++] = tag; |
|
this._buf[this._offset++] = 0x01; |
|
this._buf[this._offset++] = b ? 0xff : 0x00; |
|
}; |
|
|
|
|
|
Writer.prototype.writeString = function(s, tag) { |
|
if (typeof(s) !== 'string') |
|
throw new TypeError('argument must be a string (was: ' + typeof(s) + ')'); |
|
if (typeof(tag) !== 'number') |
|
tag = ASN1.OctetString; |
|
|
|
var len = Buffer.byteLength(s); |
|
this.writeByte(tag); |
|
this.writeLength(len); |
|
if (len) { |
|
this._ensure(len); |
|
this._buf.write(s, this._offset); |
|
this._offset += len; |
|
} |
|
}; |
|
|
|
|
|
Writer.prototype.writeBuffer = function(buf, tag) { |
|
if (typeof(tag) !== 'number') |
|
throw new TypeError('tag must be a number'); |
|
if (!Buffer.isBuffer(buf)) |
|
throw new TypeError('argument must be a buffer'); |
|
|
|
this.writeByte(tag); |
|
this.writeLength(buf.length); |
|
this._ensure(buf.length); |
|
buf.copy(this._buf, this._offset, 0, buf.length); |
|
this._offset += buf.length; |
|
}; |
|
|
|
|
|
Writer.prototype.writeStringArray = function(strings) { |
|
if ((!strings instanceof Array)) |
|
throw new TypeError('argument must be an Array[String]'); |
|
|
|
var self = this; |
|
strings.forEach(function(s) { |
|
self.writeString(s); |
|
}); |
|
}; |
|
|
|
// This is really to solve DER cases, but whatever for now |
|
Writer.prototype.writeOID = function(s, tag) { |
|
if (typeof(s) !== 'string') |
|
throw new TypeError('argument must be a string'); |
|
if (typeof(tag) !== 'number') |
|
tag = ASN1.OID; |
|
|
|
if (!/^([0-9]+\.){3,}[0-9]+$/.test(s)) |
|
throw new Error('argument is not a valid OID string'); |
|
|
|
function encodeOctet(bytes, octet) { |
|
if (octet < 128) { |
|
bytes.push(octet); |
|
} else if (octet < 16384) { |
|
bytes.push((octet >>> 7) | 0x80); |
|
bytes.push(octet & 0x7F); |
|
} else if (octet < 2097152) { |
|
bytes.push((octet >>> 14) | 0x80); |
|
bytes.push(((octet >>> 7) | 0x80) & 0xFF); |
|
bytes.push(octet & 0x7F); |
|
} else if (octet < 268435456) { |
|
bytes.push((octet >>> 21) | 0x80); |
|
bytes.push(((octet >>> 14) | 0x80) & 0xFF); |
|
bytes.push(((octet >>> 7) | 0x80) & 0xFF); |
|
bytes.push(octet & 0x7F); |
|
} else { |
|
bytes.push(((octet >>> 28) | 0x80) & 0xFF); |
|
bytes.push(((octet >>> 21) | 0x80) & 0xFF); |
|
bytes.push(((octet >>> 14) | 0x80) & 0xFF); |
|
bytes.push(((octet >>> 7) | 0x80) & 0xFF); |
|
bytes.push(octet & 0x7F); |
|
} |
|
} |
|
|
|
var tmp = s.split('.'); |
|
var bytes = []; |
|
bytes.push(parseInt(tmp[0], 10) * 40 + parseInt(tmp[1], 10)); |
|
tmp.slice(2).forEach(function(b) { |
|
encodeOctet(bytes, parseInt(b, 10)); |
|
}); |
|
|
|
var self = this; |
|
this._ensure(2 + bytes.length); |
|
this.writeByte(tag); |
|
this.writeLength(bytes.length); |
|
bytes.forEach(function(b) { |
|
self.writeByte(b); |
|
}); |
|
}; |
|
|
|
|
|
Writer.prototype.writeLength = function(len) { |
|
if (typeof(len) !== 'number') |
|
throw new TypeError('argument must be a Number'); |
|
|
|
this._ensure(4); |
|
|
|
if (len <= 0x7f) { |
|
this._buf[this._offset++] = len; |
|
} else if (len <= 0xff) { |
|
this._buf[this._offset++] = 0x81; |
|
this._buf[this._offset++] = len; |
|
} else if (len <= 0xffff) { |
|
this._buf[this._offset++] = 0x82; |
|
this._buf[this._offset++] = len >> 8; |
|
this._buf[this._offset++] = len; |
|
} else if (len <= 0xffffff) { |
|
this._shift(start, len, 1); |
|
this._buf[this._offset++] = 0x83; |
|
this._buf[this._offset++] = len >> 16; |
|
this._buf[this._offset++] = len >> 8; |
|
this._buf[this._offset++] = len; |
|
} else { |
|
throw new InvalidAsn1ERror('Length too long (> 4 bytes)'); |
|
} |
|
}; |
|
|
|
Writer.prototype.startSequence = function(tag) { |
|
if (typeof(tag) !== 'number') |
|
tag = ASN1.Sequence | ASN1.Constructor; |
|
|
|
this.writeByte(tag); |
|
this._seq.push(this._offset); |
|
this._ensure(3); |
|
this._offset += 3; |
|
}; |
|
|
|
|
|
Writer.prototype.endSequence = function() { |
|
var seq = this._seq.pop(); |
|
var start = seq + 3; |
|
var len = this._offset - start; |
|
|
|
if (len <= 0x7f) { |
|
this._shift(start, len, -2); |
|
this._buf[seq] = len; |
|
} else if (len <= 0xff) { |
|
this._shift(start, len, -1); |
|
this._buf[seq] = 0x81; |
|
this._buf[seq + 1] = len; |
|
} else if (len <= 0xffff) { |
|
this._buf[seq] = 0x82; |
|
this._buf[seq + 1] = len >> 8; |
|
this._buf[seq + 2] = len; |
|
} else if (len <= 0xffffff) { |
|
this._shift(start, len, 1); |
|
this._buf[seq] = 0x83; |
|
this._buf[seq + 1] = len >> 16; |
|
this._buf[seq + 2] = len >> 8; |
|
this._buf[seq + 3] = len; |
|
} else { |
|
throw new InvalidAsn1Error('Sequence too long'); |
|
} |
|
}; |
|
|
|
|
|
Writer.prototype._shift = function(start, len, shift) { |
|
assert.ok(start !== undefined); |
|
assert.ok(len !== undefined); |
|
assert.ok(shift); |
|
|
|
this._buf.copy(this._buf, start + shift, start, start + len); |
|
this._offset += shift; |
|
}; |
|
|
|
Writer.prototype._ensure = function(len) { |
|
assert.ok(len); |
|
|
|
if (this._size - this._offset < len) { |
|
var sz = this._size * this._options.growthFactor; |
|
if (sz - this._offset < len) |
|
sz += len; |
|
|
|
var buf = new Buffer(sz); |
|
|
|
this._buf.copy(buf, 0, 0, this._offset); |
|
this._buf = buf; |
|
this._size = sz; |
|
} |
|
}; |
|
|
|
|
|
|
|
///--- Exported API |
|
|
|
module.exports = Writer; |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./errors":110,"./types":113,"assert":157,"buffer":172}],115:[function(require,module,exports){ |
|
// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved. |
|
|
|
// If you have no idea what ASN.1 or BER is, see this: |
|
// ftp://ftp.rsa.com/pub/pkcs/ascii/layman.asc |
|
|
|
var Ber = require('./ber/index'); |
|
|
|
|
|
|
|
///--- Exported API |
|
|
|
module.exports = { |
|
|
|
Ber: Ber, |
|
|
|
BerReader: Ber.Reader, |
|
|
|
BerWriter: Ber.Writer |
|
|
|
}; |
|
|
|
},{"./ber/index":111}],116:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
// Copyright (c) 2012, Mark Cavage. All rights reserved. |
|
|
|
var assert = require('assert'); |
|
var Stream = require('stream').Stream; |
|
var util = require('util'); |
|
|
|
|
|
|
|
///--- Globals |
|
|
|
var NDEBUG = process.env.NODE_NDEBUG || false; |
|
var UUID_REGEXP = /^[a-fA-F0-9]{8}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{12}$/; |
|
|
|
|
|
|
|
///--- Messages |
|
|
|
var ARRAY_TYPE_REQUIRED = '%s ([%s]) required'; |
|
var TYPE_REQUIRED = '%s (%s) is required'; |
|
|
|
|
|
|
|
///--- Internal |
|
|
|
function capitalize(str) { |
|
return (str.charAt(0).toUpperCase() + str.slice(1)); |
|
} |
|
|
|
function uncapitalize(str) { |
|
return (str.charAt(0).toLowerCase() + str.slice(1)); |
|
} |
|
|
|
function _() { |
|
return (util.format.apply(util, arguments)); |
|
} |
|
|
|
|
|
function _assert(arg, type, name, stackFunc) { |
|
if (!NDEBUG) { |
|
name = name || type; |
|
stackFunc = stackFunc || _assert.caller; |
|
var t = typeof (arg); |
|
|
|
if (t !== type) { |
|
throw new assert.AssertionError({ |
|
message: _(TYPE_REQUIRED, name, type), |
|
actual: t, |
|
expected: type, |
|
operator: '===', |
|
stackStartFunction: stackFunc |
|
}); |
|
} |
|
} |
|
} |
|
|
|
|
|
function _instanceof(arg, type, name, stackFunc) { |
|
if (!NDEBUG) { |
|
name = name || type; |
|
stackFunc = stackFunc || _instanceof.caller; |
|
|
|
if (!(arg instanceof type)) { |
|
throw new assert.AssertionError({ |
|
message: _(TYPE_REQUIRED, name, type.name), |
|
actual: _getClass(arg), |
|
expected: type.name, |
|
operator: 'instanceof', |
|
stackStartFunction: stackFunc |
|
}); |
|
} |
|
} |
|
} |
|
|
|
function _getClass(object) { |
|
return (Object.prototype.toString.call(object).slice(8, -1)); |
|
}; |
|
|
|
|
|
|
|
///--- API |
|
|
|
function array(arr, type, name) { |
|
if (!NDEBUG) { |
|
name = name || type; |
|
|
|
if (!Array.isArray(arr)) { |
|
throw new assert.AssertionError({ |
|
message: _(ARRAY_TYPE_REQUIRED, name, type), |
|
actual: typeof (arr), |
|
expected: 'array', |
|
operator: 'Array.isArray', |
|
stackStartFunction: array.caller |
|
}); |
|
} |
|
|
|
for (var i = 0; i < arr.length; i++) { |
|
_assert(arr[i], type, name, array); |
|
} |
|
} |
|
} |
|
|
|
|
|
function bool(arg, name) { |
|
_assert(arg, 'boolean', name, bool); |
|
} |
|
|
|
|
|
function buffer(arg, name) { |
|
if (!Buffer.isBuffer(arg)) { |
|
throw new assert.AssertionError({ |
|
message: _(TYPE_REQUIRED, name || '', 'Buffer'), |
|
actual: typeof (arg), |
|
expected: 'buffer', |
|
operator: 'Buffer.isBuffer', |
|
stackStartFunction: buffer |
|
}); |
|
} |
|
} |
|
|
|
|
|
function func(arg, name) { |
|
_assert(arg, 'function', name); |
|
} |
|
|
|
|
|
function number(arg, name) { |
|
_assert(arg, 'number', name); |
|
if (!NDEBUG && (isNaN(arg) || !isFinite(arg))) { |
|
throw new assert.AssertionError({ |
|
message: _(TYPE_REQUIRED, name, 'number'), |
|
actual: arg, |
|
expected: 'number', |
|
operator: 'isNaN', |
|
stackStartFunction: number |
|
}); |
|
} |
|
} |
|
|
|
|
|
function object(arg, name) { |
|
_assert(arg, 'object', name); |
|
} |
|
|
|
|
|
function stream(arg, name) { |
|
_instanceof(arg, Stream, name); |
|
} |
|
|
|
|
|
function date(arg, name) { |
|
_instanceof(arg, Date, name); |
|
} |
|
|
|
function regexp(arg, name) { |
|
_instanceof(arg, RegExp, name); |
|
} |
|
|
|
|
|
function string(arg, name) { |
|
_assert(arg, 'string', name); |
|
} |
|
|
|
|
|
function uuid(arg, name) { |
|
string(arg, name); |
|
if (!NDEBUG && !UUID_REGEXP.test(arg)) { |
|
throw new assert.AssertionError({ |
|
message: _(TYPE_REQUIRED, name, 'uuid'), |
|
actual: 'string', |
|
expected: 'uuid', |
|
operator: 'test', |
|
stackStartFunction: uuid |
|
}); |
|
} |
|
} |
|
|
|
|
|
///--- Exports |
|
|
|
module.exports = { |
|
bool: bool, |
|
buffer: buffer, |
|
date: date, |
|
func: func, |
|
number: number, |
|
object: object, |
|
regexp: regexp, |
|
stream: stream, |
|
string: string, |
|
uuid: uuid |
|
}; |
|
|
|
|
|
Object.keys(module.exports).forEach(function (k) { |
|
if (k === 'buffer') |
|
return; |
|
|
|
var name = 'arrayOf' + capitalize(k); |
|
|
|
if (k === 'bool') |
|
k = 'boolean'; |
|
if (k === 'func') |
|
k = 'function'; |
|
module.exports[name] = function (arg, name) { |
|
array(arg, k, name); |
|
}; |
|
}); |
|
|
|
Object.keys(module.exports).forEach(function (k) { |
|
var _name = 'optional' + capitalize(k); |
|
var s = uncapitalize(k.replace('arrayOf', '')); |
|
if (s === 'bool') |
|
s = 'boolean'; |
|
if (s === 'func') |
|
s = 'function'; |
|
|
|
if (k.indexOf('arrayOf') !== -1) { |
|
module.exports[_name] = function (arg, name) { |
|
if (!NDEBUG && arg !== undefined) { |
|
array(arg, s, name); |
|
} |
|
}; |
|
} else { |
|
module.exports[_name] = function (arg, name) { |
|
if (!NDEBUG && arg !== undefined) { |
|
_assert(arg, s, name); |
|
} |
|
}; |
|
} |
|
}); |
|
|
|
|
|
// Reexport built-in assertions |
|
Object.keys(assert).forEach(function (k) { |
|
if (k === 'AssertionError') { |
|
module.exports[k] = assert[k]; |
|
return; |
|
} |
|
|
|
module.exports[k] = function () { |
|
if (!NDEBUG) { |
|
assert[k].apply(assert[k], arguments); |
|
} |
|
}; |
|
}); |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"_process":323,"assert":157,"buffer":172,"stream":339,"util":343}],117:[function(require,module,exports){ |
|
/* |
|
* ctf.js |
|
* |
|
* Understand and parse all of the different JSON formats of CTF data and |
|
* translate that into a series of node-ctype friendly pieces. The reason for |
|
* the abstraction is to handle different changes in the file format. |
|
* |
|
* We have to be careful here that we don't end up using a name that is already |
|
* a built in type. |
|
*/ |
|
var mod_assert = require('assert'); |
|
var ASSERT = mod_assert.ok; |
|
|
|
var ctf_versions = [ '1.0' ]; |
|
var ctf_entries = [ 'integer', 'float', 'typedef', 'struct' ]; |
|
var ctf_deftypes = [ 'int8_t', 'uint8_t', 'int16_t', 'uint16_t', 'int32_t', |
|
'uint32_t', 'float', 'double' ]; |
|
|
|
function ctfParseInteger(entry, ctype) |
|
{ |
|
var name, sign, len, type; |
|
|
|
name = entry['name']; |
|
if (!('signed' in entry['integer'])) |
|
throw (new Error('Malformed CTF JSON: integer missing ' + |
|
'signed value')); |
|
|
|
|
|
if (!('length' in entry['integer'])) |
|
throw (new Error('Malformed CTF JSON: integer missing ' + |
|
'length value')); |
|
|
|
sign = entry['integer']['signed']; |
|
len = entry['integer']['length']; |
|
type = null; |
|
|
|
if (sign && len == 1) |
|
type = 'int8_t'; |
|
else if (len == 1) |
|
type = 'uint8_t'; |
|
else if (sign && len == 2) |
|
type = 'int16_t'; |
|
else if (len == 2) |
|
type = 'uint16_t'; |
|
else if (sign && len == 4) |
|
type = 'int32_t'; |
|
else if (len == 4) |
|
type = 'uint32_t'; |
|
else if (sign && len == 8) |
|
type = 'int64_t'; |
|
else if (len == 8) |
|
type = 'uint64_t'; |
|
|
|
if (type === null) |
|
throw (new Error('Malformed CTF JSON: integer has ' + |
|
'unsupported length and sign - ' + len + '/' + sign)); |
|
|
|
/* |
|
* This means that this is the same as one of our built in types. If |
|
* that's the case defining it would be an error. So instead of trying |
|
* to typedef it, we'll return here. |
|
*/ |
|
if (name == type) |
|
return; |
|
|
|
if (name == 'char') { |
|
ASSERT(type == 'int8_t'); |
|
return; |
|
} |
|
|
|
ctype.typedef(name, type); |
|
} |
|
|
|
function ctfParseFloat(entry, ctype) |
|
{ |
|
var name, len; |
|
|
|
name = entry['name']; |
|
if (!('length' in entry['float'])) |
|
throw (new Error('Malformed CTF JSON: float missing ' + |
|
'length value')); |
|
|
|
len = entry['float']['length']; |
|
if (len != 4 && len != 8) |
|
throw (new Error('Malformed CTF JSON: float has invalid ' + |
|
'length value')); |
|
|
|
if (len == 4) { |
|
if (name == 'float') |
|
return; |
|
ctype.typedef(name, 'float'); |
|
} else if (len == 8) { |
|
if (name == 'double') |
|
return; |
|
ctype.typedef(name, 'double'); |
|
} |
|
} |
|
|
|
function ctfParseTypedef(entry, ctype) |
|
{ |
|
var name, type, ii; |
|
|
|
name = entry['name']; |
|
if (typeof (entry['typedef']) != 'string') |
|
throw (new Error('Malformed CTF JSON: typedef value in not ' + |
|
'a string')); |
|
|
|
type = entry['typedef']; |
|
|
|
/* |
|
* We need to ensure that we're not looking at type that's one of our |
|
* built in types. Traditionally in C a uint32_t would be a typedef to |
|
* some kind of integer. However, those size types are built ins. |
|
*/ |
|
for (ii = 0; ii < ctf_deftypes.length; ii++) { |
|
if (name == ctf_deftypes[ii]) |
|
return; |
|
} |
|
|
|
ctype.typedef(name, type); |
|
} |
|
|
|
function ctfParseStruct(entry, ctype) |
|
{ |
|
var name, type, ii, val, index, member, push; |
|
|
|
member = []; |
|
if (!Array.isArray(entry['struct'])) |
|
throw (new Error('Malformed CTF JSON: struct value is not ' + |
|
'an array')); |
|
|
|
for (ii = 0; ii < entry['struct'].length; ii++) { |
|
val = entry['struct'][ii]; |
|
if (!('name' in val)) |
|
throw (new Error('Malformed CTF JSON: struct member ' + |
|
'missing name')); |
|
|
|
if (!('type' in val)) |
|
throw (new Error('Malformed CTF JSON: struct member ' + |
|
'missing type')); |
|
|
|
if (typeof (val['name']) != 'string') |
|
throw (new Error('Malformed CTF JSON: struct member ' + |
|
'name isn\'t a string')); |
|
|
|
if (typeof (val['type']) != 'string') |
|
throw (new Error('Malformed CTF JSON: struct member ' + |
|
'type isn\'t a string')); |
|
|
|
/* |
|
* CTF version 2 specifies array names as <type> [<num>] where |
|
* as node-ctype does this as <type>[<num>]. |
|
*/ |
|
name = val['name']; |
|
type = val['type']; |
|
index = type.indexOf(' ['); |
|
if (index != -1) { |
|
type = type.substring(0, index) + |
|
type.substring(index + 1, type.length); |
|
} |
|
push = {}; |
|
push[name] = { 'type': type }; |
|
member.push(push); |
|
} |
|
|
|
name = entry['name']; |
|
ctype.typedef(name, member); |
|
} |
|
|
|
function ctfParseEntry(entry, ctype) |
|
{ |
|
var ii, found; |
|
|
|
if (!('name' in entry)) |
|
throw (new Error('Malformed CTF JSON: entry missing "name" ' + |
|
'section')); |
|
|
|
for (ii = 0; ii < ctf_entries.length; ii++) { |
|
if (ctf_entries[ii] in entry) |
|
found++; |
|
} |
|
|
|
if (found === 0) |
|
throw (new Error('Malformed CTF JSON: found no entries')); |
|
|
|
if (found >= 2) |
|
throw (new Error('Malformed CTF JSON: found more than one ' + |
|
'entry')); |
|
|
|
if ('integer' in entry) { |
|
ctfParseInteger(entry, ctype); |
|
return; |
|
} |
|
|
|
if ('float' in entry) { |
|
ctfParseFloat(entry, ctype); |
|
return; |
|
} |
|
|
|
if ('typedef' in entry) { |
|
ctfParseTypedef(entry, ctype); |
|
return; |
|
} |
|
|
|
if ('struct' in entry) { |
|
ctfParseStruct(entry, ctype); |
|
return; |
|
} |
|
|
|
ASSERT(false, 'shouldn\'t reach here'); |
|
} |
|
|
|
function ctfParseJson(json, ctype) |
|
{ |
|
var version, ii; |
|
|
|
ASSERT(json); |
|
ASSERT(ctype); |
|
if (!('metadata' in json)) |
|
throw (new Error('Invalid CTF JSON: missing metadata section')); |
|
|
|
if (!('ctf2json_version' in json['metadata'])) |
|
throw (new Error('Invalid CTF JSON: missing ctf2json_version')); |
|
|
|
version = json['metadata']['ctf2json_version']; |
|
for (ii = 0; ii < ctf_versions.length; ii++) { |
|
if (ctf_versions[ii] == version) |
|
break; |
|
} |
|
|
|
if (ii == ctf_versions.length) |
|
throw (new Error('Unsuported ctf2json_version: ' + version)); |
|
|
|
if (!('data' in json)) |
|
throw (new Error('Invalid CTF JSON: missing data section')); |
|
|
|
if (!Array.isArray(json['data'])) |
|
throw (new Error('Malformed CTF JSON: data section is not ' + |
|
'an array')); |
|
|
|
for (ii = 0; ii < json['data'].length; ii++) |
|
ctfParseEntry(json['data'][ii], ctype); |
|
} |
|
|
|
exports.ctfParseJson = ctfParseJson; |
|
|
|
},{"assert":157}],118:[function(require,module,exports){ |
|
/* |
|
* rm - Feb 2011 |
|
* ctio.js: |
|
* |
|
* A simple way to read and write simple ctypes. Of course, as you'll find the |
|
* code isn't as simple as it might appear. The following types are currently |
|
* supported in big and little endian formats: |
|
* |
|
* uint8_t int8_t |
|
* uint16_t int16_t |
|
* uint32_t int32_t |
|
* float (single precision IEEE 754) |
|
* double (double precision IEEE 754) |
|
* |
|
* This is designed to work in Node and v8. It may in fact work in other |
|
* Javascript interpreters (that'd be pretty neat), but it hasn't been tested. |
|
* If you find that it does in fact work, that's pretty cool. Try and pass word |
|
* back to the original author. |
|
* |
|
* Note to the reader: If you're tabstop isn't set to 8, parts of this may look |
|
* weird. |
|
*/ |
|
|
|
/* |
|
* Numbers in Javascript have a secret: all numbers must be represented with an |
|
* IEEE-754 double. The double has a mantissa with a length of 52 bits with an |
|
* implicit one. Thus the range of integers that can be represented is limited |
|
* to the size of the mantissa, this makes reading and writing 64-bit integers |
|
* difficult, but far from impossible. |
|
* |
|
* Another side effect of this representation is what happens when you use the |
|
* bitwise operators, i.e. shift left, shift right, and, or, etc. In Javascript, |
|
* each operand and the result is cast to a signed 32-bit number. However, in |
|
* the case of >>> the values are cast to an unsigned number. |
|
*/ |
|
|
|
/* |
|
* A reminder on endian related issues: |
|
* |
|
* Big Endian: MSB -> First byte |
|
* Little Endian: MSB->Last byte |
|
*/ |
|
var mod_assert = require('assert'); |
|
|
|
/* |
|
* An 8 bit unsigned integer involves doing no significant work. |
|
*/ |
|
function ruint8(buffer, endian, offset) |
|
{ |
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
return (buffer[offset]); |
|
} |
|
|
|
/* |
|
* For 16 bit unsigned numbers we can do all the casting that we want to do. |
|
*/ |
|
function rgint16(buffer, endian, offset) |
|
{ |
|
var val = 0; |
|
|
|
if (endian == 'big') { |
|
val = buffer[offset] << 8; |
|
val |= buffer[offset+1]; |
|
} else { |
|
val = buffer[offset]; |
|
val |= buffer[offset+1] << 8; |
|
} |
|
|
|
return (val); |
|
|
|
} |
|
|
|
function ruint16(buffer, endian, offset) |
|
{ |
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 1 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
return (rgint16(buffer, endian, offset)); |
|
} |
|
|
|
/* |
|
* Because most bitshifting is done using signed numbers, if we would go into |
|
* the realm where we use that 32nd bit, we'll end up going into the negative |
|
* range. i.e.: |
|
* > 200 << 24 |
|
* -939524096 |
|
* |
|
* Not the value you'd expect. To work around this, we end up having to do some |
|
* abuse of the JavaScript standard. in this case, we know that a >>> shift is |
|
* defined to cast our value to an *unsigned* 32-bit number. Because of that, we |
|
* use that instead to save us some additional math, though it does feel a |
|
* little weird and it isn't obvious as to why you woul dwant to do this at |
|
* first. |
|
*/ |
|
function rgint32(buffer, endian, offset) |
|
{ |
|
var val = 0; |
|
|
|
if (endian == 'big') { |
|
val = buffer[offset+1] << 16; |
|
val |= buffer[offset+2] << 8; |
|
val |= buffer[offset+3]; |
|
val = val + (buffer[offset] << 24 >>> 0); |
|
} else { |
|
val = buffer[offset+2] << 16; |
|
val |= buffer[offset+1] << 8; |
|
val |= buffer[offset]; |
|
val = val + (buffer[offset + 3] << 24 >>> 0); |
|
} |
|
|
|
return (val); |
|
} |
|
|
|
function ruint32(buffer, endian, offset) |
|
{ |
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
return (rgint32(buffer, endian, offset)); |
|
} |
|
|
|
/* |
|
* Reads a 64-bit unsigned number. The astue observer will note that this |
|
* doesn't quite work. Javascript has chosen to only have numbers that can be |
|
* represented by a double. A double only has 52 bits of mantissa with an |
|
* implicit 1, thus we have up to 53 bits to represent an integer. However, 2^53 |
|
* doesn't quite give us what we want. Isn't 53 bits enough for anyone? What |
|
* could you have possibly wanted to represent that was larger than that? Oh, |
|
* maybe a size? You mean we bypassed the 4 GB limit on file sizes, when did |
|
* that happen? |
|
* |
|
* To get around this egregious language issue, we're going to instead construct |
|
* an array of two 32 bit unsigned integers. Where arr[0] << 32 + arr[1] would |
|
* give the actual number. However, note that the above code probably won't |
|
* produce the desired results because of the way Javascript numbers are |
|
* doubles. |
|
*/ |
|
function rgint64(buffer, endian, offset) |
|
{ |
|
var val = new Array(2); |
|
|
|
if (endian == 'big') { |
|
val[0] = ruint32(buffer, endian, offset); |
|
val[1] = ruint32(buffer, endian, offset+4); |
|
} else { |
|
val[0] = ruint32(buffer, endian, offset+4); |
|
val[1] = ruint32(buffer, endian, offset); |
|
} |
|
|
|
return (val); |
|
} |
|
|
|
function ruint64(buffer, endian, offset) |
|
{ |
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 7 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
return (rgint64(buffer, endian, offset)); |
|
} |
|
|
|
|
|
/* |
|
* Signed integer types, yay team! A reminder on how two's complement actually |
|
* works. The first bit is the signed bit, i.e. tells us whether or not the |
|
* number should be positive or negative. If the two's complement value is |
|
* positive, then we're done, as it's equivalent to the unsigned representation. |
|
* |
|
* Now if the number is positive, you're pretty much done, you can just leverage |
|
* the unsigned translations and return those. Unfortunately, negative numbers |
|
* aren't quite that straightforward. |
|
* |
|
* At first glance, one might be inclined to use the traditional formula to |
|
* translate binary numbers between the positive and negative values in two's |
|
* complement. (Though it doesn't quite work for the most negative value) |
|
* Mainly: |
|
* - invert all the bits |
|
* - add one to the result |
|
* |
|
* Of course, this doesn't quite work in Javascript. Take for example the value |
|
* of -128. This could be represented in 16 bits (big-endian) as 0xff80. But of |
|
* course, Javascript will do the following: |
|
* |
|
* > ~0xff80 |
|
* -65409 |
|
* |
|
* Whoh there, Javascript, that's not quite right. But wait, according to |
|
* Javascript that's perfectly correct. When Javascript ends up seeing the |
|
* constant 0xff80, it has no notion that it is actually a signed number. It |
|
* assumes that we've input the unsigned value 0xff80. Thus, when it does the |
|
* binary negation, it casts it into a signed value, (positive 0xff80). Then |
|
* when you perform binary negation on that, it turns it into a negative number. |
|
* |
|
* Instead, we're going to have to use the following general formula, that works |
|
* in a rather Javascript friendly way. I'm glad we don't support this kind of |
|
* weird numbering scheme in the kernel. |
|
* |
|
* (BIT-MAX - (unsigned)val + 1) * -1 |
|
* |
|
* The astute observer, may think that this doesn't make sense for 8-bit numbers |
|
* (really it isn't necessary for them). However, when you get 16-bit numbers, |
|
* you do. Let's go back to our prior example and see how this will look: |
|
* |
|
* (0xffff - 0xff80 + 1) * -1 |
|
* (0x007f + 1) * -1 |
|
* (0x0080) * -1 |
|
* |
|
* Doing it this way ends up allowing us to treat it appropriately in |
|
* Javascript. Sigh, that's really quite ugly for what should just be a few bit |
|
* shifts, ~ and &. |
|
*/ |
|
|
|
/* |
|
* Endianness doesn't matter for 8-bit signed values. We could in fact optimize |
|
* this case because the more traditional methods work, but for consistency, |
|
* we'll keep doing this the same way. |
|
*/ |
|
function rsint8(buffer, endian, offset) |
|
{ |
|
var neg; |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
neg = buffer[offset] & 0x80; |
|
if (!neg) |
|
return (buffer[offset]); |
|
|
|
return ((0xff - buffer[offset] + 1) * -1); |
|
} |
|
|
|
/* |
|
* The 16-bit version requires a bit more effort. In this case, we can leverage |
|
* our unsigned code to generate the value we want to return. |
|
*/ |
|
function rsint16(buffer, endian, offset) |
|
{ |
|
var neg, val; |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 1 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = rgint16(buffer, endian, offset); |
|
neg = val & 0x8000; |
|
if (!neg) |
|
return (val); |
|
|
|
return ((0xffff - val + 1) * -1); |
|
} |
|
|
|
/* |
|
* We really shouldn't leverage our 32-bit code here and instead utilize the |
|
* fact that we know that since these are signed numbers, we can do all the |
|
* shifting and binary anding to generate the 32-bit number. But, for |
|
* consistency we'll do the same. If we want to do otherwise, we should instead |
|
* make the 32 bit unsigned code do the optimization. But as long as there |
|
* aren't floats secretly under the hood for that, we /should/ be okay. |
|
*/ |
|
function rsint32(buffer, endian, offset) |
|
{ |
|
var neg, val; |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = rgint32(buffer, endian, offset); |
|
neg = val & 0x80000000; |
|
if (!neg) |
|
return (val); |
|
|
|
return ((0xffffffff - val + 1) * -1); |
|
} |
|
|
|
/* |
|
* The signed version of this code suffers from all of the same problems of the |
|
* other 64 bit version. |
|
*/ |
|
function rsint64(buffer, endian, offset) |
|
{ |
|
var neg, val; |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = rgint64(buffer, endian, offset); |
|
neg = val[0] & 0x80000000; |
|
|
|
if (!neg) |
|
return (val); |
|
|
|
val[0] = (0xffffffff - val[0]) * -1; |
|
val[1] = (0xffffffff - val[1] + 1) * -1; |
|
|
|
/* |
|
* If we had the key 0x8000000000000000, that would leave the lower 32 |
|
* bits as 0xffffffff, however, since we're goint to add one, that would |
|
* actually leave the lower 32-bits as 0x100000000, which would break |
|
* our ability to write back a value that we received. To work around |
|
* this, if we actually get that value, we're going to bump the upper |
|
* portion by 1 and set this to zero. |
|
*/ |
|
mod_assert.ok(val[1] <= 0x100000000); |
|
if (val[1] == -0x100000000) { |
|
val[1] = 0; |
|
val[0]--; |
|
} |
|
|
|
return (val); |
|
} |
|
|
|
/* |
|
* We now move onto IEEE 754: The traditional form for floating point numbers |
|
* and what is secretly hiding at the heart of everything in this. I really hope |
|
* that someone is actually using this, as otherwise, this effort is probably |
|
* going to be more wasted. |
|
* |
|
* One might be tempted to use parseFloat here, but that wouldn't work at all |
|
* for several reasons. Mostly due to the way floats actually work, and |
|
* parseFloat only actually works in base 10. I don't see base 10 anywhere near |
|
* this file. |
|
* |
|
* In this case we'll implement the single and double precision versions. The |
|
* quadruple precision, while probably useful, wouldn't really be accepted by |
|
* Javascript, so let's not even waste our time. |
|
* |
|
* So let's review how this format looks like. A single precision value is 32 |
|
* bits and has three parts: |
|
* - Sign bit |
|
* - Exponent (Using bias notation) |
|
* - Mantissa |
|
* |
|
* |s|eeeeeeee|mmmmmmmmmmmmmmmmmmmmmmmmm| |
|
* 31| 30-23 | 22 - 0 | |
|
* |
|
* The exponent is stored in a biased input. The bias in this case 127. |
|
* Therefore, our exponent is equal to the 8-bit value - 127. |
|
* |
|
* By default, a number is normalized in IEEE, that means that the mantissa has |
|
* an implicit one that we don't see. So really the value stored is 1.m. |
|
* However, if the exponent is all zeros, then instead we have to shift |
|
* everything to the right one and there is no more implicit one. |
|
* |
|
* Special values: |
|
* - Positive Infinity: |
|
* Sign: 0 |
|
* Exponent: All 1s |
|
* Mantissa: 0 |
|
* - Negative Infinity: |
|
* Sign: 1 |
|
* Exponent: All 1s |
|
* Mantissa: 0 |
|
* - NaN: |
|
* Sign: * |
|
* Exponent: All 1s |
|
* Mantissa: non-zero |
|
* - Zero: |
|
* Sign: * |
|
* Exponent: All 0s |
|
* Mantissa: 0 |
|
* |
|
* In the case of zero, the sign bit determines whether we get a positive or |
|
* negative zero. However, since Javascript cannot determine the difference |
|
* between the two: i.e. -0 == 0, we just always return 0. |
|
* |
|
*/ |
|
function rfloat(buffer, endian, offset) |
|
{ |
|
var bytes = []; |
|
var sign, exponent, mantissa, val; |
|
var bias = 127; |
|
var maxexp = 0xff; |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
/* Normalize the bytes to be in endian order */ |
|
if (endian == 'big') { |
|
bytes[0] = buffer[offset]; |
|
bytes[1] = buffer[offset+1]; |
|
bytes[2] = buffer[offset+2]; |
|
bytes[3] = buffer[offset+3]; |
|
} else { |
|
bytes[3] = buffer[offset]; |
|
bytes[2] = buffer[offset+1]; |
|
bytes[1] = buffer[offset+2]; |
|
bytes[0] = buffer[offset+3]; |
|
} |
|
|
|
sign = bytes[0] & 0x80; |
|
exponent = (bytes[0] & 0x7f) << 1; |
|
exponent |= (bytes[1] & 0x80) >>> 7; |
|
mantissa = (bytes[1] & 0x7f) << 16; |
|
mantissa |= bytes[2] << 8; |
|
mantissa |= bytes[3]; |
|
|
|
/* Check for special cases before we do general parsing */ |
|
if (!sign && exponent == maxexp && mantissa === 0) |
|
return (Number.POSITIVE_INFINITY); |
|
|
|
if (sign && exponent == maxexp && mantissa === 0) |
|
return (Number.NEGATIVE_INFINITY); |
|
|
|
if (exponent == maxexp && mantissa !== 0) |
|
return (Number.NaN); |
|
|
|
/* |
|
* Javascript really doesn't have support for positive or negative zero. |
|
* So we're not going to try and give it to you. That would be just |
|
* plain weird. Besides -0 == 0. |
|
*/ |
|
if (exponent === 0 && mantissa === 0) |
|
return (0); |
|
|
|
/* |
|
* Now we can deal with the bias and the determine whether the mantissa |
|
* has the implicit one or not. |
|
*/ |
|
exponent -= bias; |
|
if (exponent == -bias) { |
|
exponent++; |
|
val = 0; |
|
} else { |
|
val = 1; |
|
} |
|
|
|
val = (val + mantissa * Math.pow(2, -23)) * Math.pow(2, exponent); |
|
|
|
if (sign) |
|
val *= -1; |
|
|
|
return (val); |
|
} |
|
|
|
/* |
|
* Doubles in IEEE 754 are like their brothers except for a few changes and |
|
* increases in size: |
|
* - The exponent is now 11 bits |
|
* - The mantissa is now 52 bits |
|
* - The bias is now 1023 |
|
* |
|
* |s|eeeeeeeeeee|mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm| |
|
* 63| 62 - 52 | 51 - 0 | |
|
* 63| 62 - 52 | 51 - 0 | |
|
* |
|
* While the size has increased a fair amount, we're going to end up keeping the |
|
* same general formula for calculating the final value. As a reminder, this |
|
* formula is: |
|
* |
|
* (-1)^s * (n + m) * 2^(e-b) |
|
* |
|
* Where: |
|
* s is the sign bit |
|
* n is (exponent > 0) ? 1 : 0 -- Determines whether we're normalized |
|
* or not |
|
* m is the mantissa |
|
* e is the exponent specified |
|
* b is the bias for the exponent |
|
* |
|
*/ |
|
function rdouble(buffer, endian, offset) |
|
{ |
|
var bytes = []; |
|
var sign, exponent, mantissa, val, lowmant; |
|
var bias = 1023; |
|
var maxexp = 0x7ff; |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 7 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
/* Normalize the bytes to be in endian order */ |
|
if (endian == 'big') { |
|
bytes[0] = buffer[offset]; |
|
bytes[1] = buffer[offset+1]; |
|
bytes[2] = buffer[offset+2]; |
|
bytes[3] = buffer[offset+3]; |
|
bytes[4] = buffer[offset+4]; |
|
bytes[5] = buffer[offset+5]; |
|
bytes[6] = buffer[offset+6]; |
|
bytes[7] = buffer[offset+7]; |
|
} else { |
|
bytes[7] = buffer[offset]; |
|
bytes[6] = buffer[offset+1]; |
|
bytes[5] = buffer[offset+2]; |
|
bytes[4] = buffer[offset+3]; |
|
bytes[3] = buffer[offset+4]; |
|
bytes[2] = buffer[offset+5]; |
|
bytes[1] = buffer[offset+6]; |
|
bytes[0] = buffer[offset+7]; |
|
} |
|
|
|
/* |
|
* We can construct the exponent and mantissa the same way as we did in |
|
* the case of a float, just increase the range of the exponent. |
|
*/ |
|
sign = bytes[0] & 0x80; |
|
exponent = (bytes[0] & 0x7f) << 4; |
|
exponent |= (bytes[1] & 0xf0) >>> 4; |
|
|
|
/* |
|
* This is going to be ugly but then again, we're dealing with IEEE 754. |
|
* This could probably be done as a node add on in a few lines of C++, |
|
* but oh we'll, we've made it this far so let's be native the rest of |
|
* the way... |
|
* |
|
* What we're going to do is break the mantissa into two parts, the |
|
* lower 24 bits and the upper 28 bits. We'll multiply the upper 28 bits |
|
* by the appropriate power and then add in the lower 24-bits. Not |
|
* really that great. It's pretty much a giant kludge to deal with |
|
* Javascript eccentricities around numbers. |
|
*/ |
|
lowmant = bytes[7]; |
|
lowmant |= bytes[6] << 8; |
|
lowmant |= bytes[5] << 16; |
|
mantissa = bytes[4]; |
|
mantissa |= bytes[3] << 8; |
|
mantissa |= bytes[2] << 16; |
|
mantissa |= (bytes[1] & 0x0f) << 24; |
|
mantissa *= Math.pow(2, 24); /* Equivalent to << 24, but JS compat */ |
|
mantissa += lowmant; |
|
|
|
/* Check for special cases before we do general parsing */ |
|
if (!sign && exponent == maxexp && mantissa === 0) |
|
return (Number.POSITIVE_INFINITY); |
|
|
|
if (sign && exponent == maxexp && mantissa === 0) |
|
return (Number.NEGATIVE_INFINITY); |
|
|
|
if (exponent == maxexp && mantissa !== 0) |
|
return (Number.NaN); |
|
|
|
/* |
|
* Javascript really doesn't have support for positive or negative zero. |
|
* So we're not going to try and give it to you. That would be just |
|
* plain weird. Besides -0 == 0. |
|
*/ |
|
if (exponent === 0 && mantissa === 0) |
|
return (0); |
|
|
|
/* |
|
* Now we can deal with the bias and the determine whether the mantissa |
|
* has the implicit one or not. |
|
*/ |
|
exponent -= bias; |
|
if (exponent == -bias) { |
|
exponent++; |
|
val = 0; |
|
} else { |
|
val = 1; |
|
} |
|
|
|
val = (val + mantissa * Math.pow(2, -52)) * Math.pow(2, exponent); |
|
|
|
if (sign) |
|
val *= -1; |
|
|
|
return (val); |
|
} |
|
|
|
/* |
|
* Now that we have gone through the pain of reading the individual types, we're |
|
* probably going to want some way to write these back. None of this is going to |
|
* be good. But since we have Javascript numbers this should certainly be more |
|
* interesting. Though we can constrain this end a little bit more in what is |
|
* valid. For now, let's go back to our friends the unsigned value. |
|
*/ |
|
|
|
/* |
|
* Unsigned numbers seem deceptively easy. Here are the general steps and rules |
|
* that we are going to take: |
|
* - If the number is negative, throw an Error |
|
* - Truncate any floating point portion |
|
* - Take the modulus of the number in our base |
|
* - Write it out to the buffer in the endian format requested at the offset |
|
*/ |
|
|
|
/* |
|
* We have to make sure that the value is a valid integer. This means that it is |
|
* non-negative. It has no fractional component and that it does not exceed the |
|
* maximum allowed value. |
|
* |
|
* value The number to check for validity |
|
* |
|
* max The maximum value |
|
*/ |
|
function prepuint(value, max) |
|
{ |
|
if (typeof (value) != 'number') |
|
throw (new (Error('cannot write a non-number as a number'))); |
|
|
|
if (value < 0) |
|
throw (new Error('specified a negative value for writing an ' + |
|
'unsigned value')); |
|
|
|
if (value > max) |
|
throw (new Error('value is larger than maximum value for ' + |
|
'type')); |
|
|
|
if (Math.floor(value) !== value) |
|
throw (new Error('value has a fractional component')); |
|
|
|
return (value); |
|
} |
|
|
|
/* |
|
* 8-bit version, classy. We can ignore endianness which is good. |
|
*/ |
|
function wuint8(value, endian, buffer, offset) |
|
{ |
|
var val; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = prepuint(value, 0xff); |
|
buffer[offset] = val; |
|
} |
|
|
|
/* |
|
* Pretty much the same as the 8-bit version, just this time we need to worry |
|
* about endian related issues. |
|
*/ |
|
function wgint16(val, endian, buffer, offset) |
|
{ |
|
if (endian == 'big') { |
|
buffer[offset] = (val & 0xff00) >>> 8; |
|
buffer[offset+1] = val & 0x00ff; |
|
} else { |
|
buffer[offset+1] = (val & 0xff00) >>> 8; |
|
buffer[offset] = val & 0x00ff; |
|
} |
|
} |
|
|
|
function wuint16(value, endian, buffer, offset) |
|
{ |
|
var val; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 1 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = prepuint(value, 0xffff); |
|
wgint16(val, endian, buffer, offset); |
|
} |
|
|
|
/* |
|
* The 32-bit version is going to have to be a little different unfortunately. |
|
* We can't quite bitshift to get the largest byte, because that would end up |
|
* getting us caught by the signed values. |
|
* |
|
* And yes, we do want to subtract out the lower part by default. This means |
|
* that when we do the division, it will be treated as a bit shift and we won't |
|
* end up generating a floating point value. If we did generate a floating point |
|
* value we'd have to truncate it intelligently, this saves us that problem and |
|
* may even be somewhat faster under the hood. |
|
*/ |
|
function wgint32(val, endian, buffer, offset) |
|
{ |
|
if (endian == 'big') { |
|
buffer[offset] = (val - (val & 0x00ffffff)) / Math.pow(2, 24); |
|
buffer[offset+1] = (val >>> 16) & 0xff; |
|
buffer[offset+2] = (val >>> 8) & 0xff; |
|
buffer[offset+3] = val & 0xff; |
|
} else { |
|
buffer[offset+3] = (val - (val & 0x00ffffff)) / |
|
Math.pow(2, 24); |
|
buffer[offset+2] = (val >>> 16) & 0xff; |
|
buffer[offset+1] = (val >>> 8) & 0xff; |
|
buffer[offset] = val & 0xff; |
|
} |
|
} |
|
|
|
function wuint32(value, endian, buffer, offset) |
|
{ |
|
var val; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = prepuint(value, 0xffffffff); |
|
wgint32(val, endian, buffer, offset); |
|
} |
|
|
|
/* |
|
* Unlike the other versions, we expect the value to be in the form of two |
|
* arrays where value[0] << 32 + value[1] would result in the value that we |
|
* want. |
|
*/ |
|
function wgint64(value, endian, buffer, offset) |
|
{ |
|
if (endian == 'big') { |
|
wgint32(value[0], endian, buffer, offset); |
|
wgint32(value[1], endian, buffer, offset+4); |
|
} else { |
|
wgint32(value[0], endian, buffer, offset+4); |
|
wgint32(value[1], endian, buffer, offset); |
|
} |
|
} |
|
|
|
function wuint64(value, endian, buffer, offset) |
|
{ |
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (!(value instanceof Array)) |
|
throw (new Error('value must be an array')); |
|
|
|
if (value.length != 2) |
|
throw (new Error('value must be an array of length 2')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 7 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
prepuint(value[0], 0xffffffff); |
|
prepuint(value[1], 0xffffffff); |
|
wgint64(value, endian, buffer, offset); |
|
} |
|
|
|
/* |
|
* We now move onto our friends in the signed number category. Unlike unsigned |
|
* numbers, we're going to have to worry a bit more about how we put values into |
|
* arrays. Since we are only worrying about signed 32-bit values, we're in |
|
* slightly better shape. Unfortunately, we really can't do our favorite binary |
|
* & in this system. It really seems to do the wrong thing. For example: |
|
* |
|
* > -32 & 0xff |
|
* 224 |
|
* |
|
* What's happening above is really: 0xe0 & 0xff = 0xe0. However, the results of |
|
* this aren't treated as a signed number. Ultimately a bad thing. |
|
* |
|
* What we're going to want to do is basically create the unsigned equivalent of |
|
* our representation and pass that off to the wuint* functions. To do that |
|
* we're going to do the following: |
|
* |
|
* - if the value is positive |
|
* we can pass it directly off to the equivalent wuint |
|
* - if the value is negative |
|
* we do the following computation: |
|
* mb + val + 1, where |
|
* mb is the maximum unsigned value in that byte size |
|
* val is the Javascript negative integer |
|
* |
|
* |
|
* As a concrete value, take -128. In signed 16 bits this would be 0xff80. If |
|
* you do out the computations: |
|
* |
|
* 0xffff - 128 + 1 |
|
* 0xffff - 127 |
|
* 0xff80 |
|
* |
|
* You can then encode this value as the signed version. This is really rather |
|
* hacky, but it should work and get the job done which is our goal here. |
|
* |
|
* Thus the overall flow is: |
|
* - Truncate the floating point part of the number |
|
* - We don't have to take the modulus, because the unsigned versions will |
|
* take care of that for us. And we don't have to worry about that |
|
* potentially causing bad things to happen because of sign extension |
|
* - Pass it off to the appropriate unsigned version, potentially modifying |
|
* the negative portions as necessary. |
|
*/ |
|
|
|
/* |
|
* A series of checks to make sure we actually have a signed 32-bit number |
|
*/ |
|
function prepsint(value, max, min) |
|
{ |
|
if (typeof (value) != 'number') |
|
throw (new (Error('cannot write a non-number as a number'))); |
|
|
|
if (value > max) |
|
throw (new Error('value larger than maximum allowed value')); |
|
|
|
if (value < min) |
|
throw (new Error('value smaller than minimum allowed value')); |
|
|
|
if (Math.floor(value) !== value) |
|
throw (new Error('value has a fractional component')); |
|
|
|
return (value); |
|
} |
|
|
|
/* |
|
* The 8-bit version of the signed value. Overall, fairly straightforward. |
|
*/ |
|
function wsint8(value, endian, buffer, offset) |
|
{ |
|
var val; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = prepsint(value, 0x7f, -0x80); |
|
if (val >= 0) |
|
wuint8(val, endian, buffer, offset); |
|
else |
|
wuint8(0xff + val + 1, endian, buffer, offset); |
|
} |
|
|
|
/* |
|
* The 16-bit version of the signed value. Also, fairly straightforward. |
|
*/ |
|
function wsint16(value, endian, buffer, offset) |
|
{ |
|
var val; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 1 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = prepsint(value, 0x7fff, -0x8000); |
|
if (val >= 0) |
|
wgint16(val, endian, buffer, offset); |
|
else |
|
wgint16(0xffff + val + 1, endian, buffer, offset); |
|
|
|
} |
|
|
|
/* |
|
* We can do this relatively easily by leveraging the code used for 32-bit |
|
* unsigned code. |
|
*/ |
|
function wsint32(value, endian, buffer, offset) |
|
{ |
|
var val; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
val = prepsint(value, 0x7fffffff, -0x80000000); |
|
if (val >= 0) |
|
wgint32(val, endian, buffer, offset); |
|
else |
|
wgint32(0xffffffff + val + 1, endian, buffer, offset); |
|
} |
|
|
|
/* |
|
* The signed 64 bit integer should by in the same format as when received. |
|
* Mainly it should ensure that the value is an array of two integers where |
|
* value[0] << 32 + value[1] is the desired number. Furthermore, the two values |
|
* need to be equal. |
|
*/ |
|
function wsint64(value, endian, buffer, offset) |
|
{ |
|
var vzpos, vopos; |
|
var vals = new Array(2); |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (!(value instanceof Array)) |
|
throw (new Error('value must be an array')); |
|
|
|
if (value.length != 2) |
|
throw (new Error('value must be an array of length 2')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
if (offset + 7 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
/* |
|
* We need to make sure that we have the same sign on both values. The |
|
* hokiest way to to do this is to multiply the number by +inf. If we do |
|
* this, we'll get either +/-inf depending on the sign of the value. |
|
* Once we have this, we can compare it to +inf to see if the number is |
|
* positive or not. |
|
*/ |
|
vzpos = (value[0] * Number.POSITIVE_INFINITY) == |
|
Number.POSITIVE_INFINITY; |
|
vopos = (value[1] * Number.POSITIVE_INFINITY) == |
|
Number.POSITIVE_INFINITY; |
|
|
|
/* |
|
* If either of these is zero, then we don't actually need this check. |
|
*/ |
|
if (value[0] != 0 && value[1] != 0 && vzpos != vopos) |
|
throw (new Error('Both entries in the array must have ' + |
|
'the same sign')); |
|
|
|
/* |
|
* Doing verification for a signed 64-bit integer is actually a big |
|
* trickier than it appears. We can't quite use our standard techniques |
|
* because we need to compare both sets of values. The first value is |
|
* pretty straightforward. If the first value is beond the extremes than |
|
* we error out. However, the valid range of the second value varies |
|
* based on the first one. If the first value is negative, and *not* the |
|
* largest negative value, than it can be any integer within the range [ |
|
* 0, 0xffffffff ]. If it is the largest negative number, it must be |
|
* zero. |
|
* |
|
* If the first number is positive, than it doesn't matter what the |
|
* value is. We just simply have to make sure we have a valid positive |
|
* integer. |
|
*/ |
|
if (vzpos) { |
|
prepuint(value[0], 0x7fffffff); |
|
prepuint(value[1], 0xffffffff); |
|
} else { |
|
prepsint(value[0], 0, -0x80000000); |
|
prepsint(value[1], 0, -0xffffffff); |
|
if (value[0] == -0x80000000 && value[1] != 0) |
|
throw (new Error('value smaller than minimum ' + |
|
'allowed value')); |
|
} |
|
|
|
/* Fix negative numbers */ |
|
if (value[0] < 0 || value[1] < 0) { |
|
vals[0] = 0xffffffff - Math.abs(value[0]); |
|
vals[1] = 0x100000000 - Math.abs(value[1]); |
|
if (vals[1] == 0x100000000) { |
|
vals[1] = 0; |
|
vals[0]++; |
|
} |
|
} else { |
|
vals[0] = value[0]; |
|
vals[1] = value[1]; |
|
} |
|
wgint64(vals, endian, buffer, offset); |
|
} |
|
|
|
/* |
|
* Now we are moving onto the weirder of these, the float and double. For this |
|
* we're going to just have to do something that's pretty weird. First off, we |
|
* have no way to get at the underlying float representation, at least not |
|
* easily. But that doesn't mean we can't figure it out, we just have to use our |
|
* heads. |
|
* |
|
* One might propose to use Number.toString(2). Of course, this is not really |
|
* that good, because the ECMAScript 262 v3 Standard says the following Section |
|
* 15.7.4.2-Number.prototype.toString (radix): |
|
* |
|
* If radix is an integer from 2 to 36, but not 10, the result is a string, the |
|
* choice of which is implementation-dependent. |
|
* |
|
* Well that doesn't really help us one bit now does it? We could use the |
|
* standard base 10 version of the string, but that's just going to create more |
|
* errors as we end up trying to convert it back to a binary value. So, really |
|
* this just means we have to be non-lazy and parse the structure intelligently. |
|
* |
|
* First off, we can do the basic checks: NaN, positive and negative infinity. |
|
* |
|
* Now that those are done we can work backwards to generate the mantissa and |
|
* exponent. |
|
* |
|
* The first thing we need to do is determine the sign bit, easy to do, check |
|
* whether the value is less than 0. And convert the number to its absolute |
|
* value representation. Next, we need to determine if the value is less than |
|
* one or greater than or equal to one and from there determine what power was |
|
* used to get there. What follows is now specific to floats, though the general |
|
* ideas behind this will hold for doubles as well, but the exact numbers |
|
* involved will change. |
|
* |
|
* Once we have that power we can determine the exponent and the mantissa. Call |
|
* the value that has the number of bits to reach the power ebits. In the |
|
* general case they have the following values: |
|
* |
|
* exponent 127 + ebits |
|
* mantissa value * 2^(23 - ebits) & 0x7fffff |
|
* |
|
* In the case where the value of ebits is <= -127 we are now in the case where |
|
* we no longer have normalized numbers. In this case the values take on the |
|
* following values: |
|
* |
|
* exponent 0 |
|
* mantissa value * 2^149 & 0x7fffff |
|
* |
|
* Once we have the values for the sign, mantissa, and exponent. We reconstruct |
|
* the four bytes as follows: |
|
* |
|
* byte0 sign bit and seven most significant bits from the exp |
|
* sign << 7 | (exponent & 0xfe) >>> 1 |
|
* |
|
* byte1 lsb from the exponent and 7 top bits from the mantissa |
|
* (exponent & 0x01) << 7 | (mantissa & 0x7f0000) >>> 16 |
|
* |
|
* byte2 bits 8-15 (zero indexing) from mantissa |
|
* mantissa & 0xff00 >> 8 |
|
* |
|
* byte3 bits 0-7 from mantissa |
|
* mantissa & 0xff |
|
* |
|
* Once we have this we have to assign them into the buffer in proper endian |
|
* order. |
|
*/ |
|
|
|
/* |
|
* Compute the log base 2 of the value. Now, someone who remembers basic |
|
* properties of logarithms will point out that we could use the change of base |
|
* formula for logs, and in fact that would be astute, because that's what we'll |
|
* do for now. It feels cleaner, albeit it may be less efficient than just |
|
* iterating and dividing by 2. We may want to come back and revisit that some |
|
* day. |
|
*/ |
|
function log2(value) |
|
{ |
|
return (Math.log(value) / Math.log(2)); |
|
} |
|
|
|
/* |
|
* Helper to determine the exponent of the number we're looking at. |
|
*/ |
|
function intexp(value) |
|
{ |
|
return (Math.floor(log2(value))); |
|
} |
|
|
|
/* |
|
* Helper to determine the exponent of the fractional part of the value. |
|
*/ |
|
function fracexp(value) |
|
{ |
|
return (Math.floor(log2(value))); |
|
} |
|
|
|
function wfloat(value, endian, buffer, offset) |
|
{ |
|
var sign, exponent, mantissa, ebits; |
|
var bytes = []; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
|
|
if (offset + 3 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
if (isNaN(value)) { |
|
sign = 0; |
|
exponent = 0xff; |
|
mantissa = 23; |
|
} else if (value == Number.POSITIVE_INFINITY) { |
|
sign = 0; |
|
exponent = 0xff; |
|
mantissa = 0; |
|
} else if (value == Number.NEGATIVE_INFINITY) { |
|
sign = 1; |
|
exponent = 0xff; |
|
mantissa = 0; |
|
} else { |
|
/* Well we have some work to do */ |
|
|
|
/* Thankfully the sign bit is trivial */ |
|
if (value < 0) { |
|
sign = 1; |
|
value = Math.abs(value); |
|
} else { |
|
sign = 0; |
|
} |
|
|
|
/* Use the correct function to determine number of bits */ |
|
if (value < 1) |
|
ebits = fracexp(value); |
|
else |
|
ebits = intexp(value); |
|
|
|
/* Time to deal with the issues surrounding normalization */ |
|
if (ebits <= -127) { |
|
exponent = 0; |
|
mantissa = (value * Math.pow(2, 149)) & 0x7fffff; |
|
} else { |
|
exponent = 127 + ebits; |
|
mantissa = value * Math.pow(2, 23 - ebits); |
|
mantissa &= 0x7fffff; |
|
} |
|
} |
|
|
|
bytes[0] = sign << 7 | (exponent & 0xfe) >>> 1; |
|
bytes[1] = (exponent & 0x01) << 7 | (mantissa & 0x7f0000) >>> 16; |
|
bytes[2] = (mantissa & 0x00ff00) >>> 8; |
|
bytes[3] = mantissa & 0x0000ff; |
|
|
|
if (endian == 'big') { |
|
buffer[offset] = bytes[0]; |
|
buffer[offset+1] = bytes[1]; |
|
buffer[offset+2] = bytes[2]; |
|
buffer[offset+3] = bytes[3]; |
|
} else { |
|
buffer[offset] = bytes[3]; |
|
buffer[offset+1] = bytes[2]; |
|
buffer[offset+2] = bytes[1]; |
|
buffer[offset+3] = bytes[0]; |
|
} |
|
} |
|
|
|
/* |
|
* Now we move onto doubles. Doubles are similar to floats in pretty much all |
|
* ways except that the processing isn't quite as straightforward because we |
|
* can't always use shifting, i.e. we have > 32 bit values. |
|
* |
|
* We're going to proceed in an identical fashion to floats and utilize the same |
|
* helper functions. All that really is changing are the specific values that we |
|
* use to do the calculations. Thus, to review we have to do the following. |
|
* |
|
* First get the sign bit and convert the value to its absolute value |
|
* representation. Next, we determine the number of bits that we used to get to |
|
* the value, branching whether the value is greater than or less than 1. Once |
|
* we have that value which we will again call ebits, we have to do the |
|
* following in the general case: |
|
* |
|
* exponent 1023 + ebits |
|
* mantissa [value * 2^(52 - ebits)] % 2^52 |
|
* |
|
* In the case where the value of ebits <= -1023 we no longer use normalized |
|
* numbers, thus like with floats we have to do slightly different processing: |
|
* |
|
* exponent 0 |
|
* mantissa [value * 2^1074] % 2^52 |
|
* |
|
* Once we have determined the sign, exponent and mantissa we can construct the |
|
* bytes as follows: |
|
* |
|
* byte0 sign bit and seven most significant bits form the exp |
|
* sign << 7 | (exponent & 0x7f0) >>> 4 |
|
* |
|
* byte1 Remaining 4 bits from the exponent and the four most |
|
* significant bits from the mantissa 48-51 |
|
* (exponent & 0x00f) << 4 | mantissa >>> 48 |
|
* |
|
* byte2 Bits 40-47 from the mantissa |
|
* (mantissa >>> 40) & 0xff |
|
* |
|
* byte3 Bits 32-39 from the mantissa |
|
* (mantissa >>> 32) & 0xff |
|
* |
|
* byte4 Bits 24-31 from the mantissa |
|
* (mantissa >>> 24) & 0xff |
|
* |
|
* byte5 Bits 16-23 from the Mantissa |
|
* (mantissa >>> 16) & 0xff |
|
* |
|
* byte6 Bits 8-15 from the mantissa |
|
* (mantissa >>> 8) & 0xff |
|
* |
|
* byte7 Bits 0-7 from the mantissa |
|
* mantissa & 0xff |
|
* |
|
* Now we can't quite do the right shifting that we want in bytes 1 - 3, because |
|
* we'll have extended too far and we'll lose those values when we try and do |
|
* the shift. Instead we have to use an alternate approach. To try and stay out |
|
* of floating point, what we'll do is say that mantissa -= bytes[4-7] and then |
|
* divide by 2^32. Once we've done that we can use binary arithmetic. Oof, |
|
* that's ugly, but it seems to avoid using floating point (just based on how v8 |
|
* seems to be optimizing for base 2 arithmetic). |
|
*/ |
|
function wdouble(value, endian, buffer, offset) |
|
{ |
|
var sign, exponent, mantissa, ebits; |
|
var bytes = []; |
|
|
|
if (value === undefined) |
|
throw (new Error('missing value')); |
|
|
|
if (endian === undefined) |
|
throw (new Error('missing endian')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset')); |
|
|
|
|
|
if (offset + 7 >= buffer.length) |
|
throw (new Error('Trying to read beyond buffer length')); |
|
|
|
if (isNaN(value)) { |
|
sign = 0; |
|
exponent = 0x7ff; |
|
mantissa = 23; |
|
} else if (value == Number.POSITIVE_INFINITY) { |
|
sign = 0; |
|
exponent = 0x7ff; |
|
mantissa = 0; |
|
} else if (value == Number.NEGATIVE_INFINITY) { |
|
sign = 1; |
|
exponent = 0x7ff; |
|
mantissa = 0; |
|
} else { |
|
/* Well we have some work to do */ |
|
|
|
/* Thankfully the sign bit is trivial */ |
|
if (value < 0) { |
|
sign = 1; |
|
value = Math.abs(value); |
|
} else { |
|
sign = 0; |
|
} |
|
|
|
/* Use the correct function to determine number of bits */ |
|
if (value < 1) |
|
ebits = fracexp(value); |
|
else |
|
ebits = intexp(value); |
|
|
|
/* |
|
* This is a total hack to determine a denormalized value. |
|
* Unfortunately, we sometimes do not get a proper value for |
|
* ebits, i.e. we lose the values that would get rounded off. |
|
* |
|
* |
|
* The astute observer may wonder why we would be |
|
* multiplying by two Math.pows rather than just summing |
|
* them. Well, that's to get around a small bug in the |
|
* way v8 seems to implement the function. On occasion |
|
* doing: |
|
* |
|
* foo * Math.pow(2, 1023 + 51) |
|
* |
|
* Causes us to overflow to infinity, where as doing: |
|
* |
|
* foo * Math.pow(2, 1023) * Math.pow(2, 51) |
|
* |
|
* Does not cause us to overflow. Go figure. |
|
* |
|
*/ |
|
if (value <= 2.225073858507201e-308 || ebits <= -1023) { |
|
exponent = 0; |
|
mantissa = value * Math.pow(2, 1023) * Math.pow(2, 51); |
|
mantissa %= Math.pow(2, 52); |
|
} else { |
|
/* |
|
* We might have gotten fucked by our floating point |
|
* logarithm magic. This is rather crappy, but that's |
|
* our luck. If we just had a log base 2 or access to |
|
* the stupid underlying representation this would have |
|
* been much easier and we wouldn't have such stupid |
|
* kludges or hacks. |
|
*/ |
|
if (ebits > 1023) |
|
ebits = 1023; |
|
exponent = 1023 + ebits; |
|
mantissa = value * Math.pow(2, -ebits); |
|
mantissa *= Math.pow(2, 52); |
|
mantissa %= Math.pow(2, 52); |
|
} |
|
} |
|
|
|
/* Fill the bytes in backwards to deal with the size issues */ |
|
bytes[7] = mantissa & 0xff; |
|
bytes[6] = (mantissa >>> 8) & 0xff; |
|
bytes[5] = (mantissa >>> 16) & 0xff; |
|
mantissa = (mantissa - (mantissa & 0xffffff)) / Math.pow(2, 24); |
|
bytes[4] = mantissa & 0xff; |
|
bytes[3] = (mantissa >>> 8) & 0xff; |
|
bytes[2] = (mantissa >>> 16) & 0xff; |
|
bytes[1] = (exponent & 0x00f) << 4 | mantissa >>> 24; |
|
bytes[0] = (sign << 7) | (exponent & 0x7f0) >>> 4; |
|
|
|
if (endian == 'big') { |
|
buffer[offset] = bytes[0]; |
|
buffer[offset+1] = bytes[1]; |
|
buffer[offset+2] = bytes[2]; |
|
buffer[offset+3] = bytes[3]; |
|
buffer[offset+4] = bytes[4]; |
|
buffer[offset+5] = bytes[5]; |
|
buffer[offset+6] = bytes[6]; |
|
buffer[offset+7] = bytes[7]; |
|
} else { |
|
buffer[offset+7] = bytes[0]; |
|
buffer[offset+6] = bytes[1]; |
|
buffer[offset+5] = bytes[2]; |
|
buffer[offset+4] = bytes[3]; |
|
buffer[offset+3] = bytes[4]; |
|
buffer[offset+2] = bytes[5]; |
|
buffer[offset+1] = bytes[6]; |
|
buffer[offset] = bytes[7]; |
|
} |
|
} |
|
|
|
/* |
|
* Actually export our work above. One might argue that we shouldn't expose |
|
* these interfaces and just force people to use the higher level abstractions |
|
* around this work. However, unlike say other libraries we've come across, this |
|
* interface has several properties: it makes sense, it's simple, and it's |
|
* useful. |
|
*/ |
|
exports.ruint8 = ruint8; |
|
exports.ruint16 = ruint16; |
|
exports.ruint32 = ruint32; |
|
exports.ruint64 = ruint64; |
|
exports.wuint8 = wuint8; |
|
exports.wuint16 = wuint16; |
|
exports.wuint32 = wuint32; |
|
exports.wuint64 = wuint64; |
|
|
|
exports.rsint8 = rsint8; |
|
exports.rsint16 = rsint16; |
|
exports.rsint32 = rsint32; |
|
exports.rsint64 = rsint64; |
|
exports.wsint8 = wsint8; |
|
exports.wsint16 = wsint16; |
|
exports.wsint32 = wsint32; |
|
exports.wsint64 = wsint64; |
|
|
|
exports.rfloat = rfloat; |
|
exports.rdouble = rdouble; |
|
exports.wfloat = wfloat; |
|
exports.wdouble = wdouble; |
|
|
|
},{"assert":157}],119:[function(require,module,exports){ |
|
(function (Buffer){ |
|
/* |
|
* rm - Feb 2011 |
|
* ctype.js |
|
* |
|
* This module provides a simple abstraction towards reading and writing |
|
* different types of binary data. It is designed to use ctio.js and provide a |
|
* richer and more expressive API on top of it. |
|
* |
|
* By default we support the following as built in basic types: |
|
* int8_t |
|
* int16_t |
|
* int32_t |
|
* uint8_t |
|
* uint16_t |
|
* uint32_t |
|
* uint64_t |
|
* float |
|
* double |
|
* char |
|
* char[] |
|
* |
|
* Each type is returned as a Number, with the exception of char and char[] |
|
* which are returned as Node Buffers. A char is considered a uint8_t. |
|
* |
|
* Requests to read and write data are specified as an array of JSON objects. |
|
* This is also the same way that one declares structs. Even if just a single |
|
* value is requested, it must be done as a struct. The array order determines |
|
* the order that we try and read values. Each entry has the following format |
|
* with values marked with a * being optional. |
|
* |
|
* { key: { type: /type/, value*: /value/, offset*: /offset/ } |
|
* |
|
* If offset is defined, we lseek(offset, SEEK_SET) before reading the next |
|
* value. Value is defined when we're writing out data, otherwise it's ignored. |
|
* |
|
*/ |
|
|
|
var mod_ctf = require('./ctf.js'); |
|
var mod_ctio = require('./ctio.js'); |
|
var mod_assert = require('assert'); |
|
|
|
/* |
|
* This is the set of basic types that we support. |
|
* |
|
* read The function to call to read in a value from a buffer |
|
* |
|
* write The function to call to write a value to a buffer |
|
* |
|
*/ |
|
var deftypes = { |
|
'uint8_t': { read: ctReadUint8, write: ctWriteUint8 }, |
|
'uint16_t': { read: ctReadUint16, write: ctWriteUint16 }, |
|
'uint32_t': { read: ctReadUint32, write: ctWriteUint32 }, |
|
'uint64_t': { read: ctReadUint64, write: ctWriteUint64 }, |
|
'int8_t': { read: ctReadSint8, write: ctWriteSint8 }, |
|
'int16_t': { read: ctReadSint16, write: ctWriteSint16 }, |
|
'int32_t': { read: ctReadSint32, write: ctWriteSint32 }, |
|
'int64_t': { read: ctReadSint64, write: ctWriteSint64 }, |
|
'float': { read: ctReadFloat, write: ctWriteFloat }, |
|
'double': { read: ctReadDouble, write: ctWriteDouble }, |
|
'char': { read: ctReadChar, write: ctWriteChar }, |
|
'char[]': { read: ctReadCharArray, write: ctWriteCharArray } |
|
}; |
|
|
|
/* |
|
* The following are wrappers around the CType IO low level API. They encode |
|
* knowledge about the size and return something in the expected format. |
|
*/ |
|
function ctReadUint8(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.ruint8(buffer, endian, offset); |
|
return ({ value: val, size: 1 }); |
|
} |
|
|
|
function ctReadUint16(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.ruint16(buffer, endian, offset); |
|
return ({ value: val, size: 2 }); |
|
} |
|
|
|
function ctReadUint32(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.ruint32(buffer, endian, offset); |
|
return ({ value: val, size: 4 }); |
|
} |
|
|
|
function ctReadUint64(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.ruint64(buffer, endian, offset); |
|
return ({ value: val, size: 8 }); |
|
} |
|
|
|
function ctReadSint8(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.rsint8(buffer, endian, offset); |
|
return ({ value: val, size: 1 }); |
|
} |
|
|
|
function ctReadSint16(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.rsint16(buffer, endian, offset); |
|
return ({ value: val, size: 2 }); |
|
} |
|
|
|
function ctReadSint32(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.rsint32(buffer, endian, offset); |
|
return ({ value: val, size: 4 }); |
|
} |
|
|
|
function ctReadSint64(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.rsint64(buffer, endian, offset); |
|
return ({ value: val, size: 8 }); |
|
} |
|
|
|
function ctReadFloat(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.rfloat(buffer, endian, offset); |
|
return ({ value: val, size: 4 }); |
|
} |
|
|
|
function ctReadDouble(endian, buffer, offset) |
|
{ |
|
var val = mod_ctio.rdouble(buffer, endian, offset); |
|
return ({ value: val, size: 8 }); |
|
} |
|
|
|
/* |
|
* Reads a single character into a node buffer |
|
*/ |
|
function ctReadChar(endian, buffer, offset) |
|
{ |
|
var res = new Buffer(1); |
|
res[0] = mod_ctio.ruint8(buffer, endian, offset); |
|
return ({ value: res, size: 1 }); |
|
} |
|
|
|
function ctReadCharArray(length, endian, buffer, offset) |
|
{ |
|
var ii; |
|
var res = new Buffer(length); |
|
|
|
for (ii = 0; ii < length; ii++) |
|
res[ii] = mod_ctio.ruint8(buffer, endian, offset + ii); |
|
|
|
return ({ value: res, size: length }); |
|
} |
|
|
|
function ctWriteUint8(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wuint8(value, endian, buffer, offset); |
|
return (1); |
|
} |
|
|
|
function ctWriteUint16(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wuint16(value, endian, buffer, offset); |
|
return (2); |
|
} |
|
|
|
function ctWriteUint32(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wuint32(value, endian, buffer, offset); |
|
return (4); |
|
} |
|
|
|
function ctWriteUint64(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wuint64(value, endian, buffer, offset); |
|
return (8); |
|
} |
|
|
|
function ctWriteSint8(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wsint8(value, endian, buffer, offset); |
|
return (1); |
|
} |
|
|
|
function ctWriteSint16(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wsint16(value, endian, buffer, offset); |
|
return (2); |
|
} |
|
|
|
function ctWriteSint32(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wsint32(value, endian, buffer, offset); |
|
return (4); |
|
} |
|
|
|
function ctWriteSint64(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wsint64(value, endian, buffer, offset); |
|
return (8); |
|
} |
|
|
|
function ctWriteFloat(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wfloat(value, endian, buffer, offset); |
|
return (4); |
|
} |
|
|
|
function ctWriteDouble(value, endian, buffer, offset) |
|
{ |
|
mod_ctio.wdouble(value, endian, buffer, offset); |
|
return (8); |
|
} |
|
|
|
/* |
|
* Writes a single character into a node buffer |
|
*/ |
|
function ctWriteChar(value, endian, buffer, offset) |
|
{ |
|
if (!(value instanceof Buffer)) |
|
throw (new Error('Input must be a buffer')); |
|
|
|
mod_ctio.ruint8(value[0], endian, buffer, offset); |
|
return (1); |
|
} |
|
|
|
/* |
|
* We're going to write 0s into the buffer if the string is shorter than the |
|
* length of the array. |
|
*/ |
|
function ctWriteCharArray(value, length, endian, buffer, offset) |
|
{ |
|
var ii; |
|
|
|
if (!(value instanceof Buffer)) |
|
throw (new Error('Input must be a buffer')); |
|
|
|
if (value.length > length) |
|
throw (new Error('value length greater than array length')); |
|
|
|
for (ii = 0; ii < value.length && ii < length; ii++) |
|
mod_ctio.wuint8(value[ii], endian, buffer, offset + ii); |
|
|
|
for (; ii < length; ii++) |
|
mod_ctio.wuint8(0, endian, offset + ii); |
|
|
|
|
|
return (length); |
|
} |
|
|
|
/* |
|
* Each parser has their own set of types. We want to make sure that they each |
|
* get their own copy as they may need to modify it. |
|
*/ |
|
function ctGetBasicTypes() |
|
{ |
|
var ret = {}; |
|
var key; |
|
for (key in deftypes) |
|
ret[key] = deftypes[key]; |
|
|
|
return (ret); |
|
} |
|
|
|
/* |
|
* Given a string in the form of type[length] we want to split this into an |
|
* object that extracts that information. We want to note that we could possibly |
|
* have nested arrays so this should only check the furthest one. It may also be |
|
* the case that we have no [] pieces, in which case we just return the current |
|
* type. |
|
*/ |
|
function ctParseType(str) |
|
{ |
|
var begInd, endInd; |
|
var type, len; |
|
if (typeof (str) != 'string') |
|
throw (new Error('type must be a Javascript string')); |
|
|
|
endInd = str.lastIndexOf(']'); |
|
if (endInd == -1) { |
|
if (str.lastIndexOf('[') != -1) |
|
throw (new Error('found invalid type with \'[\' but ' + |
|
'no corresponding \']\'')); |
|
|
|
return ({ type: str }); |
|
} |
|
|
|
begInd = str.lastIndexOf('['); |
|
if (begInd == -1) |
|
throw (new Error('found invalid type with \']\' but ' + |
|
'no corresponding \'[\'')); |
|
|
|
if (begInd >= endInd) |
|
throw (new Error('malformed type, \']\' appears before \'[\'')); |
|
|
|
type = str.substring(0, begInd); |
|
len = str.substring(begInd + 1, endInd); |
|
|
|
return ({ type: type, len: len }); |
|
} |
|
|
|
/* |
|
* Given a request validate that all of the fields for it are valid and make |
|
* sense. This includes verifying the following notions: |
|
* - Each type requested is present in types |
|
* - Only allow a name for a field to be specified once |
|
* - If an array is specified, validate that the requested field exists and |
|
* comes before it. |
|
* - If fields is defined, check that each entry has the occurrence of field |
|
*/ |
|
function ctCheckReq(def, types, fields) |
|
{ |
|
var ii, jj; |
|
var req, keys, key; |
|
var found = {}; |
|
|
|
if (!(def instanceof Array)) |
|
throw (new Error('definition is not an array')); |
|
|
|
if (def.length === 0) |
|
throw (new Error('definition must have at least one element')); |
|
|
|
for (ii = 0; ii < def.length; ii++) { |
|
req = def[ii]; |
|
if (!(req instanceof Object)) |
|
throw (new Error('definition must be an array of' + |
|
'objects')); |
|
|
|
keys = Object.keys(req); |
|
if (keys.length != 1) |
|
throw (new Error('definition entry must only have ' + |
|
'one key')); |
|
|
|
if (keys[0] in found) |
|
throw (new Error('Specified name already ' + |
|
'specified: ' + keys[0])); |
|
|
|
if (!('type' in req[keys[0]])) |
|
throw (new Error('missing required type definition')); |
|
|
|
key = ctParseType(req[keys[0]]['type']); |
|
|
|
/* |
|
* We may have nested arrays, we need to check the validity of |
|
* the types until the len field is undefined in key. However, |
|
* each time len is defined we need to verify it is either an |
|
* integer or corresponds to an already seen key. |
|
*/ |
|
while (key['len'] !== undefined) { |
|
if (isNaN(parseInt(key['len'], 10))) { |
|
if (!(key['len'] in found)) |
|
throw (new Error('Given an array ' + |
|
'length without a matching type')); |
|
|
|
} |
|
|
|
key = ctParseType(key['type']); |
|
} |
|
|
|
/* Now we can validate if the type is valid */ |
|
if (!(key['type'] in types)) |
|
throw (new Error('type not found or typdefed: ' + |
|
key['type'])); |
|
|
|
/* Check for any required fields */ |
|
if (fields !== undefined) { |
|
for (jj = 0; jj < fields.length; jj++) { |
|
if (!(fields[jj] in req[keys[0]])) |
|
throw (new Error('Missing required ' + |
|
'field: ' + fields[jj])); |
|
} |
|
} |
|
|
|
found[keys[0]] = true; |
|
} |
|
} |
|
|
|
|
|
/* |
|
* Create a new instance of the parser. Each parser has its own store of |
|
* typedefs and endianness. Conf is an object with the following required |
|
* values: |
|
* |
|
* endian Either 'big' or 'little' do determine the endianness we |
|
* want to read from or write to. |
|
* |
|
* And the following optional values: |
|
* |
|
* char-type Valid options here are uint8 and int8. If uint8 is |
|
* specified this changes the default behavior of a single |
|
* char from being a buffer of a single character to being |
|
* a uint8_t. If int8, it becomes an int8_t instead. |
|
*/ |
|
function CTypeParser(conf) |
|
{ |
|
if (!conf) throw (new Error('missing required argument')); |
|
|
|
if (!('endian' in conf)) |
|
throw (new Error('missing required endian value')); |
|
|
|
if (conf['endian'] != 'big' && conf['endian'] != 'little') |
|
throw (new Error('Invalid endian type')); |
|
|
|
if ('char-type' in conf && (conf['char-type'] != 'uint8' && |
|
conf['char-type'] != 'int8')) |
|
throw (new Error('invalid option for char-type: ' + |
|
conf['char-type'])); |
|
|
|
this.endian = conf['endian']; |
|
this.types = ctGetBasicTypes(); |
|
|
|
/* |
|
* There may be a more graceful way to do this, but this will have to |
|
* serve. |
|
*/ |
|
if ('char-type' in conf && conf['char-type'] == 'uint8') |
|
this.types['char'] = this.types['uint8_t']; |
|
|
|
if ('char-type' in conf && conf['char-type'] == 'int8') |
|
this.types['char'] = this.types['int8_t']; |
|
} |
|
|
|
/* |
|
* Sets the current endian value for the Parser. If the value is not valid, |
|
* throws an Error. |
|
* |
|
* endian Either 'big' or 'little' do determine the endianness we |
|
* want to read from or write to. |
|
* |
|
*/ |
|
CTypeParser.prototype.setEndian = function (endian) |
|
{ |
|
if (endian != 'big' && endian != 'little') |
|
throw (new Error('invalid endian type, must be big or ' + |
|
'little')); |
|
|
|
this.endian = endian; |
|
}; |
|
|
|
/* |
|
* Returns the current value of the endian value for the parser. |
|
*/ |
|
CTypeParser.prototype.getEndian = function () |
|
{ |
|
return (this.endian); |
|
}; |
|
|
|
/* |
|
* A user has requested to add a type, let us honor their request. Yet, if their |
|
* request doth spurn us, send them unto the Hells which Dante describes. |
|
* |
|
* name The string for the type definition we're adding |
|
* |
|
* value Either a string that is a type/array name or an object |
|
* that describes a struct. |
|
*/ |
|
CTypeParser.prototype.typedef = function (name, value) |
|
{ |
|
var type; |
|
|
|
if (name === undefined) |
|
throw (new (Error('missing required typedef argument: name'))); |
|
|
|
if (value === undefined) |
|
throw (new (Error('missing required typedef argument: value'))); |
|
|
|
if (typeof (name) != 'string') |
|
throw (new (Error('the name of a type must be a string'))); |
|
|
|
type = ctParseType(name); |
|
|
|
if (type['len'] !== undefined) |
|
throw (new Error('Cannot have an array in the typedef name')); |
|
|
|
if (name in this.types) |
|
throw (new Error('typedef name already present: ' + name)); |
|
|
|
if (typeof (value) != 'string' && !(value instanceof Array)) |
|
throw (new Error('typedef value must either be a string or ' + |
|
'struct')); |
|
|
|
if (typeof (value) == 'string') { |
|
type = ctParseType(value); |
|
if (type['len'] !== undefined) { |
|
if (isNaN(parseInt(type['len'], 10))) |
|
throw (new (Error('typedef value must use ' + |
|
'fixed size array when outside of a ' + |
|
'struct'))); |
|
} |
|
|
|
this.types[name] = value; |
|
} else { |
|
/* We have a struct, validate it */ |
|
ctCheckReq(value, this.types); |
|
this.types[name] = value; |
|
} |
|
}; |
|
|
|
/* |
|
* Include all of the typedefs, but none of the built in types. This should be |
|
* treated as read-only. |
|
*/ |
|
CTypeParser.prototype.lstypes = function () |
|
{ |
|
var key; |
|
var ret = {}; |
|
|
|
for (key in this.types) { |
|
if (key in deftypes) |
|
continue; |
|
ret[key] = this.types[key]; |
|
} |
|
|
|
return (ret); |
|
}; |
|
|
|
/* |
|
* Given a type string that may have array types that aren't numbers, try and |
|
* fill them in from the values object. The object should be of the format where |
|
* indexing into it should return a number for that type. |
|
* |
|
* str The type string |
|
* |
|
* values An object that can be used to fulfill type information |
|
*/ |
|
function ctResolveArray(str, values) |
|
{ |
|
var ret = ''; |
|
var type = ctParseType(str); |
|
|
|
while (type['len'] !== undefined) { |
|
if (isNaN(parseInt(type['len'], 10))) { |
|
if (typeof (values[type['len']]) != 'number') |
|
throw (new Error('cannot sawp in non-number ' + |
|
'for array value')); |
|
ret = '[' + values[type['len']] + ']' + ret; |
|
} else { |
|
ret = '[' + type['len'] + ']' + ret; |
|
} |
|
type = ctParseType(type['type']); |
|
} |
|
|
|
ret = type['type'] + ret; |
|
|
|
return (ret); |
|
} |
|
|
|
/* |
|
* [private] Either the typedef resolves to another type string or to a struct. |
|
* If it resolves to a struct, we just pass it off to read struct. If not, we |
|
* can just pass it off to read entry. |
|
*/ |
|
CTypeParser.prototype.resolveTypedef = function (type, dispatch, buffer, |
|
offset, value) |
|
{ |
|
var pt; |
|
|
|
mod_assert.ok(type in this.types); |
|
if (typeof (this.types[type]) == 'string') { |
|
pt = ctParseType(this.types[type]); |
|
if (dispatch == 'read') |
|
return (this.readEntry(pt, buffer, offset)); |
|
else if (dispatch == 'write') |
|
return (this.writeEntry(value, pt, buffer, offset)); |
|
else |
|
throw (new Error('invalid dispatch type to ' + |
|
'resolveTypedef')); |
|
} else { |
|
if (dispatch == 'read') |
|
return (this.readStruct(this.types[type], buffer, |
|
offset)); |
|
else if (dispatch == 'write') |
|
return (this.writeStruct(value, this.types[type], |
|
buffer, offset)); |
|
else |
|
throw (new Error('invalid dispatch type to ' + |
|
'resolveTypedef')); |
|
} |
|
|
|
}; |
|
|
|
/* |
|
* [private] Try and read in the specific entry. |
|
*/ |
|
CTypeParser.prototype.readEntry = function (type, buffer, offset) |
|
{ |
|
var parse, len; |
|
|
|
/* |
|
* Because we want to special case char[]s this is unfortunately |
|
* a bit uglier than it really should be. We want to special |
|
* case char[]s so that we return a node buffer, thus they are a |
|
* first class type where as all other arrays just call into a |
|
* generic array routine which calls their data-specific routine |
|
* the specified number of times. |
|
* |
|
* The valid dispatch options we have are: |
|
* - Array and char => char[] handler |
|
* - Generic array handler |
|
* - Generic typedef handler |
|
* - Basic type handler |
|
*/ |
|
if (type['len'] !== undefined) { |
|
len = parseInt(type['len'], 10); |
|
if (isNaN(len)) |
|
throw (new Error('somehow got a non-numeric length')); |
|
|
|
if (type['type'] == 'char') |
|
parse = this.types['char[]']['read'](len, |
|
this.endian, buffer, offset); |
|
else |
|
parse = this.readArray(type['type'], |
|
len, buffer, offset); |
|
} else { |
|
if (type['type'] in deftypes) |
|
parse = this.types[type['type']]['read'](this.endian, |
|
buffer, offset); |
|
else |
|
parse = this.resolveTypedef(type['type'], 'read', |
|
buffer, offset); |
|
} |
|
|
|
return (parse); |
|
}; |
|
|
|
/* |
|
* [private] Read an array of data |
|
*/ |
|
CTypeParser.prototype.readArray = function (type, length, buffer, offset) |
|
{ |
|
var ii, ent, pt; |
|
var baseOffset = offset; |
|
var ret = new Array(length); |
|
pt = ctParseType(type); |
|
|
|
for (ii = 0; ii < length; ii++) { |
|
ent = this.readEntry(pt, buffer, offset); |
|
offset += ent['size']; |
|
ret[ii] = ent['value']; |
|
} |
|
|
|
return ({ value: ret, size: offset - baseOffset }); |
|
}; |
|
|
|
/* |
|
* [private] Read a single struct in. |
|
*/ |
|
CTypeParser.prototype.readStruct = function (def, buffer, offset) |
|
{ |
|
var parse, ii, type, entry, key; |
|
var baseOffset = offset; |
|
var ret = {}; |
|
|
|
/* Walk it and handle doing what's necessary */ |
|
for (ii = 0; ii < def.length; ii++) { |
|
key = Object.keys(def[ii])[0]; |
|
entry = def[ii][key]; |
|
|
|
/* Resolve all array values */ |
|
type = ctParseType(ctResolveArray(entry['type'], ret)); |
|
|
|
if ('offset' in entry) |
|
offset = baseOffset + entry['offset']; |
|
|
|
parse = this.readEntry(type, buffer, offset); |
|
|
|
offset += parse['size']; |
|
ret[key] = parse['value']; |
|
} |
|
|
|
return ({ value: ret, size: (offset-baseOffset)}); |
|
}; |
|
|
|
/* |
|
* This is what we were born to do. We read the data from a buffer and return it |
|
* in an object whose keys match the values from the object. |
|
* |
|
* def The array definition of the data to read in |
|
* |
|
* buffer The buffer to read data from |
|
* |
|
* offset The offset to start writing to |
|
* |
|
* Returns an object where each key corresponds to an entry in def and the value |
|
* is the read value. |
|
*/ |
|
CTypeParser.prototype.readData = function (def, buffer, offset) |
|
{ |
|
/* Sanity check for arguments */ |
|
if (def === undefined) |
|
throw (new Error('missing definition for what we should be' + |
|
'parsing')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer for what we should be ' + |
|
'parsing')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset for what we should be ' + |
|
'parsing')); |
|
|
|
/* Sanity check the object definition */ |
|
ctCheckReq(def, this.types); |
|
|
|
return (this.readStruct(def, buffer, offset)['value']); |
|
}; |
|
|
|
/* |
|
* [private] Write out an array of data |
|
*/ |
|
CTypeParser.prototype.writeArray = function (value, type, length, buffer, |
|
offset) |
|
{ |
|
var ii, pt; |
|
var baseOffset = offset; |
|
if (!(value instanceof Array)) |
|
throw (new Error('asked to write an array, but value is not ' + |
|
'an array')); |
|
|
|
if (value.length != length) |
|
throw (new Error('asked to write array of length ' + length + |
|
' but that does not match value length: ' + value.length)); |
|
|
|
pt = ctParseType(type); |
|
for (ii = 0; ii < length; ii++) |
|
offset += this.writeEntry(value[ii], pt, buffer, offset); |
|
|
|
return (offset - baseOffset); |
|
}; |
|
|
|
/* |
|
* [private] Write the specific entry |
|
*/ |
|
CTypeParser.prototype.writeEntry = function (value, type, buffer, offset) |
|
{ |
|
var len, ret; |
|
|
|
if (type['len'] !== undefined) { |
|
len = parseInt(type['len'], 10); |
|
if (isNaN(len)) |
|
throw (new Error('somehow got a non-numeric length')); |
|
|
|
if (type['type'] == 'char') |
|
ret = this.types['char[]']['write'](value, len, |
|
this.endian, buffer, offset); |
|
else |
|
ret = this.writeArray(value, type['type'], |
|
len, buffer, offset); |
|
} else { |
|
if (type['type'] in deftypes) |
|
ret = this.types[type['type']]['write'](value, |
|
this.endian, buffer, offset); |
|
else |
|
ret = this.resolveTypedef(type['type'], 'write', |
|
buffer, offset, value); |
|
} |
|
|
|
return (ret); |
|
}; |
|
|
|
/* |
|
* [private] Write a single struct out. |
|
*/ |
|
CTypeParser.prototype.writeStruct = function (value, def, buffer, offset) |
|
{ |
|
var ii, entry, type, key; |
|
var baseOffset = offset; |
|
var vals = {}; |
|
|
|
for (ii = 0; ii < def.length; ii++) { |
|
key = Object.keys(def[ii])[0]; |
|
entry = def[ii][key]; |
|
|
|
type = ctParseType(ctResolveArray(entry['type'], vals)); |
|
|
|
if ('offset' in entry) |
|
offset = baseOffset + entry['offset']; |
|
|
|
offset += this.writeEntry(value[ii], type, buffer, offset); |
|
/* Now that we've written it out, we can use it for arrays */ |
|
vals[key] = value[ii]; |
|
} |
|
|
|
return (offset); |
|
}; |
|
|
|
/* |
|
* Unfortunately, we're stuck with the sins of an initial poor design. Because |
|
* of that, we are going to have to support the old way of writing data via |
|
* writeData. There we insert the values that you want to write into the |
|
* definition. A little baroque. Internally, we use the new model. So we need to |
|
* just get those values out of there. But to maintain the principle of least |
|
* surprise, we're not going to modify the input data. |
|
*/ |
|
function getValues(def) |
|
{ |
|
var ii, out, key; |
|
out = []; |
|
for (ii = 0; ii < def.length; ii++) { |
|
key = Object.keys(def[ii])[0]; |
|
mod_assert.ok('value' in def[ii][key]); |
|
out.push(def[ii][key]['value']); |
|
} |
|
|
|
return (out); |
|
} |
|
|
|
/* |
|
* This is the second half of what we were born to do, write out the data |
|
* itself. Historically this function required you to put your values in the |
|
* definition section. This was not the smartest thing to do and a bit of an |
|
* oversight to be honest. As such, this function now takes a values argument. |
|
* If values is non-null and non-undefined, it will be used to determine the |
|
* values. This means that the old method is still supported, but is no longer |
|
* acceptable. |
|
* |
|
* def The array definition of the data to write out with |
|
* values |
|
* |
|
* buffer The buffer to write to |
|
* |
|
* offset The offset in the buffer to write to |
|
* |
|
* values An array of values to write. |
|
*/ |
|
CTypeParser.prototype.writeData = function (def, buffer, offset, values) |
|
{ |
|
var hv; |
|
|
|
if (def === undefined) |
|
throw (new Error('missing definition for what we should be' + |
|
'parsing')); |
|
|
|
if (buffer === undefined) |
|
throw (new Error('missing buffer for what we should be ' + |
|
'parsing')); |
|
|
|
if (offset === undefined) |
|
throw (new Error('missing offset for what we should be ' + |
|
'parsing')); |
|
|
|
hv = (values != null && values != undefined); |
|
if (hv) { |
|
if (!Array.isArray(values)) |
|
throw (new Error('missing values for writing')); |
|
ctCheckReq(def, this.types); |
|
} else { |
|
ctCheckReq(def, this.types, [ 'value' ]); |
|
} |
|
|
|
this.writeStruct(hv ? values : getValues(def), def, buffer, offset); |
|
}; |
|
|
|
/* |
|
* Functions to go to and from 64 bit numbers in a way that is compatible with |
|
* Javascript limitations. There are two sets. One where the user is okay with |
|
* an approximation and one where they are definitely not okay with an |
|
* approximation. |
|
*/ |
|
|
|
/* |
|
* Attempts to convert an array of two integers returned from rsint64 / ruint64 |
|
* into an absolute 64 bit number. If however the value would exceed 2^52 this |
|
* will instead throw an error. The mantissa in a double is a 52 bit number and |
|
* rather than potentially give you a value that is an approximation this will |
|
* error. If you would rather an approximation, please see toApprox64. |
|
* |
|
* val An array of two 32-bit integers |
|
*/ |
|
function toAbs64(val) |
|
{ |
|
if (val === undefined) |
|
throw (new Error('missing required arg: value')); |
|
|
|
if (!Array.isArray(val)) |
|
throw (new Error('value must be an array')); |
|
|
|
if (val.length != 2) |
|
throw (new Error('value must be an array of length 2')); |
|
|
|
/* We have 20 bits worth of precision in this range */ |
|
if (val[0] >= 0x100000) |
|
throw (new Error('value would become approximated')); |
|
|
|
return (val[0] * Math.pow(2, 32) + val[1]); |
|
} |
|
|
|
/* |
|
* Will return the 64 bit value as returned in an array from rsint64 / ruint64 |
|
* to a value as close as it can. Note that Javascript stores all numbers as a |
|
* double and the mantissa only has 52 bits. Thus this version may approximate |
|
* the value. |
|
* |
|
* val An array of two 32-bit integers |
|
*/ |
|
function toApprox64(val) |
|
{ |
|
if (val === undefined) |
|
throw (new Error('missing required arg: value')); |
|
|
|
if (!Array.isArray(val)) |
|
throw (new Error('value must be an array')); |
|
|
|
if (val.length != 2) |
|
throw (new Error('value must be an array of length 2')); |
|
|
|
return (Math.pow(2, 32) * val[0] + val[1]); |
|
} |
|
|
|
function parseCTF(json, conf) |
|
{ |
|
var ctype = new CTypeParser(conf); |
|
mod_ctf.ctfParseJson(json, ctype); |
|
|
|
return (ctype); |
|
} |
|
|
|
/* |
|
* Export the few things we actually want to. Currently this is just the CType |
|
* Parser and ctio. |
|
*/ |
|
exports.Parser = CTypeParser; |
|
exports.toAbs64 = toAbs64; |
|
exports.toApprox64 = toApprox64; |
|
|
|
exports.parseCTF = parseCTF; |
|
|
|
exports.ruint8 = mod_ctio.ruint8; |
|
exports.ruint16 = mod_ctio.ruint16; |
|
exports.ruint32 = mod_ctio.ruint32; |
|
exports.ruint64 = mod_ctio.ruint64; |
|
exports.wuint8 = mod_ctio.wuint8; |
|
exports.wuint16 = mod_ctio.wuint16; |
|
exports.wuint32 = mod_ctio.wuint32; |
|
exports.wuint64 = mod_ctio.wuint64; |
|
|
|
exports.rsint8 = mod_ctio.rsint8; |
|
exports.rsint16 = mod_ctio.rsint16; |
|
exports.rsint32 = mod_ctio.rsint32; |
|
exports.rsint64 = mod_ctio.rsint64; |
|
exports.wsint8 = mod_ctio.wsint8; |
|
exports.wsint16 = mod_ctio.wsint16; |
|
exports.wsint32 = mod_ctio.wsint32; |
|
exports.wsint64 = mod_ctio.wsint64; |
|
|
|
exports.rfloat = mod_ctio.rfloat; |
|
exports.rdouble = mod_ctio.rdouble; |
|
exports.wfloat = mod_ctio.wfloat; |
|
exports.wdouble = mod_ctio.wdouble; |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./ctf.js":117,"./ctio.js":118,"assert":157,"buffer":172}],120:[function(require,module,exports){ |
|
var stream = require('stream') |
|
|
|
|
|
function isStream (obj) { |
|
return obj instanceof stream.Stream |
|
} |
|
|
|
|
|
function isReadable (obj) { |
|
return isStream(obj) && typeof obj._read == 'function' && typeof obj._readableState == 'object' |
|
} |
|
|
|
|
|
function isWritable (obj) { |
|
return isStream(obj) && typeof obj._write == 'function' && typeof obj._writableState == 'object' |
|
} |
|
|
|
|
|
function isDuplex (obj) { |
|
return isReadable(obj) && isWritable(obj) |
|
} |
|
|
|
|
|
module.exports = isStream |
|
module.exports.isReadable = isReadable |
|
module.exports.isWritable = isWritable |
|
module.exports.isDuplex = isDuplex |
|
|
|
},{"stream":339}],121:[function(require,module,exports){ |
|
module.exports = stringify; |
|
|
|
function getSerialize (fn, decycle) { |
|
var seen = [], keys = []; |
|
decycle = decycle || function(key, value) { |
|
return '[Circular ' + getPath(value, seen, keys) + ']' |
|
}; |
|
return function(key, value) { |
|
var ret = value; |
|
if (typeof value === 'object' && value) { |
|
if (seen.indexOf(value) !== -1) |
|
ret = decycle(key, value); |
|
else { |
|
seen.push(value); |
|
keys.push(key); |
|
} |
|
} |
|
if (fn) ret = fn(key, ret); |
|
return ret; |
|
} |
|
} |
|
|
|
function getPath (value, seen, keys) { |
|
var index = seen.indexOf(value); |
|
var path = [ keys[index] ]; |
|
for (index--; index >= 0; index--) { |
|
if (seen[index][ path[0] ] === value) { |
|
value = seen[index]; |
|
path.unshift(keys[index]); |
|
} |
|
} |
|
return '~' + path.join('.'); |
|
} |
|
|
|
function stringify(obj, fn, spaces, decycle) { |
|
return JSON.stringify(obj, getSerialize(fn, decycle), spaces); |
|
} |
|
|
|
stringify.getSerialize = getSerialize; |
|
|
|
},{}],122:[function(require,module,exports){ |
|
|
|
var db = require('mime-db') |
|
|
|
// types[extension] = type |
|
exports.types = Object.create(null) |
|
// extensions[type] = [extensions] |
|
exports.extensions = Object.create(null) |
|
|
|
Object.keys(db).forEach(function (name) { |
|
var mime = db[name] |
|
var exts = mime.extensions |
|
if (!exts || !exts.length) return |
|
exports.extensions[name] = exts |
|
exts.forEach(function (ext) { |
|
exports.types[ext] = name |
|
}) |
|
}) |
|
|
|
exports.lookup = function (string) { |
|
if (!string || typeof string !== "string") return false |
|
// remove any leading paths, though we should just use path.basename |
|
string = string.replace(/.*[\.\/\\]/, '').toLowerCase() |
|
if (!string) return false |
|
return exports.types[string] || false |
|
} |
|
|
|
exports.extension = function (type) { |
|
if (!type || typeof type !== "string") return false |
|
// to do: use media-typer |
|
type = type.match(/^\s*([^;\s]*)(?:;|\s|$)/) |
|
if (!type) return false |
|
var exts = exports.extensions[type[1].toLowerCase()] |
|
if (!exts || !exts.length) return false |
|
return exts[0] |
|
} |
|
|
|
// type has to be an exact mime type |
|
exports.charset = function (type) { |
|
var mime = db[type] |
|
if (mime && mime.charset) return mime.charset |
|
|
|
// default text/* to utf-8 |
|
if (/^text\//.test(type)) return 'UTF-8' |
|
|
|
return false |
|
} |
|
|
|
// backwards compatibility |
|
exports.charsets = { |
|
lookup: exports.charset |
|
} |
|
|
|
// to do: maybe use set-type module or something |
|
exports.contentType = function (type) { |
|
if (!type || typeof type !== "string") return false |
|
if (!~type.indexOf('/')) type = exports.lookup(type) |
|
if (!type) return false |
|
if (!~type.indexOf('charset')) { |
|
var charset = exports.charset(type) |
|
if (charset) type += '; charset=' + charset.toLowerCase() |
|
} |
|
return type |
|
} |
|
|
|
},{"mime-db":124}],123:[function(require,module,exports){ |
|
module.exports={ |
|
"application/1d-interleaved-parityfec": { |
|
"source": "iana" |
|
}, |
|
"application/3gpdash-qoe-report+xml": { |
|
"source": "iana" |
|
}, |
|
"application/3gpp-ims+xml": { |
|
"source": "iana" |
|
}, |
|
"application/a2l": { |
|
"source": "iana" |
|
}, |
|
"application/activemessage": { |
|
"source": "iana" |
|
}, |
|
"application/alto-costmap+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-costmapfilter+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-directory+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-endpointcost+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-endpointcostparams+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-endpointprop+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-endpointpropparams+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-error+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-networkmap+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/alto-networkmapfilter+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/aml": { |
|
"source": "iana" |
|
}, |
|
"application/andrew-inset": { |
|
"source": "iana", |
|
"extensions": ["ez"] |
|
}, |
|
"application/applefile": { |
|
"source": "iana" |
|
}, |
|
"application/applixware": { |
|
"source": "apache", |
|
"extensions": ["aw"] |
|
}, |
|
"application/atf": { |
|
"source": "iana" |
|
}, |
|
"application/atfx": { |
|
"source": "iana" |
|
}, |
|
"application/atom+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["atom"] |
|
}, |
|
"application/atomcat+xml": { |
|
"source": "iana", |
|
"extensions": ["atomcat"] |
|
}, |
|
"application/atomdeleted+xml": { |
|
"source": "iana" |
|
}, |
|
"application/atomicmail": { |
|
"source": "iana" |
|
}, |
|
"application/atomsvc+xml": { |
|
"source": "iana", |
|
"extensions": ["atomsvc"] |
|
}, |
|
"application/atxml": { |
|
"source": "iana" |
|
}, |
|
"application/auth-policy+xml": { |
|
"source": "iana" |
|
}, |
|
"application/bacnet-xdd+zip": { |
|
"source": "iana" |
|
}, |
|
"application/batch-smtp": { |
|
"source": "iana" |
|
}, |
|
"application/beep+xml": { |
|
"source": "iana" |
|
}, |
|
"application/calendar+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/calendar+xml": { |
|
"source": "iana" |
|
}, |
|
"application/call-completion": { |
|
"source": "iana" |
|
}, |
|
"application/cals-1840": { |
|
"source": "iana" |
|
}, |
|
"application/cbor": { |
|
"source": "iana" |
|
}, |
|
"application/ccmp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/ccxml+xml": { |
|
"source": "iana", |
|
"extensions": ["ccxml"] |
|
}, |
|
"application/cdfx+xml": { |
|
"source": "iana" |
|
}, |
|
"application/cdmi-capability": { |
|
"source": "iana", |
|
"extensions": ["cdmia"] |
|
}, |
|
"application/cdmi-container": { |
|
"source": "iana", |
|
"extensions": ["cdmic"] |
|
}, |
|
"application/cdmi-domain": { |
|
"source": "iana", |
|
"extensions": ["cdmid"] |
|
}, |
|
"application/cdmi-object": { |
|
"source": "iana", |
|
"extensions": ["cdmio"] |
|
}, |
|
"application/cdmi-queue": { |
|
"source": "iana", |
|
"extensions": ["cdmiq"] |
|
}, |
|
"application/cea": { |
|
"source": "iana" |
|
}, |
|
"application/cea-2018+xml": { |
|
"source": "iana" |
|
}, |
|
"application/cellml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/cfw": { |
|
"source": "iana" |
|
}, |
|
"application/cms": { |
|
"source": "iana" |
|
}, |
|
"application/cnrp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/coap-group+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/commonground": { |
|
"source": "iana" |
|
}, |
|
"application/conference-info+xml": { |
|
"source": "iana" |
|
}, |
|
"application/cpl+xml": { |
|
"source": "iana" |
|
}, |
|
"application/csrattrs": { |
|
"source": "iana" |
|
}, |
|
"application/csta+xml": { |
|
"source": "iana" |
|
}, |
|
"application/cstadata+xml": { |
|
"source": "iana" |
|
}, |
|
"application/cu-seeme": { |
|
"source": "apache", |
|
"extensions": ["cu"] |
|
}, |
|
"application/cybercash": { |
|
"source": "iana" |
|
}, |
|
"application/dart": { |
|
"compressible": true |
|
}, |
|
"application/dash+xml": { |
|
"source": "iana", |
|
"extensions": ["mdp"] |
|
}, |
|
"application/dashdelta": { |
|
"source": "iana" |
|
}, |
|
"application/davmount+xml": { |
|
"source": "iana", |
|
"extensions": ["davmount"] |
|
}, |
|
"application/dca-rft": { |
|
"source": "iana" |
|
}, |
|
"application/dcd": { |
|
"source": "iana" |
|
}, |
|
"application/dec-dx": { |
|
"source": "iana" |
|
}, |
|
"application/dialog-info+xml": { |
|
"source": "iana" |
|
}, |
|
"application/dicom": { |
|
"source": "iana" |
|
}, |
|
"application/dii": { |
|
"source": "iana" |
|
}, |
|
"application/dit": { |
|
"source": "iana" |
|
}, |
|
"application/dns": { |
|
"source": "iana" |
|
}, |
|
"application/docbook+xml": { |
|
"source": "apache", |
|
"extensions": ["dbk"] |
|
}, |
|
"application/dskpp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/dssc+der": { |
|
"source": "iana", |
|
"extensions": ["dssc"] |
|
}, |
|
"application/dssc+xml": { |
|
"source": "iana", |
|
"extensions": ["xdssc"] |
|
}, |
|
"application/dvcs": { |
|
"source": "iana" |
|
}, |
|
"application/ecmascript": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["ecma"] |
|
}, |
|
"application/edi-consent": { |
|
"source": "iana" |
|
}, |
|
"application/edi-x12": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"application/edifact": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"application/emma+xml": { |
|
"source": "iana", |
|
"extensions": ["emma"] |
|
}, |
|
"application/emotionml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/encaprtp": { |
|
"source": "iana" |
|
}, |
|
"application/epp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/epub+zip": { |
|
"source": "iana", |
|
"extensions": ["epub"] |
|
}, |
|
"application/eshop": { |
|
"source": "iana" |
|
}, |
|
"application/exi": { |
|
"source": "iana", |
|
"extensions": ["exi"] |
|
}, |
|
"application/fastinfoset": { |
|
"source": "iana" |
|
}, |
|
"application/fastsoap": { |
|
"source": "iana" |
|
}, |
|
"application/fdt+xml": { |
|
"source": "iana" |
|
}, |
|
"application/fits": { |
|
"source": "iana" |
|
}, |
|
"application/font-sfnt": { |
|
"source": "iana" |
|
}, |
|
"application/font-tdpfr": { |
|
"source": "iana", |
|
"extensions": ["pfr"] |
|
}, |
|
"application/font-woff": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["woff"] |
|
}, |
|
"application/font-woff2": { |
|
"compressible": false, |
|
"extensions": ["woff2"] |
|
}, |
|
"application/framework-attributes+xml": { |
|
"source": "iana" |
|
}, |
|
"application/gml+xml": { |
|
"source": "apache", |
|
"extensions": ["gml"] |
|
}, |
|
"application/gpx+xml": { |
|
"source": "apache", |
|
"extensions": ["gpx"] |
|
}, |
|
"application/gxf": { |
|
"source": "apache", |
|
"extensions": ["gxf"] |
|
}, |
|
"application/gzip": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"application/h224": { |
|
"source": "iana" |
|
}, |
|
"application/held+xml": { |
|
"source": "iana" |
|
}, |
|
"application/http": { |
|
"source": "iana" |
|
}, |
|
"application/hyperstudio": { |
|
"source": "iana", |
|
"extensions": ["stk"] |
|
}, |
|
"application/ibe-key-request+xml": { |
|
"source": "iana" |
|
}, |
|
"application/ibe-pkg-reply+xml": { |
|
"source": "iana" |
|
}, |
|
"application/ibe-pp-data": { |
|
"source": "iana" |
|
}, |
|
"application/iges": { |
|
"source": "iana" |
|
}, |
|
"application/im-iscomposing+xml": { |
|
"source": "iana" |
|
}, |
|
"application/index": { |
|
"source": "iana" |
|
}, |
|
"application/index.cmd": { |
|
"source": "iana" |
|
}, |
|
"application/index.obj": { |
|
"source": "iana" |
|
}, |
|
"application/index.response": { |
|
"source": "iana" |
|
}, |
|
"application/index.vnd": { |
|
"source": "iana" |
|
}, |
|
"application/inkml+xml": { |
|
"source": "iana", |
|
"extensions": ["ink","inkml"] |
|
}, |
|
"application/iotp": { |
|
"source": "iana" |
|
}, |
|
"application/ipfix": { |
|
"source": "iana", |
|
"extensions": ["ipfix"] |
|
}, |
|
"application/ipp": { |
|
"source": "iana" |
|
}, |
|
"application/isup": { |
|
"source": "iana" |
|
}, |
|
"application/its+xml": { |
|
"source": "iana" |
|
}, |
|
"application/java-archive": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["jar"] |
|
}, |
|
"application/java-serialized-object": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["ser"] |
|
}, |
|
"application/java-vm": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["class"] |
|
}, |
|
"application/javascript": { |
|
"source": "iana", |
|
"charset": "UTF-8", |
|
"compressible": true, |
|
"extensions": ["js"] |
|
}, |
|
"application/jose": { |
|
"source": "iana" |
|
}, |
|
"application/jose+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/jrd+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/json": { |
|
"source": "iana", |
|
"charset": "UTF-8", |
|
"compressible": true, |
|
"extensions": ["json","map"] |
|
}, |
|
"application/json-patch+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/json-seq": { |
|
"source": "iana" |
|
}, |
|
"application/json5": { |
|
"extensions": ["json5"] |
|
}, |
|
"application/jsonml+json": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["jsonml"] |
|
}, |
|
"application/jwk+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/jwk-set+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/jwt": { |
|
"source": "iana" |
|
}, |
|
"application/kpml-request+xml": { |
|
"source": "iana" |
|
}, |
|
"application/kpml-response+xml": { |
|
"source": "iana" |
|
}, |
|
"application/ld+json": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["jsonld"] |
|
}, |
|
"application/link-format": { |
|
"source": "iana" |
|
}, |
|
"application/load-control+xml": { |
|
"source": "iana" |
|
}, |
|
"application/lost+xml": { |
|
"source": "iana", |
|
"extensions": ["lostxml"] |
|
}, |
|
"application/lostsync+xml": { |
|
"source": "iana" |
|
}, |
|
"application/lxf": { |
|
"source": "iana" |
|
}, |
|
"application/mac-binhex40": { |
|
"source": "iana", |
|
"extensions": ["hqx"] |
|
}, |
|
"application/mac-compactpro": { |
|
"source": "apache", |
|
"extensions": ["cpt"] |
|
}, |
|
"application/macwriteii": { |
|
"source": "iana" |
|
}, |
|
"application/mads+xml": { |
|
"source": "iana", |
|
"extensions": ["mads"] |
|
}, |
|
"application/marc": { |
|
"source": "iana", |
|
"extensions": ["mrc"] |
|
}, |
|
"application/marcxml+xml": { |
|
"source": "iana", |
|
"extensions": ["mrcx"] |
|
}, |
|
"application/mathematica": { |
|
"source": "iana", |
|
"extensions": ["ma","nb","mb"] |
|
}, |
|
"application/mathml+xml": { |
|
"source": "iana", |
|
"extensions": ["mathml"] |
|
}, |
|
"application/mathml-content+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mathml-presentation+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-associated-procedure-description+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-deregister+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-envelope+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-msk+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-msk-response+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-protection-description+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-reception-report+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-register+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-register-response+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-schedule+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbms-user-service-description+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mbox": { |
|
"source": "iana", |
|
"extensions": ["mbox"] |
|
}, |
|
"application/media-policy-dataset+xml": { |
|
"source": "iana" |
|
}, |
|
"application/media_control+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mediaservercontrol+xml": { |
|
"source": "iana", |
|
"extensions": ["mscml"] |
|
}, |
|
"application/merge-patch+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/metalink+xml": { |
|
"source": "apache", |
|
"extensions": ["metalink"] |
|
}, |
|
"application/metalink4+xml": { |
|
"source": "iana", |
|
"extensions": ["meta4"] |
|
}, |
|
"application/mets+xml": { |
|
"source": "iana", |
|
"extensions": ["mets"] |
|
}, |
|
"application/mf4": { |
|
"source": "iana" |
|
}, |
|
"application/mikey": { |
|
"source": "iana" |
|
}, |
|
"application/mods+xml": { |
|
"source": "iana", |
|
"extensions": ["mods"] |
|
}, |
|
"application/moss-keys": { |
|
"source": "iana" |
|
}, |
|
"application/moss-signature": { |
|
"source": "iana" |
|
}, |
|
"application/mosskey-data": { |
|
"source": "iana" |
|
}, |
|
"application/mosskey-request": { |
|
"source": "iana" |
|
}, |
|
"application/mp21": { |
|
"source": "iana", |
|
"extensions": ["m21","mp21"] |
|
}, |
|
"application/mp4": { |
|
"source": "iana", |
|
"extensions": ["mp4s","m4p"] |
|
}, |
|
"application/mpeg4-generic": { |
|
"source": "iana" |
|
}, |
|
"application/mpeg4-iod": { |
|
"source": "iana" |
|
}, |
|
"application/mpeg4-iod-xmt": { |
|
"source": "iana" |
|
}, |
|
"application/mrb-consumer+xml": { |
|
"source": "iana" |
|
}, |
|
"application/mrb-publish+xml": { |
|
"source": "iana" |
|
}, |
|
"application/msc-ivr+xml": { |
|
"source": "iana" |
|
}, |
|
"application/msc-mixer+xml": { |
|
"source": "iana" |
|
}, |
|
"application/msword": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["doc","dot"] |
|
}, |
|
"application/mxf": { |
|
"source": "iana", |
|
"extensions": ["mxf"] |
|
}, |
|
"application/nasdata": { |
|
"source": "iana" |
|
}, |
|
"application/news-checkgroups": { |
|
"source": "iana" |
|
}, |
|
"application/news-groupinfo": { |
|
"source": "iana" |
|
}, |
|
"application/news-transmission": { |
|
"source": "iana" |
|
}, |
|
"application/nlsml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/nss": { |
|
"source": "iana" |
|
}, |
|
"application/ocsp-request": { |
|
"source": "iana" |
|
}, |
|
"application/ocsp-response": { |
|
"source": "iana" |
|
}, |
|
"application/octet-stream": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["bin","dms","lrf","mar","so","dist","distz","pkg","bpk","dump","elc","deploy","buffer"] |
|
}, |
|
"application/oda": { |
|
"source": "iana", |
|
"extensions": ["oda"] |
|
}, |
|
"application/odx": { |
|
"source": "iana" |
|
}, |
|
"application/oebps-package+xml": { |
|
"source": "iana", |
|
"extensions": ["opf"] |
|
}, |
|
"application/ogg": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["ogx"] |
|
}, |
|
"application/omdoc+xml": { |
|
"source": "apache", |
|
"extensions": ["omdoc"] |
|
}, |
|
"application/onenote": { |
|
"source": "apache", |
|
"extensions": ["onetoc","onetoc2","onetmp","onepkg"] |
|
}, |
|
"application/oxps": { |
|
"source": "iana", |
|
"extensions": ["oxps"] |
|
}, |
|
"application/p2p-overlay+xml": { |
|
"source": "iana" |
|
}, |
|
"application/parityfec": { |
|
"source": "iana" |
|
}, |
|
"application/patch-ops-error+xml": { |
|
"source": "iana", |
|
"extensions": ["xer"] |
|
}, |
|
"application/pdf": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["pdf"] |
|
}, |
|
"application/pdx": { |
|
"source": "iana" |
|
}, |
|
"application/pgp-encrypted": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["pgp"] |
|
}, |
|
"application/pgp-keys": { |
|
"source": "iana" |
|
}, |
|
"application/pgp-signature": { |
|
"source": "iana", |
|
"extensions": ["asc","sig"] |
|
}, |
|
"application/pics-rules": { |
|
"source": "apache", |
|
"extensions": ["prf"] |
|
}, |
|
"application/pidf+xml": { |
|
"source": "iana" |
|
}, |
|
"application/pidf-diff+xml": { |
|
"source": "iana" |
|
}, |
|
"application/pkcs10": { |
|
"source": "iana", |
|
"extensions": ["p10"] |
|
}, |
|
"application/pkcs7-mime": { |
|
"source": "iana", |
|
"extensions": ["p7m","p7c"] |
|
}, |
|
"application/pkcs7-signature": { |
|
"source": "iana", |
|
"extensions": ["p7s"] |
|
}, |
|
"application/pkcs8": { |
|
"source": "iana", |
|
"extensions": ["p8"] |
|
}, |
|
"application/pkix-attr-cert": { |
|
"source": "iana", |
|
"extensions": ["ac"] |
|
}, |
|
"application/pkix-cert": { |
|
"source": "iana", |
|
"extensions": ["cer"] |
|
}, |
|
"application/pkix-crl": { |
|
"source": "iana", |
|
"extensions": ["crl"] |
|
}, |
|
"application/pkix-pkipath": { |
|
"source": "iana", |
|
"extensions": ["pkipath"] |
|
}, |
|
"application/pkixcmp": { |
|
"source": "iana", |
|
"extensions": ["pki"] |
|
}, |
|
"application/pls+xml": { |
|
"source": "iana", |
|
"extensions": ["pls"] |
|
}, |
|
"application/poc-settings+xml": { |
|
"source": "iana" |
|
}, |
|
"application/postscript": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["ai","eps","ps"] |
|
}, |
|
"application/provenance+xml": { |
|
"source": "iana" |
|
}, |
|
"application/prs.alvestrand.titrax-sheet": { |
|
"source": "iana" |
|
}, |
|
"application/prs.cww": { |
|
"source": "iana", |
|
"extensions": ["cww"] |
|
}, |
|
"application/prs.hpub+zip": { |
|
"source": "iana" |
|
}, |
|
"application/prs.nprend": { |
|
"source": "iana" |
|
}, |
|
"application/prs.plucker": { |
|
"source": "iana" |
|
}, |
|
"application/prs.rdf-xml-crypt": { |
|
"source": "iana" |
|
}, |
|
"application/prs.xsf+xml": { |
|
"source": "iana" |
|
}, |
|
"application/pskc+xml": { |
|
"source": "iana", |
|
"extensions": ["pskcxml"] |
|
}, |
|
"application/qsig": { |
|
"source": "iana" |
|
}, |
|
"application/raptorfec": { |
|
"source": "iana" |
|
}, |
|
"application/rdap+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/rdf+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["rdf"] |
|
}, |
|
"application/reginfo+xml": { |
|
"source": "iana", |
|
"extensions": ["rif"] |
|
}, |
|
"application/relax-ng-compact-syntax": { |
|
"source": "iana", |
|
"extensions": ["rnc"] |
|
}, |
|
"application/remote-printing": { |
|
"source": "iana" |
|
}, |
|
"application/reputon+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/resource-lists+xml": { |
|
"source": "iana", |
|
"extensions": ["rl"] |
|
}, |
|
"application/resource-lists-diff+xml": { |
|
"source": "iana", |
|
"extensions": ["rld"] |
|
}, |
|
"application/riscos": { |
|
"source": "iana" |
|
}, |
|
"application/rlmi+xml": { |
|
"source": "iana" |
|
}, |
|
"application/rls-services+xml": { |
|
"source": "iana", |
|
"extensions": ["rs"] |
|
}, |
|
"application/rpki-ghostbusters": { |
|
"source": "iana", |
|
"extensions": ["gbr"] |
|
}, |
|
"application/rpki-manifest": { |
|
"source": "iana", |
|
"extensions": ["mft"] |
|
}, |
|
"application/rpki-roa": { |
|
"source": "iana", |
|
"extensions": ["roa"] |
|
}, |
|
"application/rpki-updown": { |
|
"source": "iana" |
|
}, |
|
"application/rsd+xml": { |
|
"source": "apache", |
|
"extensions": ["rsd"] |
|
}, |
|
"application/rss+xml": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["rss"] |
|
}, |
|
"application/rtf": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["rtf"] |
|
}, |
|
"application/rtploopback": { |
|
"source": "iana" |
|
}, |
|
"application/rtx": { |
|
"source": "iana" |
|
}, |
|
"application/samlassertion+xml": { |
|
"source": "iana" |
|
}, |
|
"application/samlmetadata+xml": { |
|
"source": "iana" |
|
}, |
|
"application/sbml+xml": { |
|
"source": "iana", |
|
"extensions": ["sbml"] |
|
}, |
|
"application/scaip+xml": { |
|
"source": "iana" |
|
}, |
|
"application/scvp-cv-request": { |
|
"source": "iana", |
|
"extensions": ["scq"] |
|
}, |
|
"application/scvp-cv-response": { |
|
"source": "iana", |
|
"extensions": ["scs"] |
|
}, |
|
"application/scvp-vp-request": { |
|
"source": "iana", |
|
"extensions": ["spq"] |
|
}, |
|
"application/scvp-vp-response": { |
|
"source": "iana", |
|
"extensions": ["spp"] |
|
}, |
|
"application/sdp": { |
|
"source": "iana", |
|
"extensions": ["sdp"] |
|
}, |
|
"application/sep+xml": { |
|
"source": "iana" |
|
}, |
|
"application/sep-exi": { |
|
"source": "iana" |
|
}, |
|
"application/session-info": { |
|
"source": "iana" |
|
}, |
|
"application/set-payment": { |
|
"source": "iana" |
|
}, |
|
"application/set-payment-initiation": { |
|
"source": "iana", |
|
"extensions": ["setpay"] |
|
}, |
|
"application/set-registration": { |
|
"source": "iana" |
|
}, |
|
"application/set-registration-initiation": { |
|
"source": "iana", |
|
"extensions": ["setreg"] |
|
}, |
|
"application/sgml": { |
|
"source": "iana" |
|
}, |
|
"application/sgml-open-catalog": { |
|
"source": "iana" |
|
}, |
|
"application/shf+xml": { |
|
"source": "iana", |
|
"extensions": ["shf"] |
|
}, |
|
"application/sieve": { |
|
"source": "iana" |
|
}, |
|
"application/simple-filter+xml": { |
|
"source": "iana" |
|
}, |
|
"application/simple-message-summary": { |
|
"source": "iana" |
|
}, |
|
"application/simplesymbolcontainer": { |
|
"source": "iana" |
|
}, |
|
"application/slate": { |
|
"source": "iana" |
|
}, |
|
"application/smil": { |
|
"source": "iana" |
|
}, |
|
"application/smil+xml": { |
|
"source": "iana", |
|
"extensions": ["smi","smil"] |
|
}, |
|
"application/smpte336m": { |
|
"source": "iana" |
|
}, |
|
"application/soap+fastinfoset": { |
|
"source": "iana" |
|
}, |
|
"application/soap+xml": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/sparql-query": { |
|
"source": "iana", |
|
"extensions": ["rq"] |
|
}, |
|
"application/sparql-results+xml": { |
|
"source": "iana", |
|
"extensions": ["srx"] |
|
}, |
|
"application/spirits-event+xml": { |
|
"source": "iana" |
|
}, |
|
"application/sql": { |
|
"source": "iana" |
|
}, |
|
"application/srgs": { |
|
"source": "iana", |
|
"extensions": ["gram"] |
|
}, |
|
"application/srgs+xml": { |
|
"source": "iana", |
|
"extensions": ["grxml"] |
|
}, |
|
"application/sru+xml": { |
|
"source": "iana", |
|
"extensions": ["sru"] |
|
}, |
|
"application/ssdl+xml": { |
|
"source": "apache", |
|
"extensions": ["ssdl"] |
|
}, |
|
"application/ssml+xml": { |
|
"source": "iana", |
|
"extensions": ["ssml"] |
|
}, |
|
"application/tamp-apex-update": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-apex-update-confirm": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-community-update": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-community-update-confirm": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-error": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-sequence-adjust": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-sequence-adjust-confirm": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-status-query": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-status-response": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-update": { |
|
"source": "iana" |
|
}, |
|
"application/tamp-update-confirm": { |
|
"source": "iana" |
|
}, |
|
"application/tar": { |
|
"compressible": true |
|
}, |
|
"application/tei+xml": { |
|
"source": "iana", |
|
"extensions": ["tei","teicorpus"] |
|
}, |
|
"application/thraud+xml": { |
|
"source": "iana", |
|
"extensions": ["tfi"] |
|
}, |
|
"application/timestamp-query": { |
|
"source": "iana" |
|
}, |
|
"application/timestamp-reply": { |
|
"source": "iana" |
|
}, |
|
"application/timestamped-data": { |
|
"source": "iana", |
|
"extensions": ["tsd"] |
|
}, |
|
"application/ttml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/tve-trigger": { |
|
"source": "iana" |
|
}, |
|
"application/ulpfec": { |
|
"source": "iana" |
|
}, |
|
"application/urc-grpsheet+xml": { |
|
"source": "iana" |
|
}, |
|
"application/urc-ressheet+xml": { |
|
"source": "iana" |
|
}, |
|
"application/urc-targetdesc+xml": { |
|
"source": "iana" |
|
}, |
|
"application/urc-uisocketdesc+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vcard+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vcard+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vemmi": { |
|
"source": "iana" |
|
}, |
|
"application/vividence.scriptfile": { |
|
"source": "apache" |
|
}, |
|
"application/vnd.3gpp.bsf+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.3gpp.pic-bw-large": { |
|
"source": "iana", |
|
"extensions": ["plb"] |
|
}, |
|
"application/vnd.3gpp.pic-bw-small": { |
|
"source": "iana", |
|
"extensions": ["psb"] |
|
}, |
|
"application/vnd.3gpp.pic-bw-var": { |
|
"source": "iana", |
|
"extensions": ["pvb"] |
|
}, |
|
"application/vnd.3gpp.sms": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.3gpp2.bcmcsinfo+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.3gpp2.sms": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.3gpp2.tcap": { |
|
"source": "iana", |
|
"extensions": ["tcap"] |
|
}, |
|
"application/vnd.3m.post-it-notes": { |
|
"source": "iana", |
|
"extensions": ["pwn"] |
|
}, |
|
"application/vnd.accpac.simply.aso": { |
|
"source": "iana", |
|
"extensions": ["aso"] |
|
}, |
|
"application/vnd.accpac.simply.imp": { |
|
"source": "iana", |
|
"extensions": ["imp"] |
|
}, |
|
"application/vnd.acucobol": { |
|
"source": "iana", |
|
"extensions": ["acu"] |
|
}, |
|
"application/vnd.acucorp": { |
|
"source": "iana", |
|
"extensions": ["atc","acutc"] |
|
}, |
|
"application/vnd.adobe.air-application-installer-package+zip": { |
|
"source": "apache", |
|
"extensions": ["air"] |
|
}, |
|
"application/vnd.adobe.flash.movie": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.adobe.formscentral.fcdt": { |
|
"source": "iana", |
|
"extensions": ["fcdt"] |
|
}, |
|
"application/vnd.adobe.fxp": { |
|
"source": "iana", |
|
"extensions": ["fxp","fxpl"] |
|
}, |
|
"application/vnd.adobe.partial-upload": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.adobe.xdp+xml": { |
|
"source": "iana", |
|
"extensions": ["xdp"] |
|
}, |
|
"application/vnd.adobe.xfdf": { |
|
"source": "iana", |
|
"extensions": ["xfdf"] |
|
}, |
|
"application/vnd.aether.imp": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ah-barcode": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ahead.space": { |
|
"source": "iana", |
|
"extensions": ["ahead"] |
|
}, |
|
"application/vnd.airzip.filesecure.azf": { |
|
"source": "iana", |
|
"extensions": ["azf"] |
|
}, |
|
"application/vnd.airzip.filesecure.azs": { |
|
"source": "iana", |
|
"extensions": ["azs"] |
|
}, |
|
"application/vnd.amazon.ebook": { |
|
"source": "apache", |
|
"extensions": ["azw"] |
|
}, |
|
"application/vnd.americandynamics.acc": { |
|
"source": "iana", |
|
"extensions": ["acc"] |
|
}, |
|
"application/vnd.amiga.ami": { |
|
"source": "iana", |
|
"extensions": ["ami"] |
|
}, |
|
"application/vnd.amundsen.maze+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.android.package-archive": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["apk"] |
|
}, |
|
"application/vnd.anser-web-certificate-issue-initiation": { |
|
"source": "iana", |
|
"extensions": ["cii"] |
|
}, |
|
"application/vnd.anser-web-funds-transfer-initiation": { |
|
"source": "apache", |
|
"extensions": ["fti"] |
|
}, |
|
"application/vnd.antix.game-component": { |
|
"source": "iana", |
|
"extensions": ["atx"] |
|
}, |
|
"application/vnd.apache.thrift.binary": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.apache.thrift.compact": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.apache.thrift.json": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.api+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.apple.installer+xml": { |
|
"source": "iana", |
|
"extensions": ["mpkg"] |
|
}, |
|
"application/vnd.apple.mpegurl": { |
|
"source": "iana", |
|
"extensions": ["m3u8"] |
|
}, |
|
"application/vnd.arastra.swi": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.aristanetworks.swi": { |
|
"source": "iana", |
|
"extensions": ["swi"] |
|
}, |
|
"application/vnd.artsquare": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.astraea-software.iota": { |
|
"source": "iana", |
|
"extensions": ["iota"] |
|
}, |
|
"application/vnd.audiograph": { |
|
"source": "iana", |
|
"extensions": ["aep"] |
|
}, |
|
"application/vnd.autopackage": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.avistar+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.balsamiq.bmml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.bekitzur-stech+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.blueice.multipass": { |
|
"source": "iana", |
|
"extensions": ["mpm"] |
|
}, |
|
"application/vnd.bluetooth.ep.oob": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.bluetooth.le.oob": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.bmi": { |
|
"source": "iana", |
|
"extensions": ["bmi"] |
|
}, |
|
"application/vnd.businessobjects": { |
|
"source": "iana", |
|
"extensions": ["rep"] |
|
}, |
|
"application/vnd.cab-jscript": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.canon-cpdl": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.canon-lips": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.cendio.thinlinc.clientconf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.century-systems.tcp_stream": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.chemdraw+xml": { |
|
"source": "iana", |
|
"extensions": ["cdxml"] |
|
}, |
|
"application/vnd.chipnuts.karaoke-mmd": { |
|
"source": "iana", |
|
"extensions": ["mmd"] |
|
}, |
|
"application/vnd.cinderella": { |
|
"source": "iana", |
|
"extensions": ["cdy"] |
|
}, |
|
"application/vnd.cirpack.isdn-ext": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.citationstyles.style+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.claymore": { |
|
"source": "iana", |
|
"extensions": ["cla"] |
|
}, |
|
"application/vnd.cloanto.rp9": { |
|
"source": "iana", |
|
"extensions": ["rp9"] |
|
}, |
|
"application/vnd.clonk.c4group": { |
|
"source": "iana", |
|
"extensions": ["c4g","c4d","c4f","c4p","c4u"] |
|
}, |
|
"application/vnd.cluetrust.cartomobile-config": { |
|
"source": "iana", |
|
"extensions": ["c11amc"] |
|
}, |
|
"application/vnd.cluetrust.cartomobile-config-pkg": { |
|
"source": "iana", |
|
"extensions": ["c11amz"] |
|
}, |
|
"application/vnd.coffeescript": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.collection+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.collection.doc+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.collection.next+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.commerce-battelle": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.commonspace": { |
|
"source": "iana", |
|
"extensions": ["csp"] |
|
}, |
|
"application/vnd.contact.cmsg": { |
|
"source": "iana", |
|
"extensions": ["cdbcmsg"] |
|
}, |
|
"application/vnd.cosmocaller": { |
|
"source": "iana", |
|
"extensions": ["cmc"] |
|
}, |
|
"application/vnd.crick.clicker": { |
|
"source": "iana", |
|
"extensions": ["clkx"] |
|
}, |
|
"application/vnd.crick.clicker.keyboard": { |
|
"source": "iana", |
|
"extensions": ["clkk"] |
|
}, |
|
"application/vnd.crick.clicker.palette": { |
|
"source": "iana", |
|
"extensions": ["clkp"] |
|
}, |
|
"application/vnd.crick.clicker.template": { |
|
"source": "iana", |
|
"extensions": ["clkt"] |
|
}, |
|
"application/vnd.crick.clicker.wordbank": { |
|
"source": "iana", |
|
"extensions": ["clkw"] |
|
}, |
|
"application/vnd.criticaltools.wbs+xml": { |
|
"source": "iana", |
|
"extensions": ["wbs"] |
|
}, |
|
"application/vnd.ctc-posml": { |
|
"source": "iana", |
|
"extensions": ["pml"] |
|
}, |
|
"application/vnd.ctct.ws+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.cups-pdf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.cups-postscript": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.cups-ppd": { |
|
"source": "iana", |
|
"extensions": ["ppd"] |
|
}, |
|
"application/vnd.cups-raster": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.cups-raw": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.curl": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.curl.car": { |
|
"source": "apache", |
|
"extensions": ["car"] |
|
}, |
|
"application/vnd.curl.pcurl": { |
|
"source": "apache", |
|
"extensions": ["pcurl"] |
|
}, |
|
"application/vnd.cyan.dean.root+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.cybank": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dart": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["dart"] |
|
}, |
|
"application/vnd.data-vision.rdz": { |
|
"source": "iana", |
|
"extensions": ["rdz"] |
|
}, |
|
"application/vnd.debian.binary-package": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dece.data": { |
|
"source": "iana", |
|
"extensions": ["uvf","uvvf","uvd","uvvd"] |
|
}, |
|
"application/vnd.dece.ttml+xml": { |
|
"source": "iana", |
|
"extensions": ["uvt","uvvt"] |
|
}, |
|
"application/vnd.dece.unspecified": { |
|
"source": "iana", |
|
"extensions": ["uvx","uvvx"] |
|
}, |
|
"application/vnd.dece.zip": { |
|
"source": "iana", |
|
"extensions": ["uvz","uvvz"] |
|
}, |
|
"application/vnd.denovo.fcselayout-link": { |
|
"source": "iana", |
|
"extensions": ["fe_launch"] |
|
}, |
|
"application/vnd.desmume-movie": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dir-bi.plate-dl-nosuffix": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dm.delegation+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dna": { |
|
"source": "iana", |
|
"extensions": ["dna"] |
|
}, |
|
"application/vnd.document+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.dolby.mlp": { |
|
"source": "apache", |
|
"extensions": ["mlp"] |
|
}, |
|
"application/vnd.dolby.mobile.1": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dolby.mobile.2": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.doremir.scorecloud-binary-document": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dpgraph": { |
|
"source": "iana", |
|
"extensions": ["dpg"] |
|
}, |
|
"application/vnd.dreamfactory": { |
|
"source": "iana", |
|
"extensions": ["dfac"] |
|
}, |
|
"application/vnd.ds-keypoint": { |
|
"source": "apache", |
|
"extensions": ["kpxx"] |
|
}, |
|
"application/vnd.dtg.local": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dtg.local.flash": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dtg.local.html": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.ait": { |
|
"source": "iana", |
|
"extensions": ["ait"] |
|
}, |
|
"application/vnd.dvb.dvbj": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.esgcontainer": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.ipdcdftnotifaccess": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.ipdcesgaccess": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.ipdcesgaccess2": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.ipdcesgpdd": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.ipdcroaming": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.iptv.alfec-base": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.iptv.alfec-enhancement": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-aggregate-root+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-container+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-generic+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-ia-msglist+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-ia-registration-request+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-ia-registration-response+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.notif-init+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.pfr": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dvb.service": { |
|
"source": "iana", |
|
"extensions": ["svc"] |
|
}, |
|
"application/vnd.dxr": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.dynageo": { |
|
"source": "iana", |
|
"extensions": ["geo"] |
|
}, |
|
"application/vnd.dzr": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.easykaraoke.cdgdownload": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ecdis-update": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ecowin.chart": { |
|
"source": "iana", |
|
"extensions": ["mag"] |
|
}, |
|
"application/vnd.ecowin.filerequest": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ecowin.fileupdate": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ecowin.series": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ecowin.seriesrequest": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ecowin.seriesupdate": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.emclient.accessrequest+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.enliven": { |
|
"source": "iana", |
|
"extensions": ["nml"] |
|
}, |
|
"application/vnd.enphase.envoy": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.eprints.data+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.epson.esf": { |
|
"source": "iana", |
|
"extensions": ["esf"] |
|
}, |
|
"application/vnd.epson.msf": { |
|
"source": "iana", |
|
"extensions": ["msf"] |
|
}, |
|
"application/vnd.epson.quickanime": { |
|
"source": "iana", |
|
"extensions": ["qam"] |
|
}, |
|
"application/vnd.epson.salt": { |
|
"source": "iana", |
|
"extensions": ["slt"] |
|
}, |
|
"application/vnd.epson.ssf": { |
|
"source": "iana", |
|
"extensions": ["ssf"] |
|
}, |
|
"application/vnd.ericsson.quickcall": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.eszigno3+xml": { |
|
"source": "iana", |
|
"extensions": ["es3","et3"] |
|
}, |
|
"application/vnd.etsi.aoc+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.asic-e+zip": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.asic-s+zip": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.cug+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvcommand+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvdiscovery+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvprofile+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvsad-bc+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvsad-cod+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvsad-npvr+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvservice+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvsync+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.iptvueprofile+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.mcid+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.mheg5": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.overload-control-policy-dataset+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.pstn+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.sci+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.simservs+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.timestamp-token": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.tsl+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.etsi.tsl.der": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.eudora.data": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ezpix-album": { |
|
"source": "iana", |
|
"extensions": ["ez2"] |
|
}, |
|
"application/vnd.ezpix-package": { |
|
"source": "iana", |
|
"extensions": ["ez3"] |
|
}, |
|
"application/vnd.f-secure.mobile": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fastcopy-disk-image": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fdf": { |
|
"source": "iana", |
|
"extensions": ["fdf"] |
|
}, |
|
"application/vnd.fdsn.mseed": { |
|
"source": "iana", |
|
"extensions": ["mseed"] |
|
}, |
|
"application/vnd.fdsn.seed": { |
|
"source": "iana", |
|
"extensions": ["seed","dataless"] |
|
}, |
|
"application/vnd.ffsns": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fints": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.flographit": { |
|
"source": "iana", |
|
"extensions": ["gph"] |
|
}, |
|
"application/vnd.fluxtime.clip": { |
|
"source": "iana", |
|
"extensions": ["ftc"] |
|
}, |
|
"application/vnd.font-fontforge-sfd": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.framemaker": { |
|
"source": "iana", |
|
"extensions": ["fm","frame","maker","book"] |
|
}, |
|
"application/vnd.frogans.fnc": { |
|
"source": "iana", |
|
"extensions": ["fnc"] |
|
}, |
|
"application/vnd.frogans.ltf": { |
|
"source": "iana", |
|
"extensions": ["ltf"] |
|
}, |
|
"application/vnd.fsc.weblaunch": { |
|
"source": "iana", |
|
"extensions": ["fsc"] |
|
}, |
|
"application/vnd.fujitsu.oasys": { |
|
"source": "iana", |
|
"extensions": ["oas"] |
|
}, |
|
"application/vnd.fujitsu.oasys2": { |
|
"source": "iana", |
|
"extensions": ["oa2"] |
|
}, |
|
"application/vnd.fujitsu.oasys3": { |
|
"source": "iana", |
|
"extensions": ["oa3"] |
|
}, |
|
"application/vnd.fujitsu.oasysgp": { |
|
"source": "iana", |
|
"extensions": ["fg5"] |
|
}, |
|
"application/vnd.fujitsu.oasysprs": { |
|
"source": "iana", |
|
"extensions": ["bh2"] |
|
}, |
|
"application/vnd.fujixerox.art-ex": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fujixerox.art4": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fujixerox.ddd": { |
|
"source": "iana", |
|
"extensions": ["ddd"] |
|
}, |
|
"application/vnd.fujixerox.docuworks": { |
|
"source": "iana", |
|
"extensions": ["xdw"] |
|
}, |
|
"application/vnd.fujixerox.docuworks.binder": { |
|
"source": "iana", |
|
"extensions": ["xbd"] |
|
}, |
|
"application/vnd.fujixerox.docuworks.container": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fujixerox.hbpl": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fut-misnet": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.fuzzysheet": { |
|
"source": "iana", |
|
"extensions": ["fzs"] |
|
}, |
|
"application/vnd.genomatix.tuxedo": { |
|
"source": "iana", |
|
"extensions": ["txd"] |
|
}, |
|
"application/vnd.geo+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.geocube+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.geogebra.file": { |
|
"source": "iana", |
|
"extensions": ["ggb"] |
|
}, |
|
"application/vnd.geogebra.tool": { |
|
"source": "iana", |
|
"extensions": ["ggt"] |
|
}, |
|
"application/vnd.geometry-explorer": { |
|
"source": "iana", |
|
"extensions": ["gex","gre"] |
|
}, |
|
"application/vnd.geonext": { |
|
"source": "iana", |
|
"extensions": ["gxt"] |
|
}, |
|
"application/vnd.geoplan": { |
|
"source": "iana", |
|
"extensions": ["g2w"] |
|
}, |
|
"application/vnd.geospace": { |
|
"source": "iana", |
|
"extensions": ["g3w"] |
|
}, |
|
"application/vnd.gerber": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.globalplatform.card-content-mgt": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.globalplatform.card-content-mgt-response": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.gmx": { |
|
"source": "iana", |
|
"extensions": ["gmx"] |
|
}, |
|
"application/vnd.google-earth.kml+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["kml"] |
|
}, |
|
"application/vnd.google-earth.kmz": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["kmz"] |
|
}, |
|
"application/vnd.gov.sk.e-form+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.gov.sk.e-form+zip": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.gov.sk.xmldatacontainer+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.grafeq": { |
|
"source": "iana", |
|
"extensions": ["gqf","gqs"] |
|
}, |
|
"application/vnd.gridmp": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.groove-account": { |
|
"source": "iana", |
|
"extensions": ["gac"] |
|
}, |
|
"application/vnd.groove-help": { |
|
"source": "iana", |
|
"extensions": ["ghf"] |
|
}, |
|
"application/vnd.groove-identity-message": { |
|
"source": "iana", |
|
"extensions": ["gim"] |
|
}, |
|
"application/vnd.groove-injector": { |
|
"source": "iana", |
|
"extensions": ["grv"] |
|
}, |
|
"application/vnd.groove-tool-message": { |
|
"source": "iana", |
|
"extensions": ["gtm"] |
|
}, |
|
"application/vnd.groove-tool-template": { |
|
"source": "iana", |
|
"extensions": ["tpl"] |
|
}, |
|
"application/vnd.groove-vcard": { |
|
"source": "iana", |
|
"extensions": ["vcg"] |
|
}, |
|
"application/vnd.hal+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.hal+xml": { |
|
"source": "iana", |
|
"extensions": ["hal"] |
|
}, |
|
"application/vnd.handheld-entertainment+xml": { |
|
"source": "iana", |
|
"extensions": ["zmm"] |
|
}, |
|
"application/vnd.hbci": { |
|
"source": "iana", |
|
"extensions": ["hbci"] |
|
}, |
|
"application/vnd.hcl-bireports": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.heroku+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.hhe.lesson-player": { |
|
"source": "iana", |
|
"extensions": ["les"] |
|
}, |
|
"application/vnd.hp-hpgl": { |
|
"source": "iana", |
|
"extensions": ["hpgl"] |
|
}, |
|
"application/vnd.hp-hpid": { |
|
"source": "iana", |
|
"extensions": ["hpid"] |
|
}, |
|
"application/vnd.hp-hps": { |
|
"source": "iana", |
|
"extensions": ["hps"] |
|
}, |
|
"application/vnd.hp-jlyt": { |
|
"source": "iana", |
|
"extensions": ["jlt"] |
|
}, |
|
"application/vnd.hp-pcl": { |
|
"source": "iana", |
|
"extensions": ["pcl"] |
|
}, |
|
"application/vnd.hp-pclxl": { |
|
"source": "iana", |
|
"extensions": ["pclxl"] |
|
}, |
|
"application/vnd.httphone": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.hydrostatix.sof-data": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.hzn-3d-crossword": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ibm.afplinedata": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ibm.electronic-media": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ibm.minipay": { |
|
"source": "iana", |
|
"extensions": ["mpy"] |
|
}, |
|
"application/vnd.ibm.modcap": { |
|
"source": "iana", |
|
"extensions": ["afp","listafp","list3820"] |
|
}, |
|
"application/vnd.ibm.rights-management": { |
|
"source": "iana", |
|
"extensions": ["irm"] |
|
}, |
|
"application/vnd.ibm.secure-container": { |
|
"source": "iana", |
|
"extensions": ["sc"] |
|
}, |
|
"application/vnd.iccprofile": { |
|
"source": "iana", |
|
"extensions": ["icc","icm"] |
|
}, |
|
"application/vnd.ieee.1905": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.igloader": { |
|
"source": "iana", |
|
"extensions": ["igl"] |
|
}, |
|
"application/vnd.immervision-ivp": { |
|
"source": "iana", |
|
"extensions": ["ivp"] |
|
}, |
|
"application/vnd.immervision-ivu": { |
|
"source": "iana", |
|
"extensions": ["ivu"] |
|
}, |
|
"application/vnd.ims.imsccv1p1": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ims.imsccv1p2": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ims.imsccv1p3": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ims.lis.v2.result+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.ims.lti.v2.toolconsumerprofile+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.ims.lti.v2.toolproxy+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.ims.lti.v2.toolproxy.id+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.ims.lti.v2.toolsettings+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.ims.lti.v2.toolsettings.simple+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.informedcontrol.rms+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.informix-visionary": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.infotech.project": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.infotech.project+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.innopath.wamp.notification": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.insors.igm": { |
|
"source": "iana", |
|
"extensions": ["igm"] |
|
}, |
|
"application/vnd.intercon.formnet": { |
|
"source": "iana", |
|
"extensions": ["xpw","xpx"] |
|
}, |
|
"application/vnd.intergeo": { |
|
"source": "iana", |
|
"extensions": ["i2g"] |
|
}, |
|
"application/vnd.intertrust.digibox": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.intertrust.nncp": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.intu.qbo": { |
|
"source": "iana", |
|
"extensions": ["qbo"] |
|
}, |
|
"application/vnd.intu.qfx": { |
|
"source": "iana", |
|
"extensions": ["qfx"] |
|
}, |
|
"application/vnd.iptc.g2.catalogitem+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.iptc.g2.conceptitem+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.iptc.g2.knowledgeitem+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.iptc.g2.newsitem+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.iptc.g2.newsmessage+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.iptc.g2.packageitem+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.iptc.g2.planningitem+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ipunplugged.rcprofile": { |
|
"source": "iana", |
|
"extensions": ["rcprofile"] |
|
}, |
|
"application/vnd.irepository.package+xml": { |
|
"source": "iana", |
|
"extensions": ["irp"] |
|
}, |
|
"application/vnd.is-xpr": { |
|
"source": "iana", |
|
"extensions": ["xpr"] |
|
}, |
|
"application/vnd.isac.fcs": { |
|
"source": "iana", |
|
"extensions": ["fcs"] |
|
}, |
|
"application/vnd.jam": { |
|
"source": "iana", |
|
"extensions": ["jam"] |
|
}, |
|
"application/vnd.japannet-directory-service": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-jpnstore-wakeup": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-payment-wakeup": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-registration": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-registration-wakeup": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-setstore-wakeup": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-verification": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.japannet-verification-wakeup": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.jcp.javame.midlet-rms": { |
|
"source": "iana", |
|
"extensions": ["rms"] |
|
}, |
|
"application/vnd.jisp": { |
|
"source": "iana", |
|
"extensions": ["jisp"] |
|
}, |
|
"application/vnd.joost.joda-archive": { |
|
"source": "iana", |
|
"extensions": ["joda"] |
|
}, |
|
"application/vnd.jsk.isdn-ngn": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.kahootz": { |
|
"source": "iana", |
|
"extensions": ["ktz","ktr"] |
|
}, |
|
"application/vnd.kde.karbon": { |
|
"source": "iana", |
|
"extensions": ["karbon"] |
|
}, |
|
"application/vnd.kde.kchart": { |
|
"source": "iana", |
|
"extensions": ["chrt"] |
|
}, |
|
"application/vnd.kde.kformula": { |
|
"source": "iana", |
|
"extensions": ["kfo"] |
|
}, |
|
"application/vnd.kde.kivio": { |
|
"source": "iana", |
|
"extensions": ["flw"] |
|
}, |
|
"application/vnd.kde.kontour": { |
|
"source": "iana", |
|
"extensions": ["kon"] |
|
}, |
|
"application/vnd.kde.kpresenter": { |
|
"source": "iana", |
|
"extensions": ["kpr","kpt"] |
|
}, |
|
"application/vnd.kde.kspread": { |
|
"source": "iana", |
|
"extensions": ["ksp"] |
|
}, |
|
"application/vnd.kde.kword": { |
|
"source": "iana", |
|
"extensions": ["kwd","kwt"] |
|
}, |
|
"application/vnd.kenameaapp": { |
|
"source": "iana", |
|
"extensions": ["htke"] |
|
}, |
|
"application/vnd.kidspiration": { |
|
"source": "iana", |
|
"extensions": ["kia"] |
|
}, |
|
"application/vnd.kinar": { |
|
"source": "iana", |
|
"extensions": ["kne","knp"] |
|
}, |
|
"application/vnd.koan": { |
|
"source": "iana", |
|
"extensions": ["skp","skd","skt","skm"] |
|
}, |
|
"application/vnd.kodak-descriptor": { |
|
"source": "iana", |
|
"extensions": ["sse"] |
|
}, |
|
"application/vnd.las.las+xml": { |
|
"source": "iana", |
|
"extensions": ["lasxml"] |
|
}, |
|
"application/vnd.liberty-request+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.llamagraphics.life-balance.desktop": { |
|
"source": "iana", |
|
"extensions": ["lbd"] |
|
}, |
|
"application/vnd.llamagraphics.life-balance.exchange+xml": { |
|
"source": "iana", |
|
"extensions": ["lbe"] |
|
}, |
|
"application/vnd.lotus-1-2-3": { |
|
"source": "iana", |
|
"extensions": ["123"] |
|
}, |
|
"application/vnd.lotus-approach": { |
|
"source": "iana", |
|
"extensions": ["apr"] |
|
}, |
|
"application/vnd.lotus-freelance": { |
|
"source": "iana", |
|
"extensions": ["pre"] |
|
}, |
|
"application/vnd.lotus-notes": { |
|
"source": "iana", |
|
"extensions": ["nsf"] |
|
}, |
|
"application/vnd.lotus-organizer": { |
|
"source": "iana", |
|
"extensions": ["org"] |
|
}, |
|
"application/vnd.lotus-screencam": { |
|
"source": "iana", |
|
"extensions": ["scm"] |
|
}, |
|
"application/vnd.lotus-wordpro": { |
|
"source": "iana", |
|
"extensions": ["lwp"] |
|
}, |
|
"application/vnd.macports.portpkg": { |
|
"source": "iana", |
|
"extensions": ["portpkg"] |
|
}, |
|
"application/vnd.marlin.drm.actiontoken+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.marlin.drm.conftoken+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.marlin.drm.license+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.marlin.drm.mdcf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mason+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.maxmind.maxmind-db": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mcd": { |
|
"source": "iana", |
|
"extensions": ["mcd"] |
|
}, |
|
"application/vnd.medcalcdata": { |
|
"source": "iana", |
|
"extensions": ["mc1"] |
|
}, |
|
"application/vnd.mediastation.cdkey": { |
|
"source": "iana", |
|
"extensions": ["cdkey"] |
|
}, |
|
"application/vnd.meridian-slingshot": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mfer": { |
|
"source": "iana", |
|
"extensions": ["mwf"] |
|
}, |
|
"application/vnd.mfmp": { |
|
"source": "iana", |
|
"extensions": ["mfm"] |
|
}, |
|
"application/vnd.micrografx.flo": { |
|
"source": "iana", |
|
"extensions": ["flo"] |
|
}, |
|
"application/vnd.micrografx.igx": { |
|
"source": "iana", |
|
"extensions": ["igx"] |
|
}, |
|
"application/vnd.miele+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.mif": { |
|
"source": "iana", |
|
"extensions": ["mif"] |
|
}, |
|
"application/vnd.minisoft-hp3000-save": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mitsubishi.misty-guard.trustweb": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mobius.daf": { |
|
"source": "iana", |
|
"extensions": ["daf"] |
|
}, |
|
"application/vnd.mobius.dis": { |
|
"source": "iana", |
|
"extensions": ["dis"] |
|
}, |
|
"application/vnd.mobius.mbk": { |
|
"source": "iana", |
|
"extensions": ["mbk"] |
|
}, |
|
"application/vnd.mobius.mqy": { |
|
"source": "iana", |
|
"extensions": ["mqy"] |
|
}, |
|
"application/vnd.mobius.msl": { |
|
"source": "iana", |
|
"extensions": ["msl"] |
|
}, |
|
"application/vnd.mobius.plc": { |
|
"source": "iana", |
|
"extensions": ["plc"] |
|
}, |
|
"application/vnd.mobius.txf": { |
|
"source": "iana", |
|
"extensions": ["txf"] |
|
}, |
|
"application/vnd.mophun.application": { |
|
"source": "iana", |
|
"extensions": ["mpn"] |
|
}, |
|
"application/vnd.mophun.certificate": { |
|
"source": "iana", |
|
"extensions": ["mpc"] |
|
}, |
|
"application/vnd.motorola.flexsuite": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.flexsuite.adsi": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.flexsuite.fis": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.flexsuite.gotap": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.flexsuite.kmr": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.flexsuite.ttc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.flexsuite.wem": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.motorola.iprm": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mozilla.xul+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["xul"] |
|
}, |
|
"application/vnd.ms-3mfdocument": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-artgalry": { |
|
"source": "iana", |
|
"extensions": ["cil"] |
|
}, |
|
"application/vnd.ms-asf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-cab-compressed": { |
|
"source": "iana", |
|
"extensions": ["cab"] |
|
}, |
|
"application/vnd.ms-color.iccprofile": { |
|
"source": "apache" |
|
}, |
|
"application/vnd.ms-excel": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["xls","xlm","xla","xlc","xlt","xlw"] |
|
}, |
|
"application/vnd.ms-excel.addin.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["xlam"] |
|
}, |
|
"application/vnd.ms-excel.sheet.binary.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["xlsb"] |
|
}, |
|
"application/vnd.ms-excel.sheet.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["xlsm"] |
|
}, |
|
"application/vnd.ms-excel.template.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["xltm"] |
|
}, |
|
"application/vnd.ms-fontobject": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["eot"] |
|
}, |
|
"application/vnd.ms-htmlhelp": { |
|
"source": "iana", |
|
"extensions": ["chm"] |
|
}, |
|
"application/vnd.ms-ims": { |
|
"source": "iana", |
|
"extensions": ["ims"] |
|
}, |
|
"application/vnd.ms-lrm": { |
|
"source": "iana", |
|
"extensions": ["lrm"] |
|
}, |
|
"application/vnd.ms-office.activex+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-officetheme": { |
|
"source": "iana", |
|
"extensions": ["thmx"] |
|
}, |
|
"application/vnd.ms-opentype": { |
|
"source": "apache", |
|
"compressible": true |
|
}, |
|
"application/vnd.ms-package.obfuscated-opentype": { |
|
"source": "apache" |
|
}, |
|
"application/vnd.ms-pki.seccat": { |
|
"source": "apache", |
|
"extensions": ["cat"] |
|
}, |
|
"application/vnd.ms-pki.stl": { |
|
"source": "apache", |
|
"extensions": ["stl"] |
|
}, |
|
"application/vnd.ms-playready.initiator+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-powerpoint": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["ppt","pps","pot"] |
|
}, |
|
"application/vnd.ms-powerpoint.addin.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["ppam"] |
|
}, |
|
"application/vnd.ms-powerpoint.presentation.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["pptm"] |
|
}, |
|
"application/vnd.ms-powerpoint.slide.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["sldm"] |
|
}, |
|
"application/vnd.ms-powerpoint.slideshow.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["ppsm"] |
|
}, |
|
"application/vnd.ms-powerpoint.template.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["potm"] |
|
}, |
|
"application/vnd.ms-printing.printticket+xml": { |
|
"source": "apache" |
|
}, |
|
"application/vnd.ms-project": { |
|
"source": "iana", |
|
"extensions": ["mpp","mpt"] |
|
}, |
|
"application/vnd.ms-tnef": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-windows.printerpairing": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-wmdrm.lic-chlg-req": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-wmdrm.lic-resp": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-wmdrm.meter-chlg-req": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-wmdrm.meter-resp": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ms-word.document.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["docm"] |
|
}, |
|
"application/vnd.ms-word.template.macroenabled.12": { |
|
"source": "iana", |
|
"extensions": ["dotm"] |
|
}, |
|
"application/vnd.ms-works": { |
|
"source": "iana", |
|
"extensions": ["wps","wks","wcm","wdb"] |
|
}, |
|
"application/vnd.ms-wpl": { |
|
"source": "iana", |
|
"extensions": ["wpl"] |
|
}, |
|
"application/vnd.ms-xpsdocument": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["xps"] |
|
}, |
|
"application/vnd.msa-disk-image": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.mseq": { |
|
"source": "iana", |
|
"extensions": ["mseq"] |
|
}, |
|
"application/vnd.msign": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.multiad.creator": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.multiad.creator.cif": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.music-niff": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.musician": { |
|
"source": "iana", |
|
"extensions": ["mus"] |
|
}, |
|
"application/vnd.muvee.style": { |
|
"source": "iana", |
|
"extensions": ["msty"] |
|
}, |
|
"application/vnd.mynfc": { |
|
"source": "iana", |
|
"extensions": ["taglet"] |
|
}, |
|
"application/vnd.ncd.control": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ncd.reference": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nervana": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.netfpx": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.neurolanguage.nlu": { |
|
"source": "iana", |
|
"extensions": ["nlu"] |
|
}, |
|
"application/vnd.nintendo.nitro.rom": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nintendo.snes.rom": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nitf": { |
|
"source": "iana", |
|
"extensions": ["ntf","nitf"] |
|
}, |
|
"application/vnd.noblenet-directory": { |
|
"source": "iana", |
|
"extensions": ["nnd"] |
|
}, |
|
"application/vnd.noblenet-sealer": { |
|
"source": "iana", |
|
"extensions": ["nns"] |
|
}, |
|
"application/vnd.noblenet-web": { |
|
"source": "iana", |
|
"extensions": ["nnw"] |
|
}, |
|
"application/vnd.nokia.catalogs": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.conml+wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.conml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.iptv.config+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.isds-radio-presets": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.landmark+wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.landmark+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.landmarkcollection+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.n-gage.ac+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.n-gage.data": { |
|
"source": "iana", |
|
"extensions": ["ngdat"] |
|
}, |
|
"application/vnd.nokia.n-gage.symbian.install": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.ncd": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.pcd+wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.pcd+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.nokia.radio-preset": { |
|
"source": "iana", |
|
"extensions": ["rpst"] |
|
}, |
|
"application/vnd.nokia.radio-presets": { |
|
"source": "iana", |
|
"extensions": ["rpss"] |
|
}, |
|
"application/vnd.novadigm.edm": { |
|
"source": "iana", |
|
"extensions": ["edm"] |
|
}, |
|
"application/vnd.novadigm.edx": { |
|
"source": "iana", |
|
"extensions": ["edx"] |
|
}, |
|
"application/vnd.novadigm.ext": { |
|
"source": "iana", |
|
"extensions": ["ext"] |
|
}, |
|
"application/vnd.ntt-local.content-share": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ntt-local.file-transfer": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ntt-local.ogw_remote-access": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ntt-local.sip-ta_remote": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ntt-local.sip-ta_tcp_stream": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oasis.opendocument.chart": { |
|
"source": "iana", |
|
"extensions": ["odc"] |
|
}, |
|
"application/vnd.oasis.opendocument.chart-template": { |
|
"source": "iana", |
|
"extensions": ["otc"] |
|
}, |
|
"application/vnd.oasis.opendocument.database": { |
|
"source": "iana", |
|
"extensions": ["odb"] |
|
}, |
|
"application/vnd.oasis.opendocument.formula": { |
|
"source": "iana", |
|
"extensions": ["odf"] |
|
}, |
|
"application/vnd.oasis.opendocument.formula-template": { |
|
"source": "iana", |
|
"extensions": ["odft"] |
|
}, |
|
"application/vnd.oasis.opendocument.graphics": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["odg"] |
|
}, |
|
"application/vnd.oasis.opendocument.graphics-template": { |
|
"source": "iana", |
|
"extensions": ["otg"] |
|
}, |
|
"application/vnd.oasis.opendocument.image": { |
|
"source": "iana", |
|
"extensions": ["odi"] |
|
}, |
|
"application/vnd.oasis.opendocument.image-template": { |
|
"source": "iana", |
|
"extensions": ["oti"] |
|
}, |
|
"application/vnd.oasis.opendocument.presentation": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["odp"] |
|
}, |
|
"application/vnd.oasis.opendocument.presentation-template": { |
|
"source": "iana", |
|
"extensions": ["otp"] |
|
}, |
|
"application/vnd.oasis.opendocument.spreadsheet": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["ods"] |
|
}, |
|
"application/vnd.oasis.opendocument.spreadsheet-template": { |
|
"source": "iana", |
|
"extensions": ["ots"] |
|
}, |
|
"application/vnd.oasis.opendocument.text": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["odt"] |
|
}, |
|
"application/vnd.oasis.opendocument.text-master": { |
|
"source": "iana", |
|
"extensions": ["odm"] |
|
}, |
|
"application/vnd.oasis.opendocument.text-template": { |
|
"source": "iana", |
|
"extensions": ["ott"] |
|
}, |
|
"application/vnd.oasis.opendocument.text-web": { |
|
"source": "iana", |
|
"extensions": ["oth"] |
|
}, |
|
"application/vnd.obn": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oftn.l10n+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.oipf.contentaccessdownload+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.contentaccessstreaming+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.cspg-hexbinary": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.dae.svg+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.dae.xhtml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.mippvcontrolmessage+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.pae.gem": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.spdiscovery+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.spdlist+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.ueprofile+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oipf.userprofile+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.olpc-sugar": { |
|
"source": "iana", |
|
"extensions": ["xo"] |
|
}, |
|
"application/vnd.oma-scws-config": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma-scws-http-request": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma-scws-http-response": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.associated-procedure-parameter+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.drm-trigger+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.imd+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.ltkm": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.notification+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.provisioningtrigger": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.sgboot": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.sgdd+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.sgdu": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.simple-symbol-container": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.smartcard-trigger+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.sprov+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.bcast.stkm": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.cab-address-book+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.cab-feature-handler+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.cab-pcc+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.cab-subs-invite+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.cab-user-prefs+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.dcd": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.dcdc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.dd2+xml": { |
|
"source": "iana", |
|
"extensions": ["dd2"] |
|
}, |
|
"application/vnd.oma.drm.risd+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.group-usage-list+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.pal+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.poc.detailed-progress-report+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.poc.final-report+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.poc.groups+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.poc.invocation-descriptor+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.poc.optimized-progress-report+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.push": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.scidm.messages+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oma.xcap-directory+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.omads-email+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.omads-file+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.omads-folder+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.omaloc-supl-init": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openeye.oeb": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openofficeorg.extension": { |
|
"source": "apache", |
|
"extensions": ["oxt"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.custom-properties+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.customxmlproperties+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawing+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawingml.chart+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawingml.chartshapes+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawingml.diagramcolors+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawingml.diagramdata+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawingml.diagramlayout+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.drawingml.diagramstyle+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.extended-properties+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml-template": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.commentauthors+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.comments+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.handoutmaster+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.notesmaster+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.notesslide+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.presentation": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["pptx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.presentation.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.presprops+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slide": { |
|
"source": "iana", |
|
"extensions": ["sldx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slide+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slidelayout+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slidemaster+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slideshow": { |
|
"source": "iana", |
|
"extensions": ["ppsx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slideshow.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.slideupdateinfo+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.tablestyles+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.tags+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.template": { |
|
"source": "apache", |
|
"extensions": ["potx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.template.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.presentationml.viewprops+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml-template": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.calcchain+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.chartsheet+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.comments+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.connections+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.dialogsheet+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.externallink+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotcachedefinition+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotcacherecords+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.pivottable+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.querytable+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.revisionheaders+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.revisionlog+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.sharedstrings+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["xlsx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.sheetmetadata+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.table+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.tablesinglecells+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.template": { |
|
"source": "apache", |
|
"extensions": ["xltx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.template.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.usernames+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.volatiledependencies+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.theme+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.themeoverride+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.vmldrawing": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml-template": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.comments+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.document": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["docx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.document.glossary+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.document.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.endnotes+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.fonttable+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.footer+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.footnotes+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.numbering+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.settings+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.styles+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.template": { |
|
"source": "apache", |
|
"extensions": ["dotx"] |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.template.main+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-officedocument.wordprocessingml.websettings+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-package.core-properties+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-package.digital-signature-xmlsignature+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.openxmlformats-package.relationships+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.oracle.resource+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.orange.indata": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.osa.netdeploy": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.osgeo.mapguide.package": { |
|
"source": "iana", |
|
"extensions": ["mgp"] |
|
}, |
|
"application/vnd.osgi.bundle": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.osgi.dp": { |
|
"source": "iana", |
|
"extensions": ["dp"] |
|
}, |
|
"application/vnd.osgi.subsystem": { |
|
"source": "iana", |
|
"extensions": ["esa"] |
|
}, |
|
"application/vnd.otps.ct-kip+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.palm": { |
|
"source": "iana", |
|
"extensions": ["pdb","pqa","oprc"] |
|
}, |
|
"application/vnd.panoply": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.paos+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.paos.xml": { |
|
"source": "apache" |
|
}, |
|
"application/vnd.pawaafile": { |
|
"source": "iana", |
|
"extensions": ["paw"] |
|
}, |
|
"application/vnd.pcos": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.pg.format": { |
|
"source": "iana", |
|
"extensions": ["str"] |
|
}, |
|
"application/vnd.pg.osasli": { |
|
"source": "iana", |
|
"extensions": ["ei6"] |
|
}, |
|
"application/vnd.piaccess.application-licence": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.picsel": { |
|
"source": "iana", |
|
"extensions": ["efif"] |
|
}, |
|
"application/vnd.pmi.widget": { |
|
"source": "iana", |
|
"extensions": ["wg"] |
|
}, |
|
"application/vnd.poc.group-advertisement+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.pocketlearn": { |
|
"source": "iana", |
|
"extensions": ["plf"] |
|
}, |
|
"application/vnd.powerbuilder6": { |
|
"source": "iana", |
|
"extensions": ["pbd"] |
|
}, |
|
"application/vnd.powerbuilder6-s": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.powerbuilder7": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.powerbuilder7-s": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.powerbuilder75": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.powerbuilder75-s": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.preminet": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.previewsystems.box": { |
|
"source": "iana", |
|
"extensions": ["box"] |
|
}, |
|
"application/vnd.proteus.magazine": { |
|
"source": "iana", |
|
"extensions": ["mgz"] |
|
}, |
|
"application/vnd.publishare-delta-tree": { |
|
"source": "iana", |
|
"extensions": ["qps"] |
|
}, |
|
"application/vnd.pvi.ptid1": { |
|
"source": "iana", |
|
"extensions": ["ptid"] |
|
}, |
|
"application/vnd.pwg-multiplexed": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.pwg-xhtml-print+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.qualcomm.brew-app-res": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.quark.quarkxpress": { |
|
"source": "iana", |
|
"extensions": ["qxd","qxt","qwd","qwt","qxl","qxb"] |
|
}, |
|
"application/vnd.quobject-quoxdocument": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.moml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-audit+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-audit-conf+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-audit-conn+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-audit-dialog+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-audit-stream+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-conf+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog-base+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog-fax-detect+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog-fax-sendrecv+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog-group+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog-speech+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.radisys.msml-dialog-transform+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.rainstor.data": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.rapid": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.realvnc.bed": { |
|
"source": "iana", |
|
"extensions": ["bed"] |
|
}, |
|
"application/vnd.recordare.musicxml": { |
|
"source": "iana", |
|
"extensions": ["mxl"] |
|
}, |
|
"application/vnd.recordare.musicxml+xml": { |
|
"source": "iana", |
|
"extensions": ["musicxml"] |
|
}, |
|
"application/vnd.renlearn.rlprint": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.rig.cryptonote": { |
|
"source": "iana", |
|
"extensions": ["cryptonote"] |
|
}, |
|
"application/vnd.rim.cod": { |
|
"source": "apache", |
|
"extensions": ["cod"] |
|
}, |
|
"application/vnd.rn-realmedia": { |
|
"source": "apache", |
|
"extensions": ["rm"] |
|
}, |
|
"application/vnd.rn-realmedia-vbr": { |
|
"source": "apache", |
|
"extensions": ["rmvb"] |
|
}, |
|
"application/vnd.route66.link66+xml": { |
|
"source": "iana", |
|
"extensions": ["link66"] |
|
}, |
|
"application/vnd.rs-274x": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ruckus.download": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.s3sms": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sailingtracker.track": { |
|
"source": "iana", |
|
"extensions": ["st"] |
|
}, |
|
"application/vnd.sbm.cid": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sbm.mid2": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.scribus": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.3df": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.csf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.doc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.eml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.mht": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.net": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.ppt": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.tiff": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealed.xls": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealedmedia.softseal.html": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sealedmedia.softseal.pdf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.seemail": { |
|
"source": "iana", |
|
"extensions": ["see"] |
|
}, |
|
"application/vnd.sema": { |
|
"source": "iana", |
|
"extensions": ["sema"] |
|
}, |
|
"application/vnd.semd": { |
|
"source": "iana", |
|
"extensions": ["semd"] |
|
}, |
|
"application/vnd.semf": { |
|
"source": "iana", |
|
"extensions": ["semf"] |
|
}, |
|
"application/vnd.shana.informed.formdata": { |
|
"source": "iana", |
|
"extensions": ["ifm"] |
|
}, |
|
"application/vnd.shana.informed.formtemplate": { |
|
"source": "iana", |
|
"extensions": ["itp"] |
|
}, |
|
"application/vnd.shana.informed.interchange": { |
|
"source": "iana", |
|
"extensions": ["iif"] |
|
}, |
|
"application/vnd.shana.informed.package": { |
|
"source": "iana", |
|
"extensions": ["ipk"] |
|
}, |
|
"application/vnd.simtech-mindmapper": { |
|
"source": "iana", |
|
"extensions": ["twd","twds"] |
|
}, |
|
"application/vnd.siren+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.smaf": { |
|
"source": "iana", |
|
"extensions": ["mmf"] |
|
}, |
|
"application/vnd.smart.notebook": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.smart.teacher": { |
|
"source": "iana", |
|
"extensions": ["teacher"] |
|
}, |
|
"application/vnd.software602.filler.form+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.software602.filler.form-xml-zip": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.solent.sdkm+xml": { |
|
"source": "iana", |
|
"extensions": ["sdkm","sdkd"] |
|
}, |
|
"application/vnd.spotfire.dxp": { |
|
"source": "iana", |
|
"extensions": ["dxp"] |
|
}, |
|
"application/vnd.spotfire.sfs": { |
|
"source": "iana", |
|
"extensions": ["sfs"] |
|
}, |
|
"application/vnd.sss-cod": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sss-dtf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sss-ntf": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.stardivision.calc": { |
|
"source": "apache", |
|
"extensions": ["sdc"] |
|
}, |
|
"application/vnd.stardivision.draw": { |
|
"source": "apache", |
|
"extensions": ["sda"] |
|
}, |
|
"application/vnd.stardivision.impress": { |
|
"source": "apache", |
|
"extensions": ["sdd"] |
|
}, |
|
"application/vnd.stardivision.math": { |
|
"source": "apache", |
|
"extensions": ["smf"] |
|
}, |
|
"application/vnd.stardivision.writer": { |
|
"source": "apache", |
|
"extensions": ["sdw","vor"] |
|
}, |
|
"application/vnd.stardivision.writer-global": { |
|
"source": "apache", |
|
"extensions": ["sgl"] |
|
}, |
|
"application/vnd.stepmania.package": { |
|
"source": "iana", |
|
"extensions": ["smzip"] |
|
}, |
|
"application/vnd.stepmania.stepchart": { |
|
"source": "iana", |
|
"extensions": ["sm"] |
|
}, |
|
"application/vnd.street-stream": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sun.wadl+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.sun.xml.calc": { |
|
"source": "apache", |
|
"extensions": ["sxc"] |
|
}, |
|
"application/vnd.sun.xml.calc.template": { |
|
"source": "apache", |
|
"extensions": ["stc"] |
|
}, |
|
"application/vnd.sun.xml.draw": { |
|
"source": "apache", |
|
"extensions": ["sxd"] |
|
}, |
|
"application/vnd.sun.xml.draw.template": { |
|
"source": "apache", |
|
"extensions": ["std"] |
|
}, |
|
"application/vnd.sun.xml.impress": { |
|
"source": "apache", |
|
"extensions": ["sxi"] |
|
}, |
|
"application/vnd.sun.xml.impress.template": { |
|
"source": "apache", |
|
"extensions": ["sti"] |
|
}, |
|
"application/vnd.sun.xml.math": { |
|
"source": "apache", |
|
"extensions": ["sxm"] |
|
}, |
|
"application/vnd.sun.xml.writer": { |
|
"source": "apache", |
|
"extensions": ["sxw"] |
|
}, |
|
"application/vnd.sun.xml.writer.global": { |
|
"source": "apache", |
|
"extensions": ["sxg"] |
|
}, |
|
"application/vnd.sun.xml.writer.template": { |
|
"source": "apache", |
|
"extensions": ["stw"] |
|
}, |
|
"application/vnd.sus-calendar": { |
|
"source": "iana", |
|
"extensions": ["sus","susp"] |
|
}, |
|
"application/vnd.svd": { |
|
"source": "iana", |
|
"extensions": ["svd"] |
|
}, |
|
"application/vnd.swiftview-ics": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.symbian.install": { |
|
"source": "apache", |
|
"extensions": ["sis","sisx"] |
|
}, |
|
"application/vnd.syncml+xml": { |
|
"source": "iana", |
|
"extensions": ["xsm"] |
|
}, |
|
"application/vnd.syncml.dm+wbxml": { |
|
"source": "iana", |
|
"extensions": ["bdm"] |
|
}, |
|
"application/vnd.syncml.dm+xml": { |
|
"source": "iana", |
|
"extensions": ["xdm"] |
|
}, |
|
"application/vnd.syncml.dm.notification": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.syncml.dmddf+wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.syncml.dmddf+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.syncml.dmtnds+wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.syncml.dmtnds+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.syncml.ds.notification": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.tao.intent-module-archive": { |
|
"source": "iana", |
|
"extensions": ["tao"] |
|
}, |
|
"application/vnd.tcpdump.pcap": { |
|
"source": "iana", |
|
"extensions": ["pcap","cap","dmp"] |
|
}, |
|
"application/vnd.tmd.mediaflex.api+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.tmobile-livetv": { |
|
"source": "iana", |
|
"extensions": ["tmo"] |
|
}, |
|
"application/vnd.trid.tpt": { |
|
"source": "iana", |
|
"extensions": ["tpt"] |
|
}, |
|
"application/vnd.triscape.mxs": { |
|
"source": "iana", |
|
"extensions": ["mxs"] |
|
}, |
|
"application/vnd.trueapp": { |
|
"source": "iana", |
|
"extensions": ["tra"] |
|
}, |
|
"application/vnd.truedoc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ubisoft.webplayer": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.ufdl": { |
|
"source": "iana", |
|
"extensions": ["ufd","ufdl"] |
|
}, |
|
"application/vnd.uiq.theme": { |
|
"source": "iana", |
|
"extensions": ["utz"] |
|
}, |
|
"application/vnd.umajin": { |
|
"source": "iana", |
|
"extensions": ["umj"] |
|
}, |
|
"application/vnd.unity": { |
|
"source": "iana", |
|
"extensions": ["unityweb"] |
|
}, |
|
"application/vnd.uoml+xml": { |
|
"source": "iana", |
|
"extensions": ["uoml"] |
|
}, |
|
"application/vnd.uplanet.alert": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.alert-wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.bearer-choice": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.bearer-choice-wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.cacheop": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.cacheop-wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.channel": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.channel-wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.list": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.list-wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.listcmd": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.listcmd-wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.uplanet.signal": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.valve.source.material": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.vcx": { |
|
"source": "iana", |
|
"extensions": ["vcx"] |
|
}, |
|
"application/vnd.vd-study": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.vectorworks": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.verimatrix.vcas": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.vidsoft.vidconference": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.visio": { |
|
"source": "iana", |
|
"extensions": ["vsd","vst","vss","vsw"] |
|
}, |
|
"application/vnd.visionary": { |
|
"source": "iana", |
|
"extensions": ["vis"] |
|
}, |
|
"application/vnd.vividence.scriptfile": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.vsf": { |
|
"source": "iana", |
|
"extensions": ["vsf"] |
|
}, |
|
"application/vnd.wap.sic": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wap.slc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wap.wbxml": { |
|
"source": "iana", |
|
"extensions": ["wbxml"] |
|
}, |
|
"application/vnd.wap.wmlc": { |
|
"source": "iana", |
|
"extensions": ["wmlc"] |
|
}, |
|
"application/vnd.wap.wmlscriptc": { |
|
"source": "iana", |
|
"extensions": ["wmlsc"] |
|
}, |
|
"application/vnd.webturbo": { |
|
"source": "iana", |
|
"extensions": ["wtb"] |
|
}, |
|
"application/vnd.wfa.p2p": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wfa.wsc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.windows.devicepairing": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wmc": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wmf.bootstrap": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wolfram.mathematica": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wolfram.mathematica.package": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wolfram.player": { |
|
"source": "iana", |
|
"extensions": ["nbp"] |
|
}, |
|
"application/vnd.wordperfect": { |
|
"source": "iana", |
|
"extensions": ["wpd"] |
|
}, |
|
"application/vnd.wqd": { |
|
"source": "iana", |
|
"extensions": ["wqd"] |
|
}, |
|
"application/vnd.wrq-hp3000-labelled": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wt.stf": { |
|
"source": "iana", |
|
"extensions": ["stf"] |
|
}, |
|
"application/vnd.wv.csp+wbxml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wv.csp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.wv.ssp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xacml+json": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/vnd.xara": { |
|
"source": "iana", |
|
"extensions": ["xar"] |
|
}, |
|
"application/vnd.xfdl": { |
|
"source": "iana", |
|
"extensions": ["xfdl"] |
|
}, |
|
"application/vnd.xfdl.webform": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xmi+xml": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xmpie.cpkg": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xmpie.dpkg": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xmpie.plan": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xmpie.ppkg": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.xmpie.xlim": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.yamaha.hv-dic": { |
|
"source": "iana", |
|
"extensions": ["hvd"] |
|
}, |
|
"application/vnd.yamaha.hv-script": { |
|
"source": "iana", |
|
"extensions": ["hvs"] |
|
}, |
|
"application/vnd.yamaha.hv-voice": { |
|
"source": "iana", |
|
"extensions": ["hvp"] |
|
}, |
|
"application/vnd.yamaha.openscoreformat": { |
|
"source": "iana", |
|
"extensions": ["osf"] |
|
}, |
|
"application/vnd.yamaha.openscoreformat.osfpvg+xml": { |
|
"source": "iana", |
|
"extensions": ["osfpvg"] |
|
}, |
|
"application/vnd.yamaha.remote-setup": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.yamaha.smaf-audio": { |
|
"source": "iana", |
|
"extensions": ["saf"] |
|
}, |
|
"application/vnd.yamaha.smaf-phrase": { |
|
"source": "iana", |
|
"extensions": ["spf"] |
|
}, |
|
"application/vnd.yamaha.through-ngn": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.yamaha.tunnel-udpencap": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.yaoweme": { |
|
"source": "iana" |
|
}, |
|
"application/vnd.yellowriver-custom-menu": { |
|
"source": "iana", |
|
"extensions": ["cmp"] |
|
}, |
|
"application/vnd.zul": { |
|
"source": "iana", |
|
"extensions": ["zir","zirz"] |
|
}, |
|
"application/vnd.zzazz.deck+xml": { |
|
"source": "iana", |
|
"extensions": ["zaz"] |
|
}, |
|
"application/voicexml+xml": { |
|
"source": "iana", |
|
"extensions": ["vxml"] |
|
}, |
|
"application/vq-rtcpxr": { |
|
"source": "iana" |
|
}, |
|
"application/watcherinfo+xml": { |
|
"source": "iana" |
|
}, |
|
"application/whoispp-query": { |
|
"source": "iana" |
|
}, |
|
"application/whoispp-response": { |
|
"source": "iana" |
|
}, |
|
"application/widget": { |
|
"source": "iana", |
|
"extensions": ["wgt"] |
|
}, |
|
"application/winhlp": { |
|
"source": "apache", |
|
"extensions": ["hlp"] |
|
}, |
|
"application/wita": { |
|
"source": "iana" |
|
}, |
|
"application/wordperfect5.1": { |
|
"source": "iana" |
|
}, |
|
"application/wsdl+xml": { |
|
"source": "iana", |
|
"extensions": ["wsdl"] |
|
}, |
|
"application/wspolicy+xml": { |
|
"source": "iana", |
|
"extensions": ["wspolicy"] |
|
}, |
|
"application/x-7z-compressed": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["7z"] |
|
}, |
|
"application/x-abiword": { |
|
"source": "apache", |
|
"extensions": ["abw"] |
|
}, |
|
"application/x-ace-compressed": { |
|
"source": "apache", |
|
"extensions": ["ace"] |
|
}, |
|
"application/x-amf": { |
|
"source": "apache" |
|
}, |
|
"application/x-apple-diskimage": { |
|
"source": "apache", |
|
"extensions": ["dmg"] |
|
}, |
|
"application/x-authorware-bin": { |
|
"source": "apache", |
|
"extensions": ["aab","x32","u32","vox"] |
|
}, |
|
"application/x-authorware-map": { |
|
"source": "apache", |
|
"extensions": ["aam"] |
|
}, |
|
"application/x-authorware-seg": { |
|
"source": "apache", |
|
"extensions": ["aas"] |
|
}, |
|
"application/x-bcpio": { |
|
"source": "apache", |
|
"extensions": ["bcpio"] |
|
}, |
|
"application/x-bittorrent": { |
|
"source": "apache", |
|
"extensions": ["torrent"] |
|
}, |
|
"application/x-blorb": { |
|
"source": "apache", |
|
"extensions": ["blb","blorb"] |
|
}, |
|
"application/x-bzip": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["bz"] |
|
}, |
|
"application/x-bzip2": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["bz2","boz"] |
|
}, |
|
"application/x-cbr": { |
|
"source": "apache", |
|
"extensions": ["cbr","cba","cbt","cbz","cb7"] |
|
}, |
|
"application/x-cdlink": { |
|
"source": "apache", |
|
"extensions": ["vcd"] |
|
}, |
|
"application/x-cfs-compressed": { |
|
"source": "apache", |
|
"extensions": ["cfs"] |
|
}, |
|
"application/x-chat": { |
|
"source": "apache", |
|
"extensions": ["chat"] |
|
}, |
|
"application/x-chess-pgn": { |
|
"source": "apache", |
|
"extensions": ["pgn"] |
|
}, |
|
"application/x-chrome-extension": { |
|
"extensions": ["crx"] |
|
}, |
|
"application/x-compress": { |
|
"source": "apache" |
|
}, |
|
"application/x-conference": { |
|
"source": "apache", |
|
"extensions": ["nsc"] |
|
}, |
|
"application/x-cpio": { |
|
"source": "apache", |
|
"extensions": ["cpio"] |
|
}, |
|
"application/x-csh": { |
|
"source": "apache", |
|
"extensions": ["csh"] |
|
}, |
|
"application/x-deb": { |
|
"compressible": false |
|
}, |
|
"application/x-debian-package": { |
|
"source": "apache", |
|
"extensions": ["deb","udeb"] |
|
}, |
|
"application/x-dgc-compressed": { |
|
"source": "apache", |
|
"extensions": ["dgc"] |
|
}, |
|
"application/x-director": { |
|
"source": "apache", |
|
"extensions": ["dir","dcr","dxr","cst","cct","cxt","w3d","fgd","swa"] |
|
}, |
|
"application/x-doom": { |
|
"source": "apache", |
|
"extensions": ["wad"] |
|
}, |
|
"application/x-dtbncx+xml": { |
|
"source": "apache", |
|
"extensions": ["ncx"] |
|
}, |
|
"application/x-dtbook+xml": { |
|
"source": "apache", |
|
"extensions": ["dtb"] |
|
}, |
|
"application/x-dtbresource+xml": { |
|
"source": "apache", |
|
"extensions": ["res"] |
|
}, |
|
"application/x-dvi": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["dvi"] |
|
}, |
|
"application/x-envoy": { |
|
"source": "apache", |
|
"extensions": ["evy"] |
|
}, |
|
"application/x-eva": { |
|
"source": "apache", |
|
"extensions": ["eva"] |
|
}, |
|
"application/x-font-bdf": { |
|
"source": "apache", |
|
"extensions": ["bdf"] |
|
}, |
|
"application/x-font-dos": { |
|
"source": "apache" |
|
}, |
|
"application/x-font-framemaker": { |
|
"source": "apache" |
|
}, |
|
"application/x-font-ghostscript": { |
|
"source": "apache", |
|
"extensions": ["gsf"] |
|
}, |
|
"application/x-font-libgrx": { |
|
"source": "apache" |
|
}, |
|
"application/x-font-linux-psf": { |
|
"source": "apache", |
|
"extensions": ["psf"] |
|
}, |
|
"application/x-font-otf": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["otf"] |
|
}, |
|
"application/x-font-pcf": { |
|
"source": "apache", |
|
"extensions": ["pcf"] |
|
}, |
|
"application/x-font-snf": { |
|
"source": "apache", |
|
"extensions": ["snf"] |
|
}, |
|
"application/x-font-speedo": { |
|
"source": "apache" |
|
}, |
|
"application/x-font-sunos-news": { |
|
"source": "apache" |
|
}, |
|
"application/x-font-ttf": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["ttf","ttc"] |
|
}, |
|
"application/x-font-type1": { |
|
"source": "apache", |
|
"extensions": ["pfa","pfb","pfm","afm"] |
|
}, |
|
"application/x-font-vfont": { |
|
"source": "apache" |
|
}, |
|
"application/x-freearc": { |
|
"source": "apache", |
|
"extensions": ["arc"] |
|
}, |
|
"application/x-futuresplash": { |
|
"source": "apache", |
|
"extensions": ["spl"] |
|
}, |
|
"application/x-gca-compressed": { |
|
"source": "apache", |
|
"extensions": ["gca"] |
|
}, |
|
"application/x-glulx": { |
|
"source": "apache", |
|
"extensions": ["ulx"] |
|
}, |
|
"application/x-gnumeric": { |
|
"source": "apache", |
|
"extensions": ["gnumeric"] |
|
}, |
|
"application/x-gramps-xml": { |
|
"source": "apache", |
|
"extensions": ["gramps"] |
|
}, |
|
"application/x-gtar": { |
|
"source": "apache", |
|
"extensions": ["gtar"] |
|
}, |
|
"application/x-gzip": { |
|
"source": "apache" |
|
}, |
|
"application/x-hdf": { |
|
"source": "apache", |
|
"extensions": ["hdf"] |
|
}, |
|
"application/x-install-instructions": { |
|
"source": "apache", |
|
"extensions": ["install"] |
|
}, |
|
"application/x-iso9660-image": { |
|
"source": "apache", |
|
"extensions": ["iso"] |
|
}, |
|
"application/x-java-jnlp-file": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["jnlp"] |
|
}, |
|
"application/x-javascript": { |
|
"compressible": true |
|
}, |
|
"application/x-latex": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["latex"] |
|
}, |
|
"application/x-lua-bytecode": { |
|
"extensions": ["luac"] |
|
}, |
|
"application/x-lzh-compressed": { |
|
"source": "apache", |
|
"extensions": ["lzh","lha"] |
|
}, |
|
"application/x-mie": { |
|
"source": "apache", |
|
"extensions": ["mie"] |
|
}, |
|
"application/x-mobipocket-ebook": { |
|
"source": "apache", |
|
"extensions": ["prc","mobi"] |
|
}, |
|
"application/x-mpegurl": { |
|
"compressible": false |
|
}, |
|
"application/x-ms-application": { |
|
"source": "apache", |
|
"extensions": ["application"] |
|
}, |
|
"application/x-ms-shortcut": { |
|
"source": "apache", |
|
"extensions": ["lnk"] |
|
}, |
|
"application/x-ms-wmd": { |
|
"source": "apache", |
|
"extensions": ["wmd"] |
|
}, |
|
"application/x-ms-wmz": { |
|
"source": "apache", |
|
"extensions": ["wmz"] |
|
}, |
|
"application/x-ms-xbap": { |
|
"source": "apache", |
|
"extensions": ["xbap"] |
|
}, |
|
"application/x-msaccess": { |
|
"source": "apache", |
|
"extensions": ["mdb"] |
|
}, |
|
"application/x-msbinder": { |
|
"source": "apache", |
|
"extensions": ["obd"] |
|
}, |
|
"application/x-mscardfile": { |
|
"source": "apache", |
|
"extensions": ["crd"] |
|
}, |
|
"application/x-msclip": { |
|
"source": "apache", |
|
"extensions": ["clp"] |
|
}, |
|
"application/x-msdownload": { |
|
"source": "apache", |
|
"extensions": ["exe","dll","com","bat","msi"] |
|
}, |
|
"application/x-msmediaview": { |
|
"source": "apache", |
|
"extensions": ["mvb","m13","m14"] |
|
}, |
|
"application/x-msmetafile": { |
|
"source": "apache", |
|
"extensions": ["wmf","wmz","emf","emz"] |
|
}, |
|
"application/x-msmoney": { |
|
"source": "apache", |
|
"extensions": ["mny"] |
|
}, |
|
"application/x-mspublisher": { |
|
"source": "apache", |
|
"extensions": ["pub"] |
|
}, |
|
"application/x-msschedule": { |
|
"source": "apache", |
|
"extensions": ["scd"] |
|
}, |
|
"application/x-msterminal": { |
|
"source": "apache", |
|
"extensions": ["trm"] |
|
}, |
|
"application/x-mswrite": { |
|
"source": "apache", |
|
"extensions": ["wri"] |
|
}, |
|
"application/x-netcdf": { |
|
"source": "apache", |
|
"extensions": ["nc","cdf"] |
|
}, |
|
"application/x-nzb": { |
|
"source": "apache", |
|
"extensions": ["nzb"] |
|
}, |
|
"application/x-pkcs12": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["p12","pfx"] |
|
}, |
|
"application/x-pkcs7-certificates": { |
|
"source": "apache", |
|
"extensions": ["p7b","spc"] |
|
}, |
|
"application/x-pkcs7-certreqresp": { |
|
"source": "apache", |
|
"extensions": ["p7r"] |
|
}, |
|
"application/x-rar-compressed": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["rar"] |
|
}, |
|
"application/x-research-info-systems": { |
|
"source": "apache", |
|
"extensions": ["ris"] |
|
}, |
|
"application/x-sh": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["sh"] |
|
}, |
|
"application/x-shar": { |
|
"source": "apache", |
|
"extensions": ["shar"] |
|
}, |
|
"application/x-shockwave-flash": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["swf"] |
|
}, |
|
"application/x-silverlight-app": { |
|
"source": "apache", |
|
"extensions": ["xap"] |
|
}, |
|
"application/x-sql": { |
|
"source": "apache", |
|
"extensions": ["sql"] |
|
}, |
|
"application/x-stuffit": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["sit"] |
|
}, |
|
"application/x-stuffitx": { |
|
"source": "apache", |
|
"extensions": ["sitx"] |
|
}, |
|
"application/x-subrip": { |
|
"source": "apache", |
|
"extensions": ["srt"] |
|
}, |
|
"application/x-sv4cpio": { |
|
"source": "apache", |
|
"extensions": ["sv4cpio"] |
|
}, |
|
"application/x-sv4crc": { |
|
"source": "apache", |
|
"extensions": ["sv4crc"] |
|
}, |
|
"application/x-t3vm-image": { |
|
"source": "apache", |
|
"extensions": ["t3"] |
|
}, |
|
"application/x-tads": { |
|
"source": "apache", |
|
"extensions": ["gam"] |
|
}, |
|
"application/x-tar": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["tar"] |
|
}, |
|
"application/x-tcl": { |
|
"source": "apache", |
|
"extensions": ["tcl"] |
|
}, |
|
"application/x-tex": { |
|
"source": "apache", |
|
"extensions": ["tex"] |
|
}, |
|
"application/x-tex-tfm": { |
|
"source": "apache", |
|
"extensions": ["tfm"] |
|
}, |
|
"application/x-texinfo": { |
|
"source": "apache", |
|
"extensions": ["texinfo","texi"] |
|
}, |
|
"application/x-tgif": { |
|
"source": "apache", |
|
"extensions": ["obj"] |
|
}, |
|
"application/x-ustar": { |
|
"source": "apache", |
|
"extensions": ["ustar"] |
|
}, |
|
"application/x-wais-source": { |
|
"source": "apache", |
|
"extensions": ["src"] |
|
}, |
|
"application/x-web-app-manifest+json": { |
|
"compressible": true, |
|
"extensions": ["webapp"] |
|
}, |
|
"application/x-www-form-urlencoded": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"application/x-x509-ca-cert": { |
|
"source": "apache", |
|
"extensions": ["der","crt"] |
|
}, |
|
"application/x-xfig": { |
|
"source": "apache", |
|
"extensions": ["fig"] |
|
}, |
|
"application/x-xliff+xml": { |
|
"source": "apache", |
|
"extensions": ["xlf"] |
|
}, |
|
"application/x-xpinstall": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["xpi"] |
|
}, |
|
"application/x-xz": { |
|
"source": "apache", |
|
"extensions": ["xz"] |
|
}, |
|
"application/x-zmachine": { |
|
"source": "apache", |
|
"extensions": ["z1","z2","z3","z4","z5","z6","z7","z8"] |
|
}, |
|
"application/x400-bp": { |
|
"source": "iana" |
|
}, |
|
"application/xacml+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xaml+xml": { |
|
"source": "apache", |
|
"extensions": ["xaml"] |
|
}, |
|
"application/xcap-att+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xcap-caps+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xcap-diff+xml": { |
|
"source": "iana", |
|
"extensions": ["xdf"] |
|
}, |
|
"application/xcap-el+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xcap-error+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xcap-ns+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xcon-conference-info+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xcon-conference-info-diff+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xenc+xml": { |
|
"source": "iana", |
|
"extensions": ["xenc"] |
|
}, |
|
"application/xhtml+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["xhtml","xht"] |
|
}, |
|
"application/xhtml-voice+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["xml","xsl","xsd"] |
|
}, |
|
"application/xml-dtd": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["dtd"] |
|
}, |
|
"application/xml-external-parsed-entity": { |
|
"source": "iana" |
|
}, |
|
"application/xml-patch+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xmpp+xml": { |
|
"source": "iana" |
|
}, |
|
"application/xop+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["xop"] |
|
}, |
|
"application/xproc+xml": { |
|
"source": "apache", |
|
"extensions": ["xpl"] |
|
}, |
|
"application/xslt+xml": { |
|
"source": "iana", |
|
"extensions": ["xslt"] |
|
}, |
|
"application/xspf+xml": { |
|
"source": "apache", |
|
"extensions": ["xspf"] |
|
}, |
|
"application/xv+xml": { |
|
"source": "iana", |
|
"extensions": ["mxml","xhvml","xvml","xvm"] |
|
}, |
|
"application/yang": { |
|
"source": "iana", |
|
"extensions": ["yang"] |
|
}, |
|
"application/yin+xml": { |
|
"source": "iana", |
|
"extensions": ["yin"] |
|
}, |
|
"application/zip": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["zip"] |
|
}, |
|
"application/zlib": { |
|
"source": "iana" |
|
}, |
|
"audio/1d-interleaved-parityfec": { |
|
"source": "iana" |
|
}, |
|
"audio/32kadpcm": { |
|
"source": "iana" |
|
}, |
|
"audio/3gpp": { |
|
"source": "iana" |
|
}, |
|
"audio/3gpp2": { |
|
"source": "iana" |
|
}, |
|
"audio/ac3": { |
|
"source": "iana" |
|
}, |
|
"audio/adpcm": { |
|
"source": "apache", |
|
"extensions": ["adp"] |
|
}, |
|
"audio/amr": { |
|
"source": "iana" |
|
}, |
|
"audio/amr-wb": { |
|
"source": "iana" |
|
}, |
|
"audio/amr-wb+": { |
|
"source": "iana" |
|
}, |
|
"audio/aptx": { |
|
"source": "iana" |
|
}, |
|
"audio/asc": { |
|
"source": "iana" |
|
}, |
|
"audio/atrac-advanced-lossless": { |
|
"source": "iana" |
|
}, |
|
"audio/atrac-x": { |
|
"source": "iana" |
|
}, |
|
"audio/atrac3": { |
|
"source": "iana" |
|
}, |
|
"audio/basic": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["au","snd"] |
|
}, |
|
"audio/bv16": { |
|
"source": "iana" |
|
}, |
|
"audio/bv32": { |
|
"source": "iana" |
|
}, |
|
"audio/clearmode": { |
|
"source": "iana" |
|
}, |
|
"audio/cn": { |
|
"source": "iana" |
|
}, |
|
"audio/dat12": { |
|
"source": "iana" |
|
}, |
|
"audio/dls": { |
|
"source": "iana" |
|
}, |
|
"audio/dsr-es201108": { |
|
"source": "iana" |
|
}, |
|
"audio/dsr-es202050": { |
|
"source": "iana" |
|
}, |
|
"audio/dsr-es202211": { |
|
"source": "iana" |
|
}, |
|
"audio/dsr-es202212": { |
|
"source": "iana" |
|
}, |
|
"audio/dv": { |
|
"source": "iana" |
|
}, |
|
"audio/dvi4": { |
|
"source": "iana" |
|
}, |
|
"audio/eac3": { |
|
"source": "iana" |
|
}, |
|
"audio/encaprtp": { |
|
"source": "iana" |
|
}, |
|
"audio/evrc": { |
|
"source": "iana" |
|
}, |
|
"audio/evrc-qcp": { |
|
"source": "iana" |
|
}, |
|
"audio/evrc0": { |
|
"source": "iana" |
|
}, |
|
"audio/evrc1": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcb": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcb0": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcb1": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcnw": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcnw0": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcnw1": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcwb": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcwb0": { |
|
"source": "iana" |
|
}, |
|
"audio/evrcwb1": { |
|
"source": "iana" |
|
}, |
|
"audio/fwdred": { |
|
"source": "iana" |
|
}, |
|
"audio/g719": { |
|
"source": "iana" |
|
}, |
|
"audio/g722": { |
|
"source": "iana" |
|
}, |
|
"audio/g7221": { |
|
"source": "iana" |
|
}, |
|
"audio/g723": { |
|
"source": "iana" |
|
}, |
|
"audio/g726-16": { |
|
"source": "iana" |
|
}, |
|
"audio/g726-24": { |
|
"source": "iana" |
|
}, |
|
"audio/g726-32": { |
|
"source": "iana" |
|
}, |
|
"audio/g726-40": { |
|
"source": "iana" |
|
}, |
|
"audio/g728": { |
|
"source": "iana" |
|
}, |
|
"audio/g729": { |
|
"source": "iana" |
|
}, |
|
"audio/g7291": { |
|
"source": "iana" |
|
}, |
|
"audio/g729d": { |
|
"source": "iana" |
|
}, |
|
"audio/g729e": { |
|
"source": "iana" |
|
}, |
|
"audio/gsm": { |
|
"source": "iana" |
|
}, |
|
"audio/gsm-efr": { |
|
"source": "iana" |
|
}, |
|
"audio/gsm-hr-08": { |
|
"source": "iana" |
|
}, |
|
"audio/ilbc": { |
|
"source": "iana" |
|
}, |
|
"audio/ip-mr_v2.5": { |
|
"source": "iana" |
|
}, |
|
"audio/isac": { |
|
"source": "apache" |
|
}, |
|
"audio/l16": { |
|
"source": "iana" |
|
}, |
|
"audio/l20": { |
|
"source": "iana" |
|
}, |
|
"audio/l24": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"audio/l8": { |
|
"source": "iana" |
|
}, |
|
"audio/lpc": { |
|
"source": "iana" |
|
}, |
|
"audio/midi": { |
|
"source": "apache", |
|
"extensions": ["mid","midi","kar","rmi"] |
|
}, |
|
"audio/mobile-xmf": { |
|
"source": "iana" |
|
}, |
|
"audio/mp4": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["mp4a","m4a"] |
|
}, |
|
"audio/mp4a-latm": { |
|
"source": "iana" |
|
}, |
|
"audio/mpa": { |
|
"source": "iana" |
|
}, |
|
"audio/mpa-robust": { |
|
"source": "iana" |
|
}, |
|
"audio/mpeg": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["mpga","mp2","mp2a","mp3","m2a","m3a"] |
|
}, |
|
"audio/mpeg4-generic": { |
|
"source": "iana" |
|
}, |
|
"audio/musepack": { |
|
"source": "apache" |
|
}, |
|
"audio/ogg": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["oga","ogg","spx"] |
|
}, |
|
"audio/opus": { |
|
"source": "apache" |
|
}, |
|
"audio/parityfec": { |
|
"source": "iana" |
|
}, |
|
"audio/pcma": { |
|
"source": "iana" |
|
}, |
|
"audio/pcma-wb": { |
|
"source": "iana" |
|
}, |
|
"audio/pcmu": { |
|
"source": "iana" |
|
}, |
|
"audio/pcmu-wb": { |
|
"source": "iana" |
|
}, |
|
"audio/prs.sid": { |
|
"source": "iana" |
|
}, |
|
"audio/qcelp": { |
|
"source": "iana" |
|
}, |
|
"audio/raptorfec": { |
|
"source": "iana" |
|
}, |
|
"audio/red": { |
|
"source": "iana" |
|
}, |
|
"audio/rtp-enc-aescm128": { |
|
"source": "iana" |
|
}, |
|
"audio/rtp-midi": { |
|
"source": "iana" |
|
}, |
|
"audio/rtploopback": { |
|
"source": "iana" |
|
}, |
|
"audio/rtx": { |
|
"source": "iana" |
|
}, |
|
"audio/s3m": { |
|
"source": "apache", |
|
"extensions": ["s3m"] |
|
}, |
|
"audio/silk": { |
|
"source": "apache", |
|
"extensions": ["sil"] |
|
}, |
|
"audio/smv": { |
|
"source": "iana" |
|
}, |
|
"audio/smv-qcp": { |
|
"source": "iana" |
|
}, |
|
"audio/smv0": { |
|
"source": "iana" |
|
}, |
|
"audio/sp-midi": { |
|
"source": "iana" |
|
}, |
|
"audio/speex": { |
|
"source": "iana" |
|
}, |
|
"audio/t140c": { |
|
"source": "iana" |
|
}, |
|
"audio/t38": { |
|
"source": "iana" |
|
}, |
|
"audio/telephone-event": { |
|
"source": "iana" |
|
}, |
|
"audio/tone": { |
|
"source": "iana" |
|
}, |
|
"audio/uemclip": { |
|
"source": "iana" |
|
}, |
|
"audio/ulpfec": { |
|
"source": "iana" |
|
}, |
|
"audio/vdvi": { |
|
"source": "iana" |
|
}, |
|
"audio/vmr-wb": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.3gpp.iufp": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.4sb": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.audiokoz": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.celp": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.cisco.nse": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.cmles.radio-events": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.cns.anp1": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.cns.inf1": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dece.audio": { |
|
"source": "iana", |
|
"extensions": ["uva","uvva"] |
|
}, |
|
"audio/vnd.digital-winds": { |
|
"source": "iana", |
|
"extensions": ["eol"] |
|
}, |
|
"audio/vnd.dlna.adts": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.heaac.1": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.heaac.2": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.mlp": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.mps": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.pl2": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.pl2x": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.pl2z": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dolby.pulse.1": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.dra": { |
|
"source": "iana", |
|
"extensions": ["dra"] |
|
}, |
|
"audio/vnd.dts": { |
|
"source": "iana", |
|
"extensions": ["dts"] |
|
}, |
|
"audio/vnd.dts.hd": { |
|
"source": "iana", |
|
"extensions": ["dtshd"] |
|
}, |
|
"audio/vnd.dvb.file": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.everad.plj": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.hns.audio": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.lucent.voice": { |
|
"source": "iana", |
|
"extensions": ["lvp"] |
|
}, |
|
"audio/vnd.ms-playready.media.pya": { |
|
"source": "iana", |
|
"extensions": ["pya"] |
|
}, |
|
"audio/vnd.nokia.mobile-xmf": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.nortel.vbk": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.nuera.ecelp4800": { |
|
"source": "iana", |
|
"extensions": ["ecelp4800"] |
|
}, |
|
"audio/vnd.nuera.ecelp7470": { |
|
"source": "iana", |
|
"extensions": ["ecelp7470"] |
|
}, |
|
"audio/vnd.nuera.ecelp9600": { |
|
"source": "iana", |
|
"extensions": ["ecelp9600"] |
|
}, |
|
"audio/vnd.octel.sbc": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.qcelp": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.rhetorex.32kadpcm": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.rip": { |
|
"source": "iana", |
|
"extensions": ["rip"] |
|
}, |
|
"audio/vnd.rn-realaudio": { |
|
"compressible": false |
|
}, |
|
"audio/vnd.sealedmedia.softseal.mpeg": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.vmx.cvsd": { |
|
"source": "iana" |
|
}, |
|
"audio/vnd.wave": { |
|
"compressible": false |
|
}, |
|
"audio/vorbis": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"audio/vorbis-config": { |
|
"source": "iana" |
|
}, |
|
"audio/webm": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["weba"] |
|
}, |
|
"audio/x-aac": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["aac"] |
|
}, |
|
"audio/x-aiff": { |
|
"source": "apache", |
|
"extensions": ["aif","aiff","aifc"] |
|
}, |
|
"audio/x-caf": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["caf"] |
|
}, |
|
"audio/x-flac": { |
|
"source": "apache", |
|
"extensions": ["flac"] |
|
}, |
|
"audio/x-matroska": { |
|
"source": "apache", |
|
"extensions": ["mka"] |
|
}, |
|
"audio/x-mpegurl": { |
|
"source": "apache", |
|
"extensions": ["m3u"] |
|
}, |
|
"audio/x-ms-wax": { |
|
"source": "apache", |
|
"extensions": ["wax"] |
|
}, |
|
"audio/x-ms-wma": { |
|
"source": "apache", |
|
"extensions": ["wma"] |
|
}, |
|
"audio/x-pn-realaudio": { |
|
"source": "apache", |
|
"extensions": ["ram","ra"] |
|
}, |
|
"audio/x-pn-realaudio-plugin": { |
|
"source": "apache", |
|
"extensions": ["rmp"] |
|
}, |
|
"audio/x-tta": { |
|
"source": "apache" |
|
}, |
|
"audio/x-wav": { |
|
"source": "apache", |
|
"extensions": ["wav"] |
|
}, |
|
"audio/xm": { |
|
"source": "apache", |
|
"extensions": ["xm"] |
|
}, |
|
"chemical/x-cdx": { |
|
"source": "apache", |
|
"extensions": ["cdx"] |
|
}, |
|
"chemical/x-cif": { |
|
"source": "apache", |
|
"extensions": ["cif"] |
|
}, |
|
"chemical/x-cmdf": { |
|
"source": "apache", |
|
"extensions": ["cmdf"] |
|
}, |
|
"chemical/x-cml": { |
|
"source": "apache", |
|
"extensions": ["cml"] |
|
}, |
|
"chemical/x-csml": { |
|
"source": "apache", |
|
"extensions": ["csml"] |
|
}, |
|
"chemical/x-pdb": { |
|
"source": "apache" |
|
}, |
|
"chemical/x-xyz": { |
|
"source": "apache", |
|
"extensions": ["xyz"] |
|
}, |
|
"font/opentype": { |
|
"compressible": true, |
|
"extensions": ["otf"] |
|
}, |
|
"image/bmp": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["bmp"] |
|
}, |
|
"image/cgm": { |
|
"source": "iana", |
|
"extensions": ["cgm"] |
|
}, |
|
"image/fits": { |
|
"source": "iana" |
|
}, |
|
"image/g3fax": { |
|
"source": "iana", |
|
"extensions": ["g3"] |
|
}, |
|
"image/gif": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["gif"] |
|
}, |
|
"image/ief": { |
|
"source": "iana", |
|
"extensions": ["ief"] |
|
}, |
|
"image/jp2": { |
|
"source": "iana" |
|
}, |
|
"image/jpeg": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["jpeg","jpg","jpe"] |
|
}, |
|
"image/jpm": { |
|
"source": "iana" |
|
}, |
|
"image/jpx": { |
|
"source": "iana" |
|
}, |
|
"image/ktx": { |
|
"source": "iana", |
|
"extensions": ["ktx"] |
|
}, |
|
"image/naplps": { |
|
"source": "iana" |
|
}, |
|
"image/pjpeg": { |
|
"compressible": false |
|
}, |
|
"image/png": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["png"] |
|
}, |
|
"image/prs.btif": { |
|
"source": "iana", |
|
"extensions": ["btif"] |
|
}, |
|
"image/prs.pti": { |
|
"source": "iana" |
|
}, |
|
"image/pwg-raster": { |
|
"source": "iana" |
|
}, |
|
"image/sgi": { |
|
"source": "apache", |
|
"extensions": ["sgi"] |
|
}, |
|
"image/svg+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["svg","svgz"] |
|
}, |
|
"image/t38": { |
|
"source": "iana" |
|
}, |
|
"image/tiff": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["tiff","tif"] |
|
}, |
|
"image/tiff-fx": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.adobe.photoshop": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["psd"] |
|
}, |
|
"image/vnd.airzip.accelerator.azv": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.cns.inf2": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.dece.graphic": { |
|
"source": "iana", |
|
"extensions": ["uvi","uvvi","uvg","uvvg"] |
|
}, |
|
"image/vnd.djvu": { |
|
"source": "iana", |
|
"extensions": ["djvu","djv"] |
|
}, |
|
"image/vnd.dvb.subtitle": { |
|
"source": "iana", |
|
"extensions": ["sub"] |
|
}, |
|
"image/vnd.dwg": { |
|
"source": "iana", |
|
"extensions": ["dwg"] |
|
}, |
|
"image/vnd.dxf": { |
|
"source": "iana", |
|
"extensions": ["dxf"] |
|
}, |
|
"image/vnd.fastbidsheet": { |
|
"source": "iana", |
|
"extensions": ["fbs"] |
|
}, |
|
"image/vnd.fpx": { |
|
"source": "iana", |
|
"extensions": ["fpx"] |
|
}, |
|
"image/vnd.fst": { |
|
"source": "iana", |
|
"extensions": ["fst"] |
|
}, |
|
"image/vnd.fujixerox.edmics-mmr": { |
|
"source": "iana", |
|
"extensions": ["mmr"] |
|
}, |
|
"image/vnd.fujixerox.edmics-rlc": { |
|
"source": "iana", |
|
"extensions": ["rlc"] |
|
}, |
|
"image/vnd.globalgraphics.pgb": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.microsoft.icon": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.mix": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.ms-modi": { |
|
"source": "iana", |
|
"extensions": ["mdi"] |
|
}, |
|
"image/vnd.ms-photo": { |
|
"source": "apache", |
|
"extensions": ["wdp"] |
|
}, |
|
"image/vnd.net-fpx": { |
|
"source": "iana", |
|
"extensions": ["npx"] |
|
}, |
|
"image/vnd.radiance": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.sealed.png": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.sealedmedia.softseal.gif": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.sealedmedia.softseal.jpg": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.svf": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.tencent.tap": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.valve.source.texture": { |
|
"source": "iana" |
|
}, |
|
"image/vnd.wap.wbmp": { |
|
"source": "iana", |
|
"extensions": ["wbmp"] |
|
}, |
|
"image/vnd.xiff": { |
|
"source": "iana", |
|
"extensions": ["xif"] |
|
}, |
|
"image/webp": { |
|
"source": "apache", |
|
"extensions": ["webp"] |
|
}, |
|
"image/x-3ds": { |
|
"source": "apache", |
|
"extensions": ["3ds"] |
|
}, |
|
"image/x-cmu-raster": { |
|
"source": "apache", |
|
"extensions": ["ras"] |
|
}, |
|
"image/x-cmx": { |
|
"source": "apache", |
|
"extensions": ["cmx"] |
|
}, |
|
"image/x-freehand": { |
|
"source": "apache", |
|
"extensions": ["fh","fhc","fh4","fh5","fh7"] |
|
}, |
|
"image/x-icon": { |
|
"source": "apache", |
|
"compressible": true, |
|
"extensions": ["ico"] |
|
}, |
|
"image/x-mrsid-image": { |
|
"source": "apache", |
|
"extensions": ["sid"] |
|
}, |
|
"image/x-pcx": { |
|
"source": "apache", |
|
"extensions": ["pcx"] |
|
}, |
|
"image/x-pict": { |
|
"source": "apache", |
|
"extensions": ["pic","pct"] |
|
}, |
|
"image/x-portable-anymap": { |
|
"source": "apache", |
|
"extensions": ["pnm"] |
|
}, |
|
"image/x-portable-bitmap": { |
|
"source": "apache", |
|
"extensions": ["pbm"] |
|
}, |
|
"image/x-portable-graymap": { |
|
"source": "apache", |
|
"extensions": ["pgm"] |
|
}, |
|
"image/x-portable-pixmap": { |
|
"source": "apache", |
|
"extensions": ["ppm"] |
|
}, |
|
"image/x-rgb": { |
|
"source": "apache", |
|
"extensions": ["rgb"] |
|
}, |
|
"image/x-tga": { |
|
"source": "apache", |
|
"extensions": ["tga"] |
|
}, |
|
"image/x-xbitmap": { |
|
"source": "apache", |
|
"extensions": ["xbm"] |
|
}, |
|
"image/x-xcf": { |
|
"compressible": false |
|
}, |
|
"image/x-xpixmap": { |
|
"source": "apache", |
|
"extensions": ["xpm"] |
|
}, |
|
"image/x-xwindowdump": { |
|
"source": "apache", |
|
"extensions": ["xwd"] |
|
}, |
|
"message/cpim": { |
|
"source": "iana" |
|
}, |
|
"message/delivery-status": { |
|
"source": "iana" |
|
}, |
|
"message/disposition-notification": { |
|
"source": "iana" |
|
}, |
|
"message/external-body": { |
|
"source": "iana" |
|
}, |
|
"message/feedback-report": { |
|
"source": "iana" |
|
}, |
|
"message/global": { |
|
"source": "iana" |
|
}, |
|
"message/global-delivery-status": { |
|
"source": "iana" |
|
}, |
|
"message/global-disposition-notification": { |
|
"source": "iana" |
|
}, |
|
"message/global-headers": { |
|
"source": "iana" |
|
}, |
|
"message/http": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"message/imdn+xml": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"message/news": { |
|
"source": "iana" |
|
}, |
|
"message/partial": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"message/rfc822": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["eml","mime"] |
|
}, |
|
"message/s-http": { |
|
"source": "iana" |
|
}, |
|
"message/sip": { |
|
"source": "iana" |
|
}, |
|
"message/sipfrag": { |
|
"source": "iana" |
|
}, |
|
"message/tracking-status": { |
|
"source": "iana" |
|
}, |
|
"message/vnd.si.simp": { |
|
"source": "iana" |
|
}, |
|
"message/vnd.wfa.wsc": { |
|
"source": "iana" |
|
}, |
|
"model/iges": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["igs","iges"] |
|
}, |
|
"model/mesh": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["msh","mesh","silo"] |
|
}, |
|
"model/vnd.collada+xml": { |
|
"source": "iana", |
|
"extensions": ["dae"] |
|
}, |
|
"model/vnd.dwf": { |
|
"source": "iana", |
|
"extensions": ["dwf"] |
|
}, |
|
"model/vnd.flatland.3dml": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.gdl": { |
|
"source": "iana", |
|
"extensions": ["gdl"] |
|
}, |
|
"model/vnd.gs-gdl": { |
|
"source": "apache" |
|
}, |
|
"model/vnd.gs.gdl": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.gtw": { |
|
"source": "iana", |
|
"extensions": ["gtw"] |
|
}, |
|
"model/vnd.moml+xml": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.mts": { |
|
"source": "iana", |
|
"extensions": ["mts"] |
|
}, |
|
"model/vnd.opengex": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.parasolid.transmit.binary": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.parasolid.transmit.text": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.valve.source.compiled-map": { |
|
"source": "iana" |
|
}, |
|
"model/vnd.vtu": { |
|
"source": "iana", |
|
"extensions": ["vtu"] |
|
}, |
|
"model/vrml": { |
|
"source": "iana", |
|
"compressible": false, |
|
"extensions": ["wrl","vrml"] |
|
}, |
|
"model/x3d+binary": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["x3db","x3dbz"] |
|
}, |
|
"model/x3d+fastinfoset": { |
|
"source": "iana" |
|
}, |
|
"model/x3d+vrml": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["x3dv","x3dvz"] |
|
}, |
|
"model/x3d+xml": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["x3d","x3dz"] |
|
}, |
|
"model/x3d-vrml": { |
|
"source": "iana" |
|
}, |
|
"multipart/alternative": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"multipart/appledouble": { |
|
"source": "iana" |
|
}, |
|
"multipart/byteranges": { |
|
"source": "iana" |
|
}, |
|
"multipart/digest": { |
|
"source": "iana" |
|
}, |
|
"multipart/encrypted": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"multipart/form-data": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"multipart/header-set": { |
|
"source": "iana" |
|
}, |
|
"multipart/mixed": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"multipart/parallel": { |
|
"source": "iana" |
|
}, |
|
"multipart/related": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"multipart/report": { |
|
"source": "iana" |
|
}, |
|
"multipart/signed": { |
|
"source": "iana", |
|
"compressible": false |
|
}, |
|
"multipart/voice-message": { |
|
"source": "iana" |
|
}, |
|
"multipart/x-mixed-replace": { |
|
"source": "iana" |
|
}, |
|
"text/1d-interleaved-parityfec": { |
|
"source": "iana" |
|
}, |
|
"text/cache-manifest": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["appcache","manifest"] |
|
}, |
|
"text/calendar": { |
|
"source": "iana", |
|
"extensions": ["ics","ifb"] |
|
}, |
|
"text/calender": { |
|
"compressible": true |
|
}, |
|
"text/cmd": { |
|
"compressible": true |
|
}, |
|
"text/coffeescript": { |
|
"extensions": ["coffee"] |
|
}, |
|
"text/css": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["css"] |
|
}, |
|
"text/csv": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["csv"] |
|
}, |
|
"text/csv-schema": { |
|
"source": "iana" |
|
}, |
|
"text/directory": { |
|
"source": "iana" |
|
}, |
|
"text/dns": { |
|
"source": "iana" |
|
}, |
|
"text/ecmascript": { |
|
"source": "iana" |
|
}, |
|
"text/encaprtp": { |
|
"source": "iana" |
|
}, |
|
"text/enriched": { |
|
"source": "iana" |
|
}, |
|
"text/fwdred": { |
|
"source": "iana" |
|
}, |
|
"text/grammar-ref-list": { |
|
"source": "iana" |
|
}, |
|
"text/hjson": { |
|
"extensions": ["hjson"] |
|
}, |
|
"text/html": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["html","htm"] |
|
}, |
|
"text/jade": { |
|
"extensions": ["jade"] |
|
}, |
|
"text/javascript": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"text/jcr-cnd": { |
|
"source": "iana" |
|
}, |
|
"text/jsx": { |
|
"compressible": true, |
|
"extensions": ["jsx"] |
|
}, |
|
"text/less": { |
|
"extensions": ["less"] |
|
}, |
|
"text/markdown": { |
|
"source": "iana" |
|
}, |
|
"text/mizar": { |
|
"source": "iana" |
|
}, |
|
"text/n3": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["n3"] |
|
}, |
|
"text/parameters": { |
|
"source": "iana" |
|
}, |
|
"text/parityfec": { |
|
"source": "iana" |
|
}, |
|
"text/plain": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["txt","text","conf","def","list","log","in","ini"] |
|
}, |
|
"text/provenance-notation": { |
|
"source": "iana" |
|
}, |
|
"text/prs.fallenstein.rst": { |
|
"source": "iana" |
|
}, |
|
"text/prs.lines.tag": { |
|
"source": "iana", |
|
"extensions": ["dsc"] |
|
}, |
|
"text/raptorfec": { |
|
"source": "iana" |
|
}, |
|
"text/red": { |
|
"source": "iana" |
|
}, |
|
"text/rfc822-headers": { |
|
"source": "iana" |
|
}, |
|
"text/richtext": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["rtx"] |
|
}, |
|
"text/rtf": { |
|
"source": "iana" |
|
}, |
|
"text/rtp-enc-aescm128": { |
|
"source": "iana" |
|
}, |
|
"text/rtploopback": { |
|
"source": "iana" |
|
}, |
|
"text/rtx": { |
|
"source": "iana" |
|
}, |
|
"text/sgml": { |
|
"source": "iana", |
|
"extensions": ["sgml","sgm"] |
|
}, |
|
"text/stylus": { |
|
"extensions": ["stylus","styl"] |
|
}, |
|
"text/t140": { |
|
"source": "iana" |
|
}, |
|
"text/tab-separated-values": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["tsv"] |
|
}, |
|
"text/troff": { |
|
"source": "iana", |
|
"extensions": ["t","tr","roff","man","me","ms"] |
|
}, |
|
"text/turtle": { |
|
"source": "iana", |
|
"extensions": ["ttl"] |
|
}, |
|
"text/ulpfec": { |
|
"source": "iana" |
|
}, |
|
"text/uri-list": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["uri","uris","urls"] |
|
}, |
|
"text/vcard": { |
|
"source": "iana", |
|
"compressible": true, |
|
"extensions": ["vcard"] |
|
}, |
|
"text/vnd.a": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.abc": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.curl": { |
|
"source": "iana", |
|
"extensions": ["curl"] |
|
}, |
|
"text/vnd.curl.dcurl": { |
|
"source": "apache", |
|
"extensions": ["dcurl"] |
|
}, |
|
"text/vnd.curl.mcurl": { |
|
"source": "apache", |
|
"extensions": ["mcurl"] |
|
}, |
|
"text/vnd.curl.scurl": { |
|
"source": "apache", |
|
"extensions": ["scurl"] |
|
}, |
|
"text/vnd.debian.copyright": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.dmclientscript": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.dvb.subtitle": { |
|
"source": "iana", |
|
"extensions": ["sub"] |
|
}, |
|
"text/vnd.esmertec.theme-descriptor": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.fly": { |
|
"source": "iana", |
|
"extensions": ["fly"] |
|
}, |
|
"text/vnd.fmi.flexstor": { |
|
"source": "iana", |
|
"extensions": ["flx"] |
|
}, |
|
"text/vnd.graphviz": { |
|
"source": "iana", |
|
"extensions": ["gv"] |
|
}, |
|
"text/vnd.in3d.3dml": { |
|
"source": "iana", |
|
"extensions": ["3dml"] |
|
}, |
|
"text/vnd.in3d.spot": { |
|
"source": "iana", |
|
"extensions": ["spot"] |
|
}, |
|
"text/vnd.iptc.newsml": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.iptc.nitf": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.latex-z": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.motorola.reflex": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.ms-mediapackage": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.net2phone.commcenter.command": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.radisys.msml-basic-layout": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.si.uricatalogue": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.sun.j2me.app-descriptor": { |
|
"source": "iana", |
|
"extensions": ["jad"] |
|
}, |
|
"text/vnd.trolltech.linguist": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.wap.si": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.wap.sl": { |
|
"source": "iana" |
|
}, |
|
"text/vnd.wap.wml": { |
|
"source": "iana", |
|
"extensions": ["wml"] |
|
}, |
|
"text/vnd.wap.wmlscript": { |
|
"source": "iana", |
|
"extensions": ["wmls"] |
|
}, |
|
"text/vtt": { |
|
"charset": "UTF-8", |
|
"compressible": true, |
|
"extensions": ["vtt"] |
|
}, |
|
"text/x-asm": { |
|
"source": "apache", |
|
"extensions": ["s","asm"] |
|
}, |
|
"text/x-c": { |
|
"source": "apache", |
|
"extensions": ["c","cc","cxx","cpp","h","hh","dic"] |
|
}, |
|
"text/x-component": { |
|
"extensions": ["htc"] |
|
}, |
|
"text/x-fortran": { |
|
"source": "apache", |
|
"extensions": ["f","for","f77","f90"] |
|
}, |
|
"text/x-gwt-rpc": { |
|
"compressible": true |
|
}, |
|
"text/x-handlebars-template": { |
|
"extensions": ["hbs"] |
|
}, |
|
"text/x-java-source": { |
|
"source": "apache", |
|
"extensions": ["java"] |
|
}, |
|
"text/x-jquery-tmpl": { |
|
"compressible": true |
|
}, |
|
"text/x-lua": { |
|
"extensions": ["lua"] |
|
}, |
|
"text/x-markdown": { |
|
"compressible": true, |
|
"extensions": ["markdown","md","mkd"] |
|
}, |
|
"text/x-nfo": { |
|
"source": "apache", |
|
"extensions": ["nfo"] |
|
}, |
|
"text/x-opml": { |
|
"source": "apache", |
|
"extensions": ["opml"] |
|
}, |
|
"text/x-pascal": { |
|
"source": "apache", |
|
"extensions": ["p","pas"] |
|
}, |
|
"text/x-sass": { |
|
"extensions": ["sass"] |
|
}, |
|
"text/x-scss": { |
|
"extensions": ["scss"] |
|
}, |
|
"text/x-setext": { |
|
"source": "apache", |
|
"extensions": ["etx"] |
|
}, |
|
"text/x-sfv": { |
|
"source": "apache", |
|
"extensions": ["sfv"] |
|
}, |
|
"text/x-uuencode": { |
|
"source": "apache", |
|
"extensions": ["uu"] |
|
}, |
|
"text/x-vcalendar": { |
|
"source": "apache", |
|
"extensions": ["vcs"] |
|
}, |
|
"text/x-vcard": { |
|
"source": "apache", |
|
"extensions": ["vcf"] |
|
}, |
|
"text/xml": { |
|
"source": "iana", |
|
"compressible": true |
|
}, |
|
"text/xml-external-parsed-entity": { |
|
"source": "iana" |
|
}, |
|
"text/yaml": { |
|
"extensions": ["yaml","yml"] |
|
}, |
|
"video/1d-interleaved-parityfec": { |
|
"source": "apache" |
|
}, |
|
"video/3gpp": { |
|
"source": "apache", |
|
"extensions": ["3gp"] |
|
}, |
|
"video/3gpp-tt": { |
|
"source": "apache" |
|
}, |
|
"video/3gpp2": { |
|
"source": "apache", |
|
"extensions": ["3g2"] |
|
}, |
|
"video/bmpeg": { |
|
"source": "apache" |
|
}, |
|
"video/bt656": { |
|
"source": "apache" |
|
}, |
|
"video/celb": { |
|
"source": "apache" |
|
}, |
|
"video/dv": { |
|
"source": "apache" |
|
}, |
|
"video/h261": { |
|
"source": "apache", |
|
"extensions": ["h261"] |
|
}, |
|
"video/h263": { |
|
"source": "apache", |
|
"extensions": ["h263"] |
|
}, |
|
"video/h263-1998": { |
|
"source": "apache" |
|
}, |
|
"video/h263-2000": { |
|
"source": "apache" |
|
}, |
|
"video/h264": { |
|
"source": "apache", |
|
"extensions": ["h264"] |
|
}, |
|
"video/h264-rcdo": { |
|
"source": "apache" |
|
}, |
|
"video/h264-svc": { |
|
"source": "apache" |
|
}, |
|
"video/jpeg": { |
|
"source": "apache", |
|
"extensions": ["jpgv"] |
|
}, |
|
"video/jpeg2000": { |
|
"source": "apache" |
|
}, |
|
"video/jpm": { |
|
"source": "apache", |
|
"extensions": ["jpm","jpgm"] |
|
}, |
|
"video/mj2": { |
|
"source": "apache", |
|
"extensions": ["mj2","mjp2"] |
|
}, |
|
"video/mp1s": { |
|
"source": "apache" |
|
}, |
|
"video/mp2p": { |
|
"source": "apache" |
|
}, |
|
"video/mp2t": { |
|
"source": "apache", |
|
"extensions": ["ts"] |
|
}, |
|
"video/mp4": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["mp4","mp4v","mpg4"] |
|
}, |
|
"video/mp4v-es": { |
|
"source": "apache" |
|
}, |
|
"video/mpeg": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["mpeg","mpg","mpe","m1v","m2v"] |
|
}, |
|
"video/mpeg4-generic": { |
|
"source": "apache" |
|
}, |
|
"video/mpv": { |
|
"source": "apache" |
|
}, |
|
"video/nv": { |
|
"source": "apache" |
|
}, |
|
"video/ogg": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["ogv"] |
|
}, |
|
"video/parityfec": { |
|
"source": "apache" |
|
}, |
|
"video/pointer": { |
|
"source": "apache" |
|
}, |
|
"video/quicktime": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["qt","mov"] |
|
}, |
|
"video/raw": { |
|
"source": "apache" |
|
}, |
|
"video/rtp-enc-aescm128": { |
|
"source": "apache" |
|
}, |
|
"video/rtx": { |
|
"source": "apache" |
|
}, |
|
"video/smpte292m": { |
|
"source": "apache" |
|
}, |
|
"video/ulpfec": { |
|
"source": "apache" |
|
}, |
|
"video/vc1": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.cctv": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.dece.hd": { |
|
"source": "apache", |
|
"extensions": ["uvh","uvvh"] |
|
}, |
|
"video/vnd.dece.mobile": { |
|
"source": "apache", |
|
"extensions": ["uvm","uvvm"] |
|
}, |
|
"video/vnd.dece.mp4": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.dece.pd": { |
|
"source": "apache", |
|
"extensions": ["uvp","uvvp"] |
|
}, |
|
"video/vnd.dece.sd": { |
|
"source": "apache", |
|
"extensions": ["uvs","uvvs"] |
|
}, |
|
"video/vnd.dece.video": { |
|
"source": "apache", |
|
"extensions": ["uvv","uvvv"] |
|
}, |
|
"video/vnd.directv.mpeg": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.directv.mpeg-tts": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.dlna.mpeg-tts": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.dvb.file": { |
|
"source": "apache", |
|
"extensions": ["dvb"] |
|
}, |
|
"video/vnd.fvt": { |
|
"source": "apache", |
|
"extensions": ["fvt"] |
|
}, |
|
"video/vnd.hns.video": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.iptvforum.1dparityfec-1010": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.iptvforum.1dparityfec-2005": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.iptvforum.2dparityfec-1010": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.iptvforum.2dparityfec-2005": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.iptvforum.ttsavc": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.iptvforum.ttsmpeg2": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.motorola.video": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.motorola.videop": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.mpegurl": { |
|
"source": "apache", |
|
"extensions": ["mxu","m4u"] |
|
}, |
|
"video/vnd.ms-playready.media.pyv": { |
|
"source": "apache", |
|
"extensions": ["pyv"] |
|
}, |
|
"video/vnd.nokia.interleaved-multimedia": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.nokia.videovoip": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.objectvideo": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.sealed.mpeg1": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.sealed.mpeg4": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.sealed.swf": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.sealedmedia.softseal.mov": { |
|
"source": "apache" |
|
}, |
|
"video/vnd.uvvu.mp4": { |
|
"source": "apache", |
|
"extensions": ["uvu","uvvu"] |
|
}, |
|
"video/vnd.vivo": { |
|
"source": "apache", |
|
"extensions": ["viv"] |
|
}, |
|
"video/webm": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["webm"] |
|
}, |
|
"video/x-f4v": { |
|
"source": "apache", |
|
"extensions": ["f4v"] |
|
}, |
|
"video/x-fli": { |
|
"source": "apache", |
|
"extensions": ["fli"] |
|
}, |
|
"video/x-flv": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["flv"] |
|
}, |
|
"video/x-m4v": { |
|
"source": "apache", |
|
"extensions": ["m4v"] |
|
}, |
|
"video/x-matroska": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["mkv","mk3d","mks"] |
|
}, |
|
"video/x-mng": { |
|
"source": "apache", |
|
"extensions": ["mng"] |
|
}, |
|
"video/x-ms-asf": { |
|
"source": "apache", |
|
"extensions": ["asf","asx"] |
|
}, |
|
"video/x-ms-vob": { |
|
"source": "apache", |
|
"extensions": ["vob"] |
|
}, |
|
"video/x-ms-wm": { |
|
"source": "apache", |
|
"extensions": ["wm"] |
|
}, |
|
"video/x-ms-wmv": { |
|
"source": "apache", |
|
"compressible": false, |
|
"extensions": ["wmv"] |
|
}, |
|
"video/x-ms-wmx": { |
|
"source": "apache", |
|
"extensions": ["wmx"] |
|
}, |
|
"video/x-ms-wvx": { |
|
"source": "apache", |
|
"extensions": ["wvx"] |
|
}, |
|
"video/x-msvideo": { |
|
"source": "apache", |
|
"extensions": ["avi"] |
|
}, |
|
"video/x-sgi-movie": { |
|
"source": "apache", |
|
"extensions": ["movie"] |
|
}, |
|
"video/x-smv": { |
|
"source": "apache", |
|
"extensions": ["smv"] |
|
}, |
|
"x-conference/x-cooltalk": { |
|
"source": "apache", |
|
"extensions": ["ice"] |
|
}, |
|
"x-shader/x-fragment": { |
|
"compressible": true |
|
}, |
|
"x-shader/x-vertex": { |
|
"compressible": true |
|
} |
|
} |
|
|
|
},{}],124:[function(require,module,exports){ |
|
/*! |
|
* mime-db |
|
* Copyright(c) 2014 Jonathan Ong |
|
* MIT Licensed |
|
*/ |
|
|
|
/** |
|
* Module exports. |
|
*/ |
|
|
|
module.exports = require('./db.json') |
|
|
|
},{"./db.json":123}],125:[function(require,module,exports){ |
|
// uuid.js |
|
// |
|
// Copyright (c) 2010-2012 Robert Kieffer |
|
// MIT License - http://opensource.org/licenses/mit-license.php |
|
|
|
(function() { |
|
var _global = this; |
|
|
|
// Unique ID creation requires a high quality random # generator. We feature |
|
// detect to determine the best RNG source, normalizing to a function that |
|
// returns 128-bits of randomness, since that's what's usually required |
|
var _rng; |
|
|
|
// Node.js crypto-based RNG - http://nodejs.org/docs/v0.6.2/api/crypto.html |
|
// |
|
// Moderately fast, high quality |
|
if (typeof(_global.require) == 'function') { |
|
try { |
|
var _rb = _global.require('crypto').randomBytes; |
|
_rng = _rb && function() {return _rb(16);}; |
|
} catch(e) {} |
|
} |
|
|
|
if (!_rng && _global.crypto && crypto.getRandomValues) { |
|
// WHATWG crypto-based RNG - http://wiki.whatwg.org/wiki/Crypto |
|
// |
|
// Moderately fast, high quality |
|
var _rnds8 = new Uint8Array(16); |
|
_rng = function whatwgRNG() { |
|
crypto.getRandomValues(_rnds8); |
|
return _rnds8; |
|
}; |
|
} |
|
|
|
if (!_rng) { |
|
// Math.random()-based (RNG) |
|
// |
|
// If all else fails, use Math.random(). It's fast, but is of unspecified |
|
// quality. |
|
var _rnds = new Array(16); |
|
_rng = function() { |
|
for (var i = 0, r; i < 16; i++) { |
|
if ((i & 0x03) === 0) r = Math.random() * 0x100000000; |
|
_rnds[i] = r >>> ((i & 0x03) << 3) & 0xff; |
|
} |
|
|
|
return _rnds; |
|
}; |
|
} |
|
|
|
// Buffer class to use |
|
var BufferClass = typeof(_global.Buffer) == 'function' ? _global.Buffer : Array; |
|
|
|
// Maps for number <-> hex string conversion |
|
var _byteToHex = []; |
|
var _hexToByte = {}; |
|
for (var i = 0; i < 256; i++) { |
|
_byteToHex[i] = (i + 0x100).toString(16).substr(1); |
|
_hexToByte[_byteToHex[i]] = i; |
|
} |
|
|
|
// **`parse()` - Parse a UUID into it's component bytes** |
|
function parse(s, buf, offset) { |
|
var i = (buf && offset) || 0, ii = 0; |
|
|
|
buf = buf || []; |
|
s.toLowerCase().replace(/[0-9a-f]{2}/g, function(oct) { |
|
if (ii < 16) { // Don't overflow! |
|
buf[i + ii++] = _hexToByte[oct]; |
|
} |
|
}); |
|
|
|
// Zero out remaining bytes if string was short |
|
while (ii < 16) { |
|
buf[i + ii++] = 0; |
|
} |
|
|
|
return buf; |
|
} |
|
|
|
// **`unparse()` - Convert UUID byte array (ala parse()) into a string** |
|
function unparse(buf, offset) { |
|
var i = offset || 0, bth = _byteToHex; |
|
return bth[buf[i++]] + bth[buf[i++]] + |
|
bth[buf[i++]] + bth[buf[i++]] + '-' + |
|
bth[buf[i++]] + bth[buf[i++]] + '-' + |
|
bth[buf[i++]] + bth[buf[i++]] + '-' + |
|
bth[buf[i++]] + bth[buf[i++]] + '-' + |
|
bth[buf[i++]] + bth[buf[i++]] + |
|
bth[buf[i++]] + bth[buf[i++]] + |
|
bth[buf[i++]] + bth[buf[i++]]; |
|
} |
|
|
|
// **`v1()` - Generate time-based UUID** |
|
// |
|
// Inspired by https://github.com/LiosK/UUID.js |
|
// and http://docs.python.org/library/uuid.html |
|
|
|
// random #'s we need to init node and clockseq |
|
var _seedBytes = _rng(); |
|
|
|
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1) |
|
var _nodeId = [ |
|
_seedBytes[0] | 0x01, |
|
_seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5] |
|
]; |
|
|
|
// Per 4.2.2, randomize (14 bit) clockseq |
|
var _clockseq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff; |
|
|
|
// Previous uuid creation time |
|
var _lastMSecs = 0, _lastNSecs = 0; |
|
|
|
// See https://github.com/broofa/node-uuid for API details |
|
function v1(options, buf, offset) { |
|
var i = buf && offset || 0; |
|
var b = buf || []; |
|
|
|
options = options || {}; |
|
|
|
var clockseq = options.clockseq != null ? options.clockseq : _clockseq; |
|
|
|
// UUID timestamps are 100 nano-second units since the Gregorian epoch, |
|
// (1582-10-15 00:00). JSNumbers aren't precise enough for this, so |
|
// time is handled internally as 'msecs' (integer milliseconds) and 'nsecs' |
|
// (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00. |
|
var msecs = options.msecs != null ? options.msecs : new Date().getTime(); |
|
|
|
// Per 4.2.1.2, use count of uuid's generated during the current clock |
|
// cycle to simulate higher resolution clock |
|
var nsecs = options.nsecs != null ? options.nsecs : _lastNSecs + 1; |
|
|
|
// Time since last uuid creation (in msecs) |
|
var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs)/10000; |
|
|
|
// Per 4.2.1.2, Bump clockseq on clock regression |
|
if (dt < 0 && options.clockseq == null) { |
|
clockseq = clockseq + 1 & 0x3fff; |
|
} |
|
|
|
// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new |
|
// time interval |
|
if ((dt < 0 || msecs > _lastMSecs) && options.nsecs == null) { |
|
nsecs = 0; |
|
} |
|
|
|
// Per 4.2.1.2 Throw error if too many uuids are requested |
|
if (nsecs >= 10000) { |
|
throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec'); |
|
} |
|
|
|
_lastMSecs = msecs; |
|
_lastNSecs = nsecs; |
|
_clockseq = clockseq; |
|
|
|
// Per 4.1.4 - Convert from unix epoch to Gregorian epoch |
|
msecs += 12219292800000; |
|
|
|
// `time_low` |
|
var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000; |
|
b[i++] = tl >>> 24 & 0xff; |
|
b[i++] = tl >>> 16 & 0xff; |
|
b[i++] = tl >>> 8 & 0xff; |
|
b[i++] = tl & 0xff; |
|
|
|
// `time_mid` |
|
var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff; |
|
b[i++] = tmh >>> 8 & 0xff; |
|
b[i++] = tmh & 0xff; |
|
|
|
// `time_high_and_version` |
|
b[i++] = tmh >>> 24 & 0xf | 0x10; // include version |
|
b[i++] = tmh >>> 16 & 0xff; |
|
|
|
// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant) |
|
b[i++] = clockseq >>> 8 | 0x80; |
|
|
|
// `clock_seq_low` |
|
b[i++] = clockseq & 0xff; |
|
|
|
// `node` |
|
var node = options.node || _nodeId; |
|
for (var n = 0; n < 6; n++) { |
|
b[i + n] = node[n]; |
|
} |
|
|
|
return buf ? buf : unparse(b); |
|
} |
|
|
|
// **`v4()` - Generate random UUID** |
|
|
|
// See https://github.com/broofa/node-uuid for API details |
|
function v4(options, buf, offset) { |
|
// Deprecated - 'format' argument, as supported in v1.2 |
|
var i = buf && offset || 0; |
|
|
|
if (typeof(options) == 'string') { |
|
buf = options == 'binary' ? new BufferClass(16) : null; |
|
options = null; |
|
} |
|
options = options || {}; |
|
|
|
var rnds = options.random || (options.rng || _rng)(); |
|
|
|
// Per 4.4, set bits for version and `clock_seq_hi_and_reserved` |
|
rnds[6] = (rnds[6] & 0x0f) | 0x40; |
|
rnds[8] = (rnds[8] & 0x3f) | 0x80; |
|
|
|
// Copy bytes to buffer, if provided |
|
if (buf) { |
|
for (var ii = 0; ii < 16; ii++) { |
|
buf[i + ii] = rnds[ii]; |
|
} |
|
} |
|
|
|
return buf || unparse(rnds); |
|
} |
|
|
|
// Export public API |
|
var uuid = v4; |
|
uuid.v1 = v1; |
|
uuid.v4 = v4; |
|
uuid.parse = parse; |
|
uuid.unparse = unparse; |
|
uuid.BufferClass = BufferClass; |
|
|
|
if (typeof(module) != 'undefined' && module.exports) { |
|
// Publish as node.js module |
|
module.exports = uuid; |
|
} else if (typeof define === 'function' && define.amd) { |
|
// Publish as AMD module |
|
define(function() {return uuid;}); |
|
|
|
|
|
} else { |
|
// Publish as global (in browsers) |
|
var _previousRoot = _global.uuid; |
|
|
|
// **`noConflict()` - (browser only) to reset global 'uuid' var** |
|
uuid.noConflict = function() { |
|
_global.uuid = _previousRoot; |
|
return uuid; |
|
}; |
|
|
|
_global.uuid = uuid; |
|
} |
|
}).call(this); |
|
|
|
},{}],126:[function(require,module,exports){ |
|
var crypto = require('crypto') |
|
, qs = require('querystring') |
|
; |
|
|
|
function sha1 (key, body) { |
|
return crypto.createHmac('sha1', key).update(body).digest('base64') |
|
} |
|
|
|
function rsa (key, body) { |
|
return crypto.createSign("RSA-SHA1").update(body).sign(key, 'base64'); |
|
} |
|
|
|
function rfc3986 (str) { |
|
return encodeURIComponent(str) |
|
.replace(/!/g,'%21') |
|
.replace(/\*/g,'%2A') |
|
.replace(/\(/g,'%28') |
|
.replace(/\)/g,'%29') |
|
.replace(/'/g,'%27') |
|
; |
|
} |
|
|
|
// Maps object to bi-dimensional array |
|
// Converts { foo: 'A', bar: [ 'b', 'B' ]} to |
|
// [ ['foo', 'A'], ['bar', 'b'], ['bar', 'B'] ] |
|
function map (obj) { |
|
var key, val, arr = [] |
|
for (key in obj) { |
|
val = obj[key] |
|
if (Array.isArray(val)) |
|
for (var i = 0; i < val.length; i++) |
|
arr.push([key, val[i]]) |
|
else |
|
arr.push([key, val]) |
|
} |
|
return arr |
|
} |
|
|
|
// Compare function for sort |
|
function compare (a, b) { |
|
return a > b ? 1 : a < b ? -1 : 0 |
|
} |
|
|
|
function generateBase (httpMethod, base_uri, params) { |
|
// adapted from https://dev.twitter.com/docs/auth/oauth and |
|
// https://dev.twitter.com/docs/auth/creating-signature |
|
|
|
// Parameter normalization |
|
// http://tools.ietf.org/html/rfc5849#section-3.4.1.3.2 |
|
var normalized = map(params) |
|
// 1. First, the name and value of each parameter are encoded |
|
.map(function (p) { |
|
return [ rfc3986(p[0]), rfc3986(p[1] || '') ] |
|
}) |
|
// 2. The parameters are sorted by name, using ascending byte value |
|
// ordering. If two or more parameters share the same name, they |
|
// are sorted by their value. |
|
.sort(function (a, b) { |
|
return compare(a[0], b[0]) || compare(a[1], b[1]) |
|
}) |
|
// 3. The name of each parameter is concatenated to its corresponding |
|
// value using an "=" character (ASCII code 61) as a separator, even |
|
// if the value is empty. |
|
.map(function (p) { return p.join('=') }) |
|
// 4. The sorted name/value pairs are concatenated together into a |
|
// single string by using an "&" character (ASCII code 38) as |
|
// separator. |
|
.join('&') |
|
|
|
var base = [ |
|
rfc3986(httpMethod ? httpMethod.toUpperCase() : 'GET'), |
|
rfc3986(base_uri), |
|
rfc3986(normalized) |
|
].join('&') |
|
|
|
return base |
|
} |
|
|
|
function hmacsign (httpMethod, base_uri, params, consumer_secret, token_secret) { |
|
var base = generateBase(httpMethod, base_uri, params) |
|
var key = [ |
|
consumer_secret || '', |
|
token_secret || '' |
|
].map(rfc3986).join('&') |
|
|
|
return sha1(key, base) |
|
} |
|
|
|
function rsasign (httpMethod, base_uri, params, private_key, token_secret) { |
|
var base = generateBase(httpMethod, base_uri, params) |
|
var key = private_key || '' |
|
|
|
return rsa(key, base) |
|
} |
|
|
|
function plaintext (consumer_secret, token_secret) { |
|
var key = [ |
|
consumer_secret || '', |
|
token_secret || '' |
|
].map(rfc3986).join('&') |
|
|
|
return key |
|
} |
|
|
|
function sign (signMethod, httpMethod, base_uri, params, consumer_secret, token_secret) { |
|
var method |
|
var skipArgs = 1 |
|
|
|
switch (signMethod) { |
|
case 'RSA-SHA1': |
|
method = rsasign |
|
break |
|
case 'HMAC-SHA1': |
|
method = hmacsign |
|
break |
|
case 'PLAINTEXT': |
|
method = plaintext |
|
skipArgs = 4 |
|
break |
|
default: |
|
throw new Error("Signature method not supported: " + signMethod) |
|
} |
|
|
|
return method.apply(null, [].slice.call(arguments, skipArgs)) |
|
} |
|
|
|
exports.hmacsign = hmacsign |
|
exports.rsasign = rsasign |
|
exports.plaintext = plaintext |
|
exports.sign = sign |
|
exports.rfc3986 = rfc3986 |
|
|
|
},{"crypto":178,"querystring":327}],127:[function(require,module,exports){ |
|
module.exports = require('./lib/'); |
|
|
|
},{"./lib/":128}],128:[function(require,module,exports){ |
|
// Load modules |
|
|
|
var Stringify = require('./stringify'); |
|
var Parse = require('./parse'); |
|
|
|
|
|
// Declare internals |
|
|
|
var internals = {}; |
|
|
|
|
|
module.exports = { |
|
stringify: Stringify, |
|
parse: Parse |
|
}; |
|
|
|
},{"./parse":129,"./stringify":130}],129:[function(require,module,exports){ |
|
// Load modules |
|
|
|
var Utils = require('./utils'); |
|
|
|
|
|
// Declare internals |
|
|
|
var internals = { |
|
delimiter: '&', |
|
depth: 5, |
|
arrayLimit: 20, |
|
parameterLimit: 1000 |
|
}; |
|
|
|
|
|
internals.parseValues = function (str, options) { |
|
|
|
var obj = {}; |
|
var parts = str.split(options.delimiter, options.parameterLimit === Infinity ? undefined : options.parameterLimit); |
|
|
|
for (var i = 0, il = parts.length; i < il; ++i) { |
|
var part = parts[i]; |
|
var pos = part.indexOf(']=') === -1 ? part.indexOf('=') : part.indexOf(']=') + 1; |
|
|
|
if (pos === -1) { |
|
obj[Utils.decode(part)] = ''; |
|
} |
|
else { |
|
var key = Utils.decode(part.slice(0, pos)); |
|
var val = Utils.decode(part.slice(pos + 1)); |
|
|
|
if (Object.prototype.hasOwnProperty(key)) { |
|
continue; |
|
} |
|
|
|
if (!obj.hasOwnProperty(key)) { |
|
obj[key] = val; |
|
} |
|
else { |
|
obj[key] = [].concat(obj[key]).concat(val); |
|
} |
|
} |
|
} |
|
|
|
return obj; |
|
}; |
|
|
|
|
|
internals.parseObject = function (chain, val, options) { |
|
|
|
if (!chain.length) { |
|
return val; |
|
} |
|
|
|
var root = chain.shift(); |
|
|
|
var obj = {}; |
|
if (root === '[]') { |
|
obj = []; |
|
obj = obj.concat(internals.parseObject(chain, val, options)); |
|
} |
|
else { |
|
var cleanRoot = root[0] === '[' && root[root.length - 1] === ']' ? root.slice(1, root.length - 1) : root; |
|
var index = parseInt(cleanRoot, 10); |
|
var indexString = '' + index; |
|
if (!isNaN(index) && |
|
root !== cleanRoot && |
|
indexString === cleanRoot && |
|
index >= 0 && |
|
index <= options.arrayLimit) { |
|
|
|
obj = []; |
|
obj[index] = internals.parseObject(chain, val, options); |
|
} |
|
else { |
|
obj[cleanRoot] = internals.parseObject(chain, val, options); |
|
} |
|
} |
|
|
|
return obj; |
|
}; |
|
|
|
|
|
internals.parseKeys = function (key, val, options) { |
|
|
|
if (!key) { |
|
return; |
|
} |
|
|
|
// The regex chunks |
|
|
|
var parent = /^([^\[\]]*)/; |
|
var child = /(\[[^\[\]]*\])/g; |
|
|
|
// Get the parent |
|
|
|
var segment = parent.exec(key); |
|
|
|
// Don't allow them to overwrite object prototype properties |
|
|
|
if (Object.prototype.hasOwnProperty(segment[1])) { |
|
return; |
|
} |
|
|
|
// Stash the parent if it exists |
|
|
|
var keys = []; |
|
if (segment[1]) { |
|
keys.push(segment[1]); |
|
} |
|
|
|
// Loop through children appending to the array until we hit depth |
|
|
|
var i = 0; |
|
while ((segment = child.exec(key)) !== null && i < options.depth) { |
|
|
|
++i; |
|
if (!Object.prototype.hasOwnProperty(segment[1].replace(/\[|\]/g, ''))) { |
|
keys.push(segment[1]); |
|
} |
|
} |
|
|
|
// If there's a remainder, just add whatever is left |
|
|
|
if (segment) { |
|
keys.push('[' + key.slice(segment.index) + ']'); |
|
} |
|
|
|
return internals.parseObject(keys, val, options); |
|
}; |
|
|
|
|
|
module.exports = function (str, options) { |
|
|
|
if (str === '' || |
|
str === null || |
|
typeof str === 'undefined') { |
|
|
|
return {}; |
|
} |
|
|
|
options = options || {}; |
|
options.delimiter = typeof options.delimiter === 'string' || Utils.isRegExp(options.delimiter) ? options.delimiter : internals.delimiter; |
|
options.depth = typeof options.depth === 'number' ? options.depth : internals.depth; |
|
options.arrayLimit = typeof options.arrayLimit === 'number' ? options.arrayLimit : internals.arrayLimit; |
|
options.parameterLimit = typeof options.parameterLimit === 'number' ? options.parameterLimit : internals.parameterLimit; |
|
|
|
var tempObj = typeof str === 'string' ? internals.parseValues(str, options) : str; |
|
var obj = {}; |
|
|
|
// Iterate over the keys and setup the new object |
|
|
|
var keys = Object.keys(tempObj); |
|
for (var i = 0, il = keys.length; i < il; ++i) { |
|
var key = keys[i]; |
|
var newObj = internals.parseKeys(key, tempObj[key], options); |
|
obj = Utils.merge(obj, newObj); |
|
} |
|
|
|
return Utils.compact(obj); |
|
}; |
|
|
|
},{"./utils":131}],130:[function(require,module,exports){ |
|
// Load modules |
|
|
|
var Utils = require('./utils'); |
|
|
|
|
|
// Declare internals |
|
|
|
var internals = { |
|
delimiter: '&', |
|
arrayPrefixGenerators: { |
|
brackets: function (prefix, key) { |
|
return prefix + '[]'; |
|
}, |
|
indices: function (prefix, key) { |
|
return prefix + '[' + key + ']'; |
|
}, |
|
repeat: function (prefix, key) { |
|
return prefix; |
|
} |
|
} |
|
}; |
|
|
|
|
|
internals.stringify = function (obj, prefix, generateArrayPrefix) { |
|
|
|
if (Utils.isBuffer(obj)) { |
|
obj = obj.toString(); |
|
} |
|
else if (obj instanceof Date) { |
|
obj = obj.toISOString(); |
|
} |
|
else if (obj === null) { |
|
obj = ''; |
|
} |
|
|
|
if (typeof obj === 'string' || |
|
typeof obj === 'number' || |
|
typeof obj === 'boolean') { |
|
|
|
return [encodeURIComponent(prefix) + '=' + encodeURIComponent(obj)]; |
|
} |
|
|
|
var values = []; |
|
|
|
if (typeof obj === 'undefined') { |
|
return values; |
|
} |
|
|
|
var objKeys = Object.keys(obj); |
|
for (var i = 0, il = objKeys.length; i < il; ++i) { |
|
var key = objKeys[i]; |
|
if (Array.isArray(obj)) { |
|
values = values.concat(internals.stringify(obj[key], generateArrayPrefix(prefix, key), generateArrayPrefix)); |
|
} |
|
else { |
|
values = values.concat(internals.stringify(obj[key], prefix + '[' + key + ']', generateArrayPrefix)); |
|
} |
|
} |
|
|
|
return values; |
|
}; |
|
|
|
|
|
module.exports = function (obj, options) { |
|
|
|
options = options || {}; |
|
var delimiter = typeof options.delimiter === 'undefined' ? internals.delimiter : options.delimiter; |
|
|
|
var keys = []; |
|
|
|
if (typeof obj !== 'object' || |
|
obj === null) { |
|
|
|
return ''; |
|
} |
|
|
|
var arrayFormat; |
|
if (options.arrayFormat in internals.arrayPrefixGenerators) { |
|
arrayFormat = options.arrayFormat; |
|
} |
|
else if ('indices' in options) { |
|
arrayFormat = options.indices ? 'indices' : 'repeat'; |
|
} |
|
else { |
|
arrayFormat = 'indices'; |
|
} |
|
|
|
var generateArrayPrefix = internals.arrayPrefixGenerators[arrayFormat]; |
|
|
|
var objKeys = Object.keys(obj); |
|
for (var i = 0, il = objKeys.length; i < il; ++i) { |
|
var key = objKeys[i]; |
|
keys = keys.concat(internals.stringify(obj[key], key, generateArrayPrefix)); |
|
} |
|
|
|
return keys.join(delimiter); |
|
}; |
|
|
|
},{"./utils":131}],131:[function(require,module,exports){ |
|
// Load modules |
|
|
|
|
|
// Declare internals |
|
|
|
var internals = {}; |
|
|
|
|
|
exports.arrayToObject = function (source) { |
|
|
|
var obj = {}; |
|
for (var i = 0, il = source.length; i < il; ++i) { |
|
if (typeof source[i] !== 'undefined') { |
|
|
|
obj[i] = source[i]; |
|
} |
|
} |
|
|
|
return obj; |
|
}; |
|
|
|
|
|
exports.merge = function (target, source) { |
|
|
|
if (!source) { |
|
return target; |
|
} |
|
|
|
if (typeof source !== 'object') { |
|
if (Array.isArray(target)) { |
|
target.push(source); |
|
} |
|
else { |
|
target[source] = true; |
|
} |
|
|
|
return target; |
|
} |
|
|
|
if (typeof target !== 'object') { |
|
target = [target].concat(source); |
|
return target; |
|
} |
|
|
|
if (Array.isArray(target) && |
|
!Array.isArray(source)) { |
|
|
|
target = exports.arrayToObject(target); |
|
} |
|
|
|
var keys = Object.keys(source); |
|
for (var k = 0, kl = keys.length; k < kl; ++k) { |
|
var key = keys[k]; |
|
var value = source[key]; |
|
|
|
if (!target[key]) { |
|
target[key] = value; |
|
} |
|
else { |
|
target[key] = exports.merge(target[key], value); |
|
} |
|
} |
|
|
|
return target; |
|
}; |
|
|
|
|
|
exports.decode = function (str) { |
|
|
|
try { |
|
return decodeURIComponent(str.replace(/\+/g, ' ')); |
|
} catch (e) { |
|
return str; |
|
} |
|
}; |
|
|
|
|
|
exports.compact = function (obj, refs) { |
|
|
|
if (typeof obj !== 'object' || |
|
obj === null) { |
|
|
|
return obj; |
|
} |
|
|
|
refs = refs || []; |
|
var lookup = refs.indexOf(obj); |
|
if (lookup !== -1) { |
|
return refs[lookup]; |
|
} |
|
|
|
refs.push(obj); |
|
|
|
if (Array.isArray(obj)) { |
|
var compacted = []; |
|
|
|
for (var i = 0, il = obj.length; i < il; ++i) { |
|
if (typeof obj[i] !== 'undefined') { |
|
compacted.push(obj[i]); |
|
} |
|
} |
|
|
|
return compacted; |
|
} |
|
|
|
var keys = Object.keys(obj); |
|
for (i = 0, il = keys.length; i < il; ++i) { |
|
var key = keys[i]; |
|
obj[key] = exports.compact(obj[key], refs); |
|
} |
|
|
|
return obj; |
|
}; |
|
|
|
|
|
exports.isRegExp = function (obj) { |
|
return Object.prototype.toString.call(obj) === '[object RegExp]'; |
|
}; |
|
|
|
|
|
exports.isBuffer = function (obj) { |
|
|
|
if (obj === null || |
|
typeof obj === 'undefined') { |
|
|
|
return false; |
|
} |
|
|
|
return !!(obj.constructor && |
|
obj.constructor.isBuffer && |
|
obj.constructor.isBuffer(obj)); |
|
}; |
|
|
|
},{}],132:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var util = require('util') |
|
var Stream = require('stream') |
|
var StringDecoder = require('string_decoder').StringDecoder |
|
|
|
module.exports = StringStream |
|
module.exports.AlignedStringDecoder = AlignedStringDecoder |
|
|
|
function StringStream(from, to) { |
|
if (!(this instanceof StringStream)) return new StringStream(from, to) |
|
|
|
Stream.call(this) |
|
|
|
if (from == null) from = 'utf8' |
|
|
|
this.readable = this.writable = true |
|
this.paused = false |
|
this.toEncoding = (to == null ? from : to) |
|
this.fromEncoding = (to == null ? '' : from) |
|
this.decoder = new AlignedStringDecoder(this.toEncoding) |
|
} |
|
util.inherits(StringStream, Stream) |
|
|
|
StringStream.prototype.write = function(data) { |
|
if (!this.writable) { |
|
var err = new Error('stream not writable') |
|
err.code = 'EPIPE' |
|
this.emit('error', err) |
|
return false |
|
} |
|
if (this.fromEncoding) { |
|
if (Buffer.isBuffer(data)) data = data.toString() |
|
data = new Buffer(data, this.fromEncoding) |
|
} |
|
var string = this.decoder.write(data) |
|
if (string.length) this.emit('data', string) |
|
return !this.paused |
|
} |
|
|
|
StringStream.prototype.flush = function() { |
|
if (this.decoder.flush) { |
|
var string = this.decoder.flush() |
|
if (string.length) this.emit('data', string) |
|
} |
|
} |
|
|
|
StringStream.prototype.end = function() { |
|
if (!this.writable && !this.readable) return |
|
this.flush() |
|
this.emit('end') |
|
this.writable = this.readable = false |
|
this.destroy() |
|
} |
|
|
|
StringStream.prototype.destroy = function() { |
|
this.decoder = null |
|
this.writable = this.readable = false |
|
this.emit('close') |
|
} |
|
|
|
StringStream.prototype.pause = function() { |
|
this.paused = true |
|
} |
|
|
|
StringStream.prototype.resume = function () { |
|
if (this.paused) this.emit('drain') |
|
this.paused = false |
|
} |
|
|
|
function AlignedStringDecoder(encoding) { |
|
StringDecoder.call(this, encoding) |
|
|
|
switch (this.encoding) { |
|
case 'base64': |
|
this.write = alignedWrite |
|
this.alignedBuffer = new Buffer(3) |
|
this.alignedBytes = 0 |
|
break |
|
} |
|
} |
|
util.inherits(AlignedStringDecoder, StringDecoder) |
|
|
|
AlignedStringDecoder.prototype.flush = function() { |
|
if (!this.alignedBuffer || !this.alignedBytes) return '' |
|
var leftover = this.alignedBuffer.toString(this.encoding, 0, this.alignedBytes) |
|
this.alignedBytes = 0 |
|
return leftover |
|
} |
|
|
|
function alignedWrite(buffer) { |
|
var rem = (this.alignedBytes + buffer.length) % this.alignedBuffer.length |
|
if (!rem && !this.alignedBytes) return buffer.toString(this.encoding) |
|
|
|
var returnBuffer = new Buffer(this.alignedBytes + buffer.length - rem) |
|
|
|
this.alignedBuffer.copy(returnBuffer, 0, 0, this.alignedBytes) |
|
buffer.copy(returnBuffer, this.alignedBytes, 0, buffer.length - rem) |
|
|
|
buffer.copy(this.alignedBuffer, 0, buffer.length - rem, buffer.length) |
|
this.alignedBytes = rem |
|
|
|
return returnBuffer.toString(this.encoding) |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"stream":339,"string_decoder":340,"util":343}],133:[function(require,module,exports){ |
|
/* |
|
* Copyright GoInstant, Inc. and other contributors. All rights reserved. |
|
* Permission is hereby granted, free of charge, to any person obtaining a copy |
|
* of this software and associated documentation files (the "Software"), to |
|
* deal in the Software without restriction, including without limitation the |
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
|
* sell copies of the Software, and to permit persons to whom the Software is |
|
* furnished to do so, subject to the following conditions: |
|
* |
|
* The above copyright notice and this permission notice shall be included in |
|
* all copies or substantial portions of the Software. |
|
* |
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS |
|
* IN THE SOFTWARE. |
|
*/ |
|
|
|
'use strict'; |
|
var net = require('net'); |
|
var urlParse = require('url').parse; |
|
var pubsuffix = require('./pubsuffix'); |
|
var Store = require('./store').Store; |
|
|
|
var punycode; |
|
try { |
|
punycode = require('punycode'); |
|
} catch(e) { |
|
console.warn("cookie: can't load punycode; won't use punycode for domain normalization"); |
|
} |
|
|
|
var DATE_DELIM = /[\x09\x20-\x2F\x3B-\x40\x5B-\x60\x7B-\x7E]/; |
|
|
|
// From RFC2616 S2.2: |
|
var TOKEN = /[\x21\x23-\x26\x2A\x2B\x2D\x2E\x30-\x39\x41-\x5A\x5E-\x7A\x7C\x7E]/; |
|
|
|
// From RFC6265 S4.1.1 |
|
// note that it excludes \x3B ";" |
|
var COOKIE_OCTET = /[\x21\x23-\x2B\x2D-\x3A\x3C-\x5B\x5D-\x7E]/; |
|
var COOKIE_OCTETS = new RegExp('^'+COOKIE_OCTET.source+'$'); |
|
|
|
// The name/key cannot be empty but the value can (S5.2): |
|
var COOKIE_PAIR_STRICT = new RegExp('^('+TOKEN.source+'+)=("?)('+COOKIE_OCTET.source+'*)\\2$'); |
|
var COOKIE_PAIR = /^([^=\s]+)\s*=\s*("?)\s*(.*)\s*\2\s*$/; |
|
|
|
// RFC6265 S4.1.1 defines extension-av as 'any CHAR except CTLs or ";"' |
|
// Note ';' is \x3B |
|
var NON_CTL_SEMICOLON = /[\x20-\x3A\x3C-\x7E]+/; |
|
var EXTENSION_AV = NON_CTL_SEMICOLON; |
|
var PATH_VALUE = NON_CTL_SEMICOLON; |
|
|
|
// Used for checking whether or not there is a trailing semi-colon |
|
var TRAILING_SEMICOLON = /;+$/; |
|
|
|
/* RFC6265 S5.1.1.5: |
|
* [fail if] the day-of-month-value is less than 1 or greater than 31 |
|
*/ |
|
var DAY_OF_MONTH = /^(0?[1-9]|[12][0-9]|3[01])$/; |
|
|
|
/* RFC6265 S5.1.1.5: |
|
* [fail if] |
|
* * the hour-value is greater than 23, |
|
* * the minute-value is greater than 59, or |
|
* * the second-value is greater than 59. |
|
*/ |
|
var TIME = /(0?[0-9]|1[0-9]|2[0-3]):([0-5][0-9]):([0-5][0-9])/; |
|
var STRICT_TIME = /^(0?[0-9]|1[0-9]|2[0-3]):([0-5][0-9]):([0-5][0-9])$/; |
|
|
|
var MONTH = /^(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)$/i; |
|
var MONTH_TO_NUM = { |
|
jan:0, feb:1, mar:2, apr:3, may:4, jun:5, |
|
jul:6, aug:7, sep:8, oct:9, nov:10, dec:11 |
|
}; |
|
var NUM_TO_MONTH = [ |
|
'Jan','Feb','Mar','Apr','May','Jun','Jul','Aug','Sep','Oct','Nov','Dec' |
|
]; |
|
var NUM_TO_DAY = [ |
|
'Sun','Mon','Tue','Wed','Thu','Fri','Sat' |
|
]; |
|
|
|
var YEAR = /^([1-9][0-9]{1,3})$/; // 2 to 4 digits |
|
|
|
var MAX_TIME = 2147483647000; // 31-bit max |
|
var MIN_TIME = 0; // 31-bit min |
|
|
|
|
|
// RFC6265 S5.1.1 date parser: |
|
function parseDate(str,strict) { |
|
if (!str) { |
|
return; |
|
} |
|
var found_time, found_dom, found_month, found_year; |
|
|
|
/* RFC6265 S5.1.1: |
|
* 2. Process each date-token sequentially in the order the date-tokens |
|
* appear in the cookie-date |
|
*/ |
|
var tokens = str.split(DATE_DELIM); |
|
if (!tokens) { |
|
return; |
|
} |
|
|
|
var date = new Date(); |
|
date.setMilliseconds(0); |
|
|
|
for (var i=0; i<tokens.length; i++) { |
|
var token = tokens[i].trim(); |
|
if (!token.length) { |
|
continue; |
|
} |
|
|
|
var result; |
|
|
|
/* 2.1. If the found-time flag is not set and the token matches the time |
|
* production, set the found-time flag and set the hour- value, |
|
* minute-value, and second-value to the numbers denoted by the digits in |
|
* the date-token, respectively. Skip the remaining sub-steps and continue |
|
* to the next date-token. |
|
*/ |
|
if (!found_time) { |
|
result = (strict ? STRICT_TIME : TIME).exec(token); |
|
if (result) { |
|
found_time = true; |
|
date.setUTCHours(result[1]); |
|
date.setUTCMinutes(result[2]); |
|
date.setUTCSeconds(result[3]); |
|
continue; |
|
} |
|
} |
|
|
|
/* 2.2. If the found-day-of-month flag is not set and the date-token matches |
|
* the day-of-month production, set the found-day-of- month flag and set |
|
* the day-of-month-value to the number denoted by the date-token. Skip |
|
* the remaining sub-steps and continue to the next date-token. |
|
*/ |
|
if (!found_dom) { |
|
result = DAY_OF_MONTH.exec(token); |
|
if (result) { |
|
found_dom = true; |
|
date.setUTCDate(result[1]); |
|
continue; |
|
} |
|
} |
|
|
|
/* 2.3. If the found-month flag is not set and the date-token matches the |
|
* month production, set the found-month flag and set the month-value to |
|
* the month denoted by the date-token. Skip the remaining sub-steps and |
|
* continue to the next date-token. |
|
*/ |
|
if (!found_month) { |
|
result = MONTH.exec(token); |
|
if (result) { |
|
found_month = true; |
|
date.setUTCMonth(MONTH_TO_NUM[result[1].toLowerCase()]); |
|
continue; |
|
} |
|
} |
|
|
|
/* 2.4. If the found-year flag is not set and the date-token matches the year |
|
* production, set the found-year flag and set the year-value to the number |
|
* denoted by the date-token. Skip the remaining sub-steps and continue to |
|
* the next date-token. |
|
*/ |
|
if (!found_year) { |
|
result = YEAR.exec(token); |
|
if (result) { |
|
var year = result[0]; |
|
/* From S5.1.1: |
|
* 3. If the year-value is greater than or equal to 70 and less |
|
* than or equal to 99, increment the year-value by 1900. |
|
* 4. If the year-value is greater than or equal to 0 and less |
|
* than or equal to 69, increment the year-value by 2000. |
|
*/ |
|
if (70 <= year && year <= 99) { |
|
year += 1900; |
|
} else if (0 <= year && year <= 69) { |
|
year += 2000; |
|
} |
|
|
|
if (year < 1601) { |
|
return; // 5. ... the year-value is less than 1601 |
|
} |
|
|
|
found_year = true; |
|
date.setUTCFullYear(year); |
|
continue; |
|
} |
|
} |
|
} |
|
|
|
if (!(found_time && found_dom && found_month && found_year)) { |
|
return; // 5. ... at least one of the found-day-of-month, found-month, found- |
|
// year, or found-time flags is not set, |
|
} |
|
|
|
return date; |
|
} |
|
|
|
function formatDate(date) { |
|
var d = date.getUTCDate(); d = d >= 10 ? d : '0'+d; |
|
var h = date.getUTCHours(); h = h >= 10 ? h : '0'+h; |
|
var m = date.getUTCMinutes(); m = m >= 10 ? m : '0'+m; |
|
var s = date.getUTCSeconds(); s = s >= 10 ? s : '0'+s; |
|
return NUM_TO_DAY[date.getUTCDay()] + ', ' + |
|
d+' '+ NUM_TO_MONTH[date.getUTCMonth()] +' '+ date.getUTCFullYear() +' '+ |
|
h+':'+m+':'+s+' GMT'; |
|
} |
|
|
|
// S5.1.2 Canonicalized Host Names |
|
function canonicalDomain(str) { |
|
if (str == null) { |
|
return null; |
|
} |
|
str = str.trim().replace(/^\./,''); // S4.1.2.3 & S5.2.3: ignore leading . |
|
|
|
// convert to IDN if any non-ASCII characters |
|
if (punycode && /[^\u0001-\u007f]/.test(str)) { |
|
str = punycode.toASCII(str); |
|
} |
|
|
|
return str.toLowerCase(); |
|
} |
|
|
|
// S5.1.3 Domain Matching |
|
function domainMatch(str, domStr, canonicalize) { |
|
if (str == null || domStr == null) { |
|
return null; |
|
} |
|
if (canonicalize !== false) { |
|
str = canonicalDomain(str); |
|
domStr = canonicalDomain(domStr); |
|
} |
|
|
|
/* |
|
* "The domain string and the string are identical. (Note that both the |
|
* domain string and the string will have been canonicalized to lower case at |
|
* this point)" |
|
*/ |
|
if (str == domStr) { |
|
return true; |
|
} |
|
|
|
/* "All of the following [three] conditions hold:" (order adjusted from the RFC) */ |
|
|
|
/* "* The string is a host name (i.e., not an IP address)." */ |
|
if (net.isIP(str)) { |
|
return false; |
|
} |
|
|
|
/* "* The domain string is a suffix of the string" */ |
|
var idx = str.indexOf(domStr); |
|
if (idx <= 0) { |
|
return false; // it's a non-match (-1) or prefix (0) |
|
} |
|
|
|
// e.g "a.b.c".indexOf("b.c") === 2 |
|
// 5 === 3+2 |
|
if (str.length !== domStr.length + idx) { // it's not a suffix |
|
return false; |
|
} |
|
|
|
/* "* The last character of the string that is not included in the domain |
|
* string is a %x2E (".") character." */ |
|
if (str.substr(idx-1,1) !== '.') { |
|
return false; |
|
} |
|
|
|
return true; |
|
} |
|
|
|
|
|
// RFC6265 S5.1.4 Paths and Path-Match |
|
|
|
/* |
|
* "The user agent MUST use an algorithm equivalent to the following algorithm |
|
* to compute the default-path of a cookie:" |
|
* |
|
* Assumption: the path (and not query part or absolute uri) is passed in. |
|
*/ |
|
function defaultPath(path) { |
|
// "2. If the uri-path is empty or if the first character of the uri-path is not |
|
// a %x2F ("/") character, output %x2F ("/") and skip the remaining steps. |
|
if (!path || path.substr(0,1) !== "/") { |
|
return "/"; |
|
} |
|
|
|
// "3. If the uri-path contains no more than one %x2F ("/") character, output |
|
// %x2F ("/") and skip the remaining step." |
|
if (path === "/") { |
|
return path; |
|
} |
|
|
|
var rightSlash = path.lastIndexOf("/"); |
|
if (rightSlash === 0) { |
|
return "/"; |
|
} |
|
|
|
// "4. Output the characters of the uri-path from the first character up to, |
|
// but not including, the right-most %x2F ("/")." |
|
return path.slice(0, rightSlash); |
|
} |
|
|
|
/* |
|
* "A request-path path-matches a given cookie-path if at least one of the |
|
* following conditions holds:" |
|
*/ |
|
function pathMatch(reqPath,cookiePath) { |
|
// "o The cookie-path and the request-path are identical." |
|
if (cookiePath === reqPath) { |
|
return true; |
|
} |
|
|
|
var idx = reqPath.indexOf(cookiePath); |
|
if (idx === 0) { |
|
// "o The cookie-path is a prefix of the request-path, and the last |
|
// character of the cookie-path is %x2F ("/")." |
|
if (cookiePath.substr(-1) === "/") { |
|
return true; |
|
} |
|
|
|
// " o The cookie-path is a prefix of the request-path, and the first |
|
// character of the request-path that is not included in the cookie- path |
|
// is a %x2F ("/") character." |
|
if (reqPath.substr(cookiePath.length,1) === "/") { |
|
return true; |
|
} |
|
} |
|
|
|
return false; |
|
} |
|
|
|
function parse(str, strict) { |
|
str = str.trim(); |
|
|
|
// S4.1.1 Trailing semi-colons are not part of the specification. |
|
// If we are not in strict mode we remove the trailing semi-colons. |
|
var semiColonCheck = TRAILING_SEMICOLON.exec(str); |
|
if (semiColonCheck) { |
|
if (strict) { |
|
return; |
|
} |
|
str = str.slice(0, semiColonCheck.index); |
|
} |
|
|
|
// We use a regex to parse the "name-value-pair" part of S5.2 |
|
var firstSemi = str.indexOf(';'); // S5.2 step 1 |
|
var pairRx = strict ? COOKIE_PAIR_STRICT : COOKIE_PAIR; |
|
var result = pairRx.exec(firstSemi === -1 ? str : str.substr(0,firstSemi)); |
|
|
|
// Rx satisfies the "the name string is empty" and "lacks a %x3D ("=")" |
|
// constraints as well as trimming any whitespace. |
|
if (!result) { |
|
return; |
|
} |
|
|
|
var c = new Cookie(); |
|
c.key = result[1]; // the regexp should trim() already |
|
c.value = result[3]; // [2] is quotes or empty-string |
|
|
|
if (firstSemi === -1) { |
|
return c; |
|
} |
|
|
|
// S5.2.3 "unparsed-attributes consist of the remainder of the set-cookie-string |
|
// (including the %x3B (";") in question)." plus later on in the same section |
|
// "discard the first ";" and trim". |
|
var unparsed = str.slice(firstSemi).replace(/^\s*;\s*/,'').trim(); |
|
|
|
// "If the unparsed-attributes string is empty, skip the rest of these |
|
// steps." |
|
if (unparsed.length === 0) { |
|
return c; |
|
} |
|
|
|
/* |
|
* S5.2 says that when looping over the items "[p]rocess the attribute-name |
|
* and attribute-value according to the requirements in the following |
|
* subsections" for every item. Plus, for many of the individual attributes |
|
* in S5.3 it says to use the "attribute-value of the last attribute in the |
|
* cookie-attribute-list". Therefore, in this implementation, we overwrite |
|
* the previous value. |
|
*/ |
|
var cookie_avs = unparsed.split(/\s*;\s*/); |
|
while (cookie_avs.length) { |
|
var av = cookie_avs.shift(); |
|
|
|
if (strict && !EXTENSION_AV.test(av)) { |
|
return; |
|
} |
|
|
|
var av_sep = av.indexOf('='); |
|
var av_key, av_value; |
|
if (av_sep === -1) { |
|
av_key = av; |
|
av_value = null; |
|
} else { |
|
av_key = av.substr(0,av_sep); |
|
av_value = av.substr(av_sep+1); |
|
} |
|
|
|
av_key = av_key.trim().toLowerCase(); |
|
if (av_value) { |
|
av_value = av_value.trim(); |
|
} |
|
|
|
switch(av_key) { |
|
case 'expires': // S5.2.1 |
|
if (!av_value) {if(strict){return;}else{break;} } |
|
var exp = parseDate(av_value,strict); |
|
// "If the attribute-value failed to parse as a cookie date, ignore the |
|
// cookie-av." |
|
if (exp == null) { if(strict){return;}else{break;} } |
|
c.expires = exp; |
|
// over and underflow not realistically a concern: V8's getTime() seems to |
|
// store something larger than a 32-bit time_t (even with 32-bit node) |
|
break; |
|
|
|
case 'max-age': // S5.2.2 |
|
if (!av_value) { if(strict){return;}else{break;} } |
|
// "If the first character of the attribute-value is not a DIGIT or a "-" |
|
// character ...[or]... If the remainder of attribute-value contains a |
|
// non-DIGIT character, ignore the cookie-av." |
|
if (!/^-?[0-9]+$/.test(av_value)) { if(strict){return;}else{break;} } |
|
var delta = parseInt(av_value,10); |
|
if (strict && delta <= 0) { |
|
return; // S4.1.1 |
|
} |
|
// "If delta-seconds is less than or equal to zero (0), let expiry-time |
|
// be the earliest representable date and time." |
|
c.setMaxAge(delta); |
|
break; |
|
|
|
case 'domain': // S5.2.3 |
|
// "If the attribute-value is empty, the behavior is undefined. However, |
|
// the user agent SHOULD ignore the cookie-av entirely." |
|
if (!av_value) { if(strict){return;}else{break;} } |
|
// S5.2.3 "Let cookie-domain be the attribute-value without the leading %x2E |
|
// (".") character." |
|
var domain = av_value.trim().replace(/^\./,''); |
|
if (!domain) { if(strict){return;}else{break;} } // see "is empty" above |
|
// "Convert the cookie-domain to lower case." |
|
c.domain = domain.toLowerCase(); |
|
break; |
|
|
|
case 'path': // S5.2.4 |
|
/* |
|
* "If the attribute-value is empty or if the first character of the |
|
* attribute-value is not %x2F ("/"): |
|
* Let cookie-path be the default-path. |
|
* Otherwise: |
|
* Let cookie-path be the attribute-value." |
|
* |
|
* We'll represent the default-path as null since it depends on the |
|
* context of the parsing. |
|
*/ |
|
if (!av_value || av_value.substr(0,1) != "/") { |
|
if(strict){return;}else{break;} |
|
} |
|
c.path = av_value; |
|
break; |
|
|
|
case 'secure': // S5.2.5 |
|
/* |
|
* "If the attribute-name case-insensitively matches the string "Secure", |
|
* the user agent MUST append an attribute to the cookie-attribute-list |
|
* with an attribute-name of Secure and an empty attribute-value." |
|
*/ |
|
if (av_value != null) { if(strict){return;} } |
|
c.secure = true; |
|
break; |
|
|
|
case 'httponly': // S5.2.6 -- effectively the same as 'secure' |
|
if (av_value != null) { if(strict){return;} } |
|
c.httpOnly = true; |
|
break; |
|
|
|
default: |
|
c.extensions = c.extensions || []; |
|
c.extensions.push(av); |
|
break; |
|
} |
|
} |
|
|
|
// ensure a default date for sorting: |
|
c.creation = new Date(); |
|
return c; |
|
} |
|
|
|
function fromJSON(str) { |
|
if (!str) { |
|
return null; |
|
} |
|
|
|
var obj; |
|
try { |
|
obj = JSON.parse(str); |
|
} catch (e) { |
|
return null; |
|
} |
|
|
|
var c = new Cookie(); |
|
for (var i=0; i<numCookieProperties; i++) { |
|
var prop = cookieProperties[i]; |
|
if (obj[prop] == null) { |
|
continue; |
|
} |
|
if (prop === 'expires' || |
|
prop === 'creation' || |
|
prop === 'lastAccessed') |
|
{ |
|
c[prop] = obj[prop] == "Infinity" ? "Infinity" : new Date(obj[prop]); |
|
} else { |
|
c[prop] = obj[prop]; |
|
} |
|
} |
|
|
|
|
|
// ensure a default date for sorting: |
|
c.creation = c.creation || new Date(); |
|
|
|
return c; |
|
} |
|
|
|
/* Section 5.4 part 2: |
|
* "* Cookies with longer paths are listed before cookies with |
|
* shorter paths. |
|
* |
|
* * Among cookies that have equal-length path fields, cookies with |
|
* earlier creation-times are listed before cookies with later |
|
* creation-times." |
|
*/ |
|
|
|
function cookieCompare(a,b) { |
|
// descending for length: b CMP a |
|
var deltaLen = (b.path ? b.path.length : 0) - (a.path ? a.path.length : 0); |
|
if (deltaLen !== 0) { |
|
return deltaLen; |
|
} |
|
// ascending for time: a CMP b |
|
return (a.creation ? a.creation.getTime() : MAX_TIME) - |
|
(b.creation ? b.creation.getTime() : MAX_TIME); |
|
} |
|
|
|
// Gives the permutation of all possible domainMatch()es of a given domain. The |
|
// array is in shortest-to-longest order. Handy for indexing. |
|
function permuteDomain(domain) { |
|
var pubSuf = pubsuffix.getPublicSuffix(domain); |
|
if (!pubSuf) { |
|
return null; |
|
} |
|
if (pubSuf == domain) { |
|
return [domain]; |
|
} |
|
|
|
var prefix = domain.slice(0,-(pubSuf.length+1)); // ".example.com" |
|
var parts = prefix.split('.').reverse(); |
|
var cur = pubSuf; |
|
var permutations = [cur]; |
|
while (parts.length) { |
|
cur = parts.shift()+'.'+cur; |
|
permutations.push(cur); |
|
} |
|
return permutations; |
|
} |
|
|
|
// Gives the permutation of all possible pathMatch()es of a given path. The |
|
// array is in longest-to-shortest order. Handy for indexing. |
|
function permutePath(path) { |
|
if (path === '/') { |
|
return ['/']; |
|
} |
|
if (path.lastIndexOf('/') === path.length-1) { |
|
path = path.substr(0,path.length-1); |
|
} |
|
var permutations = [path]; |
|
while (path.length > 1) { |
|
var lindex = path.lastIndexOf('/'); |
|
if (lindex === 0) { |
|
break; |
|
} |
|
path = path.substr(0,lindex); |
|
permutations.push(path); |
|
} |
|
permutations.push('/'); |
|
return permutations; |
|
} |
|
|
|
|
|
function Cookie (opts) { |
|
if (typeof opts !== "object") { |
|
return; |
|
} |
|
Object.keys(opts).forEach(function (key) { |
|
if (Cookie.prototype.hasOwnProperty(key)) { |
|
this[key] = opts[key] || Cookie.prototype[key]; |
|
} |
|
}.bind(this)); |
|
} |
|
|
|
Cookie.parse = parse; |
|
Cookie.fromJSON = fromJSON; |
|
|
|
Cookie.prototype.key = ""; |
|
Cookie.prototype.value = ""; |
|
|
|
// the order in which the RFC has them: |
|
Cookie.prototype.expires = "Infinity"; // coerces to literal Infinity |
|
Cookie.prototype.maxAge = null; // takes precedence over expires for TTL |
|
Cookie.prototype.domain = null; |
|
Cookie.prototype.path = null; |
|
Cookie.prototype.secure = false; |
|
Cookie.prototype.httpOnly = false; |
|
Cookie.prototype.extensions = null; |
|
|
|
// set by the CookieJar: |
|
Cookie.prototype.hostOnly = null; // boolean when set |
|
Cookie.prototype.pathIsDefault = null; // boolean when set |
|
Cookie.prototype.creation = null; // Date when set; defaulted by Cookie.parse |
|
Cookie.prototype.lastAccessed = null; // Date when set |
|
|
|
var cookieProperties = Object.freeze(Object.keys(Cookie.prototype).map(function(p) { |
|
if (p instanceof Function) { |
|
return; |
|
} |
|
return p; |
|
})); |
|
var numCookieProperties = cookieProperties.length; |
|
|
|
Cookie.prototype.inspect = function inspect() { |
|
var now = Date.now(); |
|
return 'Cookie="'+this.toString() + |
|
'; hostOnly='+(this.hostOnly != null ? this.hostOnly : '?') + |
|
'; aAge='+(this.lastAccessed ? (now-this.lastAccessed.getTime())+'ms' : '?') + |
|
'; cAge='+(this.creation ? (now-this.creation.getTime())+'ms' : '?') + |
|
'"'; |
|
}; |
|
|
|
Cookie.prototype.validate = function validate() { |
|
if (!COOKIE_OCTETS.test(this.value)) { |
|
return false; |
|
} |
|
if (this.expires != Infinity && !(this.expires instanceof Date) && !parseDate(this.expires,true)) { |
|
return false; |
|
} |
|
if (this.maxAge != null && this.maxAge <= 0) { |
|
return false; // "Max-Age=" non-zero-digit *DIGIT |
|
} |
|
if (this.path != null && !PATH_VALUE.test(this.path)) { |
|
return false; |
|
} |
|
|
|
var cdomain = this.cdomain(); |
|
if (cdomain) { |
|
if (cdomain.match(/\.$/)) { |
|
return false; // S4.1.2.3 suggests that this is bad. domainMatch() tests confirm this |
|
} |
|
var suffix = pubsuffix.getPublicSuffix(cdomain); |
|
if (suffix == null) { // it's a public suffix |
|
return false; |
|
} |
|
} |
|
return true; |
|
}; |
|
|
|
Cookie.prototype.setExpires = function setExpires(exp) { |
|
if (exp instanceof Date) { |
|
this.expires = exp; |
|
} else { |
|
this.expires = parseDate(exp) || "Infinity"; |
|
} |
|
}; |
|
|
|
Cookie.prototype.setMaxAge = function setMaxAge(age) { |
|
if (age === Infinity || age === -Infinity) { |
|
this.maxAge = age.toString(); // so JSON.stringify() works |
|
} else { |
|
this.maxAge = age; |
|
} |
|
}; |
|
|
|
// gives Cookie header format |
|
Cookie.prototype.cookieString = function cookieString() { |
|
var val = this.value; |
|
if (val == null) { |
|
val = ''; |
|
} |
|
return this.key+'='+val; |
|
}; |
|
|
|
// gives Set-Cookie header format |
|
Cookie.prototype.toString = function toString() { |
|
var str = this.cookieString(); |
|
|
|
if (this.expires != Infinity) { |
|
if (this.expires instanceof Date) { |
|
str += '; Expires='+formatDate(this.expires); |
|
} else { |
|
str += '; Expires='+this.expires; |
|
} |
|
} |
|
|
|
if (this.maxAge != null && this.maxAge != Infinity) { |
|
str += '; Max-Age='+this.maxAge; |
|
} |
|
|
|
if (this.domain && !this.hostOnly) { |
|
str += '; Domain='+this.domain; |
|
} |
|
if (this.path) { |
|
str += '; Path='+this.path; |
|
} |
|
|
|
if (this.secure) { |
|
str += '; Secure'; |
|
} |
|
if (this.httpOnly) { |
|
str += '; HttpOnly'; |
|
} |
|
if (this.extensions) { |
|
this.extensions.forEach(function(ext) { |
|
str += '; '+ext; |
|
}); |
|
} |
|
|
|
return str; |
|
}; |
|
|
|
// TTL() partially replaces the "expiry-time" parts of S5.3 step 3 (setCookie() |
|
// elsewhere) |
|
// S5.3 says to give the "latest representable date" for which we use Infinity |
|
// For "expired" we use 0 |
|
Cookie.prototype.TTL = function TTL(now) { |
|
/* RFC6265 S4.1.2.2 If a cookie has both the Max-Age and the Expires |
|
* attribute, the Max-Age attribute has precedence and controls the |
|
* expiration date of the cookie. |
|
* (Concurs with S5.3 step 3) |
|
*/ |
|
if (this.maxAge != null) { |
|
return this.maxAge<=0 ? 0 : this.maxAge*1000; |
|
} |
|
|
|
var expires = this.expires; |
|
if (expires != Infinity) { |
|
if (!(expires instanceof Date)) { |
|
expires = parseDate(expires) || Infinity; |
|
} |
|
|
|
if (expires == Infinity) { |
|
return Infinity; |
|
} |
|
|
|
return expires.getTime() - (now || Date.now()); |
|
} |
|
|
|
return Infinity; |
|
}; |
|
|
|
// expiryTime() replaces the "expiry-time" parts of S5.3 step 3 (setCookie() |
|
// elsewhere) |
|
Cookie.prototype.expiryTime = function expiryTime(now) { |
|
if (this.maxAge != null) { |
|
var relativeTo = this.creation || now || new Date(); |
|
var age = (this.maxAge <= 0) ? -Infinity : this.maxAge*1000; |
|
return relativeTo.getTime() + age; |
|
} |
|
|
|
if (this.expires == Infinity) { |
|
return Infinity; |
|
} |
|
return this.expires.getTime(); |
|
}; |
|
|
|
// expiryDate() replaces the "expiry-time" parts of S5.3 step 3 (setCookie() |
|
// elsewhere), except it returns a Date |
|
Cookie.prototype.expiryDate = function expiryDate(now) { |
|
var millisec = this.expiryTime(now); |
|
if (millisec == Infinity) { |
|
return new Date(MAX_TIME); |
|
} else if (millisec == -Infinity) { |
|
return new Date(MIN_TIME); |
|
} else { |
|
return new Date(millisec); |
|
} |
|
}; |
|
|
|
// This replaces the "persistent-flag" parts of S5.3 step 3 |
|
Cookie.prototype.isPersistent = function isPersistent() { |
|
return (this.maxAge != null || this.expires != Infinity); |
|
}; |
|
|
|
// Mostly S5.1.2 and S5.2.3: |
|
Cookie.prototype.cdomain = |
|
Cookie.prototype.canonicalizedDomain = function canonicalizedDomain() { |
|
if (this.domain == null) { |
|
return null; |
|
} |
|
return canonicalDomain(this.domain); |
|
}; |
|
|
|
|
|
var memstore; |
|
function CookieJar(store, rejectPublicSuffixes) { |
|
if (rejectPublicSuffixes != null) { |
|
this.rejectPublicSuffixes = rejectPublicSuffixes; |
|
} |
|
|
|
if (!store) { |
|
memstore = memstore || require('./memstore'); |
|
store = new memstore.MemoryCookieStore(); |
|
} |
|
this.store = store; |
|
} |
|
CookieJar.prototype.store = null; |
|
CookieJar.prototype.rejectPublicSuffixes = true; |
|
var CAN_BE_SYNC = []; |
|
|
|
CAN_BE_SYNC.push('setCookie'); |
|
CookieJar.prototype.setCookie = function(cookie, url, options, cb) { |
|
var err; |
|
var context = (url instanceof Object) ? url : urlParse(url); |
|
if (options instanceof Function) { |
|
cb = options; |
|
options = {}; |
|
} |
|
|
|
var host = canonicalDomain(context.hostname); |
|
|
|
// S5.3 step 1 |
|
if (!(cookie instanceof Cookie)) { |
|
cookie = Cookie.parse(cookie, options.strict === true); |
|
} |
|
if (!cookie) { |
|
err = new Error("Cookie failed to parse"); |
|
return cb(options.ignoreError ? null : err); |
|
} |
|
|
|
// S5.3 step 2 |
|
var now = options.now || new Date(); // will assign later to save effort in the face of errors |
|
|
|
// S5.3 step 3: NOOP; persistent-flag and expiry-time is handled by getCookie() |
|
|
|
// S5.3 step 4: NOOP; domain is null by default |
|
|
|
// S5.3 step 5: public suffixes |
|
if (this.rejectPublicSuffixes && cookie.domain) { |
|
var suffix = pubsuffix.getPublicSuffix(cookie.cdomain()); |
|
if (suffix == null) { // e.g. "com" |
|
err = new Error("Cookie has domain set to a public suffix"); |
|
return cb(options.ignoreError ? null : err); |
|
} |
|
} |
|
|
|
// S5.3 step 6: |
|
if (cookie.domain) { |
|
if (!domainMatch(host, cookie.cdomain(), false)) { |
|
err = new Error("Cookie not in this host's domain. Cookie:"+cookie.cdomain()+" Request:"+host); |
|
return cb(options.ignoreError ? null : err); |
|
} |
|
|
|
if (cookie.hostOnly == null) { // don't reset if already set |
|
cookie.hostOnly = false; |
|
} |
|
|
|
} else { |
|
cookie.hostOnly = true; |
|
cookie.domain = host; |
|
} |
|
|
|
// S5.3 step 7: "Otherwise, set the cookie's path to the default-path of the |
|
// request-uri" |
|
if (!cookie.path) { |
|
cookie.path = defaultPath(context.pathname); |
|
cookie.pathIsDefault = true; |
|
} else { |
|
if (cookie.path.length > 1 && cookie.path.substr(-1) == '/') { |
|
cookie.path = cookie.path.slice(0,-1); |
|
} |
|
} |
|
|
|
// S5.3 step 8: NOOP; secure attribute |
|
// S5.3 step 9: NOOP; httpOnly attribute |
|
|
|
// S5.3 step 10 |
|
if (options.http === false && cookie.httpOnly) { |
|
err = new Error("Cookie is HttpOnly and this isn't an HTTP API"); |
|
return cb(options.ignoreError ? null : err); |
|
} |
|
|
|
var store = this.store; |
|
|
|
if (!store.updateCookie) { |
|
store.updateCookie = function(oldCookie, newCookie, cb) { |
|
this.putCookie(newCookie, cb); |
|
}; |
|
} |
|
|
|
function withCookie(err, oldCookie) { |
|
if (err) { |
|
return cb(err); |
|
} |
|
|
|
var next = function(err) { |
|
if (err) { |
|
return cb(err); |
|
} else { |
|
cb(null, cookie); |
|
} |
|
}; |
|
|
|
if (oldCookie) { |
|
// S5.3 step 11 - "If the cookie store contains a cookie with the same name, |
|
// domain, and path as the newly created cookie:" |
|
if (options.http === false && oldCookie.httpOnly) { // step 11.2 |
|
err = new Error("old Cookie is HttpOnly and this isn't an HTTP API"); |
|
return cb(options.ignoreError ? null : err); |
|
} |
|
cookie.creation = oldCookie.creation; // step 11.3 |
|
cookie.lastAccessed = now; |
|
// Step 11.4 (delete cookie) is implied by just setting the new one: |
|
store.updateCookie(oldCookie, cookie, next); // step 12 |
|
|
|
} else { |
|
cookie.creation = cookie.lastAccessed = now; |
|
store.putCookie(cookie, next); // step 12 |
|
} |
|
} |
|
|
|
store.findCookie(cookie.domain, cookie.path, cookie.key, withCookie); |
|
}; |
|
|
|
// RFC6365 S5.4 |
|
CAN_BE_SYNC.push('getCookies'); |
|
CookieJar.prototype.getCookies = function(url, options, cb) { |
|
var context = (url instanceof Object) ? url : urlParse(url); |
|
if (options instanceof Function) { |
|
cb = options; |
|
options = {}; |
|
} |
|
|
|
var host = canonicalDomain(context.hostname); |
|
var path = context.pathname || '/'; |
|
|
|
var secure = options.secure; |
|
if (secure == null && context.protocol && |
|
(context.protocol == 'https:' || context.protocol == 'wss:')) |
|
{ |
|
secure = true; |
|
} |
|
|
|
var http = options.http; |
|
if (http == null) { |
|
http = true; |
|
} |
|
|
|
var now = options.now || Date.now(); |
|
var expireCheck = options.expire !== false; |
|
var allPaths = !!options.allPaths; |
|
var store = this.store; |
|
|
|
function matchingCookie(c) { |
|
// "Either: |
|
// The cookie's host-only-flag is true and the canonicalized |
|
// request-host is identical to the cookie's domain. |
|
// Or: |
|
// The cookie's host-only-flag is false and the canonicalized |
|
// request-host domain-matches the cookie's domain." |
|
if (c.hostOnly) { |
|
if (c.domain != host) { |
|
return false; |
|
} |
|
} else { |
|
if (!domainMatch(host, c.domain, false)) { |
|
return false; |
|
} |
|
} |
|
|
|
// "The request-uri's path path-matches the cookie's path." |
|
if (!allPaths && !pathMatch(path, c.path)) { |
|
return false; |
|
} |
|
|
|
// "If the cookie's secure-only-flag is true, then the request-uri's |
|
// scheme must denote a "secure" protocol" |
|
if (c.secure && !secure) { |
|
return false; |
|
} |
|
|
|
// "If the cookie's http-only-flag is true, then exclude the cookie if the |
|
// cookie-string is being generated for a "non-HTTP" API" |
|
if (c.httpOnly && !http) { |
|
return false; |
|
} |
|
|
|
// deferred from S5.3 |
|
// non-RFC: allow retention of expired cookies by choice |
|
if (expireCheck && c.expiryTime() <= now) { |
|
store.removeCookie(c.domain, c.path, c.key, function(){}); // result ignored |
|
return false; |
|
} |
|
|
|
return true; |
|
} |
|
|
|
store.findCookies(host, allPaths ? null : path, function(err,cookies) { |
|
if (err) { |
|
return cb(err); |
|
} |
|
|
|
cookies = cookies.filter(matchingCookie); |
|
|
|
// sorting of S5.4 part 2 |
|
if (options.sort !== false) { |
|
cookies = cookies.sort(cookieCompare); |
|
} |
|
|
|
// S5.4 part 3 |
|
var now = new Date(); |
|
cookies.forEach(function(c) { |
|
c.lastAccessed = now; |
|
}); |
|
// TODO persist lastAccessed |
|
|
|
cb(null,cookies); |
|
}); |
|
}; |
|
|
|
CAN_BE_SYNC.push('getCookieString'); |
|
CookieJar.prototype.getCookieString = function(/*..., cb*/) { |
|
var args = Array.prototype.slice.call(arguments,0); |
|
var cb = args.pop(); |
|
var next = function(err,cookies) { |
|
if (err) { |
|
cb(err); |
|
} else { |
|
cb(null, cookies.map(function(c){ |
|
return c.cookieString(); |
|
}).join('; ')); |
|
} |
|
}; |
|
args.push(next); |
|
this.getCookies.apply(this,args); |
|
}; |
|
|
|
CAN_BE_SYNC.push('getSetCookieStrings'); |
|
CookieJar.prototype.getSetCookieStrings = function(/*..., cb*/) { |
|
var args = Array.prototype.slice.call(arguments,0); |
|
var cb = args.pop(); |
|
var next = function(err,cookies) { |
|
if (err) { |
|
cb(err); |
|
} else { |
|
cb(null, cookies.map(function(c){ |
|
return c.toString(); |
|
})); |
|
} |
|
}; |
|
args.push(next); |
|
this.getCookies.apply(this,args); |
|
}; |
|
|
|
// Use a closure to provide a true imperative API for synchronous stores. |
|
function syncWrap(method) { |
|
return function() { |
|
if (!this.store.synchronous) { |
|
throw new Error('CookieJar store is not synchronous; use async API instead.'); |
|
} |
|
|
|
var args = Array.prototype.slice.call(arguments); |
|
var syncErr, syncResult; |
|
args.push(function syncCb(err, result) { |
|
syncErr = err; |
|
syncResult = result; |
|
}); |
|
this[method].apply(this, args); |
|
|
|
if (syncErr) { |
|
throw syncErr; |
|
} |
|
return syncResult; |
|
}; |
|
} |
|
|
|
// wrap all declared CAN_BE_SYNC methods in the sync wrapper |
|
CAN_BE_SYNC.forEach(function(method) { |
|
CookieJar.prototype[method+'Sync'] = syncWrap(method); |
|
}); |
|
|
|
module.exports = { |
|
CookieJar: CookieJar, |
|
Cookie: Cookie, |
|
Store: Store, |
|
parseDate: parseDate, |
|
formatDate: formatDate, |
|
parse: parse, |
|
fromJSON: fromJSON, |
|
domainMatch: domainMatch, |
|
defaultPath: defaultPath, |
|
pathMatch: pathMatch, |
|
getPublicSuffix: pubsuffix.getPublicSuffix, |
|
cookieCompare: cookieCompare, |
|
permuteDomain: permuteDomain, |
|
permutePath: permutePath, |
|
canonicalDomain: canonicalDomain, |
|
}; |
|
|
|
},{"./memstore":134,"./pubsuffix":135,"./store":136,"net":156,"punycode":324,"url":341}],134:[function(require,module,exports){ |
|
'use strict'; |
|
var tough = require('./cookie'); |
|
var Store = require('./store').Store; |
|
var permuteDomain = tough.permuteDomain; |
|
var permutePath = tough.permutePath; |
|
var util = require('util'); |
|
|
|
function MemoryCookieStore() { |
|
Store.call(this); |
|
this.idx = {}; |
|
} |
|
util.inherits(MemoryCookieStore, Store); |
|
exports.MemoryCookieStore = MemoryCookieStore; |
|
MemoryCookieStore.prototype.idx = null; |
|
MemoryCookieStore.prototype.synchronous = true; |
|
|
|
// force a default depth: |
|
MemoryCookieStore.prototype.inspect = function() { |
|
return "{ idx: "+util.inspect(this.idx, false, 2)+' }'; |
|
}; |
|
|
|
MemoryCookieStore.prototype.findCookie = function(domain, path, key, cb) { |
|
if (!this.idx[domain]) { |
|
return cb(null,undefined); |
|
} |
|
if (!this.idx[domain][path]) { |
|
return cb(null,undefined); |
|
} |
|
return cb(null,this.idx[domain][path][key]||null); |
|
}; |
|
|
|
MemoryCookieStore.prototype.findCookies = function(domain, path, cb) { |
|
var results = []; |
|
if (!domain) { |
|
return cb(null,[]); |
|
} |
|
|
|
var pathMatcher; |
|
if (!path) { |
|
// null or '/' means "all paths" |
|
pathMatcher = function matchAll(domainIndex) { |
|
for (var curPath in domainIndex) { |
|
var pathIndex = domainIndex[curPath]; |
|
for (var key in pathIndex) { |
|
results.push(pathIndex[key]); |
|
} |
|
} |
|
}; |
|
|
|
} else if (path === '/') { |
|
pathMatcher = function matchSlash(domainIndex) { |
|
var pathIndex = domainIndex['/']; |
|
if (!pathIndex) { |
|
return; |
|
} |
|
for (var key in pathIndex) { |
|
results.push(pathIndex[key]); |
|
} |
|
}; |
|
|
|
} else { |
|
var paths = permutePath(path) || [path]; |
|
pathMatcher = function matchRFC(domainIndex) { |
|
paths.forEach(function(curPath) { |
|
var pathIndex = domainIndex[curPath]; |
|
if (!pathIndex) { |
|
return; |
|
} |
|
for (var key in pathIndex) { |
|
results.push(pathIndex[key]); |
|
} |
|
}); |
|
}; |
|
} |
|
|
|
var domains = permuteDomain(domain) || [domain]; |
|
var idx = this.idx; |
|
domains.forEach(function(curDomain) { |
|
var domainIndex = idx[curDomain]; |
|
if (!domainIndex) { |
|
return; |
|
} |
|
pathMatcher(domainIndex); |
|
}); |
|
|
|
cb(null,results); |
|
}; |
|
|
|
MemoryCookieStore.prototype.putCookie = function(cookie, cb) { |
|
if (!this.idx[cookie.domain]) { |
|
this.idx[cookie.domain] = {}; |
|
} |
|
if (!this.idx[cookie.domain][cookie.path]) { |
|
this.idx[cookie.domain][cookie.path] = {}; |
|
} |
|
this.idx[cookie.domain][cookie.path][cookie.key] = cookie; |
|
cb(null); |
|
}; |
|
|
|
MemoryCookieStore.prototype.updateCookie = function updateCookie(oldCookie, newCookie, cb) { |
|
// updateCookie() may avoid updating cookies that are identical. For example, |
|
// lastAccessed may not be important to some stores and an equality |
|
// comparison could exclude that field. |
|
this.putCookie(newCookie,cb); |
|
}; |
|
|
|
MemoryCookieStore.prototype.removeCookie = function removeCookie(domain, path, key, cb) { |
|
if (this.idx[domain] && this.idx[domain][path] && this.idx[domain][path][key]) { |
|
delete this.idx[domain][path][key]; |
|
} |
|
cb(null); |
|
}; |
|
|
|
MemoryCookieStore.prototype.removeCookies = function removeCookies(domain, path, cb) { |
|
if (this.idx[domain]) { |
|
if (path) { |
|
delete this.idx[domain][path]; |
|
} else { |
|
delete this.idx[domain]; |
|
} |
|
} |
|
return cb(null); |
|
}; |
|
|
|
},{"./cookie":133,"./store":136,"util":343}],135:[function(require,module,exports){ |
|
/**************************************************** |
|
* AUTOMATICALLY GENERATED by generate-pubsuffix.js * |
|
* DO NOT EDIT! * |
|
****************************************************/ |
|
|
|
module.exports.getPublicSuffix = function getPublicSuffix(domain) { |
|
/* |
|
* Copyright GoInstant, Inc. and other contributors. All rights reserved. |
|
* Permission is hereby granted, free of charge, to any person obtaining a copy |
|
* of this software and associated documentation files (the "Software"), to |
|
* deal in the Software without restriction, including without limitation the |
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
|
* sell copies of the Software, and to permit persons to whom the Software is |
|
* furnished to do so, subject to the following conditions: |
|
* |
|
* The above copyright notice and this permission notice shall be included in |
|
* all copies or substantial portions of the Software. |
|
* |
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS |
|
* IN THE SOFTWARE. |
|
*/ |
|
if (!domain) return null; |
|
if (domain.match(/^\./)) return null; |
|
|
|
domain = domain.toLowerCase(); |
|
var parts = domain.split('.').reverse(); |
|
|
|
var suffix = ''; |
|
var suffixLen = 0; |
|
for (var i=0; i<parts.length; i++) { |
|
var part = parts[i]; |
|
var starstr = '*'+suffix; |
|
var partstr = part+suffix; |
|
|
|
if (index[starstr]) { // star rule matches |
|
suffixLen = i+1; |
|
if (index[partstr] === false) { // exception rule matches (NB: false, not undefined) |
|
suffixLen--; |
|
} |
|
} else if (index[partstr]) { // exact match, not exception |
|
suffixLen = i+1; |
|
} |
|
|
|
suffix = '.'+part+suffix; |
|
} |
|
|
|
if (index['*'+suffix]) { // *.domain exists (e.g. *.kyoto.jp for domain='kyoto.jp'); |
|
return null; |
|
} |
|
|
|
if (suffixLen && parts.length > suffixLen) { |
|
return parts.slice(0,suffixLen+1).reverse().join('.'); |
|
} |
|
|
|
return null; |
|
}; |
|
|
|
// The following generated structure is used under the MPL version 1.1 |
|
// See public-suffix.txt for more information |
|
|
|
var index = module.exports.index = Object.freeze( |
|
{"ac":true,"com.ac":true,"edu.ac":true,"gov.ac":true,"net.ac":true,"mil.ac":true,"org.ac":true,"ad":true,"nom.ad":true,"ae":true,"co.ae":true,"net.ae":true,"org.ae":true,"sch.ae":true,"ac.ae":true,"gov.ae":true,"mil.ae":true,"aero":true,"accident-investigation.aero":true,"accident-prevention.aero":true,"aerobatic.aero":true,"aeroclub.aero":true,"aerodrome.aero":true,"agents.aero":true,"aircraft.aero":true,"airline.aero":true,"airport.aero":true,"air-surveillance.aero":true,"airtraffic.aero":true,"air-traffic-control.aero":true,"ambulance.aero":true,"amusement.aero":true,"association.aero":true,"author.aero":true,"ballooning.aero":true,"broker.aero":true,"caa.aero":true,"cargo.aero":true,"catering.aero":true,"certification.aero":true,"championship.aero":true,"charter.aero":true,"civilaviation.aero":true,"club.aero":true,"conference.aero":true,"consultant.aero":true,"consulting.aero":true,"control.aero":true,"council.aero":true,"crew.aero":true,"design.aero":true,"dgca.aero":true,"educator.aero":true,"emergency.aero":true,"engine.aero":true,"engineer.aero":true,"entertainment.aero":true,"equipment.aero":true,"exchange.aero":true,"express.aero":true,"federation.aero":true,"flight.aero":true,"freight.aero":true,"fuel.aero":true,"gliding.aero":true,"government.aero":true,"groundhandling.aero":true,"group.aero":true,"hanggliding.aero":true,"homebuilt.aero":true,"insurance.aero":true,"journal.aero":true,"journalist.aero":true,"leasing.aero":true,"logistics.aero":true,"magazine.aero":true,"maintenance.aero":true,"marketplace.aero":true,"media.aero":true,"microlight.aero":true,"modelling.aero":true,"navigation.aero":true,"parachuting.aero":true,"paragliding.aero":true,"passenger-association.aero":true,"pilot.aero":true,"press.aero":true,"production.aero":true,"recreation.aero":true,"repbody.aero":true,"res.aero":true,"research.aero":true,"rotorcraft.aero":true,"safety.aero":true,"scientist.aero":true,"services.aero":true,"show.aero":true,"skydiving.aero":true,"software.aero":true,"student.aero":true,"taxi.aero":true,"trader.aero":true,"trading.aero":true,"trainer.aero":true,"union.aero":true,"workinggroup.aero":true,"works.aero":true,"af":true,"gov.af":true,"com.af":true,"org.af":true,"net.af":true,"edu.af":true,"ag":true,"com.ag":true,"org.ag":true,"net.ag":true,"co.ag":true,"nom.ag":true,"ai":true,"off.ai":true,"com.ai":true,"net.ai":true,"org.ai":true,"al":true,"com.al":true,"edu.al":true,"gov.al":true,"mil.al":true,"net.al":true,"org.al":true,"am":true,"an":true,"com.an":true,"net.an":true,"org.an":true,"edu.an":true,"ao":true,"ed.ao":true,"gv.ao":true,"og.ao":true,"co.ao":true,"pb.ao":true,"it.ao":true,"aq":true,"*.ar":true,"congresodelalengua3.ar":false,"educ.ar":false,"gobiernoelectronico.ar":false,"mecon.ar":false,"nacion.ar":false,"nic.ar":false,"promocion.ar":false,"retina.ar":false,"uba.ar":false,"e164.arpa":true,"in-addr.arpa":true,"ip6.arpa":true,"iris.arpa":true,"uri.arpa":true,"urn.arpa":true,"as":true,"gov.as":true,"asia":true,"at":true,"ac.at":true,"co.at":true,"gv.at":true,"or.at":true,"com.au":true,"net.au":true,"org.au":true,"edu.au":true,"gov.au":true,"csiro.au":true,"asn.au":true,"id.au":true,"info.au":true,"conf.au":true,"oz.au":true,"act.au":true,"nsw.au":true,"nt.au":true,"qld.au":true,"sa.au":true,"tas.au":true,"vic.au":true,"wa.au":true,"act.edu.au":true,"nsw.edu.au":true,"nt.edu.au":true,"qld.edu.au":true,"sa.edu.au":true,"tas.edu.au":true,"vic.edu.au":true,"wa.edu.au":true,"act.gov.au":true,"nt.gov.au":true,"qld.gov.au":true,"sa.gov.au":true,"tas.gov.au":true,"vic.gov.au":true,"wa.gov.au":true,"aw":true,"com.aw":true,"ax":true,"az":true,"com.az":true,"net.az":true,"int.az":true,"gov.az":true,"org.az":true,"edu.az":true,"info.az":true,"pp.az":true,"mil.az":true,"name.az":true,"pro.az":true,"biz.az":true,"ba":true,"org.ba":true,"net.ba":true,"edu.ba":true,"gov.ba":true,"mil.ba":true,"unsa.ba":true,"unbi.ba":true,"co.ba":true,"com.ba":true,"rs.ba":true,"bb":true,"biz.bb":true,"com.bb":true,"edu.bb":true,"gov.bb":true,"info.bb":true,"net.bb":true,"org.bb":true,"store.bb":true,"*.bd":true,"be":true,"ac.be":true,"bf":true,"gov.bf":true,"bg":true,"a.bg":true,"b.bg":true,"c.bg":true,"d.bg":true,"e.bg":true,"f.bg":true,"g.bg":true,"h.bg":true,"i.bg":true,"j.bg":true,"k.bg":true,"l.bg":true,"m.bg":true,"n.bg":true,"o.bg":true,"p.bg":true,"q.bg":true,"r.bg":true,"s.bg":true,"t.bg":true,"u.bg":true,"v.bg":true,"w.bg":true,"x.bg":true,"y.bg":true,"z.bg":true,"0.bg":true,"1.bg":true,"2.bg":true,"3.bg":true,"4.bg":true,"5.bg":true,"6.bg":true,"7.bg":true,"8.bg":true,"9.bg":true,"bh":true,"com.bh":true,"edu.bh":true,"net.bh":true,"org.bh":true,"gov.bh":true,"bi":true,"co.bi":true,"com.bi":true,"edu.bi":true,"or.bi":true,"org.bi":true,"biz":true,"bj":true,"asso.bj":true,"barreau.bj":true,"gouv.bj":true,"bm":true,"com.bm":true,"edu.bm":true,"gov.bm":true,"net.bm":true,"org.bm":true,"*.bn":true,"bo":true,"com.bo":true,"edu.bo":true,"gov.bo":true,"gob.bo":true,"int.bo":true,"org.bo":true,"net.bo":true,"mil.bo":true,"tv.bo":true,"br":true,"adm.br":true,"adv.br":true,"agr.br":true,"am.br":true,"arq.br":true,"art.br":true,"ato.br":true,"b.br":true,"bio.br":true,"blog.br":true,"bmd.br":true,"can.br":true,"cim.br":true,"cng.br":true,"cnt.br":true,"com.br":true,"coop.br":true,"ecn.br":true,"edu.br":true,"emp.br":true,"eng.br":true,"esp.br":true,"etc.br":true,"eti.br":true,"far.br":true,"flog.br":true,"fm.br":true,"fnd.br":true,"fot.br":true,"fst.br":true,"g12.br":true,"ggf.br":true,"gov.br":true,"imb.br":true,"ind.br":true,"inf.br":true,"jor.br":true,"jus.br":true,"lel.br":true,"mat.br":true,"med.br":true,"mil.br":true,"mus.br":true,"net.br":true,"nom.br":true,"not.br":true,"ntr.br":true,"odo.br":true,"org.br":true,"ppg.br":true,"pro.br":true,"psc.br":true,"psi.br":true,"qsl.br":true,"radio.br":true,"rec.br":true,"slg.br":true,"srv.br":true,"taxi.br":true,"teo.br":true,"tmp.br":true,"trd.br":true,"tur.br":true,"tv.br":true,"vet.br":true,"vlog.br":true,"wiki.br":true,"zlg.br":true,"bs":true,"com.bs":true,"net.bs":true,"org.bs":true,"edu.bs":true,"gov.bs":true,"bt":true,"com.bt":true,"edu.bt":true,"gov.bt":true,"net.bt":true,"org.bt":true,"bw":true,"co.bw":true,"org.bw":true,"by":true,"gov.by":true,"mil.by":true,"com.by":true,"of.by":true,"bz":true,"com.bz":true,"net.bz":true,"org.bz":true,"edu.bz":true,"gov.bz":true,"ca":true,"ab.ca":true,"bc.ca":true,"mb.ca":true,"nb.ca":true,"nf.ca":true,"nl.ca":true,"ns.ca":true,"nt.ca":true,"nu.ca":true,"on.ca":true,"pe.ca":true,"qc.ca":true,"sk.ca":true,"yk.ca":true,"gc.ca":true,"cat":true,"cc":true,"cd":true,"gov.cd":true,"cf":true,"cg":true,"ch":true,"ci":true,"org.ci":true,"or.ci":true,"com.ci":true,"co.ci":true,"edu.ci":true,"ed.ci":true,"ac.ci":true,"net.ci":true,"go.ci":true,"asso.ci":true,"xn--aroport-bya.ci":true,"int.ci":true,"presse.ci":true,"md.ci":true,"gouv.ci":true,"*.ck":true,"www.ck":false,"cl":true,"gov.cl":true,"gob.cl":true,"co.cl":true,"mil.cl":true,"cm":true,"gov.cm":true,"cn":true,"ac.cn":true,"com.cn":true,"edu.cn":true,"gov.cn":true,"net.cn":true,"org.cn":true,"mil.cn":true,"xn--55qx5d.cn":true,"xn--io0a7i.cn":true,"xn--od0alg.cn":true,"ah.cn":true,"bj.cn":true,"cq.cn":true,"fj.cn":true,"gd.cn":true,"gs.cn":true,"gz.cn":true,"gx.cn":true,"ha.cn":true,"hb.cn":true,"he.cn":true,"hi.cn":true,"hl.cn":true,"hn.cn":true,"jl.cn":true,"js.cn":true,"jx.cn":true,"ln.cn":true,"nm.cn":true,"nx.cn":true,"qh.cn":true,"sc.cn":true,"sd.cn":true,"sh.cn":true,"sn.cn":true,"sx.cn":true,"tj.cn":true,"xj.cn":true,"xz.cn":true,"yn.cn":true,"zj.cn":true,"hk.cn":true,"mo.cn":true,"tw.cn":true,"co":true,"arts.co":true,"com.co":true,"edu.co":true,"firm.co":true,"gov.co":true,"info.co":true,"int.co":true,"mil.co":true,"net.co":true,"nom.co":true,"org.co":true,"rec.co":true,"web.co":true,"com":true,"coop":true,"cr":true,"ac.cr":true,"co.cr":true,"ed.cr":true,"fi.cr":true,"go.cr":true,"or.cr":true,"sa.cr":true,"cu":true,"com.cu":true,"edu.cu":true,"org.cu":true,"net.cu":true,"gov.cu":true,"inf.cu":true,"cv":true,"cx":true,"gov.cx":true,"*.cy":true,"cz":true,"de":true,"dj":true,"dk":true,"dm":true,"com.dm":true,"net.dm":true,"org.dm":true,"edu.dm":true,"gov.dm":true,"do":true,"art.do":true,"com.do":true,"edu.do":true,"gob.do":true,"gov.do":true,"mil.do":true,"net.do":true,"org.do":true,"sld.do":true,"web.do":true,"dz":true,"com.dz":true,"org.dz":true,"net.dz":true,"gov.dz":true,"edu.dz":true,"asso.dz":true,"pol.dz":true,"art.dz":true,"ec":true,"com.ec":true,"info.ec":true,"net.ec":true,"fin.ec":true,"k12.ec":true,"med.ec":true,"pro.ec":true,"org.ec":true,"edu.ec":true,"gov.ec":true,"gob.ec":true,"mil.ec":true,"edu":true,"ee":true,"edu.ee":true,"gov.ee":true,"riik.ee":true,"lib.ee":true,"med.ee":true,"com.ee":true,"pri.ee":true,"aip.ee":true,"org.ee":true,"fie.ee":true,"eg":true,"com.eg":true,"edu.eg":true,"eun.eg":true,"gov.eg":true,"mil.eg":true,"name.eg":true,"net.eg":true,"org.eg":true,"sci.eg":true,"*.er":true,"es":true,"com.es":true,"nom.es":true,"org.es":true,"gob.es":true,"edu.es":true,"*.et":true,"eu":true,"fi":true,"aland.fi":true,"*.fj":true,"*.fk":true,"fm":true,"fo":true,"fr":true,"com.fr":true,"asso.fr":true,"nom.fr":true,"prd.fr":true,"presse.fr":true,"tm.fr":true,"aeroport.fr":true,"assedic.fr":true,"avocat.fr":true,"avoues.fr":true,"cci.fr":true,"chambagri.fr":true,"chirurgiens-dentistes.fr":true,"experts-comptables.fr":true,"geometre-expert.fr":true,"gouv.fr":true,"greta.fr":true,"huissier-justice.fr":true,"medecin.fr":true,"notaires.fr":true,"pharmacien.fr":true,"port.fr":true,"veterinaire.fr":true,"ga":true,"gd":true,"ge":true,"com.ge":true,"edu.ge":true,"gov.ge":true,"org.ge":true,"mil.ge":true,"net.ge":true,"pvt.ge":true,"gf":true,"gg":true,"co.gg":true,"org.gg":true,"net.gg":true,"sch.gg":true,"gov.gg":true,"gh":true,"com.gh":true,"edu.gh":true,"gov.gh":true,"org.gh":true,"mil.gh":true,"gi":true,"com.gi":true,"ltd.gi":true,"gov.gi":true,"mod.gi":true,"edu.gi":true,"org.gi":true,"gl":true,"gm":true,"ac.gn":true,"com.gn":true,"edu.gn":true,"gov.gn":true,"org.gn":true,"net.gn":true,"gov":true,"gp":true,"com.gp":true,"net.gp":true,"mobi.gp":true,"edu.gp":true,"org.gp":true,"asso.gp":true,"gq":true,"gr":true,"com.gr":true,"edu.gr":true,"net.gr":true,"org.gr":true,"gov.gr":true,"gs":true,"*.gt":true,"www.gt":false,"*.gu":true,"gw":true,"gy":true,"co.gy":true,"com.gy":true,"net.gy":true,"hk":true,"com.hk":true,"edu.hk":true,"gov.hk":true,"idv.hk":true,"net.hk":true,"org.hk":true,"xn--55qx5d.hk":true,"xn--wcvs22d.hk":true,"xn--lcvr32d.hk":true,"xn--mxtq1m.hk":true,"xn--gmqw5a.hk":true,"xn--ciqpn.hk":true,"xn--gmq050i.hk":true,"xn--zf0avx.hk":true,"xn--io0a7i.hk":true,"xn--mk0axi.hk":true,"xn--od0alg.hk":true,"xn--od0aq3b.hk":true,"xn--tn0ag.hk":true,"xn--uc0atv.hk":true,"xn--uc0ay4a.hk":true,"hm":true,"hn":true,"com.hn":true,"edu.hn":true,"org.hn":true,"net.hn":true,"mil.hn":true,"gob.hn":true,"hr":true,"iz.hr":true,"from.hr":true,"name.hr":true,"com.hr":true,"ht":true,"com.ht":true,"shop.ht":true,"firm.ht":true,"info.ht":true,"adult.ht":true,"net.ht":true,"pro.ht":true,"org.ht":true,"med.ht":true,"art.ht":true,"coop.ht":true,"pol.ht":true,"asso.ht":true,"edu.ht":true,"rel.ht":true,"gouv.ht":true,"perso.ht":true,"hu":true,"co.hu":true,"info.hu":true,"org.hu":true,"priv.hu":true,"sport.hu":true,"tm.hu":true,"2000.hu":true,"agrar.hu":true,"bolt.hu":true,"casino.hu":true,"city.hu":true,"erotica.hu":true,"erotika.hu":true,"film.hu":true,"forum.hu":true,"games.hu":true,"hotel.hu":true,"ingatlan.hu":true,"jogasz.hu":true,"konyvelo.hu":true,"lakas.hu":true,"media.hu":true,"news.hu":true,"reklam.hu":true,"sex.hu":true,"shop.hu":true,"suli.hu":true,"szex.hu":true,"tozsde.hu":true,"utazas.hu":true,"video.hu":true,"id":true,"ac.id":true,"co.id":true,"go.id":true,"mil.id":true,"net.id":true,"or.id":true,"sch.id":true,"web.id":true,"ie":true,"gov.ie":true,"*.il":true,"im":true,"co.im":true,"ltd.co.im":true,"plc.co.im":true,"net.im":true,"gov.im":true,"org.im":true,"nic.im":true,"ac.im":true,"in":true,"co.in":true,"firm.in":true,"net.in":true,"org.in":true,"gen.in":true,"ind.in":true,"nic.in":true,"ac.in":true,"edu.in":true,"res.in":true,"gov.in":true,"mil.in":true,"info":true,"int":true,"eu.int":true,"io":true,"com.io":true,"iq":true,"gov.iq":true,"edu.iq":true,"mil.iq":true,"com.iq":true,"org.iq":true,"net.iq":true,"ir":true,"ac.ir":true,"co.ir":true,"gov.ir":true,"id.ir":true,"net.ir":true,"org.ir":true,"sch.ir":true,"xn--mgba3a4f16a.ir":true,"xn--mgba3a4fra.ir":true,"is":true,"net.is":true,"com.is":true,"edu.is":true,"gov.is":true,"org.is":true,"int.is":true,"it":true,"gov.it":true,"edu.it":true,"agrigento.it":true,"ag.it":true,"alessandria.it":true,"al.it":true,"ancona.it":true,"an.it":true,"aosta.it":true,"aoste.it":true,"ao.it":true,"arezzo.it":true,"ar.it":true,"ascoli-piceno.it":true,"ascolipiceno.it":true,"ap.it":true,"asti.it":true,"at.it":true,"avellino.it":true,"av.it":true,"bari.it":true,"ba.it":true,"andria-barletta-trani.it":true,"andriabarlettatrani.it":true,"trani-barletta-andria.it":true,"tranibarlettaandria.it":true,"barletta-trani-andria.it":true,"barlettatraniandria.it":true,"andria-trani-barletta.it":true,"andriatranibarletta.it":true,"trani-andria-barletta.it":true,"traniandriabarletta.it":true,"bt.it":true,"belluno.it":true,"bl.it":true,"benevento.it":true,"bn.it":true,"bergamo.it":true,"bg.it":true,"biella.it":true,"bi.it":true,"bologna.it":true,"bo.it":true,"bolzano.it":true,"bozen.it":true,"balsan.it":true,"alto-adige.it":true,"altoadige.it":true,"suedtirol.it":true,"bz.it":true,"brescia.it":true,"bs.it":true,"brindisi.it":true,"br.it":true,"cagliari.it":true,"ca.it":true,"caltanissetta.it":true,"cl.it":true,"campobasso.it":true,"cb.it":true,"carboniaiglesias.it":true,"carbonia-iglesias.it":true,"iglesias-carbonia.it":true,"iglesiascarbonia.it":true,"ci.it":true,"caserta.it":true,"ce.it":true,"catania.it":true,"ct.it":true,"catanzaro.it":true,"cz.it":true,"chieti.it":true,"ch.it":true,"como.it":true,"co.it":true,"cosenza.it":true,"cs.it":true,"cremona.it":true,"cr.it":true,"crotone.it":true,"kr.it":true,"cuneo.it":true,"cn.it":true,"dell-ogliastra.it":true,"dellogliastra.it":true,"ogliastra.it":true,"og.it":true,"enna.it":true,"en.it":true,"ferrara.it":true,"fe.it":true,"fermo.it":true,"fm.it":true,"firenze.it":true,"florence.it":true,"fi.it":true,"foggia.it":true,"fg.it":true,"forli-cesena.it":true,"forlicesena.it":true,"cesena-forli.it":true,"cesenaforli.it":true,"fc.it":true,"frosinone.it":true,"fr.it":true,"genova.it":true,"genoa.it":true,"ge.it":true,"gorizia.it":true,"go.it":true,"grosseto.it":true,"gr.it":true,"imperia.it":true,"im.it":true,"isernia.it":true,"is.it":true,"laquila.it":true,"aquila.it":true,"aq.it":true,"la-spezia.it":true,"laspezia.it":true,"sp.it":true,"latina.it":true,"lt.it":true,"lecce.it":true,"le.it":true,"lecco.it":true,"lc.it":true,"livorno.it":true,"li.it":true,"lodi.it":true,"lo.it":true,"lucca.it":true,"lu.it":true,"macerata.it":true,"mc.it":true,"mantova.it":true,"mn.it":true,"massa-carrara.it":true,"massacarrara.it":true,"carrara-massa.it":true,"carraramassa.it":true,"ms.it":true,"matera.it":true,"mt.it":true,"medio-campidano.it":true,"mediocampidano.it":true,"campidano-medio.it":true,"campidanomedio.it":true,"vs.it":true,"messina.it":true,"me.it":true,"milano.it":true,"milan.it":true,"mi.it":true,"modena.it":true,"mo.it":true,"monza.it":true,"monza-brianza.it":true,"monzabrianza.it":true,"monzaebrianza.it":true,"monzaedellabrianza.it":true,"monza-e-della-brianza.it":true,"mb.it":true,"napoli.it":true,"naples.it":true,"na.it":true,"novara.it":true,"no.it":true,"nuoro.it":true,"nu.it":true,"oristano.it":true,"or.it":true,"padova.it":true,"padua.it":true,"pd.it":true,"palermo.it":true,"pa.it":true,"parma.it":true,"pr.it":true,"pavia.it":true,"pv.it":true,"perugia.it":true,"pg.it":true,"pescara.it":true,"pe.it":true,"pesaro-urbino.it":true,"pesarourbino.it":true,"urbino-pesaro.it":true,"urbinopesaro.it":true,"pu.it":true,"piacenza.it":true,"pc.it":true,"pisa.it":true,"pi.it":true,"pistoia.it":true,"pt.it":true,"pordenone.it":true,"pn.it":true,"potenza.it":true,"pz.it":true,"prato.it":true,"po.it":true,"ragusa.it":true,"rg.it":true,"ravenna.it":true,"ra.it":true,"reggio-calabria.it":true,"reggiocalabria.it":true,"rc.it":true,"reggio-emilia.it":true,"reggioemilia.it":true,"re.it":true,"rieti.it":true,"ri.it":true,"rimini.it":true,"rn.it":true,"roma.it":true,"rome.it":true,"rm.it":true,"rovigo.it":true,"ro.it":true,"salerno.it":true,"sa.it":true,"sassari.it":true,"ss.it":true,"savona.it":true,"sv.it":true,"siena.it":true,"si.it":true,"siracusa.it":true,"sr.it":true,"sondrio.it":true,"so.it":true,"taranto.it":true,"ta.it":true,"tempio-olbia.it":true,"tempioolbia.it":true,"olbia-tempio.it":true,"olbiatempio.it":true,"ot.it":true,"teramo.it":true,"te.it":true,"terni.it":true,"tr.it":true,"torino.it":true,"turin.it":true,"to.it":true,"trapani.it":true,"tp.it":true,"trento.it":true,"trentino.it":true,"tn.it":true,"treviso.it":true,"tv.it":true,"trieste.it":true,"ts.it":true,"udine.it":true,"ud.it":true,"varese.it":true,"va.it":true,"venezia.it":true,"venice.it":true,"ve.it":true,"verbania.it":true,"vb.it":true,"vercelli.it":true,"vc.it":true,"verona.it":true,"vr.it":true,"vibo-valentia.it":true,"vibovalentia.it":true,"vv.it":true,"vicenza.it":true,"vi.it":true,"viterbo.it":true,"vt.it":true,"je":true,"co.je":true,"org.je":true,"net.je":true,"sch.je":true,"gov.je":true,"*.jm":true,"jo":true,"com.jo":true,"org.jo":true,"net.jo":true,"edu.jo":true,"sch.jo":true,"gov.jo":true,"mil.jo":true,"name.jo":true,"jobs":true,"jp":true,"ac.jp":true,"ad.jp":true,"co.jp":true,"ed.jp":true,"go.jp":true,"gr.jp":true,"lg.jp":true,"ne.jp":true,"or.jp":true,"*.aichi.jp":true,"*.akita.jp":true,"*.aomori.jp":true,"*.chiba.jp":true,"*.ehime.jp":true,"*.fukui.jp":true,"*.fukuoka.jp":true,"*.fukushima.jp":true,"*.gifu.jp":true,"*.gunma.jp":true,"*.hiroshima.jp":true,"*.hokkaido.jp":true,"*.hyogo.jp":true,"*.ibaraki.jp":true,"*.ishikawa.jp":true,"*.iwate.jp":true,"*.kagawa.jp":true,"*.kagoshima.jp":true,"*.kanagawa.jp":true,"*.kawasaki.jp":true,"*.kitakyushu.jp":true,"*.kobe.jp":true,"*.kochi.jp":true,"*.kumamoto.jp":true,"*.kyoto.jp":true,"*.mie.jp":true,"*.miyagi.jp":true,"*.miyazaki.jp":true,"*.nagano.jp":true,"*.nagasaki.jp":true,"*.nagoya.jp":true,"*.nara.jp":true,"*.niigata.jp":true,"*.oita.jp":true,"*.okayama.jp":true,"*.okinawa.jp":true,"*.osaka.jp":true,"*.saga.jp":true,"*.saitama.jp":true,"*.sapporo.jp":true,"*.sendai.jp":true,"*.shiga.jp":true,"*.shimane.jp":true,"*.shizuoka.jp":true,"*.tochigi.jp":true,"*.tokushima.jp":true,"*.tokyo.jp":true,"*.tottori.jp":true,"*.toyama.jp":true,"*.wakayama.jp":true,"*.yamagata.jp":true,"*.yamaguchi.jp":true,"*.yamanashi.jp":true,"*.yokohama.jp":true,"metro.tokyo.jp":false,"pref.aichi.jp":false,"pref.akita.jp":false,"pref.aomori.jp":false,"pref.chiba.jp":false,"pref.ehime.jp":false,"pref.fukui.jp":false,"pref.fukuoka.jp":false,"pref.fukushima.jp":false,"pref.gifu.jp":false,"pref.gunma.jp":false,"pref.hiroshima.jp":false,"pref.hokkaido.jp":false,"pref.hyogo.jp":false,"pref.ibaraki.jp":false,"pref.ishikawa.jp":false,"pref.iwate.jp":false,"pref.kagawa.jp":false,"pref.kagoshima.jp":false,"pref.kanagawa.jp":false,"pref.kochi.jp":false,"pref.kumamoto.jp":false,"pref.kyoto.jp":false,"pref.mie.jp":false,"pref.miyagi.jp":false,"pref.miyazaki.jp":false,"pref.nagano.jp":false,"pref.nagasaki.jp":false,"pref.nara.jp":false,"pref.niigata.jp":false,"pref.oita.jp":false,"pref.okayama.jp":false,"pref.okinawa.jp":false,"pref.osaka.jp":false,"pref.saga.jp":false,"pref.saitama.jp":false,"pref.shiga.jp":false,"pref.shimane.jp":false,"pref.shizuoka.jp":false,"pref.tochigi.jp":false,"pref.tokushima.jp":false,"pref.tottori.jp":false,"pref.toyama.jp":false,"pref.wakayama.jp":false,"pref.yamagata.jp":false,"pref.yamaguchi.jp":false,"pref.yamanashi.jp":false,"city.chiba.jp":false,"city.fukuoka.jp":false,"city.hiroshima.jp":false,"city.kawasaki.jp":false,"city.kitakyushu.jp":false,"city.kobe.jp":false,"city.kyoto.jp":false,"city.nagoya.jp":false,"city.niigata.jp":false,"city.okayama.jp":false,"city.osaka.jp":false,"city.saitama.jp":false,"city.sapporo.jp":false,"city.sendai.jp":false,"city.shizuoka.jp":false,"city.yokohama.jp":false,"*.ke":true,"kg":true,"org.kg":true,"net.kg":true,"com.kg":true,"edu.kg":true,"gov.kg":true,"mil.kg":true,"*.kh":true,"ki":true,"edu.ki":true,"biz.ki":true,"net.ki":true,"org.ki":true,"gov.ki":true,"info.ki":true,"com.ki":true,"km":true,"org.km":true,"nom.km":true,"gov.km":true,"prd.km":true,"tm.km":true,"edu.km":true,"mil.km":true,"ass.km":true,"com.km":true,"coop.km":true,"asso.km":true,"presse.km":true,"medecin.km":true,"notaires.km":true,"pharmaciens.km":true,"veterinaire.km":true,"gouv.km":true,"kn":true,"net.kn":true,"org.kn":true,"edu.kn":true,"gov.kn":true,"com.kp":true,"edu.kp":true,"gov.kp":true,"org.kp":true,"rep.kp":true,"tra.kp":true,"kr":true,"ac.kr":true,"co.kr":true,"es.kr":true,"go.kr":true,"hs.kr":true,"kg.kr":true,"mil.kr":true,"ms.kr":true,"ne.kr":true,"or.kr":true,"pe.kr":true,"re.kr":true,"sc.kr":true,"busan.kr":true,"chungbuk.kr":true,"chungnam.kr":true,"daegu.kr":true,"daejeon.kr":true,"gangwon.kr":true,"gwangju.kr":true,"gyeongbuk.kr":true,"gyeonggi.kr":true,"gyeongnam.kr":true,"incheon.kr":true,"jeju.kr":true,"jeonbuk.kr":true,"jeonnam.kr":true,"seoul.kr":true,"ulsan.kr":true,"*.kw":true,"ky":true,"edu.ky":true,"gov.ky":true,"com.ky":true,"org.ky":true,"net.ky":true,"kz":true,"org.kz":true,"edu.kz":true,"net.kz":true,"gov.kz":true,"mil.kz":true,"com.kz":true,"la":true,"int.la":true,"net.la":true,"info.la":true,"edu.la":true,"gov.la":true,"per.la":true,"com.la":true,"org.la":true,"com.lb":true,"edu.lb":true,"gov.lb":true,"net.lb":true,"org.lb":true,"lc":true,"com.lc":true,"net.lc":true,"co.lc":true,"org.lc":true,"edu.lc":true,"gov.lc":true,"li":true,"lk":true,"gov.lk":true,"sch.lk":true,"net.lk":true,"int.lk":true,"com.lk":true,"org.lk":true,"edu.lk":true,"ngo.lk":true,"soc.lk":true,"web.lk":true,"ltd.lk":true,"assn.lk":true,"grp.lk":true,"hotel.lk":true,"com.lr":true,"edu.lr":true,"gov.lr":true,"org.lr":true,"net.lr":true,"ls":true,"co.ls":true,"org.ls":true,"lt":true,"gov.lt":true,"lu":true,"lv":true,"com.lv":true,"edu.lv":true,"gov.lv":true,"org.lv":true,"mil.lv":true,"id.lv":true,"net.lv":true,"asn.lv":true,"conf.lv":true,"ly":true,"com.ly":true,"net.ly":true,"gov.ly":true,"plc.ly":true,"edu.ly":true,"sch.ly":true,"med.ly":true,"org.ly":true,"id.ly":true,"ma":true,"co.ma":true,"net.ma":true,"gov.ma":true,"org.ma":true,"ac.ma":true,"press.ma":true,"mc":true,"tm.mc":true,"asso.mc":true,"md":true,"me":true,"co.me":true,"net.me":true,"org.me":true,"edu.me":true,"ac.me":true,"gov.me":true,"its.me":true,"priv.me":true,"mg":true,"org.mg":true,"nom.mg":true,"gov.mg":true,"prd.mg":true,"tm.mg":true,"edu.mg":true,"mil.mg":true,"com.mg":true,"mh":true,"mil":true,"mk":true,"com.mk":true,"org.mk":true,"net.mk":true,"edu.mk":true,"gov.mk":true,"inf.mk":true,"name.mk":true,"ml":true,"com.ml":true,"edu.ml":true,"gouv.ml":true,"gov.ml":true,"net.ml":true,"org.ml":true,"presse.ml":true,"*.mm":true,"mn":true,"gov.mn":true,"edu.mn":true,"org.mn":true,"mo":true,"com.mo":true,"net.mo":true,"org.mo":true,"edu.mo":true,"gov.mo":true,"mobi":true,"mp":true,"mq":true,"mr":true,"gov.mr":true,"ms":true,"*.mt":true,"mu":true,"com.mu":true,"net.mu":true,"org.mu":true,"gov.mu":true,"ac.mu":true,"co.mu":true,"or.mu":true,"museum":true,"academy.museum":true,"agriculture.museum":true,"air.museum":true,"airguard.museum":true,"alabama.museum":true,"alaska.museum":true,"amber.museum":true,"ambulance.museum":true,"american.museum":true,"americana.museum":true,"americanantiques.museum":true,"americanart.museum":true,"amsterdam.museum":true,"and.museum":true,"annefrank.museum":true,"anthro.museum":true,"anthropology.museum":true,"antiques.museum":true,"aquarium.museum":true,"arboretum.museum":true,"archaeological.museum":true,"archaeology.museum":true,"architecture.museum":true,"art.museum":true,"artanddesign.museum":true,"artcenter.museum":true,"artdeco.museum":true,"arteducation.museum":true,"artgallery.museum":true,"arts.museum":true,"artsandcrafts.museum":true,"asmatart.museum":true,"assassination.museum":true,"assisi.museum":true,"association.museum":true,"astronomy.museum":true,"atlanta.museum":true,"austin.museum":true,"australia.museum":true,"automotive.museum":true,"aviation.museum":true,"axis.museum":true,"badajoz.museum":true,"baghdad.museum":true,"bahn.museum":true,"bale.museum":true,"baltimore.museum":true,"barcelona.museum":true,"baseball.museum":true,"basel.museum":true,"baths.museum":true,"bauern.museum":true,"beauxarts.museum":true,"beeldengeluid.museum":true,"bellevue.museum":true,"bergbau.museum":true,"berkeley.museum":true,"berlin.museum":true,"bern.museum":true,"bible.museum":true,"bilbao.museum":true,"bill.museum":true,"birdart.museum":true,"birthplace.museum":true,"bonn.museum":true,"boston.museum":true,"botanical.museum":true,"botanicalgarden.museum":true,"botanicgarden.museum":true,"botany.museum":true,"brandywinevalley.museum":true,"brasil.museum":true,"bristol.museum":true,"british.museum":true,"britishcolumbia.museum":true,"broadcast.museum":true,"brunel.museum":true,"brussel.museum":true,"brussels.museum":true,"bruxelles.museum":true,"building.museum":true,"burghof.museum":true,"bus.museum":true,"bushey.museum":true,"cadaques.museum":true,"california.museum":true,"cambridge.museum":true,"can.museum":true,"canada.museum":true,"capebreton.museum":true,"carrier.museum":true,"cartoonart.museum":true,"casadelamoneda.museum":true,"castle.museum":true,"castres.museum":true,"celtic.museum":true,"center.museum":true,"chattanooga.museum":true,"cheltenham.museum":true,"chesapeakebay.museum":true,"chicago.museum":true,"children.museum":true,"childrens.museum":true,"childrensgarden.museum":true,"chiropractic.museum":true,"chocolate.museum":true,"christiansburg.museum":true,"cincinnati.museum":true,"cinema.museum":true,"circus.museum":true,"civilisation.museum":true,"civilization.museum":true,"civilwar.museum":true,"clinton.museum":true,"clock.museum":true,"coal.museum":true,"coastaldefence.museum":true,"cody.museum":true,"coldwar.museum":true,"collection.museum":true,"colonialwilliamsburg.museum":true,"coloradoplateau.museum":true,"columbia.museum":true,"columbus.museum":true,"communication.museum":true,"communications.museum":true,"community.museum":true,"computer.museum":true,"computerhistory.museum":true,"xn--comunicaes-v6a2o.museum":true,"contemporary.museum":true,"contemporaryart.museum":true,"convent.museum":true,"copenhagen.museum":true,"corporation.museum":true,"xn--correios-e-telecomunicaes-ghc29a.museum":true,"corvette.museum":true,"costume.museum":true,"countryestate.museum":true,"county.museum":true,"crafts.museum":true,"cranbrook.museum":true,"creation.museum":true,"cultural.museum":true,"culturalcenter.museum":true,"culture.museum":true,"cyber.museum":true,"cymru.museum":true,"dali.museum":true,"dallas.museum":true,"database.museum":true,"ddr.museum":true,"decorativearts.museum":true,"delaware.museum":true,"delmenhorst.museum":true,"denmark.museum":true,"depot.museum":true,"design.museum":true,"detroit.museum":true,"dinosaur.museum":true,"discovery.museum":true,"dolls.museum":true,"donostia.museum":true,"durham.museum":true,"eastafrica.museum":true,"eastcoast.museum":true,"education.museum":true,"educational.museum":true,"egyptian.museum":true,"eisenbahn.museum":true,"elburg.museum":true,"elvendrell.museum":true,"embroidery.museum":true,"encyclopedic.museum":true,"england.museum":true,"entomology.museum":true,"environment.museum":true,"environmentalconservation.museum":true,"epilepsy.museum":true,"essex.museum":true,"estate.museum":true,"ethnology.museum":true,"exeter.museum":true,"exhibition.museum":true,"family.museum":true,"farm.museum":true,"farmequipment.museum":true,"farmers.museum":true,"farmstead.museum":true,"field.museum":true,"figueres.museum":true,"filatelia.museum":true,"film.museum":true,"fineart.museum":true,"finearts.museum":true,"finland.museum":true,"flanders.museum":true,"florida.museum":true,"force.museum":true,"fortmissoula.museum":true,"fortworth.museum":true,"foundation.museum":true,"francaise.museum":true,"frankfurt.museum":true,"franziskaner.museum":true,"freemasonry.museum":true,"freiburg.museum":true,"fribourg.museum":true,"frog.museum":true,"fundacio.museum":true,"furniture.museum":true,"gallery.museum":true,"garden.museum":true,"gateway.museum":true,"geelvinck.museum":true,"gemological.museum":true,"geology.museum":true,"georgia.museum":true,"giessen.museum":true,"glas.museum":true,"glass.museum":true,"gorge.museum":true,"grandrapids.museum":true,"graz.museum":true,"guernsey.museum":true,"halloffame.museum":true,"hamburg.museum":true,"handson.museum":true,"harvestcelebration.museum":true,"hawaii.museum":true,"health.museum":true,"heimatunduhren.museum":true,"hellas.museum":true,"helsinki.museum":true,"hembygdsforbund.museum":true,"heritage.museum":true,"histoire.museum":true,"historical.museum":true,"historicalsociety.museum":true,"historichouses.museum":true,"historisch.museum":true,"historisches.museum":true,"history.museum":true,"historyofscience.museum":true,"horology.museum":true,"house.museum":true,"humanities.museum":true,"illustration.museum":true,"imageandsound.museum":true,"indian.museum":true,"indiana.museum":true,"indianapolis.museum":true,"indianmarket.museum":true,"intelligence.museum":true,"interactive.museum":true,"iraq.museum":true,"iron.museum":true,"isleofman.museum":true,"jamison.museum":true,"jefferson.museum":true,"jerusalem.museum":true,"jewelry.museum":true,"jewish.museum":true,"jewishart.museum":true,"jfk.museum":true,"journalism.museum":true,"judaica.museum":true,"judygarland.museum":true,"juedisches.museum":true,"juif.museum":true,"karate.museum":true,"karikatur.museum":true,"kids.museum":true,"koebenhavn.museum":true,"koeln.museum":true,"kunst.museum":true,"kunstsammlung.museum":true,"kunstunddesign.museum":true,"labor.museum":true,"labour.museum":true,"lajolla.museum":true,"lancashire.museum":true,"landes.museum":true,"lans.museum":true,"xn--lns-qla.museum":true,"larsson.museum":true,"lewismiller.museum":true,"lincoln.museum":true,"linz.museum":true,"living.museum":true,"livinghistory.museum":true,"localhistory.museum":true,"london.museum":true,"losangeles.museum":true,"louvre.museum":true,"loyalist.museum":true,"lucerne.museum":true,"luxembourg.museum":true,"luzern.museum":true,"mad.museum":true,"madrid.museum":true,"mallorca.museum":true,"manchester.museum":true,"mansion.museum":true,"mansions.museum":true,"manx.museum":true,"marburg.museum":true,"maritime.museum":true,"maritimo.museum":true,"maryland.museum":true,"marylhurst.museum":true,"media.museum":true,"medical.museum":true,"medizinhistorisches.museum":true,"meeres.museum":true,"memorial.museum":true,"mesaverde.museum":true,"michigan.museum":true,"midatlantic.museum":true,"military.museum":true,"mill.museum":true,"miners.museum":true,"mining.museum":true,"minnesota.museum":true,"missile.museum":true,"missoula.museum":true,"modern.museum":true,"moma.museum":true,"money.museum":true,"monmouth.museum":true,"monticello.museum":true,"montreal.museum":true,"moscow.museum":true,"motorcycle.museum":true,"muenchen.museum":true,"muenster.museum":true,"mulhouse.museum":true,"muncie.museum":true,"museet.museum":true,"museumcenter.museum":true,"museumvereniging.museum":true,"music.museum":true,"national.museum":true,"nationalfirearms.museum":true,"nationalheritage.museum":true,"nativeamerican.museum":true,"naturalhistory.museum":true,"naturalhistorymuseum.museum":true,"naturalsciences.museum":true,"nature.museum":true,"naturhistorisches.museum":true,"natuurwetenschappen.museum":true,"naumburg.museum":true,"naval.museum":true,"nebraska.museum":true,"neues.museum":true,"newhampshire.museum":true,"newjersey.museum":true,"newmexico.museum":true,"newport.museum":true,"newspaper.museum":true,"newyork.museum":true,"niepce.museum":true,"norfolk.museum":true,"north.museum":true,"nrw.museum":true,"nuernberg.museum":true,"nuremberg.museum":true,"nyc.museum":true,"nyny.museum":true,"oceanographic.museum":true,"oceanographique.museum":true,"omaha.museum":true,"online.museum":true,"ontario.museum":true,"openair.museum":true,"oregon.museum":true,"oregontrail.museum":true,"otago.museum":true,"oxford.museum":true,"pacific.museum":true,"paderborn.museum":true,"palace.museum":true,"paleo.museum":true,"palmsprings.museum":true,"panama.museum":true,"paris.museum":true,"pasadena.museum":true,"pharmacy.museum":true,"philadelphia.museum":true,"philadelphiaarea.museum":true,"philately.museum":true,"phoenix.museum":true,"photography.museum":true,"pilots.museum":true,"pittsburgh.museum":true,"planetarium.museum":true,"plantation.museum":true,"plants.museum":true,"plaza.museum":true,"portal.museum":true,"portland.museum":true,"portlligat.museum":true,"posts-and-telecommunications.museum":true,"preservation.museum":true,"presidio.museum":true,"press.museum":true,"project.museum":true,"public.museum":true,"pubol.museum":true,"quebec.museum":true,"railroad.museum":true,"railway.museum":true,"research.museum":true,"resistance.museum":true,"riodejaneiro.museum":true,"rochester.museum":true,"rockart.museum":true,"roma.museum":true,"russia.museum":true,"saintlouis.museum":true,"salem.museum":true,"salvadordali.museum":true,"salzburg.museum":true,"sandiego.museum":true,"sanfrancisco.museum":true,"santabarbara.museum":true,"santacruz.museum":true,"santafe.museum":true,"saskatchewan.museum":true,"satx.museum":true,"savannahga.museum":true,"schlesisches.museum":true,"schoenbrunn.museum":true,"schokoladen.museum":true,"school.museum":true,"schweiz.museum":true,"science.museum":true,"scienceandhistory.museum":true,"scienceandindustry.museum":true,"sciencecenter.museum":true,"sciencecenters.museum":true,"science-fiction.museum":true,"sciencehistory.museum":true,"sciences.museum":true,"sciencesnaturelles.museum":true,"scotland.museum":true,"seaport.museum":true,"settlement.museum":true,"settlers.museum":true,"shell.museum":true,"sherbrooke.museum":true,"sibenik.museum":true,"silk.museum":true,"ski.museum":true,"skole.museum":true,"society.museum":true,"sologne.museum":true,"soundandvision.museum":true,"southcarolina.museum":true,"southwest.museum":true,"space.museum":true,"spy.museum":true,"square.museum":true,"stadt.museum":true,"stalbans.museum":true,"starnberg.museum":true,"state.museum":true,"stateofdelaware.museum":true,"station.museum":true,"steam.museum":true,"steiermark.museum":true,"stjohn.museum":true,"stockholm.museum":true,"stpetersburg.museum":true,"stuttgart.museum":true,"suisse.museum":true,"surgeonshall.museum":true,"surrey.museum":true,"svizzera.museum":true,"sweden.museum":true,"sydney.museum":true,"tank.museum":true,"tcm.museum":true,"technology.museum":true,"telekommunikation.museum":true,"television.museum":true,"texas.museum":true,"textile.museum":true,"theater.museum":true,"time.museum":true,"timekeeping.museum":true,"topology.museum":true,"torino.museum":true,"touch.museum":true,"town.museum":true,"transport.museum":true,"tree.museum":true,"trolley.museum":true,"trust.museum":true,"trustee.museum":true,"uhren.museum":true,"ulm.museum":true,"undersea.museum":true,"university.museum":true,"usa.museum":true,"usantiques.museum":true,"usarts.museum":true,"uscountryestate.museum":true,"usculture.museum":true,"usdecorativearts.museum":true,"usgarden.museum":true,"ushistory.museum":true,"ushuaia.museum":true,"uslivinghistory.museum":true,"utah.museum":true,"uvic.museum":true,"valley.museum":true,"vantaa.museum":true,"versailles.museum":true,"viking.museum":true,"village.museum":true,"virginia.museum":true,"virtual.museum":true,"virtuel.museum":true,"vlaanderen.museum":true,"volkenkunde.museum":true,"wales.museum":true,"wallonie.museum":true,"war.museum":true,"washingtondc.museum":true,"watchandclock.museum":true,"watch-and-clock.museum":true,"western.museum":true,"westfalen.museum":true,"whaling.museum":true,"wildlife.museum":true,"williamsburg.museum":true,"windmill.museum":true,"workshop.museum":true,"york.museum":true,"yorkshire.museum":true,"yosemite.museum":true,"youth.museum":true,"zoological.museum":true,"zoology.museum":true,"xn--9dbhblg6di.museum":true,"xn--h1aegh.museum":true,"mv":true,"aero.mv":true,"biz.mv":true,"com.mv":true,"coop.mv":true,"edu.mv":true,"gov.mv":true,"info.mv":true,"int.mv":true,"mil.mv":true,"museum.mv":true,"name.mv":true,"net.mv":true,"org.mv":true,"pro.mv":true,"mw":true,"ac.mw":true,"biz.mw":true,"co.mw":true,"com.mw":true,"coop.mw":true,"edu.mw":true,"gov.mw":true,"int.mw":true,"museum.mw":true,"net.mw":true,"org.mw":true,"mx":true,"com.mx":true,"org.mx":true,"gob.mx":true,"edu.mx":true,"net.mx":true,"my":true,"com.my":true,"net.my":true,"org.my":true,"gov.my":true,"edu.my":true,"mil.my":true,"name.my":true,"*.mz":true,"na":true,"info.na":true,"pro.na":true,"name.na":true,"school.na":true,"or.na":true,"dr.na":true,"us.na":true,"mx.na":true,"ca.na":true,"in.na":true,"cc.na":true,"tv.na":true,"ws.na":true,"mobi.na":true,"co.na":true,"com.na":true,"org.na":true,"name":true,"nc":true,"asso.nc":true,"ne":true,"net":true,"nf":true,"com.nf":true,"net.nf":true,"per.nf":true,"rec.nf":true,"web.nf":true,"arts.nf":true,"firm.nf":true,"info.nf":true,"other.nf":true,"store.nf":true,"ac.ng":true,"com.ng":true,"edu.ng":true,"gov.ng":true,"net.ng":true,"org.ng":true,"*.ni":true,"nl":true,"bv.nl":true,"no":true,"fhs.no":true,"vgs.no":true,"fylkesbibl.no":true,"folkebibl.no":true,"museum.no":true,"idrett.no":true,"priv.no":true,"mil.no":true,"stat.no":true,"dep.no":true,"kommune.no":true,"herad.no":true,"aa.no":true,"ah.no":true,"bu.no":true,"fm.no":true,"hl.no":true,"hm.no":true,"jan-mayen.no":true,"mr.no":true,"nl.no":true,"nt.no":true,"of.no":true,"ol.no":true,"oslo.no":true,"rl.no":true,"sf.no":true,"st.no":true,"svalbard.no":true,"tm.no":true,"tr.no":true,"va.no":true,"vf.no":true,"gs.aa.no":true,"gs.ah.no":true,"gs.bu.no":true,"gs.fm.no":true,"gs.hl.no":true,"gs.hm.no":true,"gs.jan-mayen.no":true,"gs.mr.no":true,"gs.nl.no":true,"gs.nt.no":true,"gs.of.no":true,"gs.ol.no":true,"gs.oslo.no":true,"gs.rl.no":true,"gs.sf.no":true,"gs.st.no":true,"gs.svalbard.no":true,"gs.tm.no":true,"gs.tr.no":true,"gs.va.no":true,"gs.vf.no":true,"akrehamn.no":true,"xn--krehamn-dxa.no":true,"algard.no":true,"xn--lgrd-poac.no":true,"arna.no":true,"brumunddal.no":true,"bryne.no":true,"bronnoysund.no":true,"xn--brnnysund-m8ac.no":true,"drobak.no":true,"xn--drbak-wua.no":true,"egersund.no":true,"fetsund.no":true,"floro.no":true,"xn--flor-jra.no":true,"fredrikstad.no":true,"hokksund.no":true,"honefoss.no":true,"xn--hnefoss-q1a.no":true,"jessheim.no":true,"jorpeland.no":true,"xn--jrpeland-54a.no":true,"kirkenes.no":true,"kopervik.no":true,"krokstadelva.no":true,"langevag.no":true,"xn--langevg-jxa.no":true,"leirvik.no":true,"mjondalen.no":true,"xn--mjndalen-64a.no":true,"mo-i-rana.no":true,"mosjoen.no":true,"xn--mosjen-eya.no":true,"nesoddtangen.no":true,"orkanger.no":true,"osoyro.no":true,"xn--osyro-wua.no":true,"raholt.no":true,"xn--rholt-mra.no":true,"sandnessjoen.no":true,"xn--sandnessjen-ogb.no":true,"skedsmokorset.no":true,"slattum.no":true,"spjelkavik.no":true,"stathelle.no":true,"stavern.no":true,"stjordalshalsen.no":true,"xn--stjrdalshalsen-sqb.no":true,"tananger.no":true,"tranby.no":true,"vossevangen.no":true,"afjord.no":true,"xn--fjord-lra.no":true,"agdenes.no":true,"al.no":true,"xn--l-1fa.no":true,"alesund.no":true,"xn--lesund-hua.no":true,"alstahaug.no":true,"alta.no":true,"xn--lt-liac.no":true,"alaheadju.no":true,"xn--laheadju-7ya.no":true,"alvdal.no":true,"amli.no":true,"xn--mli-tla.no":true,"amot.no":true,"xn--mot-tla.no":true,"andebu.no":true,"andoy.no":true,"xn--andy-ira.no":true,"andasuolo.no":true,"ardal.no":true,"xn--rdal-poa.no":true,"aremark.no":true,"arendal.no":true,"xn--s-1fa.no":true,"aseral.no":true,"xn--seral-lra.no":true,"asker.no":true,"askim.no":true,"askvoll.no":true,"askoy.no":true,"xn--asky-ira.no":true,"asnes.no":true,"xn--snes-poa.no":true,"audnedaln.no":true,"aukra.no":true,"aure.no":true,"aurland.no":true,"aurskog-holand.no":true,"xn--aurskog-hland-jnb.no":true,"austevoll.no":true,"austrheim.no":true,"averoy.no":true,"xn--avery-yua.no":true,"balestrand.no":true,"ballangen.no":true,"balat.no":true,"xn--blt-elab.no":true,"balsfjord.no":true,"bahccavuotna.no":true,"xn--bhccavuotna-k7a.no":true,"bamble.no":true,"bardu.no":true,"beardu.no":true,"beiarn.no":true,"bajddar.no":true,"xn--bjddar-pta.no":true,"baidar.no":true,"xn--bidr-5nac.no":true,"berg.no":true,"bergen.no":true,"berlevag.no":true,"xn--berlevg-jxa.no":true,"bearalvahki.no":true,"xn--bearalvhki-y4a.no":true,"bindal.no":true,"birkenes.no":true,"bjarkoy.no":true,"xn--bjarky-fya.no":true,"bjerkreim.no":true,"bjugn.no":true,"bodo.no":true,"xn--bod-2na.no":true,"badaddja.no":true,"xn--bdddj-mrabd.no":true,"budejju.no":true,"bokn.no":true,"bremanger.no":true,"bronnoy.no":true,"xn--brnny-wuac.no":true,"bygland.no":true,"bykle.no":true,"barum.no":true,"xn--brum-voa.no":true,"bo.telemark.no":true,"xn--b-5ga.telemark.no":true,"bo.nordland.no":true,"xn--b-5ga.nordland.no":true,"bievat.no":true,"xn--bievt-0qa.no":true,"bomlo.no":true,"xn--bmlo-gra.no":true,"batsfjord.no":true,"xn--btsfjord-9za.no":true,"bahcavuotna.no":true,"xn--bhcavuotna-s4a.no":true,"dovre.no":true,"drammen.no":true,"drangedal.no":true,"dyroy.no":true,"xn--dyry-ira.no":true,"donna.no":true,"xn--dnna-gra.no":true,"eid.no":true,"eidfjord.no":true,"eidsberg.no":true,"eidskog.no":true,"eidsvoll.no":true,"eigersund.no":true,"elverum.no":true,"enebakk.no":true,"engerdal.no":true,"etne.no":true,"etnedal.no":true,"evenes.no":true,"evenassi.no":true,"xn--eveni-0qa01ga.no":true,"evje-og-hornnes.no":true,"farsund.no":true,"fauske.no":true,"fuossko.no":true,"fuoisku.no":true,"fedje.no":true,"fet.no":true,"finnoy.no":true,"xn--finny-yua.no":true,"fitjar.no":true,"fjaler.no":true,"fjell.no":true,"flakstad.no":true,"flatanger.no":true,"flekkefjord.no":true,"flesberg.no":true,"flora.no":true,"fla.no":true,"xn--fl-zia.no":true,"folldal.no":true,"forsand.no":true,"fosnes.no":true,"frei.no":true,"frogn.no":true,"froland.no":true,"frosta.no":true,"frana.no":true,"xn--frna-woa.no":true,"froya.no":true,"xn--frya-hra.no":true,"fusa.no":true,"fyresdal.no":true,"forde.no":true,"xn--frde-gra.no":true,"gamvik.no":true,"gangaviika.no":true,"xn--ggaviika-8ya47h.no":true,"gaular.no":true,"gausdal.no":true,"gildeskal.no":true,"xn--gildeskl-g0a.no":true,"giske.no":true,"gjemnes.no":true,"gjerdrum.no":true,"gjerstad.no":true,"gjesdal.no":true,"gjovik.no":true,"xn--gjvik-wua.no":true,"gloppen.no":true,"gol.no":true,"gran.no":true,"grane.no":true,"granvin.no":true,"gratangen.no":true,"grimstad.no":true,"grong.no":true,"kraanghke.no":true,"xn--kranghke-b0a.no":true,"grue.no":true,"gulen.no":true,"hadsel.no":true,"halden.no":true,"halsa.no":true,"hamar.no":true,"hamaroy.no":true,"habmer.no":true,"xn--hbmer-xqa.no":true,"hapmir.no":true,"xn--hpmir-xqa.no":true,"hammerfest.no":true,"hammarfeasta.no":true,"xn--hmmrfeasta-s4ac.no":true,"haram.no":true,"hareid.no":true,"harstad.no":true,"hasvik.no":true,"aknoluokta.no":true,"xn--koluokta-7ya57h.no":true,"hattfjelldal.no":true,"aarborte.no":true,"haugesund.no":true,"hemne.no":true,"hemnes.no":true,"hemsedal.no":true,"heroy.more-og-romsdal.no":true,"xn--hery-ira.xn--mre-og-romsdal-qqb.no":true,"heroy.nordland.no":true,"xn--hery-ira.nordland.no":true,"hitra.no":true,"hjartdal.no":true,"hjelmeland.no":true,"hobol.no":true,"xn--hobl-ira.no":true,"hof.no":true,"hol.no":true,"hole.no":true,"holmestrand.no":true,"holtalen.no":true,"xn--holtlen-hxa.no":true,"hornindal.no":true,"horten.no":true,"hurdal.no":true,"hurum.no":true,"hvaler.no":true,"hyllestad.no":true,"hagebostad.no":true,"xn--hgebostad-g3a.no":true,"hoyanger.no":true,"xn--hyanger-q1a.no":true,"hoylandet.no":true,"xn--hylandet-54a.no":true,"ha.no":true,"xn--h-2fa.no":true,"ibestad.no":true,"inderoy.no":true,"xn--indery-fya.no":true,"iveland.no":true,"jevnaker.no":true,"jondal.no":true,"jolster.no":true,"xn--jlster-bya.no":true,"karasjok.no":true,"karasjohka.no":true,"xn--krjohka-hwab49j.no":true,"karlsoy.no":true,"galsa.no":true,"xn--gls-elac.no":true,"karmoy.no":true,"xn--karmy-yua.no":true,"kautokeino.no":true,"guovdageaidnu.no":true,"klepp.no":true,"klabu.no":true,"xn--klbu-woa.no":true,"kongsberg.no":true,"kongsvinger.no":true,"kragero.no":true,"xn--krager-gya.no":true,"kristiansand.no":true,"kristiansund.no":true,"krodsherad.no":true,"xn--krdsherad-m8a.no":true,"kvalsund.no":true,"rahkkeravju.no":true,"xn--rhkkervju-01af.no":true,"kvam.no":true,"kvinesdal.no":true,"kvinnherad.no":true,"kviteseid.no":true,"kvitsoy.no":true,"xn--kvitsy-fya.no":true,"kvafjord.no":true,"xn--kvfjord-nxa.no":true,"giehtavuoatna.no":true,"kvanangen.no":true,"xn--kvnangen-k0a.no":true,"navuotna.no":true,"xn--nvuotna-hwa.no":true,"kafjord.no":true,"xn--kfjord-iua.no":true,"gaivuotna.no":true,"xn--givuotna-8ya.no":true,"larvik.no":true,"lavangen.no":true,"lavagis.no":true,"loabat.no":true,"xn--loabt-0qa.no":true,"lebesby.no":true,"davvesiida.no":true,"leikanger.no":true,"leirfjord.no":true,"leka.no":true,"leksvik.no":true,"lenvik.no":true,"leangaviika.no":true,"xn--leagaviika-52b.no":true,"lesja.no":true,"levanger.no":true,"lier.no":true,"lierne.no":true,"lillehammer.no":true,"lillesand.no":true,"lindesnes.no":true,"lindas.no":true,"xn--linds-pra.no":true,"lom.no":true,"loppa.no":true,"lahppi.no":true,"xn--lhppi-xqa.no":true,"lund.no":true,"lunner.no":true,"luroy.no":true,"xn--lury-ira.no":true,"luster.no":true,"lyngdal.no":true,"lyngen.no":true,"ivgu.no":true,"lardal.no":true,"lerdal.no":true,"xn--lrdal-sra.no":true,"lodingen.no":true,"xn--ldingen-q1a.no":true,"lorenskog.no":true,"xn--lrenskog-54a.no":true,"loten.no":true,"xn--lten-gra.no":true,"malvik.no":true,"masoy.no":true,"xn--msy-ula0h.no":true,"muosat.no":true,"xn--muost-0qa.no":true,"mandal.no":true,"marker.no":true,"marnardal.no":true,"masfjorden.no":true,"meland.no":true,"meldal.no":true,"melhus.no":true,"meloy.no":true,"xn--mely-ira.no":true,"meraker.no":true,"xn--merker-kua.no":true,"moareke.no":true,"xn--moreke-jua.no":true,"midsund.no":true,"midtre-gauldal.no":true,"modalen.no":true,"modum.no":true,"molde.no":true,"moskenes.no":true,"moss.no":true,"mosvik.no":true,"malselv.no":true,"xn--mlselv-iua.no":true,"malatvuopmi.no":true,"xn--mlatvuopmi-s4a.no":true,"namdalseid.no":true,"aejrie.no":true,"namsos.no":true,"namsskogan.no":true,"naamesjevuemie.no":true,"xn--nmesjevuemie-tcba.no":true,"laakesvuemie.no":true,"nannestad.no":true,"narvik.no":true,"narviika.no":true,"naustdal.no":true,"nedre-eiker.no":true,"nes.akershus.no":true,"nes.buskerud.no":true,"nesna.no":true,"nesodden.no":true,"nesseby.no":true,"unjarga.no":true,"xn--unjrga-rta.no":true,"nesset.no":true,"nissedal.no":true,"nittedal.no":true,"nord-aurdal.no":true,"nord-fron.no":true,"nord-odal.no":true,"norddal.no":true,"nordkapp.no":true,"davvenjarga.no":true,"xn--davvenjrga-y4a.no":true,"nordre-land.no":true,"nordreisa.no":true,"raisa.no":true,"xn--risa-5na.no":true,"nore-og-uvdal.no":true,"notodden.no":true,"naroy.no":true,"xn--nry-yla5g.no":true,"notteroy.no":true,"xn--nttery-byae.no":true,"odda.no":true,"oksnes.no":true,"xn--ksnes-uua.no":true,"oppdal.no":true,"oppegard.no":true,"xn--oppegrd-ixa.no":true,"orkdal.no":true,"orland.no":true,"xn--rland-uua.no":true,"orskog.no":true,"xn--rskog-uua.no":true,"orsta.no":true,"xn--rsta-fra.no":true,"os.hedmark.no":true,"os.hordaland.no":true,"osen.no":true,"osteroy.no":true,"xn--ostery-fya.no":true,"ostre-toten.no":true,"xn--stre-toten-zcb.no":true,"overhalla.no":true,"ovre-eiker.no":true,"xn--vre-eiker-k8a.no":true,"oyer.no":true,"xn--yer-zna.no":true,"oygarden.no":true,"xn--ygarden-p1a.no":true,"oystre-slidre.no":true,"xn--ystre-slidre-ujb.no":true,"porsanger.no":true,"porsangu.no":true,"xn--porsgu-sta26f.no":true,"porsgrunn.no":true,"radoy.no":true,"xn--rady-ira.no":true,"rakkestad.no":true,"rana.no":true,"ruovat.no":true,"randaberg.no":true,"rauma.no":true,"rendalen.no":true,"rennebu.no":true,"rennesoy.no":true,"xn--rennesy-v1a.no":true,"rindal.no":true,"ringebu.no":true,"ringerike.no":true,"ringsaker.no":true,"rissa.no":true,"risor.no":true,"xn--risr-ira.no":true,"roan.no":true,"rollag.no":true,"rygge.no":true,"ralingen.no":true,"xn--rlingen-mxa.no":true,"rodoy.no":true,"xn--rdy-0nab.no":true,"romskog.no":true,"xn--rmskog-bya.no":true,"roros.no":true,"xn--rros-gra.no":true,"rost.no":true,"xn--rst-0na.no":true,"royken.no":true,"xn--ryken-vua.no":true,"royrvik.no":true,"xn--ryrvik-bya.no":true,"rade.no":true,"xn--rde-ula.no":true,"salangen.no":true,"siellak.no":true,"saltdal.no":true,"salat.no":true,"xn--slt-elab.no":true,"xn--slat-5na.no":true,"samnanger.no":true,"sande.more-og-romsdal.no":true,"sande.xn--mre-og-romsdal-qqb.no":true,"sande.vestfold.no":true,"sandefjord.no":true,"sandnes.no":true,"sandoy.no":true,"xn--sandy-yua.no":true,"sarpsborg.no":true,"sauda.no":true,"sauherad.no":true,"sel.no":true,"selbu.no":true,"selje.no":true,"seljord.no":true,"sigdal.no":true,"siljan.no":true,"sirdal.no":true,"skaun.no":true,"skedsmo.no":true,"ski.no":true,"skien.no":true,"skiptvet.no":true,"skjervoy.no":true,"xn--skjervy-v1a.no":true,"skierva.no":true,"xn--skierv-uta.no":true,"skjak.no":true,"xn--skjk-soa.no":true,"skodje.no":true,"skanland.no":true,"xn--sknland-fxa.no":true,"skanit.no":true,"xn--sknit-yqa.no":true,"smola.no":true,"xn--smla-hra.no":true,"snillfjord.no":true,"snasa.no":true,"xn--snsa-roa.no":true,"snoasa.no":true,"snaase.no":true,"xn--snase-nra.no":true,"sogndal.no":true,"sokndal.no":true,"sola.no":true,"solund.no":true,"songdalen.no":true,"sortland.no":true,"spydeberg.no":true,"stange.no":true,"stavanger.no":true,"steigen.no":true,"steinkjer.no":true,"stjordal.no":true,"xn--stjrdal-s1a.no":true,"stokke.no":true,"stor-elvdal.no":true,"stord.no":true,"stordal.no":true,"storfjord.no":true,"omasvuotna.no":true,"strand.no":true,"stranda.no":true,"stryn.no":true,"sula.no":true,"suldal.no":true,"sund.no":true,"sunndal.no":true,"surnadal.no":true,"sveio.no":true,"svelvik.no":true,"sykkylven.no":true,"sogne.no":true,"xn--sgne-gra.no":true,"somna.no":true,"xn--smna-gra.no":true,"sondre-land.no":true,"xn--sndre-land-0cb.no":true,"sor-aurdal.no":true,"xn--sr-aurdal-l8a.no":true,"sor-fron.no":true,"xn--sr-fron-q1a.no":true,"sor-odal.no":true,"xn--sr-odal-q1a.no":true,"sor-varanger.no":true,"xn--sr-varanger-ggb.no":true,"matta-varjjat.no":true,"xn--mtta-vrjjat-k7af.no":true,"sorfold.no":true,"xn--srfold-bya.no":true,"sorreisa.no":true,"xn--srreisa-q1a.no":true,"sorum.no":true,"xn--srum-gra.no":true,"tana.no":true,"deatnu.no":true,"time.no":true,"tingvoll.no":true,"tinn.no":true,"tjeldsund.no":true,"dielddanuorri.no":true,"tjome.no":true,"xn--tjme-hra.no":true,"tokke.no":true,"tolga.no":true,"torsken.no":true,"tranoy.no":true,"xn--trany-yua.no":true,"tromso.no":true,"xn--troms-zua.no":true,"tromsa.no":true,"romsa.no":true,"trondheim.no":true,"troandin.no":true,"trysil.no":true,"trana.no":true,"xn--trna-woa.no":true,"trogstad.no":true,"xn--trgstad-r1a.no":true,"tvedestrand.no":true,"tydal.no":true,"tynset.no":true,"tysfjord.no":true,"divtasvuodna.no":true,"divttasvuotna.no":true,"tysnes.no":true,"tysvar.no":true,"xn--tysvr-vra.no":true,"tonsberg.no":true,"xn--tnsberg-q1a.no":true,"ullensaker.no":true,"ullensvang.no":true,"ulvik.no":true,"utsira.no":true,"vadso.no":true,"xn--vads-jra.no":true,"cahcesuolo.no":true,"xn--hcesuolo-7ya35b.no":true,"vaksdal.no":true,"valle.no":true,"vang.no":true,"vanylven.no":true,"vardo.no":true,"xn--vard-jra.no":true,"varggat.no":true,"xn--vrggt-xqad.no":true,"vefsn.no":true,"vaapste.no":true,"vega.no":true,"vegarshei.no":true,"xn--vegrshei-c0a.no":true,"vennesla.no":true,"verdal.no":true,"verran.no":true,"vestby.no":true,"vestnes.no":true,"vestre-slidre.no":true,"vestre-toten.no":true,"vestvagoy.no":true,"xn--vestvgy-ixa6o.no":true,"vevelstad.no":true,"vik.no":true,"vikna.no":true,"vindafjord.no":true,"volda.no":true,"voss.no":true,"varoy.no":true,"xn--vry-yla5g.no":true,"vagan.no":true,"xn--vgan-qoa.no":true,"voagat.no":true,"vagsoy.no":true,"xn--vgsy-qoa0j.no":true,"vaga.no":true,"xn--vg-yiab.no":true,"valer.ostfold.no":true,"xn--vler-qoa.xn--stfold-9xa.no":true,"valer.hedmark.no":true,"xn--vler-qoa.hedmark.no":true,"*.np":true,"nr":true,"biz.nr":true,"info.nr":true,"gov.nr":true,"edu.nr":true,"org.nr":true,"net.nr":true,"com.nr":true,"nu":true,"*.nz":true,"*.om":true,"mediaphone.om":false,"nawrastelecom.om":false,"nawras.om":false,"omanmobile.om":false,"omanpost.om":false,"omantel.om":false,"rakpetroleum.om":false,"siemens.om":false,"songfest.om":false,"statecouncil.om":false,"org":true,"pa":true,"ac.pa":true,"gob.pa":true,"com.pa":true,"org.pa":true,"sld.pa":true,"edu.pa":true,"net.pa":true,"ing.pa":true,"abo.pa":true,"med.pa":true,"nom.pa":true,"pe":true,"edu.pe":true,"gob.pe":true,"nom.pe":true,"mil.pe":true,"org.pe":true,"com.pe":true,"net.pe":true,"pf":true,"com.pf":true,"org.pf":true,"edu.pf":true,"*.pg":true,"ph":true,"com.ph":true,"net.ph":true,"org.ph":true,"gov.ph":true,"edu.ph":true,"ngo.ph":true,"mil.ph":true,"i.ph":true,"pk":true,"com.pk":true,"net.pk":true,"edu.pk":true,"org.pk":true,"fam.pk":true,"biz.pk":true,"web.pk":true,"gov.pk":true,"gob.pk":true,"gok.pk":true,"gon.pk":true,"gop.pk":true,"gos.pk":true,"info.pk":true,"pl":true,"aid.pl":true,"agro.pl":true,"atm.pl":true,"auto.pl":true,"biz.pl":true,"com.pl":true,"edu.pl":true,"gmina.pl":true,"gsm.pl":true,"info.pl":true,"mail.pl":true,"miasta.pl":true,"media.pl":true,"mil.pl":true,"net.pl":true,"nieruchomosci.pl":true,"nom.pl":true,"org.pl":true,"pc.pl":true,"powiat.pl":true,"priv.pl":true,"realestate.pl":true,"rel.pl":true,"sex.pl":true,"shop.pl":true,"sklep.pl":true,"sos.pl":true,"szkola.pl":true,"targi.pl":true,"tm.pl":true,"tourism.pl":true,"travel.pl":true,"turystyka.pl":true,"6bone.pl":true,"art.pl":true,"mbone.pl":true,"gov.pl":true,"uw.gov.pl":true,"um.gov.pl":true,"ug.gov.pl":true,"upow.gov.pl":true,"starostwo.gov.pl":true,"so.gov.pl":true,"sr.gov.pl":true,"po.gov.pl":true,"pa.gov.pl":true,"ngo.pl":true,"irc.pl":true,"usenet.pl":true,"augustow.pl":true,"babia-gora.pl":true,"bedzin.pl":true,"beskidy.pl":true,"bialowieza.pl":true,"bialystok.pl":true,"bielawa.pl":true,"bieszczady.pl":true,"boleslawiec.pl":true,"bydgoszcz.pl":true,"bytom.pl":true,"cieszyn.pl":true,"czeladz.pl":true,"czest.pl":true,"dlugoleka.pl":true,"elblag.pl":true,"elk.pl":true,"glogow.pl":true,"gniezno.pl":true,"gorlice.pl":true,"grajewo.pl":true,"ilawa.pl":true,"jaworzno.pl":true,"jelenia-gora.pl":true,"jgora.pl":true,"kalisz.pl":true,"kazimierz-dolny.pl":true,"karpacz.pl":true,"kartuzy.pl":true,"kaszuby.pl":true,"katowice.pl":true,"kepno.pl":true,"ketrzyn.pl":true,"klodzko.pl":true,"kobierzyce.pl":true,"kolobrzeg.pl":true,"konin.pl":true,"konskowola.pl":true,"kutno.pl":true,"lapy.pl":true,"lebork.pl":true,"legnica.pl":true,"lezajsk.pl":true,"limanowa.pl":true,"lomza.pl":true,"lowicz.pl":true,"lubin.pl":true,"lukow.pl":true,"malbork.pl":true,"malopolska.pl":true,"mazowsze.pl":true,"mazury.pl":true,"mielec.pl":true,"mielno.pl":true,"mragowo.pl":true,"naklo.pl":true,"nowaruda.pl":true,"nysa.pl":true,"olawa.pl":true,"olecko.pl":true,"olkusz.pl":true,"olsztyn.pl":true,"opoczno.pl":true,"opole.pl":true,"ostroda.pl":true,"ostroleka.pl":true,"ostrowiec.pl":true,"ostrowwlkp.pl":true,"pila.pl":true,"pisz.pl":true,"podhale.pl":true,"podlasie.pl":true,"polkowice.pl":true,"pomorze.pl":true,"pomorskie.pl":true,"prochowice.pl":true,"pruszkow.pl":true,"przeworsk.pl":true,"pulawy.pl":true,"radom.pl":true,"rawa-maz.pl":true,"rybnik.pl":true,"rzeszow.pl":true,"sanok.pl":true,"sejny.pl":true,"siedlce.pl":true,"slask.pl":true,"slupsk.pl":true,"sosnowiec.pl":true,"stalowa-wola.pl":true,"skoczow.pl":true,"starachowice.pl":true,"stargard.pl":true,"suwalki.pl":true,"swidnica.pl":true,"swiebodzin.pl":true,"swinoujscie.pl":true,"szczecin.pl":true,"szczytno.pl":true,"tarnobrzeg.pl":true,"tgory.pl":true,"turek.pl":true,"tychy.pl":true,"ustka.pl":true,"walbrzych.pl":true,"warmia.pl":true,"warszawa.pl":true,"waw.pl":true,"wegrow.pl":true,"wielun.pl":true,"wlocl.pl":true,"wloclawek.pl":true,"wodzislaw.pl":true,"wolomin.pl":true,"wroclaw.pl":true,"zachpomor.pl":true,"zagan.pl":true,"zarow.pl":true,"zgora.pl":true,"zgorzelec.pl":true,"gda.pl":true,"gdansk.pl":true,"gdynia.pl":true,"med.pl":true,"sopot.pl":true,"gliwice.pl":true,"krakow.pl":true,"poznan.pl":true,"wroc.pl":true,"zakopane.pl":true,"pm":true,"pn":true,"gov.pn":true,"co.pn":true,"org.pn":true,"edu.pn":true,"net.pn":true,"pr":true,"com.pr":true,"net.pr":true,"org.pr":true,"gov.pr":true,"edu.pr":true,"isla.pr":true,"pro.pr":true,"biz.pr":true,"info.pr":true,"name.pr":true,"est.pr":true,"prof.pr":true,"ac.pr":true,"pro":true,"aca.pro":true,"bar.pro":true,"cpa.pro":true,"jur.pro":true,"law.pro":true,"med.pro":true,"eng.pro":true,"ps":true,"edu.ps":true,"gov.ps":true,"sec.ps":true,"plo.ps":true,"com.ps":true,"org.ps":true,"net.ps":true,"pt":true,"net.pt":true,"gov.pt":true,"org.pt":true,"edu.pt":true,"int.pt":true,"publ.pt":true,"com.pt":true,"nome.pt":true,"pw":true,"co.pw":true,"ne.pw":true,"or.pw":true,"ed.pw":true,"go.pw":true,"belau.pw":true,"*.py":true,"qa":true,"com.qa":true,"edu.qa":true,"gov.qa":true,"mil.qa":true,"name.qa":true,"net.qa":true,"org.qa":true,"sch.qa":true,"re":true,"com.re":true,"asso.re":true,"nom.re":true,"ro":true,"com.ro":true,"org.ro":true,"tm.ro":true,"nt.ro":true,"nom.ro":true,"info.ro":true,"rec.ro":true,"arts.ro":true,"firm.ro":true,"store.ro":true,"www.ro":true,"rs":true,"co.rs":true,"org.rs":true,"edu.rs":true,"ac.rs":true,"gov.rs":true,"in.rs":true,"ru":true,"ac.ru":true,"com.ru":true,"edu.ru":true,"int.ru":true,"net.ru":true,"org.ru":true,"pp.ru":true,"adygeya.ru":true,"altai.ru":true,"amur.ru":true,"arkhangelsk.ru":true,"astrakhan.ru":true,"bashkiria.ru":true,"belgorod.ru":true,"bir.ru":true,"bryansk.ru":true,"buryatia.ru":true,"cbg.ru":true,"chel.ru":true,"chelyabinsk.ru":true,"chita.ru":true,"chukotka.ru":true,"chuvashia.ru":true,"dagestan.ru":true,"dudinka.ru":true,"e-burg.ru":true,"grozny.ru":true,"irkutsk.ru":true,"ivanovo.ru":true,"izhevsk.ru":true,"jar.ru":true,"joshkar-ola.ru":true,"kalmykia.ru":true,"kaluga.ru":true,"kamchatka.ru":true,"karelia.ru":true,"kazan.ru":true,"kchr.ru":true,"kemerovo.ru":true,"khabarovsk.ru":true,"khakassia.ru":true,"khv.ru":true,"kirov.ru":true,"koenig.ru":true,"komi.ru":true,"kostroma.ru":true,"krasnoyarsk.ru":true,"kuban.ru":true,"kurgan.ru":true,"kursk.ru":true,"lipetsk.ru":true,"magadan.ru":true,"mari.ru":true,"mari-el.ru":true,"marine.ru":true,"mordovia.ru":true,"mosreg.ru":true,"msk.ru":true,"murmansk.ru":true,"nalchik.ru":true,"nnov.ru":true,"nov.ru":true,"novosibirsk.ru":true,"nsk.ru":true,"omsk.ru":true,"orenburg.ru":true,"oryol.ru":true,"palana.ru":true,"penza.ru":true,"perm.ru":true,"pskov.ru":true,"ptz.ru":true,"rnd.ru":true,"ryazan.ru":true,"sakhalin.ru":true,"samara.ru":true,"saratov.ru":true,"simbirsk.ru":true,"smolensk.ru":true,"spb.ru":true,"stavropol.ru":true,"stv.ru":true,"surgut.ru":true,"tambov.ru":true,"tatarstan.ru":true,"tom.ru":true,"tomsk.ru":true,"tsaritsyn.ru":true,"tsk.ru":true,"tula.ru":true,"tuva.ru":true,"tver.ru":true,"tyumen.ru":true,"udm.ru":true,"udmurtia.ru":true,"ulan-ude.ru":true,"vladikavkaz.ru":true,"vladimir.ru":true,"vladivostok.ru":true,"volgograd.ru":true,"vologda.ru":true,"voronezh.ru":true,"vrn.ru":true,"vyatka.ru":true,"yakutia.ru":true,"yamal.ru":true,"yaroslavl.ru":true,"yekaterinburg.ru":true,"yuzhno-sakhalinsk.ru":true,"amursk.ru":true,"baikal.ru":true,"cmw.ru":true,"fareast.ru":true,"jamal.ru":true,"kms.ru":true,"k-uralsk.ru":true,"kustanai.ru":true,"kuzbass.ru":true,"magnitka.ru":true,"mytis.ru":true,"nakhodka.ru":true,"nkz.ru":true,"norilsk.ru":true,"oskol.ru":true,"pyatigorsk.ru":true,"rubtsovsk.ru":true,"snz.ru":true,"syzran.ru":true,"vdonsk.ru":true,"zgrad.ru":true,"gov.ru":true,"mil.ru":true,"test.ru":true,"rw":true,"gov.rw":true,"net.rw":true,"edu.rw":true,"ac.rw":true,"com.rw":true,"co.rw":true,"int.rw":true,"mil.rw":true,"gouv.rw":true,"sa":true,"com.sa":true,"net.sa":true,"org.sa":true,"gov.sa":true,"med.sa":true,"pub.sa":true,"edu.sa":true,"sch.sa":true,"sb":true,"com.sb":true,"edu.sb":true,"gov.sb":true,"net.sb":true,"org.sb":true,"sc":true,"com.sc":true,"gov.sc":true,"net.sc":true,"org.sc":true,"edu.sc":true,"sd":true,"com.sd":true,"net.sd":true,"org.sd":true,"edu.sd":true,"med.sd":true,"gov.sd":true,"info.sd":true,"se":true,"a.se":true,"ac.se":true,"b.se":true,"bd.se":true,"brand.se":true,"c.se":true,"d.se":true,"e.se":true,"f.se":true,"fh.se":true,"fhsk.se":true,"fhv.se":true,"g.se":true,"h.se":true,"i.se":true,"k.se":true,"komforb.se":true,"kommunalforbund.se":true,"komvux.se":true,"l.se":true,"lanbib.se":true,"m.se":true,"n.se":true,"naturbruksgymn.se":true,"o.se":true,"org.se":true,"p.se":true,"parti.se":true,"pp.se":true,"press.se":true,"r.se":true,"s.se":true,"sshn.se":true,"t.se":true,"tm.se":true,"u.se":true,"w.se":true,"x.se":true,"y.se":true,"z.se":true,"sg":true,"com.sg":true,"net.sg":true,"org.sg":true,"gov.sg":true,"edu.sg":true,"per.sg":true,"sh":true,"si":true,"sk":true,"sl":true,"com.sl":true,"net.sl":true,"edu.sl":true,"gov.sl":true,"org.sl":true,"sm":true,"sn":true,"art.sn":true,"com.sn":true,"edu.sn":true,"gouv.sn":true,"org.sn":true,"perso.sn":true,"univ.sn":true,"so":true,"com.so":true,"net.so":true,"org.so":true,"sr":true,"st":true,"co.st":true,"com.st":true,"consulado.st":true,"edu.st":true,"embaixada.st":true,"gov.st":true,"mil.st":true,"net.st":true,"org.st":true,"principe.st":true,"saotome.st":true,"store.st":true,"su":true,"*.sv":true,"sy":true,"edu.sy":true,"gov.sy":true,"net.sy":true,"mil.sy":true,"com.sy":true,"org.sy":true,"sz":true,"co.sz":true,"ac.sz":true,"org.sz":true,"tc":true,"td":true,"tel":true,"tf":true,"tg":true,"th":true,"ac.th":true,"co.th":true,"go.th":true,"in.th":true,"mi.th":true,"net.th":true,"or.th":true,"tj":true,"ac.tj":true,"biz.tj":true,"co.tj":true,"com.tj":true,"edu.tj":true,"go.tj":true,"gov.tj":true,"int.tj":true,"mil.tj":true,"name.tj":true,"net.tj":true,"nic.tj":true,"org.tj":true,"test.tj":true,"web.tj":true,"tk":true,"tl":true,"gov.tl":true,"tm":true,"tn":true,"com.tn":true,"ens.tn":true,"fin.tn":true,"gov.tn":true,"ind.tn":true,"intl.tn":true,"nat.tn":true,"net.tn":true,"org.tn":true,"info.tn":true,"perso.tn":true,"tourism.tn":true,"edunet.tn":true,"rnrt.tn":true,"rns.tn":true,"rnu.tn":true,"mincom.tn":true,"agrinet.tn":true,"defense.tn":true,"turen.tn":true,"to":true,"com.to":true,"gov.to":true,"net.to":true,"org.to":true,"edu.to":true,"mil.to":true,"*.tr":true,"nic.tr":false,"gov.nc.tr":true,"travel":true,"tt":true,"co.tt":true,"com.tt":true,"org.tt":true,"net.tt":true,"biz.tt":true,"info.tt":true,"pro.tt":true,"int.tt":true,"coop.tt":true,"jobs.tt":true,"mobi.tt":true,"travel.tt":true,"museum.tt":true,"aero.tt":true,"name.tt":true,"gov.tt":true,"edu.tt":true,"tv":true,"tw":true,"edu.tw":true,"gov.tw":true,"mil.tw":true,"com.tw":true,"net.tw":true,"org.tw":true,"idv.tw":true,"game.tw":true,"ebiz.tw":true,"club.tw":true,"xn--zf0ao64a.tw":true,"xn--uc0atv.tw":true,"xn--czrw28b.tw":true,"ac.tz":true,"co.tz":true,"go.tz":true,"mil.tz":true,"ne.tz":true,"or.tz":true,"sc.tz":true,"ua":true,"com.ua":true,"edu.ua":true,"gov.ua":true,"in.ua":true,"net.ua":true,"org.ua":true,"cherkassy.ua":true,"chernigov.ua":true,"chernovtsy.ua":true,"ck.ua":true,"cn.ua":true,"crimea.ua":true,"cv.ua":true,"dn.ua":true,"dnepropetrovsk.ua":true,"donetsk.ua":true,"dp.ua":true,"if.ua":true,"ivano-frankivsk.ua":true,"kh.ua":true,"kharkov.ua":true,"kherson.ua":true,"khmelnitskiy.ua":true,"kiev.ua":true,"kirovograd.ua":true,"km.ua":true,"kr.ua":true,"ks.ua":true,"kv.ua":true,"lg.ua":true,"lugansk.ua":true,"lutsk.ua":true,"lviv.ua":true,"mk.ua":true,"nikolaev.ua":true,"od.ua":true,"odessa.ua":true,"pl.ua":true,"poltava.ua":true,"rovno.ua":true,"rv.ua":true,"sebastopol.ua":true,"sumy.ua":true,"te.ua":true,"ternopil.ua":true,"uzhgorod.ua":true,"vinnica.ua":true,"vn.ua":true,"zaporizhzhe.ua":true,"zp.ua":true,"zhitomir.ua":true,"zt.ua":true,"co.ua":true,"pp.ua":true,"ug":true,"co.ug":true,"ac.ug":true,"sc.ug":true,"go.ug":true,"ne.ug":true,"or.ug":true,"*.uk":true,"*.sch.uk":true,"bl.uk":false,"british-library.uk":false,"icnet.uk":false,"jet.uk":false,"mod.uk":false,"nel.uk":false,"nhs.uk":false,"nic.uk":false,"nls.uk":false,"national-library-scotland.uk":false,"parliament.uk":false,"police.uk":false,"us":true,"dni.us":true,"fed.us":true,"isa.us":true,"kids.us":true,"nsn.us":true,"ak.us":true,"al.us":true,"ar.us":true,"as.us":true,"az.us":true,"ca.us":true,"co.us":true,"ct.us":true,"dc.us":true,"de.us":true,"fl.us":true,"ga.us":true,"gu.us":true,"hi.us":true,"ia.us":true,"id.us":true,"il.us":true,"in.us":true,"ks.us":true,"ky.us":true,"la.us":true,"ma.us":true,"md.us":true,"me.us":true,"mi.us":true,"mn.us":true,"mo.us":true,"ms.us":true,"mt.us":true,"nc.us":true,"nd.us":true,"ne.us":true,"nh.us":true,"nj.us":true,"nm.us":true,"nv.us":true,"ny.us":true,"oh.us":true,"ok.us":true,"or.us":true,"pa.us":true,"pr.us":true,"ri.us":true,"sc.us":true,"sd.us":true,"tn.us":true,"tx.us":true,"ut.us":true,"vi.us":true,"vt.us":true,"va.us":true,"wa.us":true,"wi.us":true,"wv.us":true,"wy.us":true,"k12.ak.us":true,"k12.al.us":true,"k12.ar.us":true,"k12.as.us":true,"k12.az.us":true,"k12.ca.us":true,"k12.co.us":true,"k12.ct.us":true,"k12.dc.us":true,"k12.de.us":true,"k12.fl.us":true,"k12.ga.us":true,"k12.gu.us":true,"k12.ia.us":true,"k12.id.us":true,"k12.il.us":true,"k12.in.us":true,"k12.ks.us":true,"k12.ky.us":true,"k12.la.us":true,"k12.ma.us":true,"k12.md.us":true,"k12.me.us":true,"k12.mi.us":true,"k12.mn.us":true,"k12.mo.us":true,"k12.ms.us":true,"k12.mt.us":true,"k12.nc.us":true,"k12.nd.us":true,"k12.ne.us":true,"k12.nh.us":true,"k12.nj.us":true,"k12.nm.us":true,"k12.nv.us":true,"k12.ny.us":true,"k12.oh.us":true,"k12.ok.us":true,"k12.or.us":true,"k12.pa.us":true,"k12.pr.us":true,"k12.ri.us":true,"k12.sc.us":true,"k12.sd.us":true,"k12.tn.us":true,"k12.tx.us":true,"k12.ut.us":true,"k12.vi.us":true,"k12.vt.us":true,"k12.va.us":true,"k12.wa.us":true,"k12.wi.us":true,"k12.wv.us":true,"k12.wy.us":true,"cc.ak.us":true,"cc.al.us":true,"cc.ar.us":true,"cc.as.us":true,"cc.az.us":true,"cc.ca.us":true,"cc.co.us":true,"cc.ct.us":true,"cc.dc.us":true,"cc.de.us":true,"cc.fl.us":true,"cc.ga.us":true,"cc.gu.us":true,"cc.hi.us":true,"cc.ia.us":true,"cc.id.us":true,"cc.il.us":true,"cc.in.us":true,"cc.ks.us":true,"cc.ky.us":true,"cc.la.us":true,"cc.ma.us":true,"cc.md.us":true,"cc.me.us":true,"cc.mi.us":true,"cc.mn.us":true,"cc.mo.us":true,"cc.ms.us":true,"cc.mt.us":true,"cc.nc.us":true,"cc.nd.us":true,"cc.ne.us":true,"cc.nh.us":true,"cc.nj.us":true,"cc.nm.us":true,"cc.nv.us":true,"cc.ny.us":true,"cc.oh.us":true,"cc.ok.us":true,"cc.or.us":true,"cc.pa.us":true,"cc.pr.us":true,"cc.ri.us":true,"cc.sc.us":true,"cc.sd.us":true,"cc.tn.us":true,"cc.tx.us":true,"cc.ut.us":true,"cc.vi.us":true,"cc.vt.us":true,"cc.va.us":true,"cc.wa.us":true,"cc.wi.us":true,"cc.wv.us":true,"cc.wy.us":true,"lib.ak.us":true,"lib.al.us":true,"lib.ar.us":true,"lib.as.us":true,"lib.az.us":true,"lib.ca.us":true,"lib.co.us":true,"lib.ct.us":true,"lib.dc.us":true,"lib.de.us":true,"lib.fl.us":true,"lib.ga.us":true,"lib.gu.us":true,"lib.hi.us":true,"lib.ia.us":true,"lib.id.us":true,"lib.il.us":true,"lib.in.us":true,"lib.ks.us":true,"lib.ky.us":true,"lib.la.us":true,"lib.ma.us":true,"lib.md.us":true,"lib.me.us":true,"lib.mi.us":true,"lib.mn.us":true,"lib.mo.us":true,"lib.ms.us":true,"lib.mt.us":true,"lib.nc.us":true,"lib.nd.us":true,"lib.ne.us":true,"lib.nh.us":true,"lib.nj.us":true,"lib.nm.us":true,"lib.nv.us":true,"lib.ny.us":true,"lib.oh.us":true,"lib.ok.us":true,"lib.or.us":true,"lib.pa.us":true,"lib.pr.us":true,"lib.ri.us":true,"lib.sc.us":true,"lib.sd.us":true,"lib.tn.us":true,"lib.tx.us":true,"lib.ut.us":true,"lib.vi.us":true,"lib.vt.us":true,"lib.va.us":true,"lib.wa.us":true,"lib.wi.us":true,"lib.wv.us":true,"lib.wy.us":true,"pvt.k12.ma.us":true,"chtr.k12.ma.us":true,"paroch.k12.ma.us":true,"*.uy":true,"uz":true,"com.uz":true,"co.uz":true,"va":true,"vc":true,"com.vc":true,"net.vc":true,"org.vc":true,"gov.vc":true,"mil.vc":true,"edu.vc":true,"*.ve":true,"vg":true,"vi":true,"co.vi":true,"com.vi":true,"k12.vi":true,"net.vi":true,"org.vi":true,"vn":true,"com.vn":true,"net.vn":true,"org.vn":true,"edu.vn":true,"gov.vn":true,"int.vn":true,"ac.vn":true,"biz.vn":true,"info.vn":true,"name.vn":true,"pro.vn":true,"health.vn":true,"vu":true,"wf":true,"ws":true,"com.ws":true,"net.ws":true,"org.ws":true,"gov.ws":true,"edu.ws":true,"yt":true,"xn--mgbaam7a8h":true,"xn--54b7fta0cc":true,"xn--fiqs8s":true,"xn--fiqz9s":true,"xn--lgbbat1ad8j":true,"xn--wgbh1c":true,"xn--node":true,"xn--j6w193g":true,"xn--h2brj9c":true,"xn--mgbbh1a71e":true,"xn--fpcrj9c3d":true,"xn--gecrj9c":true,"xn--s9brj9c":true,"xn--45brj9c":true,"xn--xkc2dl3a5ee0h":true,"xn--mgba3a4f16a":true,"xn--mgba3a4fra":true,"xn--mgbayh7gpa":true,"xn--3e0b707e":true,"xn--fzc2c9e2c":true,"xn--xkc2al3hye2a":true,"xn--mgbc0a9azcg":true,"xn--mgb9awbf":true,"xn--ygbi2ammx":true,"xn--90a3ac":true,"xn--p1ai":true,"xn--wgbl6a":true,"xn--mgberp4a5d4ar":true,"xn--mgberp4a5d4a87g":true,"xn--mgbqly7c0a67fbc":true,"xn--mgbqly7cvafr":true,"xn--ogbpf8fl":true,"xn--mgbtf8fl":true,"xn--yfro4i67o":true,"xn--clchc0ea0b2g2a9gcd":true,"xn--o3cw4h":true,"xn--pgbs0dh":true,"xn--kpry57d":true,"xn--kprw13d":true,"xn--nnx388a":true,"xn--j1amh":true,"xn--mgb2ddes":true,"xxx":true,"*.ye":true,"*.za":true,"*.zm":true,"*.zw":true,"biz.at":true,"info.at":true,"priv.at":true,"co.ca":true,"ar.com":true,"br.com":true,"cn.com":true,"de.com":true,"eu.com":true,"gb.com":true,"gr.com":true,"hu.com":true,"jpn.com":true,"kr.com":true,"no.com":true,"qc.com":true,"ru.com":true,"sa.com":true,"se.com":true,"uk.com":true,"us.com":true,"uy.com":true,"za.com":true,"gb.net":true,"jp.net":true,"se.net":true,"uk.net":true,"ae.org":true,"us.org":true,"com.de":true,"operaunite.com":true,"appspot.com":true,"iki.fi":true,"c.la":true,"za.net":true,"za.org":true,"co.nl":true,"co.no":true,"co.pl":true,"dyndns-at-home.com":true,"dyndns-at-work.com":true,"dyndns-blog.com":true,"dyndns-free.com":true,"dyndns-home.com":true,"dyndns-ip.com":true,"dyndns-mail.com":true,"dyndns-office.com":true,"dyndns-pics.com":true,"dyndns-remote.com":true,"dyndns-server.com":true,"dyndns-web.com":true,"dyndns-wiki.com":true,"dyndns-work.com":true,"dyndns.biz":true,"dyndns.info":true,"dyndns.org":true,"dyndns.tv":true,"at-band-camp.net":true,"ath.cx":true,"barrel-of-knowledge.info":true,"barrell-of-knowledge.info":true,"better-than.tv":true,"blogdns.com":true,"blogdns.net":true,"blogdns.org":true,"blogsite.org":true,"boldlygoingnowhere.org":true,"broke-it.net":true,"buyshouses.net":true,"cechire.com":true,"dnsalias.com":true,"dnsalias.net":true,"dnsalias.org":true,"dnsdojo.com":true,"dnsdojo.net":true,"dnsdojo.org":true,"does-it.net":true,"doesntexist.com":true,"doesntexist.org":true,"dontexist.com":true,"dontexist.net":true,"dontexist.org":true,"doomdns.com":true,"doomdns.org":true,"dvrdns.org":true,"dyn-o-saur.com":true,"dynalias.com":true,"dynalias.net":true,"dynalias.org":true,"dynathome.net":true,"dyndns.ws":true,"endofinternet.net":true,"endofinternet.org":true,"endoftheinternet.org":true,"est-a-la-maison.com":true,"est-a-la-masion.com":true,"est-le-patron.com":true,"est-mon-blogueur.com":true,"for-better.biz":true,"for-more.biz":true,"for-our.info":true,"for-some.biz":true,"for-the.biz":true,"forgot.her.name":true,"forgot.his.name":true,"from-ak.com":true,"from-al.com":true,"from-ar.com":true,"from-az.net":true,"from-ca.com":true,"from-co.net":true,"from-ct.com":true,"from-dc.com":true,"from-de.com":true,"from-fl.com":true,"from-ga.com":true,"from-hi.com":true,"from-ia.com":true,"from-id.com":true,"from-il.com":true,"from-in.com":true,"from-ks.com":true,"from-ky.com":true,"from-la.net":true,"from-ma.com":true,"from-md.com":true,"from-me.org":true,"from-mi.com":true,"from-mn.com":true,"from-mo.com":true,"from-ms.com":true,"from-mt.com":true,"from-nc.com":true,"from-nd.com":true,"from-ne.com":true,"from-nh.com":true,"from-nj.com":true,"from-nm.com":true,"from-nv.com":true,"from-ny.net":true,"from-oh.com":true,"from-ok.com":true,"from-or.com":true,"from-pa.com":true,"from-pr.com":true,"from-ri.com":true,"from-sc.com":true,"from-sd.com":true,"from-tn.com":true,"from-tx.com":true,"from-ut.com":true,"from-va.com":true,"from-vt.com":true,"from-wa.com":true,"from-wi.com":true,"from-wv.com":true,"from-wy.com":true,"ftpaccess.cc":true,"fuettertdasnetz.de":true,"game-host.org":true,"game-server.cc":true,"getmyip.com":true,"gets-it.net":true,"go.dyndns.org":true,"gotdns.com":true,"gotdns.org":true,"groks-the.info":true,"groks-this.info":true,"ham-radio-op.net":true,"here-for-more.info":true,"hobby-site.com":true,"hobby-site.org":true,"home.dyndns.org":true,"homedns.org":true,"homeftp.net":true,"homeftp.org":true,"homeip.net":true,"homelinux.com":true,"homelinux.net":true,"homelinux.org":true,"homeunix.com":true,"homeunix.net":true,"homeunix.org":true,"iamallama.com":true,"in-the-band.net":true,"is-a-anarchist.com":true,"is-a-blogger.com":true,"is-a-bookkeeper.com":true,"is-a-bruinsfan.org":true,"is-a-bulls-fan.com":true,"is-a-candidate.org":true,"is-a-caterer.com":true,"is-a-celticsfan.org":true,"is-a-chef.com":true,"is-a-chef.net":true,"is-a-chef.org":true,"is-a-conservative.com":true,"is-a-cpa.com":true,"is-a-cubicle-slave.com":true,"is-a-democrat.com":true,"is-a-designer.com":true,"is-a-doctor.com":true,"is-a-financialadvisor.com":true,"is-a-geek.com":true,"is-a-geek.net":true,"is-a-geek.org":true,"is-a-green.com":true,"is-a-guru.com":true,"is-a-hard-worker.com":true,"is-a-hunter.com":true,"is-a-knight.org":true,"is-a-landscaper.com":true,"is-a-lawyer.com":true,"is-a-liberal.com":true,"is-a-libertarian.com":true,"is-a-linux-user.org":true,"is-a-llama.com":true,"is-a-musician.com":true,"is-a-nascarfan.com":true,"is-a-nurse.com":true,"is-a-painter.com":true,"is-a-patsfan.org":true,"is-a-personaltrainer.com":true,"is-a-photographer.com":true,"is-a-player.com":true,"is-a-republican.com":true,"is-a-rockstar.com":true,"is-a-socialist.com":true,"is-a-soxfan.org":true,"is-a-student.com":true,"is-a-teacher.com":true,"is-a-techie.com":true,"is-a-therapist.com":true,"is-an-accountant.com":true,"is-an-actor.com":true,"is-an-actress.com":true,"is-an-anarchist.com":true,"is-an-artist.com":true,"is-an-engineer.com":true,"is-an-entertainer.com":true,"is-by.us":true,"is-certified.com":true,"is-found.org":true,"is-gone.com":true,"is-into-anime.com":true,"is-into-cars.com":true,"is-into-cartoons.com":true,"is-into-games.com":true,"is-leet.com":true,"is-lost.org":true,"is-not-certified.com":true,"is-saved.org":true,"is-slick.com":true,"is-uberleet.com":true,"is-very-bad.org":true,"is-very-evil.org":true,"is-very-good.org":true,"is-very-nice.org":true,"is-very-sweet.org":true,"is-with-theband.com":true,"isa-geek.com":true,"isa-geek.net":true,"isa-geek.org":true,"isa-hockeynut.com":true,"issmarterthanyou.com":true,"isteingeek.de":true,"istmein.de":true,"kicks-ass.net":true,"kicks-ass.org":true,"knowsitall.info":true,"land-4-sale.us":true,"lebtimnetz.de":true,"leitungsen.de":true,"likes-pie.com":true,"likescandy.com":true,"merseine.nu":true,"mine.nu":true,"misconfused.org":true,"mypets.ws":true,"myphotos.cc":true,"neat-url.com":true,"office-on-the.net":true,"on-the-web.tv":true,"podzone.net":true,"podzone.org":true,"readmyblog.org":true,"saves-the-whales.com":true,"scrapper-site.net":true,"scrapping.cc":true,"selfip.biz":true,"selfip.com":true,"selfip.info":true,"selfip.net":true,"selfip.org":true,"sells-for-less.com":true,"sells-for-u.com":true,"sells-it.net":true,"sellsyourhome.org":true,"servebbs.com":true,"servebbs.net":true,"servebbs.org":true,"serveftp.net":true,"serveftp.org":true,"servegame.org":true,"shacknet.nu":true,"simple-url.com":true,"space-to-rent.com":true,"stuff-4-sale.org":true,"stuff-4-sale.us":true,"teaches-yoga.com":true,"thruhere.net":true,"traeumtgerade.de":true,"webhop.biz":true,"webhop.info":true,"webhop.net":true,"webhop.org":true,"worse-than.tv":true,"writesthisblog.com":true}); |
|
|
|
// END of automatically generated file |
|
|
|
},{}],136:[function(require,module,exports){ |
|
'use strict'; |
|
/*jshint unused:false */ |
|
|
|
function Store() { |
|
} |
|
exports.Store = Store; |
|
|
|
// Stores may be synchronous, but are still required to use a |
|
// Continuation-Passing Style API. The CookieJar itself will expose a "*Sync" |
|
// API that converts from synchronous-callbacks to imperative style. |
|
Store.prototype.synchronous = false; |
|
|
|
Store.prototype.findCookie = function(domain, path, key, cb) { |
|
throw new Error('findCookie is not implemented'); |
|
}; |
|
|
|
Store.prototype.findCookies = function(domain, path, cb) { |
|
throw new Error('findCookies is not implemented'); |
|
}; |
|
|
|
Store.prototype.putCookie = function(cookie, cb) { |
|
throw new Error('putCookie is not implemented'); |
|
}; |
|
|
|
Store.prototype.updateCookie = function(oldCookie, newCookie, cb) { |
|
// recommended default implementation: |
|
// return this.putCookie(newCookie, cb); |
|
throw new Error('updateCookie is not implemented'); |
|
}; |
|
|
|
Store.prototype.removeCookie = function(domain, path, key, cb) { |
|
throw new Error('removeCookie is not implemented'); |
|
}; |
|
|
|
Store.prototype.removeCookies = function removeCookies(domain, path, cb) { |
|
throw new Error('removeCookies is not implemented'); |
|
}; |
|
|
|
},{}],137:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
'use strict' |
|
|
|
var net = require('net') |
|
, tls = require('tls') |
|
, http = require('http') |
|
, https = require('https') |
|
, events = require('events') |
|
, assert = require('assert') |
|
, util = require('util') |
|
; |
|
|
|
exports.httpOverHttp = httpOverHttp |
|
exports.httpsOverHttp = httpsOverHttp |
|
exports.httpOverHttps = httpOverHttps |
|
exports.httpsOverHttps = httpsOverHttps |
|
|
|
|
|
function httpOverHttp(options) { |
|
var agent = new TunnelingAgent(options) |
|
agent.request = http.request |
|
return agent |
|
} |
|
|
|
function httpsOverHttp(options) { |
|
var agent = new TunnelingAgent(options) |
|
agent.request = http.request |
|
agent.createSocket = createSecureSocket |
|
return agent |
|
} |
|
|
|
function httpOverHttps(options) { |
|
var agent = new TunnelingAgent(options) |
|
agent.request = https.request |
|
return agent |
|
} |
|
|
|
function httpsOverHttps(options) { |
|
var agent = new TunnelingAgent(options) |
|
agent.request = https.request |
|
agent.createSocket = createSecureSocket |
|
return agent |
|
} |
|
|
|
|
|
function TunnelingAgent(options) { |
|
var self = this |
|
self.options = options || {} |
|
self.proxyOptions = self.options.proxy || {} |
|
self.maxSockets = self.options.maxSockets || http.Agent.defaultMaxSockets |
|
self.requests = [] |
|
self.sockets = [] |
|
|
|
self.on('free', function onFree(socket, host, port) { |
|
for (var i = 0, len = self.requests.length; i < len; ++i) { |
|
var pending = self.requests[i] |
|
if (pending.host === host && pending.port === port) { |
|
// Detect the request to connect same origin server, |
|
// reuse the connection. |
|
self.requests.splice(i, 1) |
|
pending.request.onSocket(socket) |
|
return |
|
} |
|
} |
|
socket.destroy() |
|
self.removeSocket(socket) |
|
}) |
|
} |
|
util.inherits(TunnelingAgent, events.EventEmitter) |
|
|
|
TunnelingAgent.prototype.addRequest = function addRequest(req, options) { |
|
var self = this |
|
|
|
// Legacy API: addRequest(req, host, port, path) |
|
if (typeof options === 'string') { |
|
options = { |
|
host: options, |
|
port: arguments[2], |
|
path: arguments[3] |
|
}; |
|
} |
|
|
|
if (self.sockets.length >= this.maxSockets) { |
|
// We are over limit so we'll add it to the queue. |
|
self.requests.push({host: host, port: port, request: req}) |
|
return |
|
} |
|
|
|
// If we are under maxSockets create a new one. |
|
self.createSocket({host: options.host, port: options.port, request: req}, function(socket) { |
|
socket.on('free', onFree) |
|
socket.on('close', onCloseOrRemove) |
|
socket.on('agentRemove', onCloseOrRemove) |
|
req.onSocket(socket) |
|
|
|
function onFree() { |
|
self.emit('free', socket, options.host, options.port) |
|
} |
|
|
|
function onCloseOrRemove(err) { |
|
self.removeSocket() |
|
socket.removeListener('free', onFree) |
|
socket.removeListener('close', onCloseOrRemove) |
|
socket.removeListener('agentRemove', onCloseOrRemove) |
|
} |
|
}) |
|
} |
|
|
|
TunnelingAgent.prototype.createSocket = function createSocket(options, cb) { |
|
var self = this |
|
var placeholder = {} |
|
self.sockets.push(placeholder) |
|
|
|
var connectOptions = mergeOptions({}, self.proxyOptions, |
|
{ method: 'CONNECT' |
|
, path: options.host + ':' + options.port |
|
, agent: false |
|
} |
|
) |
|
if (connectOptions.proxyAuth) { |
|
connectOptions.headers = connectOptions.headers || {} |
|
connectOptions.headers['Proxy-Authorization'] = 'Basic ' + |
|
new Buffer(connectOptions.proxyAuth).toString('base64') |
|
} |
|
|
|
debug('making CONNECT request') |
|
var connectReq = self.request(connectOptions) |
|
connectReq.useChunkedEncodingByDefault = false // for v0.6 |
|
connectReq.once('response', onResponse) // for v0.6 |
|
connectReq.once('upgrade', onUpgrade) // for v0.6 |
|
connectReq.once('connect', onConnect) // for v0.7 or later |
|
connectReq.once('error', onError) |
|
connectReq.end() |
|
|
|
function onResponse(res) { |
|
// Very hacky. This is necessary to avoid http-parser leaks. |
|
res.upgrade = true |
|
} |
|
|
|
function onUpgrade(res, socket, head) { |
|
// Hacky. |
|
process.nextTick(function() { |
|
onConnect(res, socket, head) |
|
}) |
|
} |
|
|
|
function onConnect(res, socket, head) { |
|
connectReq.removeAllListeners() |
|
socket.removeAllListeners() |
|
|
|
if (res.statusCode === 200) { |
|
assert.equal(head.length, 0) |
|
debug('tunneling connection has established') |
|
self.sockets[self.sockets.indexOf(placeholder)] = socket |
|
cb(socket) |
|
} else { |
|
debug('tunneling socket could not be established, statusCode=%d', res.statusCode) |
|
var error = new Error('tunneling socket could not be established, ' + 'statusCode=' + res.statusCode) |
|
error.code = 'ECONNRESET' |
|
options.request.emit('error', error) |
|
self.removeSocket(placeholder) |
|
} |
|
} |
|
|
|
function onError(cause) { |
|
connectReq.removeAllListeners() |
|
|
|
debug('tunneling socket could not be established, cause=%s\n', cause.message, cause.stack) |
|
var error = new Error('tunneling socket could not be established, ' + 'cause=' + cause.message) |
|
error.code = 'ECONNRESET' |
|
options.request.emit('error', error) |
|
self.removeSocket(placeholder) |
|
} |
|
} |
|
|
|
TunnelingAgent.prototype.removeSocket = function removeSocket(socket) { |
|
var pos = this.sockets.indexOf(socket) |
|
if (pos === -1) return |
|
|
|
this.sockets.splice(pos, 1) |
|
|
|
var pending = this.requests.shift() |
|
if (pending) { |
|
// If we have pending requests and a socket gets closed a new one |
|
// needs to be created to take over in the pool for the one that closed. |
|
this.createSocket(pending, function(socket) { |
|
pending.request.onSocket(socket) |
|
}) |
|
} |
|
} |
|
|
|
function createSecureSocket(options, cb) { |
|
var self = this |
|
TunnelingAgent.prototype.createSocket.call(self, options, function(socket) { |
|
// 0 is dummy port for v0.6 |
|
var secureSocket = tls.connect(0, mergeOptions({}, self.options, |
|
{ servername: options.host |
|
, socket: socket |
|
} |
|
)) |
|
cb(secureSocket) |
|
}) |
|
} |
|
|
|
|
|
function mergeOptions(target) { |
|
for (var i = 1, len = arguments.length; i < len; ++i) { |
|
var overrides = arguments[i] |
|
if (typeof overrides === 'object') { |
|
var keys = Object.keys(overrides) |
|
for (var j = 0, keyLen = keys.length; j < keyLen; ++j) { |
|
var k = keys[j] |
|
if (overrides[k] !== undefined) { |
|
target[k] = overrides[k] |
|
} |
|
} |
|
} |
|
} |
|
return target |
|
} |
|
|
|
|
|
var debug |
|
if (process.env.NODE_DEBUG && /\btunnel\b/.test(process.env.NODE_DEBUG)) { |
|
debug = function() { |
|
var args = Array.prototype.slice.call(arguments) |
|
if (typeof args[0] === 'string') { |
|
args[0] = 'TUNNEL: ' + args[0] |
|
} else { |
|
args.unshift('TUNNEL:') |
|
} |
|
console.error.apply(console, args) |
|
} |
|
} else { |
|
debug = function() {} |
|
} |
|
exports.debug = debug // for test |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"_process":323,"assert":157,"buffer":172,"events":314,"http":315,"https":319,"net":156,"tls":156,"util":343}],138:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
'use strict' |
|
|
|
var http = require('http') |
|
, https = require('https') |
|
, url = require('url') |
|
, util = require('util') |
|
, stream = require('stream') |
|
, qs = require('qs') |
|
, querystring = require('querystring') |
|
, zlib = require('zlib') |
|
, helpers = require('./lib/helpers') |
|
, bl = require('bl') |
|
, hawk = require('hawk') |
|
, aws = require('aws-sign2') |
|
, httpSignature = require('http-signature') |
|
, mime = require('mime-types') |
|
, tunnel = require('tunnel-agent') |
|
, stringstream = require('stringstream') |
|
, caseless = require('caseless') |
|
, ForeverAgent = require('forever-agent') |
|
, FormData = require('form-data') |
|
, cookies = require('./lib/cookies') |
|
, copy = require('./lib/copy') |
|
, getProxyFromURI = require('./lib/getProxyFromURI') |
|
, Har = require('./lib/har').Har |
|
, Auth = require('./lib/auth').Auth |
|
, OAuth = require('./lib/oauth').OAuth |
|
, Multipart = require('./lib/multipart').Multipart |
|
, Redirect = require('./lib/redirect').Redirect |
|
|
|
var safeStringify = helpers.safeStringify |
|
, isReadStream = helpers.isReadStream |
|
, toBase64 = helpers.toBase64 |
|
, defer = helpers.defer |
|
, globalCookieJar = cookies.jar() |
|
|
|
|
|
var globalPool = {} |
|
|
|
var defaultProxyHeaderWhiteList = [ |
|
'accept', |
|
'accept-charset', |
|
'accept-encoding', |
|
'accept-language', |
|
'accept-ranges', |
|
'cache-control', |
|
'content-encoding', |
|
'content-language', |
|
'content-length', |
|
'content-location', |
|
'content-md5', |
|
'content-range', |
|
'content-type', |
|
'connection', |
|
'date', |
|
'expect', |
|
'max-forwards', |
|
'pragma', |
|
'referer', |
|
'te', |
|
'transfer-encoding', |
|
'user-agent', |
|
'via' |
|
] |
|
|
|
var defaultProxyHeaderExclusiveList = [ |
|
'proxy-authorization' |
|
] |
|
|
|
function filterForNonReserved(reserved, options) { |
|
// Filter out properties that are not reserved. |
|
// Reserved values are passed in at call site. |
|
|
|
var object = {} |
|
for (var i in options) { |
|
var notReserved = (reserved.indexOf(i) === -1) |
|
if (notReserved) { |
|
object[i] = options[i] |
|
} |
|
} |
|
return object |
|
} |
|
|
|
function filterOutReservedFunctions(reserved, options) { |
|
// Filter out properties that are functions and are reserved. |
|
// Reserved values are passed in at call site. |
|
|
|
var object = {} |
|
for (var i in options) { |
|
var isReserved = !(reserved.indexOf(i) === -1) |
|
var isFunction = (typeof options[i] === 'function') |
|
if (!(isReserved && isFunction)) { |
|
object[i] = options[i] |
|
} |
|
} |
|
return object |
|
|
|
} |
|
|
|
function constructProxyHost(uriObject) { |
|
var port = uriObject.portA |
|
, protocol = uriObject.protocol |
|
, proxyHost = uriObject.hostname + ':' |
|
|
|
if (port) { |
|
proxyHost += port |
|
} else if (protocol === 'https:') { |
|
proxyHost += '443' |
|
} else { |
|
proxyHost += '80' |
|
} |
|
|
|
return proxyHost |
|
} |
|
|
|
function constructProxyHeaderWhiteList(headers, proxyHeaderWhiteList) { |
|
var whiteList = proxyHeaderWhiteList |
|
.reduce(function (set, header) { |
|
set[header.toLowerCase()] = true |
|
return set |
|
}, {}) |
|
|
|
return Object.keys(headers) |
|
.filter(function (header) { |
|
return whiteList[header.toLowerCase()] |
|
}) |
|
.reduce(function (set, header) { |
|
set[header] = headers[header] |
|
return set |
|
}, {}) |
|
} |
|
|
|
function getTunnelOption(self, options) { |
|
// Tunnel HTTPS by default, or if a previous request in the redirect chain |
|
// was tunneled. Allow the user to override this setting. |
|
|
|
// If self.tunnel is already set (because this is a redirect), use the |
|
// existing value. |
|
if (typeof self.tunnel !== 'undefined') { |
|
return self.tunnel |
|
} |
|
|
|
// If options.tunnel is set (the user specified a value), use it. |
|
if (typeof options.tunnel !== 'undefined') { |
|
return options.tunnel |
|
} |
|
|
|
// If the destination is HTTPS, tunnel. |
|
if (self.uri.protocol === 'https:') { |
|
return true |
|
} |
|
|
|
// Otherwise, leave tunnel unset, because if a later request in the redirect |
|
// chain is HTTPS then that request (and any subsequent ones) should be |
|
// tunneled. |
|
return undefined |
|
} |
|
|
|
function constructTunnelOptions(request) { |
|
var proxy = request.proxy |
|
|
|
var tunnelOptions = { |
|
proxy : { |
|
host : proxy.hostname, |
|
port : +proxy.port, |
|
proxyAuth : proxy.auth, |
|
headers : request.proxyHeaders |
|
}, |
|
headers : request.headers, |
|
ca : request.ca, |
|
cert : request.cert, |
|
key : request.key, |
|
passphrase : request.passphrase, |
|
pfx : request.pfx, |
|
ciphers : request.ciphers, |
|
rejectUnauthorized : request.rejectUnauthorized, |
|
secureOptions : request.secureOptions, |
|
secureProtocol : request.secureProtocol |
|
} |
|
|
|
return tunnelOptions |
|
} |
|
|
|
function constructTunnelFnName(uri, proxy) { |
|
var uriProtocol = (uri.protocol === 'https:' ? 'https' : 'http') |
|
var proxyProtocol = (proxy.protocol === 'https:' ? 'Https' : 'Http') |
|
return [uriProtocol, proxyProtocol].join('Over') |
|
} |
|
|
|
function getTunnelFn(request) { |
|
var uri = request.uri |
|
var proxy = request.proxy |
|
var tunnelFnName = constructTunnelFnName(uri, proxy) |
|
return tunnel[tunnelFnName] |
|
} |
|
|
|
// Function for properly handling a connection error |
|
function connectionErrorHandler(error) { |
|
var socket = this |
|
if (socket.res) { |
|
if (socket.res.request) { |
|
socket.res.request.emit('error', error) |
|
} else { |
|
socket.res.emit('error', error) |
|
} |
|
} else { |
|
socket._httpMessage.emit('error', error) |
|
} |
|
} |
|
|
|
// Return a simpler request object to allow serialization |
|
function requestToJSON() { |
|
var self = this |
|
return { |
|
uri: self.uri, |
|
method: self.method, |
|
headers: self.headers |
|
} |
|
} |
|
|
|
// Return a simpler response object to allow serialization |
|
function responseToJSON() { |
|
var self = this |
|
return { |
|
statusCode: self.statusCode, |
|
body: self.body, |
|
headers: self.headers, |
|
request: requestToJSON.call(self.request) |
|
} |
|
} |
|
|
|
// encode rfc3986 characters |
|
function rfc3986 (str) { |
|
return str.replace(/[!'()*]/g, function(c) { |
|
return '%' + c.charCodeAt(0).toString(16).toUpperCase() |
|
}) |
|
} |
|
|
|
function Request (options) { |
|
// if given the method property in options, set property explicitMethod to true |
|
|
|
// extend the Request instance with any non-reserved properties |
|
// remove any reserved functions from the options object |
|
// set Request instance to be readable and writable |
|
// call init |
|
|
|
var self = this |
|
|
|
// start with HAR, then override with additional options |
|
if (options.har) { |
|
self._har = new Har(self) |
|
options = self._har.options(options) |
|
} |
|
|
|
stream.Stream.call(self) |
|
var reserved = Object.keys(Request.prototype) |
|
var nonReserved = filterForNonReserved(reserved, options) |
|
|
|
stream.Stream.call(self) |
|
util._extend(self, nonReserved) |
|
options = filterOutReservedFunctions(reserved, options) |
|
|
|
self.readable = true |
|
self.writable = true |
|
if (options.method) { |
|
self.explicitMethod = true |
|
} |
|
self._auth = new Auth(self) |
|
self._oauth = new OAuth(self) |
|
self._multipart = new Multipart(self) |
|
self._redirect = new Redirect(self) |
|
self.init(options) |
|
} |
|
|
|
util.inherits(Request, stream.Stream) |
|
|
|
// Debugging |
|
Request.debug = process.env.NODE_DEBUG && /\brequest\b/.test(process.env.NODE_DEBUG) |
|
function debug() { |
|
if (Request.debug) { |
|
console.error('REQUEST %s', util.format.apply(util, arguments)) |
|
} |
|
} |
|
|
|
Request.prototype.setupTunnel = function () { |
|
var self = this |
|
|
|
if (typeof self.proxy === 'string') { |
|
self.proxy = url.parse(self.proxy) |
|
} |
|
|
|
if (!self.proxy || !self.tunnel) { |
|
return false |
|
} |
|
|
|
// Setup Proxy Header Exclusive List and White List |
|
self.proxyHeaderExclusiveList = self.proxyHeaderExclusiveList || [] |
|
self.proxyHeaderWhiteList = self.proxyHeaderWhiteList || defaultProxyHeaderWhiteList |
|
var proxyHeaderExclusiveList = self.proxyHeaderExclusiveList.concat(defaultProxyHeaderExclusiveList) |
|
var proxyHeaderWhiteList = self.proxyHeaderWhiteList.concat(proxyHeaderExclusiveList) |
|
|
|
// Setup Proxy Headers and Proxy Headers Host |
|
// Only send the Proxy White Listed Header names |
|
self.proxyHeaders = constructProxyHeaderWhiteList(self.headers, proxyHeaderWhiteList) |
|
self.proxyHeaders.host = constructProxyHost(self.uri) |
|
proxyHeaderExclusiveList.forEach(self.removeHeader, self) |
|
|
|
// Set Agent from Tunnel Data |
|
var tunnelFn = getTunnelFn(self) |
|
var tunnelOptions = constructTunnelOptions(self) |
|
self.agent = tunnelFn(tunnelOptions) |
|
|
|
return true |
|
} |
|
|
|
Request.prototype.init = function (options) { |
|
// init() contains all the code to setup the request object. |
|
// the actual outgoing request is not started until start() is called |
|
// this function is called from both the constructor and on redirect. |
|
var self = this |
|
if (!options) { |
|
options = {} |
|
} |
|
self.headers = self.headers ? copy(self.headers) : {} |
|
|
|
// Delete headers with value undefined since they break |
|
// ClientRequest.OutgoingMessage.setHeader in node 0.12 |
|
for (var headerName in self.headers) { |
|
if (typeof self.headers[headerName] === 'undefined') { |
|
delete self.headers[headerName] |
|
} |
|
} |
|
|
|
caseless.httpify(self, self.headers) |
|
|
|
if (!self.method) { |
|
self.method = options.method || 'GET' |
|
} |
|
if (!self.localAddress) { |
|
self.localAddress = options.localAddress |
|
} |
|
|
|
if (!self.qsLib) { |
|
self.qsLib = (options.useQuerystring ? querystring : qs) |
|
} |
|
if (!self.qsParseOptions) { |
|
self.qsParseOptions = options.qsParseOptions |
|
} |
|
if (!self.qsStringifyOptions) { |
|
self.qsStringifyOptions = options.qsStringifyOptions |
|
} |
|
|
|
debug(options) |
|
if (!self.pool && self.pool !== false) { |
|
self.pool = globalPool |
|
} |
|
self.dests = self.dests || [] |
|
self.__isRequestRequest = true |
|
|
|
// Protect against double callback |
|
if (!self._callback && self.callback) { |
|
self._callback = self.callback |
|
self.callback = function () { |
|
if (self._callbackCalled) { |
|
return // Print a warning maybe? |
|
} |
|
self._callbackCalled = true |
|
self._callback.apply(self, arguments) |
|
} |
|
self.on('error', self.callback.bind()) |
|
self.on('complete', self.callback.bind(self, null)) |
|
} |
|
|
|
// People use this property instead all the time, so support it |
|
if (!self.uri && self.url) { |
|
self.uri = self.url |
|
delete self.url |
|
} |
|
|
|
// If there's a baseUrl, then use it as the base URL (i.e. uri must be |
|
// specified as a relative path and is appended to baseUrl). |
|
if (self.baseUrl) { |
|
if (typeof self.baseUrl !== 'string') { |
|
return self.emit('error', new Error('options.baseUrl must be a string')) |
|
} |
|
|
|
if (typeof self.uri !== 'string') { |
|
return self.emit('error', new Error('options.uri must be a string when using options.baseUrl')) |
|
} |
|
|
|
if (self.uri.indexOf('//') === 0 || self.uri.indexOf('://') !== -1) { |
|
return self.emit('error', new Error('options.uri must be a path when using options.baseUrl')) |
|
} |
|
|
|
// Handle all cases to make sure that there's only one slash between |
|
// baseUrl and uri. |
|
var baseUrlEndsWithSlash = self.baseUrl.lastIndexOf('/') === self.baseUrl.length - 1 |
|
var uriStartsWithSlash = self.uri.indexOf('/') === 0 |
|
|
|
if (baseUrlEndsWithSlash && uriStartsWithSlash) { |
|
self.uri = self.baseUrl + self.uri.slice(1) |
|
} else if (baseUrlEndsWithSlash || uriStartsWithSlash) { |
|
self.uri = self.baseUrl + self.uri |
|
} else if (self.uri === '') { |
|
self.uri = self.baseUrl |
|
} else { |
|
self.uri = self.baseUrl + '/' + self.uri |
|
} |
|
delete self.baseUrl |
|
} |
|
|
|
// A URI is needed by this point, throw if we haven't been able to get one |
|
if (!self.uri) { |
|
return self.emit('error', new Error('options.uri is a required argument')) |
|
} |
|
|
|
// If a string URI/URL was given, parse it into a URL object |
|
if(typeof self.uri === 'string') { |
|
self.uri = url.parse(self.uri) |
|
} |
|
|
|
// DEPRECATED: Warning for users of the old Unix Sockets URL Scheme |
|
if (self.uri.protocol === 'unix:') { |
|
return self.emit('error', new Error('`unix://` URL scheme is no longer supported. Please use the format `http://unix:SOCKET:PATH`')) |
|
} |
|
|
|
// Support Unix Sockets |
|
if(self.uri.host === 'unix') { |
|
// Get the socket & request paths from the URL |
|
var unixParts = self.uri.path.split(':') |
|
, host = unixParts[0] |
|
, path = unixParts[1] |
|
// Apply unix properties to request |
|
self.socketPath = host |
|
self.uri.pathname = path |
|
self.uri.path = path |
|
self.uri.host = host |
|
self.uri.hostname = host |
|
self.uri.isUnix = true |
|
} |
|
|
|
if (self.strictSSL === false) { |
|
self.rejectUnauthorized = false |
|
} |
|
|
|
if(!self.hasOwnProperty('proxy')) { |
|
self.proxy = getProxyFromURI(self.uri) |
|
} |
|
|
|
self.tunnel = getTunnelOption(self, options) |
|
if (self.proxy) { |
|
self.setupTunnel() |
|
} |
|
|
|
if (!self.uri.pathname) {self.uri.pathname = '/'} |
|
|
|
if (!(self.uri.host || (self.uri.hostname && self.uri.port)) && !self.uri.isUnix) { |
|
// Invalid URI: it may generate lot of bad errors, like 'TypeError: Cannot call method `indexOf` of undefined' in CookieJar |
|
// Detect and reject it as soon as possible |
|
var faultyUri = url.format(self.uri) |
|
var message = 'Invalid URI "' + faultyUri + '"' |
|
if (Object.keys(options).length === 0) { |
|
// No option ? This can be the sign of a redirect |
|
// As this is a case where the user cannot do anything (they didn't call request directly with this URL) |
|
// they should be warned that it can be caused by a redirection (can save some hair) |
|
message += '. This can be caused by a crappy redirection.' |
|
} |
|
// This error was fatal |
|
return self.emit('error', new Error(message)) |
|
} |
|
|
|
self._redirect.onRequest() |
|
|
|
self.setHost = false |
|
if (!self.hasHeader('host')) { |
|
var hostHeaderName = self.originalHostHeaderName || 'host' |
|
self.setHeader(hostHeaderName, self.uri.hostname) |
|
if (self.uri.port) { |
|
if ( !(self.uri.port === 80 && self.uri.protocol === 'http:') && |
|
!(self.uri.port === 443 && self.uri.protocol === 'https:') ) { |
|
self.setHeader(hostHeaderName, self.getHeader('host') + (':' + self.uri.port) ) |
|
} |
|
} |
|
self.setHost = true |
|
} |
|
|
|
self.jar(self._jar || options.jar) |
|
|
|
if (!self.uri.port) { |
|
if (self.uri.protocol === 'http:') {self.uri.port = 80} |
|
else if (self.uri.protocol === 'https:') {self.uri.port = 443} |
|
} |
|
|
|
if (self.proxy && !self.tunnel) { |
|
self.port = self.proxy.port |
|
self.host = self.proxy.hostname |
|
} else { |
|
self.port = self.uri.port |
|
self.host = self.uri.hostname |
|
} |
|
|
|
if (options.form) { |
|
self.form(options.form) |
|
} |
|
|
|
if (options.formData) { |
|
var formData = options.formData |
|
var requestForm = self.form() |
|
var appendFormValue = function (key, value) { |
|
if (value.hasOwnProperty('value') && value.hasOwnProperty('options')) { |
|
requestForm.append(key, value.value, value.options) |
|
} else { |
|
requestForm.append(key, value) |
|
} |
|
} |
|
for (var formKey in formData) { |
|
if (formData.hasOwnProperty(formKey)) { |
|
var formValue = formData[formKey] |
|
if (formValue instanceof Array) { |
|
for (var j = 0; j < formValue.length; j++) { |
|
appendFormValue(formKey, formValue[j]) |
|
} |
|
} else { |
|
appendFormValue(formKey, formValue) |
|
} |
|
} |
|
} |
|
} |
|
|
|
if (options.qs) { |
|
self.qs(options.qs) |
|
} |
|
|
|
if (self.uri.path) { |
|
self.path = self.uri.path |
|
} else { |
|
self.path = self.uri.pathname + (self.uri.search || '') |
|
} |
|
|
|
if (self.path.length === 0) { |
|
self.path = '/' |
|
} |
|
|
|
// Auth must happen last in case signing is dependent on other headers |
|
if (options.oauth) { |
|
self.oauth(options.oauth) |
|
} |
|
|
|
if (options.aws) { |
|
self.aws(options.aws) |
|
} |
|
|
|
if (options.hawk) { |
|
self.hawk(options.hawk) |
|
} |
|
|
|
if (options.httpSignature) { |
|
self.httpSignature(options.httpSignature) |
|
} |
|
|
|
if (options.auth) { |
|
if (Object.prototype.hasOwnProperty.call(options.auth, 'username')) { |
|
options.auth.user = options.auth.username |
|
} |
|
if (Object.prototype.hasOwnProperty.call(options.auth, 'password')) { |
|
options.auth.pass = options.auth.password |
|
} |
|
|
|
self.auth( |
|
options.auth.user, |
|
options.auth.pass, |
|
options.auth.sendImmediately, |
|
options.auth.bearer |
|
) |
|
} |
|
|
|
if (self.gzip && !self.hasHeader('accept-encoding')) { |
|
self.setHeader('accept-encoding', 'gzip') |
|
} |
|
|
|
if (self.uri.auth && !self.hasHeader('authorization')) { |
|
var uriAuthPieces = self.uri.auth.split(':').map(function(item){ return querystring.unescape(item) }) |
|
self.auth(uriAuthPieces[0], uriAuthPieces.slice(1).join(':'), true) |
|
} |
|
|
|
if (!self.tunnel && self.proxy && self.proxy.auth && !self.hasHeader('proxy-authorization')) { |
|
var proxyAuthPieces = self.proxy.auth.split(':').map(function(item){ |
|
return querystring.unescape(item) |
|
}) |
|
var authHeader = 'Basic ' + toBase64(proxyAuthPieces.join(':')) |
|
self.setHeader('proxy-authorization', authHeader) |
|
} |
|
|
|
if (self.proxy && !self.tunnel) { |
|
self.path = (self.uri.protocol + '//' + self.uri.host + self.path) |
|
} |
|
|
|
if (options.json) { |
|
self.json(options.json) |
|
} |
|
if (options.multipart) { |
|
self.multipart(options.multipart) |
|
} |
|
|
|
if (options.time) { |
|
self.timing = true |
|
self.elapsedTime = self.elapsedTime || 0 |
|
} |
|
|
|
if (self.body) { |
|
var length = 0 |
|
if (!Buffer.isBuffer(self.body)) { |
|
if (Array.isArray(self.body)) { |
|
for (var i = 0; i < self.body.length; i++) { |
|
length += self.body[i].length |
|
} |
|
} else { |
|
self.body = new Buffer(self.body) |
|
length = self.body.length |
|
} |
|
} else { |
|
length = self.body.length |
|
} |
|
if (length) { |
|
if (!self.hasHeader('content-length')) { |
|
self.setHeader('content-length', length) |
|
} |
|
} else { |
|
throw new Error('Argument error, options.body.') |
|
} |
|
} |
|
|
|
var protocol = self.proxy && !self.tunnel ? self.proxy.protocol : self.uri.protocol |
|
, defaultModules = {'http:':http, 'https:':https} |
|
, httpModules = self.httpModules || {} |
|
|
|
self.httpModule = httpModules[protocol] || defaultModules[protocol] |
|
|
|
if (!self.httpModule) { |
|
return self.emit('error', new Error('Invalid protocol: ' + protocol)) |
|
} |
|
|
|
if (options.ca) { |
|
self.ca = options.ca |
|
} |
|
|
|
if (!self.agent) { |
|
if (options.agentOptions) { |
|
self.agentOptions = options.agentOptions |
|
} |
|
|
|
if (options.agentClass) { |
|
self.agentClass = options.agentClass |
|
} else if (options.forever) { |
|
self.agentClass = protocol === 'http:' ? ForeverAgent : ForeverAgent.SSL |
|
} else { |
|
self.agentClass = self.httpModule.Agent |
|
} |
|
} |
|
|
|
if (self.pool === false) { |
|
self.agent = false |
|
} else { |
|
self.agent = self.agent || self.getNewAgent() |
|
} |
|
|
|
self.on('pipe', function (src) { |
|
if (self.ntick && self._started) { |
|
throw new Error('You cannot pipe to this stream after the outbound request has started.') |
|
} |
|
self.src = src |
|
if (isReadStream(src)) { |
|
if (!self.hasHeader('content-type')) { |
|
self.setHeader('content-type', mime.lookup(src.path)) |
|
} |
|
} else { |
|
if (src.headers) { |
|
for (var i in src.headers) { |
|
if (!self.hasHeader(i)) { |
|
self.setHeader(i, src.headers[i]) |
|
} |
|
} |
|
} |
|
if (self._json && !self.hasHeader('content-type')) { |
|
self.setHeader('content-type', 'application/json') |
|
} |
|
if (src.method && !self.explicitMethod) { |
|
self.method = src.method |
|
} |
|
} |
|
|
|
// self.on('pipe', function () { |
|
// console.error('You have already piped to this stream. Pipeing twice is likely to break the request.') |
|
// }) |
|
}) |
|
|
|
defer(function () { |
|
if (self._aborted) { |
|
return |
|
} |
|
|
|
var end = function () { |
|
if (self._form) { |
|
if (!self._auth.hasAuth) { |
|
self._form.pipe(self) |
|
} |
|
else if (self._auth.hasAuth && self._auth.sentAuth) { |
|
self._form.pipe(self) |
|
} |
|
} |
|
if (self._multipart && self._multipart.chunked) { |
|
self._multipart.body.pipe(self) |
|
} |
|
if (self.body) { |
|
if (Array.isArray(self.body)) { |
|
self.body.forEach(function (part) { |
|
self.write(part) |
|
}) |
|
} else { |
|
self.write(self.body) |
|
} |
|
self.end() |
|
} else if (self.requestBodyStream) { |
|
console.warn('options.requestBodyStream is deprecated, please pass the request object to stream.pipe.') |
|
self.requestBodyStream.pipe(self) |
|
} else if (!self.src) { |
|
if (self._auth.hasAuth && !self._auth.sentAuth) { |
|
self.end() |
|
return |
|
} |
|
if (self.method !== 'GET' && typeof self.method !== 'undefined') { |
|
self.setHeader('content-length', 0) |
|
} |
|
self.end() |
|
} |
|
} |
|
|
|
if (self._form && !self.hasHeader('content-length')) { |
|
// Before ending the request, we had to compute the length of the whole form, asyncly |
|
self.setHeader(self._form.getHeaders()) |
|
self._form.getLength(function (err, length) { |
|
if (!err) { |
|
self.setHeader('content-length', length) |
|
} |
|
end() |
|
}) |
|
} else { |
|
end() |
|
} |
|
|
|
self.ntick = true |
|
}) |
|
|
|
} |
|
|
|
// Must call this when following a redirect from https to http or vice versa |
|
// Attempts to keep everything as identical as possible, but update the |
|
// httpModule, Tunneling agent, and/or Forever Agent in use. |
|
Request.prototype._updateProtocol = function () { |
|
var self = this |
|
var protocol = self.uri.protocol |
|
|
|
if (protocol === 'https:' || self.tunnel) { |
|
// previously was doing http, now doing https |
|
// if it's https, then we might need to tunnel now. |
|
if (self.proxy) { |
|
if (self.setupTunnel()) { |
|
return |
|
} |
|
} |
|
|
|
self.httpModule = https |
|
switch (self.agentClass) { |
|
case ForeverAgent: |
|
self.agentClass = ForeverAgent.SSL |
|
break |
|
case http.Agent: |
|
self.agentClass = https.Agent |
|
break |
|
default: |
|
// nothing we can do. Just hope for the best. |
|
return |
|
} |
|
|
|
// if there's an agent, we need to get a new one. |
|
if (self.agent) { |
|
self.agent = self.getNewAgent() |
|
} |
|
|
|
} else { |
|
// previously was doing https, now doing http |
|
self.httpModule = http |
|
switch (self.agentClass) { |
|
case ForeverAgent.SSL: |
|
self.agentClass = ForeverAgent |
|
break |
|
case https.Agent: |
|
self.agentClass = http.Agent |
|
break |
|
default: |
|
// nothing we can do. just hope for the best |
|
return |
|
} |
|
|
|
// if there's an agent, then get a new one. |
|
if (self.agent) { |
|
self.agent = null |
|
self.agent = self.getNewAgent() |
|
} |
|
} |
|
} |
|
|
|
Request.prototype.getNewAgent = function () { |
|
var self = this |
|
var Agent = self.agentClass |
|
var options = {} |
|
if (self.agentOptions) { |
|
for (var i in self.agentOptions) { |
|
options[i] = self.agentOptions[i] |
|
} |
|
} |
|
if (self.ca) { |
|
options.ca = self.ca |
|
} |
|
if (self.ciphers) { |
|
options.ciphers = self.ciphers |
|
} |
|
if (self.secureProtocol) { |
|
options.secureProtocol = self.secureProtocol |
|
} |
|
if (self.secureOptions) { |
|
options.secureOptions = self.secureOptions |
|
} |
|
if (typeof self.rejectUnauthorized !== 'undefined') { |
|
options.rejectUnauthorized = self.rejectUnauthorized |
|
} |
|
|
|
if (self.cert && self.key) { |
|
options.key = self.key |
|
options.cert = self.cert |
|
} |
|
|
|
if (self.pfx) { |
|
options.pfx = self.pfx |
|
} |
|
|
|
if (self.passphrase) { |
|
options.passphrase = self.passphrase |
|
} |
|
|
|
var poolKey = '' |
|
|
|
// different types of agents are in different pools |
|
if (Agent !== self.httpModule.Agent) { |
|
poolKey += Agent.name |
|
} |
|
|
|
// ca option is only relevant if proxy or destination are https |
|
var proxy = self.proxy |
|
if (typeof proxy === 'string') { |
|
proxy = url.parse(proxy) |
|
} |
|
var isHttps = (proxy && proxy.protocol === 'https:') || this.uri.protocol === 'https:' |
|
|
|
if (isHttps) { |
|
if (options.ca) { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.ca |
|
} |
|
|
|
if (typeof options.rejectUnauthorized !== 'undefined') { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.rejectUnauthorized |
|
} |
|
|
|
if (options.cert) { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.cert.toString('ascii') + options.key.toString('ascii') |
|
} |
|
|
|
if (options.pfx) { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.pfx.toString('ascii') |
|
} |
|
|
|
if (options.ciphers) { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.ciphers |
|
} |
|
|
|
if (options.secureProtocol) { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.secureProtocol |
|
} |
|
|
|
if (options.secureOptions) { |
|
if (poolKey) { |
|
poolKey += ':' |
|
} |
|
poolKey += options.secureOptions |
|
} |
|
} |
|
|
|
if (self.pool === globalPool && !poolKey && Object.keys(options).length === 0 && self.httpModule.globalAgent) { |
|
// not doing anything special. Use the globalAgent |
|
return self.httpModule.globalAgent |
|
} |
|
|
|
// we're using a stored agent. Make sure it's protocol-specific |
|
poolKey = self.uri.protocol + poolKey |
|
|
|
// generate a new agent for this setting if none yet exists |
|
if (!self.pool[poolKey]) { |
|
self.pool[poolKey] = new Agent(options) |
|
// properly set maxSockets on new agents |
|
if (self.pool.maxSockets) { |
|
self.pool[poolKey].maxSockets = self.pool.maxSockets |
|
} |
|
} |
|
|
|
return self.pool[poolKey] |
|
} |
|
|
|
Request.prototype.start = function () { |
|
// start() is called once we are ready to send the outgoing HTTP request. |
|
// this is usually called on the first write(), end() or on nextTick() |
|
var self = this |
|
|
|
if (self._aborted) { |
|
return |
|
} |
|
|
|
self._started = true |
|
self.method = self.method || 'GET' |
|
self.href = self.uri.href |
|
|
|
if (self.src && self.src.stat && self.src.stat.size && !self.hasHeader('content-length')) { |
|
self.setHeader('content-length', self.src.stat.size) |
|
} |
|
if (self._aws) { |
|
self.aws(self._aws, true) |
|
} |
|
|
|
// We have a method named auth, which is completely different from the http.request |
|
// auth option. If we don't remove it, we're gonna have a bad time. |
|
var reqOptions = copy(self) |
|
delete reqOptions.auth |
|
|
|
debug('make request', self.uri.href) |
|
|
|
self.req = self.httpModule.request(reqOptions) |
|
|
|
if (self.timing) { |
|
self.startTime = new Date().getTime() |
|
} |
|
|
|
if (self.timeout && !self.timeoutTimer) { |
|
var timeout = self.timeout < 0 ? 0 : self.timeout |
|
self.timeoutTimer = setTimeout(function () { |
|
self.abort() |
|
var e = new Error('ETIMEDOUT') |
|
e.code = 'ETIMEDOUT' |
|
self.emit('error', e) |
|
}, timeout) |
|
|
|
// Set additional timeout on socket - in case if remote |
|
// server freeze after sending headers |
|
if (self.req.setTimeout) { // only works on node 0.6+ |
|
self.req.setTimeout(timeout, function () { |
|
if (self.req) { |
|
self.req.abort() |
|
var e = new Error('ESOCKETTIMEDOUT') |
|
e.code = 'ESOCKETTIMEDOUT' |
|
self.emit('error', e) |
|
} |
|
}) |
|
} |
|
} |
|
|
|
self.req.on('response', self.onRequestResponse.bind(self)) |
|
self.req.on('error', self.onRequestError.bind(self)) |
|
self.req.on('drain', function() { |
|
self.emit('drain') |
|
}) |
|
self.req.on('socket', function(socket) { |
|
self.emit('socket', socket) |
|
}) |
|
|
|
self.on('end', function() { |
|
if ( self.req.connection ) { |
|
self.req.connection.removeListener('error', connectionErrorHandler) |
|
} |
|
}) |
|
self.emit('request', self.req) |
|
} |
|
|
|
Request.prototype.onRequestError = function (error) { |
|
var self = this |
|
if (self._aborted) { |
|
return |
|
} |
|
if (self.req && self.req._reusedSocket && error.code === 'ECONNRESET' |
|
&& self.agent.addRequestNoreuse) { |
|
self.agent = { addRequest: self.agent.addRequestNoreuse.bind(self.agent) } |
|
self.start() |
|
self.req.end() |
|
return |
|
} |
|
if (self.timeout && self.timeoutTimer) { |
|
clearTimeout(self.timeoutTimer) |
|
self.timeoutTimer = null |
|
} |
|
self.emit('error', error) |
|
} |
|
|
|
Request.prototype.onRequestResponse = function (response) { |
|
var self = this |
|
debug('onRequestResponse', self.uri.href, response.statusCode, response.headers) |
|
response.on('end', function() { |
|
if (self.timing) { |
|
self.elapsedTime += (new Date().getTime() - self.startTime) |
|
debug('elapsed time', self.elapsedTime) |
|
response.elapsedTime = self.elapsedTime |
|
} |
|
debug('response end', self.uri.href, response.statusCode, response.headers) |
|
}) |
|
|
|
// The check on response.connection is a workaround for browserify. |
|
if (response.connection && response.connection.listeners('error').indexOf(connectionErrorHandler) === -1) { |
|
response.connection.setMaxListeners(0) |
|
response.connection.once('error', connectionErrorHandler) |
|
} |
|
if (self._aborted) { |
|
debug('aborted', self.uri.href) |
|
response.resume() |
|
return |
|
} |
|
if (self._paused) { |
|
response.pause() |
|
} else if (response.resume) { |
|
// response.resume should be defined, but check anyway before calling. Workaround for browserify. |
|
response.resume() |
|
} |
|
|
|
self.response = response |
|
response.request = self |
|
response.toJSON = responseToJSON |
|
|
|
// XXX This is different on 0.10, because SSL is strict by default |
|
if (self.httpModule === https && |
|
self.strictSSL && (!response.hasOwnProperty('client') || |
|
!response.client.authorized)) { |
|
debug('strict ssl error', self.uri.href) |
|
var sslErr = response.hasOwnProperty('client') ? response.client.authorizationError : self.uri.href + ' does not support SSL' |
|
self.emit('error', new Error('SSL Error: ' + sslErr)) |
|
return |
|
} |
|
|
|
// Save the original host before any redirect (if it changes, we need to |
|
// remove any authorization headers). Also remember the case of the header |
|
// name because lots of broken servers expect Host instead of host and we |
|
// want the caller to be able to specify this. |
|
self.originalHost = self.getHeader('host') |
|
if (!self.originalHostHeaderName) { |
|
self.originalHostHeaderName = self.hasHeader('host') |
|
} |
|
if (self.setHost) { |
|
self.removeHeader('host') |
|
} |
|
if (self.timeout && self.timeoutTimer) { |
|
clearTimeout(self.timeoutTimer) |
|
self.timeoutTimer = null |
|
} |
|
|
|
var targetCookieJar = (self._jar && self._jar.setCookie) ? self._jar : globalCookieJar |
|
var addCookie = function (cookie) { |
|
//set the cookie if it's domain in the href's domain. |
|
try { |
|
targetCookieJar.setCookie(cookie, self.uri.href, {ignoreError: true}) |
|
} catch (e) { |
|
self.emit('error', e) |
|
} |
|
} |
|
|
|
response.caseless = caseless(response.headers) |
|
|
|
if (response.caseless.has('set-cookie') && (!self._disableCookies)) { |
|
var headerName = response.caseless.has('set-cookie') |
|
if (Array.isArray(response.headers[headerName])) { |
|
response.headers[headerName].forEach(addCookie) |
|
} else { |
|
addCookie(response.headers[headerName]) |
|
} |
|
} |
|
|
|
if (self._redirect.onResponse(response)) { |
|
return // Ignore the rest of the response |
|
} else { |
|
// Be a good stream and emit end when the response is finished. |
|
// Hack to emit end on close because of a core bug that never fires end |
|
response.on('close', function () { |
|
if (!self._ended) { |
|
self.response.emit('end') |
|
} |
|
}) |
|
|
|
response.on('end', function () { |
|
self._ended = true |
|
}) |
|
|
|
var dataStream |
|
if (self.gzip) { |
|
var contentEncoding = response.headers['content-encoding'] || 'identity' |
|
contentEncoding = contentEncoding.trim().toLowerCase() |
|
|
|
if (contentEncoding === 'gzip') { |
|
dataStream = zlib.createGunzip() |
|
response.pipe(dataStream) |
|
} else { |
|
// Since previous versions didn't check for Content-Encoding header, |
|
// ignore any invalid values to preserve backwards-compatibility |
|
if (contentEncoding !== 'identity') { |
|
debug('ignoring unrecognized Content-Encoding ' + contentEncoding) |
|
} |
|
dataStream = response |
|
} |
|
} else { |
|
dataStream = response |
|
} |
|
|
|
if (self.encoding) { |
|
if (self.dests.length !== 0) { |
|
console.error('Ignoring encoding parameter as this stream is being piped to another stream which makes the encoding option invalid.') |
|
} else if (dataStream.setEncoding) { |
|
dataStream.setEncoding(self.encoding) |
|
} else { |
|
// Should only occur on node pre-v0.9.4 (joyent/node@9b5abe5) with |
|
// zlib streams. |
|
// If/When support for 0.9.4 is dropped, this should be unnecessary. |
|
dataStream = dataStream.pipe(stringstream(self.encoding)) |
|
} |
|
} |
|
|
|
self.emit('response', response) |
|
|
|
self.dests.forEach(function (dest) { |
|
self.pipeDest(dest) |
|
}) |
|
|
|
dataStream.on('data', function (chunk) { |
|
self._destdata = true |
|
self.emit('data', chunk) |
|
}) |
|
dataStream.on('end', function (chunk) { |
|
self.emit('end', chunk) |
|
}) |
|
dataStream.on('error', function (error) { |
|
self.emit('error', error) |
|
}) |
|
dataStream.on('close', function () {self.emit('close')}) |
|
|
|
if (self.callback) { |
|
var buffer = bl() |
|
, strings = [] |
|
|
|
self.on('data', function (chunk) { |
|
if (Buffer.isBuffer(chunk)) { |
|
buffer.append(chunk) |
|
} else { |
|
strings.push(chunk) |
|
} |
|
}) |
|
self.on('end', function () { |
|
debug('end event', self.uri.href) |
|
if (self._aborted) { |
|
debug('aborted', self.uri.href) |
|
return |
|
} |
|
|
|
if (buffer.length) { |
|
debug('has body', self.uri.href, buffer.length) |
|
if (self.encoding === null) { |
|
// response.body = buffer |
|
// can't move to this until https://github.com/rvagg/bl/issues/13 |
|
response.body = buffer.slice() |
|
} else { |
|
response.body = buffer.toString(self.encoding) |
|
} |
|
} else if (strings.length) { |
|
// The UTF8 BOM [0xEF,0xBB,0xBF] is converted to [0xFE,0xFF] in the JS UTC16/UCS2 representation. |
|
// Strip this value out when the encoding is set to 'utf8', as upstream consumers won't expect it and it breaks JSON.parse(). |
|
if (self.encoding === 'utf8' && strings[0].length > 0 && strings[0][0] === '\uFEFF') { |
|
strings[0] = strings[0].substring(1) |
|
} |
|
response.body = strings.join('') |
|
} |
|
|
|
if (self._json) { |
|
try { |
|
response.body = JSON.parse(response.body, self._jsonReviver) |
|
} catch (e) {} |
|
} |
|
debug('emitting complete', self.uri.href) |
|
if(typeof response.body === 'undefined' && !self._json) { |
|
response.body = self.encoding === null ? new Buffer(0) : '' |
|
} |
|
self.emit('complete', response, response.body) |
|
}) |
|
} |
|
//if no callback |
|
else{ |
|
self.on('end', function () { |
|
if (self._aborted) { |
|
debug('aborted', self.uri.href) |
|
return |
|
} |
|
self.emit('complete', response) |
|
}) |
|
} |
|
} |
|
debug('finish init function', self.uri.href) |
|
} |
|
|
|
Request.prototype.abort = function () { |
|
var self = this |
|
self._aborted = true |
|
|
|
if (self.req) { |
|
self.req.abort() |
|
} |
|
else if (self.response) { |
|
self.response.abort() |
|
} |
|
|
|
self.emit('abort') |
|
} |
|
|
|
Request.prototype.pipeDest = function (dest) { |
|
var self = this |
|
var response = self.response |
|
// Called after the response is received |
|
if (dest.headers && !dest.headersSent) { |
|
if (response.caseless.has('content-type')) { |
|
var ctname = response.caseless.has('content-type') |
|
if (dest.setHeader) { |
|
dest.setHeader(ctname, response.headers[ctname]) |
|
} |
|
else { |
|
dest.headers[ctname] = response.headers[ctname] |
|
} |
|
} |
|
|
|
if (response.caseless.has('content-length')) { |
|
var clname = response.caseless.has('content-length') |
|
if (dest.setHeader) { |
|
dest.setHeader(clname, response.headers[clname]) |
|
} else { |
|
dest.headers[clname] = response.headers[clname] |
|
} |
|
} |
|
} |
|
if (dest.setHeader && !dest.headersSent) { |
|
for (var i in response.headers) { |
|
// If the response content is being decoded, the Content-Encoding header |
|
// of the response doesn't represent the piped content, so don't pass it. |
|
if (!self.gzip || i !== 'content-encoding') { |
|
dest.setHeader(i, response.headers[i]) |
|
} |
|
} |
|
dest.statusCode = response.statusCode |
|
} |
|
if (self.pipefilter) { |
|
self.pipefilter(response, dest) |
|
} |
|
} |
|
|
|
Request.prototype.qs = function (q, clobber) { |
|
var self = this |
|
var base |
|
if (!clobber && self.uri.query) { |
|
base = self.qsLib.parse(self.uri.query, self.qsParseOptions) |
|
} else { |
|
base = {} |
|
} |
|
|
|
for (var i in q) { |
|
base[i] = q[i] |
|
} |
|
|
|
if (self.qsLib.stringify(base, self.qsStringifyOptions) === ''){ |
|
return self |
|
} |
|
|
|
var qs = self.qsLib.stringify(base, self.qsStringifyOptions) |
|
|
|
self.uri = url.parse(self.uri.href.split('?')[0] + '?' + rfc3986(qs)) |
|
self.url = self.uri |
|
self.path = self.uri.path |
|
|
|
return self |
|
} |
|
Request.prototype.form = function (form) { |
|
var self = this |
|
if (form) { |
|
self.setHeader('content-type', 'application/x-www-form-urlencoded') |
|
self.body = (typeof form === 'string') |
|
? form.toString('utf8') |
|
: self.qsLib.stringify(form, self.qsStringifyOptions).toString('utf8') |
|
self.body = rfc3986(self.body) |
|
return self |
|
} |
|
// create form-data object |
|
self._form = new FormData() |
|
self._form.on('error', function(err) { |
|
err.message = 'form-data: ' + err.message |
|
self.emit('error', err) |
|
self.abort() |
|
}) |
|
return self._form |
|
} |
|
Request.prototype.multipart = function (multipart) { |
|
var self = this |
|
|
|
self._multipart.onRequest(multipart) |
|
|
|
if (!self._multipart.chunked) { |
|
self.body = self._multipart.body |
|
} |
|
|
|
return self |
|
} |
|
Request.prototype.json = function (val) { |
|
var self = this |
|
|
|
if (!self.hasHeader('accept')) { |
|
self.setHeader('accept', 'application/json') |
|
} |
|
|
|
self._json = true |
|
if (typeof val === 'boolean') { |
|
if (self.body !== undefined) { |
|
if (!/^application\/x-www-form-urlencoded\b/.test(self.getHeader('content-type'))) { |
|
self.body = safeStringify(self.body) |
|
} else { |
|
self.body = rfc3986(self.body) |
|
} |
|
if (!self.hasHeader('content-type')) { |
|
self.setHeader('content-type', 'application/json') |
|
} |
|
} |
|
} else { |
|
self.body = safeStringify(val) |
|
if (!self.hasHeader('content-type')) { |
|
self.setHeader('content-type', 'application/json') |
|
} |
|
} |
|
|
|
if (typeof self.jsonReviver === 'function') { |
|
self._jsonReviver = self.jsonReviver |
|
} |
|
|
|
return self |
|
} |
|
Request.prototype.getHeader = function (name, headers) { |
|
var self = this |
|
var result, re, match |
|
if (!headers) { |
|
headers = self.headers |
|
} |
|
Object.keys(headers).forEach(function (key) { |
|
if (key.length !== name.length) { |
|
return |
|
} |
|
re = new RegExp(name, 'i') |
|
match = key.match(re) |
|
if (match) { |
|
result = headers[key] |
|
} |
|
}) |
|
return result |
|
} |
|
|
|
Request.prototype.auth = function (user, pass, sendImmediately, bearer) { |
|
var self = this |
|
|
|
self._auth.onRequest(user, pass, sendImmediately, bearer) |
|
|
|
return self |
|
} |
|
Request.prototype.aws = function (opts, now) { |
|
var self = this |
|
|
|
if (!now) { |
|
self._aws = opts |
|
return self |
|
} |
|
var date = new Date() |
|
self.setHeader('date', date.toUTCString()) |
|
var auth = |
|
{ key: opts.key |
|
, secret: opts.secret |
|
, verb: self.method.toUpperCase() |
|
, date: date |
|
, contentType: self.getHeader('content-type') || '' |
|
, md5: self.getHeader('content-md5') || '' |
|
, amazonHeaders: aws.canonicalizeHeaders(self.headers) |
|
} |
|
var path = self.uri.path |
|
if (opts.bucket && path) { |
|
auth.resource = '/' + opts.bucket + path |
|
} else if (opts.bucket && !path) { |
|
auth.resource = '/' + opts.bucket |
|
} else if (!opts.bucket && path) { |
|
auth.resource = path |
|
} else if (!opts.bucket && !path) { |
|
auth.resource = '/' |
|
} |
|
auth.resource = aws.canonicalizeResource(auth.resource) |
|
self.setHeader('authorization', aws.authorization(auth)) |
|
|
|
return self |
|
} |
|
Request.prototype.httpSignature = function (opts) { |
|
var self = this |
|
httpSignature.signRequest({ |
|
getHeader: function(header) { |
|
return self.getHeader(header, self.headers) |
|
}, |
|
setHeader: function(header, value) { |
|
self.setHeader(header, value) |
|
}, |
|
method: self.method, |
|
path: self.path |
|
}, opts) |
|
debug('httpSignature authorization', self.getHeader('authorization')) |
|
|
|
return self |
|
} |
|
Request.prototype.hawk = function (opts) { |
|
var self = this |
|
self.setHeader('Authorization', hawk.client.header(self.uri, self.method, opts).field) |
|
} |
|
Request.prototype.oauth = function (_oauth) { |
|
var self = this |
|
|
|
self._oauth.onRequest(_oauth) |
|
|
|
return self |
|
} |
|
|
|
Request.prototype.jar = function (jar) { |
|
var self = this |
|
var cookies |
|
|
|
if (self._redirect.redirectsFollowed === 0) { |
|
self.originalCookieHeader = self.getHeader('cookie') |
|
} |
|
|
|
if (!jar) { |
|
// disable cookies |
|
cookies = false |
|
self._disableCookies = true |
|
} else { |
|
var targetCookieJar = (jar && jar.getCookieString) ? jar : globalCookieJar |
|
var urihref = self.uri.href |
|
//fetch cookie in the Specified host |
|
if (targetCookieJar) { |
|
cookies = targetCookieJar.getCookieString(urihref) |
|
} |
|
} |
|
|
|
//if need cookie and cookie is not empty |
|
if (cookies && cookies.length) { |
|
if (self.originalCookieHeader) { |
|
// Don't overwrite existing Cookie header |
|
self.setHeader('cookie', self.originalCookieHeader + '; ' + cookies) |
|
} else { |
|
self.setHeader('cookie', cookies) |
|
} |
|
} |
|
self._jar = jar |
|
return self |
|
} |
|
|
|
|
|
// Stream API |
|
Request.prototype.pipe = function (dest, opts) { |
|
var self = this |
|
|
|
if (self.response) { |
|
if (self._destdata) { |
|
throw new Error('You cannot pipe after data has been emitted from the response.') |
|
} else if (self._ended) { |
|
throw new Error('You cannot pipe after the response has been ended.') |
|
} else { |
|
stream.Stream.prototype.pipe.call(self, dest, opts) |
|
self.pipeDest(dest) |
|
return dest |
|
} |
|
} else { |
|
self.dests.push(dest) |
|
stream.Stream.prototype.pipe.call(self, dest, opts) |
|
return dest |
|
} |
|
} |
|
Request.prototype.write = function () { |
|
var self = this |
|
if (!self._started) { |
|
self.start() |
|
} |
|
return self.req.write.apply(self.req, arguments) |
|
} |
|
Request.prototype.end = function (chunk) { |
|
var self = this |
|
if (chunk) { |
|
self.write(chunk) |
|
} |
|
if (!self._started) { |
|
self.start() |
|
} |
|
self.req.end() |
|
} |
|
Request.prototype.pause = function () { |
|
var self = this |
|
if (!self.response) { |
|
self._paused = true |
|
} else { |
|
self.response.pause.apply(self.response, arguments) |
|
} |
|
} |
|
Request.prototype.resume = function () { |
|
var self = this |
|
if (!self.response) { |
|
self._paused = false |
|
} else { |
|
self.response.resume.apply(self.response, arguments) |
|
} |
|
} |
|
Request.prototype.destroy = function () { |
|
var self = this |
|
if (!self._ended) { |
|
self.end() |
|
} else if (self.response) { |
|
self.response.destroy() |
|
} |
|
} |
|
|
|
Request.defaultProxyHeaderWhiteList = |
|
defaultProxyHeaderWhiteList.slice() |
|
|
|
Request.defaultProxyHeaderExclusiveList = |
|
defaultProxyHeaderExclusiveList.slice() |
|
|
|
// Exports |
|
|
|
Request.prototype.toJSON = requestToJSON |
|
module.exports = Request |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"./lib/auth":54,"./lib/cookies":55,"./lib/copy":56,"./lib/getProxyFromURI":57,"./lib/har":58,"./lib/helpers":59,"./lib/multipart":60,"./lib/oauth":61,"./lib/redirect":62,"_process":323,"aws-sign2":63,"bl":64,"buffer":172,"caseless":73,"forever-agent":76,"form-data":77,"hawk":104,"http":315,"http-signature":105,"https":319,"mime-types":122,"qs":127,"querystring":327,"stream":339,"stringstream":132,"tunnel-agent":137,"url":341,"util":343,"zlib":171}],139:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('../TwisterResource.js'); |
|
|
|
/** |
|
* Describes a user account in Twister. Allows for the private information about that user as well as for posting new messages. |
|
* @class ServerWallet_TwisterAccount |
|
*/ |
|
function TwisterAccount(name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._name = name; |
|
this._scope = scope; |
|
|
|
this._type = "account"; |
|
this._hasParentUser = false; |
|
|
|
this._wallettype = "server"; |
|
|
|
this._privateFollowings = []; |
|
|
|
this._directmessages = {}; |
|
|
|
this._torrents = {}; |
|
|
|
} |
|
|
|
module.exports = TwisterAccount; |
|
|
|
inherits(TwisterAccount,TwisterResource); |
|
|
|
TwisterAccount.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
flatData.wallettype = this._wallettype; |
|
flatData.privateFollowings = this._privateFollowings; |
|
|
|
flatData.directmessages = []; |
|
|
|
for (var username in this._directmessages){ |
|
flatData.directmessages.push(this._directmessages[username].flatten()); |
|
} |
|
|
|
flatData.torrents = []; |
|
|
|
for (var username in this._torrents){ |
|
flatData.torrents.push(this._torrents[username].flatten()); |
|
} |
|
|
|
return flatData; |
|
|
|
|
|
} |
|
|
|
TwisterAccount.prototype.inflate = function (flatData) { |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._wallettype = flatData.wallettype; |
|
this._privateFollowings = flatData.privateFollowings; |
|
|
|
var TwisterDirectMessages = require('./TwisterDirectMessages.js'); |
|
var TwisterTorrent = require('./TwisterTorrent.js'); |
|
|
|
for(var i in flatData.directmessages){ |
|
|
|
var newuser = new TwisterDirectMessages(this._name,flatData.directmessages[i].name,Twister); |
|
newuser.inflate(flatData.directmessages[i]); |
|
this._directmessages[flatData.directmessages[i].name]=newuser; |
|
|
|
} |
|
|
|
for(var i in flatData.torrents){ |
|
|
|
var newuser = new TwisterTorrent(this._name,flatData.torrents[i].name,Twister); |
|
newuser.inflate(flatData.torrents[i]); |
|
this._torrents[flatData.torrents[i].name]=newuser; |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterAccount.prototype.getUsername = function () {return this._name} |
|
|
|
TwisterAccount.prototype.activateTorrents = function (cbfunc,querySettings) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisAccount = this; |
|
|
|
thisAccount.RPC("getlasthave", [ this._name ], function(res) { |
|
|
|
for (var username in res) { |
|
|
|
var resTorrent = thisAccount.getTorrent(username); |
|
|
|
resTorrent.activate(); |
|
|
|
resTorrent._latestId = res[username]; |
|
resTorrent._lastUpdate = Date.now()/1000; |
|
resTorrent._updateInProgress = false; |
|
|
|
thisAccount._log("torrent for "+username+"activated"); |
|
|
|
} |
|
|
|
cbfunc(); |
|
|
|
}, function(ret) { |
|
|
|
thisAccount._handleError(ret); |
|
|
|
}); |
|
|
|
} |
|
|
|
TwisterAccount.prototype.updateProfile = function (newdata) { |
|
|
|
var thisAccount = this; |
|
|
|
var Twister = this._scope; |
|
|
|
Twister.getUser(this._name).doProfile(function(profile){ |
|
|
|
thisAccount.RPC("dhtput",[ |
|
thisAccount._name, |
|
"profile", |
|
"s", |
|
JSON.stringify(newdata), |
|
thisAccount._name, |
|
profile._revisionNumber+1 |
|
],function(result){ |
|
|
|
},function(error){ |
|
TwisterAccount._handleError(error); |
|
}); |
|
|
|
}) |
|
|
|
} |
|
|
|
TwisterAccount.prototype.updateAvatar = function (newdata) { |
|
|
|
var thisAccount = this; |
|
|
|
var Twister = this._scope; |
|
|
|
Twister.getUser(this._name).doAvatar(function(avatar){ |
|
|
|
thisAccount.RPC("dhtput",[ |
|
thisAccount._name, |
|
"profile", |
|
"s", |
|
JSON.stringify(newdata), |
|
thisAccount._name, |
|
avatar._revisionNumber+1 |
|
],function(result){ |
|
|
|
},function(error){ |
|
TwisterAccount._handleError(error); |
|
}); |
|
|
|
}) |
|
|
|
} |
|
|
|
TwisterAccount.prototype.post = function (msg,cbfunc) { |
|
|
|
|
|
var thisAccount = this; |
|
|
|
var Twister = this._scope; |
|
|
|
this.getTorrent(this._name)._checkQueryAndDo(function(thisTorrent){ |
|
|
|
var newid = thisTorrent._latestId+1; |
|
//thisTorrent._latestId = newid; |
|
|
|
thisAccount.RPC("newpostmsg",[ |
|
thisAccount._name, |
|
newid, |
|
msg |
|
],function(result){ |
|
|
|
var TwisterPost = require("../TwisterPost.js"); |
|
var data = {}; |
|
data.n = thisAccount._name; |
|
data.k = newid; |
|
data.time = Math.round(Date.now()/1000); |
|
data.msg = msg; |
|
var newpost = new TwisterPost(data,Twister); |
|
cbfunc(newpost); |
|
Twister.getUser(thisAccount._name).doStatus(function(){},{outdatedLimit: 0}); |
|
},function(error){ |
|
TwisterAccount._handleError(error); |
|
}); |
|
|
|
}); |
|
|
|
} |
|
|
|
TwisterAccount.prototype.getTorrent = function (username) { |
|
|
|
if( username in this._torrents ) { |
|
return this._torrents[username]; |
|
} else { |
|
var TwisterTorrent = require('./TwisterTorrent.js'); |
|
var newtorrent = new TwisterTorrent(this._name,username,this._scope); |
|
this._torrents[username]=newtorrent; |
|
return this._torrents[username]; |
|
} |
|
|
|
} |
|
|
|
TwisterAccount.prototype.getDirectMessages = function (username, cbfunc, querySettings) { |
|
|
|
if ( !(username in this._directmessages) ){ |
|
|
|
var TwisterDirectMessages = require("./TwisterDirectMessages.js"); |
|
|
|
var newdmsgs = new TwisterDirectMessages(this._name,username,this._scope); |
|
|
|
this._directmessages[username] = newdmsgs; |
|
|
|
} |
|
|
|
return this._directmessages[username]; |
|
|
|
} |
|
|
|
TwisterAccount.prototype.doLatestDirectMessage = function (username, cbfunc, querySettings) { |
|
|
|
this.getDirectMessages(username)._checkQueryAndDo(cbfunc, querySettings); |
|
|
|
} |
|
|
|
TwisterAccount.prototype.doLatestDirectMessagesUntil = function (username, cbfunc, querySettings) { |
|
|
|
this.getDirectMessages(username)._doUntil(cbfunc, querySettings); |
|
|
|
} |
|
},{"../TwisterPost.js":147,"../TwisterResource.js":152,"./TwisterDirectMessages.js":140,"./TwisterTorrent.js":141,"inherits":52}],140:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('../TwisterResource.js'); |
|
|
|
/** |
|
* Describes the direct messages between an {@link TwisterAccount} and an {@link TwisterUser} |
|
* @class |
|
*/ |
|
TwisterDirectMessages = function (walletusername,name,scope) { |
|
|
|
this._hasParentUser = true; |
|
|
|
this._walletusername = walletusername; |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._latestId = -1; |
|
this._messages = {}; |
|
|
|
this._type = "directmessages"; |
|
|
|
} |
|
|
|
inherits(TwisterDirectMessages,TwisterResource); |
|
|
|
TwisterDirectMessages.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
var flatMessages = []; |
|
|
|
for (var id in this._messages){ |
|
|
|
flatMessages.push(this.flattenMessage(this._messages[id])); |
|
|
|
} |
|
|
|
flatData.messages = flatMessages; |
|
flatData.latestId = this._latestId; |
|
flatData.walletusername = this._walletusername; |
|
|
|
return flatData; |
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype.inflate = function (flatData) { |
|
|
|
var TwisterPost = require('../TwisterPost.js'); |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._latestId = flatData.latestId; |
|
this._walletusername = flatData.walletusername; |
|
|
|
for(var i = 0; i < flatData.messages.length; i++){ |
|
|
|
this._messages[messages.id]=this.inflateMessage(flatData.messages[i]); |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype.flattenMessage = function (msg) { |
|
|
|
var flatMsg = {}; |
|
|
|
flatMsg.id=msg.getId(); |
|
flatMsg.time=msg.getTimestamp(); |
|
flatMsg.text=msg.getContent(); |
|
flatMsg.fromMe=msg.getFromMe(); |
|
|
|
return flatMsg; |
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype.inflateMessage = function (msg) { |
|
|
|
if (msg.fromMe) { |
|
msg.sender = this._walletusername; |
|
msg.receiver = this._name; |
|
} else { |
|
msg.sender = this._name; |
|
msg.receiver = this._walletusername; |
|
} |
|
|
|
var thisDirectMessages = this; |
|
|
|
msg.getId = function () {return this.id}; |
|
msg.getContent = function () {return this.text}; |
|
msg.getSender = function () {return this.sender}; |
|
msg.getReceiver = function () {return this.sender}; |
|
msg.getTimestamp = function () {return this.time}; |
|
msg.doPreviousMessage = function (cbfunc) { thisDirectMessages._doMessage(this.id-1,cbfunc) }; |
|
|
|
return msg; |
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype._do = function (cbfunc) { |
|
|
|
this._doMessage(this._latestId,cbfunc); |
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
thisResource.RPC("getdirectmsgs", [ thisResource._walletusername , 30 , [{username: this._name}] ], function(res) { |
|
|
|
//console.log(res[thisResource._name]); |
|
|
|
if (res[thisResource._name].length>0) { |
|
|
|
for (var i = 0; i<res[thisResource._name].length; i++) { |
|
|
|
thisResource._cacheMessage(res[thisResource._name][i],function(newmsg){ |
|
|
|
if ( newmsg.getId() > thisResource._latestId ) { |
|
|
|
thisResource._latestId = newpost.getId(); |
|
thisResource._lastUpdate = Date.now()/1000; |
|
|
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
thisResource._do(cbfunc); |
|
|
|
} |
|
|
|
}, function(ret) { |
|
|
|
thisResource._handleError(ret); |
|
|
|
} |
|
|
|
); |
|
|
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype._cacheMessage = function (msg,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisResource = this; |
|
|
|
var newid = msg.id; |
|
|
|
if( !( newid in thisResource._messages) ) { |
|
|
|
var TwisterDirectMsg = require('../TwisterPost.js'); |
|
|
|
var newmsg = thisResource.inflateMessage(msg); |
|
|
|
thisResource._messages[newmsg.getId()] = newmsg; |
|
|
|
if ( thisResource._latestId<newmsg.getId() ) { |
|
|
|
thisResource._latestId=newmsg.getId(); |
|
|
|
} |
|
|
|
if (cbfunc) { |
|
|
|
cbfunc(newmsg); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterDirectMessages.prototype._doMessage = function (id,cbfunc, querySettings) { |
|
|
|
var Twister = this._scope; |
|
|
|
if (id && id>0) { |
|
|
|
if (id in this._messages){ |
|
|
|
cbfunc(this._messages[id]) |
|
|
|
} else { |
|
|
|
var thisResource = this; |
|
|
|
thisResource._updateInProgress = true; |
|
|
|
thisResource.RPC("getspamposts", [ 30 , id ], function(res) { |
|
|
|
if (res.length>0) { |
|
|
|
for (var i = 0; i<res.length; i++) { |
|
|
|
thisResource._cacheMessage(res[i]); |
|
|
|
} |
|
|
|
cbfunc(thisResource._messages[id]) |
|
|
|
} |
|
|
|
thisResource._updateInProgress = false; |
|
|
|
}, querySettings |
|
); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
TwisterDirectMessages.prototype._doUntil = function (cbfunc, querySettings) { |
|
|
|
this._checkQueryAndDo(function doUntil(message){ |
|
|
|
var retVal = cbfunc(message); |
|
|
|
if( message.getId()!=1 && retVal!==false ) { |
|
|
|
message.doPreviousMessage(doUntil, querySettings); |
|
|
|
} |
|
|
|
}, querySettings); |
|
|
|
} |
|
|
|
module.exports = TwisterDirectMessages; |
|
|
|
|
|
},{"../TwisterPost.js":147,"../TwisterResource.js":152,"inherits":52}],141:[function(require,module,exports){ |
|
//'use strict'; |
|
|
|
var inherits = require('inherits'); |
|
var TwisterResource = require('../TwisterResource.js'); |
|
|
|
/** |
|
* Describes the torrent of the {@link TwisterPosts} of a {@link TwisterUser} when available on the host. The torrent significantly speeds up post querying time. It is implemented as a look-ahead that is queryied when accessing a post that is not already in cache. |
|
* @class |
|
*/ |
|
TwisterTorrent = function (walletusername,name,scope) { |
|
|
|
this._hasParentUser = true; |
|
|
|
this._walletusername = walletusername; |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._latestId = -1; |
|
this._messages = {}; |
|
|
|
|
|
this._active = false; |
|
this._type = "torrent"; |
|
|
|
} |
|
|
|
inherits(TwisterTorrent,TwisterResource); |
|
|
|
module.exports = TwisterTorrent; |
|
|
|
TwisterTorrent.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
flatData.active = this._active; |
|
|
|
return flatData; |
|
|
|
} |
|
|
|
TwisterTorrent.prototype.inflate = function (flatData) { |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._active = flatData.active; |
|
|
|
} |
|
|
|
TwisterTorrent.prototype.activate = function () { |
|
|
|
this._active = true; |
|
var thisStream = Twister.getUser(this._name)._stream; |
|
thisStream._activeTorrentUser = this._walletusername; |
|
|
|
} |
|
|
|
TwisterTorrent.prototype.deactivate = function () { |
|
|
|
this._active = false; |
|
|
|
var foundReplacement = false; |
|
|
|
for (var username in Twister._wallet){ |
|
|
|
if (this._name in Twister._wallet[username]._torrents) { |
|
if (Twister._wallet[username]._torrents[this._name]._active) { |
|
Twister.getUser(this._name)._stream._activeTorrentUser=username; |
|
foundReplacement = true; |
|
} |
|
} |
|
} |
|
|
|
if (!foundReplacement) { |
|
var thisStream = Twister.getUser(this._name)._stream; |
|
thisStream._activeTorrentUser = null; |
|
} |
|
|
|
} |
|
|
|
TwisterTorrent.prototype.getQuerySetting = function (setting) { |
|
|
|
//console.log(this._name); |
|
|
|
var Twister = this._scope; |
|
|
|
if (setting in this._activeQuerySettings) { |
|
return this._activeQuerySettings[setting]; |
|
} |
|
|
|
if (setting in this._querySettings) { |
|
return this._querySettings[setting]; |
|
} |
|
|
|
if (setting in Twister.getAccount(this._walletusername)._querySettings) { |
|
return Twister.getAccount(this._walletusername)._querySettings[setting]; |
|
} |
|
|
|
if (setting in Twister.getUser(this._name)._stream._activeQuerySettings) { |
|
return Twister.getUser(this._name)._stream._activeQuerySettings[setting]; |
|
} |
|
|
|
if (setting in Twister.getUser(this._name)._stream._querySettings) { |
|
return Twister.getUser(this._name)._stream._querySettings[setting]; |
|
} |
|
|
|
return TwisterResource.prototype.getQuerySetting.call(this,setting); |
|
|
|
} |
|
|
|
TwisterTorrent.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisTorrent = this; |
|
|
|
var thisAccount = Twister.getAccount(this._walletusername); |
|
|
|
if (thisTorrent._active) { |
|
|
|
thisTorrent._log("locking torrents of same account") |
|
|
|
for (var username in thisAccount._torrents){ |
|
|
|
if (thisAccount._torrents[username]._active) { |
|
thisAccount._torrents[username]._updateInProgress = true; |
|
} |
|
} |
|
|
|
thisTorrent.RPC("getlasthave", [ this._walletusername ], function(res) { |
|
|
|
if (thisTorrent._name in res) { |
|
|
|
thisTorrent._active = true ; |
|
|
|
thisTorrent._log("updating other torrents based on getlasthave result") |
|
|
|
for (var username in res) { |
|
|
|
var resTorrent = thisAccount._torrents[username]; |
|
|
|
if (resTorrent._active) { |
|
|
|
resTorrent._latestId = res[username]; |
|
resTorrent._lastUpdate = Date.now()/1000; |
|
resTorrent._updateInProgress = false; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
} else { |
|
|
|
thisTorrent._active = false ; |
|
thisTorrent._followingName = null ; |
|
thisTorrent._handleError({mesage:"Torrent not active on server"}); |
|
|
|
} |
|
|
|
thisTorrent._log("unlocking torrents with same following name") |
|
|
|
for (var username in thisAccount._torrents){ |
|
|
|
if (thisAccount._torrents[username]._active) { |
|
thisAccount._torrents[username]._updateInProgress = false; |
|
} |
|
} |
|
|
|
if (cbfunc) { |
|
|
|
thisTorrent._do(cbfunc); |
|
|
|
} |
|
|
|
}, function(ret) { |
|
|
|
thisTorrent._handleError(ret); |
|
|
|
}); |
|
|
|
} else { |
|
|
|
thisTorrent._handleError({message: "Activate torrent first"}); |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterTorrent.prototype._fillCacheUsingGetposts = function (count,requests,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisTorrent = this; |
|
var thisStream = Twister.getUser(this._name)._stream; |
|
|
|
if (thisTorrent._active) { |
|
|
|
thisStream._log("querying getposts for "+requests.length+" users") |
|
|
|
for (var i in requests){ |
|
Twister.getUser(requests[i].username)._stream._updateInProgress = true; |
|
} |
|
|
|
thisTorrent.RPC("getposts", [ count , requests ], function(res) { |
|
|
|
var minIds = {}; |
|
|
|
if (res.length>0) { |
|
|
|
for (var i in res) { |
|
|
|
var resUsername = res[i].userpost.n; |
|
var resId = res[i].userpost.k; |
|
|
|
if (resUsername in minIds) { |
|
minIds[resUsername]=Math.min(resId,minIds[resUsername]); |
|
} else { |
|
minIds[resUsername]=resId; |
|
} |
|
|
|
var resStream = Twister.getUser(res[i].userpost.n)._stream; |
|
|
|
resStream._verifyAndCachePost(res[i]); |
|
|
|
} |
|
|
|
if (res.length<count) { |
|
|
|
thisStream._log("got all posts, no need to requery"); |
|
|
|
for (var i in requests){ |
|
if ( !requests.max_id || requests.max_id==-1 ) { |
|
Twister.getUser(requests[i].username)._stream._lastUpdate = Date.now()/1000; |
|
Twister.getUser(requests[i].username)._stream._updateInProgress = false; |
|
} |
|
} |
|
|
|
cbfunc(true); |
|
|
|
} else { |
|
|
|
var newrequests = []; |
|
|
|
for (var i in requests){ |
|
|
|
if (!(requests[i].username in minIds)) { |
|
newrequests.push(requests[i]); |
|
} else { |
|
Twister.getUser(requests[i].username)._stream._lastUpdate = Date.now()/1000; |
|
Twister.getUser(requests[i].username)._stream._updateInProgress = false; |
|
} |
|
|
|
|
|
if ( !requests.max_id || requests.max_id==-1 ) { |
|
Twister.getUser(requests[i].username)._stream._lastUpdate = Date.now()/1000; |
|
Twister.getUser(requests[i].username)._stream._updateInProgress = false; |
|
} |
|
|
|
|
|
} |
|
|
|
if (newrequests.length) { |
|
|
|
thisStream._log("incomplete result. requerying"); |
|
|
|
setTimeout(function(){ |
|
thisTorrent._fillCacheUsingGetposts(count,newrequests,cbfunc); |
|
},200); |
|
|
|
} else { |
|
|
|
thisStream._log("count full but ok"); |
|
|
|
cbfunc(true); |
|
|
|
} |
|
|
|
} |
|
|
|
} else { |
|
|
|
thisStream._log("getposts gave an empty result") |
|
|
|
} |
|
|
|
}, function(ret) { |
|
|
|
thisStream._handleError(ret); |
|
|
|
}); |
|
|
|
} else { |
|
|
|
cbfunc(false); |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterTorrent.prototype._checkForUpdatesUsingGetLastHave = function (cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisTorrent = this; |
|
var thisStream = Twister.getUser(this._name)._stream; |
|
var thisAccount = Twister.getAccount(this._walletusername); |
|
|
|
|
|
for (var username in thisAccount._torrents){ |
|
|
|
if (thisAccount._torrents[username]._active) { |
|
Twister.getUser(username)._stream._updateInProgress = true; |
|
} |
|
} |
|
|
|
thisTorrent._checkQueryAndDo( function() { |
|
|
|
if (thisTorrent._active) { |
|
|
|
var outdatedUsers =[]; |
|
|
|
for (var username in thisAccount._torrents) { |
|
|
|
var resTorrent = thisAccount._torrents[username]; |
|
|
|
if (resTorrent._active) { |
|
|
|
resTorrent._latestId = resTorrent._latestId; |
|
resTorrent._lastUpdate = Date.now()/1000; |
|
resTorrent._updateInProgress = false; |
|
|
|
} |
|
|
|
if (resTorrent._latestId==Twister.getUser(username)._stream._latestId) { |
|
|
|
Twister.getUser(username)._stream._lastUpdate=Date.now()/1000; |
|
Twister.getUser(username)._stream._updateInProgress=false; |
|
|
|
} else { |
|
|
|
outdatedUsers.push({username:username}); |
|
|
|
} |
|
|
|
} |
|
|
|
thisTorrent._fillCacheUsingGetposts(30,outdatedUsers,function(){ |
|
|
|
cbfunc(true); |
|
|
|
for (var username in thisAccount._torrents){ |
|
|
|
if (thisAccount._torrents[username]._active) { |
|
Twister.getUser(username)._stream._updateInProgress = false; |
|
} |
|
} |
|
|
|
}); |
|
|
|
} else { |
|
|
|
cbfunc(false); |
|
|
|
} |
|
|
|
for (var username in thisAccount._torrents){ |
|
|
|
if (thisAccount._torrents[username]._active) { |
|
Twister.getUser(username)._stream._updateInProgress = false; |
|
} |
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
TwisterTorrent.prototype.updatePostsCache = function (cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisTorrent = this; |
|
var thisStream = Twister.getUser(this._name)._stream; |
|
|
|
thisStream._log("update posts cache "+thisStream._name) |
|
|
|
thisTorrent._checkForUpdatesUsingGetLastHave(function(uptodate){ |
|
|
|
if (uptodate) { |
|
thisStream._log("lasthaves "+thisTorrent._name+" worked") |
|
|
|
cbfunc(true); |
|
|
|
} else { |
|
thisStream._log("lasthaves "+thisTorrent._name+" failed") |
|
|
|
thisTorrent._fillCacheUsingGetposts(30,[{username:thisTorrent._name}],cbfunc); |
|
|
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
TwisterTorrent.prototype.fillPostsCache = function (id,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisTorrent = this; |
|
var thisUser = Twister.getUser(this._name); |
|
var thisStream = Twister.getUser(this._name)._stream; |
|
|
|
thisStream._log("fill cache "+thisTorrent._name+" id "+id) |
|
|
|
thisTorrent._fillCacheUsingGetposts(30,[{username:thisTorrent._name,max_id:id}],cbfunc); |
|
|
|
} |
|
},{"../TwisterResource.js":152,"inherits":52}],142:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
/** |
|
* Twister singleton class descriping the state fo the Twister network. |
|
* @module |
|
*/ |
|
|
|
|
|
var TwisterResource = require("./TwisterResource.js"); |
|
var Twister = new TwisterResource("twister",{}); |
|
|
|
Twister._scope = Twister; |
|
Twister._type = "twister"; |
|
Twister._hasParentUser = false; |
|
|
|
Twister._userCache = {}; |
|
Twister._hashtags = {}; |
|
Twister._wallet = {}; |
|
|
|
Twister._activeDHTQueries = 0; |
|
Twister._maxDHTQueries = 5; |
|
|
|
Twister._signatureVerification = "background"; |
|
Twister._averageSignatureCompTime = 200; |
|
Twister._signatureVerificationsInProgress = 0; |
|
|
|
//default query settings: |
|
Twister._outdatedLimit = 90; |
|
Twister._querySettingsByType = {}; |
|
Twister._logfunc = function(){}; |
|
Twister._host = ""; |
|
Twister._timeout = 20000; |
|
Twister._errorfunc = function(error){console.log("Twister error: "+error.message);}; |
|
|
|
Twister._walletType = "server"; |
|
|
|
var availableOptions = ["host","timeout","errorfunc","signatureVerification", |
|
"querySettingsByType","maxDHTQueries","walletType","logfunc"]; |
|
|
|
var TwisterPromotedPosts = require("./TwisterPromotedPosts.js"); |
|
Twister._promotedPosts = new TwisterPromotedPosts(Twister); |
|
|
|
/** @function |
|
* @name init |
|
* @param {string} options.host endpoint for JSON-RPC queries used by default |
|
* @param {int} options.timeout timeout for JSON-RPC in milliseconds |
|
* @param {function} options.errorfunc called when JSON-RPC error occurs |
|
* @param {bool} options.verifySignatures possible options are "none","instant" and "background". Default is "background" |
|
* @param {bool} options.querySettingsByType |
|
* @param {bool} options.maxDHTQueries |
|
*/ |
|
Twister.init = function (options) { |
|
|
|
for (var key in options) { |
|
|
|
if (availableOptions.indexOf(key)>-1) { |
|
|
|
Twister["_"+key] = options[key]; |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
/** @function |
|
* @name getUser |
|
* @description Creates TwisterUser object if not a present in cache and return it. |
|
* @param {string} username |
|
*/ |
|
Twister.getUser = function (username) { |
|
|
|
if (username) { |
|
|
|
if (Twister._userCache[username] === undefined) { |
|
|
|
var TwisterUser = require('./TwisterUser.js'); |
|
|
|
Twister._userCache[username] = new TwisterUser(username,Twister); |
|
|
|
} |
|
|
|
return Twister._userCache[username]; |
|
|
|
} |
|
|
|
} |
|
|
|
/** @function |
|
* @name getUser |
|
* @description Creates {@link TwisterUser} object if not a present in cache and return it. |
|
* @param {string} username |
|
*/ |
|
Twister.getHashtag = function (tag) { |
|
|
|
if (Twister._hashtags[tag] === undefined) { |
|
|
|
var TwisterHashtag = require('./TwisterHashtag.js'); |
|
|
|
Twister._hashtags[tag] = new TwisterHashtag(tag,Twister); |
|
|
|
} |
|
|
|
return Twister._hashtags[tag]; |
|
|
|
} |
|
|
|
/** @function |
|
* @name doHashtagPosts |
|
* @description Creates {@link TwisterUser} object if not a present in cache and return it. |
|
* @param {string} tag |
|
* @param {function} cbfunc callback function. Gets called with an array of {@link TwisterPost} objects as parameter. |
|
* @param {Object} querySettings {@see getQuerySettings} |
|
*/ |
|
Twister.doHashtagPosts = function (tag,cbfunc,querySettings) { |
|
Twister.getHashtag(tag)._checkQueryAndDo(cbfunc,querySettings); |
|
} |
|
|
|
/** @function |
|
* @name getPromotedPosts |
|
* @description returns the {@link TwisterPromotedPosts} object. |
|
*/ |
|
Twister.getPromotedPosts = function() { |
|
return Twister._promotedPosts; |
|
} |
|
|
|
/** @function |
|
* @name getAccount |
|
* @description returns the {@link TwisterAccount} object for a given user. The user must already be loaded (except for the "guest" user). To load wallets from the server use loadServerAccounts. |
|
*/ |
|
Twister.getAccount = function (name) { |
|
|
|
if(name=="guest" && !("guest" in Twister._wallet) && Twister._walletType=="server" ) { |
|
|
|
var TwisterAccount = require('./ServerWallet/TwisterAccount.js'); |
|
|
|
Twister._wallet["guest"] = new TwisterAccount("guest",Twister); |
|
|
|
} |
|
|
|
return Twister._wallet[name]; |
|
} |
|
|
|
/** @function |
|
* @name getAccounts |
|
* @description returns an array with all current {@link TwisterAccount} objects. To load wallets from the server use loadServerAccounts. |
|
*/ |
|
Twister.getAccounts = function () { |
|
|
|
var res = []; |
|
|
|
for (var acc in Twister._wallet) { |
|
res.push(acc); |
|
} |
|
|
|
return res; |
|
|
|
} |
|
|
|
/** @function |
|
* @name loadAccounts |
|
* @description loads available account into the wallet. |
|
*/ |
|
Twister.loadServerAccounts = function (cbfunc) { |
|
|
|
Twister.RPC("listwalletusers", [], function(res){ |
|
|
|
var TwisterAccount = require('./ServerWallet/TwisterAccount.js'); |
|
|
|
if (res.length) { |
|
|
|
for (var i=0; i<res.length; i++) { |
|
|
|
if (!(res[i] in Twister._wallet)) { |
|
Twister._wallet[res[i]] = new TwisterAccount(res[i],Twister); |
|
} |
|
|
|
} |
|
|
|
|
|
} else { |
|
|
|
Twister._handleError({message:"no wallet users found on the server."}) |
|
|
|
} |
|
|
|
cbfunc(res) |
|
|
|
}, function(res){ |
|
|
|
Twister._handleError(res); |
|
|
|
}); |
|
|
|
} |
|
|
|
/** @function |
|
* @name serializeCache |
|
* @description Flattens the complete cache into a nested object which can be used to reload the cache later. |
|
*/ |
|
Twister.serializeCache = function () { |
|
|
|
var retUser = []; |
|
|
|
for (var username in this._userCache){ |
|
retUser.push(this._userCache[username].flatten()); |
|
} |
|
|
|
var wallet = []; |
|
|
|
for (var username in this._wallet){ |
|
wallet.push(this._wallet[username].flatten()); |
|
} |
|
|
|
var hashs = []; |
|
|
|
for (var tag in this._hashtags){ |
|
hashs.push(this._hashtags[tag].flatten()); |
|
} |
|
|
|
var options = {}; |
|
|
|
for(var i in availableOptions) { |
|
options[availableOptions[i]]=Twister["_"+availableOptions[i]]; |
|
} |
|
|
|
var promotedPosts = this._promotedPosts.flatten(); |
|
|
|
return { |
|
users: retUser, |
|
hashtags: hashs, |
|
options: options, |
|
wallet: wallet, |
|
promotedPosts: promotedPosts |
|
}; |
|
} |
|
|
|
/** @function |
|
* @name serializeCache |
|
* @description Reloads the cache from a flattened cache object |
|
*/ |
|
Twister.deserializeCache = function (flatData) { |
|
|
|
if (flatData) { |
|
|
|
Twister.init(flatData.options); |
|
|
|
if (Twister._walletType=="server") { |
|
var TwisterAccount = require('./ServerWallet/TwisterAccount.js'); |
|
} else { |
|
Twister._handleError({message: "Unsupported wallet type."}) |
|
return; |
|
} |
|
|
|
for(var i in flatData.wallet){ |
|
|
|
var newacc = new TwisterAccount(flatData.wallet[i].name,Twister); |
|
newacc.inflate(flatData.wallet[i]); |
|
this._wallet[flatData.wallet[i].name]=newacc; |
|
|
|
} |
|
|
|
var TwisterUser = require('./TwisterUser.js'); |
|
|
|
for(var i in flatData.users){ |
|
|
|
var newuser = new TwisterUser(flatData.users[i].name,Twister); |
|
newuser.inflate(flatData.users[i]); |
|
this._userCache[flatData.users[i].name]=newuser; |
|
|
|
} |
|
|
|
var TwisterHashtag = require('./TwisterHashtag.js'); |
|
|
|
for(var i in flatData.hashtags){ |
|
|
|
var newhashtag = new TwisterHashtag(flatData.hashtags[i].name,Twister); |
|
newhashtag.inflate(flatData.users[i]); |
|
this._hashtags[flatData.hashtags[i].name]=newhashtag; |
|
|
|
} |
|
|
|
this._promotedPosts.inflate(flatData.promotedPosts); |
|
|
|
} |
|
|
|
} |
|
|
|
module.exports = Twister; |
|
|
|
},{"./ServerWallet/TwisterAccount.js":139,"./TwisterHashtag.js":145,"./TwisterPromotedPosts.js":149,"./TwisterResource.js":152,"./TwisterUser.js":155}],143:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the avatar of a {@link TwisterUser}. |
|
* @module |
|
*/ |
|
TwisterAvatar = function (name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._type = "avatar"; |
|
|
|
} |
|
|
|
inherits(TwisterAvatar,TwisterResource); |
|
|
|
module.exports = TwisterAvatar; |
|
|
|
TwisterAvatar.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
var Twister = this._scope; |
|
|
|
thisResource.dhtget([thisResource._name, "avatar", "s"], |
|
|
|
function (result) { |
|
|
|
thisResource._updateInProgress = false; |
|
|
|
if (result[0]) { |
|
|
|
thisResource._data=result[0].p.v; |
|
thisResource._revisionNumber=result[0].p.seq; |
|
thisResource._lastUpdate=Date.now()/1000; |
|
cbfunc(thisResource); |
|
|
|
} else { |
|
|
|
|
|
thisResource._revisionNumber=0; |
|
thisResource._lastUpdate=Date.now()/1000; |
|
cbfunc(thisResource); |
|
|
|
} |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
/** @function |
|
* @name getUrl |
|
* @description return the (data-)url of the avatar |
|
*/ |
|
TwisterAvatar.prototype.getUrl = function () { |
|
|
|
return this._data; |
|
|
|
} |
|
},{"./TwisterResource.js":152,"inherits":52}],144:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the followings of a {@link TwisterUser} |
|
* @module |
|
*/ |
|
TwisterFollowings = function (name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
this._type = "followings"; |
|
|
|
} |
|
|
|
inherits(TwisterFollowings,TwisterResource); |
|
|
|
TwisterFollowings.prototype._do= function (cbfunc) { |
|
this.doUsers(cbfunc); |
|
} |
|
|
|
TwisterFollowings.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var currentCounter = 1; |
|
|
|
var thisResource = this; |
|
|
|
thisResource._data = []; |
|
|
|
thisResource._lastUpdate=Date.now()/1000; |
|
|
|
var requestTilEmpty = function (cbfunc) { |
|
|
|
thisResource.dhtget([thisResource._name, "following"+currentCounter, "s"], |
|
|
|
function (result) { |
|
|
|
if (result[0] && result[0].p.v[0]) { |
|
|
|
for (var i = 0; i<result[0].p.v.length; i++) { |
|
|
|
thisResource._data.push(result[0].p.v[i]); |
|
|
|
} |
|
|
|
currentCounter++; |
|
requestTilEmpty(cbfunc) |
|
|
|
} else { |
|
|
|
thisResource._do(cbfunc); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
); |
|
|
|
}; |
|
|
|
requestTilEmpty(cbfunc); |
|
|
|
} |
|
|
|
|
|
/** @function |
|
* @name getNames |
|
* @description returns the usernames of the following users |
|
*/ |
|
TwisterFollowings.prototype.getNames = function () { |
|
|
|
return this._data; |
|
|
|
} |
|
|
|
/** @function |
|
* @name doUsers |
|
* @description calls cbfunc with every {@link TwisterUser} object of the following users. |
|
* @param {function} cbfunc callback function |
|
*/ |
|
TwisterFollowings.prototype.doUsers = function(cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var followingNames = this.getNames(); |
|
|
|
followings = []; |
|
|
|
for (var i in followingNames) { |
|
|
|
followings.push(Twister.getUser(followingNames[i])); |
|
|
|
} |
|
|
|
cbfunc(followings); |
|
|
|
} |
|
|
|
module.exports = TwisterFollowings; |
|
},{"./TwisterResource.js":152,"inherits":52}],145:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
|
|
/** |
|
* Describes a hashtag resource. |
|
* @module |
|
*/ |
|
TwisterHashtag = function (name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
this._type = "hashtag"; |
|
this._data = {}; |
|
this._hasParentUser = false; |
|
|
|
} |
|
|
|
inherits(TwisterHashtag,TwisterResource); |
|
|
|
TwisterHashtag.prototype._do = function (cbfunc) { |
|
this.doPosts(cbfunc); |
|
} |
|
|
|
TwisterHashtag.prototype._queryAndDo = function (cbfunc, querySettings) { |
|
|
|
var currentCounter = 1; |
|
|
|
var Twister = this._scope; |
|
|
|
var thisHashtag = this; |
|
|
|
thisHashtag._data = {}; |
|
|
|
thisHashtag._lastUpdate=Date.now()/1000; |
|
|
|
thisHashtag.dhtget([thisHashtag._name, "hashtag", "m"], |
|
|
|
function (result) { |
|
|
|
var TwisterPost = require("./TwisterPost.js"); |
|
|
|
for (i=0; i<result.length; i++) { |
|
|
|
var username = result[i].p.v.userpost.n; |
|
var id = result[i].p.v.userpost.k; |
|
|
|
thisHashtag._data[username+":post"+id]=true; |
|
|
|
if (! (id in Twister.getUser(username)._stream._posts ) ) { |
|
|
|
Twister.getUser(username)._stream._verifyAndCachePost(result[i].p.v); |
|
|
|
} |
|
|
|
} |
|
|
|
thisHashtag._do(cbfunc); |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
|
|
/** @function |
|
* @name doPosts |
|
* @description calls cbfunc with every {@link TwisterPost} object of the hashtag. |
|
* @param {function} cbfunc callback function |
|
*/ |
|
TwisterHashtag.prototype.doPosts = function (cbfunc) { |
|
|
|
var posts = []; |
|
|
|
for (var key in this._data) { |
|
|
|
var nandk = key.split(":post"); |
|
var username = nandk[0]; |
|
var id = parseInt(nandk[1]); |
|
|
|
posts.push(Twister.getUser(username).getPost(id)); |
|
|
|
} |
|
|
|
cbfunc(posts); |
|
|
|
} |
|
|
|
module.exports = TwisterHashtag; |
|
},{"./TwisterPost.js":147,"./TwisterResource.js":152,"inherits":52}],146:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the mentions of a {@link TwisterUser}. |
|
* @module |
|
*/ |
|
TwisterMentions = function (name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
this._type = "mentions"; |
|
this._data = {}; |
|
|
|
} |
|
|
|
inherits(TwisterMentions,TwisterResource); |
|
|
|
TwisterMentions.prototype._do = function (cbfunc) { |
|
this.doPosts(cbfunc); |
|
} |
|
|
|
TwisterMentions.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var currentCounter = 1; |
|
|
|
var Twister = this._scope; |
|
|
|
var thisMentions = this; |
|
|
|
var thisUser = Twister.getUser(this._name); |
|
|
|
thisMentions._data = {}; |
|
|
|
thisMentions._lastUpdate=Date.now()/1000; |
|
|
|
thisMentions.dhtget([thisUser.getUsername(), "mention", "m"], |
|
|
|
function (result) { |
|
|
|
var TwisterPost = require("./TwisterPost.js"); |
|
|
|
for (i=0; i<result.length; i++) { |
|
|
|
var username = result[i].p.v.userpost.n; |
|
var id = result[i].p.v.userpost.k; |
|
|
|
thisMentions._data[username+":post"+id]=true; |
|
|
|
if (! (id in Twister.getUser(username)._stream._posts ) ) { |
|
|
|
Twister.getUser(username)._stream._verifyAndCachePost(result[i].p.v); |
|
|
|
} |
|
|
|
} |
|
|
|
thisMentions._do(cbfunc); |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
/** @function |
|
* @name doPosts |
|
* @description calls cbfunc with every {@link TwisterPost} object of the mentions. |
|
* @param {function} cbfunc callback function |
|
*/ |
|
TwisterMentions.prototype.doPosts = function (cbfunc) { |
|
|
|
var posts = []; |
|
|
|
for (var key in this._data) { |
|
|
|
var nandk = key.split(":post"); |
|
var username = nandk[0]; |
|
var id = parseInt(nandk[1]); |
|
|
|
posts.push(Twister.getUser(username).getPost(id)); |
|
|
|
} |
|
|
|
cbfunc(posts); |
|
|
|
} |
|
|
|
module.exports = TwisterMentions; |
|
},{"./TwisterPost.js":147,"./TwisterResource.js":152,"inherits":52}],147:[function(require,module,exports){ |
|
"use strict"; |
|
|
|
var inherits = require('inherits'); |
|
var TwisterResource = require('./TwisterResource.js'); |
|
var TwisterReplies = require('./TwisterReplies.js'); |
|
var TwisterRetwists = require('./TwisterRetwists.js'); |
|
|
|
/** |
|
* Describes a single post of a {@link TwisterUser}. |
|
* @module |
|
*/ |
|
function TwisterPost(data,scope) { |
|
|
|
var name = data.n; |
|
var id = data.k; |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._type = "post"; |
|
this._data = data; |
|
this._isPromotedPost = false; |
|
this._replies = new TwisterReplies(name,id,scope); |
|
this._retwists = new TwisterRetwists(name,id,scope); |
|
|
|
} |
|
|
|
inherits(TwisterPost,TwisterResource); |
|
|
|
module.exports = TwisterPost; |
|
|
|
TwisterPost.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
flatData.retwists = this._retwists.flatten(); |
|
flatData.replies = this._replies.flatten(); |
|
|
|
return flatData; |
|
|
|
} |
|
|
|
TwisterPost.prototype.inflate = function (flatData) { |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._replies.inflate(flatData.replies); |
|
this._retwists.inflate(flatData.retwists); |
|
|
|
} |
|
|
|
TwisterPost.prototype._do = function (cbfunc) { |
|
cbfunc(this); |
|
} |
|
|
|
TwisterPost.prototype._checkQueryAndDo = function (cbfunc) { |
|
cbfunc(this); |
|
} |
|
|
|
TwisterPost.prototype._queryAndDo = function (cbfunc) { |
|
cbfunc(this); |
|
} |
|
|
|
/** @function |
|
* @name getId |
|
* @description returns the post id. |
|
*/ |
|
TwisterPost.prototype.getId = function () { |
|
return this._data.k; |
|
} |
|
|
|
/** @function |
|
* @name getId |
|
* @description returns the post id of the last post. |
|
*/ |
|
TwisterPost.prototype.getLastId = function () { |
|
if (!this._isPromotedPost) { |
|
return this._data.lastk; |
|
} else { |
|
return this._data.k-1; |
|
} |
|
} |
|
|
|
|
|
/** @function |
|
* @name doPreviousPost |
|
* @description calls cbfunc with the previous post as argument. Queries the post if not in cache. |
|
* @param cbfunc {function} |
|
* @param querySettings {Object} |
|
*/ |
|
TwisterPost.prototype.doPreviousPost = function (cbfunc,querySettings) { |
|
|
|
if (!this._isPromotedPost) { |
|
this._scope.getUser(this.getUsername()).doPost(this.getLastId(),cbfunc,querySettings); |
|
} else { |
|
//console.log(this) |
|
this._scope.getPromotedPosts()._doPost(this.getLastId(),cbfunc,querySettings); |
|
} |
|
|
|
} |
|
|
|
/** @function |
|
* @name getTimestamp |
|
* @description returns the timestamp of the post. |
|
*/ |
|
TwisterPost.prototype.getTimestamp = function () { |
|
return this._data.time; |
|
} |
|
|
|
|
|
/** @function |
|
* @name getContent |
|
* @description returns the content of the post. |
|
*/ |
|
TwisterPost.prototype.getContent = function () { |
|
return this._data.msg; |
|
} |
|
|
|
|
|
/** @function |
|
* @name getUsername |
|
* @description returns the user that posted the post. |
|
*/ |
|
TwisterPost.prototype.getUsername = function () { |
|
return this._data.n; |
|
} |
|
|
|
|
|
/** @function |
|
* @name isReply |
|
* @description returns true if the postis an reply. |
|
*/ |
|
TwisterPost.prototype.isReply = function () { |
|
return ("reply" in this._data); |
|
} |
|
|
|
|
|
/** @function |
|
* @name getReplyUser |
|
* @description returns the username of the user to which this post is a reply. |
|
*/ |
|
TwisterPost.prototype.getReplyUser = function () { |
|
return this._data.reply.n; |
|
} |
|
|
|
|
|
/** @function |
|
* @name getReplyId |
|
* @description returns the id of the post that this post is replying to. |
|
*/ |
|
TwisterPost.prototype.getReplyId = function () { |
|
return this._data.reply.k; |
|
} |
|
|
|
|
|
/** @function |
|
* @name doReplies |
|
* @description calls cbfunc for every post that is a reply to this post. |
|
* @param cbfunc {function} |
|
* @param querySettings {Object} |
|
*/ |
|
TwisterPost.prototype.doReplies = function (cbfunc,querySettings) { |
|
this._replies._checkQueryAndDo(cbfunc,querySettings); |
|
} |
|
|
|
/** @function |
|
* @name doPostRepliedTo |
|
* @description calls cbfunc with the post that this post is replying to. |
|
* @param cbfunc {function} |
|
* @param querySettings {Object} |
|
*/ |
|
TwisterPost.prototype.doPostRepliedTo = function (cbfunc,querySettings) { |
|
this._scope.getUser(this.getReplyUser()).doPost(this.getReplyId(),cbfunc,querySettings); |
|
} |
|
|
|
/** @function |
|
* @name isRetwist |
|
* @description returns true if the postis an rewtist. |
|
*/ |
|
TwisterPost.prototype.isRetwist = function () { |
|
return ("rt" in this._data); |
|
} |
|
|
|
|
|
/** @function |
|
* @name getRetwistedId |
|
* @description returns the id of the retwisted post. |
|
*/ |
|
TwisterPost.prototype.getRetwistedId = function () { |
|
return this._data.rt.k; |
|
} |
|
|
|
/** @function |
|
* @name getRetwistedlastId |
|
* @description returns the last id of the rewisted post. |
|
*/ |
|
TwisterPost.prototype.getRetwistedlastId = function () { |
|
return this._data.rt.lastk; |
|
} |
|
|
|
/** @function |
|
* @name getRetwistedTimestamp |
|
* @description returns the timestamp of the retwisted post |
|
*/ |
|
TwisterPost.prototype.getRetwistedTimestamp = function () { |
|
return this._data.rt.time; |
|
} |
|
|
|
/** @function |
|
* @name getRetwistedContent |
|
* @description returns content of the rwteisted post |
|
*/ |
|
TwisterPost.prototype.getRetwistedContent = function () { |
|
return this._data.rt.msg; |
|
} |
|
|
|
/** @function |
|
* @name getRetwistedUser |
|
* @description returns the username of the retwisted post. |
|
*/ |
|
TwisterPost.prototype.getRetwistedUser = function () { |
|
return this._data.rt.n; |
|
} |
|
|
|
/** @function |
|
* @name doRetwistingPosts |
|
* @description calls cbfunc with an array of the post that are retwisting this post. |
|
* @param cbfunc {function} |
|
* @param querySettings {Object} |
|
*/ |
|
TwisterPost.prototype.doRetwistingPosts = function (cbfunc,querySettings) { |
|
this._retwists._checkQueryAndDo(cbfunc,querySettings); |
|
} |
|
|
|
|
|
/** @function |
|
* @name doRetwistedPost |
|
* @description calls cbfunc the retwisted post. |
|
* @param cbfunc {function} |
|
*/ |
|
TwisterPost.prototype.doRetwistedPost = function (cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var id = this._data.rt.k; |
|
|
|
if (!Twister.getUser(this._data.rt.n)._posts[id]) { |
|
|
|
var payload= { |
|
userpost: this._data.rt, |
|
sig_userpost: this._data.sig_rt |
|
}; |
|
|
|
Twister.getUser(this._data.rt.n)._verifyAndCachePost(payload,cbfunc); |
|
|
|
} else { |
|
|
|
cbfunc(Twister.getUser(this._data.rt.n)._posts[id]); |
|
|
|
} |
|
|
|
} |
|
|
|
},{"./TwisterReplies.js":151,"./TwisterResource.js":152,"./TwisterRetwists.js":153,"inherits":52}],148:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the profile of a {@link TwisterUser}. |
|
* @class |
|
*/ |
|
TwisterProfile = function (name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._type = "profile"; |
|
|
|
|
|
} |
|
|
|
inherits(TwisterProfile,TwisterResource); |
|
|
|
module.exports = TwisterProfile; |
|
|
|
TwisterProfile.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
var Twister = this._scope; |
|
|
|
//console.log("before dhtget"+thisResource._name+" "+thisResource._type) |
|
|
|
thisResource.dhtget([thisResource._name, "profile", "s"], |
|
|
|
function (result) { |
|
|
|
if (result[0]) { |
|
|
|
thisResource._data=result[0].p.v; |
|
thisResource._revisionNumber=result[0].p.seq; |
|
thisResource._lastUpdate=Date.now()/1000; |
|
cbfunc(thisResource); |
|
|
|
} else { |
|
|
|
|
|
thisResource._revisionNumber=0; |
|
thisResource._lastUpdate=Date.now()/1000; |
|
cbfunc(thisResource); |
|
|
|
} |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
/** @function |
|
* @name getAllFields |
|
* @description returns the complete profile as Object |
|
*/ |
|
TwisterProfile.prototype.getAllFields = function () { |
|
|
|
return this._data; |
|
|
|
} |
|
|
|
/** @function |
|
* @name getField |
|
* @description returns a single field of the profile |
|
*/ |
|
TwisterProfile.prototype.getField = function (fieldname) { |
|
|
|
if (this._data) { |
|
return this._data[fieldname]; |
|
} else { return null } |
|
|
|
} |
|
},{"./TwisterResource.js":152,"inherits":52}],149:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the promoted posts that are part of the twister blockchain. |
|
* @class |
|
*/ |
|
TwisterPromotedPosts = function (scope) { |
|
|
|
var name = "promoted"; |
|
this._hasParentUser = false; |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._latestId = -1; |
|
this._posts = {}; |
|
|
|
this._type = "promotedposts"; |
|
|
|
} |
|
|
|
inherits(TwisterPromotedPosts,TwisterResource); |
|
|
|
TwisterPromotedPosts.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
var flatPosts = []; |
|
|
|
for (var id in this._posts){ |
|
flatPosts.push(this._posts[id].flatten()); |
|
} |
|
|
|
flatData.posts = flatPosts; |
|
flatData.latestId = this._latestId; |
|
|
|
return flatData; |
|
|
|
} |
|
|
|
TwisterPromotedPosts.prototype.inflate = function (flatData) { |
|
|
|
var TwisterPost = require('./TwisterPost.js'); |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._latestId = flatData.latestId; |
|
|
|
for(var i = 0; i < flatData.posts.length; i++){ |
|
|
|
var newpost = new TwisterPost(flatData.posts[i].data,this._scope); |
|
newpost.inflate(flatData.posts[i]); |
|
this._posts[newpost.getId()]=newpost; |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterPromotedPosts.prototype._do = function (cbfunc) { |
|
|
|
this._doPost(this._latestId,cbfunc); |
|
|
|
} |
|
|
|
TwisterPromotedPosts.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
thisResource.RPC("getspamposts", [ 30 ], function(res) { |
|
|
|
if (res.length>0) { |
|
|
|
for (var i = 0; i<res.length; i++) { |
|
|
|
thisResource._verifyAndCachePost(res[i],function(newpost){ |
|
|
|
if ( newpost.getId() > thisResource._latestId ) { |
|
|
|
thisResource._latestId = newpost.getId(); |
|
thisResource._lastUpdate = Date.now()/1000; |
|
|
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
thisResource._do(cbfunc); |
|
|
|
} |
|
|
|
}, function(ret) { |
|
|
|
thisResource._handleError(ret); |
|
|
|
} |
|
|
|
); |
|
|
|
|
|
} |
|
|
|
TwisterPromotedPosts.prototype._verifyAndCachePost = function (payload,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisResource = this; |
|
|
|
var newid = payload.userpost.k; |
|
var payloadUser = payload.userpost.n; |
|
|
|
if( !( newid in thisResource._posts) ) { |
|
|
|
var signatureVerification = thisResource.getQuerySetting("signatureVerification"); |
|
|
|
var TwisterPost = require('./TwisterPost.js'); |
|
|
|
var newpost = new TwisterPost(payload.userpost,thisResource._scope); |
|
|
|
newpost._isPromotedPost = true; |
|
|
|
thisResource._posts[newpost.getId()] = newpost; |
|
|
|
if ( thisResource._latestId<newpost.getId() ) { |
|
|
|
thisResource._latestId=newpost.getId(); |
|
|
|
} |
|
|
|
if (cbfunc && signatureVerification=="none") { |
|
|
|
newpost._verified = true; |
|
|
|
cbfunc(newpost); |
|
|
|
} else { |
|
|
|
if (cbfunc && signatureVerification=="background") { cbfunc(newpost); } |
|
|
|
Twister.getUser(thisResource._name)._doPubKey(function(pubkey){ |
|
|
|
pubkey.verifySignature(payload.userpost,payload.sig_userpost,function(verified){ |
|
|
|
|
|
if (verified) { |
|
|
|
thisResource._verified=true; |
|
|
|
if (signatureVerification=="instant") { cbfunc(newpost); } |
|
|
|
} else { |
|
|
|
thisResource._handleError({message:"signature of post could not be verified"}); |
|
|
|
} |
|
|
|
}); |
|
|
|
}); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterPromotedPosts.prototype._doPost = function (id,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
if (id && id>0) { |
|
|
|
if (id in this._posts){ |
|
|
|
cbfunc(this._posts[id]) |
|
|
|
} else { |
|
|
|
var thisResource = this; |
|
|
|
thisResource.RPC("getspamposts", [ 30 , id ], function(res) { |
|
|
|
if (res.length>0) { |
|
|
|
for (var i = 0; i<res.length; i++) { |
|
|
|
thisResource._verifyAndCachePost(res[i]); |
|
|
|
} |
|
|
|
cbfunc(thisResource._posts[id]) |
|
|
|
} |
|
|
|
}, function(ret) { |
|
|
|
thisResource._handleError(ret); |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
|
|
TwisterPromotedPosts.prototype.doLatestPostsUntil = function (cbfunc, querySettings) { |
|
|
|
Twister._promotedPosts._checkQueryAndDo(function doUntil(post){ |
|
|
|
var retVal = cbfunc(post); |
|
|
|
if( post.getId()!=1 && retVal!==false ) { |
|
|
|
post.doPreviousPost(doUntil, querySettings); |
|
|
|
} |
|
|
|
}, querySettings); |
|
|
|
} |
|
|
|
module.exports = TwisterPromotedPosts; |
|
|
|
|
|
},{"./TwisterPost.js":147,"./TwisterResource.js":152,"inherits":52}],150:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
var Bitcoin = require('bitcoinjs-lib'); |
|
var Crypto = require('crypto'); |
|
var buffer = require('buffer').Buffer; |
|
var bencode = require('bencode'); |
|
|
|
var twister_network = { |
|
magicPrefix: '\x18twister Signed Message:\n', |
|
pubKeyHash: 0x00, |
|
} |
|
|
|
|
|
/** |
|
* Describes the public key of a user. |
|
* @class |
|
*/ |
|
TwisterPubKey = function (name,scope) { |
|
|
|
this._name = name; |
|
this._data = null; |
|
this._btcKey = null; |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._type = "pubkey"; |
|
|
|
this._verified = true; |
|
|
|
|
|
} |
|
|
|
inherits(TwisterPubKey,TwisterResource); |
|
|
|
module.exports = TwisterPubKey; |
|
|
|
TwisterPubKey.prototype.inflate = function (flatData) { |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
if (this._data) { |
|
|
|
this._btcKey = Bitcoin.ECPubKey.fromHex(this._data); |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterPubKey.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
thisResource.RPC("dumppubkey", [ thisResource._name ], function(res) { |
|
|
|
if(res.length) { |
|
|
|
thisResource._lastUpdate = Date.now()/1000; |
|
|
|
thisResource._data = res; |
|
|
|
thisResource._btcKey = Bitcoin.ECPubKey.fromHex(res); |
|
|
|
if (cbfunc) { |
|
|
|
cbfunc(thisResource); |
|
|
|
} |
|
|
|
} else { thisResource._handleError({message:"pubkey not available on server"}) } |
|
|
|
}, function(ret) { |
|
|
|
thisResource._handleError(ret); |
|
|
|
}); |
|
|
|
} |
|
|
|
TwisterPubKey.prototype.getKey = function () { |
|
|
|
return this._data; |
|
|
|
} |
|
|
|
TwisterPubKey.prototype.verifySignature = function (message_ori, signature_ori, cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
var signature = JSON.parse(JSON.stringify(signature_ori)); |
|
|
|
var message = JSON.parse(JSON.stringify(message_ori)); |
|
|
|
if ("v" in message && (typeof message.v)=="object"){ |
|
if("sig_userpost" in message.v) { |
|
message.v.sig_userpost = new Buffer(message.v.sig_userpost, 'hex'); |
|
} |
|
if ("userpost" in message.v) { |
|
if ("sig_rt" in message.v.userpost) { |
|
message.v.userpost.sig_rt = new Buffer(message.v.userpost.sig_rt, 'hex'); |
|
} |
|
} |
|
} |
|
|
|
if ("sig_rt" in message) { |
|
message.sig_rt = new Buffer(message.sig_rt, 'hex'); |
|
} |
|
|
|
//console.log("verifying message") |
|
|
|
var Twister = this._scope; |
|
|
|
var thisPubKey=this._btcKey; |
|
|
|
Twister._signatureVerificationsInProgress++; |
|
|
|
var timeout=Twister._signatureVerificationsInProgress*Twister._averageSignatureCompTime*4; |
|
|
|
setTimeout(function(){ |
|
|
|
|
|
var startTime = Date.now(); |
|
|
|
message = bencode.encode(message); |
|
|
|
signature = new Buffer(signature, 'hex'); |
|
|
|
try { |
|
|
|
var retVal = Bitcoin.Message.verify(thisPubKey.getAddress(), signature, message, twister_network); |
|
|
|
} catch(e) { |
|
|
|
var retVal = false; |
|
|
|
thisResource._handleError({message:message}); |
|
|
|
} |
|
|
|
var compTime = Date.now()-startTime; |
|
|
|
Twister._averageSignatureCompTime = 0.9*Twister._averageSignatureCompTime + 0.1*compTime; |
|
|
|
Twister._signatureVerificationsInProgress--; |
|
|
|
cbfunc(retVal) |
|
|
|
},timeout); |
|
|
|
|
|
|
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./TwisterResource.js":152,"bencode":1,"bitcoinjs-lib":43,"buffer":172,"crypto":178,"inherits":52}],151:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the replies to a {ælink TwisterPost}. |
|
* @class |
|
*/ |
|
TwisterReplies = function (name,id,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
this._type = "replies"; |
|
this._id = id; |
|
this._data = {}; |
|
|
|
} |
|
|
|
inherits(TwisterReplies,TwisterResource); |
|
|
|
TwisterReplies.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
flatData.id = this._id; |
|
|
|
return flatData; |
|
|
|
|
|
} |
|
|
|
TwisterReplies.prototype.inflate = function (flatData) { |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._id = flatData.id; |
|
|
|
} |
|
|
|
TwisterReplies.prototype._do = function (cbfunc) { |
|
this.doPosts(cbfunc); |
|
} |
|
|
|
TwisterReplies.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var currentCounter = 1; |
|
|
|
var Twister = this._scope; |
|
|
|
var thisReplies = this; |
|
|
|
var thisUser = Twister.getUser(this._name); |
|
|
|
thisReplies._data = {}; |
|
|
|
thisReplies._lastUpdate=Date.now()/1000; |
|
|
|
thisReplies.dhtget([thisUser.getUsername(), "replies"+thisReplies._id, "m"], |
|
|
|
function (result) { |
|
|
|
var TwisterPost = require("./TwisterPost.js"); |
|
|
|
for (i=0; i<result.length; i++) { |
|
|
|
var username = result[i].p.v.userpost.n; |
|
var id = result[i].p.v.userpost.k; |
|
|
|
thisReplies._data[username+":post"+id]=true; |
|
|
|
if (! (id in Twister.getUser(username)._stream._posts ) ) { |
|
|
|
Twister.getUser(username)._stream._verifyAndCachePost(result[i].p.v); |
|
|
|
} |
|
|
|
} |
|
|
|
thisReplies._do(cbfunc); |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
TwisterReplies.prototype.doPosts = function (cbfunc) { |
|
|
|
var posts = []; |
|
|
|
for (var key in this._data) { |
|
|
|
var nandk = key.split(":post"); |
|
var username = nandk[0]; |
|
var id = parseInt(nandk[1]); |
|
|
|
posts.push(Twister.getUser(username).getPost(id)); |
|
|
|
} |
|
|
|
cbfunc(posts); |
|
|
|
} |
|
|
|
module.exports = TwisterReplies; |
|
},{"./TwisterPost.js":147,"./TwisterResource.js":152,"inherits":52}],152:[function(require,module,exports){ |
|
"use strict"; |
|
|
|
/** |
|
* General resource class. Inherited by all objects inside twister-lib-js. |
|
* @class |
|
*/ |
|
function TwisterResource (name,scope) { |
|
|
|
this._type = "none"; |
|
this._scope = scope; |
|
this._name = name; |
|
this._hasParentUser = true; |
|
|
|
this._data = null; |
|
this._verified = false; |
|
this._lastUpdate = -1; |
|
this._querySettings = {}; |
|
this._revisionNumber = null; |
|
|
|
this._updateInProgress = false; |
|
this._activeQuerySettings = {}; |
|
|
|
} |
|
|
|
module.exports = TwisterResource; |
|
|
|
TwisterResource.prototype.flatten = function () { |
|
|
|
return { |
|
lastUpdate: this._lastUpdate, |
|
verified: this._verified, |
|
querySettings: this._querySettings, |
|
revisionNumber: this._revisionNumber, |
|
name: this._name, |
|
data: this._data |
|
}; |
|
|
|
} |
|
|
|
TwisterResource.prototype.inflate = function (flatData) { |
|
|
|
this._lastUpdate = flatData.lastUpdate; |
|
this._verified = flatData.verified; |
|
this._querySettings = flatData.querySettings; |
|
this._revisionNumber = flatData.revisionNumber; |
|
this._name = flatData.name; |
|
this._data = flatData.data; |
|
|
|
if (!this._verified) {this._lastUpdate=-1;} |
|
|
|
} |
|
|
|
TwisterResource.prototype._do = function (cbfunc) { |
|
|
|
cbfunc(this); |
|
|
|
} |
|
|
|
TwisterResource.prototype.inCache = function () { |
|
return (this._lastUpdate>0); |
|
} |
|
|
|
/** |
|
* Checks whether cached resource is outdated and invokes an update if needed. Calls cbfunc on the resource when done. |
|
* @function |
|
* @param {function} cbfunc callback function |
|
* @param {Object} querySettings |
|
*/ |
|
TwisterResource.prototype._checkQueryAndDo = function (cbfunc,querySettings) { |
|
|
|
if (querySettings===undefined) {querySettings={};} |
|
//else {console.log(querySettings)} |
|
|
|
var Twister = this._scope; |
|
|
|
var thisResource = this; |
|
|
|
if (!thisResource._updateInProgress) { |
|
|
|
thisResource._activeQuerySettings = querySettings; |
|
thisResource._updateInProgress = true; |
|
|
|
var outdatedTimestamp = 0; |
|
|
|
outdatedTimestamp = Date.now()/1000 - thisResource.getQuerySetting("outdatedLimit"); |
|
|
|
if ( this._lastUpdate > outdatedTimestamp ){ |
|
|
|
thisResource._do(cbfunc); |
|
|
|
thisResource._log("resource present in cache"); |
|
|
|
thisResource._activeQuerySettings = {}; |
|
thisResource._updateInProgress = false; |
|
|
|
} else { |
|
|
|
thisResource._queryAndDo(function(newresource){ |
|
|
|
thisResource._do(cbfunc); |
|
|
|
thisResource._log("resource not in cahce. querying"); |
|
|
|
thisResource._activeQuerySettings = {}; |
|
thisResource._updateInProgress = false; |
|
|
|
}); |
|
|
|
} |
|
|
|
} else { |
|
|
|
thisResource._log("update in progress "+thisResource._type+" "+thisResource._name) |
|
|
|
setTimeout(function(){ |
|
|
|
thisResource._checkQueryAndDo(cbfunc,querySettings); |
|
|
|
},200); |
|
|
|
} |
|
|
|
} |
|
|
|
/** |
|
* Retrieve currently set query setting. |
|
* @function |
|
* @param {string} settings |
|
*/ |
|
TwisterResource.prototype.getQuerySetting = function (setting) { |
|
|
|
//console.log(this._name); |
|
|
|
var Twister = this._scope; |
|
|
|
if (setting in this._activeQuerySettings) { |
|
return this._activeQuerySettings[setting]; |
|
} |
|
|
|
if (setting in this._querySettings) { |
|
return this._querySettings[setting]; |
|
} |
|
|
|
//console.log(this._type,Twister._querySettingsByType) |
|
|
|
if (setting in Twister._querySettingsByType && this._type in Twister._querySettingsByType[setting]) { |
|
return Twister._querySettingsByType[setting][this._type]; |
|
} |
|
|
|
if (this._hasParentUser && setting in Twister.getUser(this._name)._querySettings) { |
|
return Twister.getUser(this._name)._querySettings[setting]; |
|
} |
|
|
|
if ( ("_"+setting) in Twister) { |
|
return Twister[("_"+setting)]; |
|
} |
|
|
|
this._handleError({message:"unknown query setting was requested."}); |
|
|
|
} |
|
|
|
TwisterResource.prototype.setQuerySetting = function (setting,value) { |
|
|
|
this._querySettings[settings] = value; |
|
|
|
} |
|
|
|
TwisterResource.prototype._handleError = function (error) { |
|
|
|
this._updateInProgress = false; |
|
|
|
this.getQuerySetting("errorfunc").call(this,error); |
|
|
|
} |
|
|
|
TwisterResource.prototype._log = function (log) { |
|
|
|
this.getQuerySetting("logfunc").call(this,log); |
|
|
|
} |
|
|
|
TwisterResource.prototype.RPC = function (method, params, resultFunc, errorFunc) { |
|
|
|
var thisResource = this; |
|
|
|
thisResource._log("calling JSON-RPC "+method+" "+JSON.stringify(params)); |
|
|
|
if (typeof errorFunc != "function") { |
|
|
|
thisResource._activeQuerySettings = errorFunc; |
|
|
|
} |
|
|
|
this._activeQuerySettings["method"]=method; |
|
this._activeQuerySettings["params"]=params; |
|
|
|
//console.log("rpc by "+this._name+" : "+method+" "+JSON.stringify(this._activeQuerySettings)) |
|
|
|
if ( (typeof $ == "function") && ( typeof $.JsonRpcClient == "function") ) { |
|
|
|
var foo = new $.JsonRpcClient({ |
|
ajaxUrl: this.getQuerySetting("host"), |
|
timeout: this.getQuerySetting("timeout") |
|
}); |
|
foo.call(method, params, |
|
function(ret) { if(typeof resultFunc === "function") resultFunc(ret); }, |
|
function(ret) { if(typeof errorFunc === "function" && ret != null) errorFunc(ret); } |
|
); |
|
|
|
} else { |
|
|
|
var request = require('request'); |
|
request({ |
|
|
|
uri: this.getQuerySetting("host"), |
|
method: "POST", |
|
timeout: this.getQuerySetting("timeout"), |
|
followRedirect: true, |
|
maxRedirects: 10, |
|
body: '{"jsonrpc": "2.0", "method": "'+method+'", "params": '+JSON.stringify(params)+', "id": 0}' |
|
|
|
}, function(error, response, body) { |
|
|
|
if (error) { |
|
|
|
error.message = "Host not reachable (http error)."; |
|
|
|
thisResource._handleError(error) |
|
|
|
} else { |
|
var res = JSON.parse(body); |
|
if (res.error) { |
|
thisResource._handleError(res.error); |
|
} else { |
|
resultFunc(res.result); |
|
} |
|
|
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterResource.prototype.dhtget = function (args,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisResource = this; |
|
|
|
if ( Twister._activeDHTQueries < Twister._maxDHTQueries ) { |
|
|
|
Twister._activeDHTQueries++; |
|
|
|
thisResource.RPC("dhtget", args, function(res){ |
|
|
|
Twister._activeDHTQueries--; |
|
|
|
thisResource._log("dhtger restul: "+JSON.stringify(res)); |
|
|
|
if (res[0]) { |
|
|
|
var signatureVerification = thisResource.getQuerySetting("signatureVerification"); |
|
|
|
var signingUser = res[0].sig_user; |
|
|
|
if (signatureVerification!="none" |
|
&& (args[2]="m" || (args[0]==signingUser) ) ) { |
|
|
|
thisResource._log("issuing signature verification"); |
|
|
|
if (signatureVerification=="background") { cbfunc(res); } |
|
|
|
Twister.getUser(signingUser)._doPubKey(function(pubkey){ |
|
|
|
pubkey.verifySignature(res[0].p,res[0].sig_p,function(verified){ |
|
|
|
|
|
if (verified) { |
|
|
|
thisResource._verified = true; |
|
|
|
if (signatureVerification=="instant") { cbfunc(res); } |
|
|
|
} else { |
|
|
|
thisResource._handleError({message: "DHT resource signature could not be verified"}) |
|
|
|
} |
|
|
|
}); |
|
|
|
}); |
|
|
|
} else { |
|
thisResource._verified = true; |
|
thisResource._log("no signature verification needed"); |
|
cbfunc(res); |
|
} |
|
|
|
} else { |
|
cbfunc(res); |
|
thisResource._handleError({message:"dht resource is empty"}); |
|
} |
|
|
|
}, function(error) { |
|
|
|
Twister._activeDHTQueries--; |
|
thisResource._handleError(error); |
|
|
|
}); |
|
|
|
} else { |
|
|
|
setTimeout(function(){ |
|
|
|
thisResource.dhtget(args,cbfunc); |
|
|
|
},200); |
|
|
|
} |
|
|
|
} |
|
},{"request":53}],153:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
|
|
/** |
|
* Describes the retwists of a {@link TwisterPost}. |
|
* @class |
|
*/ |
|
TwisterRetwists = function (name,id,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
this._type = "retwists"; |
|
this._id = id; |
|
this._data = {}; |
|
|
|
} |
|
|
|
inherits(TwisterRetwists,TwisterResource); |
|
|
|
TwisterRetwists.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
flatData.id = this._id; |
|
|
|
return flatData; |
|
|
|
|
|
} |
|
|
|
TwisterRetwists.prototype.inflate = function (flatData) { |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._id = flatData.id; |
|
|
|
} |
|
|
|
TwisterRetwists.prototype._do = function (cbfunc) { |
|
this.doPosts(cbfunc); |
|
} |
|
|
|
TwisterRetwists.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var currentCounter = 1; |
|
|
|
var Twister = this._scope; |
|
|
|
var thisRetwists = this; |
|
|
|
var thisUser = Twister.getUser(this._name); |
|
|
|
thisRetwists._data = {}; |
|
|
|
thisRetwists._lastUpdate=Date.now()/1000; |
|
|
|
thisRetwists.dhtget([thisUser.getUsername(), "rts"+thisRetwists._id, "m"], |
|
|
|
function (result) { |
|
|
|
var TwisterPost = require("./TwisterPost.js"); |
|
|
|
for (i=0; i<result.length; i++) { |
|
|
|
var username = result[i].p.v.userpost.n; |
|
var id = result[i].p.v.userpost.k; |
|
|
|
thisRetwists._data[username+":post"+id]=true; |
|
|
|
if (! (id in Twister.getUser(username)._stream._posts ) ) { |
|
|
|
Twister.getUser(username)._stream._verifyAndCachePost(result[i].p.v); |
|
|
|
} |
|
|
|
} |
|
|
|
thisRetwists._do(cbfunc); |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
TwisterRetwists.prototype.doPosts = function (cbfunc) { |
|
|
|
var posts = []; |
|
|
|
for (var key in this._data) { |
|
|
|
var nandk = key.split(":post"); |
|
var username = nandk[0]; |
|
var id = parseInt(nandk[1]); |
|
|
|
posts.push(Twister.getUser(username).getPost(id)); |
|
|
|
} |
|
|
|
cbfunc(posts); |
|
} |
|
|
|
module.exports = TwisterRetwists; |
|
},{"./TwisterPost.js":147,"./TwisterResource.js":152,"inherits":52}],154:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var TwisterResource = require('./TwisterResource.js'); |
|
//var TwisterTorrent = require('./TwisterTorrent.js'); |
|
|
|
/** |
|
* Describes the stream of posts of a {@link TwisterUser}. |
|
* @class |
|
*/ |
|
TwisterStream = function (name,scope) { |
|
|
|
TwisterResource.call(this,name,scope); |
|
|
|
this._latestId = -1; |
|
this._posts = {}; |
|
this._verified = true; //post are verified individually |
|
|
|
this._activeTorrentUser = null; |
|
|
|
this._type = "stream"; |
|
|
|
} |
|
|
|
inherits(TwisterStream,TwisterResource); |
|
|
|
TwisterStream.prototype.flatten = function () { |
|
|
|
var flatData = TwisterResource.prototype.flatten.call(this); |
|
|
|
var flatPosts = []; |
|
|
|
for (var id in this._posts){ |
|
flatPosts.push(this._posts[id].flatten()); |
|
} |
|
|
|
flatData.posts = flatPosts; |
|
flatData.latestId = this._latestId; |
|
flatData.activeTorrentUser = this._activeTorrentUser; |
|
|
|
|
|
return flatData; |
|
|
|
|
|
} |
|
|
|
TwisterStream.prototype.inflate = function (flatData) { |
|
|
|
var Twister = this._scope; |
|
|
|
var TwisterPost = require('./TwisterPost.js'); |
|
|
|
TwisterResource.prototype.inflate.call(this,flatData); |
|
|
|
this._latestId = flatData.latestId; |
|
this._activeTorrentUser = flatData.activeTorrentUser; |
|
|
|
for(var i = 0; i < flatData.posts.length; i++){ |
|
|
|
if (flatData.posts[i].verified) { |
|
|
|
var newpost = new TwisterPost(flatData.posts[i].data,Twister); |
|
newpost.inflate(flatData.posts[i]); |
|
this._posts[newpost.getId()]=newpost; |
|
|
|
} else if (flatData.posts[i].data.k==this._latestId) { |
|
|
|
this._latestId = -1; |
|
this._lastUpdate = -1; |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
TwisterStream.prototype._do = function (cbfunc) { |
|
|
|
this._doPost(this._latestId,cbfunc); |
|
|
|
} |
|
|
|
TwisterStream.prototype.updateCache = function (cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
if (this._activeTorrentUser) { |
|
Twister._wallet[this._activeTorrentUser]._torrents[this._name].updatePostsCache(cbfunc); |
|
} else { |
|
this._log("user has no active torrent") |
|
cbfunc(false); |
|
} |
|
|
|
} |
|
|
|
TwisterStream.prototype.fillCache = function (id,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
if (this._activeTorrentUser) { |
|
Twister._wallet[this._activeTorrentUser]._torrents[this._name].fillPostsCache(id,cbfunc); |
|
} else { |
|
cbfunc(false); |
|
} |
|
|
|
} |
|
|
|
TwisterStream.prototype._queryAndDo = function (cbfunc) { |
|
|
|
var thisResource = this; |
|
|
|
thisResource.updateCache(function(success){ |
|
|
|
if (success) { |
|
|
|
thisResource._log("updating cache with torrent successfull") |
|
|
|
thisResource._do(cbfunc); |
|
thisResource._updateInProgress = false; |
|
|
|
} else { |
|
|
|
thisResource._log("updating cache with torrent failed") |
|
|
|
thisResource.dhtget([thisResource._name, "status", "s"], function (result) { |
|
|
|
thisResource._log("result from dhtget: "+JSON.stringify(result)); |
|
|
|
if (result[0]) { |
|
|
|
thisResource._verifyAndCachePost(result[0].p.v, function(newpost) { |
|
|
|
thisResource._latestId = newpost.getId(); |
|
thisResource._lastUpdate = Date.now()/1000; |
|
thisResource._updateInProgress = false; |
|
|
|
cbfunc(newpost); |
|
|
|
}); |
|
|
|
|
|
} else { |
|
cbfunc(null); |
|
thisResource._updateInProgress = false; |
|
} |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
TwisterStream.prototype._verifyAndCachePost = function (payload,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
var thisResource = this; |
|
|
|
var newid = payload.userpost.k; |
|
var payloadUser = payload.userpost.n; |
|
|
|
//console.log(payloadUser+":post"+newid); |
|
|
|
if( !( newid in thisResource._posts) ) { |
|
|
|
var signatureVerification = thisResource.getQuerySetting("signatureVerification"); |
|
|
|
var TwisterPost = require('./TwisterPost.js'); |
|
|
|
var newpost = new TwisterPost(payload.userpost,Twister); |
|
|
|
thisResource._posts[newpost.getId()] = newpost; |
|
|
|
if ( thisResource._latestId<newpost.getId() ) { |
|
|
|
thisResource._latestId=newpost.getId(); |
|
|
|
} |
|
|
|
if (cbfunc && signatureVerification=="none") { |
|
|
|
thisResource._log("no signature verifcation needed"); |
|
|
|
newpost._verified = true; |
|
|
|
cbfunc(newpost); |
|
|
|
|
|
} else { |
|
|
|
if (cbfunc && signatureVerification=="background") { |
|
|
|
thisResource._log("issuing signature verification in background"); |
|
|
|
cbfunc(newpost); |
|
|
|
} |
|
|
|
Twister.getUser(thisResource._name)._doPubKey(function(pubkey){ |
|
|
|
pubkey.verifySignature(payload.userpost,payload.sig_userpost,function(verified){ |
|
|
|
|
|
if (verified) { |
|
|
|
newpost._verified=true; |
|
|
|
if (cbfunc && signatureVerification=="instant") { cbfunc(newpost); } |
|
|
|
} else { |
|
|
|
thisResource._handleError({message:"signature of post could not be verified"}); |
|
|
|
} |
|
|
|
}); |
|
|
|
}); |
|
|
|
} |
|
|
|
} else if(cbfunc) { |
|
cbfunc(thisResource._posts[newid]); |
|
} |
|
|
|
} |
|
|
|
TwisterStream.prototype._doPost = function (id,cbfunc) { |
|
|
|
var Twister = this._scope; |
|
|
|
if (id && id>0) { |
|
|
|
if (id in this._posts){ |
|
|
|
cbfunc(this._posts[id]) |
|
|
|
this._log("post already in cache"); |
|
|
|
} else { |
|
|
|
this._log("post "+id+" not in cache"); |
|
|
|
var thisResource = this; |
|
|
|
thisResource.fillCache(id,function(success){ |
|
|
|
if (success) { |
|
|
|
thisResource._log("fill cache was successfull") |
|
|
|
cbfunc(thisResource._posts[id]) |
|
|
|
} else { |
|
|
|
thisResource.dhtget([thisResource._name, "post"+id, "s"], |
|
|
|
function (result) { |
|
|
|
thisResource._verifyAndCachePost(result[0].p.v,cbfunc); |
|
|
|
} |
|
|
|
); |
|
|
|
} |
|
|
|
}); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
TwisterStream.prototype._doUntil = function (cbfunc, querySettings) { |
|
|
|
this._checkQueryAndDo(function doUntil(post){ |
|
|
|
var retVal = cbfunc(post); |
|
|
|
if( post.getId()!=1 && retVal!==false ) { |
|
|
|
post.doPreviousPost(doUntil, querySettings); |
|
|
|
} |
|
|
|
}, querySettings); |
|
|
|
} |
|
|
|
module.exports = TwisterStream; |
|
|
|
|
|
},{"./TwisterPost.js":147,"./TwisterResource.js":152,"inherits":52}],155:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
var TwisterProfile = require('./TwisterProfile.js'); |
|
var TwisterAvatar = require('./TwisterAvatar.js'); |
|
var TwisterFollowings = require('./TwisterFollowings.js'); |
|
var TwisterPubKey = require('./TwisterPubKey.js'); |
|
var TwisterStream = require('./TwisterStream.js'); |
|
var TwisterMentions = require('./TwisterMentions.js'); |
|
|
|
/** |
|
* Describes a user in {@ Twister}. Allows for accessing all public onformation about this user. |
|
* @class |
|
*/ |
|
function TwisterUser(name,scope) { |
|
|
|
this._name = name; |
|
this._scope = scope; |
|
|
|
this._type = "user"; |
|
this._querySettings = {}; |
|
this._hasParentUser = false; |
|
|
|
this._profile = new TwisterProfile(name,scope); |
|
this._avatar = new TwisterAvatar(name,scope); |
|
this._followings = new TwisterFollowings(name,scope); |
|
this._pubkey = new TwisterPubKey(name,scope); |
|
this._stream = new TwisterStream(name,scope); |
|
this._mentions = new TwisterMentions(name,scope); |
|
|
|
} |
|
|
|
module.exports = TwisterUser; |
|
|
|
TwisterUser.prototype.flatten = function () { |
|
|
|
return { |
|
|
|
name: this._name, |
|
querySettings: this._querySettings, |
|
|
|
profile: this._profile.flatten(), |
|
avatar: this._avatar.flatten(), |
|
followings: this._followings.flatten(), |
|
pubkey: this._pubkey.flatten(), |
|
stream: this._stream.flatten(), |
|
mentions: this._mentions.flatten() |
|
|
|
}; |
|
|
|
|
|
} |
|
|
|
TwisterUser.prototype.inflate = function (flatData) { |
|
|
|
this._querySettings = flatData.querySettings; |
|
|
|
this._profile.inflate(flatData.profile); |
|
this._avatar.inflate(flatData.avatar); |
|
this._followings.inflate(flatData.followings); |
|
this._pubkey.inflate(flatData.pubkey); |
|
this._stream.inflate(flatData.stream); |
|
this._mentions.inflate(flatData.mentions); |
|
|
|
} |
|
|
|
TwisterUser.prototype.getUsername = function () { |
|
return this._name; |
|
} |
|
|
|
TwisterUser.prototype._doPubKey = function (cbfunc, querySettings) { |
|
this._pubkey._checkQueryAndDo(cbfunc, querySettings); |
|
} |
|
|
|
TwisterUser.prototype.doProfile = function (cbfunc, querySettings) { |
|
this._profile._checkQueryAndDo(cbfunc, querySettings); |
|
}; |
|
|
|
TwisterUser.prototype.getProfile = function () { |
|
return this._profile; |
|
}; |
|
|
|
TwisterUser.prototype.doAvatar = function (cbfunc, querySettings) { |
|
this._avatar._checkQueryAndDo(cbfunc, querySettings); |
|
}; |
|
|
|
TwisterUser.prototype.getAvatar = function () { |
|
return this._avatar; |
|
}; |
|
|
|
TwisterUser.prototype.doFollowings = function (cbfunc, querySettings) { |
|
this._followings._checkQueryAndDo(cbfunc, querySettings); |
|
}; |
|
|
|
TwisterUser.prototype.getFollowings = function () { |
|
return this._followings; |
|
}; |
|
|
|
TwisterUser.prototype.doStatus = function (cbfunc, querySettings) { |
|
this._stream._checkQueryAndDo(cbfunc, querySettings); |
|
}; |
|
|
|
TwisterUser.prototype.doPost = function (id, cbfunc) { |
|
this._stream._doPost(id, cbfunc); |
|
} |
|
|
|
|
|
TwisterUser.prototype.getPost = function (id) { |
|
if (id in this._stream._posts) { |
|
return this._stream._posts[id]; |
|
} else { |
|
return null; |
|
} |
|
} |
|
|
|
TwisterUser.prototype.doMentions = function (cbfunc, querySettings) { |
|
|
|
this._mentions._checkQueryAndDo(cbfunc); |
|
|
|
} |
|
|
|
TwisterUser.prototype.getMentions = function () { |
|
return this._mentions; |
|
} |
|
|
|
TwisterUser.prototype.doLatestPostsUntil = function (cbfunc, querySettings) { |
|
|
|
this._stream._doUntil(cbfunc, querySettings); |
|
|
|
} |
|
},{"./TwisterAvatar.js":143,"./TwisterFollowings.js":144,"./TwisterMentions.js":146,"./TwisterProfile.js":148,"./TwisterPubKey.js":150,"./TwisterStream.js":154}],156:[function(require,module,exports){ |
|
|
|
},{}],157:[function(require,module,exports){ |
|
// http://wiki.commonjs.org/wiki/Unit_Testing/1.0 |
|
// |
|
// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8! |
|
// |
|
// Originally from narwhal.js (http://narwhaljs.org) |
|
// Copyright (c) 2009 Thomas Robinson <280north.com> |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a copy |
|
// of this software and associated documentation files (the 'Software'), to |
|
// deal in the Software without restriction, including without limitation the |
|
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
|
// sell copies of the Software, and to permit persons to whom the Software is |
|
// furnished to do so, subject to the following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included in |
|
// all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
|
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION |
|
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// when used in node, this will actually load the util module we depend on |
|
// versus loading the builtin util module as happens otherwise |
|
// this is a bug in node module loading as far as I am concerned |
|
var util = require('util/'); |
|
|
|
var pSlice = Array.prototype.slice; |
|
var hasOwn = Object.prototype.hasOwnProperty; |
|
|
|
// 1. The assert module provides functions that throw |
|
// AssertionError's when particular conditions are not met. The |
|
// assert module must conform to the following interface. |
|
|
|
var assert = module.exports = ok; |
|
|
|
// 2. The AssertionError is defined in assert. |
|
// new assert.AssertionError({ message: message, |
|
// actual: actual, |
|
// expected: expected }) |
|
|
|
assert.AssertionError = function AssertionError(options) { |
|
this.name = 'AssertionError'; |
|
this.actual = options.actual; |
|
this.expected = options.expected; |
|
this.operator = options.operator; |
|
if (options.message) { |
|
this.message = options.message; |
|
this.generatedMessage = false; |
|
} else { |
|
this.message = getMessage(this); |
|
this.generatedMessage = true; |
|
} |
|
var stackStartFunction = options.stackStartFunction || fail; |
|
|
|
if (Error.captureStackTrace) { |
|
Error.captureStackTrace(this, stackStartFunction); |
|
} |
|
else { |
|
// non v8 browsers so we can have a stacktrace |
|
var err = new Error(); |
|
if (err.stack) { |
|
var out = err.stack; |
|
|
|
// try to strip useless frames |
|
var fn_name = stackStartFunction.name; |
|
var idx = out.indexOf('\n' + fn_name); |
|
if (idx >= 0) { |
|
// once we have located the function frame |
|
// we need to strip out everything before it (and its line) |
|
var next_line = out.indexOf('\n', idx + 1); |
|
out = out.substring(next_line + 1); |
|
} |
|
|
|
this.stack = out; |
|
} |
|
} |
|
}; |
|
|
|
// assert.AssertionError instanceof Error |
|
util.inherits(assert.AssertionError, Error); |
|
|
|
function replacer(key, value) { |
|
if (util.isUndefined(value)) { |
|
return '' + value; |
|
} |
|
if (util.isNumber(value) && !isFinite(value)) { |
|
return value.toString(); |
|
} |
|
if (util.isFunction(value) || util.isRegExp(value)) { |
|
return value.toString(); |
|
} |
|
return value; |
|
} |
|
|
|
function truncate(s, n) { |
|
if (util.isString(s)) { |
|
return s.length < n ? s : s.slice(0, n); |
|
} else { |
|
return s; |
|
} |
|
} |
|
|
|
function getMessage(self) { |
|
return truncate(JSON.stringify(self.actual, replacer), 128) + ' ' + |
|
self.operator + ' ' + |
|
truncate(JSON.stringify(self.expected, replacer), 128); |
|
} |
|
|
|
// At present only the three keys mentioned above are used and |
|
// understood by the spec. Implementations or sub modules can pass |
|
// other keys to the AssertionError's constructor - they will be |
|
// ignored. |
|
|
|
// 3. All of the following functions must throw an AssertionError |
|
// when a corresponding condition is not met, with a message that |
|
// may be undefined if not provided. All assertion methods provide |
|
// both the actual and expected values to the assertion error for |
|
// display purposes. |
|
|
|
function fail(actual, expected, message, operator, stackStartFunction) { |
|
throw new assert.AssertionError({ |
|
message: message, |
|
actual: actual, |
|
expected: expected, |
|
operator: operator, |
|
stackStartFunction: stackStartFunction |
|
}); |
|
} |
|
|
|
// EXTENSION! allows for well behaved errors defined elsewhere. |
|
assert.fail = fail; |
|
|
|
// 4. Pure assertion tests whether a value is truthy, as determined |
|
// by !!guard. |
|
// assert.ok(guard, message_opt); |
|
// This statement is equivalent to assert.equal(true, !!guard, |
|
// message_opt);. To test strictly for the value true, use |
|
// assert.strictEqual(true, guard, message_opt);. |
|
|
|
function ok(value, message) { |
|
if (!value) fail(value, true, message, '==', assert.ok); |
|
} |
|
assert.ok = ok; |
|
|
|
// 5. The equality assertion tests shallow, coercive equality with |
|
// ==. |
|
// assert.equal(actual, expected, message_opt); |
|
|
|
assert.equal = function equal(actual, expected, message) { |
|
if (actual != expected) fail(actual, expected, message, '==', assert.equal); |
|
}; |
|
|
|
// 6. The non-equality assertion tests for whether two objects are not equal |
|
// with != assert.notEqual(actual, expected, message_opt); |
|
|
|
assert.notEqual = function notEqual(actual, expected, message) { |
|
if (actual == expected) { |
|
fail(actual, expected, message, '!=', assert.notEqual); |
|
} |
|
}; |
|
|
|
// 7. The equivalence assertion tests a deep equality relation. |
|
// assert.deepEqual(actual, expected, message_opt); |
|
|
|
assert.deepEqual = function deepEqual(actual, expected, message) { |
|
if (!_deepEqual(actual, expected)) { |
|
fail(actual, expected, message, 'deepEqual', assert.deepEqual); |
|
} |
|
}; |
|
|
|
function _deepEqual(actual, expected) { |
|
// 7.1. All identical values are equivalent, as determined by ===. |
|
if (actual === expected) { |
|
return true; |
|
|
|
} else if (util.isBuffer(actual) && util.isBuffer(expected)) { |
|
if (actual.length != expected.length) return false; |
|
|
|
for (var i = 0; i < actual.length; i++) { |
|
if (actual[i] !== expected[i]) return false; |
|
} |
|
|
|
return true; |
|
|
|
// 7.2. If the expected value is a Date object, the actual value is |
|
// equivalent if it is also a Date object that refers to the same time. |
|
} else if (util.isDate(actual) && util.isDate(expected)) { |
|
return actual.getTime() === expected.getTime(); |
|
|
|
// 7.3 If the expected value is a RegExp object, the actual value is |
|
// equivalent if it is also a RegExp object with the same source and |
|
// properties (`global`, `multiline`, `lastIndex`, `ignoreCase`). |
|
} else if (util.isRegExp(actual) && util.isRegExp(expected)) { |
|
return actual.source === expected.source && |
|
actual.global === expected.global && |
|
actual.multiline === expected.multiline && |
|
actual.lastIndex === expected.lastIndex && |
|
actual.ignoreCase === expected.ignoreCase; |
|
|
|
// 7.4. Other pairs that do not both pass typeof value == 'object', |
|
// equivalence is determined by ==. |
|
} else if (!util.isObject(actual) && !util.isObject(expected)) { |
|
return actual == expected; |
|
|
|
// 7.5 For all other Object pairs, including Array objects, equivalence is |
|
// determined by having the same number of owned properties (as verified |
|
// with Object.prototype.hasOwnProperty.call), the same set of keys |
|
// (although not necessarily the same order), equivalent values for every |
|
// corresponding key, and an identical 'prototype' property. Note: this |
|
// accounts for both named and indexed properties on Arrays. |
|
} else { |
|
return objEquiv(actual, expected); |
|
} |
|
} |
|
|
|
function isArguments(object) { |
|
return Object.prototype.toString.call(object) == '[object Arguments]'; |
|
} |
|
|
|
function objEquiv(a, b) { |
|
if (util.isNullOrUndefined(a) || util.isNullOrUndefined(b)) |
|
return false; |
|
// an identical 'prototype' property. |
|
if (a.prototype !== b.prototype) return false; |
|
// if one is a primitive, the other must be same |
|
if (util.isPrimitive(a) || util.isPrimitive(b)) { |
|
return a === b; |
|
} |
|
var aIsArgs = isArguments(a), |
|
bIsArgs = isArguments(b); |
|
if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs)) |
|
return false; |
|
if (aIsArgs) { |
|
a = pSlice.call(a); |
|
b = pSlice.call(b); |
|
return _deepEqual(a, b); |
|
} |
|
var ka = objectKeys(a), |
|
kb = objectKeys(b), |
|
key, i; |
|
// having the same number of owned properties (keys incorporates |
|
// hasOwnProperty) |
|
if (ka.length != kb.length) |
|
return false; |
|
//the same set of keys (although not necessarily the same order), |
|
ka.sort(); |
|
kb.sort(); |
|
//~~~cheap key test |
|
for (i = ka.length - 1; i >= 0; i--) { |
|
if (ka[i] != kb[i]) |
|
return false; |
|
} |
|
//equivalent values for every corresponding key, and |
|
//~~~possibly expensive deep test |
|
for (i = ka.length - 1; i >= 0; i--) { |
|
key = ka[i]; |
|
if (!_deepEqual(a[key], b[key])) return false; |
|
} |
|
return true; |
|
} |
|
|
|
// 8. The non-equivalence assertion tests for any deep inequality. |
|
// assert.notDeepEqual(actual, expected, message_opt); |
|
|
|
assert.notDeepEqual = function notDeepEqual(actual, expected, message) { |
|
if (_deepEqual(actual, expected)) { |
|
fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual); |
|
} |
|
}; |
|
|
|
// 9. The strict equality assertion tests strict equality, as determined by ===. |
|
// assert.strictEqual(actual, expected, message_opt); |
|
|
|
assert.strictEqual = function strictEqual(actual, expected, message) { |
|
if (actual !== expected) { |
|
fail(actual, expected, message, '===', assert.strictEqual); |
|
} |
|
}; |
|
|
|
// 10. The strict non-equality assertion tests for strict inequality, as |
|
// determined by !==. assert.notStrictEqual(actual, expected, message_opt); |
|
|
|
assert.notStrictEqual = function notStrictEqual(actual, expected, message) { |
|
if (actual === expected) { |
|
fail(actual, expected, message, '!==', assert.notStrictEqual); |
|
} |
|
}; |
|
|
|
function expectedException(actual, expected) { |
|
if (!actual || !expected) { |
|
return false; |
|
} |
|
|
|
if (Object.prototype.toString.call(expected) == '[object RegExp]') { |
|
return expected.test(actual); |
|
} else if (actual instanceof expected) { |
|
return true; |
|
} else if (expected.call({}, actual) === true) { |
|
return true; |
|
} |
|
|
|
return false; |
|
} |
|
|
|
function _throws(shouldThrow, block, expected, message) { |
|
var actual; |
|
|
|
if (util.isString(expected)) { |
|
message = expected; |
|
expected = null; |
|
} |
|
|
|
try { |
|
block(); |
|
} catch (e) { |
|
actual = e; |
|
} |
|
|
|
message = (expected && expected.name ? ' (' + expected.name + ').' : '.') + |
|
(message ? ' ' + message : '.'); |
|
|
|
if (shouldThrow && !actual) { |
|
fail(actual, expected, 'Missing expected exception' + message); |
|
} |
|
|
|
if (!shouldThrow && expectedException(actual, expected)) { |
|
fail(actual, expected, 'Got unwanted exception' + message); |
|
} |
|
|
|
if ((shouldThrow && actual && expected && |
|
!expectedException(actual, expected)) || (!shouldThrow && actual)) { |
|
throw actual; |
|
} |
|
} |
|
|
|
// 11. Expected to throw an error: |
|
// assert.throws(block, Error_opt, message_opt); |
|
|
|
assert.throws = function(block, /*optional*/error, /*optional*/message) { |
|
_throws.apply(this, [true].concat(pSlice.call(arguments))); |
|
}; |
|
|
|
// EXTENSION! This is annoying to write outside this module. |
|
assert.doesNotThrow = function(block, /*optional*/message) { |
|
_throws.apply(this, [false].concat(pSlice.call(arguments))); |
|
}; |
|
|
|
assert.ifError = function(err) { if (err) {throw err;}}; |
|
|
|
var objectKeys = Object.keys || function (obj) { |
|
var keys = []; |
|
for (var key in obj) { |
|
if (hasOwn.call(obj, key)) keys.push(key); |
|
} |
|
return keys; |
|
}; |
|
|
|
},{"util/":343}],158:[function(require,module,exports){ |
|
arguments[4][156][0].apply(exports,arguments) |
|
},{"dup":156}],159:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
|
|
var TYPED_OK = (typeof Uint8Array !== 'undefined') && |
|
(typeof Uint16Array !== 'undefined') && |
|
(typeof Int32Array !== 'undefined'); |
|
|
|
|
|
exports.assign = function (obj /*from1, from2, from3, ...*/) { |
|
var sources = Array.prototype.slice.call(arguments, 1); |
|
while (sources.length) { |
|
var source = sources.shift(); |
|
if (!source) { continue; } |
|
|
|
if (typeof(source) !== 'object') { |
|
throw new TypeError(source + 'must be non-object'); |
|
} |
|
|
|
for (var p in source) { |
|
if (source.hasOwnProperty(p)) { |
|
obj[p] = source[p]; |
|
} |
|
} |
|
} |
|
|
|
return obj; |
|
}; |
|
|
|
|
|
// reduce buffer size, avoiding mem copy |
|
exports.shrinkBuf = function (buf, size) { |
|
if (buf.length === size) { return buf; } |
|
if (buf.subarray) { return buf.subarray(0, size); } |
|
buf.length = size; |
|
return buf; |
|
}; |
|
|
|
|
|
var fnTyped = { |
|
arraySet: function (dest, src, src_offs, len, dest_offs) { |
|
if (src.subarray && dest.subarray) { |
|
dest.set(src.subarray(src_offs, src_offs+len), dest_offs); |
|
return; |
|
} |
|
// Fallback to ordinary array |
|
for(var i=0; i<len; i++) { |
|
dest[dest_offs + i] = src[src_offs + i]; |
|
} |
|
}, |
|
// Join array of chunks to single array. |
|
flattenChunks: function(chunks) { |
|
var i, l, len, pos, chunk, result; |
|
|
|
// calculate data length |
|
len = 0; |
|
for (i=0, l=chunks.length; i<l; i++) { |
|
len += chunks[i].length; |
|
} |
|
|
|
// join chunks |
|
result = new Uint8Array(len); |
|
pos = 0; |
|
for (i=0, l=chunks.length; i<l; i++) { |
|
chunk = chunks[i]; |
|
result.set(chunk, pos); |
|
pos += chunk.length; |
|
} |
|
|
|
return result; |
|
} |
|
}; |
|
|
|
var fnUntyped = { |
|
arraySet: function (dest, src, src_offs, len, dest_offs) { |
|
for(var i=0; i<len; i++) { |
|
dest[dest_offs + i] = src[src_offs + i]; |
|
} |
|
}, |
|
// Join array of chunks to single array. |
|
flattenChunks: function(chunks) { |
|
return [].concat.apply([], chunks); |
|
} |
|
}; |
|
|
|
|
|
// Enable/Disable typed arrays use, for testing |
|
// |
|
exports.setTyped = function (on) { |
|
if (on) { |
|
exports.Buf8 = Uint8Array; |
|
exports.Buf16 = Uint16Array; |
|
exports.Buf32 = Int32Array; |
|
exports.assign(exports, fnTyped); |
|
} else { |
|
exports.Buf8 = Array; |
|
exports.Buf16 = Array; |
|
exports.Buf32 = Array; |
|
exports.assign(exports, fnUntyped); |
|
} |
|
}; |
|
|
|
exports.setTyped(TYPED_OK); |
|
},{}],160:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
// Note: adler32 takes 12% for level 0 and 2% for level 6. |
|
// It doesn't worth to make additional optimizationa as in original. |
|
// Small size is preferable. |
|
|
|
function adler32(adler, buf, len, pos) { |
|
var s1 = (adler & 0xffff) |0 |
|
, s2 = ((adler >>> 16) & 0xffff) |0 |
|
, n = 0; |
|
|
|
while (len !== 0) { |
|
// Set limit ~ twice less than 5552, to keep |
|
// s2 in 31-bits, because we force signed ints. |
|
// in other case %= will fail. |
|
n = len > 2000 ? 2000 : len; |
|
len -= n; |
|
|
|
do { |
|
s1 = (s1 + buf[pos++]) |0; |
|
s2 = (s2 + s1) |0; |
|
} while (--n); |
|
|
|
s1 %= 65521; |
|
s2 %= 65521; |
|
} |
|
|
|
return (s1 | (s2 << 16)) |0; |
|
} |
|
|
|
|
|
module.exports = adler32; |
|
},{}],161:[function(require,module,exports){ |
|
module.exports = { |
|
|
|
/* Allowed flush values; see deflate() and inflate() below for details */ |
|
Z_NO_FLUSH: 0, |
|
Z_PARTIAL_FLUSH: 1, |
|
Z_SYNC_FLUSH: 2, |
|
Z_FULL_FLUSH: 3, |
|
Z_FINISH: 4, |
|
Z_BLOCK: 5, |
|
Z_TREES: 6, |
|
|
|
/* Return codes for the compression/decompression functions. Negative values |
|
* are errors, positive values are used for special but normal events. |
|
*/ |
|
Z_OK: 0, |
|
Z_STREAM_END: 1, |
|
Z_NEED_DICT: 2, |
|
Z_ERRNO: -1, |
|
Z_STREAM_ERROR: -2, |
|
Z_DATA_ERROR: -3, |
|
//Z_MEM_ERROR: -4, |
|
Z_BUF_ERROR: -5, |
|
//Z_VERSION_ERROR: -6, |
|
|
|
/* compression levels */ |
|
Z_NO_COMPRESSION: 0, |
|
Z_BEST_SPEED: 1, |
|
Z_BEST_COMPRESSION: 9, |
|
Z_DEFAULT_COMPRESSION: -1, |
|
|
|
|
|
Z_FILTERED: 1, |
|
Z_HUFFMAN_ONLY: 2, |
|
Z_RLE: 3, |
|
Z_FIXED: 4, |
|
Z_DEFAULT_STRATEGY: 0, |
|
|
|
/* Possible values of the data_type field (though see inflate()) */ |
|
Z_BINARY: 0, |
|
Z_TEXT: 1, |
|
//Z_ASCII: 1, // = Z_TEXT (deprecated) |
|
Z_UNKNOWN: 2, |
|
|
|
/* The deflate compression method */ |
|
Z_DEFLATED: 8 |
|
//Z_NULL: null // Use -1 or null inline, depending on var type |
|
}; |
|
},{}],162:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
// Note: we can't get significant speed boost here. |
|
// So write code to minimize size - no pregenerated tables |
|
// and array tools dependencies. |
|
|
|
|
|
// Use ordinary array, since untyped makes no boost here |
|
function makeTable() { |
|
var c, table = []; |
|
|
|
for(var n =0; n < 256; n++){ |
|
c = n; |
|
for(var k =0; k < 8; k++){ |
|
c = ((c&1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); |
|
} |
|
table[n] = c; |
|
} |
|
|
|
return table; |
|
} |
|
|
|
// Create table on load. Just 255 signed longs. Not a problem. |
|
var crcTable = makeTable(); |
|
|
|
|
|
function crc32(crc, buf, len, pos) { |
|
var t = crcTable |
|
, end = pos + len; |
|
|
|
crc = crc ^ (-1); |
|
|
|
for (var i = pos; i < end; i++ ) { |
|
crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; |
|
} |
|
|
|
return (crc ^ (-1)); // >>> 0; |
|
} |
|
|
|
|
|
module.exports = crc32; |
|
},{}],163:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
var utils = require('../utils/common'); |
|
var trees = require('./trees'); |
|
var adler32 = require('./adler32'); |
|
var crc32 = require('./crc32'); |
|
var msg = require('./messages'); |
|
|
|
/* Public constants ==========================================================*/ |
|
/* ===========================================================================*/ |
|
|
|
|
|
/* Allowed flush values; see deflate() and inflate() below for details */ |
|
var Z_NO_FLUSH = 0; |
|
var Z_PARTIAL_FLUSH = 1; |
|
//var Z_SYNC_FLUSH = 2; |
|
var Z_FULL_FLUSH = 3; |
|
var Z_FINISH = 4; |
|
var Z_BLOCK = 5; |
|
//var Z_TREES = 6; |
|
|
|
|
|
/* Return codes for the compression/decompression functions. Negative values |
|
* are errors, positive values are used for special but normal events. |
|
*/ |
|
var Z_OK = 0; |
|
var Z_STREAM_END = 1; |
|
//var Z_NEED_DICT = 2; |
|
//var Z_ERRNO = -1; |
|
var Z_STREAM_ERROR = -2; |
|
var Z_DATA_ERROR = -3; |
|
//var Z_MEM_ERROR = -4; |
|
var Z_BUF_ERROR = -5; |
|
//var Z_VERSION_ERROR = -6; |
|
|
|
|
|
/* compression levels */ |
|
//var Z_NO_COMPRESSION = 0; |
|
//var Z_BEST_SPEED = 1; |
|
//var Z_BEST_COMPRESSION = 9; |
|
var Z_DEFAULT_COMPRESSION = -1; |
|
|
|
|
|
var Z_FILTERED = 1; |
|
var Z_HUFFMAN_ONLY = 2; |
|
var Z_RLE = 3; |
|
var Z_FIXED = 4; |
|
var Z_DEFAULT_STRATEGY = 0; |
|
|
|
/* Possible values of the data_type field (though see inflate()) */ |
|
//var Z_BINARY = 0; |
|
//var Z_TEXT = 1; |
|
//var Z_ASCII = 1; // = Z_TEXT |
|
var Z_UNKNOWN = 2; |
|
|
|
|
|
/* The deflate compression method */ |
|
var Z_DEFLATED = 8; |
|
|
|
/*============================================================================*/ |
|
|
|
|
|
var MAX_MEM_LEVEL = 9; |
|
/* Maximum value for memLevel in deflateInit2 */ |
|
var MAX_WBITS = 15; |
|
/* 32K LZ77 window */ |
|
var DEF_MEM_LEVEL = 8; |
|
|
|
|
|
var LENGTH_CODES = 29; |
|
/* number of length codes, not counting the special END_BLOCK code */ |
|
var LITERALS = 256; |
|
/* number of literal bytes 0..255 */ |
|
var L_CODES = LITERALS + 1 + LENGTH_CODES; |
|
/* number of Literal or Length codes, including the END_BLOCK code */ |
|
var D_CODES = 30; |
|
/* number of distance codes */ |
|
var BL_CODES = 19; |
|
/* number of codes used to transfer the bit lengths */ |
|
var HEAP_SIZE = 2*L_CODES + 1; |
|
/* maximum heap size */ |
|
var MAX_BITS = 15; |
|
/* All codes must not exceed MAX_BITS bits */ |
|
|
|
var MIN_MATCH = 3; |
|
var MAX_MATCH = 258; |
|
var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); |
|
|
|
var PRESET_DICT = 0x20; |
|
|
|
var INIT_STATE = 42; |
|
var EXTRA_STATE = 69; |
|
var NAME_STATE = 73; |
|
var COMMENT_STATE = 91; |
|
var HCRC_STATE = 103; |
|
var BUSY_STATE = 113; |
|
var FINISH_STATE = 666; |
|
|
|
var BS_NEED_MORE = 1; /* block not completed, need more input or more output */ |
|
var BS_BLOCK_DONE = 2; /* block flush performed */ |
|
var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ |
|
var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ |
|
|
|
var OS_CODE = 0x03; // Unix :) . Don't detect, use this default. |
|
|
|
function err(strm, errorCode) { |
|
strm.msg = msg[errorCode]; |
|
return errorCode; |
|
} |
|
|
|
function rank(f) { |
|
return ((f) << 1) - ((f) > 4 ? 9 : 0); |
|
} |
|
|
|
function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } |
|
|
|
|
|
/* ========================================================================= |
|
* Flush as much pending output as possible. All deflate() output goes |
|
* through this function so some applications may wish to modify it |
|
* to avoid allocating a large strm->output buffer and copying into it. |
|
* (See also read_buf()). |
|
*/ |
|
function flush_pending(strm) { |
|
var s = strm.state; |
|
|
|
//_tr_flush_bits(s); |
|
var len = s.pending; |
|
if (len > strm.avail_out) { |
|
len = strm.avail_out; |
|
} |
|
if (len === 0) { return; } |
|
|
|
utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out); |
|
strm.next_out += len; |
|
s.pending_out += len; |
|
strm.total_out += len; |
|
strm.avail_out -= len; |
|
s.pending -= len; |
|
if (s.pending === 0) { |
|
s.pending_out = 0; |
|
} |
|
} |
|
|
|
|
|
function flush_block_only (s, last) { |
|
trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); |
|
s.block_start = s.strstart; |
|
flush_pending(s.strm); |
|
} |
|
|
|
|
|
function put_byte(s, b) { |
|
s.pending_buf[s.pending++] = b; |
|
} |
|
|
|
|
|
/* ========================================================================= |
|
* Put a short in the pending buffer. The 16-bit value is put in MSB order. |
|
* IN assertion: the stream state is correct and there is enough room in |
|
* pending_buf. |
|
*/ |
|
function putShortMSB(s, b) { |
|
// put_byte(s, (Byte)(b >> 8)); |
|
// put_byte(s, (Byte)(b & 0xff)); |
|
s.pending_buf[s.pending++] = (b >>> 8) & 0xff; |
|
s.pending_buf[s.pending++] = b & 0xff; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Read a new buffer from the current input stream, update the adler32 |
|
* and total number of bytes read. All deflate() input goes through |
|
* this function so some applications may wish to modify it to avoid |
|
* allocating a large strm->input buffer and copying from it. |
|
* (See also flush_pending()). |
|
*/ |
|
function read_buf(strm, buf, start, size) { |
|
var len = strm.avail_in; |
|
|
|
if (len > size) { len = size; } |
|
if (len === 0) { return 0; } |
|
|
|
strm.avail_in -= len; |
|
|
|
utils.arraySet(buf, strm.input, strm.next_in, len, start); |
|
if (strm.state.wrap === 1) { |
|
strm.adler = adler32(strm.adler, buf, len, start); |
|
} |
|
|
|
else if (strm.state.wrap === 2) { |
|
strm.adler = crc32(strm.adler, buf, len, start); |
|
} |
|
|
|
strm.next_in += len; |
|
strm.total_in += len; |
|
|
|
return len; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Set match_start to the longest match starting at the given string and |
|
* return its length. Matches shorter or equal to prev_length are discarded, |
|
* in which case the result is equal to prev_length and match_start is |
|
* garbage. |
|
* IN assertions: cur_match is the head of the hash chain for the current |
|
* string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 |
|
* OUT assertion: the match length is not greater than s->lookahead. |
|
*/ |
|
function longest_match(s, cur_match) { |
|
var chain_length = s.max_chain_length; /* max hash chain length */ |
|
var scan = s.strstart; /* current string */ |
|
var match; /* matched string */ |
|
var len; /* length of current match */ |
|
var best_len = s.prev_length; /* best match length so far */ |
|
var nice_match = s.nice_match; /* stop if match long enough */ |
|
var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? |
|
s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; |
|
|
|
var _win = s.window; // shortcut |
|
|
|
var wmask = s.w_mask; |
|
var prev = s.prev; |
|
|
|
/* Stop when cur_match becomes <= limit. To simplify the code, |
|
* we prevent matches with the string of window index 0. |
|
*/ |
|
|
|
var strend = s.strstart + MAX_MATCH; |
|
var scan_end1 = _win[scan + best_len - 1]; |
|
var scan_end = _win[scan + best_len]; |
|
|
|
/* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. |
|
* It is easy to get rid of this optimization if necessary. |
|
*/ |
|
// Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); |
|
|
|
/* Do not waste too much time if we already have a good match: */ |
|
if (s.prev_length >= s.good_match) { |
|
chain_length >>= 2; |
|
} |
|
/* Do not look for matches beyond the end of the input. This is necessary |
|
* to make deflate deterministic. |
|
*/ |
|
if (nice_match > s.lookahead) { nice_match = s.lookahead; } |
|
|
|
// Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); |
|
|
|
do { |
|
// Assert(cur_match < s->strstart, "no future"); |
|
match = cur_match; |
|
|
|
/* Skip to next match if the match length cannot increase |
|
* or if the match length is less than 2. Note that the checks below |
|
* for insufficient lookahead only occur occasionally for performance |
|
* reasons. Therefore uninitialized memory will be accessed, and |
|
* conditional jumps will be made that depend on those values. |
|
* However the length of the match is limited to the lookahead, so |
|
* the output of deflate is not affected by the uninitialized values. |
|
*/ |
|
|
|
if (_win[match + best_len] !== scan_end || |
|
_win[match + best_len - 1] !== scan_end1 || |
|
_win[match] !== _win[scan] || |
|
_win[++match] !== _win[scan + 1]) { |
|
continue; |
|
} |
|
|
|
/* The check at best_len-1 can be removed because it will be made |
|
* again later. (This heuristic is not always a win.) |
|
* It is not necessary to compare scan[2] and match[2] since they |
|
* are always equal when the other bytes match, given that |
|
* the hash keys are equal and that HASH_BITS >= 8. |
|
*/ |
|
scan += 2; |
|
match++; |
|
// Assert(*scan == *match, "match[2]?"); |
|
|
|
/* We check for insufficient lookahead only every 8th comparison; |
|
* the 256th check will be made at strstart+258. |
|
*/ |
|
do { |
|
/*jshint noempty:false*/ |
|
} while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && |
|
_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && |
|
_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && |
|
_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && |
|
scan < strend); |
|
|
|
// Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); |
|
|
|
len = MAX_MATCH - (strend - scan); |
|
scan = strend - MAX_MATCH; |
|
|
|
if (len > best_len) { |
|
s.match_start = cur_match; |
|
best_len = len; |
|
if (len >= nice_match) { |
|
break; |
|
} |
|
scan_end1 = _win[scan + best_len - 1]; |
|
scan_end = _win[scan + best_len]; |
|
} |
|
} while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); |
|
|
|
if (best_len <= s.lookahead) { |
|
return best_len; |
|
} |
|
return s.lookahead; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Fill the window when the lookahead becomes insufficient. |
|
* Updates strstart and lookahead. |
|
* |
|
* IN assertion: lookahead < MIN_LOOKAHEAD |
|
* OUT assertions: strstart <= window_size-MIN_LOOKAHEAD |
|
* At least one byte has been read, or avail_in == 0; reads are |
|
* performed for at least two bytes (required for the zip translate_eol |
|
* option -- not supported here). |
|
*/ |
|
function fill_window(s) { |
|
var _w_size = s.w_size; |
|
var p, n, m, more, str; |
|
|
|
//Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); |
|
|
|
do { |
|
more = s.window_size - s.lookahead - s.strstart; |
|
|
|
// JS ints have 32 bit, block below not needed |
|
/* Deal with !@#$% 64K limit: */ |
|
//if (sizeof(int) <= 2) { |
|
// if (more == 0 && s->strstart == 0 && s->lookahead == 0) { |
|
// more = wsize; |
|
// |
|
// } else if (more == (unsigned)(-1)) { |
|
// /* Very unlikely, but possible on 16 bit machine if |
|
// * strstart == 0 && lookahead == 1 (input done a byte at time) |
|
// */ |
|
// more--; |
|
// } |
|
//} |
|
|
|
|
|
/* If the window is almost full and there is insufficient lookahead, |
|
* move the upper half to the lower one to make room in the upper half. |
|
*/ |
|
if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { |
|
|
|
utils.arraySet(s.window, s.window, _w_size, _w_size, 0); |
|
s.match_start -= _w_size; |
|
s.strstart -= _w_size; |
|
/* we now have strstart >= MAX_DIST */ |
|
s.block_start -= _w_size; |
|
|
|
/* Slide the hash table (could be avoided with 32 bit values |
|
at the expense of memory usage). We slide even when level == 0 |
|
to keep the hash table consistent if we switch back to level > 0 |
|
later. (Using level 0 permanently is not an optimal usage of |
|
zlib, so we don't care about this pathological case.) |
|
*/ |
|
|
|
n = s.hash_size; |
|
p = n; |
|
do { |
|
m = s.head[--p]; |
|
s.head[p] = (m >= _w_size ? m - _w_size : 0); |
|
} while (--n); |
|
|
|
n = _w_size; |
|
p = n; |
|
do { |
|
m = s.prev[--p]; |
|
s.prev[p] = (m >= _w_size ? m - _w_size : 0); |
|
/* If n is not on any hash chain, prev[n] is garbage but |
|
* its value will never be used. |
|
*/ |
|
} while (--n); |
|
|
|
more += _w_size; |
|
} |
|
if (s.strm.avail_in === 0) { |
|
break; |
|
} |
|
|
|
/* If there was no sliding: |
|
* strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && |
|
* more == window_size - lookahead - strstart |
|
* => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) |
|
* => more >= window_size - 2*WSIZE + 2 |
|
* In the BIG_MEM or MMAP case (not yet supported), |
|
* window_size == input_size + MIN_LOOKAHEAD && |
|
* strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. |
|
* Otherwise, window_size == 2*WSIZE so more >= 2. |
|
* If there was sliding, more >= WSIZE. So in all cases, more >= 2. |
|
*/ |
|
//Assert(more >= 2, "more < 2"); |
|
n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); |
|
s.lookahead += n; |
|
|
|
/* Initialize the hash value now that we have some input: */ |
|
if (s.lookahead + s.insert >= MIN_MATCH) { |
|
str = s.strstart - s.insert; |
|
s.ins_h = s.window[str]; |
|
|
|
/* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask; |
|
//#if MIN_MATCH != 3 |
|
// Call update_hash() MIN_MATCH-3 more times |
|
//#endif |
|
while (s.insert) { |
|
/* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH-1]) & s.hash_mask; |
|
|
|
s.prev[str & s.w_mask] = s.head[s.ins_h]; |
|
s.head[s.ins_h] = str; |
|
str++; |
|
s.insert--; |
|
if (s.lookahead + s.insert < MIN_MATCH) { |
|
break; |
|
} |
|
} |
|
} |
|
/* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, |
|
* but this is not important since only literal bytes will be emitted. |
|
*/ |
|
|
|
} while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); |
|
|
|
/* If the WIN_INIT bytes after the end of the current data have never been |
|
* written, then zero those bytes in order to avoid memory check reports of |
|
* the use of uninitialized (or uninitialised as Julian writes) bytes by |
|
* the longest match routines. Update the high water mark for the next |
|
* time through here. WIN_INIT is set to MAX_MATCH since the longest match |
|
* routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. |
|
*/ |
|
// if (s.high_water < s.window_size) { |
|
// var curr = s.strstart + s.lookahead; |
|
// var init = 0; |
|
// |
|
// if (s.high_water < curr) { |
|
// /* Previous high water mark below current data -- zero WIN_INIT |
|
// * bytes or up to end of window, whichever is less. |
|
// */ |
|
// init = s.window_size - curr; |
|
// if (init > WIN_INIT) |
|
// init = WIN_INIT; |
|
// zmemzero(s->window + curr, (unsigned)init); |
|
// s->high_water = curr + init; |
|
// } |
|
// else if (s->high_water < (ulg)curr + WIN_INIT) { |
|
// /* High water mark at or above current data, but below current data |
|
// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up |
|
// * to end of window, whichever is less. |
|
// */ |
|
// init = (ulg)curr + WIN_INIT - s->high_water; |
|
// if (init > s->window_size - s->high_water) |
|
// init = s->window_size - s->high_water; |
|
// zmemzero(s->window + s->high_water, (unsigned)init); |
|
// s->high_water += init; |
|
// } |
|
// } |
|
// |
|
// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, |
|
// "not enough room for search"); |
|
} |
|
|
|
/* =========================================================================== |
|
* Copy without compression as much as possible from the input stream, return |
|
* the current block state. |
|
* This function does not insert new strings in the dictionary since |
|
* uncompressible data is probably not useful. This function is used |
|
* only for the level=0 compression option. |
|
* NOTE: this function should be optimized to avoid extra copying from |
|
* window to pending_buf. |
|
*/ |
|
function deflate_stored(s, flush) { |
|
/* Stored blocks are limited to 0xffff bytes, pending_buf is limited |
|
* to pending_buf_size, and each stored block has a 5 byte header: |
|
*/ |
|
var max_block_size = 0xffff; |
|
|
|
if (max_block_size > s.pending_buf_size - 5) { |
|
max_block_size = s.pending_buf_size - 5; |
|
} |
|
|
|
/* Copy as much as possible from input to output: */ |
|
for (;;) { |
|
/* Fill the window as much as possible: */ |
|
if (s.lookahead <= 1) { |
|
|
|
//Assert(s->strstart < s->w_size+MAX_DIST(s) || |
|
// s->block_start >= (long)s->w_size, "slide too late"); |
|
// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) || |
|
// s.block_start >= s.w_size)) { |
|
// throw new Error("slide too late"); |
|
// } |
|
|
|
fill_window(s); |
|
if (s.lookahead === 0 && flush === Z_NO_FLUSH) { |
|
return BS_NEED_MORE; |
|
} |
|
|
|
if (s.lookahead === 0) { |
|
break; |
|
} |
|
/* flush the current block */ |
|
} |
|
//Assert(s->block_start >= 0L, "block gone"); |
|
// if (s.block_start < 0) throw new Error("block gone"); |
|
|
|
s.strstart += s.lookahead; |
|
s.lookahead = 0; |
|
|
|
/* Emit a stored block if pending_buf will be full: */ |
|
var max_start = s.block_start + max_block_size; |
|
|
|
if (s.strstart === 0 || s.strstart >= max_start) { |
|
/* strstart == 0 is possible when wraparound on 16-bit machine */ |
|
s.lookahead = s.strstart - max_start; |
|
s.strstart = max_start; |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
|
|
|
|
} |
|
/* Flush if we may have to slide, otherwise block_start may become |
|
* negative and the data will be gone: |
|
*/ |
|
if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
} |
|
|
|
s.insert = 0; |
|
|
|
if (flush === Z_FINISH) { |
|
/*** FLUSH_BLOCK(s, 1); ***/ |
|
flush_block_only(s, true); |
|
if (s.strm.avail_out === 0) { |
|
return BS_FINISH_STARTED; |
|
} |
|
/***/ |
|
return BS_FINISH_DONE; |
|
} |
|
|
|
if (s.strstart > s.block_start) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
|
|
return BS_NEED_MORE; |
|
} |
|
|
|
/* =========================================================================== |
|
* Compress as much as possible from the input stream, return the current |
|
* block state. |
|
* This function does not perform lazy evaluation of matches and inserts |
|
* new strings in the dictionary only for unmatched strings or for short |
|
* matches. It is used only for the fast compression options. |
|
*/ |
|
function deflate_fast(s, flush) { |
|
var hash_head; /* head of the hash chain */ |
|
var bflush; /* set if current block must be flushed */ |
|
|
|
for (;;) { |
|
/* Make sure that we always have enough lookahead, except |
|
* at the end of the input file. We need MAX_MATCH bytes |
|
* for the next match, plus MIN_MATCH bytes to insert the |
|
* string following the next match. |
|
*/ |
|
if (s.lookahead < MIN_LOOKAHEAD) { |
|
fill_window(s); |
|
if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { |
|
return BS_NEED_MORE; |
|
} |
|
if (s.lookahead === 0) { |
|
break; /* flush the current block */ |
|
} |
|
} |
|
|
|
/* Insert the string window[strstart .. strstart+2] in the |
|
* dictionary, and set hash_head to the head of the hash chain: |
|
*/ |
|
hash_head = 0/*NIL*/; |
|
if (s.lookahead >= MIN_MATCH) { |
|
/*** INSERT_STRING(s, s.strstart, hash_head); ***/ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; |
|
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; |
|
s.head[s.ins_h] = s.strstart; |
|
/***/ |
|
} |
|
|
|
/* Find the longest match, discarding those <= prev_length. |
|
* At this point we have always match_length < MIN_MATCH |
|
*/ |
|
if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { |
|
/* To simplify the code, we prevent matches with the string |
|
* of window index 0 (in particular we have to avoid a match |
|
* of the string with itself at the start of the input file). |
|
*/ |
|
s.match_length = longest_match(s, hash_head); |
|
/* longest_match() sets match_start */ |
|
} |
|
if (s.match_length >= MIN_MATCH) { |
|
// check_match(s, s.strstart, s.match_start, s.match_length); // for debug only |
|
|
|
/*** _tr_tally_dist(s, s.strstart - s.match_start, |
|
s.match_length - MIN_MATCH, bflush); ***/ |
|
bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); |
|
|
|
s.lookahead -= s.match_length; |
|
|
|
/* Insert new strings in the hash table only if the match length |
|
* is not too large. This saves time but degrades compression. |
|
*/ |
|
if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { |
|
s.match_length--; /* string at strstart already in table */ |
|
do { |
|
s.strstart++; |
|
/*** INSERT_STRING(s, s.strstart, hash_head); ***/ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; |
|
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; |
|
s.head[s.ins_h] = s.strstart; |
|
/***/ |
|
/* strstart never exceeds WSIZE-MAX_MATCH, so there are |
|
* always MIN_MATCH bytes ahead. |
|
*/ |
|
} while (--s.match_length !== 0); |
|
s.strstart++; |
|
} else |
|
{ |
|
s.strstart += s.match_length; |
|
s.match_length = 0; |
|
s.ins_h = s.window[s.strstart]; |
|
/* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask; |
|
|
|
//#if MIN_MATCH != 3 |
|
// Call UPDATE_HASH() MIN_MATCH-3 more times |
|
//#endif |
|
/* If lookahead < MIN_MATCH, ins_h is garbage, but it does not |
|
* matter since it will be recomputed at next deflate call. |
|
*/ |
|
} |
|
} else { |
|
/* No match, output a literal byte */ |
|
//Tracevv((stderr,"%c", s.window[s.strstart])); |
|
/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ |
|
bflush = trees._tr_tally(s, 0, s.window[s.strstart]); |
|
|
|
s.lookahead--; |
|
s.strstart++; |
|
} |
|
if (bflush) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
} |
|
s.insert = ((s.strstart < (MIN_MATCH-1)) ? s.strstart : MIN_MATCH-1); |
|
if (flush === Z_FINISH) { |
|
/*** FLUSH_BLOCK(s, 1); ***/ |
|
flush_block_only(s, true); |
|
if (s.strm.avail_out === 0) { |
|
return BS_FINISH_STARTED; |
|
} |
|
/***/ |
|
return BS_FINISH_DONE; |
|
} |
|
if (s.last_lit) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
return BS_BLOCK_DONE; |
|
} |
|
|
|
/* =========================================================================== |
|
* Same as above, but achieves better compression. We use a lazy |
|
* evaluation for matches: a match is finally adopted only if there is |
|
* no better match at the next window position. |
|
*/ |
|
function deflate_slow(s, flush) { |
|
var hash_head; /* head of hash chain */ |
|
var bflush; /* set if current block must be flushed */ |
|
|
|
var max_insert; |
|
|
|
/* Process the input block. */ |
|
for (;;) { |
|
/* Make sure that we always have enough lookahead, except |
|
* at the end of the input file. We need MAX_MATCH bytes |
|
* for the next match, plus MIN_MATCH bytes to insert the |
|
* string following the next match. |
|
*/ |
|
if (s.lookahead < MIN_LOOKAHEAD) { |
|
fill_window(s); |
|
if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { |
|
return BS_NEED_MORE; |
|
} |
|
if (s.lookahead === 0) { break; } /* flush the current block */ |
|
} |
|
|
|
/* Insert the string window[strstart .. strstart+2] in the |
|
* dictionary, and set hash_head to the head of the hash chain: |
|
*/ |
|
hash_head = 0/*NIL*/; |
|
if (s.lookahead >= MIN_MATCH) { |
|
/*** INSERT_STRING(s, s.strstart, hash_head); ***/ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; |
|
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; |
|
s.head[s.ins_h] = s.strstart; |
|
/***/ |
|
} |
|
|
|
/* Find the longest match, discarding those <= prev_length. |
|
*/ |
|
s.prev_length = s.match_length; |
|
s.prev_match = s.match_start; |
|
s.match_length = MIN_MATCH-1; |
|
|
|
if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && |
|
s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { |
|
/* To simplify the code, we prevent matches with the string |
|
* of window index 0 (in particular we have to avoid a match |
|
* of the string with itself at the start of the input file). |
|
*/ |
|
s.match_length = longest_match(s, hash_head); |
|
/* longest_match() sets match_start */ |
|
|
|
if (s.match_length <= 5 && |
|
(s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { |
|
|
|
/* If prev_match is also MIN_MATCH, match_start is garbage |
|
* but we will ignore the current match anyway. |
|
*/ |
|
s.match_length = MIN_MATCH-1; |
|
} |
|
} |
|
/* If there was a match at the previous step and the current |
|
* match is not better, output the previous match: |
|
*/ |
|
if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { |
|
max_insert = s.strstart + s.lookahead - MIN_MATCH; |
|
/* Do not insert strings in hash table beyond this. */ |
|
|
|
//check_match(s, s.strstart-1, s.prev_match, s.prev_length); |
|
|
|
/***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, |
|
s.prev_length - MIN_MATCH, bflush);***/ |
|
bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH); |
|
/* Insert in hash table all strings up to the end of the match. |
|
* strstart-1 and strstart are already inserted. If there is not |
|
* enough lookahead, the last two strings are not inserted in |
|
* the hash table. |
|
*/ |
|
s.lookahead -= s.prev_length-1; |
|
s.prev_length -= 2; |
|
do { |
|
if (++s.strstart <= max_insert) { |
|
/*** INSERT_STRING(s, s.strstart, hash_head); ***/ |
|
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; |
|
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; |
|
s.head[s.ins_h] = s.strstart; |
|
/***/ |
|
} |
|
} while (--s.prev_length !== 0); |
|
s.match_available = 0; |
|
s.match_length = MIN_MATCH-1; |
|
s.strstart++; |
|
|
|
if (bflush) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
|
|
} else if (s.match_available) { |
|
/* If there was no match at the previous position, output a |
|
* single literal. If there was a match but the current match |
|
* is longer, truncate the previous match to a single literal. |
|
*/ |
|
//Tracevv((stderr,"%c", s->window[s->strstart-1])); |
|
/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ |
|
bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]); |
|
|
|
if (bflush) { |
|
/*** FLUSH_BLOCK_ONLY(s, 0) ***/ |
|
flush_block_only(s, false); |
|
/***/ |
|
} |
|
s.strstart++; |
|
s.lookahead--; |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
} else { |
|
/* There is no previous match to compare with, wait for |
|
* the next step to decide. |
|
*/ |
|
s.match_available = 1; |
|
s.strstart++; |
|
s.lookahead--; |
|
} |
|
} |
|
//Assert (flush != Z_NO_FLUSH, "no flush?"); |
|
if (s.match_available) { |
|
//Tracevv((stderr,"%c", s->window[s->strstart-1])); |
|
/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ |
|
bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]); |
|
|
|
s.match_available = 0; |
|
} |
|
s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1; |
|
if (flush === Z_FINISH) { |
|
/*** FLUSH_BLOCK(s, 1); ***/ |
|
flush_block_only(s, true); |
|
if (s.strm.avail_out === 0) { |
|
return BS_FINISH_STARTED; |
|
} |
|
/***/ |
|
return BS_FINISH_DONE; |
|
} |
|
if (s.last_lit) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
|
|
return BS_BLOCK_DONE; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* For Z_RLE, simply look for runs of bytes, generate matches only of distance |
|
* one. Do not maintain a hash table. (It will be regenerated if this run of |
|
* deflate switches away from Z_RLE.) |
|
*/ |
|
function deflate_rle(s, flush) { |
|
var bflush; /* set if current block must be flushed */ |
|
var prev; /* byte at distance one to match */ |
|
var scan, strend; /* scan goes up to strend for length of run */ |
|
|
|
var _win = s.window; |
|
|
|
for (;;) { |
|
/* Make sure that we always have enough lookahead, except |
|
* at the end of the input file. We need MAX_MATCH bytes |
|
* for the longest run, plus one for the unrolled loop. |
|
*/ |
|
if (s.lookahead <= MAX_MATCH) { |
|
fill_window(s); |
|
if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) { |
|
return BS_NEED_MORE; |
|
} |
|
if (s.lookahead === 0) { break; } /* flush the current block */ |
|
} |
|
|
|
/* See how many times the previous byte repeats */ |
|
s.match_length = 0; |
|
if (s.lookahead >= MIN_MATCH && s.strstart > 0) { |
|
scan = s.strstart - 1; |
|
prev = _win[scan]; |
|
if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { |
|
strend = s.strstart + MAX_MATCH; |
|
do { |
|
/*jshint noempty:false*/ |
|
} while (prev === _win[++scan] && prev === _win[++scan] && |
|
prev === _win[++scan] && prev === _win[++scan] && |
|
prev === _win[++scan] && prev === _win[++scan] && |
|
prev === _win[++scan] && prev === _win[++scan] && |
|
scan < strend); |
|
s.match_length = MAX_MATCH - (strend - scan); |
|
if (s.match_length > s.lookahead) { |
|
s.match_length = s.lookahead; |
|
} |
|
} |
|
//Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); |
|
} |
|
|
|
/* Emit match if have run of MIN_MATCH or longer, else emit literal */ |
|
if (s.match_length >= MIN_MATCH) { |
|
//check_match(s, s.strstart, s.strstart - 1, s.match_length); |
|
|
|
/*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ |
|
bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH); |
|
|
|
s.lookahead -= s.match_length; |
|
s.strstart += s.match_length; |
|
s.match_length = 0; |
|
} else { |
|
/* No match, output a literal byte */ |
|
//Tracevv((stderr,"%c", s->window[s->strstart])); |
|
/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ |
|
bflush = trees._tr_tally(s, 0, s.window[s.strstart]); |
|
|
|
s.lookahead--; |
|
s.strstart++; |
|
} |
|
if (bflush) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
} |
|
s.insert = 0; |
|
if (flush === Z_FINISH) { |
|
/*** FLUSH_BLOCK(s, 1); ***/ |
|
flush_block_only(s, true); |
|
if (s.strm.avail_out === 0) { |
|
return BS_FINISH_STARTED; |
|
} |
|
/***/ |
|
return BS_FINISH_DONE; |
|
} |
|
if (s.last_lit) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
return BS_BLOCK_DONE; |
|
} |
|
|
|
/* =========================================================================== |
|
* For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. |
|
* (It will be regenerated if this run of deflate switches away from Huffman.) |
|
*/ |
|
function deflate_huff(s, flush) { |
|
var bflush; /* set if current block must be flushed */ |
|
|
|
for (;;) { |
|
/* Make sure that we have a literal to write. */ |
|
if (s.lookahead === 0) { |
|
fill_window(s); |
|
if (s.lookahead === 0) { |
|
if (flush === Z_NO_FLUSH) { |
|
return BS_NEED_MORE; |
|
} |
|
break; /* flush the current block */ |
|
} |
|
} |
|
|
|
/* Output a literal byte */ |
|
s.match_length = 0; |
|
//Tracevv((stderr,"%c", s->window[s->strstart])); |
|
/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ |
|
bflush = trees._tr_tally(s, 0, s.window[s.strstart]); |
|
s.lookahead--; |
|
s.strstart++; |
|
if (bflush) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
} |
|
s.insert = 0; |
|
if (flush === Z_FINISH) { |
|
/*** FLUSH_BLOCK(s, 1); ***/ |
|
flush_block_only(s, true); |
|
if (s.strm.avail_out === 0) { |
|
return BS_FINISH_STARTED; |
|
} |
|
/***/ |
|
return BS_FINISH_DONE; |
|
} |
|
if (s.last_lit) { |
|
/*** FLUSH_BLOCK(s, 0); ***/ |
|
flush_block_only(s, false); |
|
if (s.strm.avail_out === 0) { |
|
return BS_NEED_MORE; |
|
} |
|
/***/ |
|
} |
|
return BS_BLOCK_DONE; |
|
} |
|
|
|
/* Values for max_lazy_match, good_match and max_chain_length, depending on |
|
* the desired pack level (0..9). The values given below have been tuned to |
|
* exclude worst case performance for pathological files. Better values may be |
|
* found for specific files. |
|
*/ |
|
var Config = function (good_length, max_lazy, nice_length, max_chain, func) { |
|
this.good_length = good_length; |
|
this.max_lazy = max_lazy; |
|
this.nice_length = nice_length; |
|
this.max_chain = max_chain; |
|
this.func = func; |
|
}; |
|
|
|
var configuration_table; |
|
|
|
configuration_table = [ |
|
/* good lazy nice chain */ |
|
new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ |
|
new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ |
|
new Config(4, 5, 16, 8, deflate_fast), /* 2 */ |
|
new Config(4, 6, 32, 32, deflate_fast), /* 3 */ |
|
|
|
new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ |
|
new Config(8, 16, 32, 32, deflate_slow), /* 5 */ |
|
new Config(8, 16, 128, 128, deflate_slow), /* 6 */ |
|
new Config(8, 32, 128, 256, deflate_slow), /* 7 */ |
|
new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ |
|
new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ |
|
]; |
|
|
|
|
|
/* =========================================================================== |
|
* Initialize the "longest match" routines for a new zlib stream |
|
*/ |
|
function lm_init(s) { |
|
s.window_size = 2 * s.w_size; |
|
|
|
/*** CLEAR_HASH(s); ***/ |
|
zero(s.head); // Fill with NIL (= 0); |
|
|
|
/* Set the default configuration parameters: |
|
*/ |
|
s.max_lazy_match = configuration_table[s.level].max_lazy; |
|
s.good_match = configuration_table[s.level].good_length; |
|
s.nice_match = configuration_table[s.level].nice_length; |
|
s.max_chain_length = configuration_table[s.level].max_chain; |
|
|
|
s.strstart = 0; |
|
s.block_start = 0; |
|
s.lookahead = 0; |
|
s.insert = 0; |
|
s.match_length = s.prev_length = MIN_MATCH - 1; |
|
s.match_available = 0; |
|
s.ins_h = 0; |
|
} |
|
|
|
|
|
function DeflateState() { |
|
this.strm = null; /* pointer back to this zlib stream */ |
|
this.status = 0; /* as the name implies */ |
|
this.pending_buf = null; /* output still pending */ |
|
this.pending_buf_size = 0; /* size of pending_buf */ |
|
this.pending_out = 0; /* next pending byte to output to the stream */ |
|
this.pending = 0; /* nb of bytes in the pending buffer */ |
|
this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ |
|
this.gzhead = null; /* gzip header information to write */ |
|
this.gzindex = 0; /* where in extra, name, or comment */ |
|
this.method = Z_DEFLATED; /* can only be DEFLATED */ |
|
this.last_flush = -1; /* value of flush param for previous deflate call */ |
|
|
|
this.w_size = 0; /* LZ77 window size (32K by default) */ |
|
this.w_bits = 0; /* log2(w_size) (8..16) */ |
|
this.w_mask = 0; /* w_size - 1 */ |
|
|
|
this.window = null; |
|
/* Sliding window. Input bytes are read into the second half of the window, |
|
* and move to the first half later to keep a dictionary of at least wSize |
|
* bytes. With this organization, matches are limited to a distance of |
|
* wSize-MAX_MATCH bytes, but this ensures that IO is always |
|
* performed with a length multiple of the block size. |
|
*/ |
|
|
|
this.window_size = 0; |
|
/* Actual size of window: 2*wSize, except when the user input buffer |
|
* is directly used as sliding window. |
|
*/ |
|
|
|
this.prev = null; |
|
/* Link to older string with same hash index. To limit the size of this |
|
* array to 64K, this link is maintained only for the last 32K strings. |
|
* An index in this array is thus a window index modulo 32K. |
|
*/ |
|
|
|
this.head = null; /* Heads of the hash chains or NIL. */ |
|
|
|
this.ins_h = 0; /* hash index of string to be inserted */ |
|
this.hash_size = 0; /* number of elements in hash table */ |
|
this.hash_bits = 0; /* log2(hash_size) */ |
|
this.hash_mask = 0; /* hash_size-1 */ |
|
|
|
this.hash_shift = 0; |
|
/* Number of bits by which ins_h must be shifted at each input |
|
* step. It must be such that after MIN_MATCH steps, the oldest |
|
* byte no longer takes part in the hash key, that is: |
|
* hash_shift * MIN_MATCH >= hash_bits |
|
*/ |
|
|
|
this.block_start = 0; |
|
/* Window position at the beginning of the current output block. Gets |
|
* negative when the window is moved backwards. |
|
*/ |
|
|
|
this.match_length = 0; /* length of best match */ |
|
this.prev_match = 0; /* previous match */ |
|
this.match_available = 0; /* set if previous match exists */ |
|
this.strstart = 0; /* start of string to insert */ |
|
this.match_start = 0; /* start of matching string */ |
|
this.lookahead = 0; /* number of valid bytes ahead in window */ |
|
|
|
this.prev_length = 0; |
|
/* Length of the best match at previous step. Matches not greater than this |
|
* are discarded. This is used in the lazy match evaluation. |
|
*/ |
|
|
|
this.max_chain_length = 0; |
|
/* To speed up deflation, hash chains are never searched beyond this |
|
* length. A higher limit improves compression ratio but degrades the |
|
* speed. |
|
*/ |
|
|
|
this.max_lazy_match = 0; |
|
/* Attempt to find a better match only when the current match is strictly |
|
* smaller than this value. This mechanism is used only for compression |
|
* levels >= 4. |
|
*/ |
|
// That's alias to max_lazy_match, don't use directly |
|
//this.max_insert_length = 0; |
|
/* Insert new strings in the hash table only if the match length is not |
|
* greater than this length. This saves time but degrades compression. |
|
* max_insert_length is used only for compression levels <= 3. |
|
*/ |
|
|
|
this.level = 0; /* compression level (1..9) */ |
|
this.strategy = 0; /* favor or force Huffman coding*/ |
|
|
|
this.good_match = 0; |
|
/* Use a faster search when the previous match is longer than this */ |
|
|
|
this.nice_match = 0; /* Stop searching when current match exceeds this */ |
|
|
|
/* used by trees.c: */ |
|
|
|
/* Didn't use ct_data typedef below to suppress compiler warning */ |
|
|
|
// struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ |
|
// struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ |
|
// struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ |
|
|
|
// Use flat array of DOUBLE size, with interleaved fata, |
|
// because JS does not support effective |
|
this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2); |
|
this.dyn_dtree = new utils.Buf16((2*D_CODES+1) * 2); |
|
this.bl_tree = new utils.Buf16((2*BL_CODES+1) * 2); |
|
zero(this.dyn_ltree); |
|
zero(this.dyn_dtree); |
|
zero(this.bl_tree); |
|
|
|
this.l_desc = null; /* desc. for literal tree */ |
|
this.d_desc = null; /* desc. for distance tree */ |
|
this.bl_desc = null; /* desc. for bit length tree */ |
|
|
|
//ush bl_count[MAX_BITS+1]; |
|
this.bl_count = new utils.Buf16(MAX_BITS+1); |
|
/* number of codes at each bit length for an optimal tree */ |
|
|
|
//int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ |
|
this.heap = new utils.Buf16(2*L_CODES+1); /* heap used to build the Huffman trees */ |
|
zero(this.heap); |
|
|
|
this.heap_len = 0; /* number of elements in the heap */ |
|
this.heap_max = 0; /* element of largest frequency */ |
|
/* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. |
|
* The same heap array is used to build all trees. |
|
*/ |
|
|
|
this.depth = new utils.Buf16(2*L_CODES+1); //uch depth[2*L_CODES+1]; |
|
zero(this.depth); |
|
/* Depth of each subtree used as tie breaker for trees of equal frequency |
|
*/ |
|
|
|
this.l_buf = 0; /* buffer index for literals or lengths */ |
|
|
|
this.lit_bufsize = 0; |
|
/* Size of match buffer for literals/lengths. There are 4 reasons for |
|
* limiting lit_bufsize to 64K: |
|
* - frequencies can be kept in 16 bit counters |
|
* - if compression is not successful for the first block, all input |
|
* data is still in the window so we can still emit a stored block even |
|
* when input comes from standard input. (This can also be done for |
|
* all blocks if lit_bufsize is not greater than 32K.) |
|
* - if compression is not successful for a file smaller than 64K, we can |
|
* even emit a stored file instead of a stored block (saving 5 bytes). |
|
* This is applicable only for zip (not gzip or zlib). |
|
* - creating new Huffman trees less frequently may not provide fast |
|
* adaptation to changes in the input data statistics. (Take for |
|
* example a binary file with poorly compressible code followed by |
|
* a highly compressible string table.) Smaller buffer sizes give |
|
* fast adaptation but have of course the overhead of transmitting |
|
* trees more frequently. |
|
* - I can't count above 4 |
|
*/ |
|
|
|
this.last_lit = 0; /* running index in l_buf */ |
|
|
|
this.d_buf = 0; |
|
/* Buffer index for distances. To simplify the code, d_buf and l_buf have |
|
* the same number of elements. To use different lengths, an extra flag |
|
* array would be necessary. |
|
*/ |
|
|
|
this.opt_len = 0; /* bit length of current block with optimal trees */ |
|
this.static_len = 0; /* bit length of current block with static trees */ |
|
this.matches = 0; /* number of string matches in current block */ |
|
this.insert = 0; /* bytes at end of window left to insert */ |
|
|
|
|
|
this.bi_buf = 0; |
|
/* Output buffer. bits are inserted starting at the bottom (least |
|
* significant bits). |
|
*/ |
|
this.bi_valid = 0; |
|
/* Number of valid bits in bi_buf. All bits above the last valid bit |
|
* are always zero. |
|
*/ |
|
|
|
// Used for window memory init. We safely ignore it for JS. That makes |
|
// sense only for pointers and memory check tools. |
|
//this.high_water = 0; |
|
/* High water mark offset in window for initialized bytes -- bytes above |
|
* this are set to zero in order to avoid memory check warnings when |
|
* longest match routines access bytes past the input. This is then |
|
* updated to the new high water mark. |
|
*/ |
|
} |
|
|
|
|
|
function deflateResetKeep(strm) { |
|
var s; |
|
|
|
if (!strm || !strm.state) { |
|
return err(strm, Z_STREAM_ERROR); |
|
} |
|
|
|
strm.total_in = strm.total_out = 0; |
|
strm.data_type = Z_UNKNOWN; |
|
|
|
s = strm.state; |
|
s.pending = 0; |
|
s.pending_out = 0; |
|
|
|
if (s.wrap < 0) { |
|
s.wrap = -s.wrap; |
|
/* was made negative by deflate(..., Z_FINISH); */ |
|
} |
|
s.status = (s.wrap ? INIT_STATE : BUSY_STATE); |
|
strm.adler = (s.wrap === 2) ? |
|
0 // crc32(0, Z_NULL, 0) |
|
: |
|
1; // adler32(0, Z_NULL, 0) |
|
s.last_flush = Z_NO_FLUSH; |
|
trees._tr_init(s); |
|
return Z_OK; |
|
} |
|
|
|
|
|
function deflateReset(strm) { |
|
var ret = deflateResetKeep(strm); |
|
if (ret === Z_OK) { |
|
lm_init(strm.state); |
|
} |
|
return ret; |
|
} |
|
|
|
|
|
function deflateSetHeader(strm, head) { |
|
if (!strm || !strm.state) { return Z_STREAM_ERROR; } |
|
if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; } |
|
strm.state.gzhead = head; |
|
return Z_OK; |
|
} |
|
|
|
|
|
function deflateInit2(strm, level, method, windowBits, memLevel, strategy) { |
|
if (!strm) { // === Z_NULL |
|
return Z_STREAM_ERROR; |
|
} |
|
var wrap = 1; |
|
|
|
if (level === Z_DEFAULT_COMPRESSION) { |
|
level = 6; |
|
} |
|
|
|
if (windowBits < 0) { /* suppress zlib wrapper */ |
|
wrap = 0; |
|
windowBits = -windowBits; |
|
} |
|
|
|
else if (windowBits > 15) { |
|
wrap = 2; /* write gzip wrapper instead */ |
|
windowBits -= 16; |
|
} |
|
|
|
|
|
if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || |
|
windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || |
|
strategy < 0 || strategy > Z_FIXED) { |
|
return err(strm, Z_STREAM_ERROR); |
|
} |
|
|
|
|
|
if (windowBits === 8) { |
|
windowBits = 9; |
|
} |
|
/* until 256-byte window bug fixed */ |
|
|
|
var s = new DeflateState(); |
|
|
|
strm.state = s; |
|
s.strm = strm; |
|
|
|
s.wrap = wrap; |
|
s.gzhead = null; |
|
s.w_bits = windowBits; |
|
s.w_size = 1 << s.w_bits; |
|
s.w_mask = s.w_size - 1; |
|
|
|
s.hash_bits = memLevel + 7; |
|
s.hash_size = 1 << s.hash_bits; |
|
s.hash_mask = s.hash_size - 1; |
|
s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); |
|
|
|
s.window = new utils.Buf8(s.w_size * 2); |
|
s.head = new utils.Buf16(s.hash_size); |
|
s.prev = new utils.Buf16(s.w_size); |
|
|
|
// Don't need mem init magic for JS. |
|
//s.high_water = 0; /* nothing written to s->window yet */ |
|
|
|
s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ |
|
|
|
s.pending_buf_size = s.lit_bufsize * 4; |
|
s.pending_buf = new utils.Buf8(s.pending_buf_size); |
|
|
|
s.d_buf = s.lit_bufsize >> 1; |
|
s.l_buf = (1 + 2) * s.lit_bufsize; |
|
|
|
s.level = level; |
|
s.strategy = strategy; |
|
s.method = method; |
|
|
|
return deflateReset(strm); |
|
} |
|
|
|
function deflateInit(strm, level) { |
|
return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY); |
|
} |
|
|
|
|
|
function deflate(strm, flush) { |
|
var old_flush, s; |
|
var beg, val; // for gzip header write only |
|
|
|
if (!strm || !strm.state || |
|
flush > Z_BLOCK || flush < 0) { |
|
return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR; |
|
} |
|
|
|
s = strm.state; |
|
|
|
if (!strm.output || |
|
(!strm.input && strm.avail_in !== 0) || |
|
(s.status === FINISH_STATE && flush !== Z_FINISH)) { |
|
return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR); |
|
} |
|
|
|
s.strm = strm; /* just in case */ |
|
old_flush = s.last_flush; |
|
s.last_flush = flush; |
|
|
|
/* Write the header */ |
|
if (s.status === INIT_STATE) { |
|
|
|
if (s.wrap === 2) { // GZIP header |
|
strm.adler = 0; //crc32(0L, Z_NULL, 0); |
|
put_byte(s, 31); |
|
put_byte(s, 139); |
|
put_byte(s, 8); |
|
if (!s.gzhead) { // s->gzhead == Z_NULL |
|
put_byte(s, 0); |
|
put_byte(s, 0); |
|
put_byte(s, 0); |
|
put_byte(s, 0); |
|
put_byte(s, 0); |
|
put_byte(s, s.level === 9 ? 2 : |
|
(s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? |
|
4 : 0)); |
|
put_byte(s, OS_CODE); |
|
s.status = BUSY_STATE; |
|
} |
|
else { |
|
put_byte(s, (s.gzhead.text ? 1 : 0) + |
|
(s.gzhead.hcrc ? 2 : 0) + |
|
(!s.gzhead.extra ? 0 : 4) + |
|
(!s.gzhead.name ? 0 : 8) + |
|
(!s.gzhead.comment ? 0 : 16) |
|
); |
|
put_byte(s, s.gzhead.time & 0xff); |
|
put_byte(s, (s.gzhead.time >> 8) & 0xff); |
|
put_byte(s, (s.gzhead.time >> 16) & 0xff); |
|
put_byte(s, (s.gzhead.time >> 24) & 0xff); |
|
put_byte(s, s.level === 9 ? 2 : |
|
(s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? |
|
4 : 0)); |
|
put_byte(s, s.gzhead.os & 0xff); |
|
if (s.gzhead.extra && s.gzhead.extra.length) { |
|
put_byte(s, s.gzhead.extra.length & 0xff); |
|
put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); |
|
} |
|
if (s.gzhead.hcrc) { |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0); |
|
} |
|
s.gzindex = 0; |
|
s.status = EXTRA_STATE; |
|
} |
|
} |
|
else // DEFLATE header |
|
{ |
|
var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8; |
|
var level_flags = -1; |
|
|
|
if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { |
|
level_flags = 0; |
|
} else if (s.level < 6) { |
|
level_flags = 1; |
|
} else if (s.level === 6) { |
|
level_flags = 2; |
|
} else { |
|
level_flags = 3; |
|
} |
|
header |= (level_flags << 6); |
|
if (s.strstart !== 0) { header |= PRESET_DICT; } |
|
header += 31 - (header % 31); |
|
|
|
s.status = BUSY_STATE; |
|
putShortMSB(s, header); |
|
|
|
/* Save the adler32 of the preset dictionary: */ |
|
if (s.strstart !== 0) { |
|
putShortMSB(s, strm.adler >>> 16); |
|
putShortMSB(s, strm.adler & 0xffff); |
|
} |
|
strm.adler = 1; // adler32(0L, Z_NULL, 0); |
|
} |
|
} |
|
|
|
//#ifdef GZIP |
|
if (s.status === EXTRA_STATE) { |
|
if (s.gzhead.extra/* != Z_NULL*/) { |
|
beg = s.pending; /* start of bytes to update crc */ |
|
|
|
while (s.gzindex < (s.gzhead.extra.length & 0xffff)) { |
|
if (s.pending === s.pending_buf_size) { |
|
if (s.gzhead.hcrc && s.pending > beg) { |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); |
|
} |
|
flush_pending(strm); |
|
beg = s.pending; |
|
if (s.pending === s.pending_buf_size) { |
|
break; |
|
} |
|
} |
|
put_byte(s, s.gzhead.extra[s.gzindex] & 0xff); |
|
s.gzindex++; |
|
} |
|
if (s.gzhead.hcrc && s.pending > beg) { |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); |
|
} |
|
if (s.gzindex === s.gzhead.extra.length) { |
|
s.gzindex = 0; |
|
s.status = NAME_STATE; |
|
} |
|
} |
|
else { |
|
s.status = NAME_STATE; |
|
} |
|
} |
|
if (s.status === NAME_STATE) { |
|
if (s.gzhead.name/* != Z_NULL*/) { |
|
beg = s.pending; /* start of bytes to update crc */ |
|
//int val; |
|
|
|
do { |
|
if (s.pending === s.pending_buf_size) { |
|
if (s.gzhead.hcrc && s.pending > beg) { |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); |
|
} |
|
flush_pending(strm); |
|
beg = s.pending; |
|
if (s.pending === s.pending_buf_size) { |
|
val = 1; |
|
break; |
|
} |
|
} |
|
// JS specific: little magic to add zero terminator to end of string |
|
if (s.gzindex < s.gzhead.name.length) { |
|
val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; |
|
} else { |
|
val = 0; |
|
} |
|
put_byte(s, val); |
|
} while (val !== 0); |
|
|
|
if (s.gzhead.hcrc && s.pending > beg){ |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); |
|
} |
|
if (val === 0) { |
|
s.gzindex = 0; |
|
s.status = COMMENT_STATE; |
|
} |
|
} |
|
else { |
|
s.status = COMMENT_STATE; |
|
} |
|
} |
|
if (s.status === COMMENT_STATE) { |
|
if (s.gzhead.comment/* != Z_NULL*/) { |
|
beg = s.pending; /* start of bytes to update crc */ |
|
//int val; |
|
|
|
do { |
|
if (s.pending === s.pending_buf_size) { |
|
if (s.gzhead.hcrc && s.pending > beg) { |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); |
|
} |
|
flush_pending(strm); |
|
beg = s.pending; |
|
if (s.pending === s.pending_buf_size) { |
|
val = 1; |
|
break; |
|
} |
|
} |
|
// JS specific: little magic to add zero terminator to end of string |
|
if (s.gzindex < s.gzhead.comment.length) { |
|
val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; |
|
} else { |
|
val = 0; |
|
} |
|
put_byte(s, val); |
|
} while (val !== 0); |
|
|
|
if (s.gzhead.hcrc && s.pending > beg) { |
|
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); |
|
} |
|
if (val === 0) { |
|
s.status = HCRC_STATE; |
|
} |
|
} |
|
else { |
|
s.status = HCRC_STATE; |
|
} |
|
} |
|
if (s.status === HCRC_STATE) { |
|
if (s.gzhead.hcrc) { |
|
if (s.pending + 2 > s.pending_buf_size) { |
|
flush_pending(strm); |
|
} |
|
if (s.pending + 2 <= s.pending_buf_size) { |
|
put_byte(s, strm.adler & 0xff); |
|
put_byte(s, (strm.adler >> 8) & 0xff); |
|
strm.adler = 0; //crc32(0L, Z_NULL, 0); |
|
s.status = BUSY_STATE; |
|
} |
|
} |
|
else { |
|
s.status = BUSY_STATE; |
|
} |
|
} |
|
//#endif |
|
|
|
/* Flush as much pending output as possible */ |
|
if (s.pending !== 0) { |
|
flush_pending(strm); |
|
if (strm.avail_out === 0) { |
|
/* Since avail_out is 0, deflate will be called again with |
|
* more output space, but possibly with both pending and |
|
* avail_in equal to zero. There won't be anything to do, |
|
* but this is not an error situation so make sure we |
|
* return OK instead of BUF_ERROR at next call of deflate: |
|
*/ |
|
s.last_flush = -1; |
|
return Z_OK; |
|
} |
|
|
|
/* Make sure there is something to do and avoid duplicate consecutive |
|
* flushes. For repeated and useless calls with Z_FINISH, we keep |
|
* returning Z_STREAM_END instead of Z_BUF_ERROR. |
|
*/ |
|
} else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && |
|
flush !== Z_FINISH) { |
|
return err(strm, Z_BUF_ERROR); |
|
} |
|
|
|
/* User must not provide more input after the first FINISH: */ |
|
if (s.status === FINISH_STATE && strm.avail_in !== 0) { |
|
return err(strm, Z_BUF_ERROR); |
|
} |
|
|
|
/* Start a new block or continue the current one. |
|
*/ |
|
if (strm.avail_in !== 0 || s.lookahead !== 0 || |
|
(flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) { |
|
var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) : |
|
(s.strategy === Z_RLE ? deflate_rle(s, flush) : |
|
configuration_table[s.level].func(s, flush)); |
|
|
|
if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { |
|
s.status = FINISH_STATE; |
|
} |
|
if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { |
|
if (strm.avail_out === 0) { |
|
s.last_flush = -1; |
|
/* avoid BUF_ERROR next call, see above */ |
|
} |
|
return Z_OK; |
|
/* If flush != Z_NO_FLUSH && avail_out == 0, the next call |
|
* of deflate should use the same flush parameter to make sure |
|
* that the flush is complete. So we don't have to output an |
|
* empty block here, this will be done at next call. This also |
|
* ensures that for a very small output buffer, we emit at most |
|
* one empty block. |
|
*/ |
|
} |
|
if (bstate === BS_BLOCK_DONE) { |
|
if (flush === Z_PARTIAL_FLUSH) { |
|
trees._tr_align(s); |
|
} |
|
else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ |
|
|
|
trees._tr_stored_block(s, 0, 0, false); |
|
/* For a full flush, this empty block will be recognized |
|
* as a special marker by inflate_sync(). |
|
*/ |
|
if (flush === Z_FULL_FLUSH) { |
|
/*** CLEAR_HASH(s); ***/ /* forget history */ |
|
zero(s.head); // Fill with NIL (= 0); |
|
|
|
if (s.lookahead === 0) { |
|
s.strstart = 0; |
|
s.block_start = 0; |
|
s.insert = 0; |
|
} |
|
} |
|
} |
|
flush_pending(strm); |
|
if (strm.avail_out === 0) { |
|
s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ |
|
return Z_OK; |
|
} |
|
} |
|
} |
|
//Assert(strm->avail_out > 0, "bug2"); |
|
//if (strm.avail_out <= 0) { throw new Error("bug2");} |
|
|
|
if (flush !== Z_FINISH) { return Z_OK; } |
|
if (s.wrap <= 0) { return Z_STREAM_END; } |
|
|
|
/* Write the trailer */ |
|
if (s.wrap === 2) { |
|
put_byte(s, strm.adler & 0xff); |
|
put_byte(s, (strm.adler >> 8) & 0xff); |
|
put_byte(s, (strm.adler >> 16) & 0xff); |
|
put_byte(s, (strm.adler >> 24) & 0xff); |
|
put_byte(s, strm.total_in & 0xff); |
|
put_byte(s, (strm.total_in >> 8) & 0xff); |
|
put_byte(s, (strm.total_in >> 16) & 0xff); |
|
put_byte(s, (strm.total_in >> 24) & 0xff); |
|
} |
|
else |
|
{ |
|
putShortMSB(s, strm.adler >>> 16); |
|
putShortMSB(s, strm.adler & 0xffff); |
|
} |
|
|
|
flush_pending(strm); |
|
/* If avail_out is zero, the application will call deflate again |
|
* to flush the rest. |
|
*/ |
|
if (s.wrap > 0) { s.wrap = -s.wrap; } |
|
/* write the trailer only once! */ |
|
return s.pending !== 0 ? Z_OK : Z_STREAM_END; |
|
} |
|
|
|
function deflateEnd(strm) { |
|
var status; |
|
|
|
if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) { |
|
return Z_STREAM_ERROR; |
|
} |
|
|
|
status = strm.state.status; |
|
if (status !== INIT_STATE && |
|
status !== EXTRA_STATE && |
|
status !== NAME_STATE && |
|
status !== COMMENT_STATE && |
|
status !== HCRC_STATE && |
|
status !== BUSY_STATE && |
|
status !== FINISH_STATE |
|
) { |
|
return err(strm, Z_STREAM_ERROR); |
|
} |
|
|
|
strm.state = null; |
|
|
|
return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK; |
|
} |
|
|
|
/* ========================================================================= |
|
* Copy the source state to the destination state |
|
*/ |
|
//function deflateCopy(dest, source) { |
|
// |
|
//} |
|
|
|
exports.deflateInit = deflateInit; |
|
exports.deflateInit2 = deflateInit2; |
|
exports.deflateReset = deflateReset; |
|
exports.deflateResetKeep = deflateResetKeep; |
|
exports.deflateSetHeader = deflateSetHeader; |
|
exports.deflate = deflate; |
|
exports.deflateEnd = deflateEnd; |
|
exports.deflateInfo = 'pako deflate (from Nodeca project)'; |
|
|
|
/* Not implemented |
|
exports.deflateBound = deflateBound; |
|
exports.deflateCopy = deflateCopy; |
|
exports.deflateSetDictionary = deflateSetDictionary; |
|
exports.deflateParams = deflateParams; |
|
exports.deflatePending = deflatePending; |
|
exports.deflatePrime = deflatePrime; |
|
exports.deflateTune = deflateTune; |
|
*/ |
|
},{"../utils/common":159,"./adler32":160,"./crc32":162,"./messages":167,"./trees":168}],164:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
// See state defs from inflate.js |
|
var BAD = 30; /* got a data error -- remain here until reset */ |
|
var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ |
|
|
|
/* |
|
Decode literal, length, and distance codes and write out the resulting |
|
literal and match bytes until either not enough input or output is |
|
available, an end-of-block is encountered, or a data error is encountered. |
|
When large enough input and output buffers are supplied to inflate(), for |
|
example, a 16K input buffer and a 64K output buffer, more than 95% of the |
|
inflate execution time is spent in this routine. |
|
|
|
Entry assumptions: |
|
|
|
state.mode === LEN |
|
strm.avail_in >= 6 |
|
strm.avail_out >= 258 |
|
start >= strm.avail_out |
|
state.bits < 8 |
|
|
|
On return, state.mode is one of: |
|
|
|
LEN -- ran out of enough output space or enough available input |
|
TYPE -- reached end of block code, inflate() to interpret next block |
|
BAD -- error in block data |
|
|
|
Notes: |
|
|
|
- The maximum input bits used by a length/distance pair is 15 bits for the |
|
length code, 5 bits for the length extra, 15 bits for the distance code, |
|
and 13 bits for the distance extra. This totals 48 bits, or six bytes. |
|
Therefore if strm.avail_in >= 6, then there is enough input to avoid |
|
checking for available input while decoding. |
|
|
|
- The maximum bytes that a single length/distance pair can output is 258 |
|
bytes, which is the maximum length that can be coded. inflate_fast() |
|
requires strm.avail_out >= 258 for each loop to avoid checking for |
|
output space. |
|
*/ |
|
module.exports = function inflate_fast(strm, start) { |
|
var state; |
|
var _in; /* local strm.input */ |
|
var last; /* have enough input while in < last */ |
|
var _out; /* local strm.output */ |
|
var beg; /* inflate()'s initial strm.output */ |
|
var end; /* while out < end, enough space available */ |
|
//#ifdef INFLATE_STRICT |
|
var dmax; /* maximum distance from zlib header */ |
|
//#endif |
|
var wsize; /* window size or zero if not using window */ |
|
var whave; /* valid bytes in the window */ |
|
var wnext; /* window write index */ |
|
var window; /* allocated sliding window, if wsize != 0 */ |
|
var hold; /* local strm.hold */ |
|
var bits; /* local strm.bits */ |
|
var lcode; /* local strm.lencode */ |
|
var dcode; /* local strm.distcode */ |
|
var lmask; /* mask for first level of length codes */ |
|
var dmask; /* mask for first level of distance codes */ |
|
var here; /* retrieved table entry */ |
|
var op; /* code bits, operation, extra bits, or */ |
|
/* window position, window bytes to copy */ |
|
var len; /* match length, unused bytes */ |
|
var dist; /* match distance */ |
|
var from; /* where to copy match from */ |
|
var from_source; |
|
|
|
|
|
var input, output; // JS specific, because we have no pointers |
|
|
|
/* copy state to local variables */ |
|
state = strm.state; |
|
//here = state.here; |
|
_in = strm.next_in; |
|
input = strm.input; |
|
last = _in + (strm.avail_in - 5); |
|
_out = strm.next_out; |
|
output = strm.output; |
|
beg = _out - (start - strm.avail_out); |
|
end = _out + (strm.avail_out - 257); |
|
//#ifdef INFLATE_STRICT |
|
dmax = state.dmax; |
|
//#endif |
|
wsize = state.wsize; |
|
whave = state.whave; |
|
wnext = state.wnext; |
|
window = state.window; |
|
hold = state.hold; |
|
bits = state.bits; |
|
lcode = state.lencode; |
|
dcode = state.distcode; |
|
lmask = (1 << state.lenbits) - 1; |
|
dmask = (1 << state.distbits) - 1; |
|
|
|
|
|
/* decode literals and length/distances until end-of-block or not enough |
|
input data or output space */ |
|
|
|
top: |
|
do { |
|
if (bits < 15) { |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
} |
|
|
|
here = lcode[hold & lmask]; |
|
|
|
dolen: |
|
for (;;) { // Goto emulation |
|
op = here >>> 24/*here.bits*/; |
|
hold >>>= op; |
|
bits -= op; |
|
op = (here >>> 16) & 0xff/*here.op*/; |
|
if (op === 0) { /* literal */ |
|
//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? |
|
// "inflate: literal '%c'\n" : |
|
// "inflate: literal 0x%02x\n", here.val)); |
|
output[_out++] = here & 0xffff/*here.val*/; |
|
} |
|
else if (op & 16) { /* length base */ |
|
len = here & 0xffff/*here.val*/; |
|
op &= 15; /* number of extra bits */ |
|
if (op) { |
|
if (bits < op) { |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
} |
|
len += hold & ((1 << op) - 1); |
|
hold >>>= op; |
|
bits -= op; |
|
} |
|
//Tracevv((stderr, "inflate: length %u\n", len)); |
|
if (bits < 15) { |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
} |
|
here = dcode[hold & dmask]; |
|
|
|
dodist: |
|
for (;;) { // goto emulation |
|
op = here >>> 24/*here.bits*/; |
|
hold >>>= op; |
|
bits -= op; |
|
op = (here >>> 16) & 0xff/*here.op*/; |
|
|
|
if (op & 16) { /* distance base */ |
|
dist = here & 0xffff/*here.val*/; |
|
op &= 15; /* number of extra bits */ |
|
if (bits < op) { |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
if (bits < op) { |
|
hold += input[_in++] << bits; |
|
bits += 8; |
|
} |
|
} |
|
dist += hold & ((1 << op) - 1); |
|
//#ifdef INFLATE_STRICT |
|
if (dist > dmax) { |
|
strm.msg = 'invalid distance too far back'; |
|
state.mode = BAD; |
|
break top; |
|
} |
|
//#endif |
|
hold >>>= op; |
|
bits -= op; |
|
//Tracevv((stderr, "inflate: distance %u\n", dist)); |
|
op = _out - beg; /* max distance in output */ |
|
if (dist > op) { /* see if copy from window */ |
|
op = dist - op; /* distance back in window */ |
|
if (op > whave) { |
|
if (state.sane) { |
|
strm.msg = 'invalid distance too far back'; |
|
state.mode = BAD; |
|
break top; |
|
} |
|
|
|
// (!) This block is disabled in zlib defailts, |
|
// don't enable it for binary compatibility |
|
//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR |
|
// if (len <= op - whave) { |
|
// do { |
|
// output[_out++] = 0; |
|
// } while (--len); |
|
// continue top; |
|
// } |
|
// len -= op - whave; |
|
// do { |
|
// output[_out++] = 0; |
|
// } while (--op > whave); |
|
// if (op === 0) { |
|
// from = _out - dist; |
|
// do { |
|
// output[_out++] = output[from++]; |
|
// } while (--len); |
|
// continue top; |
|
// } |
|
//#endif |
|
} |
|
from = 0; // window index |
|
from_source = window; |
|
if (wnext === 0) { /* very common case */ |
|
from += wsize - op; |
|
if (op < len) { /* some from window */ |
|
len -= op; |
|
do { |
|
output[_out++] = window[from++]; |
|
} while (--op); |
|
from = _out - dist; /* rest from output */ |
|
from_source = output; |
|
} |
|
} |
|
else if (wnext < op) { /* wrap around window */ |
|
from += wsize + wnext - op; |
|
op -= wnext; |
|
if (op < len) { /* some from end of window */ |
|
len -= op; |
|
do { |
|
output[_out++] = window[from++]; |
|
} while (--op); |
|
from = 0; |
|
if (wnext < len) { /* some from start of window */ |
|
op = wnext; |
|
len -= op; |
|
do { |
|
output[_out++] = window[from++]; |
|
} while (--op); |
|
from = _out - dist; /* rest from output */ |
|
from_source = output; |
|
} |
|
} |
|
} |
|
else { /* contiguous in window */ |
|
from += wnext - op; |
|
if (op < len) { /* some from window */ |
|
len -= op; |
|
do { |
|
output[_out++] = window[from++]; |
|
} while (--op); |
|
from = _out - dist; /* rest from output */ |
|
from_source = output; |
|
} |
|
} |
|
while (len > 2) { |
|
output[_out++] = from_source[from++]; |
|
output[_out++] = from_source[from++]; |
|
output[_out++] = from_source[from++]; |
|
len -= 3; |
|
} |
|
if (len) { |
|
output[_out++] = from_source[from++]; |
|
if (len > 1) { |
|
output[_out++] = from_source[from++]; |
|
} |
|
} |
|
} |
|
else { |
|
from = _out - dist; /* copy direct from output */ |
|
do { /* minimum length is three */ |
|
output[_out++] = output[from++]; |
|
output[_out++] = output[from++]; |
|
output[_out++] = output[from++]; |
|
len -= 3; |
|
} while (len > 2); |
|
if (len) { |
|
output[_out++] = output[from++]; |
|
if (len > 1) { |
|
output[_out++] = output[from++]; |
|
} |
|
} |
|
} |
|
} |
|
else if ((op & 64) === 0) { /* 2nd level distance code */ |
|
here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; |
|
continue dodist; |
|
} |
|
else { |
|
strm.msg = 'invalid distance code'; |
|
state.mode = BAD; |
|
break top; |
|
} |
|
|
|
break; // need to emulate goto via "continue" |
|
} |
|
} |
|
else if ((op & 64) === 0) { /* 2nd level length code */ |
|
here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; |
|
continue dolen; |
|
} |
|
else if (op & 32) { /* end-of-block */ |
|
//Tracevv((stderr, "inflate: end of block\n")); |
|
state.mode = TYPE; |
|
break top; |
|
} |
|
else { |
|
strm.msg = 'invalid literal/length code'; |
|
state.mode = BAD; |
|
break top; |
|
} |
|
|
|
break; // need to emulate goto via "continue" |
|
} |
|
} while (_in < last && _out < end); |
|
|
|
/* return unused bytes (on entry, bits < 8, so in won't go too far back) */ |
|
len = bits >> 3; |
|
_in -= len; |
|
bits -= len << 3; |
|
hold &= (1 << bits) - 1; |
|
|
|
/* update state and return */ |
|
strm.next_in = _in; |
|
strm.next_out = _out; |
|
strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); |
|
strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); |
|
state.hold = hold; |
|
state.bits = bits; |
|
return; |
|
}; |
|
|
|
},{}],165:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
|
|
var utils = require('../utils/common'); |
|
var adler32 = require('./adler32'); |
|
var crc32 = require('./crc32'); |
|
var inflate_fast = require('./inffast'); |
|
var inflate_table = require('./inftrees'); |
|
|
|
var CODES = 0; |
|
var LENS = 1; |
|
var DISTS = 2; |
|
|
|
/* Public constants ==========================================================*/ |
|
/* ===========================================================================*/ |
|
|
|
|
|
/* Allowed flush values; see deflate() and inflate() below for details */ |
|
//var Z_NO_FLUSH = 0; |
|
//var Z_PARTIAL_FLUSH = 1; |
|
//var Z_SYNC_FLUSH = 2; |
|
//var Z_FULL_FLUSH = 3; |
|
var Z_FINISH = 4; |
|
var Z_BLOCK = 5; |
|
var Z_TREES = 6; |
|
|
|
|
|
/* Return codes for the compression/decompression functions. Negative values |
|
* are errors, positive values are used for special but normal events. |
|
*/ |
|
var Z_OK = 0; |
|
var Z_STREAM_END = 1; |
|
var Z_NEED_DICT = 2; |
|
//var Z_ERRNO = -1; |
|
var Z_STREAM_ERROR = -2; |
|
var Z_DATA_ERROR = -3; |
|
var Z_MEM_ERROR = -4; |
|
var Z_BUF_ERROR = -5; |
|
//var Z_VERSION_ERROR = -6; |
|
|
|
/* The deflate compression method */ |
|
var Z_DEFLATED = 8; |
|
|
|
|
|
/* STATES ====================================================================*/ |
|
/* ===========================================================================*/ |
|
|
|
|
|
var HEAD = 1; /* i: waiting for magic header */ |
|
var FLAGS = 2; /* i: waiting for method and flags (gzip) */ |
|
var TIME = 3; /* i: waiting for modification time (gzip) */ |
|
var OS = 4; /* i: waiting for extra flags and operating system (gzip) */ |
|
var EXLEN = 5; /* i: waiting for extra length (gzip) */ |
|
var EXTRA = 6; /* i: waiting for extra bytes (gzip) */ |
|
var NAME = 7; /* i: waiting for end of file name (gzip) */ |
|
var COMMENT = 8; /* i: waiting for end of comment (gzip) */ |
|
var HCRC = 9; /* i: waiting for header crc (gzip) */ |
|
var DICTID = 10; /* i: waiting for dictionary check value */ |
|
var DICT = 11; /* waiting for inflateSetDictionary() call */ |
|
var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ |
|
var TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */ |
|
var STORED = 14; /* i: waiting for stored size (length and complement) */ |
|
var COPY_ = 15; /* i/o: same as COPY below, but only first time in */ |
|
var COPY = 16; /* i/o: waiting for input or output to copy stored block */ |
|
var TABLE = 17; /* i: waiting for dynamic block table lengths */ |
|
var LENLENS = 18; /* i: waiting for code length code lengths */ |
|
var CODELENS = 19; /* i: waiting for length/lit and distance code lengths */ |
|
var LEN_ = 20; /* i: same as LEN below, but only first time in */ |
|
var LEN = 21; /* i: waiting for length/lit/eob code */ |
|
var LENEXT = 22; /* i: waiting for length extra bits */ |
|
var DIST = 23; /* i: waiting for distance code */ |
|
var DISTEXT = 24; /* i: waiting for distance extra bits */ |
|
var MATCH = 25; /* o: waiting for output space to copy string */ |
|
var LIT = 26; /* o: waiting for output space to write literal */ |
|
var CHECK = 27; /* i: waiting for 32-bit check value */ |
|
var LENGTH = 28; /* i: waiting for 32-bit length (gzip) */ |
|
var DONE = 29; /* finished check, done -- remain here until reset */ |
|
var BAD = 30; /* got a data error -- remain here until reset */ |
|
var MEM = 31; /* got an inflate() memory error -- remain here until reset */ |
|
var SYNC = 32; /* looking for synchronization bytes to restart inflate() */ |
|
|
|
/* ===========================================================================*/ |
|
|
|
|
|
|
|
var ENOUGH_LENS = 852; |
|
var ENOUGH_DISTS = 592; |
|
//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); |
|
|
|
var MAX_WBITS = 15; |
|
/* 32K LZ77 window */ |
|
var DEF_WBITS = MAX_WBITS; |
|
|
|
|
|
function ZSWAP32(q) { |
|
return (((q >>> 24) & 0xff) + |
|
((q >>> 8) & 0xff00) + |
|
((q & 0xff00) << 8) + |
|
((q & 0xff) << 24)); |
|
} |
|
|
|
|
|
function InflateState() { |
|
this.mode = 0; /* current inflate mode */ |
|
this.last = false; /* true if processing last block */ |
|
this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ |
|
this.havedict = false; /* true if dictionary provided */ |
|
this.flags = 0; /* gzip header method and flags (0 if zlib) */ |
|
this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ |
|
this.check = 0; /* protected copy of check value */ |
|
this.total = 0; /* protected copy of output count */ |
|
// TODO: may be {} |
|
this.head = null; /* where to save gzip header information */ |
|
|
|
/* sliding window */ |
|
this.wbits = 0; /* log base 2 of requested window size */ |
|
this.wsize = 0; /* window size or zero if not using window */ |
|
this.whave = 0; /* valid bytes in the window */ |
|
this.wnext = 0; /* window write index */ |
|
this.window = null; /* allocated sliding window, if needed */ |
|
|
|
/* bit accumulator */ |
|
this.hold = 0; /* input bit accumulator */ |
|
this.bits = 0; /* number of bits in "in" */ |
|
|
|
/* for string and stored block copying */ |
|
this.length = 0; /* literal or length of data to copy */ |
|
this.offset = 0; /* distance back to copy string from */ |
|
|
|
/* for table and code decoding */ |
|
this.extra = 0; /* extra bits needed */ |
|
|
|
/* fixed and dynamic code tables */ |
|
this.lencode = null; /* starting table for length/literal codes */ |
|
this.distcode = null; /* starting table for distance codes */ |
|
this.lenbits = 0; /* index bits for lencode */ |
|
this.distbits = 0; /* index bits for distcode */ |
|
|
|
/* dynamic table building */ |
|
this.ncode = 0; /* number of code length code lengths */ |
|
this.nlen = 0; /* number of length code lengths */ |
|
this.ndist = 0; /* number of distance code lengths */ |
|
this.have = 0; /* number of code lengths in lens[] */ |
|
this.next = null; /* next available space in codes[] */ |
|
|
|
this.lens = new utils.Buf16(320); /* temporary storage for code lengths */ |
|
this.work = new utils.Buf16(288); /* work area for code table building */ |
|
|
|
/* |
|
because we don't have pointers in js, we use lencode and distcode directly |
|
as buffers so we don't need codes |
|
*/ |
|
//this.codes = new utils.Buf32(ENOUGH); /* space for code tables */ |
|
this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ |
|
this.distdyn = null; /* dynamic table for distance codes (JS specific) */ |
|
this.sane = 0; /* if false, allow invalid distance too far */ |
|
this.back = 0; /* bits back of last unprocessed length/lit */ |
|
this.was = 0; /* initial length of match */ |
|
} |
|
|
|
function inflateResetKeep(strm) { |
|
var state; |
|
|
|
if (!strm || !strm.state) { return Z_STREAM_ERROR; } |
|
state = strm.state; |
|
strm.total_in = strm.total_out = state.total = 0; |
|
strm.msg = ''; /*Z_NULL*/ |
|
if (state.wrap) { /* to support ill-conceived Java test suite */ |
|
strm.adler = state.wrap & 1; |
|
} |
|
state.mode = HEAD; |
|
state.last = 0; |
|
state.havedict = 0; |
|
state.dmax = 32768; |
|
state.head = null/*Z_NULL*/; |
|
state.hold = 0; |
|
state.bits = 0; |
|
//state.lencode = state.distcode = state.next = state.codes; |
|
state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS); |
|
state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS); |
|
|
|
state.sane = 1; |
|
state.back = -1; |
|
//Tracev((stderr, "inflate: reset\n")); |
|
return Z_OK; |
|
} |
|
|
|
function inflateReset(strm) { |
|
var state; |
|
|
|
if (!strm || !strm.state) { return Z_STREAM_ERROR; } |
|
state = strm.state; |
|
state.wsize = 0; |
|
state.whave = 0; |
|
state.wnext = 0; |
|
return inflateResetKeep(strm); |
|
|
|
} |
|
|
|
function inflateReset2(strm, windowBits) { |
|
var wrap; |
|
var state; |
|
|
|
/* get the state */ |
|
if (!strm || !strm.state) { return Z_STREAM_ERROR; } |
|
state = strm.state; |
|
|
|
/* extract wrap request from windowBits parameter */ |
|
if (windowBits < 0) { |
|
wrap = 0; |
|
windowBits = -windowBits; |
|
} |
|
else { |
|
wrap = (windowBits >> 4) + 1; |
|
if (windowBits < 48) { |
|
windowBits &= 15; |
|
} |
|
} |
|
|
|
/* set number of window bits, free window if different */ |
|
if (windowBits && (windowBits < 8 || windowBits > 15)) { |
|
return Z_STREAM_ERROR; |
|
} |
|
if (state.window !== null && state.wbits !== windowBits) { |
|
state.window = null; |
|
} |
|
|
|
/* update state and reset the rest of it */ |
|
state.wrap = wrap; |
|
state.wbits = windowBits; |
|
return inflateReset(strm); |
|
} |
|
|
|
function inflateInit2(strm, windowBits) { |
|
var ret; |
|
var state; |
|
|
|
if (!strm) { return Z_STREAM_ERROR; } |
|
//strm.msg = Z_NULL; /* in case we return an error */ |
|
|
|
state = new InflateState(); |
|
|
|
//if (state === Z_NULL) return Z_MEM_ERROR; |
|
//Tracev((stderr, "inflate: allocated\n")); |
|
strm.state = state; |
|
state.window = null/*Z_NULL*/; |
|
ret = inflateReset2(strm, windowBits); |
|
if (ret !== Z_OK) { |
|
strm.state = null/*Z_NULL*/; |
|
} |
|
return ret; |
|
} |
|
|
|
function inflateInit(strm) { |
|
return inflateInit2(strm, DEF_WBITS); |
|
} |
|
|
|
|
|
/* |
|
Return state with length and distance decoding tables and index sizes set to |
|
fixed code decoding. Normally this returns fixed tables from inffixed.h. |
|
If BUILDFIXED is defined, then instead this routine builds the tables the |
|
first time it's called, and returns those tables the first time and |
|
thereafter. This reduces the size of the code by about 2K bytes, in |
|
exchange for a little execution time. However, BUILDFIXED should not be |
|
used for threaded applications, since the rewriting of the tables and virgin |
|
may not be thread-safe. |
|
*/ |
|
var virgin = true; |
|
|
|
var lenfix, distfix; // We have no pointers in JS, so keep tables separate |
|
|
|
function fixedtables(state) { |
|
/* build fixed huffman tables if first call (may not be thread safe) */ |
|
if (virgin) { |
|
var sym; |
|
|
|
lenfix = new utils.Buf32(512); |
|
distfix = new utils.Buf32(32); |
|
|
|
/* literal/length table */ |
|
sym = 0; |
|
while (sym < 144) { state.lens[sym++] = 8; } |
|
while (sym < 256) { state.lens[sym++] = 9; } |
|
while (sym < 280) { state.lens[sym++] = 7; } |
|
while (sym < 288) { state.lens[sym++] = 8; } |
|
|
|
inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, {bits: 9}); |
|
|
|
/* distance table */ |
|
sym = 0; |
|
while (sym < 32) { state.lens[sym++] = 5; } |
|
|
|
inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, {bits: 5}); |
|
|
|
/* do this just once */ |
|
virgin = false; |
|
} |
|
|
|
state.lencode = lenfix; |
|
state.lenbits = 9; |
|
state.distcode = distfix; |
|
state.distbits = 5; |
|
} |
|
|
|
|
|
/* |
|
Update the window with the last wsize (normally 32K) bytes written before |
|
returning. If window does not exist yet, create it. This is only called |
|
when a window is already in use, or when output has been written during this |
|
inflate call, but the end of the deflate stream has not been reached yet. |
|
It is also called to create a window for dictionary data when a dictionary |
|
is loaded. |
|
|
|
Providing output buffers larger than 32K to inflate() should provide a speed |
|
advantage, since only the last 32K of output is copied to the sliding window |
|
upon return from inflate(), and since all distances after the first 32K of |
|
output will fall in the output data, making match copies simpler and faster. |
|
The advantage may be dependent on the size of the processor's data caches. |
|
*/ |
|
function updatewindow(strm, src, end, copy) { |
|
var dist; |
|
var state = strm.state; |
|
|
|
/* if it hasn't been done already, allocate space for the window */ |
|
if (state.window === null) { |
|
state.wsize = 1 << state.wbits; |
|
state.wnext = 0; |
|
state.whave = 0; |
|
|
|
state.window = new utils.Buf8(state.wsize); |
|
} |
|
|
|
/* copy state->wsize or less output bytes into the circular window */ |
|
if (copy >= state.wsize) { |
|
utils.arraySet(state.window,src, end - state.wsize, state.wsize, 0); |
|
state.wnext = 0; |
|
state.whave = state.wsize; |
|
} |
|
else { |
|
dist = state.wsize - state.wnext; |
|
if (dist > copy) { |
|
dist = copy; |
|
} |
|
//zmemcpy(state->window + state->wnext, end - copy, dist); |
|
utils.arraySet(state.window,src, end - copy, dist, state.wnext); |
|
copy -= dist; |
|
if (copy) { |
|
//zmemcpy(state->window, end - copy, copy); |
|
utils.arraySet(state.window,src, end - copy, copy, 0); |
|
state.wnext = copy; |
|
state.whave = state.wsize; |
|
} |
|
else { |
|
state.wnext += dist; |
|
if (state.wnext === state.wsize) { state.wnext = 0; } |
|
if (state.whave < state.wsize) { state.whave += dist; } |
|
} |
|
} |
|
return 0; |
|
} |
|
|
|
function inflate(strm, flush) { |
|
var state; |
|
var input, output; // input/output buffers |
|
var next; /* next input INDEX */ |
|
var put; /* next output INDEX */ |
|
var have, left; /* available input and output */ |
|
var hold; /* bit buffer */ |
|
var bits; /* bits in bit buffer */ |
|
var _in, _out; /* save starting available input and output */ |
|
var copy; /* number of stored or match bytes to copy */ |
|
var from; /* where to copy match bytes from */ |
|
var from_source; |
|
var here = 0; /* current decoding table entry */ |
|
var here_bits, here_op, here_val; // paked "here" denormalized (JS specific) |
|
//var last; /* parent table entry */ |
|
var last_bits, last_op, last_val; // paked "last" denormalized (JS specific) |
|
var len; /* length to copy for repeats, bits to drop */ |
|
var ret; /* return code */ |
|
var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */ |
|
var opts; |
|
|
|
var n; // temporary var for NEED_BITS |
|
|
|
var order = /* permutation of code lengths */ |
|
[16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]; |
|
|
|
|
|
if (!strm || !strm.state || !strm.output || |
|
(!strm.input && strm.avail_in !== 0)) { |
|
return Z_STREAM_ERROR; |
|
} |
|
|
|
state = strm.state; |
|
if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ |
|
|
|
|
|
//--- LOAD() --- |
|
put = strm.next_out; |
|
output = strm.output; |
|
left = strm.avail_out; |
|
next = strm.next_in; |
|
input = strm.input; |
|
have = strm.avail_in; |
|
hold = state.hold; |
|
bits = state.bits; |
|
//--- |
|
|
|
_in = have; |
|
_out = left; |
|
ret = Z_OK; |
|
|
|
inf_leave: // goto emulation |
|
for (;;) { |
|
switch (state.mode) { |
|
case HEAD: |
|
if (state.wrap === 0) { |
|
state.mode = TYPEDO; |
|
break; |
|
} |
|
//=== NEEDBITS(16); |
|
while (bits < 16) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ |
|
state.check = 0/*crc32(0L, Z_NULL, 0)*/; |
|
//=== CRC2(state.check, hold); |
|
hbuf[0] = hold & 0xff; |
|
hbuf[1] = (hold >>> 8) & 0xff; |
|
state.check = crc32(state.check, hbuf, 2, 0); |
|
//===// |
|
|
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
state.mode = FLAGS; |
|
break; |
|
} |
|
state.flags = 0; /* expect zlib header */ |
|
if (state.head) { |
|
state.head.done = false; |
|
} |
|
if (!(state.wrap & 1) || /* check if zlib header allowed */ |
|
(((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { |
|
strm.msg = 'incorrect header check'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { |
|
strm.msg = 'unknown compression method'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//--- DROPBITS(4) ---// |
|
hold >>>= 4; |
|
bits -= 4; |
|
//---// |
|
len = (hold & 0x0f)/*BITS(4)*/ + 8; |
|
if (state.wbits === 0) { |
|
state.wbits = len; |
|
} |
|
else if (len > state.wbits) { |
|
strm.msg = 'invalid window size'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
state.dmax = 1 << len; |
|
//Tracev((stderr, "inflate: zlib header ok\n")); |
|
strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; |
|
state.mode = hold & 0x200 ? DICTID : TYPE; |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
break; |
|
case FLAGS: |
|
//=== NEEDBITS(16); */ |
|
while (bits < 16) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.flags = hold; |
|
if ((state.flags & 0xff) !== Z_DEFLATED) { |
|
strm.msg = 'unknown compression method'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
if (state.flags & 0xe000) { |
|
strm.msg = 'unknown header flags set'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
if (state.head) { |
|
state.head.text = ((hold >> 8) & 1); |
|
} |
|
if (state.flags & 0x0200) { |
|
//=== CRC2(state.check, hold); |
|
hbuf[0] = hold & 0xff; |
|
hbuf[1] = (hold >>> 8) & 0xff; |
|
state.check = crc32(state.check, hbuf, 2, 0); |
|
//===// |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
state.mode = TIME; |
|
/* falls through */ |
|
case TIME: |
|
//=== NEEDBITS(32); */ |
|
while (bits < 32) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
if (state.head) { |
|
state.head.time = hold; |
|
} |
|
if (state.flags & 0x0200) { |
|
//=== CRC4(state.check, hold) |
|
hbuf[0] = hold & 0xff; |
|
hbuf[1] = (hold >>> 8) & 0xff; |
|
hbuf[2] = (hold >>> 16) & 0xff; |
|
hbuf[3] = (hold >>> 24) & 0xff; |
|
state.check = crc32(state.check, hbuf, 4, 0); |
|
//=== |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
state.mode = OS; |
|
/* falls through */ |
|
case OS: |
|
//=== NEEDBITS(16); */ |
|
while (bits < 16) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
if (state.head) { |
|
state.head.xflags = (hold & 0xff); |
|
state.head.os = (hold >> 8); |
|
} |
|
if (state.flags & 0x0200) { |
|
//=== CRC2(state.check, hold); |
|
hbuf[0] = hold & 0xff; |
|
hbuf[1] = (hold >>> 8) & 0xff; |
|
state.check = crc32(state.check, hbuf, 2, 0); |
|
//===// |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
state.mode = EXLEN; |
|
/* falls through */ |
|
case EXLEN: |
|
if (state.flags & 0x0400) { |
|
//=== NEEDBITS(16); */ |
|
while (bits < 16) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.length = hold; |
|
if (state.head) { |
|
state.head.extra_len = hold; |
|
} |
|
if (state.flags & 0x0200) { |
|
//=== CRC2(state.check, hold); |
|
hbuf[0] = hold & 0xff; |
|
hbuf[1] = (hold >>> 8) & 0xff; |
|
state.check = crc32(state.check, hbuf, 2, 0); |
|
//===// |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
} |
|
else if (state.head) { |
|
state.head.extra = null/*Z_NULL*/; |
|
} |
|
state.mode = EXTRA; |
|
/* falls through */ |
|
case EXTRA: |
|
if (state.flags & 0x0400) { |
|
copy = state.length; |
|
if (copy > have) { copy = have; } |
|
if (copy) { |
|
if (state.head) { |
|
len = state.head.extra_len - state.length; |
|
if (!state.head.extra) { |
|
// Use untyped array for more conveniend processing later |
|
state.head.extra = new Array(state.head.extra_len); |
|
} |
|
utils.arraySet( |
|
state.head.extra, |
|
input, |
|
next, |
|
// extra field is limited to 65536 bytes |
|
// - no need for additional size check |
|
copy, |
|
/*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ |
|
len |
|
); |
|
//zmemcpy(state.head.extra + len, next, |
|
// len + copy > state.head.extra_max ? |
|
// state.head.extra_max - len : copy); |
|
} |
|
if (state.flags & 0x0200) { |
|
state.check = crc32(state.check, input, copy, next); |
|
} |
|
have -= copy; |
|
next += copy; |
|
state.length -= copy; |
|
} |
|
if (state.length) { break inf_leave; } |
|
} |
|
state.length = 0; |
|
state.mode = NAME; |
|
/* falls through */ |
|
case NAME: |
|
if (state.flags & 0x0800) { |
|
if (have === 0) { break inf_leave; } |
|
copy = 0; |
|
do { |
|
// TODO: 2 or 1 bytes? |
|
len = input[next + copy++]; |
|
/* use constant limit because in js we should not preallocate memory */ |
|
if (state.head && len && |
|
(state.length < 65536 /*state.head.name_max*/)) { |
|
state.head.name += String.fromCharCode(len); |
|
} |
|
} while (len && copy < have); |
|
|
|
if (state.flags & 0x0200) { |
|
state.check = crc32(state.check, input, copy, next); |
|
} |
|
have -= copy; |
|
next += copy; |
|
if (len) { break inf_leave; } |
|
} |
|
else if (state.head) { |
|
state.head.name = null; |
|
} |
|
state.length = 0; |
|
state.mode = COMMENT; |
|
/* falls through */ |
|
case COMMENT: |
|
if (state.flags & 0x1000) { |
|
if (have === 0) { break inf_leave; } |
|
copy = 0; |
|
do { |
|
len = input[next + copy++]; |
|
/* use constant limit because in js we should not preallocate memory */ |
|
if (state.head && len && |
|
(state.length < 65536 /*state.head.comm_max*/)) { |
|
state.head.comment += String.fromCharCode(len); |
|
} |
|
} while (len && copy < have); |
|
if (state.flags & 0x0200) { |
|
state.check = crc32(state.check, input, copy, next); |
|
} |
|
have -= copy; |
|
next += copy; |
|
if (len) { break inf_leave; } |
|
} |
|
else if (state.head) { |
|
state.head.comment = null; |
|
} |
|
state.mode = HCRC; |
|
/* falls through */ |
|
case HCRC: |
|
if (state.flags & 0x0200) { |
|
//=== NEEDBITS(16); */ |
|
while (bits < 16) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
if (hold !== (state.check & 0xffff)) { |
|
strm.msg = 'header crc mismatch'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
} |
|
if (state.head) { |
|
state.head.hcrc = ((state.flags >> 9) & 1); |
|
state.head.done = true; |
|
} |
|
strm.adler = state.check = 0 /*crc32(0L, Z_NULL, 0)*/; |
|
state.mode = TYPE; |
|
break; |
|
case DICTID: |
|
//=== NEEDBITS(32); */ |
|
while (bits < 32) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
strm.adler = state.check = ZSWAP32(hold); |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
state.mode = DICT; |
|
/* falls through */ |
|
case DICT: |
|
if (state.havedict === 0) { |
|
//--- RESTORE() --- |
|
strm.next_out = put; |
|
strm.avail_out = left; |
|
strm.next_in = next; |
|
strm.avail_in = have; |
|
state.hold = hold; |
|
state.bits = bits; |
|
//--- |
|
return Z_NEED_DICT; |
|
} |
|
strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; |
|
state.mode = TYPE; |
|
/* falls through */ |
|
case TYPE: |
|
if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } |
|
/* falls through */ |
|
case TYPEDO: |
|
if (state.last) { |
|
//--- BYTEBITS() ---// |
|
hold >>>= bits & 7; |
|
bits -= bits & 7; |
|
//---// |
|
state.mode = CHECK; |
|
break; |
|
} |
|
//=== NEEDBITS(3); */ |
|
while (bits < 3) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.last = (hold & 0x01)/*BITS(1)*/; |
|
//--- DROPBITS(1) ---// |
|
hold >>>= 1; |
|
bits -= 1; |
|
//---// |
|
|
|
switch ((hold & 0x03)/*BITS(2)*/) { |
|
case 0: /* stored block */ |
|
//Tracev((stderr, "inflate: stored block%s\n", |
|
// state.last ? " (last)" : "")); |
|
state.mode = STORED; |
|
break; |
|
case 1: /* fixed block */ |
|
fixedtables(state); |
|
//Tracev((stderr, "inflate: fixed codes block%s\n", |
|
// state.last ? " (last)" : "")); |
|
state.mode = LEN_; /* decode codes */ |
|
if (flush === Z_TREES) { |
|
//--- DROPBITS(2) ---// |
|
hold >>>= 2; |
|
bits -= 2; |
|
//---// |
|
break inf_leave; |
|
} |
|
break; |
|
case 2: /* dynamic block */ |
|
//Tracev((stderr, "inflate: dynamic codes block%s\n", |
|
// state.last ? " (last)" : "")); |
|
state.mode = TABLE; |
|
break; |
|
case 3: |
|
strm.msg = 'invalid block type'; |
|
state.mode = BAD; |
|
} |
|
//--- DROPBITS(2) ---// |
|
hold >>>= 2; |
|
bits -= 2; |
|
//---// |
|
break; |
|
case STORED: |
|
//--- BYTEBITS() ---// /* go to byte boundary */ |
|
hold >>>= bits & 7; |
|
bits -= bits & 7; |
|
//---// |
|
//=== NEEDBITS(32); */ |
|
while (bits < 32) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { |
|
strm.msg = 'invalid stored block lengths'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
state.length = hold & 0xffff; |
|
//Tracev((stderr, "inflate: stored length %u\n", |
|
// state.length)); |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
state.mode = COPY_; |
|
if (flush === Z_TREES) { break inf_leave; } |
|
/* falls through */ |
|
case COPY_: |
|
state.mode = COPY; |
|
/* falls through */ |
|
case COPY: |
|
copy = state.length; |
|
if (copy) { |
|
if (copy > have) { copy = have; } |
|
if (copy > left) { copy = left; } |
|
if (copy === 0) { break inf_leave; } |
|
//--- zmemcpy(put, next, copy); --- |
|
utils.arraySet(output, input, next, copy, put); |
|
//---// |
|
have -= copy; |
|
next += copy; |
|
left -= copy; |
|
put += copy; |
|
state.length -= copy; |
|
break; |
|
} |
|
//Tracev((stderr, "inflate: stored end\n")); |
|
state.mode = TYPE; |
|
break; |
|
case TABLE: |
|
//=== NEEDBITS(14); */ |
|
while (bits < 14) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; |
|
//--- DROPBITS(5) ---// |
|
hold >>>= 5; |
|
bits -= 5; |
|
//---// |
|
state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; |
|
//--- DROPBITS(5) ---// |
|
hold >>>= 5; |
|
bits -= 5; |
|
//---// |
|
state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; |
|
//--- DROPBITS(4) ---// |
|
hold >>>= 4; |
|
bits -= 4; |
|
//---// |
|
//#ifndef PKZIP_BUG_WORKAROUND |
|
if (state.nlen > 286 || state.ndist > 30) { |
|
strm.msg = 'too many length or distance symbols'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//#endif |
|
//Tracev((stderr, "inflate: table sizes ok\n")); |
|
state.have = 0; |
|
state.mode = LENLENS; |
|
/* falls through */ |
|
case LENLENS: |
|
while (state.have < state.ncode) { |
|
//=== NEEDBITS(3); |
|
while (bits < 3) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); |
|
//--- DROPBITS(3) ---// |
|
hold >>>= 3; |
|
bits -= 3; |
|
//---// |
|
} |
|
while (state.have < 19) { |
|
state.lens[order[state.have++]] = 0; |
|
} |
|
// We have separate tables & no pointers. 2 commented lines below not needed. |
|
//state.next = state.codes; |
|
//state.lencode = state.next; |
|
// Switch to use dynamic table |
|
state.lencode = state.lendyn; |
|
state.lenbits = 7; |
|
|
|
opts = {bits: state.lenbits}; |
|
ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); |
|
state.lenbits = opts.bits; |
|
|
|
if (ret) { |
|
strm.msg = 'invalid code lengths set'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//Tracev((stderr, "inflate: code lengths ok\n")); |
|
state.have = 0; |
|
state.mode = CODELENS; |
|
/* falls through */ |
|
case CODELENS: |
|
while (state.have < state.nlen + state.ndist) { |
|
for (;;) { |
|
here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ |
|
here_bits = here >>> 24; |
|
here_op = (here >>> 16) & 0xff; |
|
here_val = here & 0xffff; |
|
|
|
if ((here_bits) <= bits) { break; } |
|
//--- PULLBYTE() ---// |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
//---// |
|
} |
|
if (here_val < 16) { |
|
//--- DROPBITS(here.bits) ---// |
|
hold >>>= here_bits; |
|
bits -= here_bits; |
|
//---// |
|
state.lens[state.have++] = here_val; |
|
} |
|
else { |
|
if (here_val === 16) { |
|
//=== NEEDBITS(here.bits + 2); |
|
n = here_bits + 2; |
|
while (bits < n) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
//--- DROPBITS(here.bits) ---// |
|
hold >>>= here_bits; |
|
bits -= here_bits; |
|
//---// |
|
if (state.have === 0) { |
|
strm.msg = 'invalid bit length repeat'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
len = state.lens[state.have - 1]; |
|
copy = 3 + (hold & 0x03);//BITS(2); |
|
//--- DROPBITS(2) ---// |
|
hold >>>= 2; |
|
bits -= 2; |
|
//---// |
|
} |
|
else if (here_val === 17) { |
|
//=== NEEDBITS(here.bits + 3); |
|
n = here_bits + 3; |
|
while (bits < n) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
//--- DROPBITS(here.bits) ---// |
|
hold >>>= here_bits; |
|
bits -= here_bits; |
|
//---// |
|
len = 0; |
|
copy = 3 + (hold & 0x07);//BITS(3); |
|
//--- DROPBITS(3) ---// |
|
hold >>>= 3; |
|
bits -= 3; |
|
//---// |
|
} |
|
else { |
|
//=== NEEDBITS(here.bits + 7); |
|
n = here_bits + 7; |
|
while (bits < n) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
//--- DROPBITS(here.bits) ---// |
|
hold >>>= here_bits; |
|
bits -= here_bits; |
|
//---// |
|
len = 0; |
|
copy = 11 + (hold & 0x7f);//BITS(7); |
|
//--- DROPBITS(7) ---// |
|
hold >>>= 7; |
|
bits -= 7; |
|
//---// |
|
} |
|
if (state.have + copy > state.nlen + state.ndist) { |
|
strm.msg = 'invalid bit length repeat'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
while (copy--) { |
|
state.lens[state.have++] = len; |
|
} |
|
} |
|
} |
|
|
|
/* handle error breaks in while */ |
|
if (state.mode === BAD) { break; } |
|
|
|
/* check for end-of-block code (better have one) */ |
|
if (state.lens[256] === 0) { |
|
strm.msg = 'invalid code -- missing end-of-block'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
|
|
/* build code tables -- note: do not change the lenbits or distbits |
|
values here (9 and 6) without reading the comments in inftrees.h |
|
concerning the ENOUGH constants, which depend on those values */ |
|
state.lenbits = 9; |
|
|
|
opts = {bits: state.lenbits}; |
|
ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); |
|
// We have separate tables & no pointers. 2 commented lines below not needed. |
|
// state.next_index = opts.table_index; |
|
state.lenbits = opts.bits; |
|
// state.lencode = state.next; |
|
|
|
if (ret) { |
|
strm.msg = 'invalid literal/lengths set'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
|
|
state.distbits = 6; |
|
//state.distcode.copy(state.codes); |
|
// Switch to use dynamic table |
|
state.distcode = state.distdyn; |
|
opts = {bits: state.distbits}; |
|
ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); |
|
// We have separate tables & no pointers. 2 commented lines below not needed. |
|
// state.next_index = opts.table_index; |
|
state.distbits = opts.bits; |
|
// state.distcode = state.next; |
|
|
|
if (ret) { |
|
strm.msg = 'invalid distances set'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//Tracev((stderr, 'inflate: codes ok\n')); |
|
state.mode = LEN_; |
|
if (flush === Z_TREES) { break inf_leave; } |
|
/* falls through */ |
|
case LEN_: |
|
state.mode = LEN; |
|
/* falls through */ |
|
case LEN: |
|
if (have >= 6 && left >= 258) { |
|
//--- RESTORE() --- |
|
strm.next_out = put; |
|
strm.avail_out = left; |
|
strm.next_in = next; |
|
strm.avail_in = have; |
|
state.hold = hold; |
|
state.bits = bits; |
|
//--- |
|
inflate_fast(strm, _out); |
|
//--- LOAD() --- |
|
put = strm.next_out; |
|
output = strm.output; |
|
left = strm.avail_out; |
|
next = strm.next_in; |
|
input = strm.input; |
|
have = strm.avail_in; |
|
hold = state.hold; |
|
bits = state.bits; |
|
//--- |
|
|
|
if (state.mode === TYPE) { |
|
state.back = -1; |
|
} |
|
break; |
|
} |
|
state.back = 0; |
|
for (;;) { |
|
here = state.lencode[hold & ((1 << state.lenbits) -1)]; /*BITS(state.lenbits)*/ |
|
here_bits = here >>> 24; |
|
here_op = (here >>> 16) & 0xff; |
|
here_val = here & 0xffff; |
|
|
|
if (here_bits <= bits) { break; } |
|
//--- PULLBYTE() ---// |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
//---// |
|
} |
|
if (here_op && (here_op & 0xf0) === 0) { |
|
last_bits = here_bits; |
|
last_op = here_op; |
|
last_val = here_val; |
|
for (;;) { |
|
here = state.lencode[last_val + |
|
((hold & ((1 << (last_bits + last_op)) -1))/*BITS(last.bits + last.op)*/ >> last_bits)]; |
|
here_bits = here >>> 24; |
|
here_op = (here >>> 16) & 0xff; |
|
here_val = here & 0xffff; |
|
|
|
if ((last_bits + here_bits) <= bits) { break; } |
|
//--- PULLBYTE() ---// |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
//---// |
|
} |
|
//--- DROPBITS(last.bits) ---// |
|
hold >>>= last_bits; |
|
bits -= last_bits; |
|
//---// |
|
state.back += last_bits; |
|
} |
|
//--- DROPBITS(here.bits) ---// |
|
hold >>>= here_bits; |
|
bits -= here_bits; |
|
//---// |
|
state.back += here_bits; |
|
state.length = here_val; |
|
if (here_op === 0) { |
|
//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? |
|
// "inflate: literal '%c'\n" : |
|
// "inflate: literal 0x%02x\n", here.val)); |
|
state.mode = LIT; |
|
break; |
|
} |
|
if (here_op & 32) { |
|
//Tracevv((stderr, "inflate: end of block\n")); |
|
state.back = -1; |
|
state.mode = TYPE; |
|
break; |
|
} |
|
if (here_op & 64) { |
|
strm.msg = 'invalid literal/length code'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
state.extra = here_op & 15; |
|
state.mode = LENEXT; |
|
/* falls through */ |
|
case LENEXT: |
|
if (state.extra) { |
|
//=== NEEDBITS(state.extra); |
|
n = state.extra; |
|
while (bits < n) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.length += hold & ((1 << state.extra) -1)/*BITS(state.extra)*/; |
|
//--- DROPBITS(state.extra) ---// |
|
hold >>>= state.extra; |
|
bits -= state.extra; |
|
//---// |
|
state.back += state.extra; |
|
} |
|
//Tracevv((stderr, "inflate: length %u\n", state.length)); |
|
state.was = state.length; |
|
state.mode = DIST; |
|
/* falls through */ |
|
case DIST: |
|
for (;;) { |
|
here = state.distcode[hold & ((1 << state.distbits) -1)];/*BITS(state.distbits)*/ |
|
here_bits = here >>> 24; |
|
here_op = (here >>> 16) & 0xff; |
|
here_val = here & 0xffff; |
|
|
|
if ((here_bits) <= bits) { break; } |
|
//--- PULLBYTE() ---// |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
//---// |
|
} |
|
if ((here_op & 0xf0) === 0) { |
|
last_bits = here_bits; |
|
last_op = here_op; |
|
last_val = here_val; |
|
for (;;) { |
|
here = state.distcode[last_val + |
|
((hold & ((1 << (last_bits + last_op)) -1))/*BITS(last.bits + last.op)*/ >> last_bits)]; |
|
here_bits = here >>> 24; |
|
here_op = (here >>> 16) & 0xff; |
|
here_val = here & 0xffff; |
|
|
|
if ((last_bits + here_bits) <= bits) { break; } |
|
//--- PULLBYTE() ---// |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
//---// |
|
} |
|
//--- DROPBITS(last.bits) ---// |
|
hold >>>= last_bits; |
|
bits -= last_bits; |
|
//---// |
|
state.back += last_bits; |
|
} |
|
//--- DROPBITS(here.bits) ---// |
|
hold >>>= here_bits; |
|
bits -= here_bits; |
|
//---// |
|
state.back += here_bits; |
|
if (here_op & 64) { |
|
strm.msg = 'invalid distance code'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
state.offset = here_val; |
|
state.extra = (here_op) & 15; |
|
state.mode = DISTEXT; |
|
/* falls through */ |
|
case DISTEXT: |
|
if (state.extra) { |
|
//=== NEEDBITS(state.extra); |
|
n = state.extra; |
|
while (bits < n) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
state.offset += hold & ((1 << state.extra) -1)/*BITS(state.extra)*/; |
|
//--- DROPBITS(state.extra) ---// |
|
hold >>>= state.extra; |
|
bits -= state.extra; |
|
//---// |
|
state.back += state.extra; |
|
} |
|
//#ifdef INFLATE_STRICT |
|
if (state.offset > state.dmax) { |
|
strm.msg = 'invalid distance too far back'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//#endif |
|
//Tracevv((stderr, "inflate: distance %u\n", state.offset)); |
|
state.mode = MATCH; |
|
/* falls through */ |
|
case MATCH: |
|
if (left === 0) { break inf_leave; } |
|
copy = _out - left; |
|
if (state.offset > copy) { /* copy from window */ |
|
copy = state.offset - copy; |
|
if (copy > state.whave) { |
|
if (state.sane) { |
|
strm.msg = 'invalid distance too far back'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
// (!) This block is disabled in zlib defailts, |
|
// don't enable it for binary compatibility |
|
//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR |
|
// Trace((stderr, "inflate.c too far\n")); |
|
// copy -= state.whave; |
|
// if (copy > state.length) { copy = state.length; } |
|
// if (copy > left) { copy = left; } |
|
// left -= copy; |
|
// state.length -= copy; |
|
// do { |
|
// output[put++] = 0; |
|
// } while (--copy); |
|
// if (state.length === 0) { state.mode = LEN; } |
|
// break; |
|
//#endif |
|
} |
|
if (copy > state.wnext) { |
|
copy -= state.wnext; |
|
from = state.wsize - copy; |
|
} |
|
else { |
|
from = state.wnext - copy; |
|
} |
|
if (copy > state.length) { copy = state.length; } |
|
from_source = state.window; |
|
} |
|
else { /* copy from output */ |
|
from_source = output; |
|
from = put - state.offset; |
|
copy = state.length; |
|
} |
|
if (copy > left) { copy = left; } |
|
left -= copy; |
|
state.length -= copy; |
|
do { |
|
output[put++] = from_source[from++]; |
|
} while (--copy); |
|
if (state.length === 0) { state.mode = LEN; } |
|
break; |
|
case LIT: |
|
if (left === 0) { break inf_leave; } |
|
output[put++] = state.length; |
|
left--; |
|
state.mode = LEN; |
|
break; |
|
case CHECK: |
|
if (state.wrap) { |
|
//=== NEEDBITS(32); |
|
while (bits < 32) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
// Use '|' insdead of '+' to make sure that result is signed |
|
hold |= input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
_out -= left; |
|
strm.total_out += _out; |
|
state.total += _out; |
|
if (_out) { |
|
strm.adler = state.check = |
|
/*UPDATE(state.check, put - _out, _out);*/ |
|
(state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out)); |
|
|
|
} |
|
_out = left; |
|
// NB: crc32 stored as signed 32-bit int, ZSWAP32 returns signed too |
|
if ((state.flags ? hold : ZSWAP32(hold)) !== state.check) { |
|
strm.msg = 'incorrect data check'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
//Tracev((stderr, "inflate: check matches trailer\n")); |
|
} |
|
state.mode = LENGTH; |
|
/* falls through */ |
|
case LENGTH: |
|
if (state.wrap && state.flags) { |
|
//=== NEEDBITS(32); |
|
while (bits < 32) { |
|
if (have === 0) { break inf_leave; } |
|
have--; |
|
hold += input[next++] << bits; |
|
bits += 8; |
|
} |
|
//===// |
|
if (hold !== (state.total & 0xffffffff)) { |
|
strm.msg = 'incorrect length check'; |
|
state.mode = BAD; |
|
break; |
|
} |
|
//=== INITBITS(); |
|
hold = 0; |
|
bits = 0; |
|
//===// |
|
//Tracev((stderr, "inflate: length matches trailer\n")); |
|
} |
|
state.mode = DONE; |
|
/* falls through */ |
|
case DONE: |
|
ret = Z_STREAM_END; |
|
break inf_leave; |
|
case BAD: |
|
ret = Z_DATA_ERROR; |
|
break inf_leave; |
|
case MEM: |
|
return Z_MEM_ERROR; |
|
case SYNC: |
|
/* falls through */ |
|
default: |
|
return Z_STREAM_ERROR; |
|
} |
|
} |
|
|
|
// inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" |
|
|
|
/* |
|
Return from inflate(), updating the total counts and the check value. |
|
If there was no progress during the inflate() call, return a buffer |
|
error. Call updatewindow() to create and/or update the window state. |
|
Note: a memory error from inflate() is non-recoverable. |
|
*/ |
|
|
|
//--- RESTORE() --- |
|
strm.next_out = put; |
|
strm.avail_out = left; |
|
strm.next_in = next; |
|
strm.avail_in = have; |
|
state.hold = hold; |
|
state.bits = bits; |
|
//--- |
|
|
|
if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && |
|
(state.mode < CHECK || flush !== Z_FINISH))) { |
|
if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) { |
|
state.mode = MEM; |
|
return Z_MEM_ERROR; |
|
} |
|
} |
|
_in -= strm.avail_in; |
|
_out -= strm.avail_out; |
|
strm.total_in += _in; |
|
strm.total_out += _out; |
|
state.total += _out; |
|
if (state.wrap && _out) { |
|
strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/ |
|
(state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out)); |
|
} |
|
strm.data_type = state.bits + (state.last ? 64 : 0) + |
|
(state.mode === TYPE ? 128 : 0) + |
|
(state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); |
|
if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) { |
|
ret = Z_BUF_ERROR; |
|
} |
|
return ret; |
|
} |
|
|
|
function inflateEnd(strm) { |
|
|
|
if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) { |
|
return Z_STREAM_ERROR; |
|
} |
|
|
|
var state = strm.state; |
|
if (state.window) { |
|
state.window = null; |
|
} |
|
strm.state = null; |
|
return Z_OK; |
|
} |
|
|
|
function inflateGetHeader(strm, head) { |
|
var state; |
|
|
|
/* check state */ |
|
if (!strm || !strm.state) { return Z_STREAM_ERROR; } |
|
state = strm.state; |
|
if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; } |
|
|
|
/* save header structure */ |
|
state.head = head; |
|
head.done = false; |
|
return Z_OK; |
|
} |
|
|
|
|
|
exports.inflateReset = inflateReset; |
|
exports.inflateReset2 = inflateReset2; |
|
exports.inflateResetKeep = inflateResetKeep; |
|
exports.inflateInit = inflateInit; |
|
exports.inflateInit2 = inflateInit2; |
|
exports.inflate = inflate; |
|
exports.inflateEnd = inflateEnd; |
|
exports.inflateGetHeader = inflateGetHeader; |
|
exports.inflateInfo = 'pako inflate (from Nodeca project)'; |
|
|
|
/* Not implemented |
|
exports.inflateCopy = inflateCopy; |
|
exports.inflateGetDictionary = inflateGetDictionary; |
|
exports.inflateMark = inflateMark; |
|
exports.inflatePrime = inflatePrime; |
|
exports.inflateSetDictionary = inflateSetDictionary; |
|
exports.inflateSync = inflateSync; |
|
exports.inflateSyncPoint = inflateSyncPoint; |
|
exports.inflateUndermine = inflateUndermine; |
|
*/ |
|
},{"../utils/common":159,"./adler32":160,"./crc32":162,"./inffast":164,"./inftrees":166}],166:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
|
|
var utils = require('../utils/common'); |
|
|
|
var MAXBITS = 15; |
|
var ENOUGH_LENS = 852; |
|
var ENOUGH_DISTS = 592; |
|
//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); |
|
|
|
var CODES = 0; |
|
var LENS = 1; |
|
var DISTS = 2; |
|
|
|
var lbase = [ /* Length codes 257..285 base */ |
|
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, |
|
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 |
|
]; |
|
|
|
var lext = [ /* Length codes 257..285 extra */ |
|
16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, |
|
19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 |
|
]; |
|
|
|
var dbase = [ /* Distance codes 0..29 base */ |
|
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, |
|
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, |
|
8193, 12289, 16385, 24577, 0, 0 |
|
]; |
|
|
|
var dext = [ /* Distance codes 0..29 extra */ |
|
16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, |
|
23, 23, 24, 24, 25, 25, 26, 26, 27, 27, |
|
28, 28, 29, 29, 64, 64 |
|
]; |
|
|
|
module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) |
|
{ |
|
var bits = opts.bits; |
|
//here = opts.here; /* table entry for duplication */ |
|
|
|
var len = 0; /* a code's length in bits */ |
|
var sym = 0; /* index of code symbols */ |
|
var min = 0, max = 0; /* minimum and maximum code lengths */ |
|
var root = 0; /* number of index bits for root table */ |
|
var curr = 0; /* number of index bits for current table */ |
|
var drop = 0; /* code bits to drop for sub-table */ |
|
var left = 0; /* number of prefix codes available */ |
|
var used = 0; /* code entries in table used */ |
|
var huff = 0; /* Huffman code */ |
|
var incr; /* for incrementing code, index */ |
|
var fill; /* index for replicating entries */ |
|
var low; /* low bits for current root entry */ |
|
var mask; /* mask for low root bits */ |
|
var next; /* next available space in table */ |
|
var base = null; /* base value table to use */ |
|
var base_index = 0; |
|
// var shoextra; /* extra bits table to use */ |
|
var end; /* use base and extra for symbol > end */ |
|
var count = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* number of codes of each length */ |
|
var offs = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* offsets in table for each length */ |
|
var extra = null; |
|
var extra_index = 0; |
|
|
|
var here_bits, here_op, here_val; |
|
|
|
/* |
|
Process a set of code lengths to create a canonical Huffman code. The |
|
code lengths are lens[0..codes-1]. Each length corresponds to the |
|
symbols 0..codes-1. The Huffman code is generated by first sorting the |
|
symbols by length from short to long, and retaining the symbol order |
|
for codes with equal lengths. Then the code starts with all zero bits |
|
for the first code of the shortest length, and the codes are integer |
|
increments for the same length, and zeros are appended as the length |
|
increases. For the deflate format, these bits are stored backwards |
|
from their more natural integer increment ordering, and so when the |
|
decoding tables are built in the large loop below, the integer codes |
|
are incremented backwards. |
|
|
|
This routine assumes, but does not check, that all of the entries in |
|
lens[] are in the range 0..MAXBITS. The caller must assure this. |
|
1..MAXBITS is interpreted as that code length. zero means that that |
|
symbol does not occur in this code. |
|
|
|
The codes are sorted by computing a count of codes for each length, |
|
creating from that a table of starting indices for each length in the |
|
sorted table, and then entering the symbols in order in the sorted |
|
table. The sorted table is work[], with that space being provided by |
|
the caller. |
|
|
|
The length counts are used for other purposes as well, i.e. finding |
|
the minimum and maximum length codes, determining if there are any |
|
codes at all, checking for a valid set of lengths, and looking ahead |
|
at length counts to determine sub-table sizes when building the |
|
decoding tables. |
|
*/ |
|
|
|
/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ |
|
for (len = 0; len <= MAXBITS; len++) { |
|
count[len] = 0; |
|
} |
|
for (sym = 0; sym < codes; sym++) { |
|
count[lens[lens_index + sym]]++; |
|
} |
|
|
|
/* bound code lengths, force root to be within code lengths */ |
|
root = bits; |
|
for (max = MAXBITS; max >= 1; max--) { |
|
if (count[max] !== 0) { break; } |
|
} |
|
if (root > max) { |
|
root = max; |
|
} |
|
if (max === 0) { /* no symbols to code at all */ |
|
//table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ |
|
//table.bits[opts.table_index] = 1; //here.bits = (var char)1; |
|
//table.val[opts.table_index++] = 0; //here.val = (var short)0; |
|
table[table_index++] = (1 << 24) | (64 << 16) | 0; |
|
|
|
|
|
//table.op[opts.table_index] = 64; |
|
//table.bits[opts.table_index] = 1; |
|
//table.val[opts.table_index++] = 0; |
|
table[table_index++] = (1 << 24) | (64 << 16) | 0; |
|
|
|
opts.bits = 1; |
|
return 0; /* no symbols, but wait for decoding to report error */ |
|
} |
|
for (min = 1; min < max; min++) { |
|
if (count[min] !== 0) { break; } |
|
} |
|
if (root < min) { |
|
root = min; |
|
} |
|
|
|
/* check for an over-subscribed or incomplete set of lengths */ |
|
left = 1; |
|
for (len = 1; len <= MAXBITS; len++) { |
|
left <<= 1; |
|
left -= count[len]; |
|
if (left < 0) { |
|
return -1; |
|
} /* over-subscribed */ |
|
} |
|
if (left > 0 && (type === CODES || max !== 1)) { |
|
return -1; /* incomplete set */ |
|
} |
|
|
|
/* generate offsets into symbol table for each length for sorting */ |
|
offs[1] = 0; |
|
for (len = 1; len < MAXBITS; len++) { |
|
offs[len + 1] = offs[len] + count[len]; |
|
} |
|
|
|
/* sort symbols by length, by symbol order within each length */ |
|
for (sym = 0; sym < codes; sym++) { |
|
if (lens[lens_index + sym] !== 0) { |
|
work[offs[lens[lens_index + sym]]++] = sym; |
|
} |
|
} |
|
|
|
/* |
|
Create and fill in decoding tables. In this loop, the table being |
|
filled is at next and has curr index bits. The code being used is huff |
|
with length len. That code is converted to an index by dropping drop |
|
bits off of the bottom. For codes where len is less than drop + curr, |
|
those top drop + curr - len bits are incremented through all values to |
|
fill the table with replicated entries. |
|
|
|
root is the number of index bits for the root table. When len exceeds |
|
root, sub-tables are created pointed to by the root entry with an index |
|
of the low root bits of huff. This is saved in low to check for when a |
|
new sub-table should be started. drop is zero when the root table is |
|
being filled, and drop is root when sub-tables are being filled. |
|
|
|
When a new sub-table is needed, it is necessary to look ahead in the |
|
code lengths to determine what size sub-table is needed. The length |
|
counts are used for this, and so count[] is decremented as codes are |
|
entered in the tables. |
|
|
|
used keeps track of how many table entries have been allocated from the |
|
provided *table space. It is checked for LENS and DIST tables against |
|
the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in |
|
the initial root table size constants. See the comments in inftrees.h |
|
for more information. |
|
|
|
sym increments through all symbols, and the loop terminates when |
|
all codes of length max, i.e. all codes, have been processed. This |
|
routine permits incomplete codes, so another loop after this one fills |
|
in the rest of the decoding tables with invalid code markers. |
|
*/ |
|
|
|
/* set up for code type */ |
|
// poor man optimization - use if-else instead of switch, |
|
// to avoid deopts in old v8 |
|
if (type === CODES) { |
|
base = extra = work; /* dummy value--not used */ |
|
end = 19; |
|
} else if (type === LENS) { |
|
base = lbase; |
|
base_index -= 257; |
|
extra = lext; |
|
extra_index -= 257; |
|
end = 256; |
|
} else { /* DISTS */ |
|
base = dbase; |
|
extra = dext; |
|
end = -1; |
|
} |
|
|
|
/* initialize opts for loop */ |
|
huff = 0; /* starting code */ |
|
sym = 0; /* starting code symbol */ |
|
len = min; /* starting code length */ |
|
next = table_index; /* current table to fill in */ |
|
curr = root; /* current table index bits */ |
|
drop = 0; /* current bits to drop from code for index */ |
|
low = -1; /* trigger new sub-table when len > root */ |
|
used = 1 << root; /* use root table entries */ |
|
mask = used - 1; /* mask for comparing low */ |
|
|
|
/* check available table space */ |
|
if ((type === LENS && used > ENOUGH_LENS) || |
|
(type === DISTS && used > ENOUGH_DISTS)) { |
|
return 1; |
|
} |
|
|
|
var i=0; |
|
/* process all codes and make table entries */ |
|
for (;;) { |
|
i++; |
|
/* create table entry */ |
|
here_bits = len - drop; |
|
if (work[sym] < end) { |
|
here_op = 0; |
|
here_val = work[sym]; |
|
} |
|
else if (work[sym] > end) { |
|
here_op = extra[extra_index + work[sym]]; |
|
here_val = base[base_index + work[sym]]; |
|
} |
|
else { |
|
here_op = 32 + 64; /* end of block */ |
|
here_val = 0; |
|
} |
|
|
|
/* replicate for those indices with low len bits equal to huff */ |
|
incr = 1 << (len - drop); |
|
fill = 1 << curr; |
|
min = fill; /* save offset to next table */ |
|
do { |
|
fill -= incr; |
|
table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; |
|
} while (fill !== 0); |
|
|
|
/* backwards increment the len-bit code huff */ |
|
incr = 1 << (len - 1); |
|
while (huff & incr) { |
|
incr >>= 1; |
|
} |
|
if (incr !== 0) { |
|
huff &= incr - 1; |
|
huff += incr; |
|
} else { |
|
huff = 0; |
|
} |
|
|
|
/* go to next symbol, update count, len */ |
|
sym++; |
|
if (--count[len] === 0) { |
|
if (len === max) { break; } |
|
len = lens[lens_index + work[sym]]; |
|
} |
|
|
|
/* create new sub-table if needed */ |
|
if (len > root && (huff & mask) !== low) { |
|
/* if first time, transition to sub-tables */ |
|
if (drop === 0) { |
|
drop = root; |
|
} |
|
|
|
/* increment past last table */ |
|
next += min; /* here min is 1 << curr */ |
|
|
|
/* determine length of next table */ |
|
curr = len - drop; |
|
left = 1 << curr; |
|
while (curr + drop < max) { |
|
left -= count[curr + drop]; |
|
if (left <= 0) { break; } |
|
curr++; |
|
left <<= 1; |
|
} |
|
|
|
/* check for enough space */ |
|
used += 1 << curr; |
|
if ((type === LENS && used > ENOUGH_LENS) || |
|
(type === DISTS && used > ENOUGH_DISTS)) { |
|
return 1; |
|
} |
|
|
|
/* point entry in root table to sub-table */ |
|
low = huff & mask; |
|
/*table.op[low] = curr; |
|
table.bits[low] = root; |
|
table.val[low] = next - opts.table_index;*/ |
|
table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; |
|
} |
|
} |
|
|
|
/* fill in remaining table entry if code is incomplete (guaranteed to have |
|
at most one remaining entry, since if the code is incomplete, the |
|
maximum code length that was allowed to get this far is one bit) */ |
|
if (huff !== 0) { |
|
//table.op[next + huff] = 64; /* invalid code marker */ |
|
//table.bits[next + huff] = len - drop; |
|
//table.val[next + huff] = 0; |
|
table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; |
|
} |
|
|
|
/* set return parameters */ |
|
//opts.table_index += used; |
|
opts.bits = root; |
|
return 0; |
|
}; |
|
|
|
},{"../utils/common":159}],167:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
module.exports = { |
|
'2': 'need dictionary', /* Z_NEED_DICT 2 */ |
|
'1': 'stream end', /* Z_STREAM_END 1 */ |
|
'0': '', /* Z_OK 0 */ |
|
'-1': 'file error', /* Z_ERRNO (-1) */ |
|
'-2': 'stream error', /* Z_STREAM_ERROR (-2) */ |
|
'-3': 'data error', /* Z_DATA_ERROR (-3) */ |
|
'-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ |
|
'-5': 'buffer error', /* Z_BUF_ERROR (-5) */ |
|
'-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ |
|
}; |
|
},{}],168:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
|
|
var utils = require('../utils/common'); |
|
|
|
/* Public constants ==========================================================*/ |
|
/* ===========================================================================*/ |
|
|
|
|
|
//var Z_FILTERED = 1; |
|
//var Z_HUFFMAN_ONLY = 2; |
|
//var Z_RLE = 3; |
|
var Z_FIXED = 4; |
|
//var Z_DEFAULT_STRATEGY = 0; |
|
|
|
/* Possible values of the data_type field (though see inflate()) */ |
|
var Z_BINARY = 0; |
|
var Z_TEXT = 1; |
|
//var Z_ASCII = 1; // = Z_TEXT |
|
var Z_UNKNOWN = 2; |
|
|
|
/*============================================================================*/ |
|
|
|
|
|
function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } |
|
|
|
// From zutil.h |
|
|
|
var STORED_BLOCK = 0; |
|
var STATIC_TREES = 1; |
|
var DYN_TREES = 2; |
|
/* The three kinds of block type */ |
|
|
|
var MIN_MATCH = 3; |
|
var MAX_MATCH = 258; |
|
/* The minimum and maximum match lengths */ |
|
|
|
// From deflate.h |
|
/* =========================================================================== |
|
* Internal compression state. |
|
*/ |
|
|
|
var LENGTH_CODES = 29; |
|
/* number of length codes, not counting the special END_BLOCK code */ |
|
|
|
var LITERALS = 256; |
|
/* number of literal bytes 0..255 */ |
|
|
|
var L_CODES = LITERALS + 1 + LENGTH_CODES; |
|
/* number of Literal or Length codes, including the END_BLOCK code */ |
|
|
|
var D_CODES = 30; |
|
/* number of distance codes */ |
|
|
|
var BL_CODES = 19; |
|
/* number of codes used to transfer the bit lengths */ |
|
|
|
var HEAP_SIZE = 2*L_CODES + 1; |
|
/* maximum heap size */ |
|
|
|
var MAX_BITS = 15; |
|
/* All codes must not exceed MAX_BITS bits */ |
|
|
|
var Buf_size = 16; |
|
/* size of bit buffer in bi_buf */ |
|
|
|
|
|
/* =========================================================================== |
|
* Constants |
|
*/ |
|
|
|
var MAX_BL_BITS = 7; |
|
/* Bit length codes must not exceed MAX_BL_BITS bits */ |
|
|
|
var END_BLOCK = 256; |
|
/* end of block literal code */ |
|
|
|
var REP_3_6 = 16; |
|
/* repeat previous bit length 3-6 times (2 bits of repeat count) */ |
|
|
|
var REPZ_3_10 = 17; |
|
/* repeat a zero length 3-10 times (3 bits of repeat count) */ |
|
|
|
var REPZ_11_138 = 18; |
|
/* repeat a zero length 11-138 times (7 bits of repeat count) */ |
|
|
|
var extra_lbits = /* extra bits for each length code */ |
|
[0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]; |
|
|
|
var extra_dbits = /* extra bits for each distance code */ |
|
[0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]; |
|
|
|
var extra_blbits = /* extra bits for each bit length code */ |
|
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]; |
|
|
|
var bl_order = |
|
[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]; |
|
/* The lengths of the bit length codes are sent in order of decreasing |
|
* probability, to avoid transmitting the lengths for unused bit length codes. |
|
*/ |
|
|
|
/* =========================================================================== |
|
* Local data. These are initialized only once. |
|
*/ |
|
|
|
// We pre-fill arrays with 0 to avoid uninitialized gaps |
|
|
|
var DIST_CODE_LEN = 512; /* see definition of array dist_code below */ |
|
|
|
// !!!! Use flat array insdead of structure, Freq = i*2, Len = i*2+1 |
|
var static_ltree = new Array((L_CODES+2) * 2); |
|
zero(static_ltree); |
|
/* The static literal tree. Since the bit lengths are imposed, there is no |
|
* need for the L_CODES extra codes used during heap construction. However |
|
* The codes 286 and 287 are needed to build a canonical tree (see _tr_init |
|
* below). |
|
*/ |
|
|
|
var static_dtree = new Array(D_CODES * 2); |
|
zero(static_dtree); |
|
/* The static distance tree. (Actually a trivial tree since all codes use |
|
* 5 bits.) |
|
*/ |
|
|
|
var _dist_code = new Array(DIST_CODE_LEN); |
|
zero(_dist_code); |
|
/* Distance codes. The first 256 values correspond to the distances |
|
* 3 .. 258, the last 256 values correspond to the top 8 bits of |
|
* the 15 bit distances. |
|
*/ |
|
|
|
var _length_code = new Array(MAX_MATCH-MIN_MATCH+1); |
|
zero(_length_code); |
|
/* length code for each normalized match length (0 == MIN_MATCH) */ |
|
|
|
var base_length = new Array(LENGTH_CODES); |
|
zero(base_length); |
|
/* First normalized length for each code (0 = MIN_MATCH) */ |
|
|
|
var base_dist = new Array(D_CODES); |
|
zero(base_dist); |
|
/* First normalized distance for each code (0 = distance of 1) */ |
|
|
|
|
|
var StaticTreeDesc = function (static_tree, extra_bits, extra_base, elems, max_length) { |
|
|
|
this.static_tree = static_tree; /* static tree or NULL */ |
|
this.extra_bits = extra_bits; /* extra bits for each code or NULL */ |
|
this.extra_base = extra_base; /* base index for extra_bits */ |
|
this.elems = elems; /* max number of elements in the tree */ |
|
this.max_length = max_length; /* max bit length for the codes */ |
|
|
|
// show if `static_tree` has data or dummy - needed for monomorphic objects |
|
this.has_stree = static_tree && static_tree.length; |
|
}; |
|
|
|
|
|
var static_l_desc; |
|
var static_d_desc; |
|
var static_bl_desc; |
|
|
|
|
|
var TreeDesc = function(dyn_tree, stat_desc) { |
|
this.dyn_tree = dyn_tree; /* the dynamic tree */ |
|
this.max_code = 0; /* largest code with non zero frequency */ |
|
this.stat_desc = stat_desc; /* the corresponding static tree */ |
|
}; |
|
|
|
|
|
|
|
function d_code(dist) { |
|
return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Output a short LSB first on the stream. |
|
* IN assertion: there is enough room in pendingBuf. |
|
*/ |
|
function put_short (s, w) { |
|
// put_byte(s, (uch)((w) & 0xff)); |
|
// put_byte(s, (uch)((ush)(w) >> 8)); |
|
s.pending_buf[s.pending++] = (w) & 0xff; |
|
s.pending_buf[s.pending++] = (w >>> 8) & 0xff; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Send a value on a given number of bits. |
|
* IN assertion: length <= 16 and value fits in length bits. |
|
*/ |
|
function send_bits(s, value, length) { |
|
if (s.bi_valid > (Buf_size - length)) { |
|
s.bi_buf |= (value << s.bi_valid) & 0xffff; |
|
put_short(s, s.bi_buf); |
|
s.bi_buf = value >> (Buf_size - s.bi_valid); |
|
s.bi_valid += length - Buf_size; |
|
} else { |
|
s.bi_buf |= (value << s.bi_valid) & 0xffff; |
|
s.bi_valid += length; |
|
} |
|
} |
|
|
|
|
|
function send_code(s, c, tree) { |
|
send_bits(s, tree[c*2]/*.Code*/, tree[c*2 + 1]/*.Len*/); |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Reverse the first len bits of a code, using straightforward code (a faster |
|
* method would use a table) |
|
* IN assertion: 1 <= len <= 15 |
|
*/ |
|
function bi_reverse(code, len) { |
|
var res = 0; |
|
do { |
|
res |= code & 1; |
|
code >>>= 1; |
|
res <<= 1; |
|
} while (--len > 0); |
|
return res >>> 1; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Flush the bit buffer, keeping at most 7 bits in it. |
|
*/ |
|
function bi_flush(s) { |
|
if (s.bi_valid === 16) { |
|
put_short(s, s.bi_buf); |
|
s.bi_buf = 0; |
|
s.bi_valid = 0; |
|
|
|
} else if (s.bi_valid >= 8) { |
|
s.pending_buf[s.pending++] = s.bi_buf & 0xff; |
|
s.bi_buf >>= 8; |
|
s.bi_valid -= 8; |
|
} |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Compute the optimal bit lengths for a tree and update the total bit length |
|
* for the current block. |
|
* IN assertion: the fields freq and dad are set, heap[heap_max] and |
|
* above are the tree nodes sorted by increasing frequency. |
|
* OUT assertions: the field len is set to the optimal bit length, the |
|
* array bl_count contains the frequencies for each bit length. |
|
* The length opt_len is updated; static_len is also updated if stree is |
|
* not null. |
|
*/ |
|
function gen_bitlen(s, desc) |
|
// deflate_state *s; |
|
// tree_desc *desc; /* the tree descriptor */ |
|
{ |
|
var tree = desc.dyn_tree; |
|
var max_code = desc.max_code; |
|
var stree = desc.stat_desc.static_tree; |
|
var has_stree = desc.stat_desc.has_stree; |
|
var extra = desc.stat_desc.extra_bits; |
|
var base = desc.stat_desc.extra_base; |
|
var max_length = desc.stat_desc.max_length; |
|
var h; /* heap index */ |
|
var n, m; /* iterate over the tree elements */ |
|
var bits; /* bit length */ |
|
var xbits; /* extra bits */ |
|
var f; /* frequency */ |
|
var overflow = 0; /* number of elements with bit length too large */ |
|
|
|
for (bits = 0; bits <= MAX_BITS; bits++) { |
|
s.bl_count[bits] = 0; |
|
} |
|
|
|
/* In a first pass, compute the optimal bit lengths (which may |
|
* overflow in the case of the bit length tree). |
|
*/ |
|
tree[s.heap[s.heap_max]*2 + 1]/*.Len*/ = 0; /* root of the heap */ |
|
|
|
for (h = s.heap_max+1; h < HEAP_SIZE; h++) { |
|
n = s.heap[h]; |
|
bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; |
|
if (bits > max_length) { |
|
bits = max_length; |
|
overflow++; |
|
} |
|
tree[n*2 + 1]/*.Len*/ = bits; |
|
/* We overwrite tree[n].Dad which is no longer needed */ |
|
|
|
if (n > max_code) { continue; } /* not a leaf node */ |
|
|
|
s.bl_count[bits]++; |
|
xbits = 0; |
|
if (n >= base) { |
|
xbits = extra[n-base]; |
|
} |
|
f = tree[n * 2]/*.Freq*/; |
|
s.opt_len += f * (bits + xbits); |
|
if (has_stree) { |
|
s.static_len += f * (stree[n*2 + 1]/*.Len*/ + xbits); |
|
} |
|
} |
|
if (overflow === 0) { return; } |
|
|
|
// Trace((stderr,"\nbit length overflow\n")); |
|
/* This happens for example on obj2 and pic of the Calgary corpus */ |
|
|
|
/* Find the first bit length which could increase: */ |
|
do { |
|
bits = max_length-1; |
|
while (s.bl_count[bits] === 0) { bits--; } |
|
s.bl_count[bits]--; /* move one leaf down the tree */ |
|
s.bl_count[bits+1] += 2; /* move one overflow item as its brother */ |
|
s.bl_count[max_length]--; |
|
/* The brother of the overflow item also moves one step up, |
|
* but this does not affect bl_count[max_length] |
|
*/ |
|
overflow -= 2; |
|
} while (overflow > 0); |
|
|
|
/* Now recompute all bit lengths, scanning in increasing frequency. |
|
* h is still equal to HEAP_SIZE. (It is simpler to reconstruct all |
|
* lengths instead of fixing only the wrong ones. This idea is taken |
|
* from 'ar' written by Haruhiko Okumura.) |
|
*/ |
|
for (bits = max_length; bits !== 0; bits--) { |
|
n = s.bl_count[bits]; |
|
while (n !== 0) { |
|
m = s.heap[--h]; |
|
if (m > max_code) { continue; } |
|
if (tree[m*2 + 1]/*.Len*/ !== bits) { |
|
// Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); |
|
s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/; |
|
tree[m*2 + 1]/*.Len*/ = bits; |
|
} |
|
n--; |
|
} |
|
} |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Generate the codes for a given tree and bit counts (which need not be |
|
* optimal). |
|
* IN assertion: the array bl_count contains the bit length statistics for |
|
* the given tree and the field len is set for all tree elements. |
|
* OUT assertion: the field code is set for all tree elements of non |
|
* zero code length. |
|
*/ |
|
function gen_codes(tree, max_code, bl_count) |
|
// ct_data *tree; /* the tree to decorate */ |
|
// int max_code; /* largest code with non zero frequency */ |
|
// ushf *bl_count; /* number of codes at each bit length */ |
|
{ |
|
var next_code = new Array(MAX_BITS+1); /* next code value for each bit length */ |
|
var code = 0; /* running code value */ |
|
var bits; /* bit index */ |
|
var n; /* code index */ |
|
|
|
/* The distribution counts are first used to generate the code values |
|
* without bit reversal. |
|
*/ |
|
for (bits = 1; bits <= MAX_BITS; bits++) { |
|
next_code[bits] = code = (code + bl_count[bits-1]) << 1; |
|
} |
|
/* Check that the bit counts in bl_count are consistent. The last code |
|
* must be all ones. |
|
*/ |
|
//Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, |
|
// "inconsistent bit counts"); |
|
//Tracev((stderr,"\ngen_codes: max_code %d ", max_code)); |
|
|
|
for (n = 0; n <= max_code; n++) { |
|
var len = tree[n*2 + 1]/*.Len*/; |
|
if (len === 0) { continue; } |
|
/* Now reverse the bits */ |
|
tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len); |
|
|
|
//Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ", |
|
// n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); |
|
} |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Initialize the various 'constant' tables. |
|
*/ |
|
function tr_static_init() { |
|
var n; /* iterates over tree elements */ |
|
var bits; /* bit counter */ |
|
var length; /* length value */ |
|
var code; /* code value */ |
|
var dist; /* distance index */ |
|
var bl_count = new Array(MAX_BITS+1); |
|
/* number of codes at each bit length for an optimal tree */ |
|
|
|
// do check in _tr_init() |
|
//if (static_init_done) return; |
|
|
|
/* For some embedded targets, global variables are not initialized: */ |
|
/*#ifdef NO_INIT_GLOBAL_POINTERS |
|
static_l_desc.static_tree = static_ltree; |
|
static_l_desc.extra_bits = extra_lbits; |
|
static_d_desc.static_tree = static_dtree; |
|
static_d_desc.extra_bits = extra_dbits; |
|
static_bl_desc.extra_bits = extra_blbits; |
|
#endif*/ |
|
|
|
/* Initialize the mapping length (0..255) -> length code (0..28) */ |
|
length = 0; |
|
for (code = 0; code < LENGTH_CODES-1; code++) { |
|
base_length[code] = length; |
|
for (n = 0; n < (1<<extra_lbits[code]); n++) { |
|
_length_code[length++] = code; |
|
} |
|
} |
|
//Assert (length == 256, "tr_static_init: length != 256"); |
|
/* Note that the length 255 (match length 258) can be represented |
|
* in two different ways: code 284 + 5 bits or code 285, so we |
|
* overwrite length_code[255] to use the best encoding: |
|
*/ |
|
_length_code[length-1] = code; |
|
|
|
/* Initialize the mapping dist (0..32K) -> dist code (0..29) */ |
|
dist = 0; |
|
for (code = 0 ; code < 16; code++) { |
|
base_dist[code] = dist; |
|
for (n = 0; n < (1<<extra_dbits[code]); n++) { |
|
_dist_code[dist++] = code; |
|
} |
|
} |
|
//Assert (dist == 256, "tr_static_init: dist != 256"); |
|
dist >>= 7; /* from now on, all distances are divided by 128 */ |
|
for ( ; code < D_CODES; code++) { |
|
base_dist[code] = dist << 7; |
|
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { |
|
_dist_code[256 + dist++] = code; |
|
} |
|
} |
|
//Assert (dist == 256, "tr_static_init: 256+dist != 512"); |
|
|
|
/* Construct the codes of the static literal tree */ |
|
for (bits = 0; bits <= MAX_BITS; bits++) { |
|
bl_count[bits] = 0; |
|
} |
|
|
|
n = 0; |
|
while (n <= 143) { |
|
static_ltree[n*2 + 1]/*.Len*/ = 8; |
|
n++; |
|
bl_count[8]++; |
|
} |
|
while (n <= 255) { |
|
static_ltree[n*2 + 1]/*.Len*/ = 9; |
|
n++; |
|
bl_count[9]++; |
|
} |
|
while (n <= 279) { |
|
static_ltree[n*2 + 1]/*.Len*/ = 7; |
|
n++; |
|
bl_count[7]++; |
|
} |
|
while (n <= 287) { |
|
static_ltree[n*2 + 1]/*.Len*/ = 8; |
|
n++; |
|
bl_count[8]++; |
|
} |
|
/* Codes 286 and 287 do not exist, but we must include them in the |
|
* tree construction to get a canonical Huffman tree (longest code |
|
* all ones) |
|
*/ |
|
gen_codes(static_ltree, L_CODES+1, bl_count); |
|
|
|
/* The static distance tree is trivial: */ |
|
for (n = 0; n < D_CODES; n++) { |
|
static_dtree[n*2 + 1]/*.Len*/ = 5; |
|
static_dtree[n*2]/*.Code*/ = bi_reverse(n, 5); |
|
} |
|
|
|
// Now data ready and we can init static trees |
|
static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS); |
|
static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS); |
|
static_bl_desc =new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS); |
|
|
|
//static_init_done = true; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Initialize a new block. |
|
*/ |
|
function init_block(s) { |
|
var n; /* iterates over tree elements */ |
|
|
|
/* Initialize the trees. */ |
|
for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n*2]/*.Freq*/ = 0; } |
|
for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n*2]/*.Freq*/ = 0; } |
|
for (n = 0; n < BL_CODES; n++) { s.bl_tree[n*2]/*.Freq*/ = 0; } |
|
|
|
s.dyn_ltree[END_BLOCK*2]/*.Freq*/ = 1; |
|
s.opt_len = s.static_len = 0; |
|
s.last_lit = s.matches = 0; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Flush the bit buffer and align the output on a byte boundary |
|
*/ |
|
function bi_windup(s) |
|
{ |
|
if (s.bi_valid > 8) { |
|
put_short(s, s.bi_buf); |
|
} else if (s.bi_valid > 0) { |
|
//put_byte(s, (Byte)s->bi_buf); |
|
s.pending_buf[s.pending++] = s.bi_buf; |
|
} |
|
s.bi_buf = 0; |
|
s.bi_valid = 0; |
|
} |
|
|
|
/* =========================================================================== |
|
* Copy a stored block, storing first the length and its |
|
* one's complement if requested. |
|
*/ |
|
function copy_block(s, buf, len, header) |
|
//DeflateState *s; |
|
//charf *buf; /* the input data */ |
|
//unsigned len; /* its length */ |
|
//int header; /* true if block header must be written */ |
|
{ |
|
bi_windup(s); /* align on byte boundary */ |
|
|
|
if (header) { |
|
put_short(s, len); |
|
put_short(s, ~len); |
|
} |
|
// while (len--) { |
|
// put_byte(s, *buf++); |
|
// } |
|
utils.arraySet(s.pending_buf, s.window, buf, len, s.pending); |
|
s.pending += len; |
|
} |
|
|
|
/* =========================================================================== |
|
* Compares to subtrees, using the tree depth as tie breaker when |
|
* the subtrees have equal frequency. This minimizes the worst case length. |
|
*/ |
|
function smaller(tree, n, m, depth) { |
|
var _n2 = n*2; |
|
var _m2 = m*2; |
|
return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || |
|
(tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); |
|
} |
|
|
|
/* =========================================================================== |
|
* Restore the heap property by moving down the tree starting at node k, |
|
* exchanging a node with the smallest of its two sons if necessary, stopping |
|
* when the heap property is re-established (each father smaller than its |
|
* two sons). |
|
*/ |
|
function pqdownheap(s, tree, k) |
|
// deflate_state *s; |
|
// ct_data *tree; /* the tree to restore */ |
|
// int k; /* node to move down */ |
|
{ |
|
var v = s.heap[k]; |
|
var j = k << 1; /* left son of k */ |
|
while (j <= s.heap_len) { |
|
/* Set j to the smallest of the two sons: */ |
|
if (j < s.heap_len && |
|
smaller(tree, s.heap[j+1], s.heap[j], s.depth)) { |
|
j++; |
|
} |
|
/* Exit if v is smaller than both sons */ |
|
if (smaller(tree, v, s.heap[j], s.depth)) { break; } |
|
|
|
/* Exchange v with the smallest son */ |
|
s.heap[k] = s.heap[j]; |
|
k = j; |
|
|
|
/* And continue down the tree, setting j to the left son of k */ |
|
j <<= 1; |
|
} |
|
s.heap[k] = v; |
|
} |
|
|
|
|
|
// inlined manually |
|
// var SMALLEST = 1; |
|
|
|
/* =========================================================================== |
|
* Send the block data compressed using the given Huffman trees |
|
*/ |
|
function compress_block(s, ltree, dtree) |
|
// deflate_state *s; |
|
// const ct_data *ltree; /* literal tree */ |
|
// const ct_data *dtree; /* distance tree */ |
|
{ |
|
var dist; /* distance of matched string */ |
|
var lc; /* match length or unmatched char (if dist == 0) */ |
|
var lx = 0; /* running index in l_buf */ |
|
var code; /* the code to send */ |
|
var extra; /* number of extra bits to send */ |
|
|
|
if (s.last_lit !== 0) { |
|
do { |
|
dist = (s.pending_buf[s.d_buf + lx*2] << 8) | (s.pending_buf[s.d_buf + lx*2 + 1]); |
|
lc = s.pending_buf[s.l_buf + lx]; |
|
lx++; |
|
|
|
if (dist === 0) { |
|
send_code(s, lc, ltree); /* send a literal byte */ |
|
//Tracecv(isgraph(lc), (stderr," '%c' ", lc)); |
|
} else { |
|
/* Here, lc is the match length - MIN_MATCH */ |
|
code = _length_code[lc]; |
|
send_code(s, code+LITERALS+1, ltree); /* send the length code */ |
|
extra = extra_lbits[code]; |
|
if (extra !== 0) { |
|
lc -= base_length[code]; |
|
send_bits(s, lc, extra); /* send the extra length bits */ |
|
} |
|
dist--; /* dist is now the match distance - 1 */ |
|
code = d_code(dist); |
|
//Assert (code < D_CODES, "bad d_code"); |
|
|
|
send_code(s, code, dtree); /* send the distance code */ |
|
extra = extra_dbits[code]; |
|
if (extra !== 0) { |
|
dist -= base_dist[code]; |
|
send_bits(s, dist, extra); /* send the extra distance bits */ |
|
} |
|
} /* literal or match pair ? */ |
|
|
|
/* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ |
|
//Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx, |
|
// "pendingBuf overflow"); |
|
|
|
} while (lx < s.last_lit); |
|
} |
|
|
|
send_code(s, END_BLOCK, ltree); |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Construct one Huffman tree and assigns the code bit strings and lengths. |
|
* Update the total bit length for the current block. |
|
* IN assertion: the field freq is set for all tree elements. |
|
* OUT assertions: the fields len and code are set to the optimal bit length |
|
* and corresponding code. The length opt_len is updated; static_len is |
|
* also updated if stree is not null. The field max_code is set. |
|
*/ |
|
function build_tree(s, desc) |
|
// deflate_state *s; |
|
// tree_desc *desc; /* the tree descriptor */ |
|
{ |
|
var tree = desc.dyn_tree; |
|
var stree = desc.stat_desc.static_tree; |
|
var has_stree = desc.stat_desc.has_stree; |
|
var elems = desc.stat_desc.elems; |
|
var n, m; /* iterate over heap elements */ |
|
var max_code = -1; /* largest code with non zero frequency */ |
|
var node; /* new node being created */ |
|
|
|
/* Construct the initial heap, with least frequent element in |
|
* heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. |
|
* heap[0] is not used. |
|
*/ |
|
s.heap_len = 0; |
|
s.heap_max = HEAP_SIZE; |
|
|
|
for (n = 0; n < elems; n++) { |
|
if (tree[n * 2]/*.Freq*/ !== 0) { |
|
s.heap[++s.heap_len] = max_code = n; |
|
s.depth[n] = 0; |
|
|
|
} else { |
|
tree[n*2 + 1]/*.Len*/ = 0; |
|
} |
|
} |
|
|
|
/* The pkzip format requires that at least one distance code exists, |
|
* and that at least one bit should be sent even if there is only one |
|
* possible code. So to avoid special checks later on we force at least |
|
* two codes of non zero frequency. |
|
*/ |
|
while (s.heap_len < 2) { |
|
node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); |
|
tree[node * 2]/*.Freq*/ = 1; |
|
s.depth[node] = 0; |
|
s.opt_len--; |
|
|
|
if (has_stree) { |
|
s.static_len -= stree[node*2 + 1]/*.Len*/; |
|
} |
|
/* node is 0 or 1 so it does not have extra bits */ |
|
} |
|
desc.max_code = max_code; |
|
|
|
/* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, |
|
* establish sub-heaps of increasing lengths: |
|
*/ |
|
for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } |
|
|
|
/* Construct the Huffman tree by repeatedly combining the least two |
|
* frequent nodes. |
|
*/ |
|
node = elems; /* next internal node of the tree */ |
|
do { |
|
//pqremove(s, tree, n); /* n = node of least frequency */ |
|
/*** pqremove ***/ |
|
n = s.heap[1/*SMALLEST*/]; |
|
s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; |
|
pqdownheap(s, tree, 1/*SMALLEST*/); |
|
/***/ |
|
|
|
m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ |
|
|
|
s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ |
|
s.heap[--s.heap_max] = m; |
|
|
|
/* Create a new node father of n and m */ |
|
tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; |
|
s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; |
|
tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node; |
|
|
|
/* and insert the new node in the heap */ |
|
s.heap[1/*SMALLEST*/] = node++; |
|
pqdownheap(s, tree, 1/*SMALLEST*/); |
|
|
|
} while (s.heap_len >= 2); |
|
|
|
s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; |
|
|
|
/* At this point, the fields freq and dad are set. We can now |
|
* generate the bit lengths. |
|
*/ |
|
gen_bitlen(s, desc); |
|
|
|
/* The field len is now set, we can generate the bit codes */ |
|
gen_codes(tree, max_code, s.bl_count); |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Scan a literal or distance tree to determine the frequencies of the codes |
|
* in the bit length tree. |
|
*/ |
|
function scan_tree(s, tree, max_code) |
|
// deflate_state *s; |
|
// ct_data *tree; /* the tree to be scanned */ |
|
// int max_code; /* and its largest code of non zero frequency */ |
|
{ |
|
var n; /* iterates over all tree elements */ |
|
var prevlen = -1; /* last emitted length */ |
|
var curlen; /* length of current code */ |
|
|
|
var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */ |
|
|
|
var count = 0; /* repeat count of the current code */ |
|
var max_count = 7; /* max repeat count */ |
|
var min_count = 4; /* min repeat count */ |
|
|
|
if (nextlen === 0) { |
|
max_count = 138; |
|
min_count = 3; |
|
} |
|
tree[(max_code+1)*2 + 1]/*.Len*/ = 0xffff; /* guard */ |
|
|
|
for (n = 0; n <= max_code; n++) { |
|
curlen = nextlen; |
|
nextlen = tree[(n+1)*2 + 1]/*.Len*/; |
|
|
|
if (++count < max_count && curlen === nextlen) { |
|
continue; |
|
|
|
} else if (count < min_count) { |
|
s.bl_tree[curlen * 2]/*.Freq*/ += count; |
|
|
|
} else if (curlen !== 0) { |
|
|
|
if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } |
|
s.bl_tree[REP_3_6*2]/*.Freq*/++; |
|
|
|
} else if (count <= 10) { |
|
s.bl_tree[REPZ_3_10*2]/*.Freq*/++; |
|
|
|
} else { |
|
s.bl_tree[REPZ_11_138*2]/*.Freq*/++; |
|
} |
|
|
|
count = 0; |
|
prevlen = curlen; |
|
|
|
if (nextlen === 0) { |
|
max_count = 138; |
|
min_count = 3; |
|
|
|
} else if (curlen === nextlen) { |
|
max_count = 6; |
|
min_count = 3; |
|
|
|
} else { |
|
max_count = 7; |
|
min_count = 4; |
|
} |
|
} |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Send a literal or distance tree in compressed form, using the codes in |
|
* bl_tree. |
|
*/ |
|
function send_tree(s, tree, max_code) |
|
// deflate_state *s; |
|
// ct_data *tree; /* the tree to be scanned */ |
|
// int max_code; /* and its largest code of non zero frequency */ |
|
{ |
|
var n; /* iterates over all tree elements */ |
|
var prevlen = -1; /* last emitted length */ |
|
var curlen; /* length of current code */ |
|
|
|
var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */ |
|
|
|
var count = 0; /* repeat count of the current code */ |
|
var max_count = 7; /* max repeat count */ |
|
var min_count = 4; /* min repeat count */ |
|
|
|
/* tree[max_code+1].Len = -1; */ /* guard already set */ |
|
if (nextlen === 0) { |
|
max_count = 138; |
|
min_count = 3; |
|
} |
|
|
|
for (n = 0; n <= max_code; n++) { |
|
curlen = nextlen; |
|
nextlen = tree[(n+1)*2 + 1]/*.Len*/; |
|
|
|
if (++count < max_count && curlen === nextlen) { |
|
continue; |
|
|
|
} else if (count < min_count) { |
|
do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); |
|
|
|
} else if (curlen !== 0) { |
|
if (curlen !== prevlen) { |
|
send_code(s, curlen, s.bl_tree); |
|
count--; |
|
} |
|
//Assert(count >= 3 && count <= 6, " 3_6?"); |
|
send_code(s, REP_3_6, s.bl_tree); |
|
send_bits(s, count-3, 2); |
|
|
|
} else if (count <= 10) { |
|
send_code(s, REPZ_3_10, s.bl_tree); |
|
send_bits(s, count-3, 3); |
|
|
|
} else { |
|
send_code(s, REPZ_11_138, s.bl_tree); |
|
send_bits(s, count-11, 7); |
|
} |
|
|
|
count = 0; |
|
prevlen = curlen; |
|
if (nextlen === 0) { |
|
max_count = 138; |
|
min_count = 3; |
|
|
|
} else if (curlen === nextlen) { |
|
max_count = 6; |
|
min_count = 3; |
|
|
|
} else { |
|
max_count = 7; |
|
min_count = 4; |
|
} |
|
} |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Construct the Huffman tree for the bit lengths and return the index in |
|
* bl_order of the last bit length code to send. |
|
*/ |
|
function build_bl_tree(s) { |
|
var max_blindex; /* index of last bit length code of non zero freq */ |
|
|
|
/* Determine the bit length frequencies for literal and distance trees */ |
|
scan_tree(s, s.dyn_ltree, s.l_desc.max_code); |
|
scan_tree(s, s.dyn_dtree, s.d_desc.max_code); |
|
|
|
/* Build the bit length tree: */ |
|
build_tree(s, s.bl_desc); |
|
/* opt_len now includes the length of the tree representations, except |
|
* the lengths of the bit lengths codes and the 5+5+4 bits for the counts. |
|
*/ |
|
|
|
/* Determine the number of bit length codes to send. The pkzip format |
|
* requires that at least 4 bit length codes be sent. (appnote.txt says |
|
* 3 but the actual value used is 4.) |
|
*/ |
|
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { |
|
if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) { |
|
break; |
|
} |
|
} |
|
/* Update opt_len to include the bit length tree and counts */ |
|
s.opt_len += 3*(max_blindex+1) + 5+5+4; |
|
//Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", |
|
// s->opt_len, s->static_len)); |
|
|
|
return max_blindex; |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Send the header for a block using dynamic Huffman trees: the counts, the |
|
* lengths of the bit length codes, the literal tree and the distance tree. |
|
* IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. |
|
*/ |
|
function send_all_trees(s, lcodes, dcodes, blcodes) |
|
// deflate_state *s; |
|
// int lcodes, dcodes, blcodes; /* number of codes for each tree */ |
|
{ |
|
var rank; /* index in bl_order */ |
|
|
|
//Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); |
|
//Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, |
|
// "too many codes"); |
|
//Tracev((stderr, "\nbl counts: ")); |
|
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ |
|
send_bits(s, dcodes-1, 5); |
|
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ |
|
for (rank = 0; rank < blcodes; rank++) { |
|
//Tracev((stderr, "\nbl code %2d ", bl_order[rank])); |
|
send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3); |
|
} |
|
//Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); |
|
|
|
send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */ |
|
//Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); |
|
|
|
send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */ |
|
//Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Check if the data type is TEXT or BINARY, using the following algorithm: |
|
* - TEXT if the two conditions below are satisfied: |
|
* a) There are no non-portable control characters belonging to the |
|
* "black list" (0..6, 14..25, 28..31). |
|
* b) There is at least one printable character belonging to the |
|
* "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). |
|
* - BINARY otherwise. |
|
* - The following partially-portable control characters form a |
|
* "gray list" that is ignored in this detection algorithm: |
|
* (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). |
|
* IN assertion: the fields Freq of dyn_ltree are set. |
|
*/ |
|
function detect_data_type(s) { |
|
/* black_mask is the bit mask of black-listed bytes |
|
* set bits 0..6, 14..25, and 28..31 |
|
* 0xf3ffc07f = binary 11110011111111111100000001111111 |
|
*/ |
|
var black_mask = 0xf3ffc07f; |
|
var n; |
|
|
|
/* Check for non-textual ("black-listed") bytes. */ |
|
for (n = 0; n <= 31; n++, black_mask >>>= 1) { |
|
if ((black_mask & 1) && (s.dyn_ltree[n*2]/*.Freq*/ !== 0)) { |
|
return Z_BINARY; |
|
} |
|
} |
|
|
|
/* Check for textual ("white-listed") bytes. */ |
|
if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || |
|
s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { |
|
return Z_TEXT; |
|
} |
|
for (n = 32; n < LITERALS; n++) { |
|
if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { |
|
return Z_TEXT; |
|
} |
|
} |
|
|
|
/* There are no "black-listed" or "white-listed" bytes: |
|
* this stream either is empty or has tolerated ("gray-listed") bytes only. |
|
*/ |
|
return Z_BINARY; |
|
} |
|
|
|
|
|
var static_init_done = false; |
|
|
|
/* =========================================================================== |
|
* Initialize the tree data structures for a new zlib stream. |
|
*/ |
|
function _tr_init(s) |
|
{ |
|
|
|
if (!static_init_done) { |
|
tr_static_init(); |
|
static_init_done = true; |
|
} |
|
|
|
s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); |
|
s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); |
|
s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); |
|
|
|
s.bi_buf = 0; |
|
s.bi_valid = 0; |
|
|
|
/* Initialize the first block of the first file: */ |
|
init_block(s); |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Send a stored block |
|
*/ |
|
function _tr_stored_block(s, buf, stored_len, last) |
|
//DeflateState *s; |
|
//charf *buf; /* input block */ |
|
//ulg stored_len; /* length of input block */ |
|
//int last; /* one if this is the last block for a file */ |
|
{ |
|
send_bits(s, (STORED_BLOCK<<1)+(last ? 1 : 0), 3); /* send block type */ |
|
copy_block(s, buf, stored_len, true); /* with header */ |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Send one empty static block to give enough lookahead for inflate. |
|
* This takes 10 bits, of which 7 may remain in the bit buffer. |
|
*/ |
|
function _tr_align(s) { |
|
send_bits(s, STATIC_TREES<<1, 3); |
|
send_code(s, END_BLOCK, static_ltree); |
|
bi_flush(s); |
|
} |
|
|
|
|
|
/* =========================================================================== |
|
* Determine the best encoding for the current block: dynamic trees, static |
|
* trees or store, and output the encoded block to the zip file. |
|
*/ |
|
function _tr_flush_block(s, buf, stored_len, last) |
|
//DeflateState *s; |
|
//charf *buf; /* input block, or NULL if too old */ |
|
//ulg stored_len; /* length of input block */ |
|
//int last; /* one if this is the last block for a file */ |
|
{ |
|
var opt_lenb, static_lenb; /* opt_len and static_len in bytes */ |
|
var max_blindex = 0; /* index of last bit length code of non zero freq */ |
|
|
|
/* Build the Huffman trees unless a stored block is forced */ |
|
if (s.level > 0) { |
|
|
|
/* Check if the file is binary or text */ |
|
if (s.strm.data_type === Z_UNKNOWN) { |
|
s.strm.data_type = detect_data_type(s); |
|
} |
|
|
|
/* Construct the literal and distance trees */ |
|
build_tree(s, s.l_desc); |
|
// Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, |
|
// s->static_len)); |
|
|
|
build_tree(s, s.d_desc); |
|
// Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, |
|
// s->static_len)); |
|
/* At this point, opt_len and static_len are the total bit lengths of |
|
* the compressed block data, excluding the tree representations. |
|
*/ |
|
|
|
/* Build the bit length tree for the above two trees, and get the index |
|
* in bl_order of the last bit length code to send. |
|
*/ |
|
max_blindex = build_bl_tree(s); |
|
|
|
/* Determine the best encoding. Compute the block lengths in bytes. */ |
|
opt_lenb = (s.opt_len+3+7) >>> 3; |
|
static_lenb = (s.static_len+3+7) >>> 3; |
|
|
|
// Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", |
|
// opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, |
|
// s->last_lit)); |
|
|
|
if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } |
|
|
|
} else { |
|
// Assert(buf != (char*)0, "lost buf"); |
|
opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ |
|
} |
|
|
|
if ((stored_len+4 <= opt_lenb) && (buf !== -1)) { |
|
/* 4: two words for the lengths */ |
|
|
|
/* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. |
|
* Otherwise we can't have processed more than WSIZE input bytes since |
|
* the last block flush, because compression would have been |
|
* successful. If LIT_BUFSIZE <= WSIZE, it is never too late to |
|
* transform a block into a stored block. |
|
*/ |
|
_tr_stored_block(s, buf, stored_len, last); |
|
|
|
} else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) { |
|
|
|
send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3); |
|
compress_block(s, static_ltree, static_dtree); |
|
|
|
} else { |
|
send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3); |
|
send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1); |
|
compress_block(s, s.dyn_ltree, s.dyn_dtree); |
|
} |
|
// Assert (s->compressed_len == s->bits_sent, "bad compressed size"); |
|
/* The above check is made mod 2^32, for files larger than 512 MB |
|
* and uLong implemented on 32 bits. |
|
*/ |
|
init_block(s); |
|
|
|
if (last) { |
|
bi_windup(s); |
|
} |
|
// Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, |
|
// s->compressed_len-7*last)); |
|
} |
|
|
|
/* =========================================================================== |
|
* Save the match info and tally the frequency counts. Return true if |
|
* the current block must be flushed. |
|
*/ |
|
function _tr_tally(s, dist, lc) |
|
// deflate_state *s; |
|
// unsigned dist; /* distance of matched string */ |
|
// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ |
|
{ |
|
//var out_length, in_length, dcode; |
|
|
|
s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff; |
|
s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff; |
|
|
|
s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff; |
|
s.last_lit++; |
|
|
|
if (dist === 0) { |
|
/* lc is the unmatched char */ |
|
s.dyn_ltree[lc*2]/*.Freq*/++; |
|
} else { |
|
s.matches++; |
|
/* Here, lc is the match length - MIN_MATCH */ |
|
dist--; /* dist = match distance - 1 */ |
|
//Assert((ush)dist < (ush)MAX_DIST(s) && |
|
// (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && |
|
// (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); |
|
|
|
s.dyn_ltree[(_length_code[lc]+LITERALS+1) * 2]/*.Freq*/++; |
|
s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; |
|
} |
|
|
|
// (!) This block is disabled in zlib defailts, |
|
// don't enable it for binary compatibility |
|
|
|
//#ifdef TRUNCATE_BLOCK |
|
// /* Try to guess if it is profitable to stop the current block here */ |
|
// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) { |
|
// /* Compute an upper bound for the compressed length */ |
|
// out_length = s.last_lit*8; |
|
// in_length = s.strstart - s.block_start; |
|
// |
|
// for (dcode = 0; dcode < D_CODES; dcode++) { |
|
// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]); |
|
// } |
|
// out_length >>>= 3; |
|
// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", |
|
// // s->last_lit, in_length, out_length, |
|
// // 100L - out_length*100L/in_length)); |
|
// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) { |
|
// return true; |
|
// } |
|
// } |
|
//#endif |
|
|
|
return (s.last_lit === s.lit_bufsize-1); |
|
/* We avoid equality with lit_bufsize because of wraparound at 64K |
|
* on 16 bit machines and because stored blocks are restricted to |
|
* 64K-1 bytes. |
|
*/ |
|
} |
|
|
|
exports._tr_init = _tr_init; |
|
exports._tr_stored_block = _tr_stored_block; |
|
exports._tr_flush_block = _tr_flush_block; |
|
exports._tr_tally = _tr_tally; |
|
exports._tr_align = _tr_align; |
|
},{"../utils/common":159}],169:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
|
|
function ZStream() { |
|
/* next input byte */ |
|
this.input = null; // JS specific, because we have no pointers |
|
this.next_in = 0; |
|
/* number of bytes available at input */ |
|
this.avail_in = 0; |
|
/* total number of input bytes read so far */ |
|
this.total_in = 0; |
|
/* next output byte should be put there */ |
|
this.output = null; // JS specific, because we have no pointers |
|
this.next_out = 0; |
|
/* remaining free space at output */ |
|
this.avail_out = 0; |
|
/* total number of bytes output so far */ |
|
this.total_out = 0; |
|
/* last error message, NULL if no error */ |
|
this.msg = ''/*Z_NULL*/; |
|
/* not visible by applications */ |
|
this.state = null; |
|
/* best guess about the data type: binary or text */ |
|
this.data_type = 2/*Z_UNKNOWN*/; |
|
/* adler32 value of the uncompressed data */ |
|
this.adler = 0; |
|
} |
|
|
|
module.exports = ZStream; |
|
},{}],170:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
var msg = require('pako/lib/zlib/messages'); |
|
var zstream = require('pako/lib/zlib/zstream'); |
|
var zlib_deflate = require('pako/lib/zlib/deflate.js'); |
|
var zlib_inflate = require('pako/lib/zlib/inflate.js'); |
|
var constants = require('pako/lib/zlib/constants'); |
|
|
|
for (var key in constants) { |
|
exports[key] = constants[key]; |
|
} |
|
|
|
// zlib modes |
|
exports.NONE = 0; |
|
exports.DEFLATE = 1; |
|
exports.INFLATE = 2; |
|
exports.GZIP = 3; |
|
exports.GUNZIP = 4; |
|
exports.DEFLATERAW = 5; |
|
exports.INFLATERAW = 6; |
|
exports.UNZIP = 7; |
|
|
|
/** |
|
* Emulate Node's zlib C++ layer for use by the JS layer in index.js |
|
*/ |
|
function Zlib(mode) { |
|
if (mode < exports.DEFLATE || mode > exports.UNZIP) |
|
throw new TypeError("Bad argument"); |
|
|
|
this.mode = mode; |
|
this.init_done = false; |
|
this.write_in_progress = false; |
|
this.pending_close = false; |
|
this.windowBits = 0; |
|
this.level = 0; |
|
this.memLevel = 0; |
|
this.strategy = 0; |
|
this.dictionary = null; |
|
} |
|
|
|
Zlib.prototype.init = function(windowBits, level, memLevel, strategy, dictionary) { |
|
this.windowBits = windowBits; |
|
this.level = level; |
|
this.memLevel = memLevel; |
|
this.strategy = strategy; |
|
// dictionary not supported. |
|
|
|
if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) |
|
this.windowBits += 16; |
|
|
|
if (this.mode === exports.UNZIP) |
|
this.windowBits += 32; |
|
|
|
if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) |
|
this.windowBits = -this.windowBits; |
|
|
|
this.strm = new zstream(); |
|
|
|
switch (this.mode) { |
|
case exports.DEFLATE: |
|
case exports.GZIP: |
|
case exports.DEFLATERAW: |
|
var status = zlib_deflate.deflateInit2( |
|
this.strm, |
|
this.level, |
|
exports.Z_DEFLATED, |
|
this.windowBits, |
|
this.memLevel, |
|
this.strategy |
|
); |
|
break; |
|
case exports.INFLATE: |
|
case exports.GUNZIP: |
|
case exports.INFLATERAW: |
|
case exports.UNZIP: |
|
var status = zlib_inflate.inflateInit2( |
|
this.strm, |
|
this.windowBits |
|
); |
|
break; |
|
default: |
|
throw new Error("Unknown mode " + this.mode); |
|
} |
|
|
|
if (status !== exports.Z_OK) { |
|
this._error(status); |
|
return; |
|
} |
|
|
|
this.write_in_progress = false; |
|
this.init_done = true; |
|
}; |
|
|
|
Zlib.prototype.params = function() { |
|
throw new Error("deflateParams Not supported"); |
|
}; |
|
|
|
Zlib.prototype._writeCheck = function() { |
|
if (!this.init_done) |
|
throw new Error("write before init"); |
|
|
|
if (this.mode === exports.NONE) |
|
throw new Error("already finalized"); |
|
|
|
if (this.write_in_progress) |
|
throw new Error("write already in progress"); |
|
|
|
if (this.pending_close) |
|
throw new Error("close is pending"); |
|
}; |
|
|
|
Zlib.prototype.write = function(flush, input, in_off, in_len, out, out_off, out_len) { |
|
this._writeCheck(); |
|
this.write_in_progress = true; |
|
|
|
var self = this; |
|
process.nextTick(function() { |
|
self.write_in_progress = false; |
|
var res = self._write(flush, input, in_off, in_len, out, out_off, out_len); |
|
self.callback(res[0], res[1]); |
|
|
|
if (self.pending_close) |
|
self.close(); |
|
}); |
|
|
|
return this; |
|
}; |
|
|
|
// set method for Node buffers, used by pako |
|
function bufferSet(data, offset) { |
|
for (var i = 0; i < data.length; i++) { |
|
this[offset + i] = data[i]; |
|
} |
|
} |
|
|
|
Zlib.prototype.writeSync = function(flush, input, in_off, in_len, out, out_off, out_len) { |
|
this._writeCheck(); |
|
return this._write(flush, input, in_off, in_len, out, out_off, out_len); |
|
}; |
|
|
|
Zlib.prototype._write = function(flush, input, in_off, in_len, out, out_off, out_len) { |
|
this.write_in_progress = true; |
|
|
|
if (flush !== exports.Z_NO_FLUSH && |
|
flush !== exports.Z_PARTIAL_FLUSH && |
|
flush !== exports.Z_SYNC_FLUSH && |
|
flush !== exports.Z_FULL_FLUSH && |
|
flush !== exports.Z_FINISH && |
|
flush !== exports.Z_BLOCK) { |
|
throw new Error("Invalid flush value"); |
|
} |
|
|
|
if (input == null) { |
|
input = new Buffer(0); |
|
in_len = 0; |
|
in_off = 0; |
|
} |
|
|
|
if (out._set) |
|
out.set = out._set; |
|
else |
|
out.set = bufferSet; |
|
|
|
var strm = this.strm; |
|
strm.avail_in = in_len; |
|
strm.input = input; |
|
strm.next_in = in_off; |
|
strm.avail_out = out_len; |
|
strm.output = out; |
|
strm.next_out = out_off; |
|
|
|
switch (this.mode) { |
|
case exports.DEFLATE: |
|
case exports.GZIP: |
|
case exports.DEFLATERAW: |
|
var status = zlib_deflate.deflate(strm, flush); |
|
break; |
|
case exports.UNZIP: |
|
case exports.INFLATE: |
|
case exports.GUNZIP: |
|
case exports.INFLATERAW: |
|
var status = zlib_inflate.inflate(strm, flush); |
|
break; |
|
default: |
|
throw new Error("Unknown mode " + this.mode); |
|
} |
|
|
|
if (status !== exports.Z_STREAM_END && status !== exports.Z_OK) { |
|
this._error(status); |
|
} |
|
|
|
this.write_in_progress = false; |
|
return [strm.avail_in, strm.avail_out]; |
|
}; |
|
|
|
Zlib.prototype.close = function() { |
|
if (this.write_in_progress) { |
|
this.pending_close = true; |
|
return; |
|
} |
|
|
|
this.pending_close = false; |
|
|
|
if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) { |
|
zlib_deflate.deflateEnd(this.strm); |
|
} else { |
|
zlib_inflate.inflateEnd(this.strm); |
|
} |
|
|
|
this.mode = exports.NONE; |
|
}; |
|
|
|
Zlib.prototype.reset = function() { |
|
switch (this.mode) { |
|
case exports.DEFLATE: |
|
case exports.DEFLATERAW: |
|
var status = zlib_deflate.deflateReset(this.strm); |
|
break; |
|
case exports.INFLATE: |
|
case exports.INFLATERAW: |
|
var status = zlib_inflate.inflateReset(this.strm); |
|
break; |
|
} |
|
|
|
if (status !== exports.Z_OK) { |
|
this._error(status); |
|
} |
|
}; |
|
|
|
Zlib.prototype._error = function(status) { |
|
this.onerror(msg[status] + ': ' + this.strm.msg, status); |
|
|
|
this.write_in_progress = false; |
|
if (this.pending_close) |
|
this.close(); |
|
}; |
|
|
|
exports.Zlib = Zlib; |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"_process":323,"buffer":172,"pako/lib/zlib/constants":161,"pako/lib/zlib/deflate.js":163,"pako/lib/zlib/inflate.js":165,"pako/lib/zlib/messages":167,"pako/lib/zlib/zstream":169}],171:[function(require,module,exports){ |
|
(function (process,Buffer){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
var Transform = require('_stream_transform'); |
|
|
|
var binding = require('./binding'); |
|
var util = require('util'); |
|
var assert = require('assert').ok; |
|
|
|
// zlib doesn't provide these, so kludge them in following the same |
|
// const naming scheme zlib uses. |
|
binding.Z_MIN_WINDOWBITS = 8; |
|
binding.Z_MAX_WINDOWBITS = 15; |
|
binding.Z_DEFAULT_WINDOWBITS = 15; |
|
|
|
// fewer than 64 bytes per chunk is stupid. |
|
// technically it could work with as few as 8, but even 64 bytes |
|
// is absurdly low. Usually a MB or more is best. |
|
binding.Z_MIN_CHUNK = 64; |
|
binding.Z_MAX_CHUNK = Infinity; |
|
binding.Z_DEFAULT_CHUNK = (16 * 1024); |
|
|
|
binding.Z_MIN_MEMLEVEL = 1; |
|
binding.Z_MAX_MEMLEVEL = 9; |
|
binding.Z_DEFAULT_MEMLEVEL = 8; |
|
|
|
binding.Z_MIN_LEVEL = -1; |
|
binding.Z_MAX_LEVEL = 9; |
|
binding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION; |
|
|
|
// expose all the zlib constants |
|
Object.keys(binding).forEach(function(k) { |
|
if (k.match(/^Z/)) exports[k] = binding[k]; |
|
}); |
|
|
|
// translation table for return codes. |
|
exports.codes = { |
|
Z_OK: binding.Z_OK, |
|
Z_STREAM_END: binding.Z_STREAM_END, |
|
Z_NEED_DICT: binding.Z_NEED_DICT, |
|
Z_ERRNO: binding.Z_ERRNO, |
|
Z_STREAM_ERROR: binding.Z_STREAM_ERROR, |
|
Z_DATA_ERROR: binding.Z_DATA_ERROR, |
|
Z_MEM_ERROR: binding.Z_MEM_ERROR, |
|
Z_BUF_ERROR: binding.Z_BUF_ERROR, |
|
Z_VERSION_ERROR: binding.Z_VERSION_ERROR |
|
}; |
|
|
|
Object.keys(exports.codes).forEach(function(k) { |
|
exports.codes[exports.codes[k]] = k; |
|
}); |
|
|
|
exports.Deflate = Deflate; |
|
exports.Inflate = Inflate; |
|
exports.Gzip = Gzip; |
|
exports.Gunzip = Gunzip; |
|
exports.DeflateRaw = DeflateRaw; |
|
exports.InflateRaw = InflateRaw; |
|
exports.Unzip = Unzip; |
|
|
|
exports.createDeflate = function(o) { |
|
return new Deflate(o); |
|
}; |
|
|
|
exports.createInflate = function(o) { |
|
return new Inflate(o); |
|
}; |
|
|
|
exports.createDeflateRaw = function(o) { |
|
return new DeflateRaw(o); |
|
}; |
|
|
|
exports.createInflateRaw = function(o) { |
|
return new InflateRaw(o); |
|
}; |
|
|
|
exports.createGzip = function(o) { |
|
return new Gzip(o); |
|
}; |
|
|
|
exports.createGunzip = function(o) { |
|
return new Gunzip(o); |
|
}; |
|
|
|
exports.createUnzip = function(o) { |
|
return new Unzip(o); |
|
}; |
|
|
|
|
|
// Convenience methods. |
|
// compress/decompress a string or buffer in one step. |
|
exports.deflate = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new Deflate(opts), buffer, callback); |
|
}; |
|
|
|
exports.deflateSync = function(buffer, opts) { |
|
return zlibBufferSync(new Deflate(opts), buffer); |
|
}; |
|
|
|
exports.gzip = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new Gzip(opts), buffer, callback); |
|
}; |
|
|
|
exports.gzipSync = function(buffer, opts) { |
|
return zlibBufferSync(new Gzip(opts), buffer); |
|
}; |
|
|
|
exports.deflateRaw = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new DeflateRaw(opts), buffer, callback); |
|
}; |
|
|
|
exports.deflateRawSync = function(buffer, opts) { |
|
return zlibBufferSync(new DeflateRaw(opts), buffer); |
|
}; |
|
|
|
exports.unzip = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new Unzip(opts), buffer, callback); |
|
}; |
|
|
|
exports.unzipSync = function(buffer, opts) { |
|
return zlibBufferSync(new Unzip(opts), buffer); |
|
}; |
|
|
|
exports.inflate = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new Inflate(opts), buffer, callback); |
|
}; |
|
|
|
exports.inflateSync = function(buffer, opts) { |
|
return zlibBufferSync(new Inflate(opts), buffer); |
|
}; |
|
|
|
exports.gunzip = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new Gunzip(opts), buffer, callback); |
|
}; |
|
|
|
exports.gunzipSync = function(buffer, opts) { |
|
return zlibBufferSync(new Gunzip(opts), buffer); |
|
}; |
|
|
|
exports.inflateRaw = function(buffer, opts, callback) { |
|
if (typeof opts === 'function') { |
|
callback = opts; |
|
opts = {}; |
|
} |
|
return zlibBuffer(new InflateRaw(opts), buffer, callback); |
|
}; |
|
|
|
exports.inflateRawSync = function(buffer, opts) { |
|
return zlibBufferSync(new InflateRaw(opts), buffer); |
|
}; |
|
|
|
function zlibBuffer(engine, buffer, callback) { |
|
var buffers = []; |
|
var nread = 0; |
|
|
|
engine.on('error', onError); |
|
engine.on('end', onEnd); |
|
|
|
engine.end(buffer); |
|
flow(); |
|
|
|
function flow() { |
|
var chunk; |
|
while (null !== (chunk = engine.read())) { |
|
buffers.push(chunk); |
|
nread += chunk.length; |
|
} |
|
engine.once('readable', flow); |
|
} |
|
|
|
function onError(err) { |
|
engine.removeListener('end', onEnd); |
|
engine.removeListener('readable', flow); |
|
callback(err); |
|
} |
|
|
|
function onEnd() { |
|
var buf = Buffer.concat(buffers, nread); |
|
buffers = []; |
|
callback(null, buf); |
|
engine.close(); |
|
} |
|
} |
|
|
|
function zlibBufferSync(engine, buffer) { |
|
if (typeof buffer === 'string') |
|
buffer = new Buffer(buffer); |
|
if (!Buffer.isBuffer(buffer)) |
|
throw new TypeError('Not a string or buffer'); |
|
|
|
var flushFlag = binding.Z_FINISH; |
|
|
|
return engine._processChunk(buffer, flushFlag); |
|
} |
|
|
|
// generic zlib |
|
// minimal 2-byte header |
|
function Deflate(opts) { |
|
if (!(this instanceof Deflate)) return new Deflate(opts); |
|
Zlib.call(this, opts, binding.DEFLATE); |
|
} |
|
|
|
function Inflate(opts) { |
|
if (!(this instanceof Inflate)) return new Inflate(opts); |
|
Zlib.call(this, opts, binding.INFLATE); |
|
} |
|
|
|
|
|
|
|
// gzip - bigger header, same deflate compression |
|
function Gzip(opts) { |
|
if (!(this instanceof Gzip)) return new Gzip(opts); |
|
Zlib.call(this, opts, binding.GZIP); |
|
} |
|
|
|
function Gunzip(opts) { |
|
if (!(this instanceof Gunzip)) return new Gunzip(opts); |
|
Zlib.call(this, opts, binding.GUNZIP); |
|
} |
|
|
|
|
|
|
|
// raw - no header |
|
function DeflateRaw(opts) { |
|
if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts); |
|
Zlib.call(this, opts, binding.DEFLATERAW); |
|
} |
|
|
|
function InflateRaw(opts) { |
|
if (!(this instanceof InflateRaw)) return new InflateRaw(opts); |
|
Zlib.call(this, opts, binding.INFLATERAW); |
|
} |
|
|
|
|
|
// auto-detect header. |
|
function Unzip(opts) { |
|
if (!(this instanceof Unzip)) return new Unzip(opts); |
|
Zlib.call(this, opts, binding.UNZIP); |
|
} |
|
|
|
|
|
// the Zlib class they all inherit from |
|
// This thing manages the queue of requests, and returns |
|
// true or false if there is anything in the queue when |
|
// you call the .write() method. |
|
|
|
function Zlib(opts, mode) { |
|
this._opts = opts = opts || {}; |
|
this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK; |
|
|
|
Transform.call(this, opts); |
|
|
|
if (opts.flush) { |
|
if (opts.flush !== binding.Z_NO_FLUSH && |
|
opts.flush !== binding.Z_PARTIAL_FLUSH && |
|
opts.flush !== binding.Z_SYNC_FLUSH && |
|
opts.flush !== binding.Z_FULL_FLUSH && |
|
opts.flush !== binding.Z_FINISH && |
|
opts.flush !== binding.Z_BLOCK) { |
|
throw new Error('Invalid flush flag: ' + opts.flush); |
|
} |
|
} |
|
this._flushFlag = opts.flush || binding.Z_NO_FLUSH; |
|
|
|
if (opts.chunkSize) { |
|
if (opts.chunkSize < exports.Z_MIN_CHUNK || |
|
opts.chunkSize > exports.Z_MAX_CHUNK) { |
|
throw new Error('Invalid chunk size: ' + opts.chunkSize); |
|
} |
|
} |
|
|
|
if (opts.windowBits) { |
|
if (opts.windowBits < exports.Z_MIN_WINDOWBITS || |
|
opts.windowBits > exports.Z_MAX_WINDOWBITS) { |
|
throw new Error('Invalid windowBits: ' + opts.windowBits); |
|
} |
|
} |
|
|
|
if (opts.level) { |
|
if (opts.level < exports.Z_MIN_LEVEL || |
|
opts.level > exports.Z_MAX_LEVEL) { |
|
throw new Error('Invalid compression level: ' + opts.level); |
|
} |
|
} |
|
|
|
if (opts.memLevel) { |
|
if (opts.memLevel < exports.Z_MIN_MEMLEVEL || |
|
opts.memLevel > exports.Z_MAX_MEMLEVEL) { |
|
throw new Error('Invalid memLevel: ' + opts.memLevel); |
|
} |
|
} |
|
|
|
if (opts.strategy) { |
|
if (opts.strategy != exports.Z_FILTERED && |
|
opts.strategy != exports.Z_HUFFMAN_ONLY && |
|
opts.strategy != exports.Z_RLE && |
|
opts.strategy != exports.Z_FIXED && |
|
opts.strategy != exports.Z_DEFAULT_STRATEGY) { |
|
throw new Error('Invalid strategy: ' + opts.strategy); |
|
} |
|
} |
|
|
|
if (opts.dictionary) { |
|
if (!Buffer.isBuffer(opts.dictionary)) { |
|
throw new Error('Invalid dictionary: it should be a Buffer instance'); |
|
} |
|
} |
|
|
|
this._binding = new binding.Zlib(mode); |
|
|
|
var self = this; |
|
this._hadError = false; |
|
this._binding.onerror = function(message, errno) { |
|
// there is no way to cleanly recover. |
|
// continuing only obscures problems. |
|
self._binding = null; |
|
self._hadError = true; |
|
|
|
var error = new Error(message); |
|
error.errno = errno; |
|
error.code = exports.codes[errno]; |
|
self.emit('error', error); |
|
}; |
|
|
|
var level = exports.Z_DEFAULT_COMPRESSION; |
|
if (typeof opts.level === 'number') level = opts.level; |
|
|
|
var strategy = exports.Z_DEFAULT_STRATEGY; |
|
if (typeof opts.strategy === 'number') strategy = opts.strategy; |
|
|
|
this._binding.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, |
|
level, |
|
opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, |
|
strategy, |
|
opts.dictionary); |
|
|
|
this._buffer = new Buffer(this._chunkSize); |
|
this._offset = 0; |
|
this._closed = false; |
|
this._level = level; |
|
this._strategy = strategy; |
|
|
|
this.once('end', this.close); |
|
} |
|
|
|
util.inherits(Zlib, Transform); |
|
|
|
Zlib.prototype.params = function(level, strategy, callback) { |
|
if (level < exports.Z_MIN_LEVEL || |
|
level > exports.Z_MAX_LEVEL) { |
|
throw new RangeError('Invalid compression level: ' + level); |
|
} |
|
if (strategy != exports.Z_FILTERED && |
|
strategy != exports.Z_HUFFMAN_ONLY && |
|
strategy != exports.Z_RLE && |
|
strategy != exports.Z_FIXED && |
|
strategy != exports.Z_DEFAULT_STRATEGY) { |
|
throw new TypeError('Invalid strategy: ' + strategy); |
|
} |
|
|
|
if (this._level !== level || this._strategy !== strategy) { |
|
var self = this; |
|
this.flush(binding.Z_SYNC_FLUSH, function() { |
|
self._binding.params(level, strategy); |
|
if (!self._hadError) { |
|
self._level = level; |
|
self._strategy = strategy; |
|
if (callback) callback(); |
|
} |
|
}); |
|
} else { |
|
process.nextTick(callback); |
|
} |
|
}; |
|
|
|
Zlib.prototype.reset = function() { |
|
return this._binding.reset(); |
|
}; |
|
|
|
// This is the _flush function called by the transform class, |
|
// internally, when the last chunk has been written. |
|
Zlib.prototype._flush = function(callback) { |
|
this._transform(new Buffer(0), '', callback); |
|
}; |
|
|
|
Zlib.prototype.flush = function(kind, callback) { |
|
var ws = this._writableState; |
|
|
|
if (typeof kind === 'function' || (kind === void 0 && !callback)) { |
|
callback = kind; |
|
kind = binding.Z_FULL_FLUSH; |
|
} |
|
|
|
if (ws.ended) { |
|
if (callback) |
|
process.nextTick(callback); |
|
} else if (ws.ending) { |
|
if (callback) |
|
this.once('end', callback); |
|
} else if (ws.needDrain) { |
|
var self = this; |
|
this.once('drain', function() { |
|
self.flush(callback); |
|
}); |
|
} else { |
|
this._flushFlag = kind; |
|
this.write(new Buffer(0), '', callback); |
|
} |
|
}; |
|
|
|
Zlib.prototype.close = function(callback) { |
|
if (callback) |
|
process.nextTick(callback); |
|
|
|
if (this._closed) |
|
return; |
|
|
|
this._closed = true; |
|
|
|
this._binding.close(); |
|
|
|
var self = this; |
|
process.nextTick(function() { |
|
self.emit('close'); |
|
}); |
|
}; |
|
|
|
Zlib.prototype._transform = function(chunk, encoding, cb) { |
|
var flushFlag; |
|
var ws = this._writableState; |
|
var ending = ws.ending || ws.ended; |
|
var last = ending && (!chunk || ws.length === chunk.length); |
|
|
|
if (!chunk === null && !Buffer.isBuffer(chunk)) |
|
return cb(new Error('invalid input')); |
|
|
|
// If it's the last chunk, or a final flush, we use the Z_FINISH flush flag. |
|
// If it's explicitly flushing at some other time, then we use |
|
// Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression |
|
// goodness. |
|
if (last) |
|
flushFlag = binding.Z_FINISH; |
|
else { |
|
flushFlag = this._flushFlag; |
|
// once we've flushed the last of the queue, stop flushing and |
|
// go back to the normal behavior. |
|
if (chunk.length >= ws.length) { |
|
this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH; |
|
} |
|
} |
|
|
|
var self = this; |
|
this._processChunk(chunk, flushFlag, cb); |
|
}; |
|
|
|
Zlib.prototype._processChunk = function(chunk, flushFlag, cb) { |
|
var availInBefore = chunk && chunk.length; |
|
var availOutBefore = this._chunkSize - this._offset; |
|
var inOff = 0; |
|
|
|
var self = this; |
|
|
|
var async = typeof cb === 'function'; |
|
|
|
if (!async) { |
|
var buffers = []; |
|
var nread = 0; |
|
|
|
var error; |
|
this.on('error', function(er) { |
|
error = er; |
|
}); |
|
|
|
do { |
|
var res = this._binding.writeSync(flushFlag, |
|
chunk, // in |
|
inOff, // in_off |
|
availInBefore, // in_len |
|
this._buffer, // out |
|
this._offset, //out_off |
|
availOutBefore); // out_len |
|
} while (!this._hadError && callback(res[0], res[1])); |
|
|
|
if (this._hadError) { |
|
throw error; |
|
} |
|
|
|
var buf = Buffer.concat(buffers, nread); |
|
this.close(); |
|
|
|
return buf; |
|
} |
|
|
|
var req = this._binding.write(flushFlag, |
|
chunk, // in |
|
inOff, // in_off |
|
availInBefore, // in_len |
|
this._buffer, // out |
|
this._offset, //out_off |
|
availOutBefore); // out_len |
|
|
|
req.buffer = chunk; |
|
req.callback = callback; |
|
|
|
function callback(availInAfter, availOutAfter) { |
|
if (self._hadError) |
|
return; |
|
|
|
var have = availOutBefore - availOutAfter; |
|
assert(have >= 0, 'have should not go down'); |
|
|
|
if (have > 0) { |
|
var out = self._buffer.slice(self._offset, self._offset + have); |
|
self._offset += have; |
|
// serve some output to the consumer. |
|
if (async) { |
|
self.push(out); |
|
} else { |
|
buffers.push(out); |
|
nread += out.length; |
|
} |
|
} |
|
|
|
// exhausted the output buffer, or used all the input create a new one. |
|
if (availOutAfter === 0 || self._offset >= self._chunkSize) { |
|
availOutBefore = self._chunkSize; |
|
self._offset = 0; |
|
self._buffer = new Buffer(self._chunkSize); |
|
} |
|
|
|
if (availOutAfter === 0) { |
|
// Not actually done. Need to reprocess. |
|
// Also, update the availInBefore to the availInAfter value, |
|
// so that if we have to hit it a third (fourth, etc.) time, |
|
// it'll have the correct byte counts. |
|
inOff += (availInBefore - availInAfter); |
|
availInBefore = availInAfter; |
|
|
|
if (!async) |
|
return true; |
|
|
|
var newReq = self._binding.write(flushFlag, |
|
chunk, |
|
inOff, |
|
availInBefore, |
|
self._buffer, |
|
self._offset, |
|
self._chunkSize); |
|
newReq.callback = callback; // this same function |
|
newReq.buffer = chunk; |
|
return; |
|
} |
|
|
|
if (!async) |
|
return false; |
|
|
|
// finished with the chunk. |
|
cb(); |
|
} |
|
}; |
|
|
|
util.inherits(Deflate, Zlib); |
|
util.inherits(Inflate, Zlib); |
|
util.inherits(Gzip, Zlib); |
|
util.inherits(Gunzip, Zlib); |
|
util.inherits(DeflateRaw, Zlib); |
|
util.inherits(InflateRaw, Zlib); |
|
util.inherits(Unzip, Zlib); |
|
|
|
}).call(this,require('_process'),require("buffer").Buffer) |
|
},{"./binding":170,"_process":323,"_stream_transform":337,"assert":157,"buffer":172,"util":343}],172:[function(require,module,exports){ |
|
/*! |
|
* The buffer module from node.js, for the browser. |
|
* |
|
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> |
|
* @license MIT |
|
*/ |
|
|
|
var base64 = require('base64-js') |
|
var ieee754 = require('ieee754') |
|
var isArray = require('is-array') |
|
|
|
exports.Buffer = Buffer |
|
exports.SlowBuffer = SlowBuffer |
|
exports.INSPECT_MAX_BYTES = 50 |
|
Buffer.poolSize = 8192 // not used by this implementation |
|
|
|
var kMaxLength = 0x3fffffff |
|
var rootParent = {} |
|
|
|
/** |
|
* If `Buffer.TYPED_ARRAY_SUPPORT`: |
|
* === true Use Uint8Array implementation (fastest) |
|
* === false Use Object implementation (most compatible, even IE6) |
|
* |
|
* Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, |
|
* Opera 11.6+, iOS 4.2+. |
|
* |
|
* Note: |
|
* |
|
* - Implementation must support adding new properties to `Uint8Array` instances. |
|
* Firefox 4-29 lacked support, fixed in Firefox 30+. |
|
* See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438. |
|
* |
|
* - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function. |
|
* |
|
* - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of |
|
* incorrect length in some situations. |
|
* |
|
* We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they will |
|
* get the Object implementation, which is slower but will work correctly. |
|
*/ |
|
Buffer.TYPED_ARRAY_SUPPORT = (function () { |
|
try { |
|
var buf = new ArrayBuffer(0) |
|
var arr = new Uint8Array(buf) |
|
arr.foo = function () { return 42 } |
|
return arr.foo() === 42 && // typed array instances can be augmented |
|
typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray` |
|
new Uint8Array(1).subarray(1, 1).byteLength === 0 // ie10 has broken `subarray` |
|
} catch (e) { |
|
return false |
|
} |
|
})() |
|
|
|
/** |
|
* Class: Buffer |
|
* ============= |
|
* |
|
* The Buffer constructor returns instances of `Uint8Array` that are augmented |
|
* with function properties for all the node `Buffer` API functions. We use |
|
* `Uint8Array` so that square bracket notation works as expected -- it returns |
|
* a single octet. |
|
* |
|
* By augmenting the instances, we can avoid modifying the `Uint8Array` |
|
* prototype. |
|
*/ |
|
function Buffer (subject, encoding) { |
|
var self = this |
|
if (!(self instanceof Buffer)) return new Buffer(subject, encoding) |
|
|
|
var type = typeof subject |
|
var length |
|
|
|
if (type === 'number') { |
|
length = +subject |
|
} else if (type === 'string') { |
|
length = Buffer.byteLength(subject, encoding) |
|
} else if (type === 'object' && subject !== null) { |
|
// assume object is array-like |
|
if (subject.type === 'Buffer' && isArray(subject.data)) subject = subject.data |
|
length = +subject.length |
|
} else { |
|
throw new TypeError('must start with number, buffer, array or string') |
|
} |
|
|
|
if (length > kMaxLength) { |
|
throw new RangeError('Attempt to allocate Buffer larger than maximum size: 0x' + |
|
kMaxLength.toString(16) + ' bytes') |
|
} |
|
|
|
if (length < 0) length = 0 |
|
else length >>>= 0 // coerce to uint32 |
|
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
// Preferred: Return an augmented `Uint8Array` instance for best performance |
|
self = Buffer._augment(new Uint8Array(length)) // eslint-disable-line consistent-this |
|
} else { |
|
// Fallback: Return THIS instance of Buffer (created by `new`) |
|
self.length = length |
|
self._isBuffer = true |
|
} |
|
|
|
var i |
|
if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') { |
|
// Speed optimization -- use set if we're copying from a typed array |
|
self._set(subject) |
|
} else if (isArrayish(subject)) { |
|
// Treat array-ish objects as a byte array |
|
if (Buffer.isBuffer(subject)) { |
|
for (i = 0; i < length; i++) { |
|
self[i] = subject.readUInt8(i) |
|
} |
|
} else { |
|
for (i = 0; i < length; i++) { |
|
self[i] = ((subject[i] % 256) + 256) % 256 |
|
} |
|
} |
|
} else if (type === 'string') { |
|
self.write(subject, 0, encoding) |
|
} else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT) { |
|
for (i = 0; i < length; i++) { |
|
self[i] = 0 |
|
} |
|
} |
|
|
|
if (length > 0 && length <= Buffer.poolSize) self.parent = rootParent |
|
|
|
return self |
|
} |
|
|
|
function SlowBuffer (subject, encoding) { |
|
if (!(this instanceof SlowBuffer)) return new SlowBuffer(subject, encoding) |
|
|
|
var buf = new Buffer(subject, encoding) |
|
delete buf.parent |
|
return buf |
|
} |
|
|
|
Buffer.isBuffer = function isBuffer (b) { |
|
return !!(b != null && b._isBuffer) |
|
} |
|
|
|
Buffer.compare = function compare (a, b) { |
|
if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) { |
|
throw new TypeError('Arguments must be Buffers') |
|
} |
|
|
|
if (a === b) return 0 |
|
|
|
var x = a.length |
|
var y = b.length |
|
for (var i = 0, len = Math.min(x, y); i < len && a[i] === b[i]; i++) {} |
|
if (i !== len) { |
|
x = a[i] |
|
y = b[i] |
|
} |
|
if (x < y) return -1 |
|
if (y < x) return 1 |
|
return 0 |
|
} |
|
|
|
Buffer.isEncoding = function isEncoding (encoding) { |
|
switch (String(encoding).toLowerCase()) { |
|
case 'hex': |
|
case 'utf8': |
|
case 'utf-8': |
|
case 'ascii': |
|
case 'binary': |
|
case 'base64': |
|
case 'raw': |
|
case 'ucs2': |
|
case 'ucs-2': |
|
case 'utf16le': |
|
case 'utf-16le': |
|
return true |
|
default: |
|
return false |
|
} |
|
} |
|
|
|
Buffer.concat = function concat (list, totalLength) { |
|
if (!isArray(list)) throw new TypeError('list argument must be an Array of Buffers.') |
|
|
|
if (list.length === 0) { |
|
return new Buffer(0) |
|
} else if (list.length === 1) { |
|
return list[0] |
|
} |
|
|
|
var i |
|
if (totalLength === undefined) { |
|
totalLength = 0 |
|
for (i = 0; i < list.length; i++) { |
|
totalLength += list[i].length |
|
} |
|
} |
|
|
|
var buf = new Buffer(totalLength) |
|
var pos = 0 |
|
for (i = 0; i < list.length; i++) { |
|
var item = list[i] |
|
item.copy(buf, pos) |
|
pos += item.length |
|
} |
|
return buf |
|
} |
|
|
|
Buffer.byteLength = function byteLength (str, encoding) { |
|
var ret |
|
str = str + '' |
|
switch (encoding || 'utf8') { |
|
case 'ascii': |
|
case 'binary': |
|
case 'raw': |
|
ret = str.length |
|
break |
|
case 'ucs2': |
|
case 'ucs-2': |
|
case 'utf16le': |
|
case 'utf-16le': |
|
ret = str.length * 2 |
|
break |
|
case 'hex': |
|
ret = str.length >>> 1 |
|
break |
|
case 'utf8': |
|
case 'utf-8': |
|
ret = utf8ToBytes(str).length |
|
break |
|
case 'base64': |
|
ret = base64ToBytes(str).length |
|
break |
|
default: |
|
ret = str.length |
|
} |
|
return ret |
|
} |
|
|
|
// pre-set for values that may exist in the future |
|
Buffer.prototype.length = undefined |
|
Buffer.prototype.parent = undefined |
|
|
|
// toString(encoding, start=0, end=buffer.length) |
|
Buffer.prototype.toString = function toString (encoding, start, end) { |
|
var loweredCase = false |
|
|
|
start = start >>> 0 |
|
end = end === undefined || end === Infinity ? this.length : end >>> 0 |
|
|
|
if (!encoding) encoding = 'utf8' |
|
if (start < 0) start = 0 |
|
if (end > this.length) end = this.length |
|
if (end <= start) return '' |
|
|
|
while (true) { |
|
switch (encoding) { |
|
case 'hex': |
|
return hexSlice(this, start, end) |
|
|
|
case 'utf8': |
|
case 'utf-8': |
|
return utf8Slice(this, start, end) |
|
|
|
case 'ascii': |
|
return asciiSlice(this, start, end) |
|
|
|
case 'binary': |
|
return binarySlice(this, start, end) |
|
|
|
case 'base64': |
|
return base64Slice(this, start, end) |
|
|
|
case 'ucs2': |
|
case 'ucs-2': |
|
case 'utf16le': |
|
case 'utf-16le': |
|
return utf16leSlice(this, start, end) |
|
|
|
default: |
|
if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) |
|
encoding = (encoding + '').toLowerCase() |
|
loweredCase = true |
|
} |
|
} |
|
} |
|
|
|
Buffer.prototype.equals = function equals (b) { |
|
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') |
|
if (this === b) return true |
|
return Buffer.compare(this, b) === 0 |
|
} |
|
|
|
Buffer.prototype.inspect = function inspect () { |
|
var str = '' |
|
var max = exports.INSPECT_MAX_BYTES |
|
if (this.length > 0) { |
|
str = this.toString('hex', 0, max).match(/.{2}/g).join(' ') |
|
if (this.length > max) str += ' ... ' |
|
} |
|
return '<Buffer ' + str + '>' |
|
} |
|
|
|
Buffer.prototype.compare = function compare (b) { |
|
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') |
|
if (this === b) return 0 |
|
return Buffer.compare(this, b) |
|
} |
|
|
|
Buffer.prototype.indexOf = function indexOf (val, byteOffset) { |
|
if (byteOffset > 0x7fffffff) byteOffset = 0x7fffffff |
|
else if (byteOffset < -0x80000000) byteOffset = -0x80000000 |
|
byteOffset >>= 0 |
|
|
|
if (this.length === 0) return -1 |
|
if (byteOffset >= this.length) return -1 |
|
|
|
// Negative offsets start from the end of the buffer |
|
if (byteOffset < 0) byteOffset = Math.max(this.length + byteOffset, 0) |
|
|
|
if (typeof val === 'string') { |
|
if (val.length === 0) return -1 // special case: looking for empty string always fails |
|
return String.prototype.indexOf.call(this, val, byteOffset) |
|
} |
|
if (Buffer.isBuffer(val)) { |
|
return arrayIndexOf(this, val, byteOffset) |
|
} |
|
if (typeof val === 'number') { |
|
if (Buffer.TYPED_ARRAY_SUPPORT && Uint8Array.prototype.indexOf === 'function') { |
|
return Uint8Array.prototype.indexOf.call(this, val, byteOffset) |
|
} |
|
return arrayIndexOf(this, [ val ], byteOffset) |
|
} |
|
|
|
function arrayIndexOf (arr, val, byteOffset) { |
|
var foundIndex = -1 |
|
for (var i = 0; byteOffset + i < arr.length; i++) { |
|
if (arr[byteOffset + i] === val[foundIndex === -1 ? 0 : i - foundIndex]) { |
|
if (foundIndex === -1) foundIndex = i |
|
if (i - foundIndex + 1 === val.length) return byteOffset + foundIndex |
|
} else { |
|
foundIndex = -1 |
|
} |
|
} |
|
return -1 |
|
} |
|
|
|
throw new TypeError('val must be string, number or Buffer') |
|
} |
|
|
|
// `get` will be removed in Node 0.13+ |
|
Buffer.prototype.get = function get (offset) { |
|
console.log('.get() is deprecated. Access using array indexes instead.') |
|
return this.readUInt8(offset) |
|
} |
|
|
|
// `set` will be removed in Node 0.13+ |
|
Buffer.prototype.set = function set (v, offset) { |
|
console.log('.set() is deprecated. Access using array indexes instead.') |
|
return this.writeUInt8(v, offset) |
|
} |
|
|
|
function hexWrite (buf, string, offset, length) { |
|
offset = Number(offset) || 0 |
|
var remaining = buf.length - offset |
|
if (!length) { |
|
length = remaining |
|
} else { |
|
length = Number(length) |
|
if (length > remaining) { |
|
length = remaining |
|
} |
|
} |
|
|
|
// must be an even number of digits |
|
var strLen = string.length |
|
if (strLen % 2 !== 0) throw new Error('Invalid hex string') |
|
|
|
if (length > strLen / 2) { |
|
length = strLen / 2 |
|
} |
|
for (var i = 0; i < length; i++) { |
|
var parsed = parseInt(string.substr(i * 2, 2), 16) |
|
if (isNaN(parsed)) throw new Error('Invalid hex string') |
|
buf[offset + i] = parsed |
|
} |
|
return i |
|
} |
|
|
|
function utf8Write (buf, string, offset, length) { |
|
var charsWritten = blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length) |
|
return charsWritten |
|
} |
|
|
|
function asciiWrite (buf, string, offset, length) { |
|
var charsWritten = blitBuffer(asciiToBytes(string), buf, offset, length) |
|
return charsWritten |
|
} |
|
|
|
function binaryWrite (buf, string, offset, length) { |
|
return asciiWrite(buf, string, offset, length) |
|
} |
|
|
|
function base64Write (buf, string, offset, length) { |
|
var charsWritten = blitBuffer(base64ToBytes(string), buf, offset, length) |
|
return charsWritten |
|
} |
|
|
|
function utf16leWrite (buf, string, offset, length) { |
|
var charsWritten = blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length) |
|
return charsWritten |
|
} |
|
|
|
Buffer.prototype.write = function write (string, offset, length, encoding) { |
|
// Support both (string, offset, length, encoding) |
|
// and the legacy (string, encoding, offset, length) |
|
if (isFinite(offset)) { |
|
if (!isFinite(length)) { |
|
encoding = length |
|
length = undefined |
|
} |
|
} else { // legacy |
|
var swap = encoding |
|
encoding = offset |
|
offset = length |
|
length = swap |
|
} |
|
|
|
offset = Number(offset) || 0 |
|
|
|
if (length < 0 || offset < 0 || offset > this.length) { |
|
throw new RangeError('attempt to write outside buffer bounds') |
|
} |
|
|
|
var remaining = this.length - offset |
|
if (!length) { |
|
length = remaining |
|
} else { |
|
length = Number(length) |
|
if (length > remaining) { |
|
length = remaining |
|
} |
|
} |
|
encoding = String(encoding || 'utf8').toLowerCase() |
|
|
|
var ret |
|
switch (encoding) { |
|
case 'hex': |
|
ret = hexWrite(this, string, offset, length) |
|
break |
|
case 'utf8': |
|
case 'utf-8': |
|
ret = utf8Write(this, string, offset, length) |
|
break |
|
case 'ascii': |
|
ret = asciiWrite(this, string, offset, length) |
|
break |
|
case 'binary': |
|
ret = binaryWrite(this, string, offset, length) |
|
break |
|
case 'base64': |
|
ret = base64Write(this, string, offset, length) |
|
break |
|
case 'ucs2': |
|
case 'ucs-2': |
|
case 'utf16le': |
|
case 'utf-16le': |
|
ret = utf16leWrite(this, string, offset, length) |
|
break |
|
default: |
|
throw new TypeError('Unknown encoding: ' + encoding) |
|
} |
|
return ret |
|
} |
|
|
|
Buffer.prototype.toJSON = function toJSON () { |
|
return { |
|
type: 'Buffer', |
|
data: Array.prototype.slice.call(this._arr || this, 0) |
|
} |
|
} |
|
|
|
function base64Slice (buf, start, end) { |
|
if (start === 0 && end === buf.length) { |
|
return base64.fromByteArray(buf) |
|
} else { |
|
return base64.fromByteArray(buf.slice(start, end)) |
|
} |
|
} |
|
|
|
function utf8Slice (buf, start, end) { |
|
var res = '' |
|
var tmp = '' |
|
end = Math.min(buf.length, end) |
|
|
|
for (var i = start; i < end; i++) { |
|
if (buf[i] <= 0x7F) { |
|
res += decodeUtf8Char(tmp) + String.fromCharCode(buf[i]) |
|
tmp = '' |
|
} else { |
|
tmp += '%' + buf[i].toString(16) |
|
} |
|
} |
|
|
|
return res + decodeUtf8Char(tmp) |
|
} |
|
|
|
function asciiSlice (buf, start, end) { |
|
var ret = '' |
|
end = Math.min(buf.length, end) |
|
|
|
for (var i = start; i < end; i++) { |
|
ret += String.fromCharCode(buf[i] & 0x7F) |
|
} |
|
return ret |
|
} |
|
|
|
function binarySlice (buf, start, end) { |
|
var ret = '' |
|
end = Math.min(buf.length, end) |
|
|
|
for (var i = start; i < end; i++) { |
|
ret += String.fromCharCode(buf[i]) |
|
} |
|
return ret |
|
} |
|
|
|
function hexSlice (buf, start, end) { |
|
var len = buf.length |
|
|
|
if (!start || start < 0) start = 0 |
|
if (!end || end < 0 || end > len) end = len |
|
|
|
var out = '' |
|
for (var i = start; i < end; i++) { |
|
out += toHex(buf[i]) |
|
} |
|
return out |
|
} |
|
|
|
function utf16leSlice (buf, start, end) { |
|
var bytes = buf.slice(start, end) |
|
var res = '' |
|
for (var i = 0; i < bytes.length; i += 2) { |
|
res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256) |
|
} |
|
return res |
|
} |
|
|
|
Buffer.prototype.slice = function slice (start, end) { |
|
var len = this.length |
|
start = ~~start |
|
end = end === undefined ? len : ~~end |
|
|
|
if (start < 0) { |
|
start += len |
|
if (start < 0) start = 0 |
|
} else if (start > len) { |
|
start = len |
|
} |
|
|
|
if (end < 0) { |
|
end += len |
|
if (end < 0) end = 0 |
|
} else if (end > len) { |
|
end = len |
|
} |
|
|
|
if (end < start) end = start |
|
|
|
var newBuf |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
newBuf = Buffer._augment(this.subarray(start, end)) |
|
} else { |
|
var sliceLen = end - start |
|
newBuf = new Buffer(sliceLen, undefined) |
|
for (var i = 0; i < sliceLen; i++) { |
|
newBuf[i] = this[i + start] |
|
} |
|
} |
|
|
|
if (newBuf.length) newBuf.parent = this.parent || this |
|
|
|
return newBuf |
|
} |
|
|
|
/* |
|
* Need to make sure that buffer isn't trying to write out of bounds. |
|
*/ |
|
function checkOffset (offset, ext, length) { |
|
if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint') |
|
if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length') |
|
} |
|
|
|
Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) { |
|
offset = offset >>> 0 |
|
byteLength = byteLength >>> 0 |
|
if (!noAssert) checkOffset(offset, byteLength, this.length) |
|
|
|
var val = this[offset] |
|
var mul = 1 |
|
var i = 0 |
|
while (++i < byteLength && (mul *= 0x100)) { |
|
val += this[offset + i] * mul |
|
} |
|
|
|
return val |
|
} |
|
|
|
Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) { |
|
offset = offset >>> 0 |
|
byteLength = byteLength >>> 0 |
|
if (!noAssert) { |
|
checkOffset(offset, byteLength, this.length) |
|
} |
|
|
|
var val = this[offset + --byteLength] |
|
var mul = 1 |
|
while (byteLength > 0 && (mul *= 0x100)) { |
|
val += this[offset + --byteLength] * mul |
|
} |
|
|
|
return val |
|
} |
|
|
|
Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 1, this.length) |
|
return this[offset] |
|
} |
|
|
|
Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 2, this.length) |
|
return this[offset] | (this[offset + 1] << 8) |
|
} |
|
|
|
Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 2, this.length) |
|
return (this[offset] << 8) | this[offset + 1] |
|
} |
|
|
|
Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 4, this.length) |
|
|
|
return ((this[offset]) | |
|
(this[offset + 1] << 8) | |
|
(this[offset + 2] << 16)) + |
|
(this[offset + 3] * 0x1000000) |
|
} |
|
|
|
Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 4, this.length) |
|
|
|
return (this[offset] * 0x1000000) + |
|
((this[offset + 1] << 16) | |
|
(this[offset + 2] << 8) | |
|
this[offset + 3]) |
|
} |
|
|
|
Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) { |
|
offset = offset >>> 0 |
|
byteLength = byteLength >>> 0 |
|
if (!noAssert) checkOffset(offset, byteLength, this.length) |
|
|
|
var val = this[offset] |
|
var mul = 1 |
|
var i = 0 |
|
while (++i < byteLength && (mul *= 0x100)) { |
|
val += this[offset + i] * mul |
|
} |
|
mul *= 0x80 |
|
|
|
if (val >= mul) val -= Math.pow(2, 8 * byteLength) |
|
|
|
return val |
|
} |
|
|
|
Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) { |
|
offset = offset >>> 0 |
|
byteLength = byteLength >>> 0 |
|
if (!noAssert) checkOffset(offset, byteLength, this.length) |
|
|
|
var i = byteLength |
|
var mul = 1 |
|
var val = this[offset + --i] |
|
while (i > 0 && (mul *= 0x100)) { |
|
val += this[offset + --i] * mul |
|
} |
|
mul *= 0x80 |
|
|
|
if (val >= mul) val -= Math.pow(2, 8 * byteLength) |
|
|
|
return val |
|
} |
|
|
|
Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 1, this.length) |
|
if (!(this[offset] & 0x80)) return (this[offset]) |
|
return ((0xff - this[offset] + 1) * -1) |
|
} |
|
|
|
Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 2, this.length) |
|
var val = this[offset] | (this[offset + 1] << 8) |
|
return (val & 0x8000) ? val | 0xFFFF0000 : val |
|
} |
|
|
|
Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 2, this.length) |
|
var val = this[offset + 1] | (this[offset] << 8) |
|
return (val & 0x8000) ? val | 0xFFFF0000 : val |
|
} |
|
|
|
Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 4, this.length) |
|
|
|
return (this[offset]) | |
|
(this[offset + 1] << 8) | |
|
(this[offset + 2] << 16) | |
|
(this[offset + 3] << 24) |
|
} |
|
|
|
Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 4, this.length) |
|
|
|
return (this[offset] << 24) | |
|
(this[offset + 1] << 16) | |
|
(this[offset + 2] << 8) | |
|
(this[offset + 3]) |
|
} |
|
|
|
Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 4, this.length) |
|
return ieee754.read(this, offset, true, 23, 4) |
|
} |
|
|
|
Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 4, this.length) |
|
return ieee754.read(this, offset, false, 23, 4) |
|
} |
|
|
|
Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 8, this.length) |
|
return ieee754.read(this, offset, true, 52, 8) |
|
} |
|
|
|
Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) { |
|
if (!noAssert) checkOffset(offset, 8, this.length) |
|
return ieee754.read(this, offset, false, 52, 8) |
|
} |
|
|
|
function checkInt (buf, value, offset, ext, max, min) { |
|
if (!Buffer.isBuffer(buf)) throw new TypeError('buffer must be a Buffer instance') |
|
if (value > max || value < min) throw new RangeError('value is out of bounds') |
|
if (offset + ext > buf.length) throw new RangeError('index out of range') |
|
} |
|
|
|
Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
byteLength = byteLength >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0) |
|
|
|
var mul = 1 |
|
var i = 0 |
|
this[offset] = value & 0xFF |
|
while (++i < byteLength && (mul *= 0x100)) { |
|
this[offset + i] = (value / mul) >>> 0 & 0xFF |
|
} |
|
|
|
return offset + byteLength |
|
} |
|
|
|
Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
byteLength = byteLength >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0) |
|
|
|
var i = byteLength - 1 |
|
var mul = 1 |
|
this[offset + i] = value & 0xFF |
|
while (--i >= 0 && (mul *= 0x100)) { |
|
this[offset + i] = (value / mul) >>> 0 & 0xFF |
|
} |
|
|
|
return offset + byteLength |
|
} |
|
|
|
Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0) |
|
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value) |
|
this[offset] = value |
|
return offset + 1 |
|
} |
|
|
|
function objectWriteUInt16 (buf, value, offset, littleEndian) { |
|
if (value < 0) value = 0xffff + value + 1 |
|
for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) { |
|
buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>> |
|
(littleEndian ? i : 1 - i) * 8 |
|
} |
|
} |
|
|
|
Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = value |
|
this[offset + 1] = (value >>> 8) |
|
} else { |
|
objectWriteUInt16(this, value, offset, true) |
|
} |
|
return offset + 2 |
|
} |
|
|
|
Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = (value >>> 8) |
|
this[offset + 1] = value |
|
} else { |
|
objectWriteUInt16(this, value, offset, false) |
|
} |
|
return offset + 2 |
|
} |
|
|
|
function objectWriteUInt32 (buf, value, offset, littleEndian) { |
|
if (value < 0) value = 0xffffffff + value + 1 |
|
for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) { |
|
buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff |
|
} |
|
} |
|
|
|
Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset + 3] = (value >>> 24) |
|
this[offset + 2] = (value >>> 16) |
|
this[offset + 1] = (value >>> 8) |
|
this[offset] = value |
|
} else { |
|
objectWriteUInt32(this, value, offset, true) |
|
} |
|
return offset + 4 |
|
} |
|
|
|
Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = (value >>> 24) |
|
this[offset + 1] = (value >>> 16) |
|
this[offset + 2] = (value >>> 8) |
|
this[offset + 3] = value |
|
} else { |
|
objectWriteUInt32(this, value, offset, false) |
|
} |
|
return offset + 4 |
|
} |
|
|
|
Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) { |
|
checkInt( |
|
this, value, offset, byteLength, |
|
Math.pow(2, 8 * byteLength - 1) - 1, |
|
-Math.pow(2, 8 * byteLength - 1) |
|
) |
|
} |
|
|
|
var i = 0 |
|
var mul = 1 |
|
var sub = value < 0 ? 1 : 0 |
|
this[offset] = value & 0xFF |
|
while (++i < byteLength && (mul *= 0x100)) { |
|
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF |
|
} |
|
|
|
return offset + byteLength |
|
} |
|
|
|
Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) { |
|
checkInt( |
|
this, value, offset, byteLength, |
|
Math.pow(2, 8 * byteLength - 1) - 1, |
|
-Math.pow(2, 8 * byteLength - 1) |
|
) |
|
} |
|
|
|
var i = byteLength - 1 |
|
var mul = 1 |
|
var sub = value < 0 ? 1 : 0 |
|
this[offset + i] = value & 0xFF |
|
while (--i >= 0 && (mul *= 0x100)) { |
|
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF |
|
} |
|
|
|
return offset + byteLength |
|
} |
|
|
|
Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80) |
|
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value) |
|
if (value < 0) value = 0xff + value + 1 |
|
this[offset] = value |
|
return offset + 1 |
|
} |
|
|
|
Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = value |
|
this[offset + 1] = (value >>> 8) |
|
} else { |
|
objectWriteUInt16(this, value, offset, true) |
|
} |
|
return offset + 2 |
|
} |
|
|
|
Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = (value >>> 8) |
|
this[offset + 1] = value |
|
} else { |
|
objectWriteUInt16(this, value, offset, false) |
|
} |
|
return offset + 2 |
|
} |
|
|
|
Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = value |
|
this[offset + 1] = (value >>> 8) |
|
this[offset + 2] = (value >>> 16) |
|
this[offset + 3] = (value >>> 24) |
|
} else { |
|
objectWriteUInt32(this, value, offset, true) |
|
} |
|
return offset + 4 |
|
} |
|
|
|
Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) { |
|
value = +value |
|
offset = offset >>> 0 |
|
if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) |
|
if (value < 0) value = 0xffffffff + value + 1 |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
this[offset] = (value >>> 24) |
|
this[offset + 1] = (value >>> 16) |
|
this[offset + 2] = (value >>> 8) |
|
this[offset + 3] = value |
|
} else { |
|
objectWriteUInt32(this, value, offset, false) |
|
} |
|
return offset + 4 |
|
} |
|
|
|
function checkIEEE754 (buf, value, offset, ext, max, min) { |
|
if (value > max || value < min) throw new RangeError('value is out of bounds') |
|
if (offset + ext > buf.length) throw new RangeError('index out of range') |
|
if (offset < 0) throw new RangeError('index out of range') |
|
} |
|
|
|
function writeFloat (buf, value, offset, littleEndian, noAssert) { |
|
if (!noAssert) { |
|
checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38) |
|
} |
|
ieee754.write(buf, value, offset, littleEndian, 23, 4) |
|
return offset + 4 |
|
} |
|
|
|
Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) { |
|
return writeFloat(this, value, offset, true, noAssert) |
|
} |
|
|
|
Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) { |
|
return writeFloat(this, value, offset, false, noAssert) |
|
} |
|
|
|
function writeDouble (buf, value, offset, littleEndian, noAssert) { |
|
if (!noAssert) { |
|
checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308) |
|
} |
|
ieee754.write(buf, value, offset, littleEndian, 52, 8) |
|
return offset + 8 |
|
} |
|
|
|
Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) { |
|
return writeDouble(this, value, offset, true, noAssert) |
|
} |
|
|
|
Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) { |
|
return writeDouble(this, value, offset, false, noAssert) |
|
} |
|
|
|
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) |
|
Buffer.prototype.copy = function copy (target, target_start, start, end) { |
|
if (!start) start = 0 |
|
if (!end && end !== 0) end = this.length |
|
if (target_start >= target.length) target_start = target.length |
|
if (!target_start) target_start = 0 |
|
if (end > 0 && end < start) end = start |
|
|
|
// Copy 0 bytes; we're done |
|
if (end === start) return 0 |
|
if (target.length === 0 || this.length === 0) return 0 |
|
|
|
// Fatal error conditions |
|
if (target_start < 0) { |
|
throw new RangeError('targetStart out of bounds') |
|
} |
|
if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds') |
|
if (end < 0) throw new RangeError('sourceEnd out of bounds') |
|
|
|
// Are we oob? |
|
if (end > this.length) end = this.length |
|
if (target.length - target_start < end - start) { |
|
end = target.length - target_start + start |
|
} |
|
|
|
var len = end - start |
|
|
|
if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) { |
|
for (var i = 0; i < len; i++) { |
|
target[i + target_start] = this[i + start] |
|
} |
|
} else { |
|
target._set(this.subarray(start, start + len), target_start) |
|
} |
|
|
|
return len |
|
} |
|
|
|
// fill(value, start=0, end=buffer.length) |
|
Buffer.prototype.fill = function fill (value, start, end) { |
|
if (!value) value = 0 |
|
if (!start) start = 0 |
|
if (!end) end = this.length |
|
|
|
if (end < start) throw new RangeError('end < start') |
|
|
|
// Fill 0 bytes; we're done |
|
if (end === start) return |
|
if (this.length === 0) return |
|
|
|
if (start < 0 || start >= this.length) throw new RangeError('start out of bounds') |
|
if (end < 0 || end > this.length) throw new RangeError('end out of bounds') |
|
|
|
var i |
|
if (typeof value === 'number') { |
|
for (i = start; i < end; i++) { |
|
this[i] = value |
|
} |
|
} else { |
|
var bytes = utf8ToBytes(value.toString()) |
|
var len = bytes.length |
|
for (i = start; i < end; i++) { |
|
this[i] = bytes[i % len] |
|
} |
|
} |
|
|
|
return this |
|
} |
|
|
|
/** |
|
* Creates a new `ArrayBuffer` with the *copied* memory of the buffer instance. |
|
* Added in Node 0.12. Only available in browsers that support ArrayBuffer. |
|
*/ |
|
Buffer.prototype.toArrayBuffer = function toArrayBuffer () { |
|
if (typeof Uint8Array !== 'undefined') { |
|
if (Buffer.TYPED_ARRAY_SUPPORT) { |
|
return (new Buffer(this)).buffer |
|
} else { |
|
var buf = new Uint8Array(this.length) |
|
for (var i = 0, len = buf.length; i < len; i += 1) { |
|
buf[i] = this[i] |
|
} |
|
return buf.buffer |
|
} |
|
} else { |
|
throw new TypeError('Buffer.toArrayBuffer not supported in this browser') |
|
} |
|
} |
|
|
|
// HELPER FUNCTIONS |
|
// ================ |
|
|
|
var BP = Buffer.prototype |
|
|
|
/** |
|
* Augment a Uint8Array *instance* (not the Uint8Array class!) with Buffer methods |
|
*/ |
|
Buffer._augment = function _augment (arr) { |
|
arr.constructor = Buffer |
|
arr._isBuffer = true |
|
|
|
// save reference to original Uint8Array set method before overwriting |
|
arr._set = arr.set |
|
|
|
// deprecated, will be removed in node 0.13+ |
|
arr.get = BP.get |
|
arr.set = BP.set |
|
|
|
arr.write = BP.write |
|
arr.toString = BP.toString |
|
arr.toLocaleString = BP.toString |
|
arr.toJSON = BP.toJSON |
|
arr.equals = BP.equals |
|
arr.compare = BP.compare |
|
arr.indexOf = BP.indexOf |
|
arr.copy = BP.copy |
|
arr.slice = BP.slice |
|
arr.readUIntLE = BP.readUIntLE |
|
arr.readUIntBE = BP.readUIntBE |
|
arr.readUInt8 = BP.readUInt8 |
|
arr.readUInt16LE = BP.readUInt16LE |
|
arr.readUInt16BE = BP.readUInt16BE |
|
arr.readUInt32LE = BP.readUInt32LE |
|
arr.readUInt32BE = BP.readUInt32BE |
|
arr.readIntLE = BP.readIntLE |
|
arr.readIntBE = BP.readIntBE |
|
arr.readInt8 = BP.readInt8 |
|
arr.readInt16LE = BP.readInt16LE |
|
arr.readInt16BE = BP.readInt16BE |
|
arr.readInt32LE = BP.readInt32LE |
|
arr.readInt32BE = BP.readInt32BE |
|
arr.readFloatLE = BP.readFloatLE |
|
arr.readFloatBE = BP.readFloatBE |
|
arr.readDoubleLE = BP.readDoubleLE |
|
arr.readDoubleBE = BP.readDoubleBE |
|
arr.writeUInt8 = BP.writeUInt8 |
|
arr.writeUIntLE = BP.writeUIntLE |
|
arr.writeUIntBE = BP.writeUIntBE |
|
arr.writeUInt16LE = BP.writeUInt16LE |
|
arr.writeUInt16BE = BP.writeUInt16BE |
|
arr.writeUInt32LE = BP.writeUInt32LE |
|
arr.writeUInt32BE = BP.writeUInt32BE |
|
arr.writeIntLE = BP.writeIntLE |
|
arr.writeIntBE = BP.writeIntBE |
|
arr.writeInt8 = BP.writeInt8 |
|
arr.writeInt16LE = BP.writeInt16LE |
|
arr.writeInt16BE = BP.writeInt16BE |
|
arr.writeInt32LE = BP.writeInt32LE |
|
arr.writeInt32BE = BP.writeInt32BE |
|
arr.writeFloatLE = BP.writeFloatLE |
|
arr.writeFloatBE = BP.writeFloatBE |
|
arr.writeDoubleLE = BP.writeDoubleLE |
|
arr.writeDoubleBE = BP.writeDoubleBE |
|
arr.fill = BP.fill |
|
arr.inspect = BP.inspect |
|
arr.toArrayBuffer = BP.toArrayBuffer |
|
|
|
return arr |
|
} |
|
|
|
var INVALID_BASE64_RE = /[^+\/0-9A-z\-]/g |
|
|
|
function base64clean (str) { |
|
// Node strips out invalid characters like \n and \t from the string, base64-js does not |
|
str = stringtrim(str).replace(INVALID_BASE64_RE, '') |
|
// Node converts strings with length < 2 to '' |
|
if (str.length < 2) return '' |
|
// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not |
|
while (str.length % 4 !== 0) { |
|
str = str + '=' |
|
} |
|
return str |
|
} |
|
|
|
function stringtrim (str) { |
|
if (str.trim) return str.trim() |
|
return str.replace(/^\s+|\s+$/g, '') |
|
} |
|
|
|
function isArrayish (subject) { |
|
return isArray(subject) || Buffer.isBuffer(subject) || |
|
subject && typeof subject === 'object' && |
|
typeof subject.length === 'number' |
|
} |
|
|
|
function toHex (n) { |
|
if (n < 16) return '0' + n.toString(16) |
|
return n.toString(16) |
|
} |
|
|
|
function utf8ToBytes (string, units) { |
|
units = units || Infinity |
|
var codePoint |
|
var length = string.length |
|
var leadSurrogate = null |
|
var bytes = [] |
|
var i = 0 |
|
|
|
for (; i < length; i++) { |
|
codePoint = string.charCodeAt(i) |
|
|
|
// is surrogate component |
|
if (codePoint > 0xD7FF && codePoint < 0xE000) { |
|
// last char was a lead |
|
if (leadSurrogate) { |
|
// 2 leads in a row |
|
if (codePoint < 0xDC00) { |
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) |
|
leadSurrogate = codePoint |
|
continue |
|
} else { |
|
// valid surrogate pair |
|
codePoint = leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00 | 0x10000 |
|
leadSurrogate = null |
|
} |
|
} else { |
|
// no lead yet |
|
|
|
if (codePoint > 0xDBFF) { |
|
// unexpected trail |
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) |
|
continue |
|
} else if (i + 1 === length) { |
|
// unpaired lead |
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) |
|
continue |
|
} else { |
|
// valid lead |
|
leadSurrogate = codePoint |
|
continue |
|
} |
|
} |
|
} else if (leadSurrogate) { |
|
// valid bmp char, but last char was a lead |
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) |
|
leadSurrogate = null |
|
} |
|
|
|
// encode utf8 |
|
if (codePoint < 0x80) { |
|
if ((units -= 1) < 0) break |
|
bytes.push(codePoint) |
|
} else if (codePoint < 0x800) { |
|
if ((units -= 2) < 0) break |
|
bytes.push( |
|
codePoint >> 0x6 | 0xC0, |
|
codePoint & 0x3F | 0x80 |
|
) |
|
} else if (codePoint < 0x10000) { |
|
if ((units -= 3) < 0) break |
|
bytes.push( |
|
codePoint >> 0xC | 0xE0, |
|
codePoint >> 0x6 & 0x3F | 0x80, |
|
codePoint & 0x3F | 0x80 |
|
) |
|
} else if (codePoint < 0x200000) { |
|
if ((units -= 4) < 0) break |
|
bytes.push( |
|
codePoint >> 0x12 | 0xF0, |
|
codePoint >> 0xC & 0x3F | 0x80, |
|
codePoint >> 0x6 & 0x3F | 0x80, |
|
codePoint & 0x3F | 0x80 |
|
) |
|
} else { |
|
throw new Error('Invalid code point') |
|
} |
|
} |
|
|
|
return bytes |
|
} |
|
|
|
function asciiToBytes (str) { |
|
var byteArray = [] |
|
for (var i = 0; i < str.length; i++) { |
|
// Node's code seems to be doing this and not & 0x7F.. |
|
byteArray.push(str.charCodeAt(i) & 0xFF) |
|
} |
|
return byteArray |
|
} |
|
|
|
function utf16leToBytes (str, units) { |
|
var c, hi, lo |
|
var byteArray = [] |
|
for (var i = 0; i < str.length; i++) { |
|
if ((units -= 2) < 0) break |
|
|
|
c = str.charCodeAt(i) |
|
hi = c >> 8 |
|
lo = c % 256 |
|
byteArray.push(lo) |
|
byteArray.push(hi) |
|
} |
|
|
|
return byteArray |
|
} |
|
|
|
function base64ToBytes (str) { |
|
return base64.toByteArray(base64clean(str)) |
|
} |
|
|
|
function blitBuffer (src, dst, offset, length) { |
|
for (var i = 0; i < length; i++) { |
|
if ((i + offset >= dst.length) || (i >= src.length)) break |
|
dst[i + offset] = src[i] |
|
} |
|
return i |
|
} |
|
|
|
function decodeUtf8Char (str) { |
|
try { |
|
return decodeURIComponent(str) |
|
} catch (err) { |
|
return String.fromCharCode(0xFFFD) // UTF 8 invalid char |
|
} |
|
} |
|
|
|
},{"base64-js":173,"ieee754":174,"is-array":175}],173:[function(require,module,exports){ |
|
var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; |
|
|
|
;(function (exports) { |
|
'use strict'; |
|
|
|
var Arr = (typeof Uint8Array !== 'undefined') |
|
? Uint8Array |
|
: Array |
|
|
|
var PLUS = '+'.charCodeAt(0) |
|
var SLASH = '/'.charCodeAt(0) |
|
var NUMBER = '0'.charCodeAt(0) |
|
var LOWER = 'a'.charCodeAt(0) |
|
var UPPER = 'A'.charCodeAt(0) |
|
var PLUS_URL_SAFE = '-'.charCodeAt(0) |
|
var SLASH_URL_SAFE = '_'.charCodeAt(0) |
|
|
|
function decode (elt) { |
|
var code = elt.charCodeAt(0) |
|
if (code === PLUS || |
|
code === PLUS_URL_SAFE) |
|
return 62 // '+' |
|
if (code === SLASH || |
|
code === SLASH_URL_SAFE) |
|
return 63 // '/' |
|
if (code < NUMBER) |
|
return -1 //no match |
|
if (code < NUMBER + 10) |
|
return code - NUMBER + 26 + 26 |
|
if (code < UPPER + 26) |
|
return code - UPPER |
|
if (code < LOWER + 26) |
|
return code - LOWER + 26 |
|
} |
|
|
|
function b64ToByteArray (b64) { |
|
var i, j, l, tmp, placeHolders, arr |
|
|
|
if (b64.length % 4 > 0) { |
|
throw new Error('Invalid string. Length must be a multiple of 4') |
|
} |
|
|
|
// the number of equal signs (place holders) |
|
// if there are two placeholders, than the two characters before it |
|
// represent one byte |
|
// if there is only one, then the three characters before it represent 2 bytes |
|
// this is just a cheap hack to not do indexOf twice |
|
var len = b64.length |
|
placeHolders = '=' === b64.charAt(len - 2) ? 2 : '=' === b64.charAt(len - 1) ? 1 : 0 |
|
|
|
// base64 is 4/3 + up to two characters of the original data |
|
arr = new Arr(b64.length * 3 / 4 - placeHolders) |
|
|
|
// if there are placeholders, only get up to the last complete 4 chars |
|
l = placeHolders > 0 ? b64.length - 4 : b64.length |
|
|
|
var L = 0 |
|
|
|
function push (v) { |
|
arr[L++] = v |
|
} |
|
|
|
for (i = 0, j = 0; i < l; i += 4, j += 3) { |
|
tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3)) |
|
push((tmp & 0xFF0000) >> 16) |
|
push((tmp & 0xFF00) >> 8) |
|
push(tmp & 0xFF) |
|
} |
|
|
|
if (placeHolders === 2) { |
|
tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4) |
|
push(tmp & 0xFF) |
|
} else if (placeHolders === 1) { |
|
tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2) |
|
push((tmp >> 8) & 0xFF) |
|
push(tmp & 0xFF) |
|
} |
|
|
|
return arr |
|
} |
|
|
|
function uint8ToBase64 (uint8) { |
|
var i, |
|
extraBytes = uint8.length % 3, // if we have 1 byte left, pad 2 bytes |
|
output = "", |
|
temp, length |
|
|
|
function encode (num) { |
|
return lookup.charAt(num) |
|
} |
|
|
|
function tripletToBase64 (num) { |
|
return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F) |
|
} |
|
|
|
// go through the array every three bytes, we'll deal with trailing stuff later |
|
for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) { |
|
temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]) |
|
output += tripletToBase64(temp) |
|
} |
|
|
|
// pad the end with zeros, but make sure to not forget the extra bytes |
|
switch (extraBytes) { |
|
case 1: |
|
temp = uint8[uint8.length - 1] |
|
output += encode(temp >> 2) |
|
output += encode((temp << 4) & 0x3F) |
|
output += '==' |
|
break |
|
case 2: |
|
temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1]) |
|
output += encode(temp >> 10) |
|
output += encode((temp >> 4) & 0x3F) |
|
output += encode((temp << 2) & 0x3F) |
|
output += '=' |
|
break |
|
} |
|
|
|
return output |
|
} |
|
|
|
exports.toByteArray = b64ToByteArray |
|
exports.fromByteArray = uint8ToBase64 |
|
}(typeof exports === 'undefined' ? (this.base64js = {}) : exports)) |
|
|
|
},{}],174:[function(require,module,exports){ |
|
exports.read = function(buffer, offset, isLE, mLen, nBytes) { |
|
var e, m, |
|
eLen = nBytes * 8 - mLen - 1, |
|
eMax = (1 << eLen) - 1, |
|
eBias = eMax >> 1, |
|
nBits = -7, |
|
i = isLE ? (nBytes - 1) : 0, |
|
d = isLE ? -1 : 1, |
|
s = buffer[offset + i]; |
|
|
|
i += d; |
|
|
|
e = s & ((1 << (-nBits)) - 1); |
|
s >>= (-nBits); |
|
nBits += eLen; |
|
for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8); |
|
|
|
m = e & ((1 << (-nBits)) - 1); |
|
e >>= (-nBits); |
|
nBits += mLen; |
|
for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8); |
|
|
|
if (e === 0) { |
|
e = 1 - eBias; |
|
} else if (e === eMax) { |
|
return m ? NaN : ((s ? -1 : 1) * Infinity); |
|
} else { |
|
m = m + Math.pow(2, mLen); |
|
e = e - eBias; |
|
} |
|
return (s ? -1 : 1) * m * Math.pow(2, e - mLen); |
|
}; |
|
|
|
exports.write = function(buffer, value, offset, isLE, mLen, nBytes) { |
|
var e, m, c, |
|
eLen = nBytes * 8 - mLen - 1, |
|
eMax = (1 << eLen) - 1, |
|
eBias = eMax >> 1, |
|
rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0), |
|
i = isLE ? 0 : (nBytes - 1), |
|
d = isLE ? 1 : -1, |
|
s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0; |
|
|
|
value = Math.abs(value); |
|
|
|
if (isNaN(value) || value === Infinity) { |
|
m = isNaN(value) ? 1 : 0; |
|
e = eMax; |
|
} else { |
|
e = Math.floor(Math.log(value) / Math.LN2); |
|
if (value * (c = Math.pow(2, -e)) < 1) { |
|
e--; |
|
c *= 2; |
|
} |
|
if (e + eBias >= 1) { |
|
value += rt / c; |
|
} else { |
|
value += rt * Math.pow(2, 1 - eBias); |
|
} |
|
if (value * c >= 2) { |
|
e++; |
|
c /= 2; |
|
} |
|
|
|
if (e + eBias >= eMax) { |
|
m = 0; |
|
e = eMax; |
|
} else if (e + eBias >= 1) { |
|
m = (value * c - 1) * Math.pow(2, mLen); |
|
e = e + eBias; |
|
} else { |
|
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen); |
|
e = 0; |
|
} |
|
} |
|
|
|
for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8); |
|
|
|
e = (e << mLen) | m; |
|
eLen += mLen; |
|
for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8); |
|
|
|
buffer[offset + i - d] |= s * 128; |
|
}; |
|
|
|
},{}],175:[function(require,module,exports){ |
|
|
|
/** |
|
* isArray |
|
*/ |
|
|
|
var isArray = Array.isArray; |
|
|
|
/** |
|
* toString |
|
*/ |
|
|
|
var str = Object.prototype.toString; |
|
|
|
/** |
|
* Whether or not the given `val` |
|
* is an array. |
|
* |
|
* example: |
|
* |
|
* isArray([]); |
|
* // > true |
|
* isArray(arguments); |
|
* // > false |
|
* isArray(''); |
|
* // > false |
|
* |
|
* @param {mixed} val |
|
* @return {bool} |
|
*/ |
|
|
|
module.exports = isArray || function (val) { |
|
return !! val && '[object Array]' == str.call(val); |
|
}; |
|
|
|
},{}],176:[function(require,module,exports){ |
|
(function (global){ |
|
/*global window, global*/ |
|
var util = require("util") |
|
var assert = require("assert") |
|
var now = require("date-now") |
|
|
|
var slice = Array.prototype.slice |
|
var console |
|
var times = {} |
|
|
|
if (typeof global !== "undefined" && global.console) { |
|
console = global.console |
|
} else if (typeof window !== "undefined" && window.console) { |
|
console = window.console |
|
} else { |
|
console = {} |
|
} |
|
|
|
var functions = [ |
|
[log, "log"], |
|
[info, "info"], |
|
[warn, "warn"], |
|
[error, "error"], |
|
[time, "time"], |
|
[timeEnd, "timeEnd"], |
|
[trace, "trace"], |
|
[dir, "dir"], |
|
[consoleAssert, "assert"] |
|
] |
|
|
|
for (var i = 0; i < functions.length; i++) { |
|
var tuple = functions[i] |
|
var f = tuple[0] |
|
var name = tuple[1] |
|
|
|
if (!console[name]) { |
|
console[name] = f |
|
} |
|
} |
|
|
|
module.exports = console |
|
|
|
function log() {} |
|
|
|
function info() { |
|
console.log.apply(console, arguments) |
|
} |
|
|
|
function warn() { |
|
console.log.apply(console, arguments) |
|
} |
|
|
|
function error() { |
|
console.warn.apply(console, arguments) |
|
} |
|
|
|
function time(label) { |
|
times[label] = now() |
|
} |
|
|
|
function timeEnd(label) { |
|
var time = times[label] |
|
if (!time) { |
|
throw new Error("No such label: " + label) |
|
} |
|
|
|
var duration = now() - time |
|
console.log(label + ": " + duration + "ms") |
|
} |
|
|
|
function trace() { |
|
var err = new Error() |
|
err.name = "Trace" |
|
err.message = util.format.apply(null, arguments) |
|
console.error(err.stack) |
|
} |
|
|
|
function dir(object) { |
|
console.log(util.inspect(object) + "\n") |
|
} |
|
|
|
function consoleAssert(expression) { |
|
if (!expression) { |
|
var arr = slice.call(arguments, 1) |
|
assert.ok(false, util.format.apply(null, arr)) |
|
} |
|
} |
|
|
|
}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) |
|
},{"assert":157,"date-now":177,"util":343}],177:[function(require,module,exports){ |
|
module.exports = now |
|
|
|
function now() { |
|
return new Date().getTime() |
|
} |
|
|
|
},{}],178:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require('randombytes') |
|
|
|
exports.createHash = exports.Hash = require('create-hash') |
|
|
|
exports.createHmac = exports.Hmac = require('create-hmac') |
|
|
|
var hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(Object.keys(require('browserify-sign/algos'))) |
|
exports.getHashes = function () { |
|
return hashes; |
|
} |
|
|
|
var p = require('pbkdf2-compat') |
|
exports.pbkdf2 = p.pbkdf2 |
|
exports.pbkdf2Sync = p.pbkdf2Sync |
|
|
|
var aes = require('browserify-aes'); |
|
[ |
|
'Cipher', |
|
'createCipher', |
|
'Cipheriv', |
|
'createCipheriv', |
|
'Decipher', |
|
'createDecipher', |
|
'Decipheriv', |
|
'createDecipheriv', |
|
'getCiphers', |
|
'listCiphers' |
|
].forEach(function (key) { |
|
exports[key] = aes[key]; |
|
}) |
|
|
|
var dh = require('diffie-hellman'); |
|
[ |
|
'DiffieHellmanGroup', |
|
'createDiffieHellmanGroup', |
|
'getDiffieHellman', |
|
'createDiffieHellman', |
|
'DiffieHellman' |
|
].forEach(function (key) { |
|
exports[key] = dh[key]; |
|
}) |
|
|
|
require('browserify-sign/inject')(module.exports, exports); |
|
|
|
exports.createECDH = require('create-ecdh') |
|
|
|
var publicEncrypt = require('public-encrypt'); |
|
|
|
[ |
|
'publicEncrypt', |
|
'privateEncrypt', |
|
'publicDecrypt', |
|
'privateDecrypt' |
|
].forEach(function (key) { |
|
exports[key] = publicEncrypt[key]; |
|
}) |
|
|
|
// the least I can do is make error messages for the rest of the node.js/crypto api. |
|
;[ |
|
'createCredentials' |
|
].forEach(function (name) { |
|
exports[name] = function () { |
|
throw new Error([ |
|
'sorry, ' + name + ' is not implemented yet', |
|
'we accept pull requests', |
|
'https://github.com/crypto-browserify/crypto-browserify' |
|
].join('\n')); |
|
} |
|
}) |
|
|
|
},{"browserify-aes":182,"browserify-sign/algos":197,"browserify-sign/inject":198,"create-ecdh":244,"create-hash":266,"create-hmac":278,"diffie-hellman":279,"pbkdf2-compat":286,"public-encrypt":287,"randombytes":313}],179:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var md5 = require('create-hash/md5'); |
|
module.exports = EVP_BytesToKey; |
|
function EVP_BytesToKey(password, keyLen, ivLen) { |
|
if (!Buffer.isBuffer(password)) { |
|
password = new Buffer(password, 'binary'); |
|
} |
|
keyLen = keyLen/8; |
|
ivLen = ivLen || 0; |
|
var ki = 0; |
|
var ii = 0; |
|
var key = new Buffer(keyLen); |
|
var iv = new Buffer(ivLen); |
|
var addmd = 0; |
|
var md_buf; |
|
var i; |
|
var bufs = []; |
|
while (true) { |
|
if(addmd++ > 0) { |
|
bufs.push(md_buf); |
|
} |
|
bufs.push(password); |
|
md_buf = md5(Buffer.concat(bufs)); |
|
bufs = []; |
|
i = 0; |
|
if(keyLen > 0) { |
|
while(true) { |
|
if(keyLen === 0) { |
|
break; |
|
} |
|
if(i === md_buf.length) { |
|
break; |
|
} |
|
key[ki++] = md_buf[i]; |
|
keyLen--; |
|
i++; |
|
} |
|
} |
|
if(ivLen > 0 && i !== md_buf.length) { |
|
while(true) { |
|
if(ivLen === 0) { |
|
break; |
|
} |
|
if(i === md_buf.length) { |
|
break; |
|
} |
|
iv[ii++] = md_buf[i]; |
|
ivLen--; |
|
i++; |
|
} |
|
} |
|
if(keyLen === 0 && ivLen === 0) { |
|
break; |
|
} |
|
} |
|
for(i=0;i<md_buf.length;i++) { |
|
md_buf[i] = 0; |
|
} |
|
return { |
|
key: key, |
|
iv: iv |
|
}; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"create-hash/md5":268}],180:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// based on the aes implimentation in triple sec |
|
// https://github.com/keybase/triplesec |
|
|
|
// which is in turn based on the one from crypto-js |
|
// https://code.google.com/p/crypto-js/ |
|
|
|
var uint_max = Math.pow(2, 32); |
|
function fixup_uint32(x) { |
|
var ret, x_pos; |
|
ret = x > uint_max || x < 0 ? (x_pos = Math.abs(x) % uint_max, x < 0 ? uint_max - x_pos : x_pos) : x; |
|
return ret; |
|
} |
|
function scrub_vec(v) { |
|
var i, _i, _ref; |
|
for (i = _i = 0, _ref = v.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) { |
|
v[i] = 0; |
|
} |
|
return false; |
|
} |
|
|
|
function Global() { |
|
var i; |
|
this.SBOX = []; |
|
this.INV_SBOX = []; |
|
this.SUB_MIX = (function() { |
|
var _i, _results; |
|
_results = []; |
|
for (i = _i = 0; _i < 4; i = ++_i) { |
|
_results.push([]); |
|
} |
|
return _results; |
|
})(); |
|
this.INV_SUB_MIX = (function() { |
|
var _i, _results; |
|
_results = []; |
|
for (i = _i = 0; _i < 4; i = ++_i) { |
|
_results.push([]); |
|
} |
|
return _results; |
|
})(); |
|
this.init(); |
|
this.RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]; |
|
} |
|
|
|
Global.prototype.init = function() { |
|
var d, i, sx, t, x, x2, x4, x8, xi, _i; |
|
d = (function() { |
|
var _i, _results; |
|
_results = []; |
|
for (i = _i = 0; _i < 256; i = ++_i) { |
|
if (i < 128) { |
|
_results.push(i << 1); |
|
} else { |
|
_results.push((i << 1) ^ 0x11b); |
|
} |
|
} |
|
return _results; |
|
})(); |
|
x = 0; |
|
xi = 0; |
|
for (i = _i = 0; _i < 256; i = ++_i) { |
|
sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4); |
|
sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63; |
|
this.SBOX[x] = sx; |
|
this.INV_SBOX[sx] = x; |
|
x2 = d[x]; |
|
x4 = d[x2]; |
|
x8 = d[x4]; |
|
t = (d[sx] * 0x101) ^ (sx * 0x1010100); |
|
this.SUB_MIX[0][x] = (t << 24) | (t >>> 8); |
|
this.SUB_MIX[1][x] = (t << 16) | (t >>> 16); |
|
this.SUB_MIX[2][x] = (t << 8) | (t >>> 24); |
|
this.SUB_MIX[3][x] = t; |
|
t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100); |
|
this.INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8); |
|
this.INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16); |
|
this.INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24); |
|
this.INV_SUB_MIX[3][sx] = t; |
|
if (x === 0) { |
|
x = xi = 1; |
|
} else { |
|
x = x2 ^ d[d[d[x8 ^ x2]]]; |
|
xi ^= d[d[xi]]; |
|
} |
|
} |
|
return true; |
|
}; |
|
|
|
var G = new Global(); |
|
|
|
|
|
AES.blockSize = 4 * 4; |
|
|
|
AES.prototype.blockSize = AES.blockSize; |
|
|
|
AES.keySize = 256 / 8; |
|
|
|
AES.prototype.keySize = AES.keySize; |
|
|
|
function bufferToArray(buf) { |
|
var len = buf.length/4; |
|
var out = new Array(len); |
|
var i = -1; |
|
while (++i < len) { |
|
out[i] = buf.readUInt32BE(i * 4); |
|
} |
|
return out; |
|
} |
|
function AES(key) { |
|
this._key = bufferToArray(key); |
|
this._doReset(); |
|
} |
|
|
|
AES.prototype._doReset = function() { |
|
var invKsRow, keySize, keyWords, ksRow, ksRows, t, _i, _j; |
|
keyWords = this._key; |
|
keySize = keyWords.length; |
|
this._nRounds = keySize + 6; |
|
ksRows = (this._nRounds + 1) * 4; |
|
this._keySchedule = []; |
|
for (ksRow = _i = 0; 0 <= ksRows ? _i < ksRows : _i > ksRows; ksRow = 0 <= ksRows ? ++_i : --_i) { |
|
this._keySchedule[ksRow] = ksRow < keySize ? keyWords[ksRow] : (t = this._keySchedule[ksRow - 1], (ksRow % keySize) === 0 ? (t = (t << 8) | (t >>> 24), t = (G.SBOX[t >>> 24] << 24) | (G.SBOX[(t >>> 16) & 0xff] << 16) | (G.SBOX[(t >>> 8) & 0xff] << 8) | G.SBOX[t & 0xff], t ^= G.RCON[(ksRow / keySize) | 0] << 24) : keySize > 6 && ksRow % keySize === 4 ? t = (G.SBOX[t >>> 24] << 24) | (G.SBOX[(t >>> 16) & 0xff] << 16) | (G.SBOX[(t >>> 8) & 0xff] << 8) | G.SBOX[t & 0xff] : void 0, this._keySchedule[ksRow - keySize] ^ t); |
|
} |
|
this._invKeySchedule = []; |
|
for (invKsRow = _j = 0; 0 <= ksRows ? _j < ksRows : _j > ksRows; invKsRow = 0 <= ksRows ? ++_j : --_j) { |
|
ksRow = ksRows - invKsRow; |
|
t = this._keySchedule[ksRow - (invKsRow % 4 ? 0 : 4)]; |
|
this._invKeySchedule[invKsRow] = invKsRow < 4 || ksRow <= 4 ? t : G.INV_SUB_MIX[0][G.SBOX[t >>> 24]] ^ G.INV_SUB_MIX[1][G.SBOX[(t >>> 16) & 0xff]] ^ G.INV_SUB_MIX[2][G.SBOX[(t >>> 8) & 0xff]] ^ G.INV_SUB_MIX[3][G.SBOX[t & 0xff]]; |
|
} |
|
return true; |
|
}; |
|
|
|
AES.prototype.encryptBlock = function(M) { |
|
M = bufferToArray(new Buffer(M)); |
|
var out = this._doCryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX); |
|
var buf = new Buffer(16); |
|
buf.writeUInt32BE(out[0], 0); |
|
buf.writeUInt32BE(out[1], 4); |
|
buf.writeUInt32BE(out[2], 8); |
|
buf.writeUInt32BE(out[3], 12); |
|
return buf; |
|
}; |
|
|
|
AES.prototype.decryptBlock = function(M) { |
|
M = bufferToArray(new Buffer(M)); |
|
var temp = [M[3], M[1]]; |
|
M[1] = temp[0]; |
|
M[3] = temp[1]; |
|
var out = this._doCryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX); |
|
var buf = new Buffer(16); |
|
buf.writeUInt32BE(out[0], 0); |
|
buf.writeUInt32BE(out[3], 4); |
|
buf.writeUInt32BE(out[2], 8); |
|
buf.writeUInt32BE(out[1], 12); |
|
return buf; |
|
}; |
|
|
|
AES.prototype.scrub = function() { |
|
scrub_vec(this._keySchedule); |
|
scrub_vec(this._invKeySchedule); |
|
scrub_vec(this._key); |
|
}; |
|
|
|
AES.prototype._doCryptBlock = function(M, keySchedule, SUB_MIX, SBOX) { |
|
var ksRow, round, s0, s1, s2, s3, t0, t1, t2, t3, _i, _ref; |
|
|
|
s0 = M[0] ^ keySchedule[0]; |
|
s1 = M[1] ^ keySchedule[1]; |
|
s2 = M[2] ^ keySchedule[2]; |
|
s3 = M[3] ^ keySchedule[3]; |
|
ksRow = 4; |
|
for (round = _i = 1, _ref = this._nRounds; 1 <= _ref ? _i < _ref : _i > _ref; round = 1 <= _ref ? ++_i : --_i) { |
|
t0 = SUB_MIX[0][s0 >>> 24] ^ SUB_MIX[1][(s1 >>> 16) & 0xff] ^ SUB_MIX[2][(s2 >>> 8) & 0xff] ^ SUB_MIX[3][s3 & 0xff] ^ keySchedule[ksRow++]; |
|
t1 = SUB_MIX[0][s1 >>> 24] ^ SUB_MIX[1][(s2 >>> 16) & 0xff] ^ SUB_MIX[2][(s3 >>> 8) & 0xff] ^ SUB_MIX[3][s0 & 0xff] ^ keySchedule[ksRow++]; |
|
t2 = SUB_MIX[0][s2 >>> 24] ^ SUB_MIX[1][(s3 >>> 16) & 0xff] ^ SUB_MIX[2][(s0 >>> 8) & 0xff] ^ SUB_MIX[3][s1 & 0xff] ^ keySchedule[ksRow++]; |
|
t3 = SUB_MIX[0][s3 >>> 24] ^ SUB_MIX[1][(s0 >>> 16) & 0xff] ^ SUB_MIX[2][(s1 >>> 8) & 0xff] ^ SUB_MIX[3][s2 & 0xff] ^ keySchedule[ksRow++]; |
|
s0 = t0; |
|
s1 = t1; |
|
s2 = t2; |
|
s3 = t3; |
|
} |
|
t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]; |
|
t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]; |
|
t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]; |
|
t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]; |
|
return [ |
|
fixup_uint32(t0), |
|
fixup_uint32(t1), |
|
fixup_uint32(t2), |
|
fixup_uint32(t3) |
|
]; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
exports.AES = AES; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],181:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var aes = require('./aes'); |
|
var Transform = require('./cipherBase'); |
|
var inherits = require('inherits'); |
|
var GHASH = require('./ghash'); |
|
var xor = require('./xor'); |
|
inherits(StreamCipher, Transform); |
|
module.exports = StreamCipher; |
|
|
|
function StreamCipher(mode, key, iv, decrypt) { |
|
if (!(this instanceof StreamCipher)) { |
|
return new StreamCipher(mode, key, iv); |
|
} |
|
Transform.call(this); |
|
this._finID = Buffer.concat([iv, new Buffer([0, 0, 0, 1])]); |
|
iv = Buffer.concat([iv, new Buffer([0, 0, 0, 2])]); |
|
this._cipher = new aes.AES(key); |
|
this._prev = new Buffer(iv.length); |
|
this._cache = new Buffer(''); |
|
this._secCache = new Buffer(''); |
|
this._decrypt = decrypt; |
|
this._alen = 0; |
|
this._len = 0; |
|
iv.copy(this._prev); |
|
this._mode = mode; |
|
var h = new Buffer(4); |
|
h.fill(0); |
|
this._ghash = new GHASH(this._cipher.encryptBlock(h)); |
|
this._authTag = null; |
|
this._called = false; |
|
} |
|
StreamCipher.prototype._update = function (chunk) { |
|
if (!this._called && this._alen) { |
|
var rump = 16 - (this._alen % 16); |
|
if (rump <16) { |
|
rump = new Buffer(rump); |
|
rump.fill(0); |
|
this._ghash.update(rump); |
|
} |
|
} |
|
this._called = true; |
|
var out = this._mode.encrypt(this, chunk); |
|
if (this._decrypt) { |
|
this._ghash.update(chunk); |
|
} else { |
|
this._ghash.update(out); |
|
} |
|
this._len += chunk.length; |
|
return out; |
|
}; |
|
StreamCipher.prototype._final = function () { |
|
if (this._decrypt && !this._authTag) { |
|
throw new Error('Unsupported state or unable to authenticate data'); |
|
} |
|
var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID)); |
|
if (this._decrypt) { |
|
if (xorTest(tag, this._authTag)) { |
|
throw new Error('Unsupported state or unable to authenticate data'); |
|
} |
|
} else { |
|
this._authTag = tag; |
|
} |
|
this._cipher.scrub(); |
|
}; |
|
StreamCipher.prototype.getAuthTag = function getAuthTag () { |
|
if (!this._decrypt && Buffer.isBuffer(this._authTag)) { |
|
return this._authTag; |
|
} else { |
|
throw new Error('Attempting to get auth tag in unsupported state'); |
|
} |
|
}; |
|
StreamCipher.prototype.setAuthTag = function setAuthTag (tag) { |
|
if (this._decrypt) { |
|
this._authTag = tag; |
|
} else { |
|
throw new Error('Attempting to set auth tag in unsupported state'); |
|
} |
|
}; |
|
StreamCipher.prototype.setAAD = function setAAD (buf) { |
|
if (!this._called) { |
|
this._ghash.update(buf); |
|
this._alen += buf.length; |
|
} else { |
|
throw new Error('Attempting to set AAD in unsupported state'); |
|
} |
|
}; |
|
function xorTest(a, b) { |
|
var out = 0; |
|
if (a.length !== b.length) { |
|
out++; |
|
} |
|
var len = Math.min(a.length, b.length); |
|
var i = -1; |
|
while (++i < len) { |
|
out += (a[i] ^ b[i]); |
|
} |
|
return out; |
|
} |
|
|
|
|
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./aes":180,"./cipherBase":183,"./ghash":186,"./xor":196,"buffer":172,"inherits":320}],182:[function(require,module,exports){ |
|
var ciphers = require('./encrypter'); |
|
exports.createCipher = exports.Cipher = ciphers.createCipher; |
|
exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv; |
|
var deciphers = require('./decrypter'); |
|
exports.createDecipher = exports.Decipher = deciphers.createDecipher; |
|
exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv; |
|
var modes = require('./modes'); |
|
function getCiphers () { |
|
return Object.keys(modes); |
|
} |
|
exports.listCiphers = exports.getCiphers = getCiphers; |
|
|
|
},{"./decrypter":184,"./encrypter":185,"./modes":187}],183:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var Transform = require('stream').Transform; |
|
var inherits = require('inherits'); |
|
|
|
module.exports = CipherBase; |
|
inherits(CipherBase, Transform); |
|
function CipherBase() { |
|
Transform.call(this); |
|
} |
|
CipherBase.prototype.update = function (data, inputEnc, outputEnc) { |
|
if (typeof data === 'string') { |
|
data = new Buffer(data, inputEnc); |
|
} |
|
var outData = this._update(data); |
|
if (outputEnc) { |
|
outData = outData.toString(outputEnc); |
|
} |
|
return outData; |
|
}; |
|
CipherBase.prototype._transform = function (data, _, next) { |
|
this.push(this._update(data)); |
|
next(); |
|
}; |
|
CipherBase.prototype._flush = function (next) { |
|
try { |
|
this.push(this._final()); |
|
} catch(e) { |
|
return next(e); |
|
} |
|
next(); |
|
}; |
|
CipherBase.prototype.final = function (outputEnc) { |
|
var outData = this._final() || new Buffer(''); |
|
if (outputEnc) { |
|
outData = outData.toString(outputEnc); |
|
} |
|
return outData; |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"inherits":320,"stream":339}],184:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var aes = require('./aes'); |
|
var Transform = require('./cipherBase'); |
|
var inherits = require('inherits'); |
|
var modes = require('./modes'); |
|
var StreamCipher = require('./streamCipher'); |
|
var AuthCipher = require('./authCipher'); |
|
var ebtk = require('./EVP_BytesToKey'); |
|
|
|
inherits(Decipher, Transform); |
|
function Decipher(mode, key, iv) { |
|
if (!(this instanceof Decipher)) { |
|
return new Decipher(mode, key, iv); |
|
} |
|
Transform.call(this); |
|
this._cache = new Splitter(); |
|
this._last = void 0; |
|
this._cipher = new aes.AES(key); |
|
this._prev = new Buffer(iv.length); |
|
iv.copy(this._prev); |
|
this._mode = mode; |
|
this._autopadding = true; |
|
} |
|
Decipher.prototype._update = function (data) { |
|
this._cache.add(data); |
|
var chunk; |
|
var thing; |
|
var out = []; |
|
while ((chunk = this._cache.get(this._autopadding))) { |
|
thing = this._mode.decrypt(this, chunk); |
|
out.push(thing); |
|
} |
|
return Buffer.concat(out); |
|
}; |
|
Decipher.prototype._final = function () { |
|
var chunk = this._cache.flush(); |
|
if (this._autopadding) { |
|
return unpad(this._mode.decrypt(this, chunk)); |
|
} else if (chunk) { |
|
throw new Error('data not multiple of block length'); |
|
} |
|
}; |
|
Decipher.prototype.setAutoPadding = function (setTo) { |
|
this._autopadding = !!setTo; |
|
}; |
|
function Splitter() { |
|
if (!(this instanceof Splitter)) { |
|
return new Splitter(); |
|
} |
|
this.cache = new Buffer(''); |
|
} |
|
Splitter.prototype.add = function (data) { |
|
this.cache = Buffer.concat([this.cache, data]); |
|
}; |
|
|
|
Splitter.prototype.get = function (autoPadding) { |
|
var out; |
|
if (autoPadding) { |
|
if (this.cache.length > 16) { |
|
out = this.cache.slice(0, 16); |
|
this.cache = this.cache.slice(16); |
|
return out; |
|
} |
|
} else { |
|
if (this.cache.length >= 16) { |
|
out = this.cache.slice(0, 16); |
|
this.cache = this.cache.slice(16); |
|
return out; |
|
} |
|
} |
|
return null; |
|
}; |
|
Splitter.prototype.flush = function () { |
|
if (this.cache.length) { |
|
return this.cache; |
|
} |
|
}; |
|
function unpad(last) { |
|
var padded = last[15]; |
|
var i = -1; |
|
while (++i < padded) { |
|
if (last[(i + (16 - padded))] !== padded) { |
|
throw new Error('unable to decrypt data'); |
|
} |
|
} |
|
if (padded === 16) { |
|
return; |
|
} |
|
return last.slice(0, 16 - padded); |
|
} |
|
|
|
var modelist = { |
|
ECB: require('./modes/ecb'), |
|
CBC: require('./modes/cbc'), |
|
CFB: require('./modes/cfb'), |
|
CFB8: require('./modes/cfb8'), |
|
CFB1: require('./modes/cfb1'), |
|
OFB: require('./modes/ofb'), |
|
CTR: require('./modes/ctr'), |
|
GCM: require('./modes/ctr') |
|
}; |
|
|
|
|
|
function createDecipheriv(suite, password, iv) { |
|
var config = modes[suite.toLowerCase()]; |
|
if (!config) { |
|
throw new TypeError('invalid suite type'); |
|
} |
|
if (typeof iv === 'string') { |
|
iv = new Buffer(iv); |
|
} |
|
if (typeof password === 'string') { |
|
password = new Buffer(password); |
|
} |
|
if (password.length !== config.key/8) { |
|
throw new TypeError('invalid key length ' + password.length); |
|
} |
|
if (iv.length !== config.iv) { |
|
throw new TypeError('invalid iv length ' + iv.length); |
|
} |
|
if (config.type === 'stream') { |
|
return new StreamCipher(modelist[config.mode], password, iv, true); |
|
} else if (config.type === 'auth') { |
|
return new AuthCipher(modelist[config.mode], password, iv, true); |
|
} |
|
return new Decipher(modelist[config.mode], password, iv); |
|
} |
|
|
|
function createDecipher (suite, password) { |
|
var config = modes[suite.toLowerCase()]; |
|
if (!config) { |
|
throw new TypeError('invalid suite type'); |
|
} |
|
var keys = ebtk(password, config.key, config.iv); |
|
return createDecipheriv(suite, keys.key, keys.iv); |
|
} |
|
exports.createDecipher = createDecipher; |
|
exports.createDecipheriv = createDecipheriv; |
|
}).call(this,require("buffer").Buffer) |
|
},{"./EVP_BytesToKey":179,"./aes":180,"./authCipher":181,"./cipherBase":183,"./modes":187,"./modes/cbc":188,"./modes/cfb":189,"./modes/cfb1":190,"./modes/cfb8":191,"./modes/ctr":192,"./modes/ecb":193,"./modes/ofb":194,"./streamCipher":195,"buffer":172,"inherits":320}],185:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var aes = require('./aes'); |
|
var Transform = require('./cipherBase'); |
|
var inherits = require('inherits'); |
|
var modes = require('./modes'); |
|
var ebtk = require('./EVP_BytesToKey'); |
|
var StreamCipher = require('./streamCipher'); |
|
var AuthCipher = require('./authCipher'); |
|
inherits(Cipher, Transform); |
|
function Cipher(mode, key, iv) { |
|
if (!(this instanceof Cipher)) { |
|
return new Cipher(mode, key, iv); |
|
} |
|
Transform.call(this); |
|
this._cache = new Splitter(); |
|
this._cipher = new aes.AES(key); |
|
this._prev = new Buffer(iv.length); |
|
iv.copy(this._prev); |
|
this._mode = mode; |
|
this._autopadding = true; |
|
} |
|
Cipher.prototype._update = function (data) { |
|
this._cache.add(data); |
|
var chunk; |
|
var thing; |
|
var out = []; |
|
while ((chunk = this._cache.get())) { |
|
thing = this._mode.encrypt(this, chunk); |
|
out.push(thing); |
|
} |
|
return Buffer.concat(out); |
|
}; |
|
Cipher.prototype._final = function () { |
|
var chunk = this._cache.flush(); |
|
if (this._autopadding) { |
|
chunk = this._mode.encrypt(this, chunk); |
|
this._cipher.scrub(); |
|
return chunk; |
|
} else if (chunk.toString('hex') !== '10101010101010101010101010101010') { |
|
this._cipher.scrub(); |
|
throw new Error('data not multiple of block length'); |
|
} |
|
}; |
|
Cipher.prototype.setAutoPadding = function (setTo) { |
|
this._autopadding = !!setTo; |
|
}; |
|
|
|
function Splitter() { |
|
if (!(this instanceof Splitter)) { |
|
return new Splitter(); |
|
} |
|
this.cache = new Buffer(''); |
|
} |
|
Splitter.prototype.add = function (data) { |
|
this.cache = Buffer.concat([this.cache, data]); |
|
}; |
|
|
|
Splitter.prototype.get = function () { |
|
if (this.cache.length > 15) { |
|
var out = this.cache.slice(0, 16); |
|
this.cache = this.cache.slice(16); |
|
return out; |
|
} |
|
return null; |
|
}; |
|
Splitter.prototype.flush = function () { |
|
var len = 16 - this.cache.length; |
|
var padBuff = new Buffer(len); |
|
|
|
var i = -1; |
|
while (++i < len) { |
|
padBuff.writeUInt8(len, i); |
|
} |
|
var out = Buffer.concat([this.cache, padBuff]); |
|
return out; |
|
}; |
|
var modelist = { |
|
ECB: require('./modes/ecb'), |
|
CBC: require('./modes/cbc'), |
|
CFB: require('./modes/cfb'), |
|
CFB8: require('./modes/cfb8'), |
|
CFB1: require('./modes/cfb1'), |
|
OFB: require('./modes/ofb'), |
|
CTR: require('./modes/ctr'), |
|
GCM: require('./modes/ctr') |
|
}; |
|
|
|
function createCipheriv(suite, password, iv) { |
|
var config = modes[suite.toLowerCase()]; |
|
if (!config) { |
|
throw new TypeError('invalid suite type'); |
|
} |
|
if (typeof iv === 'string') { |
|
iv = new Buffer(iv); |
|
} |
|
if (typeof password === 'string') { |
|
password = new Buffer(password); |
|
} |
|
if (password.length !== config.key/8) { |
|
throw new TypeError('invalid key length ' + password.length); |
|
} |
|
if (iv.length !== config.iv) { |
|
throw new TypeError('invalid iv length ' + iv.length); |
|
} |
|
if (config.type === 'stream') { |
|
return new StreamCipher(modelist[config.mode], password, iv); |
|
} else if (config.type === 'auth') { |
|
return new AuthCipher(modelist[config.mode], password, iv); |
|
} |
|
return new Cipher(modelist[config.mode], password, iv); |
|
} |
|
function createCipher (suite, password) { |
|
var config = modes[suite.toLowerCase()]; |
|
if (!config) { |
|
throw new TypeError('invalid suite type'); |
|
} |
|
var keys = ebtk(password, config.key, config.iv); |
|
return createCipheriv(suite, keys.key, keys.iv); |
|
} |
|
|
|
exports.createCipheriv = createCipheriv; |
|
exports.createCipher = createCipher; |
|
}).call(this,require("buffer").Buffer) |
|
},{"./EVP_BytesToKey":179,"./aes":180,"./authCipher":181,"./cipherBase":183,"./modes":187,"./modes/cbc":188,"./modes/cfb":189,"./modes/cfb1":190,"./modes/cfb8":191,"./modes/ctr":192,"./modes/ecb":193,"./modes/ofb":194,"./streamCipher":195,"buffer":172,"inherits":320}],186:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var zeros = new Buffer(16); |
|
zeros.fill(0); |
|
module.exports = GHASH; |
|
function GHASH(key){ |
|
this.h = key; |
|
this.state = new Buffer(16); |
|
this.state.fill(0); |
|
this.cache = new Buffer(''); |
|
} |
|
// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html |
|
// by Juho Vähä-Herttua |
|
GHASH.prototype.ghash = function (block) { |
|
var i = -1; |
|
while (++i < block.length) { |
|
this.state[i] ^= block[i]; |
|
} |
|
this._multiply(); |
|
}; |
|
|
|
GHASH.prototype._multiply = function () { |
|
var Vi = toArray(this.h); |
|
var Zi = [0, 0, 0, 0]; |
|
var j, xi, lsb_Vi; |
|
var i = -1; |
|
while (++i < 128) { |
|
xi = (this.state[~~(i/8)] & (1 << (7-i%8))) !== 0; |
|
if (xi) { |
|
// Z_i+1 = Z_i ^ V_i |
|
Zi = xor(Zi, Vi); |
|
} |
|
|
|
// Store the value of LSB(V_i) |
|
lsb_Vi = (Vi[3] & 1) !== 0; |
|
|
|
// V_i+1 = V_i >> 1 |
|
for (j=3; j>0; j--) { |
|
Vi[j] = (Vi[j] >>> 1) | ((Vi[j-1]&1) << 31); |
|
} |
|
Vi[0] = Vi[0] >>> 1; |
|
|
|
// If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R |
|
if (lsb_Vi) { |
|
Vi[0] = Vi[0] ^ (0xe1 << 24); |
|
} |
|
} |
|
this.state = fromArray(Zi); |
|
}; |
|
GHASH.prototype.update = function (buf) { |
|
this.cache = Buffer.concat([this.cache, buf]); |
|
var chunk; |
|
while (this.cache.length >= 16) { |
|
chunk = this.cache.slice(0, 16); |
|
this.cache = this.cache.slice(16); |
|
this.ghash(chunk); |
|
} |
|
}; |
|
GHASH.prototype.final = function (abl, bl) { |
|
if (this.cache.length) { |
|
this.ghash(Buffer.concat([this.cache, zeros], 16)); |
|
} |
|
this.ghash(fromArray([ |
|
0, abl, |
|
0, bl |
|
])); |
|
return this.state; |
|
}; |
|
|
|
function toArray(buf) { |
|
return [ |
|
buf.readUInt32BE(0), |
|
buf.readUInt32BE(4), |
|
buf.readUInt32BE(8), |
|
buf.readUInt32BE(12) |
|
]; |
|
} |
|
function fromArray(out) { |
|
out = out.map(fixup_uint32); |
|
var buf = new Buffer(16); |
|
buf.writeUInt32BE(out[0], 0); |
|
buf.writeUInt32BE(out[1], 4); |
|
buf.writeUInt32BE(out[2], 8); |
|
buf.writeUInt32BE(out[3], 12); |
|
return buf; |
|
} |
|
var uint_max = Math.pow(2, 32); |
|
function fixup_uint32(x) { |
|
var ret, x_pos; |
|
ret = x > uint_max || x < 0 ? (x_pos = Math.abs(x) % uint_max, x < 0 ? uint_max - x_pos : x_pos) : x; |
|
return ret; |
|
} |
|
function xor(a, b) { |
|
return [ |
|
a[0] ^ b[0], |
|
a[1] ^ b[1], |
|
a[2] ^ b[2], |
|
a[3] ^ b[3], |
|
]; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],187:[function(require,module,exports){ |
|
exports['aes-128-ecb'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 0, |
|
mode: 'ECB', |
|
type: 'block' |
|
}; |
|
exports['aes-192-ecb'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 0, |
|
mode: 'ECB', |
|
type: 'block' |
|
}; |
|
exports['aes-256-ecb'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 0, |
|
mode: 'ECB', |
|
type: 'block' |
|
}; |
|
exports['aes-128-cbc'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 16, |
|
mode: 'CBC', |
|
type: 'block' |
|
}; |
|
exports['aes-192-cbc'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 16, |
|
mode: 'CBC', |
|
type: 'block' |
|
}; |
|
exports['aes-256-cbc'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 16, |
|
mode: 'CBC', |
|
type: 'block' |
|
}; |
|
exports['aes128'] = exports['aes-128-cbc']; |
|
exports['aes192'] = exports['aes-192-cbc']; |
|
exports['aes256'] = exports['aes-256-cbc']; |
|
exports['aes-128-cfb'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 16, |
|
mode: 'CFB', |
|
type: 'stream' |
|
}; |
|
exports['aes-192-cfb'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 16, |
|
mode: 'CFB', |
|
type: 'stream' |
|
}; |
|
exports['aes-256-cfb'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 16, |
|
mode: 'CFB', |
|
type: 'stream' |
|
}; |
|
exports['aes-128-cfb8'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 16, |
|
mode: 'CFB8', |
|
type: 'stream' |
|
}; |
|
exports['aes-192-cfb8'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 16, |
|
mode: 'CFB8', |
|
type: 'stream' |
|
}; |
|
exports['aes-256-cfb8'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 16, |
|
mode: 'CFB8', |
|
type: 'stream' |
|
}; |
|
exports['aes-128-cfb1'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 16, |
|
mode: 'CFB1', |
|
type: 'stream' |
|
}; |
|
exports['aes-192-cfb1'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 16, |
|
mode: 'CFB1', |
|
type: 'stream' |
|
}; |
|
exports['aes-256-cfb1'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 16, |
|
mode: 'CFB1', |
|
type: 'stream' |
|
}; |
|
exports['aes-128-ofb'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 16, |
|
mode: 'OFB', |
|
type: 'stream' |
|
}; |
|
exports['aes-192-ofb'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 16, |
|
mode: 'OFB', |
|
type: 'stream' |
|
}; |
|
exports['aes-256-ofb'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 16, |
|
mode: 'OFB', |
|
type: 'stream' |
|
}; |
|
exports['aes-128-ctr'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 16, |
|
mode: 'CTR', |
|
type: 'stream' |
|
}; |
|
exports['aes-192-ctr'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 16, |
|
mode: 'CTR', |
|
type: 'stream' |
|
}; |
|
exports['aes-256-ctr'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 16, |
|
mode: 'CTR', |
|
type: 'stream' |
|
}; |
|
exports['aes-128-gcm'] = { |
|
cipher: 'AES', |
|
key: 128, |
|
iv: 12, |
|
mode: 'GCM', |
|
type: 'auth' |
|
}; |
|
exports['aes-192-gcm'] = { |
|
cipher: 'AES', |
|
key: 192, |
|
iv: 12, |
|
mode: 'GCM', |
|
type: 'auth' |
|
}; |
|
exports['aes-256-gcm'] = { |
|
cipher: 'AES', |
|
key: 256, |
|
iv: 12, |
|
mode: 'GCM', |
|
type: 'auth' |
|
}; |
|
},{}],188:[function(require,module,exports){ |
|
var xor = require('../xor'); |
|
exports.encrypt = function (self, block) { |
|
var data = xor(block, self._prev); |
|
self._prev = self._cipher.encryptBlock(data); |
|
return self._prev; |
|
}; |
|
exports.decrypt = function (self, block) { |
|
var pad = self._prev; |
|
self._prev = block; |
|
var out = self._cipher.decryptBlock(block); |
|
return xor(out, pad); |
|
}; |
|
},{"../xor":196}],189:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var xor = require('../xor'); |
|
exports.encrypt = function (self, data, decrypt) { |
|
var out = new Buffer(''); |
|
var len; |
|
while (data.length) { |
|
if (self._cache.length === 0) { |
|
self._cache = self._cipher.encryptBlock(self._prev); |
|
self._prev = new Buffer(''); |
|
} |
|
if (self._cache.length <= data.length) { |
|
len = self._cache.length; |
|
out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)]); |
|
data = data.slice(len); |
|
} else { |
|
out = Buffer.concat([out, encryptStart(self, data, decrypt)]); |
|
break; |
|
} |
|
} |
|
return out; |
|
}; |
|
function encryptStart(self, data, decrypt) { |
|
var len = data.length; |
|
var out = xor(data, self._cache); |
|
self._cache = self._cache.slice(len); |
|
self._prev = Buffer.concat([self._prev, decrypt?data:out]); |
|
return out; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"../xor":196,"buffer":172}],190:[function(require,module,exports){ |
|
(function (Buffer){ |
|
|
|
function encryptByte(self, byte, decrypt) { |
|
var pad; |
|
var i = -1; |
|
var len = 8; |
|
var out = 0; |
|
var bit, value; |
|
while (++i < len) { |
|
pad = self._cipher.encryptBlock(self._prev); |
|
bit = (byte & (1 << (7-i))) ? 0x80:0; |
|
value = pad[0] ^ bit; |
|
out += ((value&0x80) >> (i%8)); |
|
self._prev = shiftIn(self._prev, decrypt?bit:value); |
|
} |
|
return out; |
|
} |
|
exports.encrypt = function (self, chunk, decrypt) { |
|
var len = chunk.length; |
|
var out = new Buffer(len); |
|
var i = -1; |
|
while (++i < len) { |
|
out[i] = encryptByte(self, chunk[i], decrypt); |
|
} |
|
return out; |
|
}; |
|
function shiftIn(buffer, value) { |
|
var len = buffer.length; |
|
var i = -1; |
|
var out = new Buffer(buffer.length); |
|
buffer = Buffer.concat([buffer, new Buffer([value])]); |
|
while(++i < len) { |
|
out[i] = buffer[i]<<1 | buffer[i+1]>>(7); |
|
} |
|
return out; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],191:[function(require,module,exports){ |
|
(function (Buffer){ |
|
function encryptByte(self, byte, decrypt) { |
|
var pad = self._cipher.encryptBlock(self._prev); |
|
var out = pad[0] ^ byte; |
|
self._prev = Buffer.concat([self._prev.slice(1), new Buffer([decrypt?byte:out])]); |
|
return out; |
|
} |
|
exports.encrypt = function (self, chunk, decrypt) { |
|
var len = chunk.length; |
|
var out = new Buffer(len); |
|
var i = -1; |
|
while (++i < len) { |
|
out[i] = encryptByte(self, chunk[i], decrypt); |
|
} |
|
return out; |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],192:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var xor = require('../xor'); |
|
function getBlock(self) { |
|
var out = self._cipher.encryptBlock(self._prev); |
|
incr32(self._prev); |
|
return out; |
|
} |
|
exports.encrypt = function (self, chunk) { |
|
while (self._cache.length < chunk.length) { |
|
self._cache = Buffer.concat([self._cache, getBlock(self)]); |
|
} |
|
var pad = self._cache.slice(0, chunk.length); |
|
self._cache = self._cache.slice(chunk.length); |
|
return xor(chunk, pad); |
|
}; |
|
function incr32(iv) { |
|
var len = iv.length; |
|
var item; |
|
while (len--) { |
|
item = iv.readUInt8(len); |
|
if (item === 255) { |
|
iv.writeUInt8(0, len); |
|
} else { |
|
item++; |
|
iv.writeUInt8(item, len); |
|
break; |
|
} |
|
} |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"../xor":196,"buffer":172}],193:[function(require,module,exports){ |
|
exports.encrypt = function (self, block) { |
|
return self._cipher.encryptBlock(block); |
|
}; |
|
exports.decrypt = function (self, block) { |
|
return self._cipher.decryptBlock(block); |
|
}; |
|
},{}],194:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var xor = require('../xor'); |
|
function getBlock(self) { |
|
self._prev = self._cipher.encryptBlock(self._prev); |
|
return self._prev; |
|
} |
|
exports.encrypt = function (self, chunk) { |
|
while (self._cache.length < chunk.length) { |
|
self._cache = Buffer.concat([self._cache, getBlock(self)]); |
|
} |
|
var pad = self._cache.slice(0, chunk.length); |
|
self._cache = self._cache.slice(chunk.length); |
|
return xor(chunk, pad); |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"../xor":196,"buffer":172}],195:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var aes = require('./aes'); |
|
var Transform = require('./cipherBase'); |
|
var inherits = require('inherits'); |
|
|
|
inherits(StreamCipher, Transform); |
|
module.exports = StreamCipher; |
|
function StreamCipher(mode, key, iv, decrypt) { |
|
if (!(this instanceof StreamCipher)) { |
|
return new StreamCipher(mode, key, iv); |
|
} |
|
Transform.call(this); |
|
this._cipher = new aes.AES(key); |
|
this._prev = new Buffer(iv.length); |
|
this._cache = new Buffer(''); |
|
this._secCache = new Buffer(''); |
|
this._decrypt = decrypt; |
|
iv.copy(this._prev); |
|
this._mode = mode; |
|
} |
|
StreamCipher.prototype._update = function (chunk) { |
|
return this._mode.encrypt(this, chunk, this._decrypt); |
|
}; |
|
StreamCipher.prototype._final = function () { |
|
this._cipher.scrub(); |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"./aes":180,"./cipherBase":183,"buffer":172,"inherits":320}],196:[function(require,module,exports){ |
|
(function (Buffer){ |
|
module.exports = xor; |
|
function xor(a, b) { |
|
var len = Math.min(a.length, b.length); |
|
var out = new Buffer(len); |
|
var i = -1; |
|
while (++i < len) { |
|
out.writeUInt8(a[i] ^ b[i], i); |
|
} |
|
return out; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],197:[function(require,module,exports){ |
|
(function (Buffer){ |
|
exports['RSA-SHA224'] = exports.sha224WithRSAEncryption = { |
|
sign: 'rsa', |
|
hash: 'sha224', |
|
id: new Buffer('302d300d06096086480165030402040500041c', 'hex') |
|
}; |
|
exports['RSA-SHA256'] = exports.sha256WithRSAEncryption = { |
|
sign: 'rsa', |
|
hash: 'sha256', |
|
id: new Buffer('3031300d060960864801650304020105000420', 'hex') |
|
}; |
|
exports['RSA-SHA384'] = exports.sha384WithRSAEncryption = { |
|
sign: 'rsa', |
|
hash: 'sha384', |
|
id: new Buffer('3041300d060960864801650304020205000430', 'hex') |
|
}; |
|
exports['RSA-SHA512'] = exports.sha512WithRSAEncryption = { |
|
sign: 'rsa', |
|
hash: 'sha512', |
|
id: new Buffer('3051300d060960864801650304020305000440', 'hex') |
|
}; |
|
exports['RSA-SHA1'] = { |
|
sign: 'rsa', |
|
hash: 'sha1', |
|
id: new Buffer('3021300906052b0e03021a05000414', 'hex') |
|
}; |
|
exports['ecdsa-with-SHA1'] = { |
|
sign: 'ecdsa', |
|
hash: 'sha1', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports.DSA = exports['DSA-SHA1'] = exports['DSA-SHA'] = { |
|
sign: 'dsa', |
|
hash: 'sha1', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports['DSA-SHA224'] = exports['DSA-WITH-SHA224'] = { |
|
sign: 'dsa', |
|
hash: 'sha224', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports['DSA-SHA256'] = exports['DSA-WITH-SHA256'] = { |
|
sign: 'dsa', |
|
hash: 'sha256', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports['DSA-SHA384'] = exports['DSA-WITH-SHA384'] = { |
|
sign: 'dsa', |
|
hash: 'sha384', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports['DSA-SHA512'] = exports['DSA-WITH-SHA512'] = { |
|
sign: 'dsa', |
|
hash: 'sha512', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports['DSA-RIPEMD160'] = { |
|
sign: 'dsa', |
|
hash: 'rmd160', |
|
id: new Buffer('', 'hex') |
|
}; |
|
exports['RSA-RIPEMD160'] = exports.ripemd160WithRSA = { |
|
sign: 'rsa', |
|
hash: 'rmd160', |
|
id: new Buffer('3021300906052b2403020105000414', 'hex') |
|
}; |
|
exports['RSA-MD5'] = exports.md5WithRSAEncryption = { |
|
sign: 'rsa', |
|
hash: 'md5', |
|
id: new Buffer('3020300c06082a864886f70d020505000410', 'hex') |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],198:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var sign = require('./sign'); |
|
var verify = require('./verify'); |
|
var stream = require('stream'); |
|
var inherits = require('inherits'); |
|
var _algos = require('./algos'); |
|
var algos = {}; |
|
Object.keys(_algos).forEach(function (key) { |
|
algos[key] = algos[key.toLowerCase()] = _algos[key]; |
|
}); |
|
'use strict'; |
|
module.exports = function (exports, crypto) { |
|
exports.createSign = exports.Sign = createSign; |
|
function createSign(algorithm) { |
|
|
|
return new Sign(algorithm, crypto); |
|
} |
|
exports.createVerify = exports.Verify = createVerify; |
|
function createVerify(algorithm) { |
|
return new Verify(algorithm, crypto); |
|
} |
|
}; |
|
inherits(Sign, stream.Writable); |
|
function Sign(algorithm, crypto) { |
|
stream.Writable.call(this); |
|
var data = algos[algorithm]; |
|
if (!data) { |
|
throw new Error('Unknown message digest'); |
|
} |
|
this._hashType = data.hash; |
|
this._hash = crypto.createHash(data.hash); |
|
this._tag = data.id; |
|
this._crypto = crypto; |
|
} |
|
Sign.prototype._write = function _write(data, _, done) { |
|
this._hash.update(data); |
|
done(); |
|
}; |
|
Sign.prototype.update = function update(data) { |
|
this.write(data); |
|
return this; |
|
}; |
|
|
|
Sign.prototype.sign = function signMethod(key, enc) { |
|
this.end(); |
|
var hash = this._hash.digest(); |
|
var sig = sign(Buffer.concat([this._tag, hash]), key, this._hashType, this._crypto); |
|
if (enc) { |
|
sig = sig.toString(enc); |
|
} |
|
return sig; |
|
}; |
|
|
|
inherits(Verify, stream.Writable); |
|
function Verify(algorithm, crypto) { |
|
stream.Writable.call(this); |
|
var data = algos[algorithm]; |
|
if (!data) { |
|
throw new Error('Unknown message digest'); |
|
} |
|
this._hash = crypto.createHash(data.hash); |
|
this._tag = data.id; |
|
} |
|
Verify.prototype._write = function _write(data, _, done) { |
|
this._hash.update(data); |
|
done(); |
|
}; |
|
Verify.prototype.update = function update(data) { |
|
this.write(data); |
|
return this; |
|
}; |
|
|
|
Verify.prototype.verify = function verifyMethod(key, sig, enc) { |
|
this.end(); |
|
var hash = this._hash.digest(); |
|
if (!Buffer.isBuffer(sig)) { |
|
sig = new Buffer(sig, enc); |
|
} |
|
return verify(sig, Buffer.concat([this._tag, hash]), key); |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"./algos":197,"./sign":241,"./verify":242,"buffer":172,"inherits":320,"stream":339}],199:[function(require,module,exports){ |
|
(function(module, exports) { |
|
|
|
'use strict'; |
|
|
|
// Utils |
|
|
|
function assert(val, msg) { |
|
if (!val) |
|
throw new Error(msg || 'Assertion failed'); |
|
} |
|
|
|
// Could use `inherits` module, but don't want to move from single file |
|
// architecture yet. |
|
function inherits(ctor, superCtor) { |
|
ctor.super_ = superCtor; |
|
var TempCtor = function () {}; |
|
TempCtor.prototype = superCtor.prototype; |
|
ctor.prototype = new TempCtor(); |
|
ctor.prototype.constructor = ctor; |
|
} |
|
|
|
// BN |
|
|
|
function BN(number, base, endian) { |
|
// May be `new BN(bn)` ? |
|
if (number !== null && |
|
typeof number === 'object' && |
|
Array.isArray(number.words)) { |
|
return number; |
|
} |
|
|
|
this.sign = false; |
|
this.words = null; |
|
this.length = 0; |
|
|
|
// Reduction context |
|
this.red = null; |
|
|
|
if (base === 'le' || base === 'be') { |
|
endian = base; |
|
base = 10; |
|
} |
|
|
|
if (number !== null) |
|
this._init(number || 0, base || 10, endian || 'be'); |
|
} |
|
if (typeof module === 'object') |
|
module.exports = BN; |
|
else |
|
exports.BN = BN; |
|
|
|
BN.BN = BN; |
|
BN.wordSize = 26; |
|
|
|
BN.prototype._init = function init(number, base, endian) { |
|
if (typeof number === 'number') { |
|
if (number < 0) { |
|
this.sign = true; |
|
number = -number; |
|
} |
|
if (number < 0x4000000) { |
|
this.words = [ number & 0x3ffffff ]; |
|
this.length = 1; |
|
} else { |
|
this.words = [ |
|
number & 0x3ffffff, |
|
(number / 0x4000000) & 0x3ffffff |
|
]; |
|
this.length = 2; |
|
} |
|
return; |
|
} else if (typeof number === 'object') { |
|
return this._initArray(number, base, endian); |
|
} |
|
if (base === 'hex') |
|
base = 16; |
|
assert(base === (base | 0) && base >= 2 && base <= 36); |
|
|
|
number = number.toString().replace(/\s+/g, ''); |
|
var start = 0; |
|
if (number[0] === '-') |
|
start++; |
|
|
|
if (base === 16) |
|
this._parseHex(number, start); |
|
else |
|
this._parseBase(number, base, start); |
|
|
|
if (number[0] === '-') |
|
this.sign = true; |
|
|
|
this.strip(); |
|
}; |
|
|
|
BN.prototype._initArray = function _initArray(number, base, endian) { |
|
// Perhaps a Uint8Array |
|
assert(typeof number.length === 'number'); |
|
this.length = Math.ceil(number.length / 3); |
|
this.words = new Array(this.length); |
|
for (var i = 0; i < this.length; i++) |
|
this.words[i] = 0; |
|
|
|
var off = 0; |
|
if (endian === 'be') { |
|
for (var i = number.length - 1, j = 0; i >= 0; i -= 3) { |
|
var w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); |
|
this.words[j] |= (w << off) & 0x3ffffff; |
|
this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; |
|
off += 24; |
|
if (off >= 26) { |
|
off -= 26; |
|
j++; |
|
} |
|
} |
|
} else if (endian === 'le') { |
|
for (var i = 0, j = 0; i < number.length; i += 3) { |
|
var w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); |
|
this.words[j] |= (w << off) & 0x3ffffff; |
|
this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; |
|
off += 24; |
|
if (off >= 26) { |
|
off -= 26; |
|
j++; |
|
} |
|
} |
|
} |
|
return this.strip(); |
|
}; |
|
|
|
function parseHex(str, start, end) { |
|
var r = 0; |
|
var len = Math.min(str.length, end); |
|
for (var i = start; i < len; i++) { |
|
var c = str.charCodeAt(i) - 48; |
|
|
|
r <<= 4; |
|
|
|
// 'a' - 'f' |
|
if (c >= 49 && c <= 54) |
|
r |= c - 49 + 0xa; |
|
|
|
// 'A' - 'F' |
|
else if (c >= 17 && c <= 22) |
|
r |= c - 17 + 0xa; |
|
|
|
// '0' - '9' |
|
else |
|
r |= c & 0xf; |
|
} |
|
return r; |
|
} |
|
|
|
BN.prototype._parseHex = function _parseHex(number, start) { |
|
// Create possibly bigger array to ensure that it fits the number |
|
this.length = Math.ceil((number.length - start) / 6); |
|
this.words = new Array(this.length); |
|
for (var i = 0; i < this.length; i++) |
|
this.words[i] = 0; |
|
|
|
// Scan 24-bit chunks and add them to the number |
|
var off = 0; |
|
for (var i = number.length - 6, j = 0; i >= start; i -= 6) { |
|
var w = parseHex(number, i, i + 6); |
|
this.words[j] |= (w << off) & 0x3ffffff; |
|
this.words[j + 1] |= w >>> (26 - off) & 0x3fffff; |
|
off += 24; |
|
if (off >= 26) { |
|
off -= 26; |
|
j++; |
|
} |
|
} |
|
if (i + 6 !== start) { |
|
var w = parseHex(number, start, i + 6); |
|
this.words[j] |= (w << off) & 0x3ffffff; |
|
this.words[j + 1] |= w >>> (26 - off) & 0x3fffff; |
|
} |
|
this.strip(); |
|
}; |
|
|
|
function parseBase(str, start, end, mul) { |
|
var r = 0; |
|
var len = Math.min(str.length, end); |
|
for (var i = start; i < len; i++) { |
|
var c = str.charCodeAt(i) - 48; |
|
|
|
r *= mul; |
|
|
|
// 'a' |
|
if (c >= 49) |
|
r += c - 49 + 0xa; |
|
|
|
// 'A' |
|
else if (c >= 17) |
|
r += c - 17 + 0xa; |
|
|
|
// '0' - '9' |
|
else |
|
r += c; |
|
} |
|
return r; |
|
} |
|
|
|
BN.prototype._parseBase = function _parseBase(number, base, start) { |
|
// Initialize as zero |
|
this.words = [ 0 ]; |
|
this.length = 1; |
|
|
|
// Find length of limb in base |
|
for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) |
|
limbLen++; |
|
limbLen--; |
|
limbPow = (limbPow / base) | 0; |
|
|
|
var total = number.length - start; |
|
var mod = total % limbLen; |
|
var end = Math.min(total, total - mod) + start; |
|
|
|
var word = 0; |
|
for (var i = start; i < end; i += limbLen) { |
|
word = parseBase(number, i, i + limbLen, base); |
|
|
|
this.imuln(limbPow); |
|
if (this.words[0] + word < 0x4000000) |
|
this.words[0] += word; |
|
else |
|
this._iaddn(word); |
|
} |
|
|
|
if (mod !== 0) { |
|
var pow = 1; |
|
var word = parseBase(number, i, number.length, base); |
|
|
|
for (var i = 0; i < mod; i++) |
|
pow *= base; |
|
this.imuln(pow); |
|
if (this.words[0] + word < 0x4000000) |
|
this.words[0] += word; |
|
else |
|
this._iaddn(word); |
|
} |
|
}; |
|
|
|
BN.prototype.copy = function copy(dest) { |
|
dest.words = new Array(this.length); |
|
for (var i = 0; i < this.length; i++) |
|
dest.words[i] = this.words[i]; |
|
dest.length = this.length; |
|
dest.sign = this.sign; |
|
dest.red = this.red; |
|
}; |
|
|
|
BN.prototype.clone = function clone() { |
|
var r = new BN(null); |
|
this.copy(r); |
|
return r; |
|
}; |
|
|
|
// Remove leading `0` from `this` |
|
BN.prototype.strip = function strip() { |
|
while (this.length > 1 && this.words[this.length - 1] === 0) |
|
this.length--; |
|
return this._normSign(); |
|
}; |
|
|
|
BN.prototype._normSign = function _normSign() { |
|
// -0 = 0 |
|
if (this.length === 1 && this.words[0] === 0) |
|
this.sign = false; |
|
return this; |
|
}; |
|
|
|
BN.prototype.inspect = function inspect() { |
|
return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>'; |
|
}; |
|
|
|
/* |
|
|
|
var zeros = []; |
|
var groupSizes = []; |
|
var groupBases = []; |
|
|
|
var s = ''; |
|
var i = -1; |
|
while (++i < BN.wordSize) { |
|
zeros[i] = s; |
|
s += '0'; |
|
} |
|
groupSizes[0] = 0; |
|
groupSizes[1] = 0; |
|
groupBases[0] = 0; |
|
groupBases[1] = 0; |
|
var base = 2 - 1; |
|
while (++base < 36 + 1) { |
|
var groupSize = 0; |
|
var groupBase = 1; |
|
while (groupBase < (1 << BN.wordSize) / base) { |
|
groupBase *= base; |
|
groupSize += 1; |
|
} |
|
groupSizes[base] = groupSize; |
|
groupBases[base] = groupBase; |
|
} |
|
|
|
*/ |
|
|
|
var zeros = [ |
|
'', |
|
'0', |
|
'00', |
|
'000', |
|
'0000', |
|
'00000', |
|
'000000', |
|
'0000000', |
|
'00000000', |
|
'000000000', |
|
'0000000000', |
|
'00000000000', |
|
'000000000000', |
|
'0000000000000', |
|
'00000000000000', |
|
'000000000000000', |
|
'0000000000000000', |
|
'00000000000000000', |
|
'000000000000000000', |
|
'0000000000000000000', |
|
'00000000000000000000', |
|
'000000000000000000000', |
|
'0000000000000000000000', |
|
'00000000000000000000000', |
|
'000000000000000000000000', |
|
'0000000000000000000000000' |
|
]; |
|
|
|
var groupSizes = [ |
|
0, 0, |
|
25, 16, 12, 11, 10, 9, 8, |
|
8, 7, 7, 7, 7, 6, 6, |
|
6, 6, 6, 6, 6, 5, 5, |
|
5, 5, 5, 5, 5, 5, 5, |
|
5, 5, 5, 5, 5, 5, 5 |
|
]; |
|
|
|
var groupBases = [ |
|
0, 0, |
|
33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, |
|
43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625, |
|
16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632, |
|
6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149, |
|
24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176 |
|
]; |
|
|
|
BN.prototype.toString = function toString(base, padding) { |
|
base = base || 10; |
|
if (base === 16 || base === 'hex') { |
|
var out = ''; |
|
var off = 0; |
|
var padding = padding | 0 || 1; |
|
var carry = 0; |
|
for (var i = 0; i < this.length; i++) { |
|
var w = this.words[i]; |
|
var word = (((w << off) | carry) & 0xffffff).toString(16); |
|
carry = (w >>> (24 - off)) & 0xffffff; |
|
if (carry !== 0 || i !== this.length - 1) |
|
out = zeros[6 - word.length] + word + out; |
|
else |
|
out = word + out; |
|
off += 2; |
|
if (off >= 26) { |
|
off -= 26; |
|
i--; |
|
} |
|
} |
|
if (carry !== 0) |
|
out = carry.toString(16) + out; |
|
while (out.length % padding !== 0) |
|
out = '0' + out; |
|
if (this.sign) |
|
out = '-' + out; |
|
return out; |
|
} else if (base === (base | 0) && base >= 2 && base <= 36) { |
|
// var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); |
|
var groupSize = groupSizes[base]; |
|
// var groupBase = Math.pow(base, groupSize); |
|
var groupBase = groupBases[base]; |
|
var out = ''; |
|
var c = this.clone(); |
|
c.sign = false; |
|
while (c.cmpn(0) !== 0) { |
|
var r = c.modn(groupBase).toString(base); |
|
c = c.idivn(groupBase); |
|
|
|
if (c.cmpn(0) !== 0) |
|
out = zeros[groupSize - r.length] + r + out; |
|
else |
|
out = r + out; |
|
} |
|
if (this.cmpn(0) === 0) |
|
out = '0' + out; |
|
if (this.sign) |
|
out = '-' + out; |
|
return out; |
|
} else { |
|
assert(false, 'Base should be between 2 and 36'); |
|
} |
|
}; |
|
|
|
BN.prototype.toJSON = function toJSON() { |
|
return this.toString(16); |
|
}; |
|
|
|
BN.prototype.toArray = function toArray() { |
|
this.strip(); |
|
var res = new Array(this.byteLength()); |
|
res[0] = 0; |
|
|
|
var q = this.clone(); |
|
for (var i = 0; q.cmpn(0) !== 0; i++) { |
|
var b = q.andln(0xff); |
|
q.ishrn(8); |
|
|
|
// Assume big-endian |
|
res[res.length - i - 1] = b; |
|
} |
|
|
|
return res; |
|
}; |
|
|
|
/* |
|
function genCountBits(bits) { |
|
var arr = []; |
|
|
|
for (var i = bits - 1; i >= 0; i--) { |
|
var bit = '0x' + (1 << i).toString(16); |
|
arr.push('w >= ' + bit + ' ? ' + (i + 1)); |
|
} |
|
|
|
return new Function('w', 'return ' + arr.join(' :\n') + ' :\n0;'); |
|
}; |
|
|
|
BN.prototype._countBits = genCountBits(26); |
|
*/ |
|
|
|
// Sadly chrome apps could not contain `new Function()` calls |
|
BN.prototype._countBits = function _countBits(w) { |
|
return w >= 0x2000000 ? 26 : |
|
w >= 0x1000000 ? 25 : |
|
w >= 0x800000 ? 24 : |
|
w >= 0x400000 ? 23 : |
|
w >= 0x200000 ? 22 : |
|
w >= 0x100000 ? 21 : |
|
w >= 0x80000 ? 20 : |
|
w >= 0x40000 ? 19 : |
|
w >= 0x20000 ? 18 : |
|
w >= 0x10000 ? 17 : |
|
w >= 0x8000 ? 16 : |
|
w >= 0x4000 ? 15 : |
|
w >= 0x2000 ? 14 : |
|
w >= 0x1000 ? 13 : |
|
w >= 0x800 ? 12 : |
|
w >= 0x400 ? 11 : |
|
w >= 0x200 ? 10 : |
|
w >= 0x100 ? 9 : |
|
w >= 0x80 ? 8 : |
|
w >= 0x40 ? 7 : |
|
w >= 0x20 ? 6 : |
|
w >= 0x10 ? 5 : |
|
w >= 0x8 ? 4 : |
|
w >= 0x4 ? 3 : |
|
w >= 0x2 ? 2 : |
|
w >= 0x1 ? 1 : |
|
0; |
|
}; |
|
|
|
// Return number of used bits in a BN |
|
BN.prototype.bitLength = function bitLength() { |
|
var hi = 0; |
|
var w = this.words[this.length - 1]; |
|
var hi = this._countBits(w); |
|
return (this.length - 1) * 26 + hi; |
|
}; |
|
|
|
BN.prototype.byteLength = function byteLength() { |
|
return Math.ceil(this.bitLength() / 8); |
|
}; |
|
|
|
// Return negative clone of `this` |
|
BN.prototype.neg = function neg() { |
|
if (this.cmpn(0) === 0) |
|
return this.clone(); |
|
|
|
var r = this.clone(); |
|
r.sign = !this.sign; |
|
return r; |
|
}; |
|
|
|
|
|
// Or `num` with `this` in-place |
|
BN.prototype.ior = function ior(num) { |
|
this.sign = this.sign || num.sign; |
|
|
|
while (this.length < num.length) |
|
this.words[this.length++] = 0; |
|
|
|
for (var i = 0; i < num.length; i++) |
|
this.words[i] = this.words[i] | num.words[i]; |
|
|
|
return this.strip(); |
|
}; |
|
|
|
|
|
// Or `num` with `this` |
|
BN.prototype.or = function or(num) { |
|
if (this.length > num.length) |
|
return this.clone().ior(num); |
|
else |
|
return num.clone().ior(this); |
|
}; |
|
|
|
|
|
// And `num` with `this` in-place |
|
BN.prototype.iand = function iand(num) { |
|
this.sign = this.sign && num.sign; |
|
|
|
// b = min-length(num, this) |
|
var b; |
|
if (this.length > num.length) |
|
b = num; |
|
else |
|
b = this; |
|
|
|
for (var i = 0; i < b.length; i++) |
|
this.words[i] = this.words[i] & num.words[i]; |
|
|
|
this.length = b.length; |
|
|
|
return this.strip(); |
|
}; |
|
|
|
|
|
// And `num` with `this` |
|
BN.prototype.and = function and(num) { |
|
if (this.length > num.length) |
|
return this.clone().iand(num); |
|
else |
|
return num.clone().iand(this); |
|
}; |
|
|
|
|
|
// Xor `num` with `this` in-place |
|
BN.prototype.ixor = function ixor(num) { |
|
this.sign = this.sign || num.sign; |
|
|
|
// a.length > b.length |
|
var a; |
|
var b; |
|
if (this.length > num.length) { |
|
a = this; |
|
b = num; |
|
} else { |
|
a = num; |
|
b = this; |
|
} |
|
|
|
for (var i = 0; i < b.length; i++) |
|
this.words[i] = a.words[i] ^ b.words[i]; |
|
|
|
if (this !== a) |
|
for (; i < a.length; i++) |
|
this.words[i] = a.words[i]; |
|
|
|
this.length = a.length; |
|
|
|
return this.strip(); |
|
}; |
|
|
|
|
|
// Xor `num` with `this` |
|
BN.prototype.xor = function xor(num) { |
|
if (this.length > num.length) |
|
return this.clone().ixor(num); |
|
else |
|
return num.clone().ixor(this); |
|
}; |
|
|
|
|
|
// Set `bit` of `this` |
|
BN.prototype.setn = function setn(bit, val) { |
|
assert(typeof bit === 'number' && bit >= 0); |
|
|
|
var off = (bit / 26) | 0; |
|
var wbit = bit % 26; |
|
|
|
while (this.length <= off) |
|
this.words[this.length++] = 0; |
|
|
|
if (val) |
|
this.words[off] = this.words[off] | (1 << wbit); |
|
else |
|
this.words[off] = this.words[off] & ~(1 << wbit); |
|
|
|
return this.strip(); |
|
}; |
|
|
|
|
|
// Add `num` to `this` in-place |
|
BN.prototype.iadd = function iadd(num) { |
|
// negative + positive |
|
if (this.sign && !num.sign) { |
|
this.sign = false; |
|
var r = this.isub(num); |
|
this.sign = !this.sign; |
|
return this._normSign(); |
|
|
|
// positive + negative |
|
} else if (!this.sign && num.sign) { |
|
num.sign = false; |
|
var r = this.isub(num); |
|
num.sign = true; |
|
return r._normSign(); |
|
} |
|
|
|
// a.length > b.length |
|
var a; |
|
var b; |
|
if (this.length > num.length) { |
|
a = this; |
|
b = num; |
|
} else { |
|
a = num; |
|
b = this; |
|
} |
|
|
|
var carry = 0; |
|
for (var i = 0; i < b.length; i++) { |
|
var r = a.words[i] + b.words[i] + carry; |
|
this.words[i] = r & 0x3ffffff; |
|
carry = r >>> 26; |
|
} |
|
for (; carry !== 0 && i < a.length; i++) { |
|
var r = a.words[i] + carry; |
|
this.words[i] = r & 0x3ffffff; |
|
carry = r >>> 26; |
|
} |
|
|
|
this.length = a.length; |
|
if (carry !== 0) { |
|
this.words[this.length] = carry; |
|
this.length++; |
|
// Copy the rest of the words |
|
} else if (a !== this) { |
|
for (; i < a.length; i++) |
|
this.words[i] = a.words[i]; |
|
} |
|
|
|
return this; |
|
}; |
|
|
|
// Add `num` to `this` |
|
BN.prototype.add = function add(num) { |
|
if (num.sign && !this.sign) { |
|
num.sign = false; |
|
var res = this.sub(num); |
|
num.sign = true; |
|
return res; |
|
} else if (!num.sign && this.sign) { |
|
this.sign = false; |
|
var res = num.sub(this); |
|
this.sign = true; |
|
return res; |
|
} |
|
|
|
if (this.length > num.length) |
|
return this.clone().iadd(num); |
|
else |
|
return num.clone().iadd(this); |
|
}; |
|
|
|
// Subtract `num` from `this` in-place |
|
BN.prototype.isub = function isub(num) { |
|
// this - (-num) = this + num |
|
if (num.sign) { |
|
num.sign = false; |
|
var r = this.iadd(num); |
|
num.sign = true; |
|
return r._normSign(); |
|
|
|
// -this - num = -(this + num) |
|
} else if (this.sign) { |
|
this.sign = false; |
|
this.iadd(num); |
|
this.sign = true; |
|
return this._normSign(); |
|
} |
|
|
|
// At this point both numbers are positive |
|
var cmp = this.cmp(num); |
|
|
|
// Optimization - zeroify |
|
if (cmp === 0) { |
|
this.sign = false; |
|
this.length = 1; |
|
this.words[0] = 0; |
|
return this; |
|
} |
|
|
|
// a > b |
|
var a; |
|
var b; |
|
if (cmp > 0) { |
|
a = this; |
|
b = num; |
|
} else { |
|
a = num; |
|
b = this; |
|
} |
|
|
|
var carry = 0; |
|
for (var i = 0; i < b.length; i++) { |
|
var r = a.words[i] - b.words[i] + carry; |
|
carry = r >> 26; |
|
this.words[i] = r & 0x3ffffff; |
|
} |
|
for (; carry !== 0 && i < a.length; i++) { |
|
var r = a.words[i] + carry; |
|
carry = r >> 26; |
|
this.words[i] = r & 0x3ffffff; |
|
} |
|
|
|
// Copy rest of the words |
|
if (carry === 0 && i < a.length && a !== this) |
|
for (; i < a.length; i++) |
|
this.words[i] = a.words[i]; |
|
this.length = Math.max(this.length, i); |
|
|
|
if (a !== this) |
|
this.sign = true; |
|
|
|
return this.strip(); |
|
}; |
|
|
|
// Subtract `num` from `this` |
|
BN.prototype.sub = function sub(num) { |
|
return this.clone().isub(num); |
|
}; |
|
|
|
/* |
|
// NOTE: This could be potentionally used to generate loop-less multiplications |
|
function _genCombMulTo(alen, blen) { |
|
var len = alen + blen - 1; |
|
var src = [ |
|
'var a = this.words, b = num.words, o = out.words, c = 0, w, ' + |
|
'mask = 0x3ffffff, shift = 0x4000000;', |
|
'out.length = ' + len + ';' |
|
]; |
|
for (var k = 0; k < len; k++) { |
|
var minJ = Math.max(0, k - alen + 1); |
|
var maxJ = Math.min(k, blen - 1); |
|
|
|
for (var j = minJ; j <= maxJ; j++) { |
|
var i = k - j; |
|
var mul = 'a[' + i + '] * b[' + j + ']'; |
|
|
|
if (j === minJ) { |
|
src.push('w = ' + mul + ' + c;'); |
|
src.push('c = (w / shift) | 0;'); |
|
} else { |
|
src.push('w += ' + mul + ';'); |
|
src.push('c += (w / shift) | 0;'); |
|
} |
|
src.push('w &= mask;'); |
|
} |
|
src.push('o[' + k + '] = w;'); |
|
} |
|
src.push('if (c !== 0) {', |
|
' o[' + k + '] = c;', |
|
' out.length++;', |
|
'}', |
|
'return out;'); |
|
|
|
return src.join('\n'); |
|
} |
|
*/ |
|
|
|
BN.prototype._smallMulTo = function _smallMulTo(num, out) { |
|
out.sign = num.sign !== this.sign; |
|
out.length = this.length + num.length; |
|
|
|
var carry = 0; |
|
for (var k = 0; k < out.length - 1; k++) { |
|
// Sum all words with the same `i + j = k` and accumulate `ncarry`, |
|
// note that ncarry could be >= 0x3ffffff |
|
var ncarry = carry >>> 26; |
|
var rword = carry & 0x3ffffff; |
|
var maxJ = Math.min(k, num.length - 1); |
|
for (var j = Math.max(0, k - this.length + 1); j <= maxJ; j++) { |
|
var i = k - j; |
|
var a = this.words[i] | 0; |
|
var b = num.words[j] | 0; |
|
var r = a * b; |
|
|
|
var lo = r & 0x3ffffff; |
|
ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; |
|
lo = (lo + rword) | 0; |
|
rword = lo & 0x3ffffff; |
|
ncarry = (ncarry + (lo >>> 26)) | 0; |
|
} |
|
out.words[k] = rword; |
|
carry = ncarry; |
|
} |
|
if (carry !== 0) { |
|
out.words[k] = carry; |
|
} else { |
|
out.length--; |
|
} |
|
|
|
return out.strip(); |
|
}; |
|
|
|
BN.prototype._bigMulTo = function _bigMulTo(num, out) { |
|
out.sign = num.sign !== this.sign; |
|
out.length = this.length + num.length; |
|
|
|
var carry = 0; |
|
var hncarry = 0; |
|
for (var k = 0; k < out.length - 1; k++) { |
|
// Sum all words with the same `i + j = k` and accumulate `ncarry`, |
|
// note that ncarry could be >= 0x3ffffff |
|
var ncarry = hncarry; |
|
hncarry = 0; |
|
var rword = carry & 0x3ffffff; |
|
var maxJ = Math.min(k, num.length - 1); |
|
for (var j = Math.max(0, k - this.length + 1); j <= maxJ; j++) { |
|
var i = k - j; |
|
var a = this.words[i] | 0; |
|
var b = num.words[j] | 0; |
|
var r = a * b; |
|
|
|
var lo = r & 0x3ffffff; |
|
ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; |
|
lo = (lo + rword) | 0; |
|
rword = lo & 0x3ffffff; |
|
ncarry = (ncarry + (lo >>> 26)) | 0; |
|
|
|
hncarry += ncarry >>> 26; |
|
ncarry &= 0x3ffffff; |
|
} |
|
out.words[k] = rword; |
|
carry = ncarry; |
|
ncarry = hncarry; |
|
} |
|
if (carry !== 0) { |
|
out.words[k] = carry; |
|
} else { |
|
out.length--; |
|
} |
|
|
|
return out.strip(); |
|
}; |
|
|
|
BN.prototype.mulTo = function mulTo(num, out) { |
|
var res; |
|
if (this.length + num.length < 63) |
|
res = this._smallMulTo(num, out); |
|
else |
|
res = this._bigMulTo(num, out); |
|
return res; |
|
}; |
|
|
|
// Multiply `this` by `num` |
|
BN.prototype.mul = function mul(num) { |
|
var out = new BN(null); |
|
out.words = new Array(this.length + num.length); |
|
return this.mulTo(num, out); |
|
}; |
|
|
|
// In-place Multiplication |
|
BN.prototype.imul = function imul(num) { |
|
if (this.cmpn(0) === 0 || num.cmpn(0) === 0) { |
|
this.words[0] = 0; |
|
this.length = 1; |
|
return this; |
|
} |
|
|
|
var tlen = this.length; |
|
var nlen = num.length; |
|
|
|
this.sign = num.sign !== this.sign; |
|
this.length = this.length + num.length; |
|
this.words[this.length - 1] = 0; |
|
|
|
for (var k = this.length - 2; k >= 0; k--) { |
|
// Sum all words with the same `i + j = k` and accumulate `carry`, |
|
// note that carry could be >= 0x3ffffff |
|
var carry = 0; |
|
var rword = 0; |
|
var maxJ = Math.min(k, nlen - 1); |
|
for (var j = Math.max(0, k - tlen + 1); j <= maxJ; j++) { |
|
var i = k - j; |
|
var a = this.words[i]; |
|
var b = num.words[j]; |
|
var r = a * b; |
|
|
|
var lo = r & 0x3ffffff; |
|
carry += (r / 0x4000000) | 0; |
|
lo += rword; |
|
rword = lo & 0x3ffffff; |
|
carry += lo >>> 26; |
|
} |
|
this.words[k] = rword; |
|
this.words[k + 1] += carry; |
|
carry = 0; |
|
} |
|
|
|
// Propagate overflows |
|
var carry = 0; |
|
for (var i = 1; i < this.length; i++) { |
|
var w = this.words[i] + carry; |
|
this.words[i] = w & 0x3ffffff; |
|
carry = w >>> 26; |
|
} |
|
|
|
return this.strip(); |
|
}; |
|
|
|
BN.prototype.imuln = function imuln(num) { |
|
assert(typeof num === 'number'); |
|
|
|
// Carry |
|
var carry = 0; |
|
for (var i = 0; i < this.length; i++) { |
|
var w = this.words[i] * num; |
|
var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); |
|
carry >>= 26; |
|
carry += (w / 0x4000000) | 0; |
|
// NOTE: lo is 27bit maximum |
|
carry += lo >>> 26; |
|
this.words[i] = lo & 0x3ffffff; |
|
} |
|
|
|
if (carry !== 0) { |
|
this.words[i] = carry; |
|
this.length++; |
|
} |
|
|
|
return this; |
|
}; |
|
|
|
// `this` * `this` |
|
BN.prototype.sqr = function sqr() { |
|
return this.mul(this); |
|
}; |
|
|
|
// `this` * `this` in-place |
|
BN.prototype.isqr = function isqr() { |
|
return this.mul(this); |
|
}; |
|
|
|
// Shift-left in-place |
|
BN.prototype.ishln = function ishln(bits) { |
|
assert(typeof bits === 'number' && bits >= 0); |
|
var r = bits % 26; |
|
var s = (bits - r) / 26; |
|
var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); |
|
|
|
if (r !== 0) { |
|
var carry = 0; |
|
for (var i = 0; i < this.length; i++) { |
|
var newCarry = this.words[i] & carryMask; |
|
var c = (this.words[i] - newCarry) << r; |
|
this.words[i] = c | carry; |
|
carry = newCarry >>> (26 - r); |
|
} |
|
if (carry) { |
|
this.words[i] = carry; |
|
this.length++; |
|
} |
|
} |
|
|
|
if (s !== 0) { |
|
for (var i = this.length - 1; i >= 0; i--) |
|
this.words[i + s] = this.words[i]; |
|
for (var i = 0; i < s; i++) |
|
this.words[i] = 0; |
|
this.length += s; |
|
} |
|
|
|
return this.strip(); |
|
}; |
|
|
|
// Shift-right in-place |
|
// NOTE: `hint` is a lowest bit before trailing zeroes |
|
// NOTE: if `extended` is true - { lo: ..., hi: } object will be returned |
|
BN.prototype.ishrn = function ishrn(bits, hint, extended) { |
|
assert(typeof bits === 'number' && bits >= 0); |
|
if (hint) |
|
hint = (hint - (hint % 26)) / 26; |
|
else |
|
hint = 0; |
|
|
|
var r = bits % 26; |
|
var s = Math.min((bits - r) / 26, this.length); |
|
var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); |
|
var maskedWords = extended; |
|
|
|
hint -= s; |
|
hint = Math.max(0, hint); |
|
|
|
// Extended mode, copy masked part |
|
if (maskedWords) { |
|
for (var i = 0; i < s; i++) |
|
maskedWords.words[i] = this.words[i]; |
|
maskedWords.length = s; |
|
} |
|
|
|
if (s === 0) { |
|
// No-op, we should not move anything at all |
|
} else if (this.length > s) { |
|
this.length -= s; |
|
for (var i = 0; i < this.length; i++) |
|
this.words[i] = this.words[i + s]; |
|
} else { |
|
this.words[0] = 0; |
|
this.length = 1; |
|
} |
|
|
|
var carry = 0; |
|
for (var i = this.length - 1; i >= 0 && (carry !== 0 || i >= hint); i--) { |
|
var word = this.words[i]; |
|
this.words[i] = (carry << (26 - r)) | (word >>> r); |
|
carry = word & mask; |
|
} |
|
|
|
// Push carried bits as a mask |
|
if (maskedWords && carry !== 0) |
|
maskedWords.words[maskedWords.length++] = carry; |
|
|
|
if (this.length === 0) { |
|
this.words[0] = 0; |
|
this.length = 1; |
|
} |
|
|
|
this.strip(); |
|
if (extended) |
|
return { hi: this, lo: maskedWords }; |
|
|
|
return this; |
|
}; |
|
|
|
// Shift-left |
|
BN.prototype.shln = function shln(bits) { |
|
return this.clone().ishln(bits); |
|
}; |
|
|
|
// Shift-right |
|
BN.prototype.shrn = function shrn(bits) { |
|
return this.clone().ishrn(bits); |
|
}; |
|
|
|
// Test if n bit is set |
|
BN.prototype.testn = function testn(bit) { |
|
assert(typeof bit === 'number' && bit >= 0); |
|
var r = bit % 26; |
|
var s = (bit - r) / 26; |
|
var q = 1 << r; |
|
|
|
// Fast case: bit is much higher than all existing words |
|
if (this.length <= s) { |
|
return false; |
|
} |
|
|
|
// Check bit and return |
|
var w = this.words[s]; |
|
|
|
return !!(w & q); |
|
}; |
|
|
|
// Return only lowers bits of number (in-place) |
|
BN.prototype.imaskn = function imaskn(bits) { |
|
assert(typeof bits === 'number' && bits >= 0); |
|
var r = bits % 26; |
|
var s = (bits - r) / 26; |
|
|
|
assert(!this.sign, 'imaskn works only with positive numbers'); |
|
|
|
if (r !== 0) |
|
s++; |
|
this.length = Math.min(s, this.length); |
|
|
|
if (r !== 0) { |
|
var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); |
|
this.words[this.length - 1] &= mask; |
|
} |
|
|
|
return this.strip(); |
|
}; |
|
|
|
// Return only lowers bits of number |
|
BN.prototype.maskn = function maskn(bits) { |
|
return this.clone().imaskn(bits); |
|
}; |
|
|
|
// Add plain number `num` to `this` |
|
BN.prototype.iaddn = function iaddn(num) { |
|
assert(typeof num === 'number'); |
|
if (num < 0) |
|
return this.isubn(-num); |
|
|
|
// Possible sign change |
|
if (this.sign) { |
|
if (this.length === 1 && this.words[0] < num) { |
|
this.words[0] = num - this.words[0]; |
|
this.sign = false; |
|
return this; |
|
} |
|
|
|
this.sign = false; |
|
this.isubn(num); |
|
this.sign = true; |
|
return this; |
|
} |
|
|
|
// Add without checks |
|
return this._iaddn(num); |
|
}; |
|
|
|
BN.prototype._iaddn = function _iaddn(num) { |
|
this.words[0] += num; |
|
|
|
// Carry |
|
for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { |
|
this.words[i] -= 0x4000000; |
|
if (i === this.length - 1) |
|
this.words[i + 1] = 1; |
|
else |
|
this.words[i + 1]++; |
|
} |
|
this.length = Math.max(this.length, i + 1); |
|
|
|
return this; |
|
}; |
|
|
|
// Subtract plain number `num` from `this` |
|
BN.prototype.isubn = function isubn(num) { |
|
assert(typeof num === 'number'); |
|
if (num < 0) |
|
return this.iaddn(-num); |
|
|
|
if (this.sign) { |
|
this.sign = false; |
|
this.iaddn(num); |
|
this.sign = true; |
|
return this; |
|
} |
|
|
|
this.words[0] -= num; |
|
|
|
// Carry |
|
for (var i = 0; i < this.length && this.words[i] < 0; i++) { |
|
this.words[i] += 0x4000000; |
|
this.words[i + 1] -= 1; |
|
} |
|
|
|
return this.strip(); |
|
}; |
|
|
|
BN.prototype.addn = function addn(num) { |
|
return this.clone().iaddn(num); |
|
}; |
|
|
|
BN.prototype.subn = function subn(num) { |
|
return this.clone().isubn(num); |
|
}; |
|
|
|
BN.prototype.iabs = function iabs() { |
|
this.sign = false; |
|
|
|
return this; |
|
}; |
|
|
|
BN.prototype.abs = function abs() { |
|
return this.clone().iabs(); |
|
}; |
|
|
|
BN.prototype._ishlnsubmul = function _ishlnsubmul(num, mul, shift) { |
|
// Bigger storage is needed |
|
var len = num.length + shift; |
|
var i; |
|
if (this.words.length < len) { |
|
var t = new Array(len); |
|
for (var i = 0; i < this.length; i++) |
|
t[i] = this.words[i]; |
|
this.words = t; |
|
} else { |
|
i = this.length; |
|
} |
|
|
|
// Zeroify rest |
|
this.length = Math.max(this.length, len); |
|
for (; i < this.length; i++) |
|
this.words[i] = 0; |
|
|
|
var carry = 0; |
|
for (var i = 0; i < num.length; i++) { |
|
var w = this.words[i + shift] + carry; |
|
var right = num.words[i] * mul; |
|
w -= right & 0x3ffffff; |
|
carry = (w >> 26) - ((right / 0x4000000) | 0); |
|
this.words[i + shift] = w & 0x3ffffff; |
|
} |
|
for (; i < this.length - shift; i++) { |
|
var w = this.words[i + shift] + carry; |
|
carry = w >> 26; |
|
this.words[i + shift] = w & 0x3ffffff; |
|
} |
|
|
|
if (carry === 0) |
|
return this.strip(); |
|
|
|
// Subtraction overflow |
|
assert(carry === -1); |
|
carry = 0; |
|
for (var i = 0; i < this.length; i++) { |
|
var w = -this.words[i] + carry; |
|
carry = w >> 26; |
|
this.words[i] = w & 0x3ffffff; |
|
} |
|
this.sign = true; |
|
|
|
return this.strip(); |
|
}; |
|
|
|
BN.prototype._wordDiv = function _wordDiv(num, mode) { |
|
var shift = this.length - num.length; |
|
|
|
var a = this.clone(); |
|
var b = num; |
|
|
|
// Normalize |
|
var bhi = b.words[b.length - 1]; |
|
for (var shift = 0; bhi < 0x2000000; shift++) |
|
bhi <<= 1; |
|
if (shift !== 0) { |
|
b = b.shln(shift); |
|
a.ishln(shift); |
|
bhi = b.words[b.length - 1]; |
|
} |
|
|
|
// Initialize quotient |
|
var m = a.length - b.length; |
|
var q; |
|
|
|
if (mode !== 'mod') { |
|
q = new BN(null); |
|
q.length = m + 1; |
|
q.words = new Array(q.length); |
|
for (var i = 0; i < q.length; i++) |
|
q.words[i] = 0; |
|
} |
|
|
|
var diff = a.clone()._ishlnsubmul(b, 1, m); |
|
if (!diff.sign) { |
|
a = diff; |
|
if (q) |
|
q.words[m] = 1; |
|
} |
|
|
|
for (var j = m - 1; j >= 0; j--) { |
|
var qj = a.words[b.length + j] * 0x4000000 + a.words[b.length + j - 1]; |
|
|
|
// NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max |
|
// (0x7ffffff) |
|
qj = Math.min((qj / bhi) | 0, 0x3ffffff); |
|
|
|
a._ishlnsubmul(b, qj, j); |
|
while (a.sign) { |
|
qj--; |
|
a.sign = false; |
|
a._ishlnsubmul(b, 1, j); |
|
a.sign = !a.sign; |
|
} |
|
if (q) |
|
q.words[j] = qj; |
|
} |
|
if (q) |
|
q.strip(); |
|
a.strip(); |
|
|
|
// Denormalize |
|
if (mode !== 'div' && shift !== 0) |
|
a.ishrn(shift); |
|
return { div: q ? q : null, mod: a }; |
|
}; |
|
|
|
BN.prototype.divmod = function divmod(num, mode) { |
|
assert(num.cmpn(0) !== 0); |
|
|
|
if (this.sign && !num.sign) { |
|
var res = this.neg().divmod(num, mode); |
|
var div; |
|
var mod; |
|
if (mode !== 'mod') |
|
div = res.div.neg(); |
|
if (mode !== 'div') |
|
mod = res.mod.cmpn(0) === 0 ? res.mod : num.sub(res.mod); |
|
return { |
|
div: div, |
|
mod: mod |
|
}; |
|
} else if (!this.sign && num.sign) { |
|
var res = this.divmod(num.neg(), mode); |
|
var div; |
|
if (mode !== 'mod') |
|
div = res.div.neg(); |
|
return { div: div, mod: res.mod }; |
|
} else if (this.sign && num.sign) { |
|
return this.neg().divmod(num.neg(), mode); |
|
} |
|
|
|
// Both numbers are positive at this point |
|
|
|
// Strip both numbers to approximate shift value |
|
if (num.length > this.length || this.cmp(num) < 0) |
|
return { div: new BN(0), mod: this }; |
|
|
|
// Very short reduction |
|
if (num.length === 1) { |
|
if (mode === 'div') |
|
return { div: this.divn(num.words[0]), mod: null }; |
|
else if (mode === 'mod') |
|
return { div: null, mod: new BN(this.modn(num.words[0])) }; |
|
return { |
|
div: this.divn(num.words[0]), |
|
mod: new BN(this.modn(num.words[0])) |
|
}; |
|
} |
|
|
|
return this._wordDiv(num, mode); |
|
}; |
|
|
|
// Find `this` / `num` |
|
BN.prototype.div = function div(num) { |
|
return this.divmod(num, 'div').div; |
|
}; |
|
|
|
// Find `this` % `num` |
|
BN.prototype.mod = function mod(num) { |
|
return this.divmod(num, 'mod').mod; |
|
}; |
|
|
|
// Find Round(`this` / `num`) |
|
BN.prototype.divRound = function divRound(num) { |
|
var dm = this.divmod(num); |
|
|
|
// Fast case - exact division |
|
if (dm.mod.cmpn(0) === 0) |
|
return dm.div; |
|
|
|
var mod = dm.div.sign ? dm.mod.isub(num) : dm.mod; |
|
|
|
var half = num.shrn(1); |
|
var r2 = num.andln(1); |
|
var cmp = mod.cmp(half); |
|
|
|
// Round down |
|
if (cmp < 0 || r2 === 1 && cmp === 0) |
|
return dm.div; |
|
|
|
// Round up |
|
return dm.div.sign ? dm.div.isubn(1) : dm.div.iaddn(1); |
|
}; |
|
|
|
BN.prototype.modn = function modn(num) { |
|
assert(num <= 0x3ffffff); |
|
var p = (1 << 26) % num; |
|
|
|
var acc = 0; |
|
for (var i = this.length - 1; i >= 0; i--) |
|
acc = (p * acc + this.words[i]) % num; |
|
|
|
return acc; |
|
}; |
|
|
|
// In-place division by number |
|
BN.prototype.idivn = function idivn(num) { |
|
assert(num <= 0x3ffffff); |
|
|
|
var carry = 0; |
|
for (var i = this.length - 1; i >= 0; i--) { |
|
var w = this.words[i] + carry * 0x4000000; |
|
this.words[i] = (w / num) | 0; |
|
carry = w % num; |
|
} |
|
|
|
return this.strip(); |
|
}; |
|
|
|
BN.prototype.divn = function divn(num) { |
|
return this.clone().idivn(num); |
|
}; |
|
|
|
BN.prototype._egcd = function _egcd(x1, p) { |
|
assert(!p.sign); |
|
assert(p.cmpn(0) !== 0); |
|
|
|
var a = this; |
|
var b = p.clone(); |
|
|
|
if (a.sign) |
|
a = a.mod(p); |
|
else |
|
a = a.clone(); |
|
|
|
var x2 = new BN(0); |
|
while (b.isEven()) |
|
b.ishrn(1); |
|
var delta = b.clone(); |
|
while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { |
|
while (a.isEven()) { |
|
a.ishrn(1); |
|
if (x1.isEven()) |
|
x1.ishrn(1); |
|
else |
|
x1.iadd(delta).ishrn(1); |
|
} |
|
while (b.isEven()) { |
|
b.ishrn(1); |
|
if (x2.isEven()) |
|
x2.ishrn(1); |
|
else |
|
x2.iadd(delta).ishrn(1); |
|
} |
|
if (a.cmp(b) >= 0) { |
|
a.isub(b); |
|
x1.isub(x2); |
|
} else { |
|
b.isub(a); |
|
x2.isub(x1); |
|
} |
|
} |
|
if (a.cmpn(1) === 0) |
|
return x1; |
|
else |
|
return x2; |
|
}; |
|
|
|
BN.prototype.gcd = function gcd(num) { |
|
if (this.cmpn(0) === 0) |
|
return num.clone(); |
|
if (num.cmpn(0) === 0) |
|
return this.clone(); |
|
|
|
var a = this.clone(); |
|
var b = num.clone(); |
|
a.sign = false; |
|
b.sign = false; |
|
|
|
// Remove common factor of two |
|
for (var shift = 0; a.isEven() && b.isEven(); shift++) { |
|
a.ishrn(1); |
|
b.ishrn(1); |
|
} |
|
|
|
while (a.isEven()) |
|
a.ishrn(1); |
|
|
|
do { |
|
while (b.isEven()) |
|
b.ishrn(1); |
|
|
|
// Swap `a` and `b` to make `a` always bigger than `b` |
|
if (a.cmp(b) < 0) { |
|
var t = a; |
|
a = b; |
|
b = t; |
|
} |
|
a.isub(a.div(b).mul(b)); |
|
} while (a.cmpn(0) !== 0 && b.cmpn(0) !== 0); |
|
if (a.cmpn(0) === 0) |
|
return b.ishln(shift); |
|
else |
|
return a.ishln(shift); |
|
}; |
|
|
|
// Invert number in the field F(num) |
|
BN.prototype.invm = function invm(num) { |
|
return this._egcd(new BN(1), num).mod(num); |
|
}; |
|
|
|
BN.prototype.isEven = function isEven() { |
|
return (this.words[0] & 1) === 0; |
|
}; |
|
|
|
BN.prototype.isOdd = function isOdd() { |
|
return (this.words[0] & 1) === 1; |
|
}; |
|
|
|
// And first word and num |
|
BN.prototype.andln = function andln(num) { |
|
return this.words[0] & num; |
|
}; |
|
|
|
// Increment at the bit position in-line |
|
BN.prototype.bincn = function bincn(bit) { |
|
assert(typeof bit === 'number'); |
|
var r = bit % 26; |
|
var s = (bit - r) / 26; |
|
var q = 1 << r; |
|
|
|
// Fast case: bit is much higher than all existing words |
|
if (this.length <= s) { |
|
for (var i = this.length; i < s + 1; i++) |
|
this.words[i] = 0; |
|
this.words[s] |= q; |
|
this.length = s + 1; |
|
return this; |
|
} |
|
|
|
// Add bit and propagate, if needed |
|
var carry = q; |
|
for (var i = s; carry !== 0 && i < this.length; i++) { |
|
var w = this.words[i]; |
|
w += carry; |
|
carry = w >>> 26; |
|
w &= 0x3ffffff; |
|
this.words[i] = w; |
|
} |
|
if (carry !== 0) { |
|
this.words[i] = carry; |
|
this.length++; |
|
} |
|
return this; |
|
}; |
|
|
|
BN.prototype.cmpn = function cmpn(num) { |
|
var sign = num < 0; |
|
if (sign) |
|
num = -num; |
|
|
|
if (this.sign && !sign) |
|
return -1; |
|
else if (!this.sign && sign) |
|
return 1; |
|
|
|
num &= 0x3ffffff; |
|
this.strip(); |
|
|
|
var res; |
|
if (this.length > 1) { |
|
res = 1; |
|
} else { |
|
var w = this.words[0]; |
|
res = w === num ? 0 : w < num ? -1 : 1; |
|
} |
|
if (this.sign) |
|
res = -res; |
|
return res; |
|
}; |
|
|
|
// Compare two numbers and return: |
|
// 1 - if `this` > `num` |
|
// 0 - if `this` == `num` |
|
// -1 - if `this` < `num` |
|
BN.prototype.cmp = function cmp(num) { |
|
if (this.sign && !num.sign) |
|
return -1; |
|
else if (!this.sign && num.sign) |
|
return 1; |
|
|
|
var res = this.ucmp(num); |
|
if (this.sign) |
|
return -res; |
|
else |
|
return res; |
|
}; |
|
|
|
// Unsigned comparison |
|
BN.prototype.ucmp = function ucmp(num) { |
|
// At this point both numbers have the same sign |
|
if (this.length > num.length) |
|
return 1; |
|
else if (this.length < num.length) |
|
return -1; |
|
|
|
var res = 0; |
|
for (var i = this.length - 1; i >= 0; i--) { |
|
var a = this.words[i]; |
|
var b = num.words[i]; |
|
|
|
if (a === b) |
|
continue; |
|
if (a < b) |
|
res = -1; |
|
else if (a > b) |
|
res = 1; |
|
break; |
|
} |
|
return res; |
|
}; |
|
|
|
// |
|
// A reduce context, could be using montgomery or something better, depending |
|
// on the `m` itself. |
|
// |
|
BN.red = function red(num) { |
|
return new Red(num); |
|
}; |
|
|
|
BN.prototype.toRed = function toRed(ctx) { |
|
assert(!this.red, 'Already a number in reduction context'); |
|
assert(!this.sign, 'red works only with positives'); |
|
return ctx.convertTo(this)._forceRed(ctx); |
|
}; |
|
|
|
BN.prototype.fromRed = function fromRed() { |
|
assert(this.red, 'fromRed works only with numbers in reduction context'); |
|
return this.red.convertFrom(this); |
|
}; |
|
|
|
BN.prototype._forceRed = function _forceRed(ctx) { |
|
this.red = ctx; |
|
return this; |
|
}; |
|
|
|
BN.prototype.forceRed = function forceRed(ctx) { |
|
assert(!this.red, 'Already a number in reduction context'); |
|
return this._forceRed(ctx); |
|
}; |
|
|
|
BN.prototype.redAdd = function redAdd(num) { |
|
assert(this.red, 'redAdd works only with red numbers'); |
|
return this.red.add(this, num); |
|
}; |
|
|
|
BN.prototype.redIAdd = function redIAdd(num) { |
|
assert(this.red, 'redIAdd works only with red numbers'); |
|
return this.red.iadd(this, num); |
|
}; |
|
|
|
BN.prototype.redSub = function redSub(num) { |
|
assert(this.red, 'redSub works only with red numbers'); |
|
return this.red.sub(this, num); |
|
}; |
|
|
|
BN.prototype.redISub = function redISub(num) { |
|
assert(this.red, 'redISub works only with red numbers'); |
|
return this.red.isub(this, num); |
|
}; |
|
|
|
BN.prototype.redShl = function redShl(num) { |
|
assert(this.red, 'redShl works only with red numbers'); |
|
return this.red.shl(this, num); |
|
}; |
|
|
|
BN.prototype.redMul = function redMul(num) { |
|
assert(this.red, 'redMul works only with red numbers'); |
|
this.red._verify2(this, num); |
|
return this.red.mul(this, num); |
|
}; |
|
|
|
BN.prototype.redIMul = function redIMul(num) { |
|
assert(this.red, 'redMul works only with red numbers'); |
|
this.red._verify2(this, num); |
|
return this.red.imul(this, num); |
|
}; |
|
|
|
BN.prototype.redSqr = function redSqr() { |
|
assert(this.red, 'redSqr works only with red numbers'); |
|
this.red._verify1(this); |
|
return this.red.sqr(this); |
|
}; |
|
|
|
BN.prototype.redISqr = function redISqr() { |
|
assert(this.red, 'redISqr works only with red numbers'); |
|
this.red._verify1(this); |
|
return this.red.isqr(this); |
|
}; |
|
|
|
// Square root over p |
|
BN.prototype.redSqrt = function redSqrt() { |
|
assert(this.red, 'redSqrt works only with red numbers'); |
|
this.red._verify1(this); |
|
return this.red.sqrt(this); |
|
}; |
|
|
|
BN.prototype.redInvm = function redInvm() { |
|
assert(this.red, 'redInvm works only with red numbers'); |
|
this.red._verify1(this); |
|
return this.red.invm(this); |
|
}; |
|
|
|
// Return negative clone of `this` % `red modulo` |
|
BN.prototype.redNeg = function redNeg() { |
|
assert(this.red, 'redNeg works only with red numbers'); |
|
this.red._verify1(this); |
|
return this.red.neg(this); |
|
}; |
|
|
|
BN.prototype.redPow = function redPow(num) { |
|
assert(this.red && !num.red, 'redPow(normalNum)'); |
|
this.red._verify1(this); |
|
return this.red.pow(this, num); |
|
}; |
|
|
|
// Prime numbers with efficient reduction |
|
var primes = { |
|
k256: null, |
|
p224: null, |
|
p192: null, |
|
p25519: null |
|
}; |
|
|
|
// Pseudo-Mersenne prime |
|
function MPrime(name, p) { |
|
// P = 2 ^ N - K |
|
this.name = name; |
|
this.p = new BN(p, 16); |
|
this.n = this.p.bitLength(); |
|
this.k = new BN(1).ishln(this.n).isub(this.p); |
|
|
|
this.tmp = this._tmp(); |
|
} |
|
|
|
MPrime.prototype._tmp = function _tmp() { |
|
var tmp = new BN(null); |
|
tmp.words = new Array(Math.ceil(this.n / 13)); |
|
return tmp; |
|
}; |
|
|
|
MPrime.prototype.ireduce = function ireduce(num) { |
|
// Assumes that `num` is less than `P^2` |
|
// num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) |
|
var r = num; |
|
var rlen; |
|
|
|
do { |
|
var pair = r.ishrn(this.n, 0, this.tmp); |
|
r = this.imulK(pair.hi); |
|
r = r.iadd(pair.lo); |
|
rlen = r.bitLength(); |
|
} while (rlen > this.n); |
|
|
|
var cmp = rlen < this.n ? -1 : r.cmp(this.p); |
|
if (cmp === 0) { |
|
r.words[0] = 0; |
|
r.length = 1; |
|
} else if (cmp > 0) { |
|
r.isub(this.p); |
|
} else { |
|
r.strip(); |
|
} |
|
|
|
return r; |
|
}; |
|
|
|
MPrime.prototype.imulK = function imulK(num) { |
|
return num.imul(this.k); |
|
}; |
|
|
|
function K256() { |
|
MPrime.call( |
|
this, |
|
'k256', |
|
'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); |
|
} |
|
inherits(K256, MPrime); |
|
|
|
K256.prototype.imulK = function imulK(num) { |
|
// K = 0x1000003d1 = [ 0x40, 0x3d1 ] |
|
num.words[num.length] = 0; |
|
num.words[num.length + 1] = 0; |
|
num.length += 2; |
|
|
|
// bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 |
|
var hi; |
|
var lo = 0; |
|
for (var i = 0; i < num.length; i++) { |
|
var w = num.words[i]; |
|
hi = w * 0x40; |
|
lo += w * 0x3d1; |
|
hi += (lo / 0x4000000) | 0; |
|
lo &= 0x3ffffff; |
|
|
|
num.words[i] = lo; |
|
|
|
lo = hi; |
|
} |
|
|
|
// Fast length reduction |
|
if (num.words[num.length - 1] === 0) { |
|
num.length--; |
|
if (num.words[num.length - 1] === 0) |
|
num.length--; |
|
} |
|
return num; |
|
}; |
|
|
|
function P224() { |
|
MPrime.call( |
|
this, |
|
'p224', |
|
'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); |
|
} |
|
inherits(P224, MPrime); |
|
|
|
function P192() { |
|
MPrime.call( |
|
this, |
|
'p192', |
|
'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); |
|
} |
|
inherits(P192, MPrime); |
|
|
|
function P25519() { |
|
// 2 ^ 255 - 19 |
|
MPrime.call( |
|
this, |
|
'25519', |
|
'7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); |
|
} |
|
inherits(P25519, MPrime); |
|
|
|
P25519.prototype.imulK = function imulK(num) { |
|
// K = 0x13 |
|
var carry = 0; |
|
for (var i = 0; i < num.length; i++) { |
|
var hi = num.words[i] * 0x13 + carry; |
|
var lo = hi & 0x3ffffff; |
|
hi >>>= 26; |
|
|
|
num.words[i] = lo; |
|
carry = hi; |
|
} |
|
if (carry !== 0) |
|
num.words[num.length++] = carry; |
|
return num; |
|
}; |
|
|
|
// Exported mostly for testing purposes, use plain name instead |
|
BN._prime = function prime(name) { |
|
// Cached version of prime |
|
if (primes[name]) |
|
return primes[name]; |
|
|
|
var prime; |
|
if (name === 'k256') |
|
prime = new K256(); |
|
else if (name === 'p224') |
|
prime = new P224(); |
|
else if (name === 'p192') |
|
prime = new P192(); |
|
else if (name === 'p25519') |
|
prime = new P25519(); |
|
else |
|
throw new Error('Unknown prime ' + name); |
|
primes[name] = prime; |
|
|
|
return prime; |
|
}; |
|
|
|
// |
|
// Base reduction engine |
|
// |
|
function Red(m) { |
|
if (typeof m === 'string') { |
|
var prime = BN._prime(m); |
|
this.m = prime.p; |
|
this.prime = prime; |
|
} else { |
|
this.m = m; |
|
this.prime = null; |
|
} |
|
} |
|
|
|
Red.prototype._verify1 = function _verify1(a) { |
|
assert(!a.sign, 'red works only with positives'); |
|
assert(a.red, 'red works only with red numbers'); |
|
}; |
|
|
|
Red.prototype._verify2 = function _verify2(a, b) { |
|
assert(!a.sign && !b.sign, 'red works only with positives'); |
|
assert(a.red && a.red === b.red, |
|
'red works only with red numbers'); |
|
}; |
|
|
|
Red.prototype.imod = function imod(a) { |
|
if (this.prime) |
|
return this.prime.ireduce(a)._forceRed(this); |
|
return a.mod(this.m)._forceRed(this); |
|
}; |
|
|
|
Red.prototype.neg = function neg(a) { |
|
var r = a.clone(); |
|
r.sign = !r.sign; |
|
return r.iadd(this.m)._forceRed(this); |
|
}; |
|
|
|
Red.prototype.add = function add(a, b) { |
|
this._verify2(a, b); |
|
|
|
var res = a.add(b); |
|
if (res.cmp(this.m) >= 0) |
|
res.isub(this.m); |
|
return res._forceRed(this); |
|
}; |
|
|
|
Red.prototype.iadd = function iadd(a, b) { |
|
this._verify2(a, b); |
|
|
|
var res = a.iadd(b); |
|
if (res.cmp(this.m) >= 0) |
|
res.isub(this.m); |
|
return res; |
|
}; |
|
|
|
Red.prototype.sub = function sub(a, b) { |
|
this._verify2(a, b); |
|
|
|
var res = a.sub(b); |
|
if (res.cmpn(0) < 0) |
|
res.iadd(this.m); |
|
return res._forceRed(this); |
|
}; |
|
|
|
Red.prototype.isub = function isub(a, b) { |
|
this._verify2(a, b); |
|
|
|
var res = a.isub(b); |
|
if (res.cmpn(0) < 0) |
|
res.iadd(this.m); |
|
return res; |
|
}; |
|
|
|
Red.prototype.shl = function shl(a, num) { |
|
this._verify1(a); |
|
return this.imod(a.shln(num)); |
|
}; |
|
|
|
Red.prototype.imul = function imul(a, b) { |
|
this._verify2(a, b); |
|
return this.imod(a.imul(b)); |
|
}; |
|
|
|
Red.prototype.mul = function mul(a, b) { |
|
this._verify2(a, b); |
|
return this.imod(a.mul(b)); |
|
}; |
|
|
|
Red.prototype.isqr = function isqr(a) { |
|
return this.imul(a, a); |
|
}; |
|
|
|
Red.prototype.sqr = function sqr(a) { |
|
return this.mul(a, a); |
|
}; |
|
|
|
Red.prototype.sqrt = function sqrt(a) { |
|
if (a.cmpn(0) === 0) |
|
return a.clone(); |
|
|
|
var mod3 = this.m.andln(3); |
|
assert(mod3 % 2 === 1); |
|
|
|
// Fast case |
|
if (mod3 === 3) { |
|
var pow = this.m.add(new BN(1)).ishrn(2); |
|
var r = this.pow(a, pow); |
|
return r; |
|
} |
|
|
|
// Tonelli-Shanks algorithm (Totally unoptimized and slow) |
|
// |
|
// Find Q and S, that Q * 2 ^ S = (P - 1) |
|
var q = this.m.subn(1); |
|
var s = 0; |
|
while (q.cmpn(0) !== 0 && q.andln(1) === 0) { |
|
s++; |
|
q.ishrn(1); |
|
} |
|
assert(q.cmpn(0) !== 0); |
|
|
|
var one = new BN(1).toRed(this); |
|
var nOne = one.redNeg(); |
|
|
|
// Find quadratic non-residue |
|
// NOTE: Max is such because of generalized Riemann hypothesis. |
|
var lpow = this.m.subn(1).ishrn(1); |
|
var z = this.m.bitLength(); |
|
z = new BN(2 * z * z).toRed(this); |
|
while (this.pow(z, lpow).cmp(nOne) !== 0) |
|
z.redIAdd(nOne); |
|
|
|
var c = this.pow(z, q); |
|
var r = this.pow(a, q.addn(1).ishrn(1)); |
|
var t = this.pow(a, q); |
|
var m = s; |
|
while (t.cmp(one) !== 0) { |
|
var tmp = t; |
|
for (var i = 0; tmp.cmp(one) !== 0; i++) |
|
tmp = tmp.redSqr(); |
|
assert(i < m); |
|
var b = this.pow(c, new BN(1).ishln(m - i - 1)); |
|
|
|
r = r.redMul(b); |
|
c = b.redSqr(); |
|
t = t.redMul(c); |
|
m = i; |
|
} |
|
|
|
return r; |
|
}; |
|
|
|
Red.prototype.invm = function invm(a) { |
|
var inv = a._egcd(new BN(1), this.m); |
|
if (inv.sign) { |
|
inv.sign = false; |
|
return this.imod(inv).redNeg(); |
|
} else { |
|
return this.imod(inv); |
|
} |
|
}; |
|
|
|
Red.prototype.pow = function pow(a, num) { |
|
var w = []; |
|
var q = num.clone(); |
|
while (q.cmpn(0) !== 0) { |
|
w.push(q.andln(1)); |
|
q.ishrn(1); |
|
} |
|
|
|
// Skip leading zeroes |
|
var res = a; |
|
for (var i = 0; i < w.length; i++, res = this.sqr(res)) |
|
if (w[i] !== 0) |
|
break; |
|
|
|
if (++i < w.length) { |
|
for (var q = this.sqr(res); i < w.length; i++, q = this.sqr(q)) { |
|
if (w[i] === 0) |
|
continue; |
|
res = this.mul(res, q); |
|
} |
|
} |
|
|
|
return res; |
|
}; |
|
|
|
Red.prototype.convertTo = function convertTo(num) { |
|
return num.clone(); |
|
}; |
|
|
|
Red.prototype.convertFrom = function convertFrom(num) { |
|
var res = num.clone(); |
|
res.red = null; |
|
return res; |
|
}; |
|
|
|
// |
|
// Montgomery method engine |
|
// |
|
|
|
BN.mont = function mont(num) { |
|
return new Mont(num); |
|
}; |
|
|
|
function Mont(m) { |
|
Red.call(this, m); |
|
|
|
this.shift = this.m.bitLength(); |
|
if (this.shift % 26 !== 0) |
|
this.shift += 26 - (this.shift % 26); |
|
this.r = new BN(1).ishln(this.shift); |
|
this.r2 = this.imod(this.r.sqr()); |
|
this.rinv = this.r.invm(this.m); |
|
|
|
this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); |
|
this.minv.sign = true; |
|
this.minv = this.minv.mod(this.r); |
|
} |
|
inherits(Mont, Red); |
|
|
|
Mont.prototype.convertTo = function convertTo(num) { |
|
return this.imod(num.shln(this.shift)); |
|
}; |
|
|
|
Mont.prototype.convertFrom = function convertFrom(num) { |
|
var r = this.imod(num.mul(this.rinv)); |
|
r.red = null; |
|
return r; |
|
}; |
|
|
|
Mont.prototype.imul = function imul(a, b) { |
|
if (a.cmpn(0) === 0 || b.cmpn(0) === 0) { |
|
a.words[0] = 0; |
|
a.length = 1; |
|
return a; |
|
} |
|
|
|
var t = a.imul(b); |
|
var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); |
|
var u = t.isub(c).ishrn(this.shift); |
|
var res = u; |
|
if (u.cmp(this.m) >= 0) |
|
res = u.isub(this.m); |
|
else if (u.cmpn(0) < 0) |
|
res = u.iadd(this.m); |
|
|
|
return res._forceRed(this); |
|
}; |
|
|
|
Mont.prototype.mul = function mul(a, b) { |
|
if (a.cmpn(0) === 0 || b.cmpn(0) === 0) |
|
return new BN(0)._forceRed(this); |
|
|
|
var t = a.mul(b); |
|
var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); |
|
var u = t.isub(c).ishrn(this.shift); |
|
var res = u; |
|
if (u.cmp(this.m) >= 0) |
|
res = u.isub(this.m); |
|
else if (u.cmpn(0) < 0) |
|
res = u.iadd(this.m); |
|
|
|
return res._forceRed(this); |
|
}; |
|
|
|
Mont.prototype.invm = function invm(a) { |
|
// (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R |
|
var res = this.imod(a.invm(this.m).mul(this.r2)); |
|
return res._forceRed(this); |
|
}; |
|
|
|
})(typeof module === 'undefined' || module, this); |
|
|
|
},{}],200:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var bn = require('bn.js'); |
|
module.exports = crt; |
|
function blind(priv, crypto) { |
|
var r = getr(priv, crypto); |
|
var blinder = r.toRed(bn.mont(priv.modulus)) |
|
.redPow(new bn(priv.publicExponent)).fromRed(); |
|
return { |
|
blinder: blinder, |
|
unblinder:r.invm(priv.modulus) |
|
}; |
|
} |
|
function crt(msg, priv, crypto) { |
|
var blinds = blind(priv, crypto); |
|
var len = priv.modulus.byteLength(); |
|
var mod = bn.mont(priv.modulus); |
|
var blinded = new bn(msg).mul(blinds.blinder).mod(priv.modulus); |
|
var c1 = blinded.toRed(bn.mont(priv.prime1)); |
|
var c2 = blinded.toRed(bn.mont(priv.prime2)); |
|
var qinv = priv.coefficient; |
|
var p = priv.prime1; |
|
var q = priv.prime2; |
|
var m1 = c1.redPow(priv.exponent1); |
|
var m2 = c2.redPow(priv.exponent2); |
|
m1 = m1.fromRed(); |
|
m2 = m2.fromRed(); |
|
var h = m1.isub(m2).imul(qinv).mod(p); |
|
h.imul(q); |
|
m2.iadd(h); |
|
var out = new Buffer(m2.imul(blinds.unblinder).mod(priv.modulus).toArray()); |
|
if (out.length < len) { |
|
var prefix = new Buffer(len - out.length); |
|
prefix.fill(0); |
|
out = Buffer.concat([prefix, out], len); |
|
} |
|
return out; |
|
} |
|
crt.getr = getr; |
|
function getr(priv, crypto) { |
|
var len = priv.modulus.byteLength(); |
|
var r = new bn(crypto.randomBytes(len)); |
|
while (r.cmp(priv.modulus) >= 0 || !r.mod(priv.prime1) || !r.mod(priv.prime2)) { |
|
r = new bn(crypto.randomBytes(len)); |
|
} |
|
return r; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"bn.js":199,"buffer":172}],201:[function(require,module,exports){ |
|
var elliptic = exports; |
|
|
|
elliptic.version = require('../package.json').version; |
|
elliptic.utils = require('./elliptic/utils'); |
|
elliptic.rand = require('brorand'); |
|
elliptic.hmacDRBG = require('./elliptic/hmac-drbg'); |
|
elliptic.curve = require('./elliptic/curve'); |
|
elliptic.curves = require('./elliptic/curves'); |
|
|
|
// Protocols |
|
elliptic.ec = require('./elliptic/ec'); |
|
|
|
},{"../package.json":220,"./elliptic/curve":204,"./elliptic/curves":207,"./elliptic/ec":208,"./elliptic/hmac-drbg":211,"./elliptic/utils":212,"brorand":213}],202:[function(require,module,exports){ |
|
var bn = require('bn.js'); |
|
var elliptic = require('../../elliptic'); |
|
|
|
var getNAF = elliptic.utils.getNAF; |
|
var getJSF = elliptic.utils.getJSF; |
|
var assert = elliptic.utils.assert; |
|
|
|
function BaseCurve(type, conf) { |
|
this.type = type; |
|
this.p = new bn(conf.p, 16); |
|
|
|
// Use Montgomery, when there is no fast reduction for the prime |
|
this.red = conf.prime ? bn.red(conf.prime) : bn.mont(this.p); |
|
|
|
// Useful for many curves |
|
this.zero = new bn(0).toRed(this.red); |
|
this.one = new bn(1).toRed(this.red); |
|
this.two = new bn(2).toRed(this.red); |
|
|
|
// Curve configuration, optional |
|
this.n = conf.n && new bn(conf.n, 16); |
|
this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed); |
|
|
|
// Temporary arrays |
|
this._wnafT1 = new Array(4); |
|
this._wnafT2 = new Array(4); |
|
this._wnafT3 = new Array(4); |
|
this._wnafT4 = new Array(4); |
|
} |
|
module.exports = BaseCurve; |
|
|
|
BaseCurve.prototype.point = function point() { |
|
throw new Error('Not implemented'); |
|
}; |
|
|
|
BaseCurve.prototype.validate = function validate(point) { |
|
throw new Error('Not implemented'); |
|
}; |
|
|
|
BaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) { |
|
var doubles = p._getDoubles(); |
|
|
|
var naf = getNAF(k, 1); |
|
var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1); |
|
I /= 3; |
|
|
|
// Translate into more windowed form |
|
var repr = []; |
|
for (var j = 0; j < naf.length; j += doubles.step) { |
|
var nafW = 0; |
|
for (var k = j + doubles.step - 1; k >= j; k--) |
|
nafW = (nafW << 1) + naf[k]; |
|
repr.push(nafW); |
|
} |
|
|
|
var a = this.jpoint(null, null, null); |
|
var b = this.jpoint(null, null, null); |
|
for (var i = I; i > 0; i--) { |
|
for (var j = 0; j < repr.length; j++) { |
|
var nafW = repr[j]; |
|
if (nafW === i) |
|
b = b.mixedAdd(doubles.points[j]); |
|
else if (nafW === -i) |
|
b = b.mixedAdd(doubles.points[j].neg()); |
|
} |
|
a = a.add(b); |
|
} |
|
return a.toP(); |
|
}; |
|
|
|
BaseCurve.prototype._wnafMul = function _wnafMul(p, k) { |
|
var w = 4; |
|
|
|
// Precompute window |
|
var nafPoints = p._getNAFPoints(w); |
|
w = nafPoints.wnd; |
|
var wnd = nafPoints.points; |
|
|
|
// Get NAF form |
|
var naf = getNAF(k, w); |
|
|
|
// Add `this`*(N+1) for every w-NAF index |
|
var acc = this.jpoint(null, null, null); |
|
for (var i = naf.length - 1; i >= 0; i--) { |
|
// Count zeroes |
|
for (var k = 0; i >= 0 && naf[i] === 0; i--) |
|
k++; |
|
if (i >= 0) |
|
k++; |
|
acc = acc.dblp(k); |
|
|
|
if (i < 0) |
|
break; |
|
var z = naf[i]; |
|
assert(z !== 0); |
|
if (p.type === 'affine') { |
|
// J +- P |
|
if (z > 0) |
|
acc = acc.mixedAdd(wnd[(z - 1) >> 1]); |
|
else |
|
acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()); |
|
} else { |
|
// J +- J |
|
if (z > 0) |
|
acc = acc.add(wnd[(z - 1) >> 1]); |
|
else |
|
acc = acc.add(wnd[(-z - 1) >> 1].neg()); |
|
} |
|
} |
|
return p.type === 'affine' ? acc.toP() : acc; |
|
}; |
|
|
|
BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW, |
|
points, |
|
coeffs, |
|
len) { |
|
var wndWidth = this._wnafT1; |
|
var wnd = this._wnafT2; |
|
var naf = this._wnafT3; |
|
|
|
// Fill all arrays |
|
var max = 0; |
|
for (var i = 0; i < len; i++) { |
|
var p = points[i]; |
|
var nafPoints = p._getNAFPoints(defW); |
|
wndWidth[i] = nafPoints.wnd; |
|
wnd[i] = nafPoints.points; |
|
} |
|
|
|
// Comb small window NAFs |
|
for (var i = len - 1; i >= 1; i -= 2) { |
|
var a = i - 1; |
|
var b = i; |
|
if (wndWidth[a] !== 1 || wndWidth[b] !== 1) { |
|
naf[a] = getNAF(coeffs[a], wndWidth[a]); |
|
naf[b] = getNAF(coeffs[b], wndWidth[b]); |
|
max = Math.max(naf[a].length, max); |
|
max = Math.max(naf[b].length, max); |
|
continue; |
|
} |
|
|
|
var comb = [ |
|
points[a], /* 1 */ |
|
null, /* 3 */ |
|
null, /* 5 */ |
|
points[b] /* 7 */ |
|
]; |
|
|
|
// Try to avoid Projective points, if possible |
|
if (points[a].y.cmp(points[b].y) === 0) { |
|
comb[1] = points[a].add(points[b]); |
|
comb[2] = points[a].toJ().mixedAdd(points[b].neg()); |
|
} else if (points[a].y.cmp(points[b].y.redNeg()) === 0) { |
|
comb[1] = points[a].toJ().mixedAdd(points[b]); |
|
comb[2] = points[a].add(points[b].neg()); |
|
} else { |
|
comb[1] = points[a].toJ().mixedAdd(points[b]); |
|
comb[2] = points[a].toJ().mixedAdd(points[b].neg()); |
|
} |
|
|
|
var index = [ |
|
-3, /* -1 -1 */ |
|
-1, /* -1 0 */ |
|
-5, /* -1 1 */ |
|
-7, /* 0 -1 */ |
|
0, /* 0 0 */ |
|
7, /* 0 1 */ |
|
5, /* 1 -1 */ |
|
1, /* 1 0 */ |
|
3 /* 1 1 */ |
|
]; |
|
|
|
var jsf = getJSF(coeffs[a], coeffs[b]); |
|
max = Math.max(jsf[0].length, max); |
|
naf[a] = new Array(max); |
|
naf[b] = new Array(max); |
|
for (var j = 0; j < max; j++) { |
|
var ja = jsf[0][j] | 0; |
|
var jb = jsf[1][j] | 0; |
|
|
|
naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]; |
|
naf[b][j] = 0; |
|
wnd[a] = comb; |
|
} |
|
} |
|
|
|
var acc = this.jpoint(null, null, null); |
|
var tmp = this._wnafT4; |
|
for (var i = max; i >= 0; i--) { |
|
var k = 0; |
|
|
|
while (i >= 0) { |
|
var zero = true; |
|
for (var j = 0; j < len; j++) { |
|
tmp[j] = naf[j][i] | 0; |
|
if (tmp[j] !== 0) |
|
zero = false; |
|
} |
|
if (!zero) |
|
break; |
|
k++; |
|
i--; |
|
} |
|
if (i >= 0) |
|
k++; |
|
acc = acc.dblp(k); |
|
if (i < 0) |
|
break; |
|
|
|
for (var j = 0; j < len; j++) { |
|
var z = tmp[j]; |
|
var p; |
|
if (z === 0) |
|
continue; |
|
else if (z > 0) |
|
p = wnd[j][(z - 1) >> 1]; |
|
else if (z < 0) |
|
p = wnd[j][(-z - 1) >> 1].neg(); |
|
|
|
if (p.type === 'affine') |
|
acc = acc.mixedAdd(p); |
|
else |
|
acc = acc.add(p); |
|
} |
|
} |
|
// Zeroify references |
|
for (var i = 0; i < len; i++) |
|
wnd[i] = null; |
|
return acc.toP(); |
|
}; |
|
|
|
BaseCurve.BasePoint = BasePoint; |
|
|
|
function BasePoint(curve, type) { |
|
this.curve = curve; |
|
this.type = type; |
|
this.precomputed = null; |
|
} |
|
|
|
BasePoint.prototype.validate = function validate() { |
|
return this.curve.validate(this); |
|
}; |
|
|
|
BasePoint.prototype.precompute = function precompute(power, _beta) { |
|
if (this.precomputed) |
|
return this; |
|
|
|
var precomputed = { |
|
doubles: null, |
|
naf: null, |
|
beta: null |
|
}; |
|
precomputed.naf = this._getNAFPoints(8); |
|
precomputed.doubles = this._getDoubles(4, power); |
|
precomputed.beta = this._getBeta(); |
|
this.precomputed = precomputed; |
|
|
|
return this; |
|
}; |
|
|
|
BasePoint.prototype._getDoubles = function _getDoubles(step, power) { |
|
if (this.precomputed && this.precomputed.doubles) |
|
return this.precomputed.doubles; |
|
|
|
var doubles = [ this ]; |
|
var acc = this; |
|
for (var i = 0; i < power; i += step) { |
|
for (var j = 0; j < step; j++) |
|
acc = acc.dbl(); |
|
doubles.push(acc); |
|
} |
|
return { |
|
step: step, |
|
points: doubles |
|
}; |
|
}; |
|
|
|
BasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) { |
|
if (this.precomputed && this.precomputed.naf) |
|
return this.precomputed.naf; |
|
|
|
var res = [ this ]; |
|
var max = (1 << wnd) - 1; |
|
var dbl = max === 1 ? null : this.dbl(); |
|
for (var i = 1; i < max; i++) |
|
res[i] = res[i - 1].add(dbl); |
|
return { |
|
wnd: wnd, |
|
points: res |
|
}; |
|
}; |
|
|
|
BasePoint.prototype._getBeta = function _getBeta() { |
|
return null; |
|
}; |
|
|
|
BasePoint.prototype.dblp = function dblp(k) { |
|
var r = this; |
|
for (var i = 0; i < k; i++) |
|
r = r.dbl(); |
|
return r; |
|
}; |
|
|
|
},{"../../elliptic":201,"bn.js":199}],203:[function(require,module,exports){ |
|
var curve = require('../curve'); |
|
var elliptic = require('../../elliptic'); |
|
var bn = require('bn.js'); |
|
var inherits = require('inherits'); |
|
var Base = curve.base; |
|
|
|
var getNAF = elliptic.utils.getNAF; |
|
var assert = elliptic.utils.assert; |
|
|
|
function EdwardsCurve(conf) { |
|
// NOTE: Important as we are creating point in Base.call() |
|
this.twisted = conf.a != 1; |
|
this.mOneA = this.twisted && conf.a == -1; |
|
this.extended = this.mOneA; |
|
|
|
Base.call(this, 'mont', conf); |
|
|
|
this.a = new bn(conf.a, 16).mod(this.red.m).toRed(this.red); |
|
this.c = new bn(conf.c, 16).toRed(this.red); |
|
this.c2 = this.c.redSqr(); |
|
this.d = new bn(conf.d, 16).toRed(this.red); |
|
this.dd = this.d.redAdd(this.d); |
|
|
|
assert(!this.twisted || this.c.fromRed().cmpn(1) === 0); |
|
this.oneC = conf.c == 1; |
|
} |
|
inherits(EdwardsCurve, Base); |
|
module.exports = EdwardsCurve; |
|
|
|
EdwardsCurve.prototype._mulA = function _mulA(num) { |
|
if (this.mOneA) |
|
return num.redNeg(); |
|
else |
|
return this.a.redMul(num); |
|
}; |
|
|
|
EdwardsCurve.prototype._mulC = function _mulC(num) { |
|
if (this.oneC) |
|
return num; |
|
else |
|
return this.c.redMul(num); |
|
}; |
|
|
|
EdwardsCurve.prototype.point = function point(x, y, z, t) { |
|
return new Point(this, x, y, z, t); |
|
}; |
|
|
|
// Just for compatibility with Short curve |
|
EdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) { |
|
return this.point(x, y, z, t); |
|
}; |
|
|
|
EdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) { |
|
return Point.fromJSON(this, obj); |
|
}; |
|
|
|
EdwardsCurve.prototype.pointFromX = function pointFromX(odd, x) { |
|
x = new bn(x, 16); |
|
if (!x.red) |
|
x = x.toRed(this.red); |
|
|
|
var x2 = x.redSqr(); |
|
var rhs = this.c2.redSub(this.a.redMul(x2)); |
|
var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)); |
|
|
|
var y = rhs.redMul(lhs.redInvm()).redSqrt(); |
|
var isOdd = y.fromRed().isOdd(); |
|
if (odd && !isOdd || !odd && isOdd) |
|
y = y.redNeg(); |
|
|
|
return this.point(x, y, curve.one); |
|
}; |
|
|
|
EdwardsCurve.prototype.validate = function validate(point) { |
|
if (point.isInfinity()) |
|
return true; |
|
|
|
// Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2) |
|
point.normalize(); |
|
|
|
var x2 = point.x.redSqr(); |
|
var y2 = point.y.redSqr(); |
|
var lhs = x2.redMul(this.a).redAdd(y2); |
|
var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2))); |
|
|
|
return lhs.cmp(rhs) === 0; |
|
}; |
|
|
|
function Point(curve, x, y, z, t) { |
|
Base.BasePoint.call(this, curve, 'projective'); |
|
if (x === null && y === null && z === null) { |
|
this.x = this.curve.zero; |
|
this.y = this.curve.one; |
|
this.z = this.curve.one; |
|
this.t = this.curve.zero; |
|
this.zOne = true; |
|
} else { |
|
this.x = new bn(x, 16); |
|
this.y = new bn(y, 16); |
|
this.z = z ? new bn(z, 16) : this.curve.one; |
|
this.t = t && new bn(t, 16); |
|
if (!this.x.red) |
|
this.x = this.x.toRed(this.curve.red); |
|
if (!this.y.red) |
|
this.y = this.y.toRed(this.curve.red); |
|
if (!this.z.red) |
|
this.z = this.z.toRed(this.curve.red); |
|
if (this.t && !this.t.red) |
|
this.t = this.t.toRed(this.curve.red); |
|
this.zOne = this.z === this.curve.one; |
|
|
|
// Use extended coordinates |
|
if (this.curve.extended && !this.t) { |
|
this.t = this.x.redMul(this.y); |
|
if (!this.zOne) |
|
this.t = this.t.redMul(this.z.redInvm()); |
|
} |
|
} |
|
} |
|
inherits(Point, Base.BasePoint); |
|
|
|
Point.fromJSON = function fromJSON(curve, obj) { |
|
return new Point(curve, obj[0], obj[1], obj[2]); |
|
}; |
|
|
|
Point.prototype.inspect = function inspect() { |
|
if (this.isInfinity()) |
|
return '<EC Point Infinity>'; |
|
return '<EC Point x: ' + this.x.fromRed().toString(16, 2) + |
|
' y: ' + this.y.fromRed().toString(16, 2) + |
|
' z: ' + this.z.fromRed().toString(16, 2) + '>'; |
|
}; |
|
|
|
Point.prototype.isInfinity = function isInfinity() { |
|
// XXX This code assumes that zero is always zero in red |
|
return this.x.cmpn(0) === 0 && |
|
this.y.cmp(this.z) === 0; |
|
}; |
|
|
|
Point.prototype._extDbl = function _extDbl() { |
|
// http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#doubling-dbl-2008-hwcd |
|
// 4M + 4S |
|
|
|
// A = X1^2 |
|
var a = this.x.redSqr(); |
|
// B = Y1^2 |
|
var b = this.y.redSqr(); |
|
// C = 2 * Z1^2 |
|
var c = this.z.redSqr(); |
|
c = c.redIAdd(c); |
|
// D = a * A |
|
var d = this.curve._mulA(a); |
|
// E = (X1 + Y1)^2 - A - B |
|
var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b); |
|
// G = D + B |
|
var g = d.redAdd(b); |
|
// F = G - C |
|
var f = g.redSub(c); |
|
// H = D - B |
|
var h = d.redSub(b); |
|
// X3 = E * F |
|
var nx = e.redMul(f); |
|
// Y3 = G * H |
|
var ny = g.redMul(h); |
|
// T3 = E * H |
|
var nt = e.redMul(h); |
|
// Z3 = F * G |
|
var nz = f.redMul(g); |
|
return this.curve.point(nx, ny, nz, nt); |
|
}; |
|
|
|
Point.prototype._projDbl = function _projDbl() { |
|
// http://hyperelliptic.org/EFD/g1p/auto-twisted-projective.html#doubling-dbl-2008-bbjlp |
|
// http://hyperelliptic.org/EFD/g1p/auto-edwards-projective.html#doubling-dbl-2007-bl |
|
// and others |
|
// Generally 3M + 4S or 2M + 4S |
|
|
|
// B = (X1 + Y1)^2 |
|
var b = this.x.redAdd(this.y).redSqr(); |
|
// C = X1^2 |
|
var c = this.x.redSqr(); |
|
// D = Y1^2 |
|
var d = this.y.redSqr(); |
|
|
|
if (this.curve.twisted) { |
|
// E = a * C |
|
var e = this.curve._mulA(c); |
|
// F = E + D |
|
var f = e.redAdd(d); |
|
if (this.zOne) { |
|
// X3 = (B - C - D) * (F - 2) |
|
var nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two)); |
|
// Y3 = F * (E - D) |
|
var ny = f.redMul(e.redSub(d)); |
|
// Z3 = F^2 - 2 * F |
|
var nz = f.redSqr().redSub(f).redSub(f); |
|
} else { |
|
// H = Z1^2 |
|
var h = this.z.redSqr(); |
|
// J = F - 2 * H |
|
var j = f.redSub(h).redISub(h); |
|
// X3 = (B-C-D)*J |
|
var nx = b.redSub(c).redISub(d).redMul(j); |
|
// Y3 = F * (E - D) |
|
var ny = f.redMul(e.redSub(d)); |
|
// Z3 = F * J |
|
var nz = f.redMul(j); |
|
} |
|
} else { |
|
// E = C + D |
|
var e = c.redAdd(d); |
|
// H = (c * Z1)^2 |
|
var h = this.curve._mulC(redMul(this.z)).redSqr(); |
|
// J = E - 2 * H |
|
var j = e.redSub(h).redSub(h); |
|
// X3 = c * (B - E) * J |
|
var nx = this.curve._mulC(b.redISub(e)).redMul(j); |
|
// Y3 = c * E * (C - D) |
|
var ny = this.curve._mulC(e).redMul(c.redISub(d)); |
|
// Z3 = E * J |
|
var nz = e.redMul(j); |
|
} |
|
return this.curve.point(nx, ny, nz); |
|
}; |
|
|
|
Point.prototype.dbl = function dbl() { |
|
if (this.isInfinity()) |
|
return this; |
|
|
|
// Double in extended coordinates |
|
if (this.curve.extended) |
|
return this._extDbl(); |
|
else |
|
return this._projDbl(); |
|
}; |
|
|
|
Point.prototype._extAdd = function _extAdd(p) { |
|
// http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-3 |
|
// 8M |
|
|
|
// A = (Y1 - X1) * (Y2 - X2) |
|
var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)); |
|
// B = (Y1 + X1) * (Y2 + X2) |
|
var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)); |
|
// C = T1 * k * T2 |
|
var c = this.t.redMul(this.curve.dd).redMul(p.t); |
|
// D = Z1 * 2 * Z2 |
|
var d = this.z.redMul(p.z.redAdd(p.z)); |
|
// E = B - A |
|
var e = b.redSub(a); |
|
// F = D - C |
|
var f = d.redSub(c); |
|
// G = D + C |
|
var g = d.redAdd(c); |
|
// H = B + A |
|
var h = b.redAdd(a); |
|
// X3 = E * F |
|
var nx = e.redMul(f); |
|
// Y3 = G * H |
|
var ny = g.redMul(h); |
|
// T3 = E * H |
|
var nt = e.redMul(h); |
|
// Z3 = F * G |
|
var nz = f.redMul(g); |
|
return this.curve.point(nx, ny, nz, nt); |
|
}; |
|
|
|
Point.prototype._projAdd = function _projAdd(p) { |
|
// http://hyperelliptic.org/EFD/g1p/auto-twisted-projective.html#addition-add-2008-bbjlp |
|
// http://hyperelliptic.org/EFD/g1p/auto-edwards-projective.html#addition-add-2007-bl |
|
// 10M + 1S |
|
|
|
// A = Z1 * Z2 |
|
var a = this.z.redMul(p.z); |
|
// B = A^2 |
|
var b = a.redSqr(); |
|
// C = X1 * X2 |
|
var c = this.x.redMul(p.x); |
|
// D = Y1 * Y2 |
|
var d = this.y.redMul(p.y); |
|
// E = d * C * D |
|
var e = this.curve.d.redMul(c).redMul(d); |
|
// F = B - E |
|
var f = b.redSub(e); |
|
// G = B + E |
|
var g = b.redAdd(e); |
|
// X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D) |
|
var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d); |
|
var nx = a.redMul(f).redMul(tmp); |
|
if (this.curve.twisted) { |
|
// Y3 = A * G * (D - a * C) |
|
var ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c))); |
|
// Z3 = F * G |
|
var nz = f.redMul(g); |
|
} else { |
|
// Y3 = A * G * (D - C) |
|
var ny = a.redMul(g).redMul(d.redSub(c)); |
|
// Z3 = c * F * G |
|
var nz = this.curve._mulC(f).redMul(g); |
|
} |
|
return this.curve.point(nx, ny, nz); |
|
}; |
|
|
|
Point.prototype.add = function add(p) { |
|
if (this.isInfinity()) |
|
return p; |
|
if (p.isInfinity()) |
|
return this; |
|
|
|
if (this.curve.extended) |
|
return this._extAdd(p); |
|
else |
|
return this._projAdd(p); |
|
}; |
|
|
|
Point.prototype.mul = function mul(k) { |
|
if (this.precomputed && this.precomputed.doubles) |
|
return this.curve._fixedNafMul(this, k); |
|
else |
|
return this.curve._wnafMul(this, k); |
|
}; |
|
|
|
Point.prototype.mulAdd = function mulAdd(k1, p, k2) { |
|
return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2); |
|
}; |
|
|
|
Point.prototype.normalize = function normalize() { |
|
if (this.zOne) |
|
return this; |
|
|
|
// Normalize coordinates |
|
var zi = this.z.redInvm(); |
|
this.x = this.x.redMul(zi); |
|
this.y = this.y.redMul(zi); |
|
if (this.t) |
|
this.t = this.t.redMul(zi); |
|
this.z = this.curve.one; |
|
this.zOne = true; |
|
return this; |
|
}; |
|
|
|
Point.prototype.neg = function neg() { |
|
return this.curve.point(this.x.redNeg(), |
|
this.y, |
|
this.z, |
|
this.t && this.t.redNeg()); |
|
}; |
|
|
|
Point.prototype.getX = function getX() { |
|
this.normalize(); |
|
return this.x.fromRed(); |
|
}; |
|
|
|
Point.prototype.getY = function getY() { |
|
this.normalize(); |
|
return this.y.fromRed(); |
|
}; |
|
|
|
// Compatibility with BaseCurve |
|
Point.prototype.toP = Point.prototype.normalize; |
|
Point.prototype.mixedAdd = Point.prototype.add; |
|
|
|
},{"../../elliptic":201,"../curve":204,"bn.js":199,"inherits":320}],204:[function(require,module,exports){ |
|
var curve = exports; |
|
|
|
curve.base = require('./base'); |
|
curve.short = require('./short'); |
|
curve.mont = require('./mont'); |
|
curve.edwards = require('./edwards'); |
|
|
|
},{"./base":202,"./edwards":203,"./mont":205,"./short":206}],205:[function(require,module,exports){ |
|
var curve = require('../curve'); |
|
var elliptic = require('../../elliptic'); |
|
var bn = require('bn.js'); |
|
var inherits = require('inherits'); |
|
var Base = curve.base; |
|
|
|
var getNAF = elliptic.utils.getNAF; |
|
var assert = elliptic.utils.assert; |
|
|
|
function MontCurve(conf) { |
|
Base.call(this, 'mont', conf); |
|
|
|
this.a = new bn(conf.a, 16).toRed(this.red); |
|
this.b = new bn(conf.b, 16).toRed(this.red); |
|
this.i4 = new bn(4).toRed(this.red).redInvm(); |
|
this.two = new bn(2).toRed(this.red); |
|
this.a24 = this.i4.redMul(this.a.redAdd(this.two)); |
|
} |
|
inherits(MontCurve, Base); |
|
module.exports = MontCurve; |
|
|
|
MontCurve.prototype.point = function point(x, z) { |
|
return new Point(this, x, z); |
|
}; |
|
|
|
MontCurve.prototype.pointFromJSON = function pointFromJSON(obj) { |
|
return Point.fromJSON(this, obj); |
|
} |
|
|
|
MontCurve.prototype.validate = function validate(point) { |
|
var x = point.normalize().x; |
|
var x2 = x.redSqr(); |
|
var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x); |
|
var y = rhs.redSqrt(); |
|
|
|
return y.redSqr().cmp(rhs) === 0; |
|
}; |
|
|
|
function Point(curve, x, z) { |
|
Base.BasePoint.call(this, curve, 'projective'); |
|
if (x === null && z === null) { |
|
this.x = this.curve.one; |
|
this.z = this.curve.zero; |
|
} else { |
|
this.x = new bn(x, 16); |
|
this.z = new bn(z, 16); |
|
if (!this.x.red) |
|
this.x = this.x.toRed(this.curve.red); |
|
if (!this.z.red) |
|
this.z = this.z.toRed(this.curve.red); |
|
} |
|
} |
|
inherits(Point, Base.BasePoint); |
|
|
|
Point.prototype.precompute = function precompute() { |
|
// No-op |
|
}; |
|
|
|
Point.fromJSON = function fromJSON(curve, obj) { |
|
return new Point(curve, obj[0], obj[1] || curve.one); |
|
}; |
|
|
|
Point.prototype.inspect = function inspect() { |
|
if (this.isInfinity()) |
|
return '<EC Point Infinity>'; |
|
return '<EC Point x: ' + this.x.fromRed().toString(16, 2) + |
|
' z: ' + this.z.fromRed().toString(16, 2) + '>'; |
|
}; |
|
|
|
Point.prototype.isInfinity = function isInfinity() { |
|
// XXX This code assumes that zero is always zero in red |
|
return this.z.cmpn(0) === 0; |
|
}; |
|
|
|
Point.prototype.dbl = function dbl() { |
|
// http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3 |
|
// 2M + 2S + 4A |
|
|
|
// A = X1 + Z1 |
|
var a = this.x.redAdd(this.z); |
|
// AA = A^2 |
|
var aa = a.redSqr(); |
|
// B = X1 - Z1 |
|
var b = this.x.redSub(this.z); |
|
// BB = B^2 |
|
var bb = b.redSqr(); |
|
// C = AA - BB |
|
var c = aa.redSub(bb); |
|
// X3 = AA * BB |
|
var nx = aa.redMul(bb); |
|
// Z3 = C * (BB + A24 * C) |
|
var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c))); |
|
return this.curve.point(nx, nz); |
|
}; |
|
|
|
Point.prototype.add = function add(p) { |
|
throw new Error('Not supported on Montgomery curve'); |
|
}; |
|
|
|
Point.prototype.diffAdd = function diffAdd(p, diff) { |
|
// http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3 |
|
// 4M + 2S + 6A |
|
|
|
// A = X2 + Z2 |
|
var a = this.x.redAdd(this.z); |
|
// B = X2 - Z2 |
|
var b = this.x.redSub(this.z); |
|
// C = X3 + Z3 |
|
var c = p.x.redAdd(p.z); |
|
// D = X3 - Z3 |
|
var d = p.x.redSub(p.z); |
|
// DA = D * A |
|
var da = d.redMul(a); |
|
// CB = C * B |
|
var cb = c.redMul(b); |
|
// X5 = Z1 * (DA + CB)^2 |
|
var nx = diff.z.redMul(da.redAdd(cb).redSqr()); |
|
// Z5 = X1 * (DA - CB)^2 |
|
var nz = diff.x.redMul(da.redISub(cb).redSqr()); |
|
return this.curve.point(nx, nz); |
|
}; |
|
|
|
Point.prototype.mul = function mul(k) { |
|
var t = k.clone(); |
|
var a = this; // (N / 2) * Q + Q |
|
var b = this.curve.point(null, null); // (N / 2) * Q |
|
var c = this; // Q |
|
|
|
for (var bits = []; t.cmpn(0) !== 0; t.ishrn(1)) |
|
bits.push(t.andln(1)); |
|
|
|
for (var i = bits.length - 1; i >= 0; i--) { |
|
if (bits[i] === 0) { |
|
// N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q |
|
a = a.diffAdd(b, c); |
|
// N * Q = 2 * ((N / 2) * Q + Q)) |
|
b = b.dbl(); |
|
} else { |
|
// N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q) |
|
b = a.diffAdd(b, c); |
|
// N * Q + Q = 2 * ((N / 2) * Q + Q) |
|
a = a.dbl(); |
|
} |
|
} |
|
return b; |
|
}; |
|
|
|
Point.prototype.mulAdd = function mulAdd() { |
|
throw new Error('Not supported on Montgomery curve'); |
|
}; |
|
|
|
Point.prototype.normalize = function normalize() { |
|
this.x = this.x.redMul(this.z.redInvm()); |
|
this.z = this.curve.one; |
|
return this; |
|
}; |
|
|
|
Point.prototype.getX = function getX() { |
|
// Normalize coordinates |
|
this.normalize(); |
|
|
|
return this.x.fromRed(); |
|
}; |
|
|
|
},{"../../elliptic":201,"../curve":204,"bn.js":199,"inherits":320}],206:[function(require,module,exports){ |
|
var curve = require('../curve'); |
|
var elliptic = require('../../elliptic'); |
|
var bn = require('bn.js'); |
|
var inherits = require('inherits'); |
|
var Base = curve.base; |
|
|
|
var getNAF = elliptic.utils.getNAF; |
|
var assert = elliptic.utils.assert; |
|
|
|
function ShortCurve(conf) { |
|
Base.call(this, 'short', conf); |
|
|
|
this.a = new bn(conf.a, 16).toRed(this.red); |
|
this.b = new bn(conf.b, 16).toRed(this.red); |
|
this.tinv = this.two.redInvm(); |
|
|
|
this.zeroA = this.a.fromRed().cmpn(0) === 0; |
|
this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0; |
|
|
|
// If the curve is endomorphic, precalculate beta and lambda |
|
this.endo = this._getEndomorphism(conf); |
|
this._endoWnafT1 = new Array(4); |
|
this._endoWnafT2 = new Array(4); |
|
} |
|
inherits(ShortCurve, Base); |
|
module.exports = ShortCurve; |
|
|
|
ShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) { |
|
// No efficient endomorphism |
|
if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1) |
|
return; |
|
|
|
// Compute beta and lambda, that lambda * P = (beta * Px; Py) |
|
var beta; |
|
var lambda; |
|
if (conf.beta) { |
|
beta = new bn(conf.beta, 16).toRed(this.red); |
|
} else { |
|
var betas = this._getEndoRoots(this.p); |
|
// Choose the smallest beta |
|
beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]; |
|
beta = beta.toRed(this.red); |
|
} |
|
if (conf.lambda) { |
|
lambda = new bn(conf.lambda, 16); |
|
} else { |
|
// Choose the lambda that is matching selected beta |
|
var lambdas = this._getEndoRoots(this.n); |
|
if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) { |
|
lambda = lambdas[0]; |
|
} else { |
|
lambda = lambdas[1]; |
|
assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0); |
|
} |
|
} |
|
|
|
// Get basis vectors, used for balanced length-two representation |
|
var basis; |
|
if (conf.basis) { |
|
basis = conf.basis.map(function(vec) { |
|
return { |
|
a: new bn(vec.a, 16), |
|
b: new bn(vec.b, 16), |
|
}; |
|
}); |
|
} else { |
|
basis = this._getEndoBasis(lambda); |
|
} |
|
|
|
return { |
|
beta: beta, |
|
lambda: lambda, |
|
basis: basis |
|
}; |
|
}; |
|
|
|
ShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) { |
|
// Find roots of for x^2 + x + 1 in F |
|
// Root = (-1 +- Sqrt(-3)) / 2 |
|
// |
|
var red = num === this.p ? this.red : bn.mont(num); |
|
var tinv = new bn(2).toRed(red).redInvm(); |
|
var ntinv = tinv.redNeg(); |
|
var one = new bn(1).toRed(red); |
|
|
|
var s = new bn(3).toRed(red).redNeg().redSqrt().redMul(tinv); |
|
|
|
var l1 = ntinv.redAdd(s).fromRed(); |
|
var l2 = ntinv.redSub(s).fromRed(); |
|
return [ l1, l2 ]; |
|
}; |
|
|
|
ShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) { |
|
// aprxSqrt >= sqrt(this.n) |
|
var aprxSqrt = this.n.shrn(Math.floor(this.n.bitLength() / 2)); |
|
|
|
// 3.74 |
|
// Run EGCD, until r(L + 1) < aprxSqrt |
|
var u = lambda; |
|
var v = this.n.clone(); |
|
var x1 = new bn(1); |
|
var y1 = new bn(0); |
|
var x2 = new bn(0); |
|
var y2 = new bn(1); |
|
|
|
// NOTE: all vectors are roots of: a + b * lambda = 0 (mod n) |
|
var a0; |
|
var b0; |
|
// First vector |
|
var a1; |
|
var b1; |
|
// Second vector |
|
var a2; |
|
var b2; |
|
|
|
var prevR; |
|
var i = 0; |
|
while (u.cmpn(0) !== 0) { |
|
var q = v.div(u); |
|
var r = v.sub(q.mul(u)); |
|
var x = x2.sub(q.mul(x1)); |
|
var y = y2.sub(q.mul(y1)); |
|
|
|
if (!a1 && r.cmp(aprxSqrt) < 0) { |
|
a0 = prevR.neg(); |
|
b0 = x1; |
|
a1 = r.neg(); |
|
b1 = x; |
|
} else if (a1 && ++i === 2) { |
|
break; |
|
} |
|
prevR = r; |
|
|
|
v = u; |
|
u = r; |
|
x2 = x1; |
|
x1 = x; |
|
y2 = y1; |
|
y1 = y; |
|
} |
|
a2 = r.neg(); |
|
b2 = x; |
|
|
|
var len1 = a1.sqr().add(b1.sqr()); |
|
var len2 = a2.sqr().add(b2.sqr()); |
|
if (len2.cmp(len1) >= 0) { |
|
a2 = a0; |
|
b2 = b0; |
|
} |
|
|
|
// Normalize signs |
|
if (a1.sign) { |
|
a1 = a1.neg(); |
|
b1 = b1.neg(); |
|
} |
|
if (a2.sign) { |
|
a2 = a2.neg(); |
|
b2 = b2.neg(); |
|
} |
|
|
|
return [ |
|
{ a: a1, b: b1 }, |
|
{ a: a2, b: b2 } |
|
]; |
|
}; |
|
|
|
ShortCurve.prototype._endoSplit = function _endoSplit(k) { |
|
var basis = this.endo.basis; |
|
var v1 = basis[0]; |
|
var v2 = basis[1]; |
|
|
|
var c1 = v2.b.mul(k).divRound(this.n); |
|
var c2 = v1.b.neg().mul(k).divRound(this.n); |
|
|
|
var p1 = c1.mul(v1.a); |
|
var p2 = c2.mul(v2.a); |
|
var q1 = c1.mul(v1.b); |
|
var q2 = c2.mul(v2.b); |
|
|
|
// Calculate answer |
|
var k1 = k.sub(p1).sub(p2); |
|
var k2 = q1.add(q2).neg(); |
|
return { k1: k1, k2: k2 }; |
|
}; |
|
|
|
ShortCurve.prototype.point = function point(x, y, isRed) { |
|
return new Point(this, x, y, isRed); |
|
}; |
|
|
|
ShortCurve.prototype.pointFromX = function pointFromX(odd, x) { |
|
x = new bn(x, 16); |
|
if (!x.red) |
|
x = x.toRed(this.red); |
|
|
|
var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b); |
|
var y = y2.redSqrt(); |
|
|
|
// XXX Is there any way to tell if the number is odd without converting it |
|
// to non-red form? |
|
var isOdd = y.fromRed().isOdd(); |
|
if (odd && !isOdd || !odd && isOdd) |
|
y = y.redNeg(); |
|
|
|
return this.point(x, y); |
|
}; |
|
|
|
ShortCurve.prototype.jpoint = function jpoint(x, y, z) { |
|
return new JPoint(this, x, y, z); |
|
}; |
|
|
|
ShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) { |
|
return Point.fromJSON(this, obj, red); |
|
}; |
|
|
|
ShortCurve.prototype.validate = function validate(point) { |
|
if (point.inf) |
|
return true; |
|
|
|
var x = point.x; |
|
var y = point.y; |
|
|
|
var ax = this.a.redMul(x); |
|
var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b); |
|
return y.redSqr().redISub(rhs).cmpn(0) === 0; |
|
}; |
|
|
|
ShortCurve.prototype._endoWnafMulAdd = function _endoWnafMulAdd(points, coeffs) { |
|
var npoints = this._endoWnafT1; |
|
var ncoeffs = this._endoWnafT2; |
|
for (var i = 0; i < points.length; i++) { |
|
var split = this._endoSplit(coeffs[i]); |
|
var p = points[i]; |
|
var beta = p._getBeta(); |
|
|
|
if (split.k1.sign) { |
|
split.k1.sign = !split.k1.sign; |
|
p = p.neg(true); |
|
} |
|
if (split.k2.sign) { |
|
split.k2.sign = !split.k2.sign; |
|
beta = beta.neg(true); |
|
} |
|
|
|
npoints[i * 2] = p; |
|
npoints[i * 2 + 1] = beta; |
|
ncoeffs[i * 2] = split.k1; |
|
ncoeffs[i * 2 + 1] = split.k2; |
|
} |
|
var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2); |
|
|
|
// Clean-up references to points and coefficients |
|
for (var j = 0; j < i * 2; j++) { |
|
npoints[j] = null; |
|
ncoeffs[j] = null; |
|
} |
|
return res; |
|
}; |
|
|
|
function Point(curve, x, y, isRed) { |
|
Base.BasePoint.call(this, curve, 'affine'); |
|
if (x === null && y === null) { |
|
this.x = null; |
|
this.y = null; |
|
this.inf = true; |
|
} else { |
|
this.x = new bn(x, 16); |
|
this.y = new bn(y, 16); |
|
// Force redgomery representation when loading from JSON |
|
if (isRed) { |
|
this.x.forceRed(this.curve.red); |
|
this.y.forceRed(this.curve.red); |
|
} |
|
if (!this.x.red) |
|
this.x = this.x.toRed(this.curve.red); |
|
if (!this.y.red) |
|
this.y = this.y.toRed(this.curve.red); |
|
this.inf = false; |
|
} |
|
} |
|
inherits(Point, Base.BasePoint); |
|
|
|
Point.prototype._getBeta = function _getBeta() { |
|
if (!this.curve.endo) |
|
return; |
|
|
|
var pre = this.precomputed; |
|
if (pre && pre.beta) |
|
return pre.beta; |
|
|
|
var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y); |
|
if (pre) { |
|
var curve = this.curve; |
|
function endoMul(p) { |
|
return curve.point(p.x.redMul(curve.endo.beta), p.y); |
|
} |
|
pre.beta = beta; |
|
beta.precomputed = { |
|
beta: null, |
|
naf: pre.naf && { |
|
wnd: pre.naf.wnd, |
|
points: pre.naf.points.map(endoMul) |
|
}, |
|
doubles: pre.doubles && { |
|
step: pre.doubles.step, |
|
points: pre.doubles.points.map(endoMul) |
|
} |
|
}; |
|
} |
|
return beta; |
|
}; |
|
|
|
Point.prototype.toJSON = function toJSON() { |
|
if (!this.precomputed) |
|
return [ this.x, this.y ]; |
|
|
|
return [ this.x, this.y, this.precomputed && { |
|
doubles: this.precomputed.doubles && { |
|
step: this.precomputed.doubles.step, |
|
points: this.precomputed.doubles.points.slice(1) |
|
}, |
|
naf: this.precomputed.naf && { |
|
wnd: this.precomputed.naf.wnd, |
|
points: this.precomputed.naf.points.slice(1) |
|
} |
|
}]; |
|
}; |
|
|
|
Point.fromJSON = function fromJSON(curve, obj, red) { |
|
if (typeof obj === 'string') |
|
obj = JSON.parse(obj); |
|
var res = curve.point(obj[0], obj[1], red); |
|
if (!obj[2]) |
|
return res; |
|
|
|
function obj2point(obj) { |
|
return curve.point(obj[0], obj[1], red); |
|
} |
|
|
|
var pre = obj[2]; |
|
res.precomputed = { |
|
beta: null, |
|
doubles: pre.doubles && { |
|
step: pre.doubles.step, |
|
points: [ res ].concat(pre.doubles.points.map(obj2point)) |
|
}, |
|
naf: pre.naf && { |
|
wnd: pre.naf.wnd, |
|
points: [ res ].concat(pre.naf.points.map(obj2point)) |
|
} |
|
}; |
|
return res; |
|
}; |
|
|
|
Point.prototype.inspect = function inspect() { |
|
if (this.isInfinity()) |
|
return '<EC Point Infinity>'; |
|
return '<EC Point x: ' + this.x.fromRed().toString(16 ,2) + |
|
' y: ' + this.y.fromRed().toString(16, 2) + '>'; |
|
}; |
|
|
|
Point.prototype.isInfinity = function isInfinity() { |
|
return this.inf; |
|
}; |
|
|
|
Point.prototype.add = function add(p) { |
|
// O + P = P |
|
if (this.inf) |
|
return p; |
|
|
|
// P + O = P |
|
if (p.inf) |
|
return this; |
|
|
|
// P + P = 2P |
|
if (this.eq(p)) |
|
return this.dbl(); |
|
|
|
// P + (-P) = O |
|
if (this.neg().eq(p)) |
|
return this.curve.point(null, null); |
|
|
|
// P + Q = O |
|
if (this.x.cmp(p.x) === 0) |
|
return this.curve.point(null, null); |
|
|
|
var c = this.y.redSub(p.y); |
|
if (c.cmpn(0) !== 0) |
|
c = c.redMul(this.x.redSub(p.x).redInvm()); |
|
var nx = c.redSqr().redISub(this.x).redISub(p.x); |
|
var ny = c.redMul(this.x.redSub(nx)).redISub(this.y); |
|
return this.curve.point(nx, ny); |
|
}; |
|
|
|
Point.prototype.dbl = function dbl() { |
|
if (this.inf) |
|
return this; |
|
|
|
// 2P = O |
|
var ys1 = this.y.redAdd(this.y); |
|
if (ys1.cmpn(0) === 0) |
|
return this.curve.point(null, null); |
|
|
|
var a = this.curve.a; |
|
|
|
var x2 = this.x.redSqr(); |
|
var dyinv = ys1.redInvm(); |
|
var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv); |
|
|
|
var nx = c.redSqr().redISub(this.x.redAdd(this.x)); |
|
var ny = c.redMul(this.x.redSub(nx)).redISub(this.y); |
|
return this.curve.point(nx, ny); |
|
}; |
|
|
|
Point.prototype.getX = function getX() { |
|
return this.x.fromRed(); |
|
}; |
|
|
|
Point.prototype.getY = function getY() { |
|
return this.y.fromRed(); |
|
}; |
|
|
|
Point.prototype.mul = function mul(k) { |
|
k = new bn(k, 16); |
|
|
|
if (this.precomputed && this.precomputed.doubles) |
|
return this.curve._fixedNafMul(this, k); |
|
else if (this.curve.endo) |
|
return this.curve._endoWnafMulAdd([ this ], [ k ]); |
|
else |
|
return this.curve._wnafMul(this, k); |
|
}; |
|
|
|
Point.prototype.mulAdd = function mulAdd(k1, p2, k2) { |
|
var points = [ this, p2 ]; |
|
var coeffs = [ k1, k2 ]; |
|
if (this.curve.endo) |
|
return this.curve._endoWnafMulAdd(points, coeffs); |
|
else |
|
return this.curve._wnafMulAdd(1, points, coeffs, 2); |
|
}; |
|
|
|
Point.prototype.eq = function eq(p) { |
|
return this === p || |
|
this.inf === p.inf && |
|
(this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0); |
|
}; |
|
|
|
Point.prototype.neg = function neg(_precompute) { |
|
if (this.inf) |
|
return this; |
|
|
|
var res = this.curve.point(this.x, this.y.redNeg()); |
|
if (_precompute && this.precomputed) { |
|
var pre = this.precomputed; |
|
function negate(p) { |
|
return p.neg(); |
|
} |
|
res.precomputed = { |
|
naf: pre.naf && { |
|
wnd: pre.naf.wnd, |
|
points: pre.naf.points.map(negate) |
|
}, |
|
doubles: pre.doubles && { |
|
step: pre.doubles.step, |
|
points: pre.doubles.points.map(negate) |
|
} |
|
}; |
|
} |
|
return res; |
|
}; |
|
|
|
Point.prototype.toJ = function toJ() { |
|
if (this.inf) |
|
return this.curve.jpoint(null, null, null); |
|
|
|
var res = this.curve.jpoint(this.x, this.y, this.curve.one); |
|
return res; |
|
}; |
|
|
|
function JPoint(curve, x, y, z) { |
|
Base.BasePoint.call(this, curve, 'jacobian'); |
|
if (x === null && y === null && z === null) { |
|
this.x = this.curve.one; |
|
this.y = this.curve.one; |
|
this.z = new bn(0); |
|
} else { |
|
this.x = new bn(x, 16); |
|
this.y = new bn(y, 16); |
|
this.z = new bn(z, 16); |
|
} |
|
if (!this.x.red) |
|
this.x = this.x.toRed(this.curve.red); |
|
if (!this.y.red) |
|
this.y = this.y.toRed(this.curve.red); |
|
if (!this.z.red) |
|
this.z = this.z.toRed(this.curve.red); |
|
|
|
this.zOne = this.z === this.curve.one; |
|
} |
|
inherits(JPoint, Base.BasePoint); |
|
|
|
JPoint.prototype.toP = function toP() { |
|
if (this.isInfinity()) |
|
return this.curve.point(null, null); |
|
|
|
var zinv = this.z.redInvm(); |
|
var zinv2 = zinv.redSqr(); |
|
var ax = this.x.redMul(zinv2); |
|
var ay = this.y.redMul(zinv2).redMul(zinv); |
|
|
|
return this.curve.point(ax, ay); |
|
}; |
|
|
|
JPoint.prototype.neg = function neg() { |
|
return this.curve.jpoint(this.x, this.y.redNeg(), this.z); |
|
}; |
|
|
|
JPoint.prototype.add = function add(p) { |
|
// O + P = P |
|
if (this.isInfinity()) |
|
return p; |
|
|
|
// P + O = P |
|
if (p.isInfinity()) |
|
return this; |
|
|
|
// 12M + 4S + 7A |
|
var pz2 = p.z.redSqr(); |
|
var z2 = this.z.redSqr(); |
|
var u1 = this.x.redMul(pz2); |
|
var u2 = p.x.redMul(z2); |
|
var s1 = this.y.redMul(pz2.redMul(p.z)); |
|
var s2 = p.y.redMul(z2.redMul(this.z)); |
|
|
|
var h = u1.redSub(u2); |
|
var r = s1.redSub(s2); |
|
if (h.cmpn(0) === 0) { |
|
if (r.cmpn(0) !== 0) |
|
return this.curve.jpoint(null, null, null); |
|
else |
|
return this.dbl(); |
|
} |
|
|
|
var h2 = h.redSqr(); |
|
var h3 = h2.redMul(h); |
|
var v = u1.redMul(h2); |
|
|
|
var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); |
|
var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); |
|
var nz = this.z.redMul(p.z).redMul(h); |
|
|
|
return this.curve.jpoint(nx, ny, nz); |
|
}; |
|
|
|
JPoint.prototype.mixedAdd = function mixedAdd(p) { |
|
// O + P = P |
|
if (this.isInfinity()) |
|
return p.toJ(); |
|
|
|
// P + O = P |
|
if (p.isInfinity()) |
|
return this; |
|
|
|
// 8M + 3S + 7A |
|
var z2 = this.z.redSqr(); |
|
var u1 = this.x; |
|
var u2 = p.x.redMul(z2); |
|
var s1 = this.y; |
|
var s2 = p.y.redMul(z2).redMul(this.z); |
|
|
|
var h = u1.redSub(u2); |
|
var r = s1.redSub(s2); |
|
if (h.cmpn(0) === 0) { |
|
if (r.cmpn(0) !== 0) |
|
return this.curve.jpoint(null, null, null); |
|
else |
|
return this.dbl(); |
|
} |
|
|
|
var h2 = h.redSqr(); |
|
var h3 = h2.redMul(h); |
|
var v = u1.redMul(h2); |
|
|
|
var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); |
|
var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); |
|
var nz = this.z.redMul(h); |
|
|
|
return this.curve.jpoint(nx, ny, nz); |
|
}; |
|
|
|
JPoint.prototype.dblp = function dblp(pow) { |
|
if (pow === 0) |
|
return this; |
|
if (this.isInfinity()) |
|
return this; |
|
if (!pow) |
|
return this.dbl(); |
|
|
|
if (this.curve.zeroA || this.curve.threeA) { |
|
var r = this; |
|
for (var i = 0; i < pow; i++) |
|
r = r.dbl(); |
|
return r; |
|
} |
|
|
|
// 1M + 2S + 1A + N * (4S + 5M + 8A) |
|
// N = 1 => 6M + 6S + 9A |
|
var a = this.curve.a; |
|
var tinv = this.curve.tinv; |
|
|
|
var jx = this.x; |
|
var jy = this.y; |
|
var jz = this.z; |
|
var jz4 = jz.redSqr().redSqr(); |
|
|
|
// Reuse results |
|
var jyd = jy.redAdd(jy); |
|
for (var i = 0; i < pow; i++) { |
|
var jx2 = jx.redSqr(); |
|
var jyd2 = jyd.redSqr(); |
|
var jyd4 = jyd2.redSqr(); |
|
var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)); |
|
|
|
var t1 = jx.redMul(jyd2); |
|
var nx = c.redSqr().redISub(t1.redAdd(t1)); |
|
var t2 = t1.redISub(nx); |
|
var dny = c.redMul(t2); |
|
dny = dny.redIAdd(dny).redISub(jyd4); |
|
var nz = jyd.redMul(jz); |
|
if (i + 1 < pow) |
|
jz4 = jz4.redMul(jyd4); |
|
|
|
jx = nx; |
|
jz = nz; |
|
jyd = dny; |
|
} |
|
|
|
return this.curve.jpoint(jx, jyd.redMul(tinv), jz); |
|
}; |
|
|
|
JPoint.prototype.dbl = function dbl() { |
|
if (this.isInfinity()) |
|
return this; |
|
|
|
if (this.curve.zeroA) |
|
return this._zeroDbl(); |
|
else if (this.curve.threeA) |
|
return this._threeDbl(); |
|
else |
|
return this._dbl(); |
|
}; |
|
|
|
JPoint.prototype._zeroDbl = function _zeroDbl() { |
|
// Z = 1 |
|
if (this.zOne) { |
|
// http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#doubling-mdbl-2007-bl |
|
// 1M + 5S + 14A |
|
|
|
// XX = X1^2 |
|
var xx = this.x.redSqr(); |
|
// YY = Y1^2 |
|
var yy = this.y.redSqr(); |
|
// YYYY = YY^2 |
|
var yyyy = yy.redSqr(); |
|
// S = 2 * ((X1 + YY)^2 - XX - YYYY) |
|
var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); |
|
s = s.redIAdd(s); |
|
// M = 3 * XX + a; a = 0 |
|
var m = xx.redAdd(xx).redIAdd(xx); |
|
// T = M ^ 2 - 2*S |
|
var t = m.redSqr().redISub(s).redISub(s); |
|
|
|
// 8 * YYYY |
|
var yyyy8 = yyyy.redIAdd(yyyy); |
|
yyyy8 = yyyy8.redIAdd(yyyy8); |
|
yyyy8 = yyyy8.redIAdd(yyyy8); |
|
|
|
// X3 = T |
|
var nx = t; |
|
// Y3 = M * (S - T) - 8 * YYYY |
|
var ny = m.redMul(s.redISub(t)).redISub(yyyy8); |
|
// Z3 = 2*Y1 |
|
var nz = this.y.redAdd(this.y); |
|
} else { |
|
// http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#doubling-dbl-2009-l |
|
// 2M + 5S + 13A |
|
|
|
// A = X1^2 |
|
var a = this.x.redSqr(); |
|
// B = Y1^2 |
|
var b = this.y.redSqr(); |
|
// C = B^2 |
|
var c = b.redSqr(); |
|
// D = 2 * ((X1 + B)^2 - A - C) |
|
var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c); |
|
d = d.redIAdd(d); |
|
// E = 3 * A |
|
var e = a.redAdd(a).redIAdd(a); |
|
// F = E^2 |
|
var f = e.redSqr(); |
|
|
|
// 8 * C |
|
var c8 = c.redIAdd(c); |
|
c8 = c8.redIAdd(c8); |
|
c8 = c8.redIAdd(c8); |
|
|
|
// X3 = F - 2 * D |
|
var nx = f.redISub(d).redISub(d); |
|
// Y3 = E * (D - X3) - 8 * C |
|
var ny = e.redMul(d.redISub(nx)).redISub(c8); |
|
// Z3 = 2 * Y1 * Z1 |
|
var nz = this.y.redMul(this.z); |
|
nz = nz.redIAdd(nz); |
|
} |
|
|
|
return this.curve.jpoint(nx, ny, nz); |
|
}; |
|
|
|
JPoint.prototype._threeDbl = function _threeDbl() { |
|
// Z = 1 |
|
if (this.zOne) { |
|
// http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-mdbl-2007-bl |
|
// 1M + 5S + 15A |
|
|
|
// XX = X1^2 |
|
var xx = this.x.redSqr(); |
|
// YY = Y1^2 |
|
var yy = this.y.redSqr(); |
|
// YYYY = YY^2 |
|
var yyyy = yy.redSqr(); |
|
// S = 2 * ((X1 + YY)^2 - XX - YYYY) |
|
var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); |
|
s = s.redIAdd(s); |
|
// M = 3 * XX + a |
|
var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a); |
|
// T = M^2 - 2 * S |
|
var t = m.redSqr().redISub(s).redISub(s); |
|
// X3 = T |
|
var nx = t; |
|
// Y3 = M * (S - T) - 8 * YYYY |
|
var yyyy8 = yyyy.redIAdd(yyyy); |
|
yyyy8 = yyyy8.redIAdd(yyyy8); |
|
yyyy8 = yyyy8.redIAdd(yyyy8); |
|
var ny = m.redMul(s.redISub(t)).redISub(yyyy8); |
|
// Z3 = 2 * Y1 |
|
var nz = this.y.redAdd(this.y); |
|
} else { |
|
// http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b |
|
// 3M + 5S |
|
|
|
// delta = Z1^2 |
|
var delta = this.z.redSqr(); |
|
// gamma = Y1^2 |
|
var gamma = this.y.redSqr(); |
|
// beta = X1 * gamma |
|
var beta = this.x.redMul(gamma); |
|
// alpha = 3 * (X1 - delta) * (X1 + delta) |
|
var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta)); |
|
alpha = alpha.redAdd(alpha).redIAdd(alpha); |
|
// X3 = alpha^2 - 8 * beta |
|
var beta4 = beta.redIAdd(beta); |
|
beta4 = beta4.redIAdd(beta4); |
|
var beta8 = beta4.redAdd(beta4); |
|
var nx = alpha.redSqr().redISub(beta8); |
|
// Z3 = (Y1 + Z1)^2 - gamma - delta |
|
var nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta); |
|
// Y3 = alpha * (4 * beta - X3) - 8 * gamma^2 |
|
var ggamma8 = gamma.redSqr(); |
|
ggamma8 = ggamma8.redIAdd(ggamma8); |
|
ggamma8 = ggamma8.redIAdd(ggamma8); |
|
ggamma8 = ggamma8.redIAdd(ggamma8); |
|
var ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8); |
|
} |
|
|
|
return this.curve.jpoint(nx, ny, nz); |
|
}; |
|
|
|
JPoint.prototype._dbl = function _dbl() { |
|
var a = this.curve.a; |
|
var tinv = this.curve.tinv; |
|
|
|
// 4M + 6S + 10A |
|
var jx = this.x; |
|
var jy = this.y; |
|
var jz = this.z; |
|
var jz4 = jz.redSqr().redSqr(); |
|
|
|
var jx2 = jx.redSqr(); |
|
var jy2 = jy.redSqr(); |
|
|
|
var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)); |
|
|
|
var jxd4 = jx.redAdd(jx); |
|
jxd4 = jxd4.redIAdd(jxd4); |
|
var t1 = jxd4.redMul(jy2); |
|
var nx = c.redSqr().redISub(t1.redAdd(t1)); |
|
var t2 = t1.redISub(nx); |
|
|
|
var jyd8 = jy2.redSqr(); |
|
jyd8 = jyd8.redIAdd(jyd8); |
|
jyd8 = jyd8.redIAdd(jyd8); |
|
jyd8 = jyd8.redIAdd(jyd8); |
|
var ny = c.redMul(t2).redISub(jyd8); |
|
var nz = jy.redAdd(jy).redMul(jz); |
|
|
|
return this.curve.jpoint(nx, ny, nz); |
|
}; |
|
|
|
JPoint.prototype.trpl = function trpl() { |
|
if (!this.curve.zeroA) |
|
return this.dbl().add(this); |
|
|
|
// http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl |
|
// 5M + 10S + ... |
|
|
|
// XX = X1^2 |
|
var xx = this.x.redSqr(); |
|
// YY = Y1^2 |
|
var yy = this.y.redSqr(); |
|
// ZZ = Z1^2 |
|
var zz = this.z.redSqr(); |
|
// YYYY = YY^2 |
|
var yyyy = yy.redSqr(); |
|
// M = 3 * XX + a * ZZ2; a = 0 |
|
var m = xx.redAdd(xx).redIAdd(xx); |
|
// MM = M^2 |
|
var mm = m.redSqr(); |
|
// E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM |
|
var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); |
|
e = e.redIAdd(e); |
|
e = e.redAdd(e).redIAdd(e); |
|
e = e.redISub(mm); |
|
// EE = E^2 |
|
var ee = e.redSqr(); |
|
// T = 16*YYYY |
|
var t = yyyy.redIAdd(yyyy); |
|
t = t.redIAdd(t); |
|
t = t.redIAdd(t); |
|
t = t.redIAdd(t); |
|
// U = (M + E)^2 - MM - EE - T |
|
var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t); |
|
// X3 = 4 * (X1 * EE - 4 * YY * U) |
|
var yyu4 = yy.redMul(u); |
|
yyu4 = yyu4.redIAdd(yyu4); |
|
yyu4 = yyu4.redIAdd(yyu4); |
|
var nx = this.x.redMul(ee).redISub(yyu4); |
|
nx = nx.redIAdd(nx); |
|
nx = nx.redIAdd(nx); |
|
// Y3 = 8 * Y1 * (U * (T - U) - E * EE) |
|
var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee))); |
|
ny = ny.redIAdd(ny); |
|
ny = ny.redIAdd(ny); |
|
ny = ny.redIAdd(ny); |
|
// Z3 = (Z1 + E)^2 - ZZ - EE |
|
var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee); |
|
|
|
return this.curve.jpoint(nx, ny, nz); |
|
}; |
|
|
|
JPoint.prototype.mul = function mul(k, kbase) { |
|
k = new bn(k, kbase); |
|
|
|
return this.curve._wnafMul(this, k); |
|
}; |
|
|
|
JPoint.prototype.eq = function eq(p) { |
|
if (p.type === 'affine') |
|
return this.eq(p.toJ()); |
|
|
|
if (this === p) |
|
return true; |
|
|
|
// x1 * z2^2 == x2 * z1^2 |
|
var z2 = this.z.redSqr(); |
|
var pz2 = p.z.redSqr(); |
|
if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) |
|
return false; |
|
|
|
// y1 * z2^3 == y2 * z1^3 |
|
var z3 = z2.redMul(this.z); |
|
var pz3 = pz2.redMul(p.z); |
|
return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0; |
|
}; |
|
|
|
JPoint.prototype.inspect = function inspect() { |
|
if (this.isInfinity()) |
|
return '<EC JPoint Infinity>'; |
|
return '<EC JPoint x: ' + this.x.toString(16, 2) + |
|
' y: ' + this.y.toString(16, 2) + |
|
' z: ' + this.z.toString(16, 2) + '>'; |
|
}; |
|
|
|
JPoint.prototype.isInfinity = function isInfinity() { |
|
// XXX This code assumes that zero is always zero in red |
|
return this.z.cmpn(0) === 0; |
|
}; |
|
|
|
},{"../../elliptic":201,"../curve":204,"bn.js":199,"inherits":320}],207:[function(require,module,exports){ |
|
var curves = exports; |
|
|
|
var hash = require('hash.js'); |
|
var bn = require('bn.js'); |
|
var elliptic = require('../elliptic'); |
|
|
|
var assert = elliptic.utils.assert; |
|
|
|
function PresetCurve(options) { |
|
if (options.type === 'short') |
|
this.curve = new elliptic.curve.short(options); |
|
else if (options.type === 'edwards') |
|
this.curve = new elliptic.curve.edwards(options); |
|
else |
|
this.curve = new elliptic.curve.mont(options); |
|
this.g = this.curve.g; |
|
this.n = this.curve.n; |
|
this.hash = options.hash; |
|
|
|
assert(this.g.validate(), 'Invalid curve'); |
|
assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O'); |
|
} |
|
curves.PresetCurve = PresetCurve; |
|
|
|
function defineCurve(name, options) { |
|
Object.defineProperty(curves, name, { |
|
configurable: true, |
|
enumerable: true, |
|
get: function() { |
|
var curve = new PresetCurve(options); |
|
Object.defineProperty(curves, name, { |
|
configurable: true, |
|
enumerable: true, |
|
value: curve |
|
}); |
|
return curve; |
|
} |
|
}); |
|
} |
|
|
|
defineCurve('p192', { |
|
type: 'short', |
|
prime: 'p192', |
|
p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff', |
|
a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc', |
|
b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1', |
|
n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831', |
|
hash: hash.sha256, |
|
gRed: false, |
|
g: [ |
|
'188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012', |
|
'07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811' |
|
], |
|
}); |
|
|
|
defineCurve('p224', { |
|
type: 'short', |
|
prime: 'p224', |
|
p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001', |
|
a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe', |
|
b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4', |
|
n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d', |
|
hash: hash.sha256, |
|
gRed: false, |
|
g: [ |
|
'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21', |
|
'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34' |
|
], |
|
}); |
|
|
|
defineCurve('p256', { |
|
type: 'short', |
|
prime: null, |
|
p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff', |
|
a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc', |
|
b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b', |
|
n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551', |
|
hash: hash.sha256, |
|
gRed: false, |
|
g: [ |
|
'6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296', |
|
'4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5' |
|
], |
|
}); |
|
|
|
defineCurve('curve25519', { |
|
type: 'mont', |
|
prime: 'p25519', |
|
p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed', |
|
a: '76d06', |
|
b: '0', |
|
n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed', |
|
hash: hash.sha256, |
|
gRed: false, |
|
g: [ |
|
'9' |
|
] |
|
}); |
|
|
|
defineCurve('ed25519', { |
|
type: 'edwards', |
|
prime: 'p25519', |
|
p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed', |
|
a: '-1', |
|
c: '1', |
|
// -121665 * (121666^(-1)) (mod P) |
|
d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3', |
|
n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed', |
|
hash: hash.sha256, |
|
gRed: false, |
|
g: [ |
|
'216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a', |
|
|
|
// 4/5 |
|
'6666666666666666666666666666666666666666666666666666666666666658' |
|
] |
|
}); |
|
|
|
defineCurve('secp256k1', { |
|
type: 'short', |
|
prime: 'k256', |
|
p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f', |
|
a: '0', |
|
b: '7', |
|
n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141', |
|
h: '1', |
|
hash: hash.sha256, |
|
|
|
// Precomputed endomorphism |
|
beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee', |
|
lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72', |
|
basis: [ |
|
{ |
|
a: '3086d221a7d46bcde86c90e49284eb15', |
|
b: '-e4437ed6010e88286f547fa90abfe4c3' |
|
}, |
|
{ |
|
a: '114ca50f7a8e2f3f657c1108d9d44cfd8', |
|
b: '3086d221a7d46bcde86c90e49284eb15' |
|
} |
|
], |
|
|
|
gRed: false, |
|
g: [ |
|
'79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798', |
|
'483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8', |
|
{ |
|
'doubles': { |
|
'step': 4, |
|
'points': [ |
|
[ |
|
'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a', |
|
'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821' |
|
], |
|
[ |
|
'8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508', |
|
'11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf' |
|
], |
|
[ |
|
'175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739', |
|
'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695' |
|
], |
|
[ |
|
'363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640', |
|
'4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9' |
|
], |
|
[ |
|
'8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c', |
|
'4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36' |
|
], |
|
[ |
|
'723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda', |
|
'96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f' |
|
], |
|
[ |
|
'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa', |
|
'5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999' |
|
], |
|
[ |
|
'100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0', |
|
'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09' |
|
], |
|
[ |
|
'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d', |
|
'9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d' |
|
], |
|
[ |
|
'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d', |
|
'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088' |
|
], |
|
[ |
|
'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1', |
|
'9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d' |
|
], |
|
[ |
|
'53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0', |
|
'5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8' |
|
], |
|
[ |
|
'8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047', |
|
'10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a' |
|
], |
|
[ |
|
'385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862', |
|
'283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453' |
|
], |
|
[ |
|
'6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7', |
|
'7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160' |
|
], |
|
[ |
|
'3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd', |
|
'56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0' |
|
], |
|
[ |
|
'85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83', |
|
'7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6' |
|
], |
|
[ |
|
'948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a', |
|
'53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589' |
|
], |
|
[ |
|
'6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8', |
|
'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17' |
|
], |
|
[ |
|
'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d', |
|
'4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda' |
|
], |
|
[ |
|
'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725', |
|
'7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd' |
|
], |
|
[ |
|
'213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754', |
|
'4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2' |
|
], |
|
[ |
|
'4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c', |
|
'17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6' |
|
], |
|
[ |
|
'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6', |
|
'6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f' |
|
], |
|
[ |
|
'76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39', |
|
'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01' |
|
], |
|
[ |
|
'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891', |
|
'893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3' |
|
], |
|
[ |
|
'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b', |
|
'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f' |
|
], |
|
[ |
|
'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03', |
|
'2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7' |
|
], |
|
[ |
|
'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d', |
|
'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78' |
|
], |
|
[ |
|
'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070', |
|
'7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1' |
|
], |
|
[ |
|
'90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4', |
|
'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150' |
|
], |
|
[ |
|
'8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da', |
|
'662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82' |
|
], |
|
[ |
|
'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11', |
|
'1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc' |
|
], |
|
[ |
|
'8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e', |
|
'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b' |
|
], |
|
[ |
|
'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41', |
|
'2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51' |
|
], |
|
[ |
|
'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef', |
|
'67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45' |
|
], |
|
[ |
|
'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8', |
|
'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120' |
|
], |
|
[ |
|
'324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d', |
|
'648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84' |
|
], |
|
[ |
|
'4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96', |
|
'35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d' |
|
], |
|
[ |
|
'9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd', |
|
'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d' |
|
], |
|
[ |
|
'6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5', |
|
'9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8' |
|
], |
|
[ |
|
'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266', |
|
'40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8' |
|
], |
|
[ |
|
'7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71', |
|
'34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac' |
|
], |
|
[ |
|
'928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac', |
|
'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f' |
|
], |
|
[ |
|
'85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751', |
|
'1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962' |
|
], |
|
[ |
|
'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e', |
|
'493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907' |
|
], |
|
[ |
|
'827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241', |
|
'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec' |
|
], |
|
[ |
|
'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3', |
|
'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d' |
|
], |
|
[ |
|
'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f', |
|
'4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414' |
|
], |
|
[ |
|
'1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19', |
|
'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd' |
|
], |
|
[ |
|
'146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be', |
|
'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0' |
|
], |
|
[ |
|
'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9', |
|
'6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811' |
|
], |
|
[ |
|
'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2', |
|
'8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1' |
|
], |
|
[ |
|
'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13', |
|
'7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c' |
|
], |
|
[ |
|
'174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c', |
|
'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73' |
|
], |
|
[ |
|
'959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba', |
|
'2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd' |
|
], |
|
[ |
|
'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151', |
|
'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405' |
|
], |
|
[ |
|
'64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073', |
|
'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589' |
|
], |
|
[ |
|
'8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458', |
|
'38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e' |
|
], |
|
[ |
|
'13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b', |
|
'69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27' |
|
], |
|
[ |
|
'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366', |
|
'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1' |
|
], |
|
[ |
|
'8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa', |
|
'40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482' |
|
], |
|
[ |
|
'8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0', |
|
'620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945' |
|
], |
|
[ |
|
'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787', |
|
'7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573' |
|
], |
|
[ |
|
'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e', |
|
'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82' |
|
] |
|
] |
|
}, |
|
'naf': { |
|
'wnd': 7, |
|
'points': [ |
|
[ |
|
'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9', |
|
'388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672' |
|
], |
|
[ |
|
'2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4', |
|
'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6' |
|
], |
|
[ |
|
'5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc', |
|
'6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da' |
|
], |
|
[ |
|
'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe', |
|
'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37' |
|
], |
|
[ |
|
'774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb', |
|
'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b' |
|
], |
|
[ |
|
'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8', |
|
'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81' |
|
], |
|
[ |
|
'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e', |
|
'581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58' |
|
], |
|
[ |
|
'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34', |
|
'4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77' |
|
], |
|
[ |
|
'2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c', |
|
'85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a' |
|
], |
|
[ |
|
'352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5', |
|
'321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c' |
|
], |
|
[ |
|
'2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f', |
|
'2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67' |
|
], |
|
[ |
|
'9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714', |
|
'73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402' |
|
], |
|
[ |
|
'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729', |
|
'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55' |
|
], |
|
[ |
|
'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db', |
|
'2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482' |
|
], |
|
[ |
|
'6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4', |
|
'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82' |
|
], |
|
[ |
|
'1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5', |
|
'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396' |
|
], |
|
[ |
|
'605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479', |
|
'2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49' |
|
], |
|
[ |
|
'62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d', |
|
'80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf' |
|
], |
|
[ |
|
'80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f', |
|
'1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a' |
|
], |
|
[ |
|
'7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb', |
|
'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7' |
|
], |
|
[ |
|
'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9', |
|
'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933' |
|
], |
|
[ |
|
'49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963', |
|
'758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a' |
|
], |
|
[ |
|
'77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74', |
|
'958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6' |
|
], |
|
[ |
|
'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530', |
|
'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37' |
|
], |
|
[ |
|
'463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b', |
|
'5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e' |
|
], |
|
[ |
|
'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247', |
|
'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6' |
|
], |
|
[ |
|
'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1', |
|
'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476' |
|
], |
|
[ |
|
'2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120', |
|
'4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40' |
|
], |
|
[ |
|
'7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435', |
|
'91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61' |
|
], |
|
[ |
|
'754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18', |
|
'673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683' |
|
], |
|
[ |
|
'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8', |
|
'59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5' |
|
], |
|
[ |
|
'186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb', |
|
'3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b' |
|
], |
|
[ |
|
'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f', |
|
'55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417' |
|
], |
|
[ |
|
'5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143', |
|
'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868' |
|
], |
|
[ |
|
'290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba', |
|
'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a' |
|
], |
|
[ |
|
'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45', |
|
'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6' |
|
], |
|
[ |
|
'766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a', |
|
'744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996' |
|
], |
|
[ |
|
'59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e', |
|
'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e' |
|
], |
|
[ |
|
'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8', |
|
'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d' |
|
], |
|
[ |
|
'7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c', |
|
'30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2' |
|
], |
|
[ |
|
'948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519', |
|
'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e' |
|
], |
|
[ |
|
'7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab', |
|
'100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437' |
|
], |
|
[ |
|
'3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca', |
|
'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311' |
|
], |
|
[ |
|
'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf', |
|
'8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4' |
|
], |
|
[ |
|
'1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610', |
|
'68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575' |
|
], |
|
[ |
|
'733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4', |
|
'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d' |
|
], |
|
[ |
|
'15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c', |
|
'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d' |
|
], |
|
[ |
|
'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940', |
|
'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629' |
|
], |
|
[ |
|
'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980', |
|
'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06' |
|
], |
|
[ |
|
'311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3', |
|
'66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374' |
|
], |
|
[ |
|
'34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf', |
|
'9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee' |
|
], |
|
[ |
|
'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63', |
|
'4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1' |
|
], |
|
[ |
|
'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448', |
|
'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b' |
|
], |
|
[ |
|
'32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf', |
|
'5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661' |
|
], |
|
[ |
|
'7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5', |
|
'8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6' |
|
], |
|
[ |
|
'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6', |
|
'8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e' |
|
], |
|
[ |
|
'16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5', |
|
'5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d' |
|
], |
|
[ |
|
'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99', |
|
'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc' |
|
], |
|
[ |
|
'78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51', |
|
'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4' |
|
], |
|
[ |
|
'494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5', |
|
'42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c' |
|
], |
|
[ |
|
'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5', |
|
'204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b' |
|
], |
|
[ |
|
'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997', |
|
'4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913' |
|
], |
|
[ |
|
'841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881', |
|
'73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154' |
|
], |
|
[ |
|
'5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5', |
|
'39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865' |
|
], |
|
[ |
|
'36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66', |
|
'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc' |
|
], |
|
[ |
|
'336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726', |
|
'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224' |
|
], |
|
[ |
|
'8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede', |
|
'6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e' |
|
], |
|
[ |
|
'1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94', |
|
'60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6' |
|
], |
|
[ |
|
'85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31', |
|
'3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511' |
|
], |
|
[ |
|
'29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51', |
|
'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b' |
|
], |
|
[ |
|
'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252', |
|
'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2' |
|
], |
|
[ |
|
'4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5', |
|
'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c' |
|
], |
|
[ |
|
'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b', |
|
'6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3' |
|
], |
|
[ |
|
'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4', |
|
'322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d' |
|
], |
|
[ |
|
'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f', |
|
'6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700' |
|
], |
|
[ |
|
'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889', |
|
'2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4' |
|
], |
|
[ |
|
'591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246', |
|
'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196' |
|
], |
|
[ |
|
'11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984', |
|
'998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4' |
|
], |
|
[ |
|
'3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a', |
|
'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257' |
|
], |
|
[ |
|
'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030', |
|
'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13' |
|
], |
|
[ |
|
'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197', |
|
'6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096' |
|
], |
|
[ |
|
'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593', |
|
'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38' |
|
], |
|
[ |
|
'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef', |
|
'21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f' |
|
], |
|
[ |
|
'347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38', |
|
'60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448' |
|
], |
|
[ |
|
'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a', |
|
'49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a' |
|
], |
|
[ |
|
'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111', |
|
'5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4' |
|
], |
|
[ |
|
'4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502', |
|
'7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437' |
|
], |
|
[ |
|
'3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea', |
|
'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7' |
|
], |
|
[ |
|
'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26', |
|
'8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d' |
|
], |
|
[ |
|
'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986', |
|
'39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a' |
|
], |
|
[ |
|
'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e', |
|
'62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54' |
|
], |
|
[ |
|
'48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4', |
|
'25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77' |
|
], |
|
[ |
|
'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda', |
|
'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517' |
|
], |
|
[ |
|
'6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859', |
|
'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10' |
|
], |
|
[ |
|
'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f', |
|
'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125' |
|
], |
|
[ |
|
'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c', |
|
'6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e' |
|
], |
|
[ |
|
'13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942', |
|
'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1' |
|
], |
|
[ |
|
'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a', |
|
'1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2' |
|
], |
|
[ |
|
'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80', |
|
'5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423' |
|
], |
|
[ |
|
'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d', |
|
'438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8' |
|
], |
|
[ |
|
'8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1', |
|
'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758' |
|
], |
|
[ |
|
'52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63', |
|
'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375' |
|
], |
|
[ |
|
'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352', |
|
'6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d' |
|
], |
|
[ |
|
'7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193', |
|
'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec' |
|
], |
|
[ |
|
'5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00', |
|
'9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0' |
|
], |
|
[ |
|
'32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58', |
|
'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c' |
|
], |
|
[ |
|
'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7', |
|
'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4' |
|
], |
|
[ |
|
'8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8', |
|
'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f' |
|
], |
|
[ |
|
'4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e', |
|
'67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649' |
|
], |
|
[ |
|
'3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d', |
|
'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826' |
|
], |
|
[ |
|
'674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b', |
|
'299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5' |
|
], |
|
[ |
|
'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f', |
|
'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87' |
|
], |
|
[ |
|
'30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6', |
|
'462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b' |
|
], |
|
[ |
|
'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297', |
|
'62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc' |
|
], |
|
[ |
|
'93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a', |
|
'7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c' |
|
], |
|
[ |
|
'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c', |
|
'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f' |
|
], |
|
[ |
|
'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52', |
|
'4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a' |
|
], |
|
[ |
|
'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb', |
|
'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46' |
|
], |
|
[ |
|
'463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065', |
|
'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f' |
|
], |
|
[ |
|
'7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917', |
|
'603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03' |
|
], |
|
[ |
|
'74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9', |
|
'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08' |
|
], |
|
[ |
|
'30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3', |
|
'553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8' |
|
], |
|
[ |
|
'9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57', |
|
'712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373' |
|
], |
|
[ |
|
'176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66', |
|
'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3' |
|
], |
|
[ |
|
'75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8', |
|
'9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8' |
|
], |
|
[ |
|
'809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721', |
|
'9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1' |
|
], |
|
[ |
|
'1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180', |
|
'4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9' |
|
] |
|
] |
|
} |
|
} |
|
] |
|
}); |
|
|
|
},{"../elliptic":201,"bn.js":199,"hash.js":214}],208:[function(require,module,exports){ |
|
var bn = require('bn.js'); |
|
var elliptic = require('../../elliptic'); |
|
var utils = elliptic.utils; |
|
var assert = utils.assert; |
|
|
|
var KeyPair = require('./key'); |
|
var Signature = require('./signature'); |
|
|
|
function EC(options) { |
|
if (!(this instanceof EC)) |
|
return new EC(options); |
|
|
|
// Shortcut `elliptic.ec(curve-name)` |
|
if (typeof options === 'string') { |
|
assert(elliptic.curves.hasOwnProperty(options), 'Unknown curve ' + options); |
|
|
|
options = elliptic.curves[options]; |
|
} |
|
|
|
// Shortcut for `elliptic.ec(elliptic.curves.curveName)` |
|
if (options instanceof elliptic.curves.PresetCurve) |
|
options = { curve: options }; |
|
|
|
this.curve = options.curve.curve; |
|
this.n = this.curve.n; |
|
this.nh = this.n.shrn(1); |
|
this.g = this.curve.g; |
|
|
|
// Point on curve |
|
this.g = options.curve.g; |
|
this.g.precompute(options.curve.n.bitLength() + 1); |
|
|
|
// Hash for function for DRBG |
|
this.hash = options.hash || options.curve.hash; |
|
} |
|
module.exports = EC; |
|
|
|
EC.prototype.keyPair = function keyPair(priv, pub) { |
|
return new KeyPair(this, priv, pub); |
|
}; |
|
|
|
EC.prototype.genKeyPair = function genKeyPair(options) { |
|
if (!options) |
|
options = {}; |
|
|
|
// Instantiate Hmac_DRBG |
|
var drbg = new elliptic.hmacDRBG({ |
|
hash: this.hash, |
|
pers: options.pers, |
|
entropy: options.entropy || elliptic.rand(this.hash.hmacStrength), |
|
nonce: this.n.toArray() |
|
}); |
|
|
|
var bytes = this.n.byteLength(); |
|
var ns2 = this.n.sub(new bn(2)); |
|
do { |
|
var priv = new bn(drbg.generate(bytes)); |
|
if (priv.cmp(ns2) > 0) |
|
continue; |
|
|
|
priv.iaddn(1); |
|
return this.keyPair(priv); |
|
} while (true); |
|
}; |
|
|
|
EC.prototype._truncateToN = function truncateToN(msg, truncOnly) { |
|
var delta = msg.byteLength() * 8 - this.n.bitLength(); |
|
if (delta > 0) |
|
msg = msg.shrn(delta); |
|
if (!truncOnly && msg.cmp(this.n) >= 0) |
|
return msg.sub(this.n); |
|
else |
|
return msg; |
|
}; |
|
|
|
EC.prototype.sign = function sign(msg, key, options) { |
|
key = this.keyPair(key, 'hex'); |
|
msg = this._truncateToN(new bn(msg, 16)); |
|
if (!options) |
|
options = {}; |
|
|
|
// Zero-extend key to provide enough entropy |
|
var bytes = this.n.byteLength(); |
|
var bkey = key.getPrivate().toArray(); |
|
for (var i = bkey.length; i < 21; i++) |
|
bkey.unshift(0); |
|
|
|
// Zero-extend nonce to have the same byte size as N |
|
var nonce = msg.toArray(); |
|
for (var i = nonce.length; i < bytes; i++) |
|
nonce.unshift(0); |
|
|
|
// Instantiate Hmac_DRBG |
|
var drbg = new elliptic.hmacDRBG({ |
|
hash: this.hash, |
|
entropy: bkey, |
|
nonce: nonce |
|
}); |
|
|
|
// Number of bytes to generate |
|
var ns1 = this.n.sub(new bn(1)); |
|
do { |
|
var k = new bn(drbg.generate(this.n.byteLength())); |
|
k = this._truncateToN(k, true); |
|
if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0) |
|
continue; |
|
|
|
var kp = this.g.mul(k); |
|
if (kp.isInfinity()) |
|
continue; |
|
|
|
var r = kp.getX().mod(this.n); |
|
if (r.cmpn(0) === 0) |
|
continue; |
|
|
|
var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg)).mod(this.n); |
|
if (s.cmpn(0) === 0) |
|
continue; |
|
|
|
// Use complement of `s`, if it is > `n / 2` |
|
if (options.canonical && s.cmp(this.nh) > 0) |
|
s = this.n.sub(s); |
|
|
|
return new Signature(r, s); |
|
} while (true); |
|
}; |
|
|
|
EC.prototype.verify = function verify(msg, signature, key) { |
|
msg = this._truncateToN(new bn(msg, 16)); |
|
key = this.keyPair(key, 'hex'); |
|
signature = new Signature(signature, 'hex'); |
|
|
|
// Perform primitive values validation |
|
var r = signature.r; |
|
var s = signature.s; |
|
if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0) |
|
return false; |
|
if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0) |
|
return false; |
|
|
|
// Validate signature |
|
var sinv = s.invm(this.n); |
|
var u1 = sinv.mul(msg).mod(this.n); |
|
var u2 = sinv.mul(r).mod(this.n); |
|
|
|
var p = this.g.mulAdd(u1, key.getPublic(), u2); |
|
if (p.isInfinity()) |
|
return false; |
|
|
|
return p.getX().mod(this.n).cmp(r) === 0; |
|
}; |
|
|
|
},{"../../elliptic":201,"./key":209,"./signature":210,"bn.js":199}],209:[function(require,module,exports){ |
|
var bn = require('bn.js'); |
|
|
|
var elliptic = require('../../elliptic'); |
|
var utils = elliptic.utils; |
|
var assert = utils.assert; |
|
|
|
function KeyPair(ec, priv, pub) { |
|
if (priv instanceof KeyPair) |
|
return priv; |
|
if (pub instanceof KeyPair) |
|
return pub; |
|
|
|
if (!priv) { |
|
priv = pub; |
|
pub = null; |
|
} |
|
if (priv !== null && typeof priv === 'object') { |
|
if (priv.x) { |
|
// KeyPair(public) |
|
pub = priv; |
|
priv = null; |
|
} else if (priv.priv || priv.pub) { |
|
// KeyPair({ priv: ..., pub: ... }) |
|
pub = priv.pub; |
|
priv = priv.priv; |
|
} |
|
} |
|
|
|
this.ec = ec; |
|
this.priv = null; |
|
this.pub = null; |
|
|
|
// KeyPair(public, 'hex') |
|
if (this._importPublicHex(priv, pub)) |
|
return; |
|
|
|
if (pub === 'hex') |
|
pub = null; |
|
|
|
// KeyPair(priv, pub) |
|
if (priv) |
|
this._importPrivate(priv); |
|
if (pub) |
|
this._importPublic(pub); |
|
} |
|
module.exports = KeyPair; |
|
|
|
KeyPair.prototype.validate = function validate() { |
|
var pub = this.getPublic(); |
|
|
|
if (pub.isInfinity()) |
|
return { result: false, reason: 'Invalid public key' }; |
|
if (!pub.validate()) |
|
return { result: false, reason: 'Public key is not a point' }; |
|
if (!pub.mul(this.ec.curve.n).isInfinity()) |
|
return { result: false, reason: 'Public key * N != O' }; |
|
|
|
return { result: true, reason: null }; |
|
}; |
|
|
|
KeyPair.prototype.getPublic = function getPublic(compact, enc) { |
|
if (!this.pub) |
|
this.pub = this.ec.g.mul(this.priv); |
|
|
|
// compact is optional argument |
|
if (typeof compact === 'string') { |
|
enc = compact; |
|
compact = null; |
|
} |
|
|
|
if (!enc) |
|
return this.pub; |
|
|
|
var len = this.ec.curve.p.byteLength(); |
|
var x = this.pub.getX().toArray(); |
|
|
|
for (var i = x.length; i < len; i++) |
|
x.unshift(0); |
|
|
|
if (compact) { |
|
var res = [ this.pub.getY().isEven() ? 0x02 : 0x03 ].concat(x); |
|
} else { |
|
var y = this.pub.getY().toArray(); |
|
for (var i = y.length; i < len; i++) |
|
y.unshift(0); |
|
var res = [ 0x04 ].concat(x, y); |
|
} |
|
return utils.encode(res, enc); |
|
}; |
|
|
|
KeyPair.prototype.getPrivate = function getPrivate(enc) { |
|
if (enc === 'hex') |
|
return this.priv.toString(16, 2); |
|
else |
|
return this.priv; |
|
}; |
|
|
|
KeyPair.prototype._importPrivate = function _importPrivate(key) { |
|
this.priv = new bn(key, 16); |
|
|
|
// Ensure that the priv won't be bigger than n, otherwise we may fail |
|
// in fixed multiplication method |
|
this.priv = this.priv.mod(this.ec.curve.n); |
|
}; |
|
|
|
KeyPair.prototype._importPublic = function _importPublic(key) { |
|
this.pub = this.ec.curve.point(key.x, key.y); |
|
}; |
|
|
|
KeyPair.prototype._importPublicHex = function _importPublic(key, enc) { |
|
key = utils.toArray(key, enc); |
|
var len = this.ec.curve.p.byteLength(); |
|
if (key[0] === 0x04 && key.length - 1 === 2 * len) { |
|
this.pub = this.ec.curve.point( |
|
key.slice(1, 1 + len), |
|
key.slice(1 + len, 1 + 2 * len)); |
|
} else if ((key[0] === 0x02 || key[0] === 0x03) && key.length - 1 === len) { |
|
this.pub = this.ec.curve.pointFromX(key[0] === 0x03, |
|
key.slice(1, 1 +len)); |
|
} else { |
|
return false; |
|
} |
|
|
|
return true; |
|
}; |
|
|
|
// ECDH |
|
KeyPair.prototype.derive = function derive(pub) { |
|
return pub.mul(this.priv).getX(); |
|
}; |
|
|
|
// ECDSA |
|
KeyPair.prototype.sign = function sign(msg) { |
|
return this.ec.sign(msg, this); |
|
}; |
|
|
|
KeyPair.prototype.verify = function verify(msg, signature) { |
|
return this.ec.verify(msg, signature, this); |
|
}; |
|
|
|
KeyPair.prototype.inspect = function inspect() { |
|
return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) + |
|
' pub: ' + (this.pub && this.pub.inspect()) + ' >'; |
|
}; |
|
|
|
},{"../../elliptic":201,"bn.js":199}],210:[function(require,module,exports){ |
|
var bn = require('bn.js'); |
|
|
|
var elliptic = require('../../elliptic'); |
|
var utils = elliptic.utils; |
|
var assert = utils.assert; |
|
|
|
function Signature(r, s) { |
|
if (r instanceof Signature) |
|
return r; |
|
|
|
if (this._importDER(r, s)) |
|
return; |
|
|
|
assert(r && s, 'Signature without r or s'); |
|
this.r = new bn(r, 16); |
|
this.s = new bn(s, 16); |
|
} |
|
module.exports = Signature; |
|
|
|
Signature.prototype._importDER = function _importDER(data, enc) { |
|
data = utils.toArray(data, enc); |
|
if (data.length < 6 || data[0] !== 0x30 || data[2] !== 0x02) |
|
return false; |
|
var total = data[1]; |
|
if (1 + total > data.length) |
|
return false; |
|
var rlen = data[3]; |
|
// Short length notation |
|
if (rlen >= 0x80) |
|
return false; |
|
if (4 + rlen + 2 >= data.length) |
|
return false; |
|
if (data[4 + rlen] !== 0x02) |
|
return false; |
|
var slen = data[5 + rlen]; |
|
// Short length notation |
|
if (slen >= 0x80) |
|
return false; |
|
if (4 + rlen + 2 + slen > data.length) |
|
return false; |
|
|
|
this.r = new bn(data.slice(4, 4 + rlen)); |
|
this.s = new bn(data.slice(4 + rlen + 2, 4 + rlen + 2 + slen)); |
|
|
|
return true; |
|
}; |
|
|
|
Signature.prototype.toDER = function toDER(enc) { |
|
var r = this.r.toArray(); |
|
var s = this.s.toArray(); |
|
|
|
// Pad values |
|
if (r[0] & 0x80) |
|
r = [ 0 ].concat(r); |
|
// Pad values |
|
if (s[0] & 0x80) |
|
s = [ 0 ].concat(s); |
|
|
|
var total = r.length + s.length + 4; |
|
var res = [ 0x30, total, 0x02, r.length ]; |
|
res = res.concat(r, [ 0x02, s.length ], s); |
|
return utils.encode(res, enc); |
|
}; |
|
|
|
},{"../../elliptic":201,"bn.js":199}],211:[function(require,module,exports){ |
|
var hash = require('hash.js'); |
|
var elliptic = require('../elliptic'); |
|
var utils = elliptic.utils; |
|
var assert = utils.assert; |
|
|
|
function HmacDRBG(options) { |
|
if (!(this instanceof HmacDRBG)) |
|
return new HmacDRBG(options); |
|
this.hash = options.hash; |
|
this.predResist = !!options.predResist; |
|
|
|
this.outLen = this.hash.outSize; |
|
this.minEntropy = options.minEntropy || this.hash.hmacStrength; |
|
|
|
this.reseed = null; |
|
this.reseedInterval = null; |
|
this.K = null; |
|
this.V = null; |
|
|
|
var entropy = utils.toArray(options.entropy, options.entropyEnc); |
|
var nonce = utils.toArray(options.nonce, options.nonceEnc); |
|
var pers = utils.toArray(options.pers, options.persEnc); |
|
assert(entropy.length >= (this.minEntropy / 8), |
|
'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits'); |
|
this._init(entropy, nonce, pers); |
|
} |
|
module.exports = HmacDRBG; |
|
|
|
HmacDRBG.prototype._init = function init(entropy, nonce, pers) { |
|
var seed = entropy.concat(nonce).concat(pers); |
|
|
|
this.K = new Array(this.outLen / 8); |
|
this.V = new Array(this.outLen / 8); |
|
for (var i = 0; i < this.V.length; i++) { |
|
this.K[i] = 0x00; |
|
this.V[i] = 0x01; |
|
} |
|
|
|
this._update(seed); |
|
this.reseed = 1; |
|
this.reseedInterval = 0x1000000000000; // 2^48 |
|
}; |
|
|
|
HmacDRBG.prototype._hmac = function hmac() { |
|
return new hash.hmac(this.hash, this.K); |
|
}; |
|
|
|
HmacDRBG.prototype._update = function update(seed) { |
|
var kmac = this._hmac() |
|
.update(this.V) |
|
.update([ 0x00 ]); |
|
if (seed) |
|
kmac = kmac.update(seed); |
|
this.K = kmac.digest(); |
|
this.V = this._hmac().update(this.V).digest(); |
|
if (!seed) |
|
return; |
|
|
|
this.K = this._hmac() |
|
.update(this.V) |
|
.update([ 0x01 ]) |
|
.update(seed) |
|
.digest(); |
|
this.V = this._hmac().update(this.V).digest(); |
|
}; |
|
|
|
HmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) { |
|
// Optional entropy enc |
|
if (typeof entropyEnc !== 'string') { |
|
addEnc = add; |
|
add = entropyEnc; |
|
entropyEnc = null; |
|
} |
|
|
|
entropy = utils.toBuffer(entropy, entropyEnc); |
|
add = utils.toBuffer(add, addEnc); |
|
|
|
assert(entropy.length >= (this.minEntropy / 8), |
|
'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits'); |
|
|
|
this._update(entropy.concat(add || [])); |
|
this.reseed = 1; |
|
}; |
|
|
|
HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) { |
|
if (this.reseed > this.reseedInterval) |
|
throw new Error('Reseed is required'); |
|
|
|
// Optional encoding |
|
if (typeof enc !== 'string') { |
|
addEnc = add; |
|
add = enc; |
|
enc = null; |
|
} |
|
|
|
// Optional additional data |
|
if (add) { |
|
add = utils.toArray(add, addEnc); |
|
this._update(add); |
|
} |
|
|
|
var temp = []; |
|
while (temp.length < len) { |
|
this.V = this._hmac().update(this.V).digest(); |
|
temp = temp.concat(this.V); |
|
} |
|
|
|
var res = temp.slice(0, len); |
|
this._update(add); |
|
this.reseed++; |
|
return utils.encode(res, enc); |
|
}; |
|
|
|
},{"../elliptic":201,"hash.js":214}],212:[function(require,module,exports){ |
|
var bn = require('bn.js'); |
|
|
|
var utils = exports; |
|
|
|
utils.assert = function assert(val, msg) { |
|
if (!val) |
|
throw new Error(msg || 'Assertion failed'); |
|
}; |
|
|
|
function toArray(msg, enc) { |
|
if (Array.isArray(msg)) |
|
return msg.slice(); |
|
if (!msg) |
|
return []; |
|
var res = []; |
|
if (typeof msg === 'string') { |
|
if (!enc) { |
|
for (var i = 0; i < msg.length; i++) { |
|
var c = msg.charCodeAt(i); |
|
var hi = c >> 8; |
|
var lo = c & 0xff; |
|
if (hi) |
|
res.push(hi, lo); |
|
else |
|
res.push(lo); |
|
} |
|
} else if (enc === 'hex') { |
|
msg = msg.replace(/[^a-z0-9]+/ig, ''); |
|
if (msg.length % 2 !== 0) |
|
msg = '0' + msg; |
|
for (var i = 0; i < msg.length; i += 2) |
|
res.push(parseInt(msg[i] + msg[i + 1], 16)); |
|
} |
|
} else { |
|
for (var i = 0; i < msg.length; i++) |
|
res[i] = msg[i] | 0; |
|
} |
|
return res; |
|
} |
|
utils.toArray = toArray; |
|
|
|
function toHex(msg) { |
|
var res = ''; |
|
for (var i = 0; i < msg.length; i++) |
|
res += zero2(msg[i].toString(16)); |
|
return res; |
|
} |
|
utils.toHex = toHex; |
|
|
|
utils.encode = function encode(arr, enc) { |
|
if (enc === 'hex') |
|
return toHex(arr); |
|
else |
|
return arr; |
|
}; |
|
|
|
function zero2(word) { |
|
if (word.length === 1) |
|
return '0' + word; |
|
else |
|
return word; |
|
} |
|
utils.zero2 = zero2; |
|
|
|
// Represent num in a w-NAF form |
|
function getNAF(num, w) { |
|
var naf = []; |
|
var ws = 1 << (w + 1); |
|
var k = num.clone(); |
|
while (k.cmpn(1) >= 0) { |
|
var z; |
|
if (k.isOdd()) { |
|
var mod = k.andln(ws - 1); |
|
if (mod > (ws >> 1) - 1) |
|
z = (ws >> 1) - mod; |
|
else |
|
z = mod; |
|
k.isubn(z); |
|
} else { |
|
z = 0; |
|
} |
|
naf.push(z); |
|
|
|
// Optimization, shift by word if possible |
|
var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1; |
|
for (var i = 1; i < shift; i++) |
|
naf.push(0); |
|
k.ishrn(shift); |
|
} |
|
|
|
return naf; |
|
} |
|
utils.getNAF = getNAF; |
|
|
|
// Represent k1, k2 in a Joint Sparse Form |
|
function getJSF(k1, k2) { |
|
var jsf = [ |
|
[], |
|
[] |
|
]; |
|
|
|
k1 = k1.clone(); |
|
k2 = k2.clone(); |
|
var d1 = 0; |
|
var d2 = 0; |
|
while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) { |
|
|
|
// First phase |
|
var m14 = (k1.andln(3) + d1) & 3; |
|
var m24 = (k2.andln(3) + d2) & 3; |
|
if (m14 === 3) |
|
m14 = -1; |
|
if (m24 === 3) |
|
m24 = -1; |
|
var u1; |
|
if ((m14 & 1) === 0) { |
|
u1 = 0; |
|
} else { |
|
var m8 = (k1.andln(7) + d1) & 7; |
|
if ((m8 === 3 || m8 === 5) && m24 === 2) |
|
u1 = -m14; |
|
else |
|
u1 = m14; |
|
} |
|
jsf[0].push(u1); |
|
|
|
var u2; |
|
if ((m24 & 1) === 0) { |
|
u2 = 0; |
|
} else { |
|
var m8 = (k2.andln(7) + d2) & 7; |
|
if ((m8 === 3 || m8 === 5) && m14 === 2) |
|
u2 = -m24; |
|
else |
|
u2 = m24; |
|
} |
|
jsf[1].push(u2); |
|
|
|
// Second phase |
|
if (2 * d1 === u1 + 1) |
|
d1 = 1 - d1; |
|
if (2 * d2 === u2 + 1) |
|
d2 = 1 - d2; |
|
k1.ishrn(1); |
|
k2.ishrn(1); |
|
} |
|
|
|
return jsf; |
|
} |
|
utils.getJSF = getJSF; |
|
|
|
},{"bn.js":199}],213:[function(require,module,exports){ |
|
var r; |
|
|
|
module.exports = function rand(len) { |
|
if (!r) |
|
r = new Rand(null); |
|
|
|
return r.generate(len); |
|
}; |
|
|
|
function Rand(rand) { |
|
this.rand = rand; |
|
} |
|
module.exports.Rand = Rand; |
|
|
|
Rand.prototype.generate = function generate(len) { |
|
return this._rand(len); |
|
}; |
|
|
|
if (typeof window === 'object') { |
|
if (window.crypto && window.crypto.getRandomValues) { |
|
// Modern browsers |
|
Rand.prototype._rand = function _rand(n) { |
|
var arr = new Uint8Array(n); |
|
window.crypto.getRandomValues(arr); |
|
return arr; |
|
}; |
|
} else if (window.msCrypto && window.msCrypto.getRandomValues) { |
|
// IE |
|
Rand.prototype._rand = function _rand(n) { |
|
var arr = new Uint8Array(n); |
|
window.msCrypto.getRandomValues(arr); |
|
return arr; |
|
}; |
|
} else { |
|
// Old junk |
|
Rand.prototype._rand = function() { |
|
throw new Error('Not implemented yet'); |
|
}; |
|
} |
|
} else { |
|
// Node.js or Web worker |
|
try { |
|
var crypto = require('cry' + 'pto'); |
|
|
|
Rand.prototype._rand = function _rand(n) { |
|
return crypto.randomBytes(n); |
|
}; |
|
} catch (e) { |
|
// Emulate crypto API using randy |
|
Rand.prototype._rand = function _rand(n) { |
|
var res = new Uint8Array(n); |
|
for (var i = 0; i < res.length; i++) |
|
res[i] = this.rand.getByte(); |
|
return res; |
|
}; |
|
} |
|
} |
|
|
|
},{}],214:[function(require,module,exports){ |
|
var hash = exports; |
|
|
|
hash.utils = require('./hash/utils'); |
|
hash.common = require('./hash/common'); |
|
hash.sha = require('./hash/sha'); |
|
hash.ripemd = require('./hash/ripemd'); |
|
hash.hmac = require('./hash/hmac'); |
|
|
|
// Proxy hash functions to the main object |
|
hash.sha1 = hash.sha.sha1; |
|
hash.sha256 = hash.sha.sha256; |
|
hash.sha224 = hash.sha.sha224; |
|
hash.sha384 = hash.sha.sha384; |
|
hash.sha512 = hash.sha.sha512; |
|
hash.ripemd160 = hash.ripemd.ripemd160; |
|
|
|
},{"./hash/common":215,"./hash/hmac":216,"./hash/ripemd":217,"./hash/sha":218,"./hash/utils":219}],215:[function(require,module,exports){ |
|
var hash = require('../hash'); |
|
var utils = hash.utils; |
|
var assert = utils.assert; |
|
|
|
function BlockHash() { |
|
this.pending = null; |
|
this.pendingTotal = 0; |
|
this.blockSize = this.constructor.blockSize; |
|
this.outSize = this.constructor.outSize; |
|
this.hmacStrength = this.constructor.hmacStrength; |
|
this.padLength = this.constructor.padLength / 8; |
|
this.endian = 'big'; |
|
|
|
this._delta8 = this.blockSize / 8; |
|
this._delta32 = this.blockSize / 32; |
|
} |
|
exports.BlockHash = BlockHash; |
|
|
|
BlockHash.prototype.update = function update(msg, enc) { |
|
// Convert message to array, pad it, and join into 32bit blocks |
|
msg = utils.toArray(msg, enc); |
|
if (!this.pending) |
|
this.pending = msg; |
|
else |
|
this.pending = this.pending.concat(msg); |
|
this.pendingTotal += msg.length; |
|
|
|
// Enough data, try updating |
|
if (this.pending.length >= this._delta8) { |
|
msg = this.pending; |
|
|
|
// Process pending data in blocks |
|
var r = msg.length % this._delta8; |
|
this.pending = msg.slice(msg.length - r, msg.length); |
|
if (this.pending.length === 0) |
|
this.pending = null; |
|
|
|
msg = utils.join32(msg, 0, msg.length - r, this.endian); |
|
for (var i = 0; i < msg.length; i += this._delta32) |
|
this._update(msg, i, i + this._delta32); |
|
} |
|
|
|
return this; |
|
}; |
|
|
|
BlockHash.prototype.digest = function digest(enc) { |
|
this.update(this._pad()); |
|
assert(this.pending === null); |
|
|
|
return this._digest(enc); |
|
}; |
|
|
|
BlockHash.prototype._pad = function pad() { |
|
var len = this.pendingTotal; |
|
var bytes = this._delta8; |
|
var k = bytes - ((len + this.padLength) % bytes); |
|
var res = new Array(k + this.padLength); |
|
res[0] = 0x80; |
|
for (var i = 1; i < k; i++) |
|
res[i] = 0; |
|
|
|
// Append length |
|
len <<= 3; |
|
if (this.endian === 'big') { |
|
for (var t = 8; t < this.padLength; t++) |
|
res[i++] = 0; |
|
|
|
res[i++] = 0; |
|
res[i++] = 0; |
|
res[i++] = 0; |
|
res[i++] = 0; |
|
res[i++] = (len >>> 24) & 0xff; |
|
res[i++] = (len >>> 16) & 0xff; |
|
res[i++] = (len >>> 8) & 0xff; |
|
res[i++] = len & 0xff; |
|
} else { |
|
res[i++] = len & 0xff; |
|
res[i++] = (len >>> 8) & 0xff; |
|
res[i++] = (len >>> 16) & 0xff; |
|
res[i++] = (len >>> 24) & 0xff; |
|
res[i++] = 0; |
|
res[i++] = 0; |
|
res[i++] = 0; |
|
res[i++] = 0; |
|
|
|
for (var t = 8; t < this.padLength; t++) |
|
res[i++] = 0; |
|
} |
|
|
|
return res; |
|
}; |
|
|
|
},{"../hash":214}],216:[function(require,module,exports){ |
|
var hmac = exports; |
|
|
|
var hash = require('../hash'); |
|
var utils = hash.utils; |
|
var assert = utils.assert; |
|
|
|
function Hmac(hash, key, enc) { |
|
if (!(this instanceof Hmac)) |
|
return new Hmac(hash, key, enc); |
|
this.Hash = hash; |
|
this.blockSize = hash.blockSize / 8; |
|
this.outSize = hash.outSize / 8; |
|
this.inner = null; |
|
this.outer = null; |
|
|
|
this._init(utils.toArray(key, enc)); |
|
} |
|
module.exports = Hmac; |
|
|
|
Hmac.prototype._init = function init(key) { |
|
// Shorten key, if needed |
|
if (key.length > this.blockSize) |
|
key = new this.Hash().update(key).digest(); |
|
assert(key.length <= this.blockSize); |
|
|
|
// Add padding to key |
|
for (var i = key.length; i < this.blockSize; i++) |
|
key.push(0); |
|
|
|
for (var i = 0; i < key.length; i++) |
|
key[i] ^= 0x36; |
|
this.inner = new this.Hash().update(key); |
|
|
|
// 0x36 ^ 0x5c = 0x6a |
|
for (var i = 0; i < key.length; i++) |
|
key[i] ^= 0x6a; |
|
this.outer = new this.Hash().update(key); |
|
}; |
|
|
|
Hmac.prototype.update = function update(msg, enc) { |
|
this.inner.update(msg, enc); |
|
return this; |
|
}; |
|
|
|
Hmac.prototype.digest = function digest(enc) { |
|
this.outer.update(this.inner.digest()); |
|
return this.outer.digest(enc); |
|
}; |
|
|
|
},{"../hash":214}],217:[function(require,module,exports){ |
|
var hash = require('../hash'); |
|
var utils = hash.utils; |
|
|
|
var rotl32 = utils.rotl32; |
|
var sum32 = utils.sum32; |
|
var sum32_3 = utils.sum32_3; |
|
var sum32_4 = utils.sum32_4; |
|
var BlockHash = hash.common.BlockHash; |
|
|
|
function RIPEMD160() { |
|
if (!(this instanceof RIPEMD160)) |
|
return new RIPEMD160(); |
|
|
|
BlockHash.call(this); |
|
|
|
this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ]; |
|
this.endian = 'little'; |
|
} |
|
utils.inherits(RIPEMD160, BlockHash); |
|
exports.ripemd160 = RIPEMD160; |
|
|
|
RIPEMD160.blockSize = 512; |
|
RIPEMD160.outSize = 160; |
|
RIPEMD160.hmacStrength = 192; |
|
RIPEMD160.padLength = 64; |
|
|
|
RIPEMD160.prototype._update = function update(msg, start) { |
|
var A = this.h[0]; |
|
var B = this.h[1]; |
|
var C = this.h[2]; |
|
var D = this.h[3]; |
|
var E = this.h[4]; |
|
var Ah = A; |
|
var Bh = B; |
|
var Ch = C; |
|
var Dh = D; |
|
var Eh = E; |
|
for (var j = 0; j < 80; j++) { |
|
var T = sum32( |
|
rotl32( |
|
sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), |
|
s[j]), |
|
E); |
|
A = E; |
|
E = D; |
|
D = rotl32(C, 10); |
|
C = B; |
|
B = T; |
|
T = sum32( |
|
rotl32( |
|
sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), |
|
sh[j]), |
|
Eh); |
|
Ah = Eh; |
|
Eh = Dh; |
|
Dh = rotl32(Ch, 10); |
|
Ch = Bh; |
|
Bh = T; |
|
} |
|
T = sum32_3(this.h[1], C, Dh); |
|
this.h[1] = sum32_3(this.h[2], D, Eh); |
|
this.h[2] = sum32_3(this.h[3], E, Ah); |
|
this.h[3] = sum32_3(this.h[4], A, Bh); |
|
this.h[4] = sum32_3(this.h[0], B, Ch); |
|
this.h[0] = T; |
|
}; |
|
|
|
RIPEMD160.prototype._digest = function digest(enc) { |
|
if (enc === 'hex') |
|
return utils.toHex32(this.h, 'little'); |
|
else |
|
return utils.split32(this.h, 'little'); |
|
}; |
|
|
|
function f(j, x, y, z) { |
|
if (j <= 15) |
|
return x ^ y ^ z; |
|
else if (j <= 31) |
|
return (x & y) | ((~x) & z); |
|
else if (j <= 47) |
|
return (x | (~y)) ^ z; |
|
else if (j <= 63) |
|
return (x & z) | (y & (~z)); |
|
else |
|
return x ^ (y | (~z)); |
|
} |
|
|
|
function K(j) { |
|
if (j <= 15) |
|
return 0x00000000; |
|
else if (j <= 31) |
|
return 0x5a827999; |
|
else if (j <= 47) |
|
return 0x6ed9eba1; |
|
else if (j <= 63) |
|
return 0x8f1bbcdc; |
|
else |
|
return 0xa953fd4e; |
|
} |
|
|
|
function Kh(j) { |
|
if (j <= 15) |
|
return 0x50a28be6; |
|
else if (j <= 31) |
|
return 0x5c4dd124; |
|
else if (j <= 47) |
|
return 0x6d703ef3; |
|
else if (j <= 63) |
|
return 0x7a6d76e9; |
|
else |
|
return 0x00000000; |
|
} |
|
|
|
var r = [ |
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, |
|
7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, |
|
3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, |
|
1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, |
|
4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13, |
|
]; |
|
|
|
var rh = [ |
|
5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, |
|
6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, |
|
15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, |
|
8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, |
|
12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11 |
|
]; |
|
|
|
var s = [ |
|
11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, |
|
7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, |
|
11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, |
|
11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, |
|
9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6, |
|
]; |
|
|
|
var sh = [ |
|
8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, |
|
9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, |
|
9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, |
|
15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, |
|
8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 |
|
]; |
|
|
|
},{"../hash":214}],218:[function(require,module,exports){ |
|
var hash = require('../hash'); |
|
var utils = hash.utils; |
|
var assert = utils.assert; |
|
|
|
var rotr32 = utils.rotr32; |
|
var rotl32 = utils.rotl32; |
|
var sum32 = utils.sum32; |
|
var sum32_4 = utils.sum32_4; |
|
var sum32_5 = utils.sum32_5; |
|
var rotr64_hi = utils.rotr64_hi; |
|
var rotr64_lo = utils.rotr64_lo; |
|
var shr64_hi = utils.shr64_hi; |
|
var shr64_lo = utils.shr64_lo; |
|
var sum64 = utils.sum64; |
|
var sum64_hi = utils.sum64_hi; |
|
var sum64_lo = utils.sum64_lo; |
|
var sum64_4_hi = utils.sum64_4_hi; |
|
var sum64_4_lo = utils.sum64_4_lo; |
|
var sum64_5_hi = utils.sum64_5_hi; |
|
var sum64_5_lo = utils.sum64_5_lo; |
|
var BlockHash = hash.common.BlockHash; |
|
|
|
var sha256_K = [ |
|
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, |
|
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, |
|
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, |
|
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, |
|
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, |
|
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, |
|
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, |
|
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, |
|
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, |
|
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, |
|
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, |
|
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, |
|
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, |
|
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, |
|
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, |
|
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 |
|
]; |
|
|
|
var sha512_K = [ |
|
0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, |
|
0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, |
|
0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, |
|
0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, |
|
0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, |
|
0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, |
|
0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, |
|
0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, |
|
0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, |
|
0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, |
|
0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, |
|
0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, |
|
0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, |
|
0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, |
|
0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, |
|
0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, |
|
0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, |
|
0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, |
|
0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, |
|
0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, |
|
0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, |
|
0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, |
|
0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, |
|
0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, |
|
0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, |
|
0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, |
|
0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, |
|
0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, |
|
0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, |
|
0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, |
|
0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, |
|
0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, |
|
0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, |
|
0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, |
|
0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, |
|
0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, |
|
0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, |
|
0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, |
|
0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, |
|
0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817 |
|
]; |
|
|
|
var sha1_K = [ |
|
0x5A827999, 0x6ED9EBA1, |
|
0x8F1BBCDC, 0xCA62C1D6 |
|
]; |
|
|
|
function SHA256() { |
|
if (!(this instanceof SHA256)) |
|
return new SHA256(); |
|
|
|
BlockHash.call(this); |
|
this.h = [ 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, |
|
0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 ]; |
|
this.k = sha256_K; |
|
this.W = new Array(64); |
|
} |
|
utils.inherits(SHA256, BlockHash); |
|
exports.sha256 = SHA256; |
|
|
|
SHA256.blockSize = 512; |
|
SHA256.outSize = 256; |
|
SHA256.hmacStrength = 192; |
|
SHA256.padLength = 64; |
|
|
|
SHA256.prototype._update = function _update(msg, start) { |
|
var W = this.W; |
|
|
|
for (var i = 0; i < 16; i++) |
|
W[i] = msg[start + i]; |
|
for (; i < W.length; i++) |
|
W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]); |
|
|
|
var a = this.h[0]; |
|
var b = this.h[1]; |
|
var c = this.h[2]; |
|
var d = this.h[3]; |
|
var e = this.h[4]; |
|
var f = this.h[5]; |
|
var g = this.h[6]; |
|
var h = this.h[7]; |
|
|
|
assert(this.k.length === W.length); |
|
for (var i = 0; i < W.length; i++) { |
|
var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]); |
|
var T2 = sum32(s0_256(a), maj32(a, b, c)); |
|
h = g; |
|
g = f; |
|
f = e; |
|
e = sum32(d, T1); |
|
d = c; |
|
c = b; |
|
b = a; |
|
a = sum32(T1, T2); |
|
} |
|
|
|
this.h[0] = sum32(this.h[0], a); |
|
this.h[1] = sum32(this.h[1], b); |
|
this.h[2] = sum32(this.h[2], c); |
|
this.h[3] = sum32(this.h[3], d); |
|
this.h[4] = sum32(this.h[4], e); |
|
this.h[5] = sum32(this.h[5], f); |
|
this.h[6] = sum32(this.h[6], g); |
|
this.h[7] = sum32(this.h[7], h); |
|
}; |
|
|
|
SHA256.prototype._digest = function digest(enc) { |
|
if (enc === 'hex') |
|
return utils.toHex32(this.h, 'big'); |
|
else |
|
return utils.split32(this.h, 'big'); |
|
}; |
|
|
|
function SHA224() { |
|
if (!(this instanceof SHA224)) |
|
return new SHA224(); |
|
|
|
SHA256.call(this); |
|
this.h = [ 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, |
|
0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ]; |
|
} |
|
utils.inherits(SHA224, SHA256); |
|
exports.sha224 = SHA224; |
|
|
|
SHA224.blockSize = 512; |
|
SHA224.outSize = 224; |
|
SHA224.hmacStrength = 192; |
|
SHA224.padLength = 64; |
|
|
|
SHA224.prototype._digest = function digest(enc) { |
|
// Just truncate output |
|
if (enc === 'hex') |
|
return utils.toHex32(this.h.slice(0, 7), 'big'); |
|
else |
|
return utils.split32(this.h.slice(0, 7), 'big'); |
|
}; |
|
|
|
function SHA512() { |
|
if (!(this instanceof SHA512)) |
|
return new SHA512(); |
|
|
|
BlockHash.call(this); |
|
this.h = [ 0x6a09e667, 0xf3bcc908, |
|
0xbb67ae85, 0x84caa73b, |
|
0x3c6ef372, 0xfe94f82b, |
|
0xa54ff53a, 0x5f1d36f1, |
|
0x510e527f, 0xade682d1, |
|
0x9b05688c, 0x2b3e6c1f, |
|
0x1f83d9ab, 0xfb41bd6b, |
|
0x5be0cd19, 0x137e2179 ]; |
|
this.k = sha512_K; |
|
this.W = new Array(160); |
|
} |
|
utils.inherits(SHA512, BlockHash); |
|
exports.sha512 = SHA512; |
|
|
|
SHA512.blockSize = 1024; |
|
SHA512.outSize = 512; |
|
SHA512.hmacStrength = 192; |
|
SHA512.padLength = 128; |
|
|
|
SHA512.prototype._prepareBlock = function _prepareBlock(msg, start) { |
|
var W = this.W; |
|
|
|
// 32 x 32bit words |
|
for (var i = 0; i < 32; i++) |
|
W[i] = msg[start + i]; |
|
for (; i < W.length; i += 2) { |
|
var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2 |
|
var c0_lo = g1_512_lo(W[i - 4], W[i - 3]); |
|
var c1_hi = W[i - 14]; // i - 7 |
|
var c1_lo = W[i - 13]; |
|
var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15 |
|
var c2_lo = g0_512_lo(W[i - 30], W[i - 29]); |
|
var c3_hi = W[i - 32]; // i - 16 |
|
var c3_lo = W[i - 31]; |
|
|
|
W[i] = sum64_4_hi(c0_hi, c0_lo, |
|
c1_hi, c1_lo, |
|
c2_hi, c2_lo, |
|
c3_hi, c3_lo); |
|
W[i + 1] = sum64_4_lo(c0_hi, c0_lo, |
|
c1_hi, c1_lo, |
|
c2_hi, c2_lo, |
|
c3_hi, c3_lo); |
|
} |
|
}; |
|
|
|
SHA512.prototype._update = function _update(msg, start) { |
|
this._prepareBlock(msg, start); |
|
|
|
var W = this.W; |
|
|
|
var ah = this.h[0]; |
|
var al = this.h[1]; |
|
var bh = this.h[2]; |
|
var bl = this.h[3]; |
|
var ch = this.h[4]; |
|
var cl = this.h[5]; |
|
var dh = this.h[6]; |
|
var dl = this.h[7]; |
|
var eh = this.h[8]; |
|
var el = this.h[9]; |
|
var fh = this.h[10]; |
|
var fl = this.h[11]; |
|
var gh = this.h[12]; |
|
var gl = this.h[13]; |
|
var hh = this.h[14]; |
|
var hl = this.h[15]; |
|
|
|
assert(this.k.length === W.length); |
|
for (var i = 0; i < W.length; i += 2) { |
|
var c0_hi = hh; |
|
var c0_lo = hl; |
|
var c1_hi = s1_512_hi(eh, el); |
|
var c1_lo = s1_512_lo(eh, el); |
|
var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl); |
|
var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl); |
|
var c3_hi = this.k[i]; |
|
var c3_lo = this.k[i + 1]; |
|
var c4_hi = W[i]; |
|
var c4_lo = W[i + 1]; |
|
|
|
var T1_hi = sum64_5_hi(c0_hi, c0_lo, |
|
c1_hi, c1_lo, |
|
c2_hi, c2_lo, |
|
c3_hi, c3_lo, |
|
c4_hi, c4_lo); |
|
var T1_lo = sum64_5_lo(c0_hi, c0_lo, |
|
c1_hi, c1_lo, |
|
c2_hi, c2_lo, |
|
c3_hi, c3_lo, |
|
c4_hi, c4_lo); |
|
|
|
var c0_hi = s0_512_hi(ah, al); |
|
var c0_lo = s0_512_lo(ah, al); |
|
var c1_hi = maj64_hi(ah, al, bh, bl, ch, cl); |
|
var c1_lo = maj64_lo(ah, al, bh, bl, ch, cl); |
|
|
|
var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo); |
|
var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo); |
|
|
|
hh = gh; |
|
hl = gl; |
|
|
|
gh = fh; |
|
gl = fl; |
|
|
|
fh = eh; |
|
fl = el; |
|
|
|
eh = sum64_hi(dh, dl, T1_hi, T1_lo); |
|
el = sum64_lo(dl, dl, T1_hi, T1_lo); |
|
|
|
dh = ch; |
|
dl = cl; |
|
|
|
ch = bh; |
|
cl = bl; |
|
|
|
bh = ah; |
|
bl = al; |
|
|
|
ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo); |
|
al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo); |
|
} |
|
|
|
sum64(this.h, 0, ah, al); |
|
sum64(this.h, 2, bh, bl); |
|
sum64(this.h, 4, ch, cl); |
|
sum64(this.h, 6, dh, dl); |
|
sum64(this.h, 8, eh, el); |
|
sum64(this.h, 10, fh, fl); |
|
sum64(this.h, 12, gh, gl); |
|
sum64(this.h, 14, hh, hl); |
|
}; |
|
|
|
SHA512.prototype._digest = function digest(enc) { |
|
if (enc === 'hex') |
|
return utils.toHex32(this.h, 'big'); |
|
else |
|
return utils.split32(this.h, 'big'); |
|
}; |
|
|
|
function SHA384() { |
|
if (!(this instanceof SHA384)) |
|
return new SHA384(); |
|
|
|
SHA512.call(this); |
|
this.h = [ 0xcbbb9d5d, 0xc1059ed8, |
|
0x629a292a, 0x367cd507, |
|
0x9159015a, 0x3070dd17, |
|
0x152fecd8, 0xf70e5939, |
|
0x67332667, 0xffc00b31, |
|
0x8eb44a87, 0x68581511, |
|
0xdb0c2e0d, 0x64f98fa7, |
|
0x47b5481d, 0xbefa4fa4 ]; |
|
} |
|
utils.inherits(SHA384, SHA512); |
|
exports.sha384 = SHA384; |
|
|
|
SHA384.blockSize = 1024; |
|
SHA384.outSize = 384; |
|
SHA384.hmacStrength = 192; |
|
SHA384.padLength = 128; |
|
|
|
SHA384.prototype._digest = function digest(enc) { |
|
if (enc === 'hex') |
|
return utils.toHex32(this.h.slice(0, 12), 'big'); |
|
else |
|
return utils.split32(this.h.slice(0, 12), 'big'); |
|
}; |
|
|
|
function SHA1() { |
|
if (!(this instanceof SHA1)) |
|
return new SHA1(); |
|
|
|
BlockHash.call(this); |
|
this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, |
|
0x10325476, 0xc3d2e1f0 ]; |
|
this.W = new Array(80); |
|
} |
|
|
|
utils.inherits(SHA1, BlockHash); |
|
exports.sha1 = SHA1; |
|
|
|
SHA1.blockSize = 512; |
|
SHA1.outSize = 160; |
|
SHA1.hmacStrength = 80; |
|
SHA1.padLength = 64; |
|
|
|
SHA1.prototype._update = function _update(msg, start) { |
|
var W = this.W; |
|
|
|
for (var i = 0; i < 16; i++) |
|
W[i] = msg[start + i]; |
|
|
|
for(; i < W.length; i++) |
|
W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1); |
|
|
|
var a = this.h[0]; |
|
var b = this.h[1]; |
|
var c = this.h[2]; |
|
var d = this.h[3]; |
|
var e = this.h[4]; |
|
|
|
for (var i = 0; i < W.length; i++) { |
|
var s = ~~(i / 20); |
|
var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]); |
|
e = d; |
|
d = c; |
|
c = rotl32(b, 30); |
|
b = a; |
|
a = t; |
|
} |
|
|
|
this.h[0] = sum32(this.h[0], a); |
|
this.h[1] = sum32(this.h[1], b); |
|
this.h[2] = sum32(this.h[2], c); |
|
this.h[3] = sum32(this.h[3], d); |
|
this.h[4] = sum32(this.h[4], e); |
|
}; |
|
|
|
SHA1.prototype._digest = function digest(enc) { |
|
if (enc === 'hex') |
|
return utils.toHex32(this.h, 'big'); |
|
else |
|
return utils.split32(this.h, 'big'); |
|
}; |
|
|
|
function ch32(x, y, z) { |
|
return (x & y) ^ ((~x) & z); |
|
} |
|
|
|
function maj32(x, y, z) { |
|
return (x & y) ^ (x & z) ^ (y & z); |
|
} |
|
|
|
function p32(x, y, z) { |
|
return x ^ y ^ z; |
|
} |
|
|
|
function s0_256(x) { |
|
return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22); |
|
} |
|
|
|
function s1_256(x) { |
|
return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25); |
|
} |
|
|
|
function g0_256(x) { |
|
return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3); |
|
} |
|
|
|
function g1_256(x) { |
|
return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10); |
|
} |
|
|
|
function ft_1(s, x, y, z) { |
|
if (s === 0) |
|
return ch32(x, y, z); |
|
if (s === 1 || s === 3) |
|
return p32(x, y, z); |
|
if (s === 2) |
|
return maj32(x, y, z); |
|
} |
|
|
|
function ch64_hi(xh, xl, yh, yl, zh, zl) { |
|
var r = (xh & yh) ^ ((~xh) & zh); |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function ch64_lo(xh, xl, yh, yl, zh, zl) { |
|
var r = (xl & yl) ^ ((~xl) & zl); |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function maj64_hi(xh, xl, yh, yl, zh, zl) { |
|
var r = (xh & yh) ^ (xh & zh) ^ (yh & zh); |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function maj64_lo(xh, xl, yh, yl, zh, zl) { |
|
var r = (xl & yl) ^ (xl & zl) ^ (yl & zl); |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function s0_512_hi(xh, xl) { |
|
var c0_hi = rotr64_hi(xh, xl, 28); |
|
var c1_hi = rotr64_hi(xl, xh, 2); // 34 |
|
var c2_hi = rotr64_hi(xl, xh, 7); // 39 |
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function s0_512_lo(xh, xl) { |
|
var c0_lo = rotr64_lo(xh, xl, 28); |
|
var c1_lo = rotr64_lo(xl, xh, 2); // 34 |
|
var c2_lo = rotr64_lo(xl, xh, 7); // 39 |
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function s1_512_hi(xh, xl) { |
|
var c0_hi = rotr64_hi(xh, xl, 14); |
|
var c1_hi = rotr64_hi(xh, xl, 18); |
|
var c2_hi = rotr64_hi(xl, xh, 9); // 41 |
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function s1_512_lo(xh, xl) { |
|
var c0_lo = rotr64_lo(xh, xl, 14); |
|
var c1_lo = rotr64_lo(xh, xl, 18); |
|
var c2_lo = rotr64_lo(xl, xh, 9); // 41 |
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function g0_512_hi(xh, xl) { |
|
var c0_hi = rotr64_hi(xh, xl, 1); |
|
var c1_hi = rotr64_hi(xh, xl, 8); |
|
var c2_hi = shr64_hi(xh, xl, 7); |
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function g0_512_lo(xh, xl) { |
|
var c0_lo = rotr64_lo(xh, xl, 1); |
|
var c1_lo = rotr64_lo(xh, xl, 8); |
|
var c2_lo = shr64_lo(xh, xl, 7); |
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function g1_512_hi(xh, xl) { |
|
var c0_hi = rotr64_hi(xh, xl, 19); |
|
var c1_hi = rotr64_hi(xl, xh, 29); // 61 |
|
var c2_hi = shr64_hi(xh, xl, 6); |
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
function g1_512_lo(xh, xl) { |
|
var c0_lo = rotr64_lo(xh, xl, 19); |
|
var c1_lo = rotr64_lo(xl, xh, 29); // 61 |
|
var c2_lo = shr64_lo(xh, xl, 6); |
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo; |
|
if (r < 0) |
|
r += 0x100000000; |
|
return r; |
|
} |
|
|
|
},{"../hash":214}],219:[function(require,module,exports){ |
|
var utils = exports; |
|
var inherits = require('inherits'); |
|
|
|
function toArray(msg, enc) { |
|
if (Array.isArray(msg)) |
|
return msg.slice(); |
|
if (!msg) |
|
return []; |
|
var res = []; |
|
if (typeof msg === 'string') { |
|
if (!enc) { |
|
for (var i = 0; i < msg.length; i++) { |
|
var c = msg.charCodeAt(i); |
|
var hi = c >> 8; |
|
var lo = c & 0xff; |
|
if (hi) |
|
res.push(hi, lo); |
|
else |
|
res.push(lo); |
|
} |
|
} else if (enc === 'hex') { |
|
msg = msg.replace(/[^a-z0-9]+/ig, ''); |
|
if (msg.length % 2 !== 0) |
|
msg = '0' + msg; |
|
for (var i = 0; i < msg.length; i += 2) |
|
res.push(parseInt(msg[i] + msg[i + 1], 16)); |
|
} |
|
} else { |
|
for (var i = 0; i < msg.length; i++) |
|
res[i] = msg[i] | 0; |
|
} |
|
return res; |
|
} |
|
utils.toArray = toArray; |
|
|
|
function toHex(msg) { |
|
var res = ''; |
|
for (var i = 0; i < msg.length; i++) |
|
res += zero2(msg[i].toString(16)); |
|
return res; |
|
} |
|
utils.toHex = toHex; |
|
|
|
function htonl(w) { |
|
var res = (w >>> 24) | |
|
((w >>> 8) & 0xff00) | |
|
((w << 8) & 0xff0000) | |
|
((w & 0xff) << 24); |
|
return res >>> 0; |
|
} |
|
utils.htonl = htonl; |
|
|
|
function toHex32(msg, endian) { |
|
var res = ''; |
|
for (var i = 0; i < msg.length; i++) { |
|
var w = msg[i]; |
|
if (endian === 'little') |
|
w = htonl(w); |
|
res += zero8(w.toString(16)); |
|
} |
|
return res; |
|
} |
|
utils.toHex32 = toHex32; |
|
|
|
function zero2(word) { |
|
if (word.length === 1) |
|
return '0' + word; |
|
else |
|
return word; |
|
} |
|
utils.zero2 = zero2; |
|
|
|
function zero8(word) { |
|
if (word.length === 7) |
|
return '0' + word; |
|
else if (word.length === 6) |
|
return '00' + word; |
|
else if (word.length === 5) |
|
return '000' + word; |
|
else if (word.length === 4) |
|
return '0000' + word; |
|
else if (word.length === 3) |
|
return '00000' + word; |
|
else if (word.length === 2) |
|
return '000000' + word; |
|
else if (word.length === 1) |
|
return '0000000' + word; |
|
else |
|
return word; |
|
} |
|
utils.zero8 = zero8; |
|
|
|
function join32(msg, start, end, endian) { |
|
var len = end - start; |
|
assert(len % 4 === 0); |
|
var res = new Array(len / 4); |
|
for (var i = 0, k = start; i < res.length; i++, k += 4) { |
|
var w; |
|
if (endian === 'big') |
|
w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3]; |
|
else |
|
w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]; |
|
res[i] = w >>> 0; |
|
} |
|
return res; |
|
} |
|
utils.join32 = join32; |
|
|
|
function split32(msg, endian) { |
|
var res = new Array(msg.length * 4); |
|
for (var i = 0, k = 0; i < msg.length; i++, k += 4) { |
|
var m = msg[i]; |
|
if (endian === 'big') { |
|
res[k] = m >>> 24; |
|
res[k + 1] = (m >>> 16) & 0xff; |
|
res[k + 2] = (m >>> 8) & 0xff; |
|
res[k + 3] = m & 0xff; |
|
} else { |
|
res[k + 3] = m >>> 24; |
|
res[k + 2] = (m >>> 16) & 0xff; |
|
res[k + 1] = (m >>> 8) & 0xff; |
|
res[k] = m & 0xff; |
|
} |
|
} |
|
return res; |
|
} |
|
utils.split32 = split32; |
|
|
|
function rotr32(w, b) { |
|
return (w >>> b) | (w << (32 - b)); |
|
} |
|
utils.rotr32 = rotr32; |
|
|
|
function rotl32(w, b) { |
|
return (w << b) | (w >>> (32 - b)); |
|
} |
|
utils.rotl32 = rotl32; |
|
|
|
function sum32(a, b) { |
|
return (a + b) >>> 0; |
|
} |
|
utils.sum32 = sum32; |
|
|
|
function sum32_3(a, b, c) { |
|
return (a + b + c) >>> 0; |
|
} |
|
utils.sum32_3 = sum32_3; |
|
|
|
function sum32_4(a, b, c, d) { |
|
return (a + b + c + d) >>> 0; |
|
} |
|
utils.sum32_4 = sum32_4; |
|
|
|
function sum32_5(a, b, c, d, e) { |
|
return (a + b + c + d + e) >>> 0; |
|
} |
|
utils.sum32_5 = sum32_5; |
|
|
|
function assert(cond, msg) { |
|
if (!cond) |
|
throw new Error(msg || 'Assertion failed'); |
|
} |
|
utils.assert = assert; |
|
|
|
utils.inherits = inherits; |
|
|
|
function sum64(buf, pos, ah, al) { |
|
var bh = buf[pos]; |
|
var bl = buf[pos + 1]; |
|
|
|
var lo = (al + bl) >>> 0; |
|
var hi = (lo < al ? 1 : 0) + ah + bh; |
|
buf[pos] = hi >>> 0; |
|
buf[pos + 1] = lo; |
|
} |
|
exports.sum64 = sum64; |
|
|
|
function sum64_hi(ah, al, bh, bl) { |
|
var lo = (al + bl) >>> 0; |
|
var hi = (lo < al ? 1 : 0) + ah + bh; |
|
return hi >>> 0; |
|
}; |
|
exports.sum64_hi = sum64_hi; |
|
|
|
function sum64_lo(ah, al, bh, bl) { |
|
var lo = al + bl; |
|
return lo >>> 0; |
|
}; |
|
exports.sum64_lo = sum64_lo; |
|
|
|
function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) { |
|
var carry = 0; |
|
var lo = al; |
|
lo = (lo + bl) >>> 0; |
|
carry += lo < al ? 1 : 0; |
|
lo = (lo + cl) >>> 0; |
|
carry += lo < cl ? 1 : 0; |
|
lo = (lo + dl) >>> 0; |
|
carry += lo < dl ? 1 : 0; |
|
|
|
var hi = ah + bh + ch + dh + carry; |
|
return hi >>> 0; |
|
}; |
|
exports.sum64_4_hi = sum64_4_hi; |
|
|
|
function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) { |
|
var lo = al + bl + cl + dl; |
|
return lo >>> 0; |
|
}; |
|
exports.sum64_4_lo = sum64_4_lo; |
|
|
|
function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) { |
|
var carry = 0; |
|
var lo = al; |
|
lo = (lo + bl) >>> 0; |
|
carry += lo < al ? 1 : 0; |
|
lo = (lo + cl) >>> 0; |
|
carry += lo < cl ? 1 : 0; |
|
lo = (lo + dl) >>> 0; |
|
carry += lo < dl ? 1 : 0; |
|
lo = (lo + el) >>> 0; |
|
carry += lo < el ? 1 : 0; |
|
|
|
var hi = ah + bh + ch + dh + eh + carry; |
|
return hi >>> 0; |
|
}; |
|
exports.sum64_5_hi = sum64_5_hi; |
|
|
|
function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) { |
|
var lo = al + bl + cl + dl + el; |
|
|
|
return lo >>> 0; |
|
}; |
|
exports.sum64_5_lo = sum64_5_lo; |
|
|
|
function rotr64_hi(ah, al, num) { |
|
var r = (al << (32 - num)) | (ah >>> num); |
|
return r >>> 0; |
|
}; |
|
exports.rotr64_hi = rotr64_hi; |
|
|
|
function rotr64_lo(ah, al, num) { |
|
var r = (ah << (32 - num)) | (al >>> num); |
|
return r >>> 0; |
|
}; |
|
exports.rotr64_lo = rotr64_lo; |
|
|
|
function shr64_hi(ah, al, num) { |
|
return ah >>> num; |
|
}; |
|
exports.shr64_hi = shr64_hi; |
|
|
|
function shr64_lo(ah, al, num) { |
|
var r = (ah << (32 - num)) | (al >>> num); |
|
return r >>> 0; |
|
}; |
|
exports.shr64_lo = shr64_lo; |
|
|
|
},{"inherits":320}],220:[function(require,module,exports){ |
|
module.exports={ |
|
"name": "elliptic", |
|
"version": "1.0.1", |
|
"description": "EC cryptography", |
|
"main": "lib/elliptic.js", |
|
"scripts": { |
|
"test": "mocha --reporter=spec test/*-test.js" |
|
}, |
|
"repository": { |
|
"type": "git", |
|
"url": "git@github.com:indutny/elliptic" |
|
}, |
|
"keywords": [ |
|
"EC", |
|
"Elliptic", |
|
"curve", |
|
"Cryptography" |
|
], |
|
"author": { |
|
"name": "Fedor Indutny", |
|
"email": "fedor@indutny.com" |
|
}, |
|
"license": "MIT", |
|
"bugs": { |
|
"url": "https://github.com/indutny/elliptic/issues" |
|
}, |
|
"homepage": "https://github.com/indutny/elliptic", |
|
"devDependencies": { |
|
"browserify": "^3.44.2", |
|
"mocha": "^1.18.2", |
|
"uglify-js": "^2.4.13" |
|
}, |
|
"dependencies": { |
|
"bn.js": "^1.0.0", |
|
"brorand": "^1.0.1", |
|
"hash.js": "^1.0.0", |
|
"inherits": "^2.0.1" |
|
}, |
|
"gitHead": "17dc013761dd1efcfb868e2b06b0b897627b40be", |
|
"_id": "elliptic@1.0.1", |
|
"_shasum": "d180376b66a17d74995c837796362ac4d22aefe3", |
|
"_from": "elliptic@>=1.0.0 <2.0.0", |
|
"_npmVersion": "1.4.28", |
|
"_npmUser": { |
|
"name": "indutny", |
|
"email": "fedor@indutny.com" |
|
}, |
|
"maintainers": [ |
|
{ |
|
"name": "indutny", |
|
"email": "fedor@indutny.com" |
|
} |
|
], |
|
"dist": { |
|
"shasum": "d180376b66a17d74995c837796362ac4d22aefe3", |
|
"tarball": "http://registry.npmjs.org/elliptic/-/elliptic-1.0.1.tgz" |
|
}, |
|
"directories": {}, |
|
"_resolved": "https://registry.npmjs.org/elliptic/-/elliptic-1.0.1.tgz" |
|
} |
|
|
|
},{}],221:[function(require,module,exports){ |
|
(function (Buffer){ |
|
|
|
module.exports = function evp(crypto, password, salt, keyLen) { |
|
keyLen = keyLen/8; |
|
var ki = 0; |
|
var ii = 0; |
|
var key = new Buffer(keyLen); |
|
var addmd = 0; |
|
var md, md_buf; |
|
var i; |
|
while (true) { |
|
md = crypto.createHash('md5'); |
|
if(addmd++ > 0) { |
|
md.update(md_buf); |
|
} |
|
md.update(password); |
|
md.update(salt); |
|
md_buf = md.digest(); |
|
i = 0; |
|
if(keyLen > 0) { |
|
while(true) { |
|
if(keyLen === 0) { |
|
break; |
|
} |
|
if(i === md_buf.length) { |
|
break; |
|
} |
|
key[ki++] = md_buf[i++]; |
|
keyLen--; |
|
} |
|
} |
|
if(keyLen === 0) { |
|
break; |
|
} |
|
} |
|
for(i=0;i<md_buf.length;i++) { |
|
md_buf[i] = 0; |
|
} |
|
return key; |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172}],222:[function(require,module,exports){ |
|
module.exports={"2.16.840.1.101.3.4.1.1": "aes-128-ecb", |
|
"2.16.840.1.101.3.4.1.2": "aes-128-cbc", |
|
"2.16.840.1.101.3.4.1.3": "aes-128-ofb", |
|
"2.16.840.1.101.3.4.1.4": "aes-128-cfb", |
|
"2.16.840.1.101.3.4.1.21": "aes-192-ecb", |
|
"2.16.840.1.101.3.4.1.22": "aes-192-cbc", |
|
"2.16.840.1.101.3.4.1.23": "aes-192-ofb", |
|
"2.16.840.1.101.3.4.1.24": "aes-192-cfb", |
|
"2.16.840.1.101.3.4.1.41": "aes-256-ecb", |
|
"2.16.840.1.101.3.4.1.42": "aes-256-cbc", |
|
"2.16.840.1.101.3.4.1.43": "aes-256-ofb", |
|
"2.16.840.1.101.3.4.1.44": "aes-256-cfb" |
|
} |
|
},{}],223:[function(require,module,exports){ |
|
// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js |
|
// Fedor, you are amazing. |
|
|
|
var asn1 = require('asn1.js'); |
|
var rfc3280 = require('asn1.js-rfc3280'); |
|
|
|
var RSAPrivateKey = asn1.define('RSAPrivateKey', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('modulus').int(), |
|
this.key('publicExponent').int(), |
|
this.key('privateExponent').int(), |
|
this.key('prime1').int(), |
|
this.key('prime2').int(), |
|
this.key('exponent1').int(), |
|
this.key('exponent2').int(), |
|
this.key('coefficient').int() |
|
); |
|
}); |
|
exports.RSAPrivateKey = RSAPrivateKey; |
|
|
|
var RSAPublicKey = asn1.define('RSAPublicKey', function() { |
|
this.seq().obj( |
|
this.key('modulus').int(), |
|
this.key('publicExponent').int() |
|
); |
|
}); |
|
exports.RSAPublicKey = RSAPublicKey; |
|
|
|
var PublicKey = rfc3280.SubjectPublicKeyInfo; |
|
exports.PublicKey = PublicKey; |
|
var ECPublicKey = asn1.define('ECPublicKey', function() { |
|
this.seq().obj( |
|
this.key('algorithm').seq().obj( |
|
this.key('id').objid(), |
|
this.key('curve').objid() |
|
), |
|
this.key('subjectPrivateKey').bitstr() |
|
); |
|
}); |
|
exports.ECPublicKey = ECPublicKey; |
|
var ECPrivateWrap = asn1.define('ECPrivateWrap', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('algorithm').seq().obj( |
|
this.key('id').objid(), |
|
this.key('curve').objid() |
|
), |
|
this.key('subjectPrivateKey').octstr() |
|
); |
|
}); |
|
exports.ECPrivateWrap = ECPrivateWrap; |
|
|
|
var PrivateKeyInfo = asn1.define('PrivateKeyInfo', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('algorithm').use(rfc3280.AlgorithmIdentifier), |
|
this.key('subjectPrivateKey').octstr() |
|
); |
|
}); |
|
exports.PrivateKey = PrivateKeyInfo; |
|
var EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function() { |
|
this.seq().obj( |
|
this.key('algorithm').seq().obj( |
|
this.key('id').objid(), |
|
this.key('decrypt').seq().obj( |
|
this.key('kde').seq().obj( |
|
this.key('id').objid(), |
|
this.key('kdeparams').seq().obj( |
|
this.key('salt').octstr(), |
|
this.key('iters').int() |
|
) |
|
), |
|
this.key('cipher').seq().obj( |
|
this.key('algo').objid(), |
|
this.key('iv').octstr() |
|
) |
|
) |
|
), |
|
this.key('subjectPrivateKey').octstr() |
|
); |
|
}); |
|
var dsaParams = asn1.define('dsaParams', function() { |
|
this.seq().obj( |
|
this.key('algorithm').objid(), |
|
this.key('parameters').seq().obj( |
|
this.key('p').int(), |
|
this.key('q').int(), |
|
this.key('g').int() |
|
) |
|
); |
|
}); |
|
exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo; |
|
var DSAPublicKey = asn1.define('DSAPublicKey', function() { |
|
this.seq().obj( |
|
this.key('algorithm').use(dsaParams), |
|
this.key('subjectPublicKey').bitstr() |
|
); |
|
}); |
|
exports.DSAPublicKey = DSAPublicKey; |
|
var DSAPrivateWrap = asn1.define('DSAPrivateWrap', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('algorithm').seq().obj( |
|
this.key('id').objid(), |
|
this.key('parameters').seq().obj( |
|
this.key('p').int(), |
|
this.key('q').int(), |
|
this.key('g').int() |
|
) |
|
), |
|
this.key('subjectPrivateKey').octstr() |
|
); |
|
}); |
|
exports.DSAPrivateWrap = DSAPrivateWrap; |
|
var DSAPrivateKey = asn1.define('DSAPrivateKey', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('p').int(), |
|
this.key('q').int(), |
|
this.key('g').int(), |
|
this.key('pub_key').int(), |
|
this.key('priv_key').int() |
|
); |
|
}); |
|
exports.DSAPrivateKey = DSAPrivateKey; |
|
|
|
exports.DSAparam = asn1.define('DSAparam', function () { |
|
this.int(); |
|
}); |
|
var ECPrivateKey = asn1.define('ECPrivateKey', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('privateKey').octstr(), |
|
this.key('parameters').optional().explicit(0).use(ECParameters), |
|
this.key('publicKey').optional().explicit(1).bitstr() |
|
); |
|
}); |
|
exports.ECPrivateKey = ECPrivateKey; |
|
var ECParameters = asn1.define('ECParameters', function() { |
|
this.choice({ |
|
namedCurve: this.objid() |
|
}); |
|
}); |
|
|
|
var ECPrivateKey2 = asn1.define('ECPrivateKey2', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('privateKey').octstr(), |
|
this.key('publicKey').seq().obj( |
|
this.key('key').bitstr() |
|
) |
|
); |
|
}); |
|
exports.ECPrivateKey2 = ECPrivateKey2; |
|
|
|
exports.signature = asn1.define('signature', function() { |
|
this.seq().obj( |
|
this.key('r').int(), |
|
this.key('s').int() |
|
); |
|
}); |
|
},{"asn1.js":227,"asn1.js-rfc3280":226}],224:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var findProc = /Proc-Type: 4,ENCRYPTED\n\r?DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)\n\r?\n\r?([0-9A-z\n\r\+\/\=]+)\n\r?/m; |
|
var startRegex = /^-----BEGIN (.*)-----\n/; |
|
var evp = require('./EVP_BytesToKey'); |
|
module.exports = function (okey, password, crypto) { |
|
var key = okey.toString(); |
|
var match = key.match(findProc); |
|
if (!match) { |
|
return okey; |
|
} |
|
var suite = 'aes' + match[1]; |
|
var iv = new Buffer(match[2], 'hex'); |
|
var cipherText = new Buffer(match[3].replace(/\n\r?/g, ''), 'base64'); |
|
var cipherKey = evp(crypto, password, iv.slice(0,8), parseInt(match[1])); |
|
var out = []; |
|
var cipher = crypto.createDecipheriv(suite, cipherKey, iv); |
|
out.push(cipher.update(cipherText)); |
|
out.push(cipher.final()); |
|
var decrypted = Buffer.concat(out).toString('base64'); |
|
var tag = key.match(startRegex)[1]; |
|
return '-----BEGIN ' + tag + "-----\n" + wrap(decrypted) + "\n" + '-----END ' + tag + "-----\n"; |
|
}; |
|
// http://stackoverflow.com/a/7033705 |
|
function wrap(str) { |
|
var chunks = []; |
|
while (str) { |
|
if (str.length < 64) { |
|
chunks.push(str); |
|
break; |
|
} |
|
else { |
|
chunks.push(str.slice(0, 64)); |
|
str = str.slice(64); |
|
} |
|
} |
|
return chunks.join("\n"); |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./EVP_BytesToKey":221,"buffer":172}],225:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var pemstrip = require('pemstrip'); |
|
var asn1 = require('./asn1'); |
|
var aesid = require('./aesid.json'); |
|
var fixProc = require('./fixProc'); |
|
module.exports = parseKeys; |
|
|
|
function parseKeys(buffer, crypto) { |
|
var password; |
|
if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) { |
|
password = buffer.passphrase; |
|
buffer = buffer.key; |
|
} |
|
if (typeof buffer === 'string') { |
|
buffer = new Buffer(buffer); |
|
} |
|
if (password) { |
|
buffer = fixProc(buffer, password, crypto); |
|
} |
|
var stripped = pemstrip.strip(buffer); |
|
var type = stripped.tag; |
|
var data = new Buffer(stripped.base64, 'base64'); |
|
var subtype,ndata; |
|
switch (type) { |
|
case 'PUBLIC KEY': |
|
ndata = asn1.PublicKey.decode(data, 'der'); |
|
subtype = ndata.algorithm.algorithm.join('.'); |
|
switch(subtype) { |
|
case '1.2.840.113549.1.1.1': |
|
return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der'); |
|
case '1.2.840.10045.2.1': |
|
return { |
|
type: 'ec', |
|
data: asn1.ECPublicKey.decode(data, 'der') |
|
}; |
|
case '1.2.840.10040.4.1': |
|
ndata = asn1.DSAPublicKey.decode(data, 'der'); |
|
ndata.algorithm.parameters.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der'); |
|
return { |
|
type: 'dsa', |
|
data: ndata.algorithm.parameters |
|
}; |
|
default: throw new Error('unknown key id ' + subtype); |
|
} |
|
throw new Error('unknown key type ' + type); |
|
case 'ENCRYPTED PRIVATE KEY': |
|
data = asn1.EncryptedPrivateKey.decode(data, 'der'); |
|
data = decrypt(crypto, data, password); |
|
//falling through |
|
case 'PRIVATE KEY': |
|
ndata = asn1.PrivateKey.decode(data, 'der'); |
|
subtype = ndata.algorithm.algorithm.join('.'); |
|
switch(subtype) { |
|
case '1.2.840.113549.1.1.1': |
|
return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der'); |
|
case '1.2.840.10045.2.1': |
|
ndata = asn1.ECPrivateWrap.decode(data, 'der'); |
|
return { |
|
curve: ndata.algorithm.curve, |
|
privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey |
|
}; |
|
case '1.2.840.10040.4.1': |
|
ndata = asn1.DSAPrivateWrap.decode(data, 'der'); |
|
ndata.algorithm.parameters.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der'); |
|
return { |
|
type: 'dsa', |
|
params: ndata.algorithm.parameters |
|
}; |
|
default: throw new Error('unknown key id ' + subtype); |
|
} |
|
throw new Error('unknown key type ' + type); |
|
case 'RSA PUBLIC KEY': |
|
return asn1.RSAPublicKey.decode(data, 'der'); |
|
case 'RSA PRIVATE KEY': |
|
return asn1.RSAPrivateKey.decode(data, 'der'); |
|
case 'DSA PRIVATE KEY': |
|
return { |
|
type: 'dsa', |
|
params: asn1.DSAPrivateKey.decode(data, 'der') |
|
}; |
|
case 'EC PRIVATE KEY': |
|
data = asn1.ECPrivateKey.decode(data, 'der'); |
|
return { |
|
curve: data.parameters.value, |
|
privateKey: data.privateKey |
|
}; |
|
default: throw new Error('unknown key type ' + type); |
|
} |
|
} |
|
parseKeys.signature = asn1.signature; |
|
function decrypt(crypto, data, password) { |
|
var salt = data.algorithm.decrypt.kde.kdeparams.salt; |
|
var iters = data.algorithm.decrypt.kde.kdeparams.iters; |
|
var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]; |
|
var iv = data.algorithm.decrypt.cipher.iv; |
|
var cipherText = data.subjectPrivateKey; |
|
var keylen = parseInt(algo.split('-')[1], 10)/8; |
|
var key = crypto.pbkdf2Sync(password, salt, iters, keylen); |
|
var cipher = crypto.createDecipheriv(algo, key, iv); |
|
var out = []; |
|
out.push(cipher.update(cipherText)); |
|
out.push(cipher.final()); |
|
return Buffer.concat(out); |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./aesid.json":222,"./asn1":223,"./fixProc":224,"buffer":172,"pemstrip":240}],226:[function(require,module,exports){ |
|
try { |
|
var asn1 = require('asn1.js'); |
|
} catch (e) { |
|
var asn1 = require('../' + '..'); |
|
} |
|
|
|
var CRLReason = asn1.define('CRLReason', function() { |
|
this.enum({ |
|
0: 'unspecified', |
|
1: 'keyCompromise', |
|
2: 'CACompromise', |
|
3: 'affiliationChanged', |
|
4: 'superseded', |
|
5: 'cessationOfOperation', |
|
6: 'certificateHold', |
|
8: 'removeFromCRL', |
|
9: 'privilegeWithdrawn', |
|
10: 'AACompromise' |
|
}); |
|
}); |
|
exports.CRLReason = CRLReason; |
|
|
|
var AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function() { |
|
this.seq().obj( |
|
this.key('algorithm').objid(), |
|
this.key('parameters').optional().any() |
|
); |
|
}); |
|
exports.AlgorithmIdentifier = AlgorithmIdentifier; |
|
|
|
var Certificate = asn1.define('Certificate', function() { |
|
this.seq().obj( |
|
this.key('tbsCertificate').use(TBSCertificate), |
|
this.key('signatureAlgorithm').use(AlgorithmIdentifier), |
|
this.key('signature').bitstr() |
|
); |
|
}); |
|
exports.Certificate = Certificate; |
|
|
|
var TBSCertificate = asn1.define('TBSCertificate', function() { |
|
this.seq().obj( |
|
this.key('version').def('v1').explicit(0).use(Version), |
|
this.key('serialNumber').use(CertificateSerialNumber), |
|
this.key('signature').use(AlgorithmIdentifier), |
|
this.key('issuer').use(Name), |
|
this.key('validity').use(Validity), |
|
this.key('subject').use(Name), |
|
this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo), |
|
|
|
// TODO(indutny): validate that version is v2 or v3 |
|
this.key('issuerUniqueID').optional().explicit(1).use(UniqueIdentifier), |
|
this.key('subjectUniqueID').optional().explicit(2).use(UniqueIdentifier), |
|
|
|
// TODO(indutny): validate that version is v3 |
|
this.key('extensions').optional().explicit(3).use(Extensions) |
|
); |
|
}); |
|
exports.TBSCertificate = TBSCertificate; |
|
|
|
var Version = asn1.define('Version', function() { |
|
this.int({ |
|
0: 'v1', |
|
1: 'v2', |
|
2: 'v3' |
|
}); |
|
}); |
|
exports.Version = Version; |
|
|
|
var CertificateSerialNumber = asn1.define('CertificateSerialNumber', |
|
function() { |
|
this.int(); |
|
}); |
|
exports.CertificateSerialNumber = CertificateSerialNumber; |
|
|
|
var Validity = asn1.define('Validity', function() { |
|
this.seq().obj( |
|
this.key('notBefore').use(Time), |
|
this.key('notAfter').use(Time) |
|
); |
|
}); |
|
exports.Validity = Validity; |
|
|
|
var Time = asn1.define('Time', function() { |
|
this.choice({ |
|
utcTime: this.utctime(), |
|
genTime: this.gentime() |
|
}); |
|
}); |
|
exports.Time = Time; |
|
|
|
var UniqueIdentifier = asn1.define('UniqueIdentifier', function() { |
|
this.bitstr(); |
|
}); |
|
exports.UniqueIdentifier = UniqueIdentifier; |
|
|
|
var SubjectPublicKeyInfo = asn1.define('SubjectPublicKeyInfo', function() { |
|
this.seq().obj( |
|
this.key('algorithm').use(AlgorithmIdentifier), |
|
this.key('subjectPublicKey').bitstr() |
|
); |
|
}); |
|
exports.SubjectPublicKeyInfo = SubjectPublicKeyInfo; |
|
|
|
var Extensions = asn1.define('Extensions', function() { |
|
this.seqof(Extension); |
|
}); |
|
exports.Extensions = Extensions; |
|
|
|
var Extension = asn1.define('Extension', function() { |
|
this.seq().obj( |
|
this.key('extnID').objid(), |
|
this.key('critical').bool().def(false), |
|
this.key('extnValue').octstr() |
|
); |
|
}); |
|
exports.Extension = Extension; |
|
|
|
var Name = asn1.define('Name', function() { |
|
this.choice({ |
|
rdn: this.use(RDNSequence) |
|
}); |
|
}); |
|
exports.Name = Name; |
|
|
|
var RDNSequence = asn1.define('RDNSequence', function() { |
|
this.seqof(RelativeDistinguishedName); |
|
}); |
|
exports.RDNSequence = RDNSequence; |
|
|
|
var RelativeDistinguishedName = asn1.define('RelativeDistinguishedName', |
|
function() { |
|
this.setof(AttributeTypeAndValue); |
|
}); |
|
exports.RelativeDistinguishedName = RelativeDistinguishedName; |
|
|
|
var AttributeTypeAndValue = asn1.define('AttributeTypeAndValue', function() { |
|
this.seq().obj( |
|
this.key('type').use(AttributeType), |
|
this.key('value').use(AttributeValue) |
|
); |
|
}); |
|
exports.AttributeTypeAndValue = AttributeTypeAndValue; |
|
|
|
var AttributeType = asn1.define('AttributeType', function() { |
|
this.objid(); |
|
}); |
|
exports.AttributeType = AttributeType; |
|
|
|
var AttributeValue = asn1.define('AttributeValue', function() { |
|
this.any(); |
|
}); |
|
exports.AttributeValue = AttributeValue; |
|
|
|
},{"asn1.js":227}],227:[function(require,module,exports){ |
|
var asn1 = exports; |
|
|
|
asn1.bignum = require('bn.js'); |
|
|
|
asn1.define = require('./asn1/api').define; |
|
asn1.base = require('./asn1/base'); |
|
asn1.constants = require('./asn1/constants'); |
|
asn1.decoders = require('./asn1/decoders'); |
|
asn1.encoders = require('./asn1/encoders'); |
|
|
|
},{"./asn1/api":228,"./asn1/base":230,"./asn1/constants":234,"./asn1/decoders":236,"./asn1/encoders":238,"bn.js":199}],228:[function(require,module,exports){ |
|
var asn1 = require('../asn1'); |
|
var inherits = require('inherits'); |
|
var vm = require('vm'); |
|
|
|
var api = exports; |
|
|
|
api.define = function define(name, body) { |
|
return new Entity(name, body); |
|
}; |
|
|
|
function Entity(name, body) { |
|
this.name = name; |
|
this.body = body; |
|
|
|
this.decoders = {}; |
|
this.encoders = {}; |
|
}; |
|
|
|
Entity.prototype._createNamed = function createNamed(base) { |
|
var named = vm.runInThisContext('(function ' + this.name + '(entity) {\n' + |
|
' this._initNamed(entity);\n' + |
|
'})'); |
|
inherits(named, base); |
|
named.prototype._initNamed = function initnamed(entity) { |
|
base.call(this, entity); |
|
}; |
|
|
|
return new named(this); |
|
}; |
|
|
|
Entity.prototype._getDecoder = function _getDecoder(enc) { |
|
// Lazily create decoder |
|
if (!this.decoders.hasOwnProperty(enc)) |
|
this.decoders[enc] = this._createNamed(asn1.decoders[enc]); |
|
return this.decoders[enc]; |
|
}; |
|
|
|
Entity.prototype.decode = function decode(data, enc, options) { |
|
return this._getDecoder(enc).decode(data, options); |
|
}; |
|
|
|
Entity.prototype._getEncoder = function _getEncoder(enc) { |
|
// Lazily create encoder |
|
if (!this.encoders.hasOwnProperty(enc)) |
|
this.encoders[enc] = this._createNamed(asn1.encoders[enc]); |
|
return this.encoders[enc]; |
|
}; |
|
|
|
Entity.prototype.encode = function encode(data, enc, /* internal */ reporter) { |
|
return this._getEncoder(enc).encode(data, reporter); |
|
}; |
|
|
|
},{"../asn1":227,"inherits":320,"vm":344}],229:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
var Reporter = require('../base').Reporter; |
|
var Buffer = require('buffer').Buffer; |
|
|
|
function DecoderBuffer(base, options) { |
|
Reporter.call(this, options); |
|
if (!Buffer.isBuffer(base)) { |
|
this.error('Input not Buffer'); |
|
return; |
|
} |
|
|
|
this.base = base; |
|
this.offset = 0; |
|
this.length = base.length; |
|
} |
|
inherits(DecoderBuffer, Reporter); |
|
exports.DecoderBuffer = DecoderBuffer; |
|
|
|
DecoderBuffer.prototype.save = function save() { |
|
return { offset: this.offset }; |
|
}; |
|
|
|
DecoderBuffer.prototype.restore = function restore(save) { |
|
// Return skipped data |
|
var res = new DecoderBuffer(this.base); |
|
res.offset = save.offset; |
|
res.length = this.offset; |
|
|
|
this.offset = save.offset; |
|
|
|
return res; |
|
}; |
|
|
|
DecoderBuffer.prototype.isEmpty = function isEmpty() { |
|
return this.offset === this.length; |
|
}; |
|
|
|
DecoderBuffer.prototype.readUInt8 = function readUInt8(fail) { |
|
if (this.offset + 1 <= this.length) |
|
return this.base.readUInt8(this.offset++, true); |
|
else |
|
return this.error(fail || 'DecoderBuffer overrun'); |
|
} |
|
|
|
DecoderBuffer.prototype.skip = function skip(bytes, fail) { |
|
if (!(this.offset + bytes <= this.length)) |
|
return this.error(fail || 'DecoderBuffer overrun'); |
|
|
|
var res = new DecoderBuffer(this.base); |
|
|
|
// Share reporter state |
|
res._reporterState = this._reporterState; |
|
|
|
res.offset = this.offset; |
|
res.length = this.offset + bytes; |
|
this.offset += bytes; |
|
return res; |
|
} |
|
|
|
DecoderBuffer.prototype.raw = function raw(save) { |
|
return this.base.slice(save ? save.offset : this.offset, this.length); |
|
} |
|
|
|
function EncoderBuffer(value, reporter) { |
|
if (Array.isArray(value)) { |
|
this.length = 0; |
|
this.value = value.map(function(item) { |
|
if (!(item instanceof EncoderBuffer)) |
|
item = new EncoderBuffer(item, reporter); |
|
this.length += item.length; |
|
return item; |
|
}, this); |
|
} else if (typeof value === 'number') { |
|
if (!(0 <= value && value <= 0xff)) |
|
return reporter.error('non-byte EncoderBuffer value'); |
|
this.value = value; |
|
this.length = 1; |
|
} else if (typeof value === 'string') { |
|
this.value = value; |
|
this.length = Buffer.byteLength(value); |
|
} else if (Buffer.isBuffer(value)) { |
|
this.value = value; |
|
this.length = value.length; |
|
} else { |
|
return reporter.error('Unsupported type: ' + typeof value); |
|
} |
|
} |
|
exports.EncoderBuffer = EncoderBuffer; |
|
|
|
EncoderBuffer.prototype.join = function join(out, offset) { |
|
if (!out) |
|
out = new Buffer(this.length); |
|
if (!offset) |
|
offset = 0; |
|
|
|
if (this.length === 0) |
|
return out; |
|
|
|
if (Array.isArray(this.value)) { |
|
this.value.forEach(function(item) { |
|
item.join(out, offset); |
|
offset += item.length; |
|
}); |
|
} else { |
|
if (typeof this.value === 'number') |
|
out[offset] = this.value; |
|
else if (typeof this.value === 'string') |
|
out.write(this.value, offset); |
|
else if (Buffer.isBuffer(this.value)) |
|
this.value.copy(out, offset); |
|
offset += this.length; |
|
} |
|
|
|
return out; |
|
}; |
|
|
|
},{"../base":230,"buffer":172,"inherits":320}],230:[function(require,module,exports){ |
|
var base = exports; |
|
|
|
base.Reporter = require('./reporter').Reporter; |
|
base.DecoderBuffer = require('./buffer').DecoderBuffer; |
|
base.EncoderBuffer = require('./buffer').EncoderBuffer; |
|
base.Node = require('./node'); |
|
|
|
},{"./buffer":229,"./node":231,"./reporter":232}],231:[function(require,module,exports){ |
|
var Reporter = require('../base').Reporter; |
|
var EncoderBuffer = require('../base').EncoderBuffer; |
|
var assert = require('minimalistic-assert'); |
|
|
|
// Supported tags |
|
var tags = [ |
|
'seq', 'seqof', 'set', 'setof', 'octstr', 'bitstr', 'objid', 'bool', |
|
'gentime', 'utctime', 'null_', 'enum', 'int', 'ia5str' |
|
]; |
|
|
|
// Public methods list |
|
var methods = [ |
|
'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice', |
|
'any' |
|
].concat(tags); |
|
|
|
// Overrided methods list |
|
var overrided = [ |
|
'_peekTag', '_decodeTag', '_use', |
|
'_decodeStr', '_decodeObjid', '_decodeTime', |
|
'_decodeNull', '_decodeInt', '_decodeBool', '_decodeList', |
|
|
|
'_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime', |
|
'_encodeNull', '_encodeInt', '_encodeBool' |
|
]; |
|
|
|
function Node(enc, parent) { |
|
var state = {}; |
|
this._baseState = state; |
|
|
|
state.enc = enc; |
|
|
|
state.parent = parent || null; |
|
state.children = null; |
|
|
|
// State |
|
state.tag = null; |
|
state.args = null; |
|
state.reverseArgs = null; |
|
state.choice = null; |
|
state.optional = false; |
|
state.any = false; |
|
state.obj = false; |
|
state.use = null; |
|
state.useDecoder = null; |
|
state.key = null; |
|
state['default'] = null; |
|
state.explicit = null; |
|
state.implicit = null; |
|
|
|
// Should create new instance on each method |
|
if (!state.parent) { |
|
state.children = []; |
|
this._wrap(); |
|
} |
|
} |
|
module.exports = Node; |
|
|
|
var stateProps = [ |
|
'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice', |
|
'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit', |
|
'implicit' |
|
]; |
|
|
|
Node.prototype.clone = function clone() { |
|
var state = this._baseState; |
|
var cstate = {}; |
|
stateProps.forEach(function(prop) { |
|
cstate[prop] = state[prop]; |
|
}); |
|
var res = new this.constructor(cstate.parent); |
|
res._baseState = cstate; |
|
return res; |
|
}; |
|
|
|
Node.prototype._wrap = function wrap() { |
|
var state = this._baseState; |
|
methods.forEach(function(method) { |
|
this[method] = function _wrappedMethod() { |
|
var clone = new this.constructor(this); |
|
state.children.push(clone); |
|
return clone[method].apply(clone, arguments); |
|
}; |
|
}, this); |
|
}; |
|
|
|
Node.prototype._init = function init(body) { |
|
var state = this._baseState; |
|
|
|
assert(state.parent === null); |
|
body.call(this); |
|
|
|
// Filter children |
|
state.children = state.children.filter(function(child) { |
|
return child._baseState.parent === this; |
|
}, this); |
|
assert.equal(state.children.length, 1, 'Root node can have only one child'); |
|
}; |
|
|
|
Node.prototype._useArgs = function useArgs(args) { |
|
var state = this._baseState; |
|
|
|
// Filter children and args |
|
var children = args.filter(function(arg) { |
|
return arg instanceof this.constructor; |
|
}, this); |
|
args = args.filter(function(arg) { |
|
return !(arg instanceof this.constructor); |
|
}, this); |
|
|
|
if (children.length !== 0) { |
|
assert(state.children === null); |
|
state.children = children; |
|
|
|
// Replace parent to maintain backward link |
|
children.forEach(function(child) { |
|
child._baseState.parent = this; |
|
}, this); |
|
} |
|
if (args.length !== 0) { |
|
assert(state.args === null); |
|
state.args = args; |
|
state.reverseArgs = args.map(function(arg) { |
|
if (typeof arg !== 'object' || arg.constructor !== Object) |
|
return arg; |
|
|
|
var res = {}; |
|
Object.keys(arg).forEach(function(key) { |
|
if (key == (key | 0)) |
|
key |= 0; |
|
var value = arg[key]; |
|
res[value] = key; |
|
}); |
|
return res; |
|
}); |
|
} |
|
}; |
|
|
|
// |
|
// Overrided methods |
|
// |
|
|
|
overrided.forEach(function(method) { |
|
Node.prototype[method] = function _overrided() { |
|
var state = this._baseState; |
|
throw new Error(method + ' not implemented for encoding: ' + state.enc); |
|
}; |
|
}); |
|
|
|
// |
|
// Public methods |
|
// |
|
|
|
tags.forEach(function(tag) { |
|
Node.prototype[tag] = function _tagMethod() { |
|
var state = this._baseState; |
|
var args = Array.prototype.slice.call(arguments); |
|
|
|
assert(state.tag === null); |
|
state.tag = tag; |
|
|
|
this._useArgs(args); |
|
|
|
return this; |
|
}; |
|
}); |
|
|
|
Node.prototype.use = function use(item) { |
|
var state = this._baseState; |
|
|
|
assert(state.use === null); |
|
state.use = item; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.optional = function optional() { |
|
var state = this._baseState; |
|
|
|
state.optional = true; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.def = function def(val) { |
|
var state = this._baseState; |
|
|
|
assert(state['default'] === null); |
|
state['default'] = val; |
|
state.optional = true; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.explicit = function explicit(num) { |
|
var state = this._baseState; |
|
|
|
assert(state.explicit === null && state.implicit === null); |
|
state.explicit = num; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.implicit = function implicit(num) { |
|
var state = this._baseState; |
|
|
|
assert(state.explicit === null && state.implicit === null); |
|
state.implicit = num; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.obj = function obj() { |
|
var state = this._baseState; |
|
var args = Array.prototype.slice.call(arguments); |
|
|
|
state.obj = true; |
|
|
|
if (args.length !== 0) |
|
this._useArgs(args); |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.key = function key(newKey) { |
|
var state = this._baseState; |
|
|
|
assert(state.key === null); |
|
state.key = newKey; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.any = function any() { |
|
var state = this._baseState; |
|
|
|
state.any = true; |
|
|
|
return this; |
|
}; |
|
|
|
Node.prototype.choice = function choice(obj) { |
|
var state = this._baseState; |
|
|
|
assert(state.choice === null); |
|
state.choice = obj; |
|
this._useArgs(Object.keys(obj).map(function(key) { |
|
return obj[key]; |
|
})); |
|
|
|
return this; |
|
}; |
|
|
|
// |
|
// Decoding |
|
// |
|
|
|
Node.prototype._decode = function decode(input) { |
|
var state = this._baseState; |
|
|
|
// Decode root node |
|
if (state.parent === null) |
|
return input.wrapResult(state.children[0]._decode(input)); |
|
|
|
var result = state['default']; |
|
var present = true; |
|
|
|
var prevKey; |
|
if (state.key !== null) |
|
prevKey = input.enterKey(state.key); |
|
|
|
// Check if tag is there |
|
if (state.optional) { |
|
present = this._peekTag( |
|
input, |
|
state.explicit !== null ? state.explicit : |
|
state.implicit !== null ? state.implicit : |
|
state.tag || 0 |
|
); |
|
if (input.isError(present)) |
|
return present; |
|
} |
|
|
|
// Push object on stack |
|
var prevObj; |
|
if (state.obj && present) |
|
prevObj = input.enterObject(); |
|
|
|
if (present) { |
|
// Unwrap explicit values |
|
if (state.explicit !== null) { |
|
var explicit = this._decodeTag(input, state.explicit); |
|
if (input.isError(explicit)) |
|
return explicit; |
|
input = explicit; |
|
} |
|
|
|
// Unwrap implicit and normal values |
|
if (state.use === null && state.choice === null) { |
|
if (state.any) |
|
var save = input.save(); |
|
var body = this._decodeTag( |
|
input, |
|
state.implicit !== null ? state.implicit : state.tag, |
|
state.any |
|
); |
|
if (input.isError(body)) |
|
return body; |
|
|
|
if (state.any) |
|
result = input.raw(save); |
|
else |
|
input = body; |
|
} |
|
|
|
// Select proper method for tag |
|
if (state.any) |
|
result = result; |
|
else if (state.choice === null) |
|
result = this._decodeGeneric(state.tag, input); |
|
else |
|
result = this._decodeChoice(input); |
|
|
|
if (input.isError(result)) |
|
return result; |
|
|
|
// Decode children |
|
if (!state.any && state.choice === null && state.children !== null) { |
|
var fail = state.children.some(function decodeChildren(child) { |
|
// NOTE: We are ignoring errors here, to let parser continue with other |
|
// parts of encoded data |
|
child._decode(input); |
|
}); |
|
if (fail) |
|
return err; |
|
} |
|
} |
|
|
|
// Pop object |
|
if (state.obj && present) |
|
result = input.leaveObject(prevObj); |
|
|
|
// Set key |
|
if (state.key !== null && (result !== null || present === true)) |
|
input.leaveKey(prevKey, state.key, result); |
|
|
|
return result; |
|
}; |
|
|
|
Node.prototype._decodeGeneric = function decodeGeneric(tag, input) { |
|
var state = this._baseState; |
|
|
|
if (tag === 'seq' || tag === 'set') |
|
return null; |
|
if (tag === 'seqof' || tag === 'setof') |
|
return this._decodeList(input, tag, state.args[0]); |
|
else if (tag === 'octstr' || tag === 'bitstr' || tag === 'ia5str') |
|
return this._decodeStr(input, tag); |
|
else if (tag === 'objid' && state.args) |
|
return this._decodeObjid(input, state.args[0], state.args[1]); |
|
else if (tag === 'objid') |
|
return this._decodeObjid(input, null, null); |
|
else if (tag === 'gentime' || tag === 'utctime') |
|
return this._decodeTime(input, tag); |
|
else if (tag === 'null_') |
|
return this._decodeNull(input); |
|
else if (tag === 'bool') |
|
return this._decodeBool(input); |
|
else if (tag === 'int' || tag === 'enum') |
|
return this._decodeInt(input, state.args && state.args[0]); |
|
else if (state.use !== null) |
|
return this._getUse(state.use, input._reporterState.obj)._decode(input); |
|
else |
|
return input.error('unknown tag: ' + tag); |
|
|
|
return null; |
|
}; |
|
|
|
Node.prototype._getUse = function _getUse(entity, obj) { |
|
|
|
var state = this._baseState; |
|
// Create altered use decoder if implicit is set |
|
state.useDecoder = this._use(entity, obj); |
|
assert(state.useDecoder._baseState.parent === null); |
|
state.useDecoder = state.useDecoder._baseState.children[0]; |
|
if (state.implicit !== state.useDecoder._baseState.implicit) { |
|
state.useDecoder = state.useDecoder.clone(); |
|
state.useDecoder._baseState.implicit = state.implicit; |
|
} |
|
return state.useDecoder; |
|
}; |
|
|
|
Node.prototype._decodeChoice = function decodeChoice(input) { |
|
var state = this._baseState; |
|
var result = null; |
|
var match = false; |
|
|
|
Object.keys(state.choice).some(function(key) { |
|
var save = input.save(); |
|
var node = state.choice[key]; |
|
try { |
|
var value = node._decode(input); |
|
if (input.isError(value)) |
|
return false; |
|
|
|
result = { type: key, value: value }; |
|
match = true; |
|
} catch (e) { |
|
input.restore(save); |
|
return false; |
|
} |
|
return true; |
|
}, this); |
|
|
|
if (!match) |
|
return input.error('Choice not matched'); |
|
|
|
return result; |
|
}; |
|
|
|
// |
|
// Encoding |
|
// |
|
|
|
Node.prototype._createEncoderBuffer = function createEncoderBuffer(data) { |
|
return new EncoderBuffer(data, this.reporter); |
|
}; |
|
|
|
Node.prototype._encode = function encode(data, reporter, parent) { |
|
var state = this._baseState; |
|
if (state['default'] !== null && state['default'] === data) |
|
return; |
|
|
|
var result = this._encodeValue(data, reporter, parent); |
|
if (result === undefined) |
|
return; |
|
|
|
if (this._skipDefault(result, reporter, parent)) |
|
return; |
|
|
|
return result; |
|
}; |
|
|
|
Node.prototype._encodeValue = function encode(data, reporter, parent) { |
|
var state = this._baseState; |
|
|
|
// Decode root node |
|
if (state.parent === null) |
|
return state.children[0]._encode(data, reporter || new Reporter()); |
|
|
|
var result = null; |
|
var present = true; |
|
|
|
// Set reporter to share it with a child class |
|
this.reporter = reporter; |
|
|
|
// Check if data is there |
|
if (state.optional && data === undefined) { |
|
if (state['default'] !== null) |
|
data = state['default'] |
|
else |
|
return; |
|
} |
|
|
|
// For error reporting |
|
var prevKey; |
|
|
|
// Encode children first |
|
var content = null; |
|
var primitive = false; |
|
if (state.any) { |
|
// Anything that was given is translated to buffer |
|
result = this._createEncoderBuffer(data); |
|
} else if (state.choice) { |
|
result = this._encodeChoice(data, reporter); |
|
} else if (state.children) { |
|
content = state.children.map(function(child) { |
|
if (child._baseState.tag === 'null_') |
|
return child._encode(null, reporter, data); |
|
|
|
if (child._baseState.key === null) |
|
return reporter.error('Child should have a key'); |
|
var prevKey = reporter.enterKey(child._baseState.key); |
|
|
|
if (typeof data !== 'object') |
|
return reporter.error('Child expected, but input is not object'); |
|
|
|
var res = child._encode(data[child._baseState.key], reporter, data); |
|
reporter.leaveKey(prevKey); |
|
|
|
return res; |
|
}, this).filter(function(child) { |
|
return child; |
|
}); |
|
|
|
content = this._createEncoderBuffer(content); |
|
} else { |
|
if (state.tag === 'seqof' || state.tag === 'setof') { |
|
// TODO(indutny): this should be thrown on DSL level |
|
if (!(state.args && state.args.length === 1)) |
|
return reporter.error('Too many args for : ' + state.tag); |
|
|
|
if (!Array.isArray(data)) |
|
return reporter.error('seqof/setof, but data is not Array'); |
|
|
|
var child = this.clone(); |
|
child._baseState.implicit = null; |
|
content = this._createEncoderBuffer(data.map(function(item) { |
|
var state = this._baseState; |
|
|
|
return this._getUse(state.args[0], data)._encode(item, reporter); |
|
}, child)); |
|
} else if (state.use !== null) { |
|
result = this._getUse(state.use, parent)._encode(data, reporter); |
|
} else { |
|
content = this._encodePrimitive(state.tag, data); |
|
primitive = true; |
|
} |
|
} |
|
|
|
// Encode data itself |
|
var result; |
|
if (!state.any && state.choice === null) { |
|
var tag = state.implicit !== null ? state.implicit : state.tag; |
|
var cls = state.implicit === null ? 'universal' : 'context'; |
|
|
|
if (tag === null) { |
|
if (state.use === null) |
|
reporter.error('Tag could be ommited only for .use()'); |
|
} else { |
|
if (state.use === null) |
|
result = this._encodeComposite(tag, primitive, cls, content); |
|
} |
|
} |
|
|
|
// Wrap in explicit |
|
if (state.explicit !== null) |
|
result = this._encodeComposite(state.explicit, false, 'context', result); |
|
|
|
return result; |
|
}; |
|
|
|
Node.prototype._encodeChoice = function encodeChoice(data, reporter) { |
|
var state = this._baseState; |
|
|
|
var node = state.choice[data.type]; |
|
if (!node) { |
|
assert( |
|
false, |
|
data.type + ' not found in ' + |
|
JSON.stringify(Object.keys(state.choice))); |
|
} |
|
return node._encode(data.value, reporter); |
|
}; |
|
|
|
Node.prototype._encodePrimitive = function encodePrimitive(tag, data) { |
|
var state = this._baseState; |
|
|
|
if (tag === 'octstr' || tag === 'bitstr' || tag === 'ia5str') |
|
return this._encodeStr(data, tag); |
|
else if (tag === 'objid' && state.args) |
|
return this._encodeObjid(data, state.reverseArgs[0], state.args[1]); |
|
else if (tag === 'objid') |
|
return this._encodeObjid(data, null, null); |
|
else if (tag === 'gentime' || tag === 'utctime') |
|
return this._encodeTime(data, tag); |
|
else if (tag === 'null_') |
|
return this._encodeNull(); |
|
else if (tag === 'int' || tag === 'enum') |
|
return this._encodeInt(data, state.args && state.reverseArgs[0]); |
|
else if (tag === 'bool') |
|
return this._encodeBool(data); |
|
else |
|
throw new Error('Unsupported tag: ' + tag); |
|
}; |
|
|
|
},{"../base":230,"minimalistic-assert":239}],232:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
function Reporter(options) { |
|
this._reporterState = { |
|
obj: null, |
|
path: [], |
|
options: options || {}, |
|
errors: [] |
|
}; |
|
} |
|
exports.Reporter = Reporter; |
|
|
|
Reporter.prototype.isError = function isError(obj) { |
|
return obj instanceof ReporterError; |
|
}; |
|
|
|
Reporter.prototype.enterKey = function enterKey(key) { |
|
return this._reporterState.path.push(key); |
|
}; |
|
|
|
Reporter.prototype.leaveKey = function leaveKey(index, key, value) { |
|
var state = this._reporterState; |
|
|
|
state.path = state.path.slice(0, index - 1); |
|
if (state.obj !== null) |
|
state.obj[key] = value; |
|
}; |
|
|
|
Reporter.prototype.enterObject = function enterObject() { |
|
var state = this._reporterState; |
|
|
|
var prev = state.obj; |
|
state.obj = {}; |
|
return prev; |
|
}; |
|
|
|
Reporter.prototype.leaveObject = function leaveObject(prev) { |
|
var state = this._reporterState; |
|
|
|
var now = state.obj; |
|
state.obj = prev; |
|
return now; |
|
}; |
|
|
|
Reporter.prototype.error = function error(msg) { |
|
var err; |
|
var state = this._reporterState; |
|
|
|
var inherited = msg instanceof ReporterError; |
|
if (inherited) { |
|
err = msg; |
|
} else { |
|
err = new ReporterError(state.path.map(function(elem) { |
|
return '[' + JSON.stringify(elem) + ']'; |
|
}).join(''), msg.message || msg, msg.stack); |
|
} |
|
|
|
if (!state.options.partial) |
|
throw err; |
|
|
|
if (!inherited) |
|
state.errors.push(err); |
|
|
|
return err; |
|
}; |
|
|
|
Reporter.prototype.wrapResult = function wrapResult(result) { |
|
var state = this._reporterState; |
|
if (!state.options.partial) |
|
return result; |
|
|
|
return { |
|
result: this.isError(result) ? null : result, |
|
errors: state.errors |
|
}; |
|
}; |
|
|
|
function ReporterError(path, msg) { |
|
this.path = path; |
|
this.rethrow(msg); |
|
}; |
|
inherits(ReporterError, Error); |
|
|
|
ReporterError.prototype.rethrow = function rethrow(msg) { |
|
this.message = msg + ' at: ' + (this.path || '(shallow)'); |
|
Error.captureStackTrace(this, ReporterError); |
|
|
|
return this; |
|
}; |
|
|
|
},{"inherits":320}],233:[function(require,module,exports){ |
|
var constants = require('../constants'); |
|
|
|
exports.tagClass = { |
|
0: 'universal', |
|
1: 'application', |
|
2: 'context', |
|
3: 'private' |
|
}; |
|
exports.tagClassByName = constants._reverse(exports.tagClass); |
|
|
|
exports.tag = { |
|
0x00: 'end', |
|
0x01: 'bool', |
|
0x02: 'int', |
|
0x03: 'bitstr', |
|
0x04: 'octstr', |
|
0x05: 'null_', |
|
0x06: 'objid', |
|
0x07: 'objDesc', |
|
0x08: 'external', |
|
0x09: 'real', |
|
0x0a: 'enum', |
|
0x0b: 'embed', |
|
0x0c: 'utf8str', |
|
0x0d: 'relativeOid', |
|
0x10: 'seq', |
|
0x11: 'set', |
|
0x12: 'numstr', |
|
0x13: 'printstr', |
|
0x14: 't61str', |
|
0x15: 'videostr', |
|
0x16: 'ia5str', |
|
0x17: 'utctime', |
|
0x18: 'gentime', |
|
0x19: 'graphstr', |
|
0x1a: 'iso646str', |
|
0x1b: 'genstr', |
|
0x1c: 'unistr', |
|
0x1d: 'charstr', |
|
0x1e: 'bmpstr' |
|
}; |
|
exports.tagByName = constants._reverse(exports.tag); |
|
|
|
},{"../constants":234}],234:[function(require,module,exports){ |
|
var constants = exports; |
|
|
|
// Helper |
|
constants._reverse = function reverse(map) { |
|
var res = {}; |
|
|
|
Object.keys(map).forEach(function(key) { |
|
// Convert key to integer if it is stringified |
|
if ((key | 0) == key) |
|
key = key | 0; |
|
|
|
var value = map[key]; |
|
res[value] = key; |
|
}); |
|
|
|
return res; |
|
}; |
|
|
|
constants.der = require('./der'); |
|
|
|
},{"./der":233}],235:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
|
|
var asn1 = require('../../asn1'); |
|
var base = asn1.base; |
|
var bignum = asn1.bignum; |
|
|
|
// Import DER constants |
|
var der = asn1.constants.der; |
|
|
|
function DERDecoder(entity) { |
|
this.enc = 'der'; |
|
this.name = entity.name; |
|
this.entity = entity; |
|
|
|
// Construct base tree |
|
this.tree = new DERNode(); |
|
this.tree._init(entity.body); |
|
}; |
|
module.exports = DERDecoder; |
|
|
|
DERDecoder.prototype.decode = function decode(data, options) { |
|
if (!(data instanceof base.DecoderBuffer)) |
|
data = new base.DecoderBuffer(data, options); |
|
|
|
return this.tree._decode(data, options); |
|
}; |
|
|
|
// Tree methods |
|
|
|
function DERNode(parent) { |
|
base.Node.call(this, 'der', parent); |
|
} |
|
inherits(DERNode, base.Node); |
|
|
|
DERNode.prototype._peekTag = function peekTag(buffer, tag) { |
|
if (buffer.isEmpty()) |
|
return false; |
|
|
|
var state = buffer.save(); |
|
var decodedTag = derDecodeTag(buffer, 'Failed to peek tag: "' + tag + '"'); |
|
if (buffer.isError(decodedTag)) |
|
return decodedTag; |
|
|
|
buffer.restore(state); |
|
|
|
return decodedTag.tag === tag || decodedTag.tagStr === tag; |
|
}; |
|
|
|
DERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) { |
|
var decodedTag = derDecodeTag(buffer, |
|
'Failed to decode tag of "' + tag + '"'); |
|
if (buffer.isError(decodedTag)) |
|
return decodedTag; |
|
|
|
var len = derDecodeLen(buffer, |
|
decodedTag.primitive, |
|
'Failed to get length of "' + tag + '"'); |
|
|
|
// Failure |
|
if (buffer.isError(len)) |
|
return len; |
|
|
|
if (!any && |
|
decodedTag.tag !== tag && |
|
decodedTag.tagStr !== tag && |
|
decodedTag.tagStr + 'of' !== tag) { |
|
return buffer.error('Failed to match tag: "' + tag + '"'); |
|
} |
|
|
|
if (decodedTag.primitive || len !== null) |
|
return buffer.skip(len, 'Failed to match body of: "' + tag + '"'); |
|
|
|
// Indefinite length... find END tag |
|
var state = buffer.start(); |
|
var res = this._skipUntilEnd( |
|
buffer, |
|
'Failed to skip indefinite length body: "' + this.tag + '"'); |
|
if (buffer.isError(res)) |
|
return res; |
|
|
|
return buffer.cut(state); |
|
}; |
|
|
|
DERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) { |
|
while (true) { |
|
var tag = derDecodeTag(buffer, fail); |
|
if (buffer.isError(tag)) |
|
return tag; |
|
var len = derDecodeLen(buffer, tag.primitive, fail); |
|
if (buffer.isError(len)) |
|
return len; |
|
|
|
var res; |
|
if (tag.primitive || len !== null) |
|
res = buffer.skip(len) |
|
else |
|
res = this._skipUntilEnd(buffer, fail); |
|
|
|
// Failure |
|
if (buffer.isError(res)) |
|
return res; |
|
|
|
if (tag.tagStr === 'end') |
|
break; |
|
} |
|
}; |
|
|
|
DERNode.prototype._decodeList = function decodeList(buffer, tag, decoder) { |
|
var result = []; |
|
while (!buffer.isEmpty()) { |
|
var possibleEnd = this._peekTag(buffer, 'end'); |
|
if (buffer.isError(possibleEnd)) |
|
return possibleEnd; |
|
|
|
var res = decoder.decode(buffer, 'der'); |
|
if (buffer.isError(res) && possibleEnd) |
|
break; |
|
result.push(res); |
|
} |
|
return result; |
|
}; |
|
|
|
DERNode.prototype._decodeStr = function decodeStr(buffer, tag) { |
|
if (tag === 'octstr') { |
|
return buffer.raw(); |
|
} else if (tag === 'bitstr') { |
|
var unused = buffer.readUInt8(); |
|
if (buffer.isError(unused)) |
|
return unused; |
|
|
|
return { unused: unused, data: buffer.raw() }; |
|
} else if (tag === 'ia5str') { |
|
return buffer.raw().toString(); |
|
} else { |
|
return this.error('Decoding of string type: ' + tag + ' unsupported'); |
|
} |
|
}; |
|
|
|
DERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) { |
|
var identifiers = []; |
|
var ident = 0; |
|
while (!buffer.isEmpty()) { |
|
var subident = buffer.readUInt8(); |
|
ident <<= 7; |
|
ident |= subident & 0x7f; |
|
if ((subident & 0x80) === 0) { |
|
identifiers.push(ident); |
|
ident = 0; |
|
} |
|
} |
|
if (subident & 0x80) |
|
identifiers.push(ident); |
|
|
|
var first = (identifiers[0] / 40) | 0; |
|
var second = identifiers[0] % 40; |
|
|
|
if (relative) |
|
result = identifiers; |
|
else |
|
result = [first, second].concat(identifiers.slice(1)); |
|
|
|
if (values) |
|
result = values[result.join(' ')]; |
|
|
|
return result; |
|
}; |
|
|
|
DERNode.prototype._decodeTime = function decodeTime(buffer, tag) { |
|
var str = buffer.raw().toString(); |
|
if (tag === 'gentime') { |
|
var year = str.slice(0, 4) | 0; |
|
var mon = str.slice(4, 6) | 0; |
|
var day = str.slice(6, 8) | 0; |
|
var hour = str.slice(8, 10) | 0; |
|
var min = str.slice(10, 12) | 0; |
|
var sec = str.slice(12, 14) | 0; |
|
} else if (tag === 'utctime') { |
|
var year = str.slice(0, 2) | 0; |
|
var mon = str.slice(2, 4) | 0; |
|
var day = str.slice(4, 6) | 0; |
|
var hour = str.slice(6, 8) | 0; |
|
var min = str.slice(8, 10) | 0; |
|
var sec = str.slice(10, 12) | 0; |
|
if (year < 70) |
|
year = 2000 + year; |
|
else |
|
year = 1900 + year; |
|
} else { |
|
return this.error('Decoding ' + tag + ' time is not supported yet'); |
|
} |
|
|
|
return Date.UTC(year, mon - 1, day, hour, min, sec, 0); |
|
}; |
|
|
|
DERNode.prototype._decodeNull = function decodeNull(buffer) { |
|
return null; |
|
}; |
|
|
|
DERNode.prototype._decodeBool = function decodeBool(buffer) { |
|
var res = buffer.readUInt8(); |
|
if (buffer.isError(res)) |
|
return res; |
|
else |
|
return res !== 0; |
|
}; |
|
|
|
DERNode.prototype._decodeInt = function decodeInt(buffer, values) { |
|
var res = 0; |
|
|
|
// Bigint, return as it is (assume big endian) |
|
var raw = buffer.raw(); |
|
if (raw.length > 3) |
|
return new bignum(raw); |
|
|
|
while (!buffer.isEmpty()) { |
|
res <<= 8; |
|
var i = buffer.readUInt8(); |
|
if (buffer.isError(i)) |
|
return i; |
|
res |= i; |
|
} |
|
|
|
if (values) |
|
res = values[res] || res; |
|
|
|
return res; |
|
}; |
|
|
|
DERNode.prototype._use = function use(entity, obj) { |
|
if (typeof entity === 'function') |
|
entity = entity(obj); |
|
return entity._getDecoder('der').tree; |
|
}; |
|
|
|
// Utility methods |
|
|
|
function derDecodeTag(buf, fail) { |
|
var tag = buf.readUInt8(fail); |
|
if (buf.isError(tag)) |
|
return tag; |
|
|
|
var cls = der.tagClass[tag >> 6]; |
|
var primitive = (tag & 0x20) === 0; |
|
|
|
// Multi-octet tag - load |
|
if ((tag & 0x1f) === 0x1f) { |
|
var oct = tag; |
|
tag = 0; |
|
while ((oct & 0x80) === 0x80) { |
|
oct = buf.readUInt8(fail); |
|
if (buf.isError(oct)) |
|
return oct; |
|
|
|
tag <<= 7; |
|
tag |= oct & 0x7f; |
|
} |
|
} else { |
|
tag &= 0x1f; |
|
} |
|
var tagStr = der.tag[tag]; |
|
|
|
return { |
|
cls: cls, |
|
primitive: primitive, |
|
tag: tag, |
|
tagStr: tagStr |
|
}; |
|
} |
|
|
|
function derDecodeLen(buf, primitive, fail) { |
|
var len = buf.readUInt8(fail); |
|
if (buf.isError(len)) |
|
return len; |
|
|
|
// Indefinite form |
|
if (!primitive && len === 0x80) |
|
return null; |
|
|
|
// Definite form |
|
if ((len & 0x80) === 0) { |
|
// Short form |
|
return len; |
|
} |
|
|
|
// Long form |
|
var num = len & 0x7f; |
|
if (num >= 4) |
|
return buf.error('length octect is too long'); |
|
|
|
len = 0; |
|
for (var i = 0; i < num; i++) { |
|
len <<= 8; |
|
var j = buf.readUInt8(fail); |
|
if (buf.isError(j)) |
|
return j; |
|
len |= j; |
|
} |
|
|
|
return len; |
|
} |
|
|
|
},{"../../asn1":227,"inherits":320}],236:[function(require,module,exports){ |
|
var decoders = exports; |
|
|
|
decoders.der = require('./der'); |
|
|
|
},{"./der":235}],237:[function(require,module,exports){ |
|
var inherits = require('inherits'); |
|
var Buffer = require('buffer').Buffer; |
|
|
|
var asn1 = require('../../asn1'); |
|
var base = asn1.base; |
|
var bignum = asn1.bignum; |
|
|
|
// Import DER constants |
|
var der = asn1.constants.der; |
|
|
|
function DEREncoder(entity) { |
|
this.enc = 'der'; |
|
this.name = entity.name; |
|
this.entity = entity; |
|
|
|
// Construct base tree |
|
this.tree = new DERNode(); |
|
this.tree._init(entity.body); |
|
}; |
|
module.exports = DEREncoder; |
|
|
|
DEREncoder.prototype.encode = function encode(data, reporter) { |
|
return this.tree._encode(data, reporter).join(); |
|
}; |
|
|
|
// Tree methods |
|
|
|
function DERNode(parent) { |
|
base.Node.call(this, 'der', parent); |
|
} |
|
inherits(DERNode, base.Node); |
|
|
|
DERNode.prototype._encodeComposite = function encodeComposite(tag, |
|
primitive, |
|
cls, |
|
content) { |
|
var encodedTag = encodeTag(tag, primitive, cls, this.reporter); |
|
|
|
// Short form |
|
if (content.length < 0x80) { |
|
var header = new Buffer(2); |
|
header[0] = encodedTag; |
|
header[1] = content.length; |
|
return this._createEncoderBuffer([ header, content ]); |
|
} |
|
|
|
// Long form |
|
// Count octets required to store length |
|
var lenOctets = 1; |
|
for (var i = content.length; i >= 0x100; i >>= 8) |
|
lenOctets++; |
|
|
|
var header = new Buffer(1 + 1 + lenOctets); |
|
header[0] = encodedTag; |
|
header[1] = 0x80 | lenOctets; |
|
|
|
for (var i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) |
|
header[i] = j & 0xff; |
|
|
|
return this._createEncoderBuffer([ header, content ]); |
|
}; |
|
|
|
DERNode.prototype._encodeStr = function encodeStr(str, tag) { |
|
if (tag === 'octstr') |
|
return this._createEncoderBuffer(str); |
|
else if (tag === 'bitstr') |
|
return this._createEncoderBuffer([ str.unused | 0, str.data ]); |
|
else if (tag === 'ia5str') |
|
return this._createEncoderBuffer(str); |
|
return this.reporter.error('Encoding of string type: ' + tag + |
|
' unsupported'); |
|
}; |
|
|
|
DERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) { |
|
if (typeof id === 'string') { |
|
if (!values) |
|
return this.reporter.error('string objid given, but no values map found'); |
|
if (!values.hasOwnProperty(id)) |
|
return this.reporter.error('objid not found in values map'); |
|
id = values[id].split(/\s+/g); |
|
for (var i = 0; i < id.length; i++) |
|
id[i] |= 0; |
|
} else if (Array.isArray(id)) { |
|
id = id.slice(); |
|
} |
|
|
|
if (!Array.isArray(id)) { |
|
return this.reporter.error('objid() should be either array or string, ' + |
|
'got: ' + JSON.stringify(id)); |
|
} |
|
|
|
if (!relative) { |
|
if (id[1] >= 40) |
|
return this.reporter.error('Second objid identifier OOB'); |
|
id.splice(0, 2, id[0] * 40 + id[1]); |
|
} |
|
|
|
// Count number of octets |
|
var size = 0; |
|
for (var i = 0; i < id.length; i++) { |
|
var ident = id[i]; |
|
for (size++; ident >= 0x80; ident >>= 7) |
|
size++; |
|
} |
|
|
|
var objid = new Buffer(size); |
|
var offset = objid.length - 1; |
|
for (var i = id.length - 1; i >= 0; i--) { |
|
var ident = id[i]; |
|
objid[offset--] = ident & 0x7f; |
|
while ((ident >>= 7) > 0) |
|
objid[offset--] = 0x80 | (ident & 0x7f); |
|
} |
|
|
|
return this._createEncoderBuffer(objid); |
|
}; |
|
|
|
function two(num) { |
|
if (num <= 10) |
|
return '0' + num; |
|
else |
|
return num; |
|
} |
|
|
|
DERNode.prototype._encodeTime = function encodeTime(time, tag) { |
|
var str; |
|
var date = new Date(time); |
|
|
|
if (tag === 'gentime') { |
|
str = [ |
|
date.getFullYear(), |
|
two(date.getUTCMonth() + 1), |
|
two(date.getUTCDate()), |
|
two(date.getUTCHours()), |
|
two(date.getUTCMinutes()), |
|
two(date.getUTCSeconds()), |
|
'Z' |
|
].join(''); |
|
} else if (tag === 'utctime') { |
|
str = [ |
|
date.getFullYear() % 100, |
|
two(date.getUTCMonth() + 1), |
|
two(date.getUTCDate()), |
|
two(date.getUTCHours()), |
|
two(date.getUTCMinutes()), |
|
two(date.getUTCSeconds()), |
|
'Z' |
|
].join(''); |
|
} else { |
|
this.reporter.error('Encoding ' + tag + ' time is not supported yet'); |
|
} |
|
|
|
return this._encodeStr(str, 'octstr'); |
|
}; |
|
|
|
DERNode.prototype._encodeNull = function encodeNull() { |
|
return this._createEncoderBuffer(''); |
|
}; |
|
|
|
DERNode.prototype._encodeInt = function encodeInt(num, values) { |
|
if (typeof num === 'string') { |
|
if (!values) |
|
return this.reporter.error('String int or enum given, but no values map'); |
|
if (!values.hasOwnProperty(num)) { |
|
return this.reporter.error('Values map doesn\'t contain: ' + |
|
JSON.stringify(num)); |
|
} |
|
num = values[num]; |
|
} |
|
|
|
// Bignum, assume big endian |
|
if (bignum !== null && num instanceof bignum) { |
|
var numArray = num.toArray(); |
|
if(num.sign === false && numArray[0] & 0x80) { |
|
numArray.unshift(0); |
|
} |
|
num = new Buffer(numArray); |
|
} |
|
|
|
if (Buffer.isBuffer(num)) { |
|
var size = num.length; |
|
if (num.length === 0) |
|
size++; |
|
|
|
var out = new Buffer(size); |
|
num.copy(out); |
|
if (num.length === 0) |
|
out[0] = 0 |
|
return this._createEncoderBuffer(out); |
|
} |
|
|
|
if (num < 0x80) |
|
return this._createEncoderBuffer(num); |
|
|
|
if (num < 0x100) |
|
return this._createEncoderBuffer([0, num]); |
|
|
|
var size = 1; |
|
for (var i = num; i >= 0x100; i >>= 8) |
|
size++; |
|
|
|
var out = new Array(size); |
|
for (var i = out.length - 1; i >= 0; i--) { |
|
out[i] = num & 0xff; |
|
num >>= 8; |
|
} |
|
if(out[0] & 0x80) { |
|
out.unshift(0); |
|
} |
|
|
|
return this._createEncoderBuffer(new Buffer(out)); |
|
}; |
|
|
|
DERNode.prototype._encodeBool = function encodeBool(value) { |
|
return this._createEncoderBuffer(value ? 0xff : 0); |
|
}; |
|
|
|
DERNode.prototype._use = function use(entity, obj) { |
|
if (typeof entity === 'function') |
|
entity = entity(obj); |
|
return entity._getEncoder('der').tree; |
|
}; |
|
|
|
DERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) { |
|
var state = this._baseState; |
|
var i; |
|
if (state['default'] === null) |
|
return false; |
|
|
|
var data = dataBuffer.join(); |
|
if (state.defaultBuffer === undefined) |
|
state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join(); |
|
|
|
if (data.length !== state.defaultBuffer.length) |
|
return false; |
|
|
|
for (i=0; i < data.length; i++) |
|
if (data[i] !== state.defaultBuffer[i]) |
|
return false; |
|
|
|
return true; |
|
}; |
|
|
|
// Utility methods |
|
|
|
function encodeTag(tag, primitive, cls, reporter) { |
|
var res; |
|
|
|
if (tag === 'seqof') |
|
tag = 'seq'; |
|
else if (tag === 'setof') |
|
tag = 'set'; |
|
|
|
if (der.tagByName.hasOwnProperty(tag)) |
|
res = der.tagByName[tag]; |
|
else if (typeof tag === 'number' && (tag | 0) === tag) |
|
res = tag; |
|
else |
|
return reporter.error('Unknown tag: ' + tag); |
|
|
|
if (res >= 0x1f) |
|
return reporter.error('Multi-octet tag encoding unsupported'); |
|
|
|
if (!primitive) |
|
res |= 0x20; |
|
|
|
res |= (der.tagClassByName[cls || 'universal'] << 6); |
|
|
|
return res; |
|
} |
|
|
|
},{"../../asn1":227,"buffer":172,"inherits":320}],238:[function(require,module,exports){ |
|
var encoders = exports; |
|
|
|
encoders.der = require('./der'); |
|
|
|
},{"./der":237}],239:[function(require,module,exports){ |
|
module.exports = assert; |
|
|
|
function assert(val, msg) { |
|
if (!val) |
|
throw new Error(msg || 'Assertion failed'); |
|
} |
|
|
|
assert.equal = function assertEqual(l, r, msg) { |
|
if (l != r) |
|
throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r)); |
|
}; |
|
|
|
},{}],240:[function(require,module,exports){ |
|
exports.strip = function strip(artifact) { |
|
artifact = artifact.toString() |
|
var startRegex = /^-----BEGIN (.*)-----\n/; |
|
var match = startRegex.exec(artifact); |
|
var tag = match[1]; |
|
var endRegex = new RegExp("\n-----END " + tag + "-----(\n*)$"); |
|
var base64 = artifact.slice(match[0].length).replace(endRegex, "").replace(/\n/g, ""); |
|
return {tag: tag, base64: base64}; |
|
}; |
|
|
|
// http://stackoverflow.com/a/7033705 |
|
var wrap = function wrap(str, l) { |
|
var chunks = []; |
|
while (str) { |
|
if (str.length < l) { |
|
chunks.push(str); |
|
break; |
|
} |
|
else { |
|
chunks.push(str.substr(0, l)); |
|
str = str.substr(l); |
|
} |
|
} |
|
return chunks.join("\n"); |
|
} |
|
|
|
exports.assemble = function assemble(info) { |
|
var tag = info.tag; |
|
var base64 = info.base64; |
|
var startLine = "-----BEGIN " + tag + "-----"; |
|
var endLine = "-----END " + tag + "-----"; |
|
return startLine + "\n" + wrap(base64, 64) + "\n" + endLine + "\n"; |
|
} |
|
},{}],241:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js |
|
var parseKeys = require('parse-asn1'); |
|
var bn = require('bn.js'); |
|
var elliptic = require('elliptic'); |
|
var crt = require("browserify-rsa"); |
|
module.exports = sign; |
|
function sign(hash, key, hashType, crypto) { |
|
var priv = parseKeys(key, crypto); |
|
if (priv.curve) { |
|
return ecSign(hash, priv, crypto); |
|
} else if (priv.type === 'dsa') { |
|
return dsaSign(hash, priv, hashType, crypto); |
|
} |
|
var len = priv.modulus.byteLength(); |
|
var pad = [ 0, 1 ]; |
|
while (hash.length + pad.length + 1 < len) { |
|
pad.push(0xff); |
|
} |
|
pad.push(0x00); |
|
var i = -1; |
|
while (++i < hash.length) { |
|
pad.push(hash[i]); |
|
} |
|
|
|
var out = crt(pad, priv, crypto); |
|
return out; |
|
} |
|
function ecSign(hash, priv, crypto) { |
|
elliptic.rand = crypto.randomBytes; |
|
var curve; |
|
if (priv.curve.join('.') === '1.3.132.0.10') { |
|
curve = new elliptic.ec('secp256k1'); |
|
} |
|
var key = curve.genKeyPair(); |
|
key._importPrivate(priv.privateKey); |
|
var out = key.sign(hash); |
|
return new Buffer(out.toDER()); |
|
} |
|
function dsaSign(hash, priv, algo, crypto) { |
|
var x = priv.params.priv_key; |
|
var p = priv.params.p; |
|
var q = priv.params.q; |
|
var montq = bn.mont(q); |
|
var g = priv.params.g; |
|
var r = new bn(0); |
|
var k; |
|
var H = bits2int(hash, q).mod(q); |
|
var s = false; |
|
var kv = getKay(x, q, hash, algo, crypto); |
|
while (s === false) { |
|
k = makeKey(q, kv, algo, crypto); |
|
r = makeR(g, k, p, q); |
|
s = k.invm(q).imul(H.add(x.mul(r))).mod(q); |
|
if (!s.cmpn(0)) { |
|
s = false; |
|
r = new bn(0); |
|
} |
|
} |
|
return toDER(r,s); |
|
} |
|
function toDER(r, s) { |
|
r = r.toArray(); |
|
s = s.toArray(); |
|
|
|
// Pad values |
|
if (r[0] & 0x80) |
|
r = [ 0 ].concat(r); |
|
// Pad values |
|
if (s[0] & 0x80) |
|
s = [0].concat(s); |
|
|
|
var total = r.length + s.length + 4; |
|
var res = [ 0x30, total, 0x02, r.length ]; |
|
res = res.concat(r, [ 0x02, s.length ], s); |
|
return new Buffer(res); |
|
} |
|
module.exports.getKay = getKay; |
|
function getKay(x, q, hash, algo, crypto) { |
|
x = new Buffer(x.toArray()); |
|
if (x.length < q.byteLength()) { |
|
var zeros = new Buffer(q.byteLength() - x.length); |
|
zeros.fill(0); |
|
x = Buffer.concat([zeros, x]); |
|
} |
|
var hlen = hash.length; |
|
var hbits = bits2octets(hash, q); |
|
var v = new Buffer(hlen); |
|
v.fill(1); |
|
var k = new Buffer(hlen); |
|
k.fill(0); |
|
k = crypto.createHmac(algo, k) |
|
.update(v) |
|
.update(new Buffer([0])) |
|
.update(x) |
|
.update(hbits) |
|
.digest(); |
|
v = crypto.createHmac(algo, k) |
|
.update(v) |
|
.digest(); |
|
k = crypto.createHmac(algo, k) |
|
.update(v) |
|
.update(new Buffer([1])) |
|
.update(x) |
|
.update(hbits) |
|
.digest(); |
|
v = crypto.createHmac(algo, k) |
|
.update(v) |
|
.digest(); |
|
return { |
|
k:k, |
|
v:v |
|
}; |
|
} |
|
function bits2int(obits, q) { |
|
bits = new bn(obits); |
|
var shift = obits.length * 8 - q.bitLength(); |
|
if (shift > 0) { |
|
bits.ishrn(shift); |
|
} |
|
return bits; |
|
} |
|
function bits2octets (bits, q) { |
|
bits = bits2int(bits, q); |
|
bits = bits.mod(q); |
|
var out = new Buffer(bits.toArray()); |
|
if (out.length < q.byteLength()) { |
|
var zeros = new Buffer(q.byteLength() - out.length); |
|
zeros.fill(0); |
|
out = Buffer.concat([zeros, out]); |
|
} |
|
return out; |
|
} |
|
module.exports.makeKey = makeKey; |
|
function makeKey(q, kv, algo, crypto) { |
|
var t; |
|
var k; |
|
while (true) { |
|
t = new Buffer(''); |
|
while (t.length * 8 < q.bitLength()) { |
|
kv.v = crypto.createHmac(algo, kv.k) |
|
.update(kv.v) |
|
.digest(); |
|
t = Buffer.concat([t, kv.v]); |
|
} |
|
k = bits2int(t, q); |
|
kv.k = crypto.createHmac(algo, kv.k) |
|
.update(kv.v) |
|
.update(new Buffer([0])) |
|
.digest(); |
|
kv.v = crypto.createHmac(algo, kv.k) |
|
.update(kv.v) |
|
.digest(); |
|
if (k.cmp(q) === -1) { |
|
return k; |
|
} |
|
} |
|
} |
|
function makeR(g, k, p, q) { |
|
return g.toRed(bn.mont(p)).redPow(k).fromRed().mod(q); |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"bn.js":199,"browserify-rsa":200,"buffer":172,"elliptic":201,"parse-asn1":225}],242:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js |
|
var parseKeys = require('parse-asn1'); |
|
var elliptic = require('elliptic'); |
|
var bn = require('bn.js'); |
|
module.exports = verify; |
|
function verify(sig, hash, key) { |
|
var pub = parseKeys(key); |
|
if (pub.type === 'ec') { |
|
return ecVerify(sig, hash, pub); |
|
} else if (pub.type === 'dsa') { |
|
return dsaVerify(sig, hash, pub); |
|
} |
|
var len = pub.modulus.byteLength(); |
|
var pad = [ 0, 1 ]; |
|
while (hash.length + pad.length + 1 < len) { |
|
pad.push(0xff); |
|
} |
|
pad.push(0x00); |
|
var i = -1; |
|
while (++i < hash.length) { |
|
pad.push(hash[i]); |
|
} |
|
pad = hash; |
|
var red = bn.mont(pub.modulus); |
|
sig = new bn(sig).toRed(red); |
|
|
|
sig = sig.redPow(new bn(pub.publicExponent)); |
|
|
|
sig = new Buffer(sig.fromRed().toArray()); |
|
sig = sig.slice(sig.length - hash.length); |
|
var out = 0; |
|
len = sig.length; |
|
i = -1; |
|
while (++i < len) { |
|
out += (sig[i] ^ hash[i]); |
|
} |
|
return !out; |
|
} |
|
function ecVerify(sig, hash, pub) { |
|
var curve; |
|
if (pub.data.algorithm.curve.join('.') === '1.3.132.0.10') { |
|
curve = new elliptic.ec('secp256k1'); |
|
} |
|
var pubkey = pub.data.subjectPrivateKey.data; |
|
return curve.verify(hash.toString('hex'), sig.toString('hex'), pubkey.toString('hex')); |
|
} |
|
function dsaVerify(sig, hash, pub) { |
|
var p = pub.data.p; |
|
var q = pub.data.q; |
|
var g = pub.data.g; |
|
var y = pub.data.pub_key; |
|
var unpacked = parseKeys.signature.decode(sig, 'der'); |
|
var s = unpacked.s; |
|
var r = unpacked.r; |
|
checkValue(s, q); |
|
checkValue(r, q); |
|
var montq = bn.mont(q); |
|
var montp = bn.mont(p); |
|
var w = s.invm(q); |
|
var v = g.toRed(montp) |
|
.redPow(new bn(hash).mul(w).mod(q)) |
|
.fromRed() |
|
.mul( |
|
y.toRed(montp) |
|
.redPow(r.mul(w).mod(q)) |
|
.fromRed() |
|
).mod(p).mod(q); |
|
return !v.cmp(r); |
|
} |
|
function checkValue(b, q) { |
|
if (b.cmpn(0) <= 0) { |
|
throw new Error('invalid sig'); |
|
} |
|
if (b.cmp(q) >= q) { |
|
throw new Error('invalid sig'); |
|
} |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"bn.js":199,"buffer":172,"elliptic":201,"parse-asn1":225}],243:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var elliptic = require('elliptic'); |
|
var BN = require('bn.js'); |
|
|
|
module.exports = function createECDH(curve) { |
|
return new ECDH(curve); |
|
}; |
|
|
|
var aliases = { |
|
secp256k1: { |
|
name: 'secp256k1', |
|
byteLength: 32 |
|
}, |
|
secp224r1: { |
|
name: 'p224', |
|
byteLength: 28 |
|
}, |
|
prime256v1: { |
|
name: 'p256', |
|
byteLength: 32 |
|
}, |
|
prime192v1: { |
|
name: 'p192', |
|
byteLength: 24 |
|
}, |
|
ed25519: { |
|
name: 'ed25519', |
|
byteLength: 32 |
|
} |
|
}; |
|
|
|
aliases.p224 = aliases.secp224r1; |
|
aliases.p256 = aliases.secp256r1 = aliases.prime256v1; |
|
aliases.p192 = aliases.secp192r1 = aliases.prime192v1; |
|
|
|
function ECDH(curve) { |
|
this.curveType = aliases[curve]; |
|
if (!this.curveType ) { |
|
this.curveType = { |
|
name: curve |
|
}; |
|
} |
|
this.curve = new elliptic.ec(this.curveType.name); |
|
this.keys = void 0; |
|
} |
|
|
|
ECDH.prototype.generateKeys = function (enc, format) { |
|
this.keys = this.curve.genKeyPair(); |
|
return this.getPublicKey(enc, format); |
|
}; |
|
|
|
ECDH.prototype.computeSecret = function (other, inenc, enc) { |
|
inenc = inenc || 'utf8'; |
|
if (!Buffer.isBuffer(other)) { |
|
other = new Buffer(other, inenc); |
|
} |
|
other = new BN(other); |
|
other = other.toString(16); |
|
var otherPub = this.curve.keyPair(other, 'hex').getPublic(); |
|
var out = otherPub.mul(this.keys.getPrivate()).getX(); |
|
return formatReturnValue(out, enc, this.curveType.byteLength); |
|
}; |
|
|
|
ECDH.prototype.getPublicKey = function (enc, format) { |
|
var key = this.keys.getPublic(format === 'compressed', true); |
|
if (format === 'hybrid') { |
|
if (key[key.length - 1] % 2) { |
|
key[0] = 7; |
|
} else { |
|
key [0] = 6; |
|
} |
|
} |
|
return formatReturnValue(key, enc); |
|
}; |
|
|
|
ECDH.prototype.getPrivateKey = function (enc) { |
|
return formatReturnValue(this.keys.getPrivate(), enc); |
|
}; |
|
|
|
ECDH.prototype.setPublicKey = function (pub, enc) { |
|
enc = enc || 'utf8'; |
|
if (!Buffer.isBuffer(pub)) { |
|
pub = new Buffer(pub, enc); |
|
} |
|
var pkey = new BN(pub); |
|
pkey = pkey.toArray(); |
|
this.keys._importPublicHex(pkey); |
|
return this; |
|
}; |
|
|
|
ECDH.prototype.setPrivateKey = function (priv, enc) { |
|
enc = enc || 'utf8'; |
|
if (!Buffer.isBuffer(priv)) { |
|
priv = new Buffer(priv, enc); |
|
} |
|
var _priv = new BN(priv); |
|
_priv = _priv.toString(16); |
|
this.keys._importPrivate(_priv); |
|
return this; |
|
}; |
|
|
|
function formatReturnValue(bn, enc, len) { |
|
if (!Array.isArray(bn)) { |
|
bn = bn.toArray(); |
|
} |
|
var buf = new Buffer(bn); |
|
if (len && buf.length < len) { |
|
var zeros = new Buffer(len - buf.length); |
|
zeros.fill(0); |
|
buf = Buffer.concat([zeros, buf]); |
|
} |
|
if (!enc) { |
|
return buf; |
|
} else { |
|
return buf.toString(enc); |
|
} |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"bn.js":245,"buffer":172,"elliptic":246}],244:[function(require,module,exports){ |
|
var createECDH = require('crypto').createECDH; |
|
|
|
module.exports = createECDH || require('./browser'); |
|
},{"./browser":243,"crypto":178}],245:[function(require,module,exports){ |
|
arguments[4][199][0].apply(exports,arguments) |
|
},{"dup":199}],246:[function(require,module,exports){ |
|
arguments[4][201][0].apply(exports,arguments) |
|
},{"../package.json":265,"./elliptic/curve":249,"./elliptic/curves":252,"./elliptic/ec":253,"./elliptic/hmac-drbg":256,"./elliptic/utils":257,"brorand":258,"dup":201}],247:[function(require,module,exports){ |
|
arguments[4][202][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"bn.js":245,"dup":202}],248:[function(require,module,exports){ |
|
arguments[4][203][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"../curve":249,"bn.js":245,"dup":203,"inherits":320}],249:[function(require,module,exports){ |
|
arguments[4][204][0].apply(exports,arguments) |
|
},{"./base":247,"./edwards":248,"./mont":250,"./short":251,"dup":204}],250:[function(require,module,exports){ |
|
arguments[4][205][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"../curve":249,"bn.js":245,"dup":205,"inherits":320}],251:[function(require,module,exports){ |
|
arguments[4][206][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"../curve":249,"bn.js":245,"dup":206,"inherits":320}],252:[function(require,module,exports){ |
|
arguments[4][207][0].apply(exports,arguments) |
|
},{"../elliptic":246,"bn.js":245,"dup":207,"hash.js":259}],253:[function(require,module,exports){ |
|
arguments[4][208][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"./key":254,"./signature":255,"bn.js":245,"dup":208}],254:[function(require,module,exports){ |
|
arguments[4][209][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"bn.js":245,"dup":209}],255:[function(require,module,exports){ |
|
arguments[4][210][0].apply(exports,arguments) |
|
},{"../../elliptic":246,"bn.js":245,"dup":210}],256:[function(require,module,exports){ |
|
arguments[4][211][0].apply(exports,arguments) |
|
},{"../elliptic":246,"dup":211,"hash.js":259}],257:[function(require,module,exports){ |
|
arguments[4][212][0].apply(exports,arguments) |
|
},{"bn.js":245,"dup":212}],258:[function(require,module,exports){ |
|
arguments[4][213][0].apply(exports,arguments) |
|
},{"dup":213}],259:[function(require,module,exports){ |
|
arguments[4][214][0].apply(exports,arguments) |
|
},{"./hash/common":260,"./hash/hmac":261,"./hash/ripemd":262,"./hash/sha":263,"./hash/utils":264,"dup":214}],260:[function(require,module,exports){ |
|
arguments[4][215][0].apply(exports,arguments) |
|
},{"../hash":259,"dup":215}],261:[function(require,module,exports){ |
|
arguments[4][216][0].apply(exports,arguments) |
|
},{"../hash":259,"dup":216}],262:[function(require,module,exports){ |
|
arguments[4][217][0].apply(exports,arguments) |
|
},{"../hash":259,"dup":217}],263:[function(require,module,exports){ |
|
arguments[4][218][0].apply(exports,arguments) |
|
},{"../hash":259,"dup":218}],264:[function(require,module,exports){ |
|
arguments[4][219][0].apply(exports,arguments) |
|
},{"dup":219,"inherits":320}],265:[function(require,module,exports){ |
|
arguments[4][220][0].apply(exports,arguments) |
|
},{"dup":220}],266:[function(require,module,exports){ |
|
arguments[4][11][0].apply(exports,arguments) |
|
},{"./md5":268,"buffer":172,"dup":11,"inherits":320,"ripemd160":269,"sha.js":271,"stream":339}],267:[function(require,module,exports){ |
|
arguments[4][12][0].apply(exports,arguments) |
|
},{"buffer":172,"dup":12}],268:[function(require,module,exports){ |
|
arguments[4][13][0].apply(exports,arguments) |
|
},{"./helpers":267,"dup":13}],269:[function(require,module,exports){ |
|
arguments[4][15][0].apply(exports,arguments) |
|
},{"buffer":172,"dup":15}],270:[function(require,module,exports){ |
|
arguments[4][16][0].apply(exports,arguments) |
|
},{"buffer":172,"dup":16}],271:[function(require,module,exports){ |
|
arguments[4][17][0].apply(exports,arguments) |
|
},{"./sha":272,"./sha1":273,"./sha224":274,"./sha256":275,"./sha384":276,"./sha512":277,"dup":17}],272:[function(require,module,exports){ |
|
arguments[4][18][0].apply(exports,arguments) |
|
},{"./hash":270,"buffer":172,"dup":18,"inherits":320}],273:[function(require,module,exports){ |
|
arguments[4][19][0].apply(exports,arguments) |
|
},{"./hash":270,"buffer":172,"dup":19,"inherits":320}],274:[function(require,module,exports){ |
|
arguments[4][20][0].apply(exports,arguments) |
|
},{"./hash":270,"./sha256":275,"buffer":172,"dup":20,"inherits":320}],275:[function(require,module,exports){ |
|
arguments[4][21][0].apply(exports,arguments) |
|
},{"./hash":270,"buffer":172,"dup":21,"inherits":320}],276:[function(require,module,exports){ |
|
arguments[4][22][0].apply(exports,arguments) |
|
},{"./hash":270,"./sha512":277,"buffer":172,"dup":22,"inherits":320}],277:[function(require,module,exports){ |
|
arguments[4][23][0].apply(exports,arguments) |
|
},{"./hash":270,"buffer":172,"dup":23,"inherits":320}],278:[function(require,module,exports){ |
|
arguments[4][24][0].apply(exports,arguments) |
|
},{"buffer":172,"create-hash/browser":266,"dup":24,"inherits":320,"stream":339}],279:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var generatePrime = require('./lib/generatePrime'); |
|
var primes = require('./lib/primes'); |
|
|
|
var DH = require('./lib/dh'); |
|
|
|
function getDiffieHellman(mod) { |
|
var prime = new Buffer(primes[mod].prime, 'hex'); |
|
var gen = new Buffer(primes[mod].gen, 'hex'); |
|
|
|
return new DH(prime, gen); |
|
} |
|
|
|
function createDiffieHellman(prime, enc, generator, genc) { |
|
if (Buffer.isBuffer(enc) || (typeof enc === 'string' && ['hex', 'binary', 'base64'].indexOf(enc) === -1)) { |
|
genc = generator; |
|
generator = enc; |
|
enc = undefined; |
|
} |
|
|
|
enc = enc || 'binary'; |
|
genc = genc || 'binary'; |
|
generator = generator || new Buffer([2]); |
|
|
|
if (!Buffer.isBuffer(generator)) { |
|
generator = new Buffer(generator, genc); |
|
} |
|
|
|
if (typeof prime === 'number') { |
|
return new DH(generatePrime(prime, generator), generator, true); |
|
} |
|
|
|
if (!Buffer.isBuffer(prime)) { |
|
prime = new Buffer(prime, enc); |
|
} |
|
|
|
return new DH(prime, generator, true); |
|
} |
|
|
|
exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman; |
|
exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman; |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"./lib/dh":280,"./lib/generatePrime":281,"./lib/primes":282,"buffer":172}],280:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var BN = require('bn.js'); |
|
var MillerRabin = require('miller-rabin'); |
|
var millerRabin = new MillerRabin(); |
|
var TWENTYFOUR = new BN(24); |
|
var ELEVEN = new BN(11); |
|
var TEN = new BN(10); |
|
var THREE = new BN(3); |
|
var SEVEN = new BN(7); |
|
var primes = require('./generatePrime'); |
|
var randomBytes = require('randombytes'); |
|
module.exports = DH; |
|
|
|
function setPublicKey(pub, enc) { |
|
enc = enc || 'utf8'; |
|
if (!Buffer.isBuffer(pub)) { |
|
pub = new Buffer(pub, enc); |
|
} |
|
this._pub = new BN(pub); |
|
return this; |
|
} |
|
|
|
function setPrivateKey(priv, enc) { |
|
enc = enc || 'utf8'; |
|
if (!Buffer.isBuffer(priv)) { |
|
priv = new Buffer(priv, enc); |
|
} |
|
this._priv = new BN(priv); |
|
return this; |
|
} |
|
|
|
var primeCache = {}; |
|
function checkPrime(prime, generator) { |
|
var gen = generator.toString('hex'); |
|
var hex = [gen, prime.toString(16)].join('_'); |
|
if (hex in primeCache) { |
|
return primeCache[hex]; |
|
} |
|
var error = 0; |
|
|
|
if (prime.isEven() || |
|
!primes.simpleSieve || |
|
!primes.fermatTest(prime) || |
|
!millerRabin.test(prime)) { |
|
//not a prime so +1 |
|
error += 1; |
|
|
|
if (gen === '02' || gen === '05') { |
|
// we'd be able to check the generator |
|
// it would fail so +8 |
|
error += 8; |
|
} else { |
|
//we wouldn't be able to test the generator |
|
// so +4 |
|
error += 4; |
|
} |
|
primeCache[hex] = error; |
|
return error; |
|
} |
|
if (!millerRabin.test(prime.shrn(1))) { |
|
//not a safe prime |
|
error += 2; |
|
} |
|
var rem; |
|
switch (gen) { |
|
case '02': |
|
if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) { |
|
// unsuidable generator |
|
error += 8; |
|
} |
|
break; |
|
case '05': |
|
rem = prime.mod(TEN); |
|
if (rem.cmp(THREE) && rem.cmp(SEVEN)) { |
|
// prime mod 10 needs to equal 3 or 7 |
|
error += 8; |
|
} |
|
break; |
|
default: |
|
error += 4; |
|
} |
|
primeCache[hex] = error; |
|
return error; |
|
} |
|
|
|
function defineError (self, error) { |
|
try { |
|
Object.defineProperty(self, 'verifyError', { |
|
enumerable: true, |
|
value: error, |
|
writable: false |
|
}); |
|
} catch(e) { |
|
self.verifyError = error; |
|
} |
|
} |
|
function DH(prime, generator, malleable) { |
|
this.setGenerator(generator); |
|
this.__prime = new BN(prime); |
|
this._prime = BN.mont(this.__prime); |
|
this._primeLen = prime.length; |
|
this._pub = void 0; |
|
this._priv = void 0; |
|
|
|
if (malleable) { |
|
this.setPublicKey = setPublicKey; |
|
this.setPrivateKey = setPrivateKey; |
|
defineError(this, checkPrime(this.__prime, generator)); |
|
} else { |
|
defineError(this, 8); |
|
} |
|
} |
|
|
|
DH.prototype.generateKeys = function () { |
|
if (!this._priv) { |
|
this._priv = new BN(randomBytes(this._primeLen)); |
|
} |
|
this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed(); |
|
return this.getPublicKey(); |
|
}; |
|
|
|
DH.prototype.computeSecret = function (other) { |
|
other = new BN(other); |
|
other = other.toRed(this._prime); |
|
var secret = other.redPow(this._priv).fromRed(); |
|
var out = new Buffer(secret.toArray()); |
|
var prime = this.getPrime(); |
|
if (out.length < prime.length) { |
|
var front = new Buffer(prime.length - out.length); |
|
front.fill(0); |
|
out = Buffer.concat([front, out]); |
|
} |
|
return out; |
|
}; |
|
|
|
DH.prototype.getPublicKey = function getPublicKey(enc) { |
|
return formatReturnValue(this._pub, enc); |
|
}; |
|
|
|
DH.prototype.getPrivateKey = function getPrivateKey(enc) { |
|
return formatReturnValue(this._priv, enc); |
|
}; |
|
|
|
DH.prototype.getPrime = function (enc) { |
|
return formatReturnValue(this.__prime, enc); |
|
}; |
|
|
|
DH.prototype.getGenerator = function (enc) { |
|
return formatReturnValue(this._gen, enc); |
|
}; |
|
|
|
DH.prototype.setGenerator = function (gen, enc) { |
|
enc = enc || 'utf8'; |
|
if (!Buffer.isBuffer(gen)) { |
|
gen = new Buffer(gen, enc); |
|
} |
|
this._gen = new BN(gen); |
|
return this; |
|
}; |
|
|
|
function formatReturnValue(bn, enc) { |
|
var buf = new Buffer(bn.toArray()); |
|
if (!enc) { |
|
return buf; |
|
} else { |
|
return buf.toString(enc); |
|
} |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./generatePrime":281,"bn.js":283,"buffer":172,"miller-rabin":284,"randombytes":313}],281:[function(require,module,exports){ |
|
var randomBytes = require('randombytes'); |
|
module.exports = findPrime; |
|
findPrime.simpleSieve = simpleSieve; |
|
findPrime.fermatTest = fermatTest; |
|
var BN = require('bn.js'); |
|
var TWENTYFOUR = new BN(24); |
|
var MillerRabin = require('miller-rabin'); |
|
var millerRabin = new MillerRabin(); |
|
var ONE = new BN(1); |
|
var TWO = new BN(2); |
|
var FIVE = new BN(5); |
|
var SIXTEEN = new BN(16); |
|
var EIGHT = new BN(8); |
|
var TEN = new BN(10); |
|
var THREE = new BN(3); |
|
var SEVEN = new BN(7); |
|
var ELEVEN = new BN(11); |
|
var FOUR = new BN(4); |
|
var TWELVE = new BN(12); |
|
var primes = null; |
|
|
|
function _getPrimes() { |
|
if (primes !== null) |
|
return primes; |
|
|
|
var limit = 0x100000; |
|
var res = []; |
|
res[0] = 2; |
|
for (var i = 1, k = 3; k < limit; k += 2) { |
|
var sqrt = Math.ceil(Math.sqrt(k)); |
|
for (var j = 0; j < i && res[j] <= sqrt; j++) |
|
if (k % res[j] === 0) |
|
break; |
|
|
|
if (i !== j && res[j] <= sqrt) |
|
continue; |
|
|
|
res[i++] = k; |
|
} |
|
primes = res; |
|
return res; |
|
} |
|
|
|
function simpleSieve(p) { |
|
var primes = _getPrimes(); |
|
|
|
for (var i = 0; i < primes.length; i++) |
|
if (p.modn(primes[i]) === 0) { |
|
if (p.cmpn(primes[i]) === 0) { |
|
return true; |
|
} else { |
|
return false; |
|
} |
|
} |
|
|
|
return true; |
|
} |
|
|
|
function fermatTest(p) { |
|
var red = BN.mont(p); |
|
return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0; |
|
} |
|
|
|
function findPrime(bits, gen) { |
|
if (bits < 16) { |
|
// this is what openssl does |
|
if (gen === 2 || gen === 5) { |
|
return new BN([0x8c, 0x7b]); |
|
} else { |
|
return new BN([0x8c, 0x27]); |
|
} |
|
} |
|
gen = new BN(gen); |
|
var runs, comp; |
|
function generateRandom(bits) { |
|
runs = -1; |
|
var out = new BN(randomBytes(Math.ceil(bits / 8))); |
|
while (out.bitLength() > bits) { |
|
out.ishrn(1); |
|
} |
|
if (out.isEven()) { |
|
out.iadd(ONE); |
|
} |
|
if (!out.testn(1)) { |
|
out.iadd(TWO); |
|
} |
|
if (!gen.cmp(TWO)) { |
|
while (out.mod(TWENTYFOUR).cmp(ELEVEN)) { |
|
out.iadd(FOUR); |
|
} |
|
comp = { |
|
major: [TWENTYFOUR], |
|
minor: [TWELVE] |
|
}; |
|
} else if (!gen.cmp(FIVE)) { |
|
rem = out.mod(TEN); |
|
while (rem.cmp(THREE)) { |
|
out.iadd(FOUR); |
|
rem = out.mod(TEN); |
|
} |
|
comp = { |
|
major: [FOUR, SIXTEEN], |
|
minor: [TWO, EIGHT] |
|
}; |
|
} else { |
|
comp = { |
|
major: [FOUR], |
|
minor: [TWO] |
|
}; |
|
} |
|
return out; |
|
} |
|
var num = generateRandom(bits); |
|
|
|
var n2 = num.shrn(1); |
|
|
|
while (true) { |
|
while (num.bitLength() > bits) { |
|
num = generateRandom(bits); |
|
n2 = num.shrn(1); |
|
} |
|
runs++; |
|
if (simpleSieve(n2) && simpleSieve(num) && |
|
fermatTest(n2) && fermatTest(num) && |
|
millerRabin.test(n2) && millerRabin.test(num)) { |
|
return num; |
|
} |
|
num.iadd(comp.major[runs%comp.major.length]); |
|
n2.iadd(comp.minor[runs%comp.minor.length]); |
|
} |
|
|
|
} |
|
},{"bn.js":283,"miller-rabin":284,"randombytes":313}],282:[function(require,module,exports){ |
|
module.exports={ |
|
"modp1": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff" |
|
}, |
|
"modp2": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff" |
|
}, |
|
"modp5": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff" |
|
}, |
|
"modp14": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff" |
|
}, |
|
"modp15": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff" |
|
}, |
|
"modp16": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff" |
|
}, |
|
"modp17": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff" |
|
}, |
|
"modp18": { |
|
"gen": "02", |
|
"prime": "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff" |
|
} |
|
} |
|
},{}],283:[function(require,module,exports){ |
|
arguments[4][199][0].apply(exports,arguments) |
|
},{"dup":199}],284:[function(require,module,exports){ |
|
var bn = require('bn.js'); |
|
var brorand = require('brorand'); |
|
|
|
function MillerRabin(rand) { |
|
this.rand = rand || new brorand.Rand(); |
|
} |
|
module.exports = MillerRabin; |
|
|
|
MillerRabin.create = function create(rand) { |
|
return new MillerRabin(rand); |
|
}; |
|
|
|
MillerRabin.prototype._rand = function _rand(n) { |
|
var len = n.bitLength(); |
|
var buf = this.rand.generate(Math.ceil(len / 8)); |
|
|
|
// Set low bits |
|
buf[0] |= 3; |
|
|
|
// Mask high bits |
|
var mask = len & 0x7; |
|
if (mask !== 0) |
|
buf[buf.length - 1] >>= 7 - mask; |
|
|
|
return new bn(buf); |
|
} |
|
|
|
MillerRabin.prototype.test = function test(n, k, cb) { |
|
var len = n.bitLength(); |
|
var red = bn.mont(n); |
|
var rone = new bn(1).toRed(red); |
|
|
|
if (!k) |
|
k = Math.max(1, (len / 48) | 0); |
|
|
|
// Find d and s, (n - 1) = (2 ^ s) * d; |
|
var n1 = n.subn(1); |
|
var n2 = n1.subn(1); |
|
for (var s = 0; !n1.testn(s); s++) {} |
|
var d = n.shrn(s); |
|
|
|
var rn1 = n1.toRed(red); |
|
|
|
var prime = true; |
|
for (; k > 0; k--) { |
|
var a = this._rand(n2); |
|
if (cb) |
|
cb(a); |
|
|
|
var x = a.toRed(red).redPow(d); |
|
if (x.cmp(rone) === 0 || x.cmp(rn1) === 0) |
|
continue; |
|
|
|
for (var i = 1; i < s; i++) { |
|
x = x.redSqr(); |
|
|
|
if (x.cmp(rone) === 0) |
|
return false; |
|
if (x.cmp(rn1) === 0) |
|
break; |
|
} |
|
|
|
if (i === s) |
|
return false; |
|
} |
|
|
|
return prime; |
|
}; |
|
|
|
MillerRabin.prototype.getDivisor = function getDivisor(n, k) { |
|
var len = n.bitLength(); |
|
var red = bn.mont(n); |
|
var rone = new bn(1).toRed(red); |
|
|
|
if (!k) |
|
k = Math.max(1, (len / 48) | 0); |
|
|
|
// Find d and s, (n - 1) = (2 ^ s) * d; |
|
var n1 = n.subn(1); |
|
var n2 = n1.subn(1); |
|
for (var s = 0; !n1.testn(s); s++) {} |
|
var d = n.shrn(s); |
|
|
|
var rn1 = n1.toRed(red); |
|
|
|
var prime = true; |
|
for (; k > 0; k--) { |
|
var a = this._rand(n2); |
|
|
|
var g = n.gcd(a); |
|
if (g.cmpn(1) !== 0) |
|
return g; |
|
|
|
var x = a.toRed(red).redPow(d); |
|
if (x.cmp(rone) === 0 || x.cmp(rn1) === 0) |
|
continue; |
|
|
|
for (var i = 1; i < s; i++) { |
|
x = x.redSqr(); |
|
|
|
if (x.cmp(rone) === 0) |
|
return x.fromRed().subn(1).gcd(n); |
|
if (x.cmp(rn1) === 0) |
|
break; |
|
} |
|
|
|
if (i === s) { |
|
x = x.redSqr(); |
|
return x.fromRed().subn(1).gcd(n); |
|
} |
|
} |
|
|
|
return prime; |
|
}; |
|
|
|
},{"bn.js":283,"brorand":285}],285:[function(require,module,exports){ |
|
arguments[4][213][0].apply(exports,arguments) |
|
},{"dup":213}],286:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var createHmac = require('create-hmac') |
|
|
|
exports.pbkdf2 = pbkdf2 |
|
function pbkdf2 (password, salt, iterations, keylen, digest, callback) { |
|
if (typeof digest === 'function') { |
|
callback = digest |
|
digest = undefined |
|
} |
|
|
|
if (typeof callback !== 'function') { |
|
throw new Error('No callback provided to pbkdf2') |
|
} |
|
|
|
var result = pbkdf2Sync(password, salt, iterations, keylen, digest) |
|
setTimeout(function () { |
|
callback(undefined, result) |
|
}) |
|
} |
|
|
|
exports.pbkdf2Sync = pbkdf2Sync |
|
function pbkdf2Sync (password, salt, iterations, keylen, digest) { |
|
if (typeof iterations !== 'number') |
|
throw new TypeError('Iterations not a number') |
|
|
|
if (iterations < 0) |
|
throw new TypeError('Bad iterations') |
|
|
|
if (typeof keylen !== 'number') |
|
throw new TypeError('Key length not a number') |
|
|
|
if (keylen < 0) |
|
throw new TypeError('Bad key length') |
|
|
|
digest = digest || 'sha1' |
|
|
|
if (!Buffer.isBuffer(password)) password = new Buffer(password) |
|
if (!Buffer.isBuffer(salt)) salt = new Buffer(salt) |
|
|
|
var hLen |
|
var l = 1 |
|
var DK = new Buffer(keylen) |
|
var block1 = new Buffer(salt.length + 4) |
|
salt.copy(block1, 0, 0, salt.length) |
|
|
|
var r |
|
var T |
|
|
|
for (var i = 1; i <= l; i++) { |
|
block1.writeUInt32BE(i, salt.length) |
|
var U = createHmac(digest, password).update(block1).digest() |
|
|
|
if (!hLen) { |
|
hLen = U.length |
|
T = new Buffer(hLen) |
|
l = Math.ceil(keylen / hLen) |
|
r = keylen - (l - 1) * hLen |
|
|
|
if (keylen > (Math.pow(2, 32) - 1) * hLen) |
|
throw new TypeError('keylen exceeds maximum length') |
|
} |
|
|
|
U.copy(T, 0, 0, hLen) |
|
|
|
for (var j = 1; j < iterations; j++) { |
|
U = createHmac(digest, password).update(U).digest() |
|
|
|
for (var k = 0; k < hLen; k++) { |
|
T[k] ^= U[k] |
|
} |
|
} |
|
|
|
var destPos = (i - 1) * hLen |
|
var len = (i === l ? r : hLen) |
|
T.copy(DK, destPos, 0, len) |
|
} |
|
|
|
return DK |
|
} |
|
|
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"create-hmac":278}],287:[function(require,module,exports){ |
|
exports.publicEncrypt = require('./publicEncrypt'); |
|
exports.privateDecrypt = require('./privateDecrypt'); |
|
|
|
exports.privateEncrypt = function privateEncrypt(key, buf) { |
|
return exports.publicEncrypt(key, buf, true); |
|
}; |
|
|
|
exports.publicDecrypt = function publicDecrypt(key, buf) { |
|
return exports.privateDecrypt(key, buf, true); |
|
}; |
|
},{"./privateDecrypt":309,"./publicEncrypt":310}],288:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var createHash = require('create-hash'); |
|
module.exports = function (seed, len) { |
|
var t = new Buffer(''); |
|
var i = 0, c; |
|
while (t.length < len) { |
|
c = i2ops(i++); |
|
t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()]); |
|
} |
|
return t.slice(0, len); |
|
}; |
|
|
|
function i2ops(c) { |
|
var out = new Buffer(4); |
|
out.writeUInt32BE(c,0); |
|
return out; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"create-hash":266}],289:[function(require,module,exports){ |
|
arguments[4][199][0].apply(exports,arguments) |
|
},{"dup":199}],290:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var bn = require('bn.js'); |
|
var randomBytes = require('randombytes'); |
|
module.exports = crt; |
|
function blind(priv) { |
|
var r = getr(priv); |
|
var blinder = r.toRed(bn.mont(priv.modulus)) |
|
.redPow(new bn(priv.publicExponent)).fromRed(); |
|
return { |
|
blinder: blinder, |
|
unblinder:r.invm(priv.modulus) |
|
}; |
|
} |
|
function crt(msg, priv) { |
|
var blinds = blind(priv); |
|
var len = priv.modulus.byteLength(); |
|
var mod = bn.mont(priv.modulus); |
|
var blinded = new bn(msg).mul(blinds.blinder).mod(priv.modulus); |
|
var c1 = blinded.toRed(bn.mont(priv.prime1)); |
|
var c2 = blinded.toRed(bn.mont(priv.prime2)); |
|
var qinv = priv.coefficient; |
|
var p = priv.prime1; |
|
var q = priv.prime2; |
|
var m1 = c1.redPow(priv.exponent1); |
|
var m2 = c2.redPow(priv.exponent2); |
|
m1 = m1.fromRed(); |
|
m2 = m2.fromRed(); |
|
var h = m1.isub(m2).imul(qinv).mod(p); |
|
h.imul(q); |
|
m2.iadd(h); |
|
var out = new Buffer(m2.imul(blinds.unblinder).mod(priv.modulus).toArray()); |
|
if (out.length < len) { |
|
var prefix = new Buffer(len - out.length); |
|
prefix.fill(0); |
|
out = Buffer.concat([prefix, out], len); |
|
} |
|
return out; |
|
} |
|
crt.getr = getr; |
|
function getr(priv) { |
|
var len = priv.modulus.byteLength(); |
|
var r = new bn(randomBytes(len)); |
|
while (r.cmp(priv.modulus) >= 0 || !r.mod(priv.prime1) || !r.mod(priv.prime2)) { |
|
r = new bn(randomBytes(len)); |
|
} |
|
return r; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"bn.js":289,"buffer":172,"randombytes":313}],291:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var createHash = require('create-hash'); |
|
module.exports = function evp(password, salt, keyLen) { |
|
keyLen = keyLen/8; |
|
var ki = 0; |
|
var ii = 0; |
|
var key = new Buffer(keyLen); |
|
var addmd = 0; |
|
var md, md_buf; |
|
var i; |
|
while (true) { |
|
md = createHash('md5'); |
|
if(addmd++ > 0) { |
|
md.update(md_buf); |
|
} |
|
md.update(password); |
|
md.update(salt); |
|
md_buf = md.digest(); |
|
i = 0; |
|
if(keyLen > 0) { |
|
while(true) { |
|
if(keyLen === 0) { |
|
break; |
|
} |
|
if(i === md_buf.length) { |
|
break; |
|
} |
|
key[ki++] = md_buf[i++]; |
|
keyLen--; |
|
} |
|
} |
|
if(keyLen === 0) { |
|
break; |
|
} |
|
} |
|
for(i=0;i<md_buf.length;i++) { |
|
md_buf[i] = 0; |
|
} |
|
return key; |
|
}; |
|
}).call(this,require("buffer").Buffer) |
|
},{"buffer":172,"create-hash":266}],292:[function(require,module,exports){ |
|
arguments[4][222][0].apply(exports,arguments) |
|
},{"dup":222}],293:[function(require,module,exports){ |
|
// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js |
|
// Fedor, you are amazing. |
|
|
|
var asn1 = require('asn1.js'); |
|
|
|
var RSAPrivateKey = asn1.define('RSAPrivateKey', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('modulus').int(), |
|
this.key('publicExponent').int(), |
|
this.key('privateExponent').int(), |
|
this.key('prime1').int(), |
|
this.key('prime2').int(), |
|
this.key('exponent1').int(), |
|
this.key('exponent2').int(), |
|
this.key('coefficient').int() |
|
); |
|
}); |
|
exports.RSAPrivateKey = RSAPrivateKey; |
|
|
|
var RSAPublicKey = asn1.define('RSAPublicKey', function() { |
|
this.seq().obj( |
|
this.key('modulus').int(), |
|
this.key('publicExponent').int() |
|
); |
|
}); |
|
exports.RSAPublicKey = RSAPublicKey; |
|
|
|
var PublicKey = asn1.define('SubjectPublicKeyInfo', function() { |
|
this.seq().obj( |
|
this.key('algorithm').use(AlgorithmIdentifier), |
|
this.key('subjectPublicKey').bitstr() |
|
); |
|
}); |
|
exports.PublicKey = PublicKey; |
|
|
|
var AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function() { |
|
this.seq().obj( |
|
this.key('algorithm').objid(), |
|
this.key('none').null_().optional(), |
|
this.key('curve').objid().optional(), |
|
this.key('params').seq().obj( |
|
this.key('p').int(), |
|
this.key('q').int(), |
|
this.key('g').int() |
|
).optional() |
|
); |
|
}); |
|
|
|
var PrivateKeyInfo = asn1.define('PrivateKeyInfo', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('algorithm').use(AlgorithmIdentifier), |
|
this.key('subjectPrivateKey').octstr() |
|
); |
|
}); |
|
exports.PrivateKey = PrivateKeyInfo; |
|
var EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function() { |
|
this.seq().obj( |
|
this.key('algorithm').seq().obj( |
|
this.key('id').objid(), |
|
this.key('decrypt').seq().obj( |
|
this.key('kde').seq().obj( |
|
this.key('id').objid(), |
|
this.key('kdeparams').seq().obj( |
|
this.key('salt').octstr(), |
|
this.key('iters').int() |
|
) |
|
), |
|
this.key('cipher').seq().obj( |
|
this.key('algo').objid(), |
|
this.key('iv').octstr() |
|
) |
|
) |
|
), |
|
this.key('subjectPrivateKey').octstr() |
|
); |
|
}); |
|
|
|
exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo; |
|
|
|
var DSAPrivateKey = asn1.define('DSAPrivateKey', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('p').int(), |
|
this.key('q').int(), |
|
this.key('g').int(), |
|
this.key('pub_key').int(), |
|
this.key('priv_key').int() |
|
); |
|
}); |
|
exports.DSAPrivateKey = DSAPrivateKey; |
|
|
|
exports.DSAparam = asn1.define('DSAparam', function () { |
|
this.int(); |
|
}); |
|
var ECPrivateKey = asn1.define('ECPrivateKey', function() { |
|
this.seq().obj( |
|
this.key('version').int(), |
|
this.key('privateKey').octstr(), |
|
this.key('parameters').optional().explicit(0).use(ECParameters), |
|
this.key('publicKey').optional().explicit(1).bitstr() |
|
); |
|
}); |
|
exports.ECPrivateKey = ECPrivateKey; |
|
var ECParameters = asn1.define('ECParameters', function() { |
|
this.choice({ |
|
namedCurve: this.objid() |
|
}); |
|
}); |
|
|
|
exports.signature = asn1.define('signature', function() { |
|
this.seq().obj( |
|
this.key('r').int(), |
|
this.key('s').int() |
|
); |
|
}); |
|
|
|
},{"asn1.js":296}],294:[function(require,module,exports){ |
|
(function (Buffer){ |
|
// adapted from https://github.com/apatil/pemstrip |
|
var findProc = /Proc-Type: 4,ENCRYPTED\n\r?DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)\n\r?\n\r?([0-9A-z\n\r\+\/\=]+)\n\r?/m; |
|
var startRegex =/^-----BEGIN (.*) KEY-----\n/m; |
|
var fullRegex = /^-----BEGIN (.*) KEY-----\n\r?([0-9A-z\n\r\+\/\=]+)\n\r?-----END \1 KEY-----$/m; |
|
var evp = require('./EVP_BytesToKey'); |
|
var ciphers = require('browserify-aes'); |
|
module.exports = function (okey, password) { |
|
var key = okey.toString(); |
|
var match = key.match(findProc); |
|
var decrypted; |
|
if (!match) { |
|
var match2 = key.match(fullRegex); |
|
decrypted = new Buffer(match2[2].replace(/\n\r?/g, ''), 'base64'); |
|
} else { |
|
var suite = 'aes' + match[1]; |
|
var iv = new Buffer(match[2], 'hex'); |
|
var cipherText = new Buffer(match[3].replace(/\n\r?/g, ''), 'base64'); |
|
var cipherKey = evp(password, iv.slice(0,8), parseInt(match[1])); |
|
var out = []; |
|
var cipher = ciphers.createDecipheriv(suite, cipherKey, iv); |
|
out.push(cipher.update(cipherText)); |
|
out.push(cipher.final()); |
|
decrypted = Buffer.concat(out); |
|
} |
|
var tag = key.match(startRegex)[1] + ' KEY'; |
|
return { |
|
tag: tag, |
|
data: decrypted |
|
}; |
|
}; |
|
// http://stackoverflow.com/a/7033705 |
|
function wrap(str) { |
|
var chunks = []; |
|
while (str) { |
|
if (str.length < 64) { |
|
chunks.push(str); |
|
break; |
|
} |
|
else { |
|
chunks.push(str.slice(0, 64)); |
|
str = str.slice(64); |
|
} |
|
} |
|
return chunks.join("\n"); |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./EVP_BytesToKey":291,"browserify-aes":182,"buffer":172}],295:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var asn1 = require('./asn1'); |
|
var aesid = require('./aesid.json'); |
|
var fixProc = require('./fixProc'); |
|
var ciphers = require('browserify-aes'); |
|
var compat = require('pbkdf2-compat'); |
|
module.exports = parseKeys; |
|
|
|
function parseKeys(buffer) { |
|
var password; |
|
if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) { |
|
password = buffer.passphrase; |
|
buffer = buffer.key; |
|
} |
|
if (typeof buffer === 'string') { |
|
buffer = new Buffer(buffer); |
|
} |
|
|
|
var stripped = fixProc(buffer, password); |
|
|
|
var type = stripped.tag; |
|
var data = stripped.data; |
|
var subtype,ndata; |
|
switch (type) { |
|
case 'PUBLIC KEY': |
|
ndata = asn1.PublicKey.decode(data, 'der'); |
|
subtype = ndata.algorithm.algorithm.join('.'); |
|
switch(subtype) { |
|
case '1.2.840.113549.1.1.1': |
|
return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der'); |
|
case '1.2.840.10045.2.1': |
|
ndata.subjectPrivateKey = ndata.subjectPublicKey; |
|
return { |
|
type: 'ec', |
|
data: ndata |
|
}; |
|
case '1.2.840.10040.4.1': |
|
ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der'); |
|
return { |
|
type: 'dsa', |
|
data: ndata.algorithm.params |
|
}; |
|
default: throw new Error('unknown key id ' + subtype); |
|
} |
|
throw new Error('unknown key type ' + type); |
|
case 'ENCRYPTED PRIVATE KEY': |
|
data = asn1.EncryptedPrivateKey.decode(data, 'der'); |
|
data = decrypt(data, password); |
|
//falling through |
|
case 'PRIVATE KEY': |
|
ndata = asn1.PrivateKey.decode(data, 'der'); |
|
subtype = ndata.algorithm.algorithm.join('.'); |
|
switch(subtype) { |
|
case '1.2.840.113549.1.1.1': |
|
return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der'); |
|
case '1.2.840.10045.2.1': |
|
return { |
|
curve: ndata.algorithm.curve, |
|
privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey |
|
}; |
|
case '1.2.840.10040.4.1': |
|
ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der'); |
|
return { |
|
type: 'dsa', |
|
params: ndata.algorithm.params |
|
}; |
|
default: throw new Error('unknown key id ' + subtype); |
|
} |
|
throw new Error('unknown key type ' + type); |
|
case 'RSA PUBLIC KEY': |
|
return asn1.RSAPublicKey.decode(data, 'der'); |
|
case 'RSA PRIVATE KEY': |
|
return asn1.RSAPrivateKey.decode(data, 'der'); |
|
case 'DSA PRIVATE KEY': |
|
return { |
|
type: 'dsa', |
|
params: asn1.DSAPrivateKey.decode(data, 'der') |
|
}; |
|
case 'EC PRIVATE KEY': |
|
data = asn1.ECPrivateKey.decode(data, 'der'); |
|
return { |
|
curve: data.parameters.value, |
|
privateKey: data.privateKey |
|
}; |
|
default: throw new Error('unknown key type ' + type); |
|
} |
|
} |
|
parseKeys.signature = asn1.signature; |
|
function decrypt(data, password) { |
|
var salt = data.algorithm.decrypt.kde.kdeparams.salt; |
|
var iters = data.algorithm.decrypt.kde.kdeparams.iters; |
|
var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]; |
|
var iv = data.algorithm.decrypt.cipher.iv; |
|
var cipherText = data.subjectPrivateKey; |
|
var keylen = parseInt(algo.split('-')[1], 10)/8; |
|
var key = compat.pbkdf2Sync(password, salt, iters, keylen); |
|
var cipher = ciphers.createDecipheriv(algo, key, iv); |
|
var out = []; |
|
out.push(cipher.update(cipherText)); |
|
out.push(cipher.final()); |
|
return Buffer.concat(out); |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./aesid.json":292,"./asn1":293,"./fixProc":294,"browserify-aes":182,"buffer":172,"pbkdf2-compat":286}],296:[function(require,module,exports){ |
|
arguments[4][227][0].apply(exports,arguments) |
|
},{"./asn1/api":297,"./asn1/base":299,"./asn1/constants":303,"./asn1/decoders":305,"./asn1/encoders":307,"bn.js":289,"dup":227}],297:[function(require,module,exports){ |
|
arguments[4][228][0].apply(exports,arguments) |
|
},{"../asn1":296,"dup":228,"inherits":320,"vm":344}],298:[function(require,module,exports){ |
|
arguments[4][229][0].apply(exports,arguments) |
|
},{"../base":299,"buffer":172,"dup":229,"inherits":320}],299:[function(require,module,exports){ |
|
arguments[4][230][0].apply(exports,arguments) |
|
},{"./buffer":298,"./node":300,"./reporter":301,"dup":230}],300:[function(require,module,exports){ |
|
arguments[4][231][0].apply(exports,arguments) |
|
},{"../base":299,"dup":231,"minimalistic-assert":308}],301:[function(require,module,exports){ |
|
arguments[4][232][0].apply(exports,arguments) |
|
},{"dup":232,"inherits":320}],302:[function(require,module,exports){ |
|
arguments[4][233][0].apply(exports,arguments) |
|
},{"../constants":303,"dup":233}],303:[function(require,module,exports){ |
|
arguments[4][234][0].apply(exports,arguments) |
|
},{"./der":302,"dup":234}],304:[function(require,module,exports){ |
|
arguments[4][235][0].apply(exports,arguments) |
|
},{"../../asn1":296,"dup":235,"inherits":320}],305:[function(require,module,exports){ |
|
arguments[4][236][0].apply(exports,arguments) |
|
},{"./der":304,"dup":236}],306:[function(require,module,exports){ |
|
arguments[4][237][0].apply(exports,arguments) |
|
},{"../../asn1":296,"buffer":172,"dup":237,"inherits":320}],307:[function(require,module,exports){ |
|
arguments[4][238][0].apply(exports,arguments) |
|
},{"./der":306,"dup":238}],308:[function(require,module,exports){ |
|
arguments[4][239][0].apply(exports,arguments) |
|
},{"dup":239}],309:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var parseKeys = require('parse-asn1'); |
|
var mgf = require('./mgf'); |
|
var xor = require('./xor'); |
|
var bn = require('bn.js'); |
|
var crt = require('browserify-rsa'); |
|
var createHash = require('create-hash'); |
|
var withPublic = require('./withPublic'); |
|
module.exports = function privateDecrypt(private_key, enc, reverse) { |
|
var padding; |
|
if (private_key.padding) { |
|
padding = private_key.padding; |
|
} else if (reverse) { |
|
padding = 1; |
|
} else { |
|
padding = 4; |
|
} |
|
|
|
var key = parseKeys(private_key); |
|
var k = key.modulus.byteLength(); |
|
if (enc.length > k || new bn(enc).cmp(key.modulus) >= 0) { |
|
throw new Error('decryption error'); |
|
} |
|
var msg; |
|
if (reverse) { |
|
msg = withPublic(new bn(enc), key); |
|
} else { |
|
msg = crt(enc, key); |
|
} |
|
var zBuffer = new Buffer(k - msg.length); |
|
zBuffer.fill(0); |
|
msg = Buffer.concat([zBuffer, msg], k); |
|
if (padding === 4) { |
|
return oaep(key, msg); |
|
} else if (padding === 1) { |
|
return pkcs1(key, msg, reverse); |
|
} else if (padding === 3) { |
|
return msg; |
|
} else { |
|
throw new Error('unknown padding'); |
|
} |
|
}; |
|
|
|
function oaep(key, msg){ |
|
var n = key.modulus; |
|
var k = key.modulus.byteLength(); |
|
var mLen = msg.length; |
|
var iHash = createHash('sha1').update(new Buffer('')).digest(); |
|
var hLen = iHash.length; |
|
var hLen2 = 2 * hLen; |
|
if (msg[0] !== 0) { |
|
throw new Error('decryption error'); |
|
} |
|
var maskedSeed = msg.slice(1, hLen + 1); |
|
var maskedDb = msg.slice(hLen + 1); |
|
var seed = xor(maskedSeed, mgf(maskedDb, hLen)); |
|
var db = xor(maskedDb, mgf(seed, k - hLen - 1)); |
|
if (compare(iHash, db.slice(0, hLen))) { |
|
throw new Error('decryption error'); |
|
} |
|
var i = hLen; |
|
while (db[i] === 0) { |
|
i++; |
|
} |
|
if (db[i++] !== 1) { |
|
throw new Error('decryption error'); |
|
} |
|
return db.slice(i); |
|
} |
|
|
|
function pkcs1(key, msg, reverse){ |
|
var p1 = msg.slice(0, 2); |
|
var i = 2; |
|
var status = 0; |
|
while (msg[i++] !== 0) { |
|
if (i >= msg.length) { |
|
status++; |
|
break; |
|
} |
|
} |
|
var ps = msg.slice(2, i - 1); |
|
var p2 = msg.slice(i - 1, i); |
|
|
|
if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)){ |
|
status++; |
|
} |
|
if (ps.length < 8) { |
|
status++; |
|
} |
|
if (status) { |
|
throw new Error('decryption error'); |
|
} |
|
return msg.slice(i); |
|
} |
|
function compare(a, b){ |
|
a = new Buffer(a); |
|
b = new Buffer(b); |
|
var dif = 0; |
|
var len = a.length; |
|
if (a.length !== b.length) { |
|
dif++; |
|
len = Math.min(a.length, b.length); |
|
} |
|
var i = -1; |
|
while (++i < len) { |
|
dif += (a[i] ^ b[i]); |
|
} |
|
return dif; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./mgf":288,"./withPublic":311,"./xor":312,"bn.js":289,"browserify-rsa":290,"buffer":172,"create-hash":266,"parse-asn1":295}],310:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var parseKeys = require('parse-asn1'); |
|
var randomBytes = require('randombytes'); |
|
var createHash = require('create-hash'); |
|
var mgf = require('./mgf'); |
|
var xor = require('./xor'); |
|
var bn = require('bn.js'); |
|
var withPublic = require('./withPublic'); |
|
var crt = require('browserify-rsa'); |
|
|
|
var constants = { |
|
RSA_PKCS1_OAEP_PADDING: 4, |
|
RSA_PKCS1_PADDIN: 1, |
|
RSA_NO_PADDING: 3 |
|
}; |
|
|
|
module.exports = function publicEncrypt(public_key, msg, reverse) { |
|
var padding; |
|
if (public_key.padding) { |
|
padding = public_key.padding; |
|
} else if (reverse) { |
|
padding = 1; |
|
} else { |
|
padding = 4; |
|
} |
|
var key = parseKeys(public_key); |
|
var paddedMsg; |
|
if (padding === 4) { |
|
paddedMsg = oaep(key, msg); |
|
} else if (padding === 1) { |
|
paddedMsg = pkcs1(key, msg, reverse); |
|
} else if (padding === 3) { |
|
paddedMsg = new bn(msg); |
|
if (paddedMsg.cmp(key.modulus) >= 0) { |
|
throw new Error('data too long for modulus'); |
|
} |
|
} else { |
|
throw new Error('unknown padding'); |
|
} |
|
if (reverse) { |
|
return crt(paddedMsg, key); |
|
} else { |
|
return withPublic(paddedMsg, key); |
|
} |
|
}; |
|
|
|
function oaep(key, msg){ |
|
var k = key.modulus.byteLength(); |
|
var mLen = msg.length; |
|
var iHash = createHash('sha1').update(new Buffer('')).digest(); |
|
var hLen = iHash.length; |
|
var hLen2 = 2 * hLen; |
|
if (mLen > k - hLen2 - 2) { |
|
throw new Error('message too long'); |
|
} |
|
var ps = new Buffer(k - mLen - hLen2 - 2); |
|
ps.fill(0); |
|
var dblen = k - hLen - 1; |
|
var seed = randomBytes(hLen); |
|
var maskedDb = xor(Buffer.concat([iHash, ps, new Buffer([1]), msg], dblen), mgf(seed, dblen)); |
|
var maskedSeed = xor(seed, mgf(maskedDb, hLen)); |
|
return new bn(Buffer.concat([new Buffer([0]), maskedSeed, maskedDb], k)); |
|
} |
|
function pkcs1(key, msg, reverse){ |
|
var mLen = msg.length; |
|
var k = key.modulus.byteLength(); |
|
if (mLen > k - 11) { |
|
throw new Error('message too long'); |
|
} |
|
var ps; |
|
if (reverse) { |
|
ps = new Buffer(k - mLen - 3); |
|
ps.fill(0xff); |
|
} else { |
|
ps = nonZero(k - mLen - 3); |
|
} |
|
return new bn(Buffer.concat([new Buffer([0, reverse?1:2]), ps, new Buffer([0]), msg], k)); |
|
} |
|
function nonZero(len, crypto) { |
|
var out = new Buffer(len); |
|
var i = 0; |
|
var cache = randomBytes(len*2); |
|
var cur = 0; |
|
var num; |
|
while (i < len) { |
|
if (cur === cache.length) { |
|
cache = randomBytes(len*2); |
|
cur = 0; |
|
} |
|
num = cache[cur++]; |
|
if (num) { |
|
out[i++] = num; |
|
} |
|
} |
|
return out; |
|
} |
|
}).call(this,require("buffer").Buffer) |
|
},{"./mgf":288,"./withPublic":311,"./xor":312,"bn.js":289,"browserify-rsa":290,"buffer":172,"create-hash":266,"parse-asn1":295,"randombytes":313}],311:[function(require,module,exports){ |
|
(function (Buffer){ |
|
var bn = require('bn.js'); |
|
function withPublic(paddedMsg, key) { |
|
return new Buffer(paddedMsg |
|
.toRed(bn.mont(key.modulus)) |
|
.redPow(new bn(key.publicExponent)) |
|
.fromRed() |
|
.toArray()); |
|
} |
|
|
|
module.exports = withPublic; |
|
}).call(this,require("buffer").Buffer) |
|
},{"bn.js":289,"buffer":172}],312:[function(require,module,exports){ |
|
module.exports = function xor(a, b) { |
|
var len = a.length; |
|
var i = -1; |
|
while (++i < len) { |
|
a[i] ^= b[i]; |
|
} |
|
return a |
|
}; |
|
},{}],313:[function(require,module,exports){ |
|
arguments[4][31][0].apply(exports,arguments) |
|
},{"_process":323,"buffer":172,"dup":31}],314:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
function EventEmitter() { |
|
this._events = this._events || {}; |
|
this._maxListeners = this._maxListeners || undefined; |
|
} |
|
module.exports = EventEmitter; |
|
|
|
// Backwards-compat with node 0.10.x |
|
EventEmitter.EventEmitter = EventEmitter; |
|
|
|
EventEmitter.prototype._events = undefined; |
|
EventEmitter.prototype._maxListeners = undefined; |
|
|
|
// By default EventEmitters will print a warning if more than 10 listeners are |
|
// added to it. This is a useful default which helps finding memory leaks. |
|
EventEmitter.defaultMaxListeners = 10; |
|
|
|
// Obviously not all Emitters should be limited to 10. This function allows |
|
// that to be increased. Set to zero for unlimited. |
|
EventEmitter.prototype.setMaxListeners = function(n) { |
|
if (!isNumber(n) || n < 0 || isNaN(n)) |
|
throw TypeError('n must be a positive number'); |
|
this._maxListeners = n; |
|
return this; |
|
}; |
|
|
|
EventEmitter.prototype.emit = function(type) { |
|
var er, handler, len, args, i, listeners; |
|
|
|
if (!this._events) |
|
this._events = {}; |
|
|
|
// If there is no 'error' event listener then throw. |
|
if (type === 'error') { |
|
if (!this._events.error || |
|
(isObject(this._events.error) && !this._events.error.length)) { |
|
er = arguments[1]; |
|
if (er instanceof Error) { |
|
throw er; // Unhandled 'error' event |
|
} |
|
throw TypeError('Uncaught, unspecified "error" event.'); |
|
} |
|
} |
|
|
|
handler = this._events[type]; |
|
|
|
if (isUndefined(handler)) |
|
return false; |
|
|
|
if (isFunction(handler)) { |
|
switch (arguments.length) { |
|
// fast cases |
|
case 1: |
|
handler.call(this); |
|
break; |
|
case 2: |
|
handler.call(this, arguments[1]); |
|
break; |
|
case 3: |
|
handler.call(this, arguments[1], arguments[2]); |
|
break; |
|
// slower |
|
default: |
|
len = arguments.length; |
|
args = new Array(len - 1); |
|
for (i = 1; i < len; i++) |
|
args[i - 1] = arguments[i]; |
|
handler.apply(this, args); |
|
} |
|
} else if (isObject(handler)) { |
|
len = arguments.length; |
|
args = new Array(len - 1); |
|
for (i = 1; i < len; i++) |
|
args[i - 1] = arguments[i]; |
|
|
|
listeners = handler.slice(); |
|
len = listeners.length; |
|
for (i = 0; i < len; i++) |
|
listeners[i].apply(this, args); |
|
} |
|
|
|
return true; |
|
}; |
|
|
|
EventEmitter.prototype.addListener = function(type, listener) { |
|
var m; |
|
|
|
if (!isFunction(listener)) |
|
throw TypeError('listener must be a function'); |
|
|
|
if (!this._events) |
|
this._events = {}; |
|
|
|
// To avoid recursion in the case that type === "newListener"! Before |
|
// adding it to the listeners, first emit "newListener". |
|
if (this._events.newListener) |
|
this.emit('newListener', type, |
|
isFunction(listener.listener) ? |
|
listener.listener : listener); |
|
|
|
if (!this._events[type]) |
|
// Optimize the case of one listener. Don't need the extra array object. |
|
this._events[type] = listener; |
|
else if (isObject(this._events[type])) |
|
// If we've already got an array, just append. |
|
this._events[type].push(listener); |
|
else |
|
// Adding the second element, need to change to array. |
|
this._events[type] = [this._events[type], listener]; |
|
|
|
// Check for listener leak |
|
if (isObject(this._events[type]) && !this._events[type].warned) { |
|
var m; |
|
if (!isUndefined(this._maxListeners)) { |
|
m = this._maxListeners; |
|
} else { |
|
m = EventEmitter.defaultMaxListeners; |
|
} |
|
|
|
if (m && m > 0 && this._events[type].length > m) { |
|
this._events[type].warned = true; |
|
console.error('(node) warning: possible EventEmitter memory ' + |
|
'leak detected. %d listeners added. ' + |
|
'Use emitter.setMaxListeners() to increase limit.', |
|
this._events[type].length); |
|
if (typeof console.trace === 'function') { |
|
// not supported in IE 10 |
|
console.trace(); |
|
} |
|
} |
|
} |
|
|
|
return this; |
|
}; |
|
|
|
EventEmitter.prototype.on = EventEmitter.prototype.addListener; |
|
|
|
EventEmitter.prototype.once = function(type, listener) { |
|
if (!isFunction(listener)) |
|
throw TypeError('listener must be a function'); |
|
|
|
var fired = false; |
|
|
|
function g() { |
|
this.removeListener(type, g); |
|
|
|
if (!fired) { |
|
fired = true; |
|
listener.apply(this, arguments); |
|
} |
|
} |
|
|
|
g.listener = listener; |
|
this.on(type, g); |
|
|
|
return this; |
|
}; |
|
|
|
// emits a 'removeListener' event iff the listener was removed |
|
EventEmitter.prototype.removeListener = function(type, listener) { |
|
var list, position, length, i; |
|
|
|
if (!isFunction(listener)) |
|
throw TypeError('listener must be a function'); |
|
|
|
if (!this._events || !this._events[type]) |
|
return this; |
|
|
|
list = this._events[type]; |
|
length = list.length; |
|
position = -1; |
|
|
|
if (list === listener || |
|
(isFunction(list.listener) && list.listener === listener)) { |
|
delete this._events[type]; |
|
if (this._events.removeListener) |
|
this.emit('removeListener', type, listener); |
|
|
|
} else if (isObject(list)) { |
|
for (i = length; i-- > 0;) { |
|
if (list[i] === listener || |
|
(list[i].listener && list[i].listener === listener)) { |
|
position = i; |
|
break; |
|
} |
|
} |
|
|
|
if (position < 0) |
|
return this; |
|
|
|
if (list.length === 1) { |
|
list.length = 0; |
|
delete this._events[type]; |
|
} else { |
|
list.splice(position, 1); |
|
} |
|
|
|
if (this._events.removeListener) |
|
this.emit('removeListener', type, listener); |
|
} |
|
|
|
return this; |
|
}; |
|
|
|
EventEmitter.prototype.removeAllListeners = function(type) { |
|
var key, listeners; |
|
|
|
if (!this._events) |
|
return this; |
|
|
|
// not listening for removeListener, no need to emit |
|
if (!this._events.removeListener) { |
|
if (arguments.length === 0) |
|
this._events = {}; |
|
else if (this._events[type]) |
|
delete this._events[type]; |
|
return this; |
|
} |
|
|
|
// emit removeListener for all listeners on all events |
|
if (arguments.length === 0) { |
|
for (key in this._events) { |
|
if (key === 'removeListener') continue; |
|
this.removeAllListeners(key); |
|
} |
|
this.removeAllListeners('removeListener'); |
|
this._events = {}; |
|
return this; |
|
} |
|
|
|
listeners = this._events[type]; |
|
|
|
if (isFunction(listeners)) { |
|
this.removeListener(type, listeners); |
|
} else { |
|
// LIFO order |
|
while (listeners.length) |
|
this.removeListener(type, listeners[listeners.length - 1]); |
|
} |
|
delete this._events[type]; |
|
|
|
return this; |
|
}; |
|
|
|
EventEmitter.prototype.listeners = function(type) { |
|
var ret; |
|
if (!this._events || !this._events[type]) |
|
ret = []; |
|
else if (isFunction(this._events[type])) |
|
ret = [this._events[type]]; |
|
else |
|
ret = this._events[type].slice(); |
|
return ret; |
|
}; |
|
|
|
EventEmitter.listenerCount = function(emitter, type) { |
|
var ret; |
|
if (!emitter._events || !emitter._events[type]) |
|
ret = 0; |
|
else if (isFunction(emitter._events[type])) |
|
ret = 1; |
|
else |
|
ret = emitter._events[type].length; |
|
return ret; |
|
}; |
|
|
|
function isFunction(arg) { |
|
return typeof arg === 'function'; |
|
} |
|
|
|
function isNumber(arg) { |
|
return typeof arg === 'number'; |
|
} |
|
|
|
function isObject(arg) { |
|
return typeof arg === 'object' && arg !== null; |
|
} |
|
|
|
function isUndefined(arg) { |
|
return arg === void 0; |
|
} |
|
|
|
},{}],315:[function(require,module,exports){ |
|
var http = module.exports; |
|
var EventEmitter = require('events').EventEmitter; |
|
var Request = require('./lib/request'); |
|
var url = require('url') |
|
|
|
http.request = function (params, cb) { |
|
if (typeof params === 'string') { |
|
params = url.parse(params) |
|
} |
|
if (!params) params = {}; |
|
if (!params.host && !params.port) { |
|
params.port = parseInt(window.location.port, 10); |
|
} |
|
if (!params.host && params.hostname) { |
|
params.host = params.hostname; |
|
} |
|
|
|
if (!params.protocol) { |
|
if (params.scheme) { |
|
params.protocol = params.scheme + ':'; |
|
} else { |
|
params.protocol = window.location.protocol; |
|
} |
|
} |
|
|
|
if (!params.host) { |
|
params.host = window.location.hostname || window.location.host; |
|
} |
|
if (/:/.test(params.host)) { |
|
if (!params.port) { |
|
params.port = params.host.split(':')[1]; |
|
} |
|
params.host = params.host.split(':')[0]; |
|
} |
|
if (!params.port) params.port = params.protocol == 'https:' ? 443 : 80; |
|
|
|
var req = new Request(new xhrHttp, params); |
|
if (cb) req.on('response', cb); |
|
return req; |
|
}; |
|
|
|
http.get = function (params, cb) { |
|
params.method = 'GET'; |
|
var req = http.request(params, cb); |
|
req.end(); |
|
return req; |
|
}; |
|
|
|
http.Agent = function () {}; |
|
http.Agent.defaultMaxSockets = 4; |
|
|
|
var xhrHttp = (function () { |
|
if (typeof window === 'undefined') { |
|
throw new Error('no window object present'); |
|
} |
|
else if (window.XMLHttpRequest) { |
|
return window.XMLHttpRequest; |
|
} |
|
else if (window.ActiveXObject) { |
|
var axs = [ |
|
'Msxml2.XMLHTTP.6.0', |
|
'Msxml2.XMLHTTP.3.0', |
|
'Microsoft.XMLHTTP' |
|
]; |
|
for (var i = 0; i < axs.length; i++) { |
|
try { |
|
var ax = new(window.ActiveXObject)(axs[i]); |
|
return function () { |
|
if (ax) { |
|
var ax_ = ax; |
|
ax = null; |
|
return ax_; |
|
} |
|
else { |
|
return new(window.ActiveXObject)(axs[i]); |
|
} |
|
}; |
|
} |
|
catch (e) {} |
|
} |
|
throw new Error('ajax not supported in this browser') |
|
} |
|
else { |
|
throw new Error('ajax not supported in this browser'); |
|
} |
|
})(); |
|
|
|
http.STATUS_CODES = { |
|
100 : 'Continue', |
|
101 : 'Switching Protocols', |
|
102 : 'Processing', // RFC 2518, obsoleted by RFC 4918 |
|
200 : 'OK', |
|
201 : 'Created', |
|
202 : 'Accepted', |
|
203 : 'Non-Authoritative Information', |
|
204 : 'No Content', |
|
205 : 'Reset Content', |
|
206 : 'Partial Content', |
|
207 : 'Multi-Status', // RFC 4918 |
|
300 : 'Multiple Choices', |
|
301 : 'Moved Permanently', |
|
302 : 'Moved Temporarily', |
|
303 : 'See Other', |
|
304 : 'Not Modified', |
|
305 : 'Use Proxy', |
|
307 : 'Temporary Redirect', |
|
400 : 'Bad Request', |
|
401 : 'Unauthorized', |
|
402 : 'Payment Required', |
|
403 : 'Forbidden', |
|
404 : 'Not Found', |
|
405 : 'Method Not Allowed', |
|
406 : 'Not Acceptable', |
|
407 : 'Proxy Authentication Required', |
|
408 : 'Request Time-out', |
|
409 : 'Conflict', |
|
410 : 'Gone', |
|
411 : 'Length Required', |
|
412 : 'Precondition Failed', |
|
413 : 'Request Entity Too Large', |
|
414 : 'Request-URI Too Large', |
|
415 : 'Unsupported Media Type', |
|
416 : 'Requested Range Not Satisfiable', |
|
417 : 'Expectation Failed', |
|
418 : 'I\'m a teapot', // RFC 2324 |
|
422 : 'Unprocessable Entity', // RFC 4918 |
|
423 : 'Locked', // RFC 4918 |
|
424 : 'Failed Dependency', // RFC 4918 |
|
425 : 'Unordered Collection', // RFC 4918 |
|
426 : 'Upgrade Required', // RFC 2817 |
|
428 : 'Precondition Required', // RFC 6585 |
|
429 : 'Too Many Requests', // RFC 6585 |
|
431 : 'Request Header Fields Too Large',// RFC 6585 |
|
500 : 'Internal Server Error', |
|
501 : 'Not Implemented', |
|
502 : 'Bad Gateway', |
|
503 : 'Service Unavailable', |
|
504 : 'Gateway Time-out', |
|
505 : 'HTTP Version Not Supported', |
|
506 : 'Variant Also Negotiates', // RFC 2295 |
|
507 : 'Insufficient Storage', // RFC 4918 |
|
509 : 'Bandwidth Limit Exceeded', |
|
510 : 'Not Extended', // RFC 2774 |
|
511 : 'Network Authentication Required' // RFC 6585 |
|
}; |
|
},{"./lib/request":316,"events":314,"url":341}],316:[function(require,module,exports){ |
|
var Stream = require('stream'); |
|
var Response = require('./response'); |
|
var Base64 = require('Base64'); |
|
var inherits = require('inherits'); |
|
|
|
var Request = module.exports = function (xhr, params) { |
|
var self = this; |
|
self.writable = true; |
|
self.xhr = xhr; |
|
self.body = []; |
|
|
|
self.uri = (params.protocol || 'http:') + '//' |
|
+ params.host |
|
+ (params.port ? ':' + params.port : '') |
|
+ (params.path || '/') |
|
; |
|
|
|
if (typeof params.withCredentials === 'undefined') { |
|
params.withCredentials = true; |
|
} |
|
|
|
try { xhr.withCredentials = params.withCredentials } |
|
catch (e) {} |
|
|
|
if (params.responseType) try { xhr.responseType = params.responseType } |
|
catch (e) {} |
|
|
|
xhr.open( |
|
params.method || 'GET', |
|
self.uri, |
|
true |
|
); |
|
|
|
xhr.onerror = function(event) { |
|
self.emit('error', new Error('Network error')); |
|
}; |
|
|
|
self._headers = {}; |
|
|
|
if (params.headers) { |
|
var keys = objectKeys(params.headers); |
|
for (var i = 0; i < keys.length; i++) { |
|
var key = keys[i]; |
|
if (!self.isSafeRequestHeader(key)) continue; |
|
var value = params.headers[key]; |
|
self.setHeader(key, value); |
|
} |
|
} |
|
|
|
if (params.auth) { |
|
//basic auth |
|
this.setHeader('Authorization', 'Basic ' + Base64.btoa(params.auth)); |
|
} |
|
|
|
var res = new Response; |
|
res.on('close', function () { |
|
self.emit('close'); |
|
}); |
|
|
|
res.on('ready', function () { |
|
self.emit('response', res); |
|
}); |
|
|
|
res.on('error', function (err) { |
|
self.emit('error', err); |
|
}); |
|
|
|
xhr.onreadystatechange = function () { |
|
// Fix for IE9 bug |
|
// SCRIPT575: Could not complete the operation due to error c00c023f |
|
// It happens when a request is aborted, calling the success callback anyway with readyState === 4 |
|
if (xhr.__aborted) return; |
|
res.handle(xhr); |
|
}; |
|
}; |
|
|
|
inherits(Request, Stream); |
|
|
|
Request.prototype.setHeader = function (key, value) { |
|
this._headers[key.toLowerCase()] = value |
|
}; |
|
|
|
Request.prototype.getHeader = function (key) { |
|
return this._headers[key.toLowerCase()] |
|
}; |
|
|
|
Request.prototype.removeHeader = function (key) { |
|
delete this._headers[key.toLowerCase()] |
|
}; |
|
|
|
Request.prototype.write = function (s) { |
|
this.body.push(s); |
|
}; |
|
|
|
Request.prototype.destroy = function (s) { |
|
this.xhr.__aborted = true; |
|
this.xhr.abort(); |
|
this.emit('close'); |
|
}; |
|
|
|
Request.prototype.end = function (s) { |
|
if (s !== undefined) this.body.push(s); |
|
|
|
var keys = objectKeys(this._headers); |
|
for (var i = 0; i < keys.length; i++) { |
|
var key = keys[i]; |
|
var value = this._headers[key]; |
|
if (isArray(value)) { |
|
for (var j = 0; j < value.length; j++) { |
|
this.xhr.setRequestHeader(key, value[j]); |
|
} |
|
} |
|
else this.xhr.setRequestHeader(key, value) |
|
} |
|
|
|
if (this.body.length === 0) { |
|
this.xhr.send(''); |
|
} |
|
else if (typeof this.body[0] === 'string') { |
|
this.xhr.send(this.body.join('')); |
|
} |
|
else if (isArray(this.body[0])) { |
|
var body = []; |
|
for (var i = 0; i < this.body.length; i++) { |
|
body.push.apply(body, this.body[i]); |
|
} |
|
this.xhr.send(body); |
|
} |
|
else if (/Array/.test(Object.prototype.toString.call(this.body[0]))) { |
|
var len = 0; |
|
for (var i = 0; i < this.body.length; i++) { |
|
len += this.body[i].length; |
|
} |
|
var body = new(this.body[0].constructor)(len); |
|
var k = 0; |
|
|
|
for (var i = 0; i < this.body.length; i++) { |
|
var b = this.body[i]; |
|
for (var j = 0; j < b.length; j++) { |
|
body[k++] = b[j]; |
|
} |
|
} |
|
this.xhr.send(body); |
|
} |
|
else if (isXHR2Compatible(this.body[0])) { |
|
this.xhr.send(this.body[0]); |
|
} |
|
else { |
|
var body = ''; |
|
for (var i = 0; i < this.body.length; i++) { |
|
body += this.body[i].toString(); |
|
} |
|
this.xhr.send(body); |
|
} |
|
}; |
|
|
|
// Taken from http://dxr.mozilla.org/mozilla/mozilla-central/content/base/src/nsXMLHttpRequest.cpp.html |
|
Request.unsafeHeaders = [ |
|
"accept-charset", |
|
"accept-encoding", |
|
"access-control-request-headers", |
|
"access-control-request-method", |
|
"connection", |
|
"content-length", |
|
"cookie", |
|
"cookie2", |
|
"content-transfer-encoding", |
|
"date", |
|
"expect", |
|
"host", |
|
"keep-alive", |
|
"origin", |
|
"referer", |
|
"te", |
|
"trailer", |
|
"transfer-encoding", |
|
"upgrade", |
|
"user-agent", |
|
"via" |
|
]; |
|
|
|
Request.prototype.isSafeRequestHeader = function (headerName) { |
|
if (!headerName) return false; |
|
return indexOf(Request.unsafeHeaders, headerName.toLowerCase()) === -1; |
|
}; |
|
|
|
var objectKeys = Object.keys || function (obj) { |
|
var keys = []; |
|
for (var key in obj) keys.push(key); |
|
return keys; |
|
}; |
|
|
|
var isArray = Array.isArray || function (xs) { |
|
return Object.prototype.toString.call(xs) === '[object Array]'; |
|
}; |
|
|
|
var indexOf = function (xs, x) { |
|
if (xs.indexOf) return xs.indexOf(x); |
|
for (var i = 0; i < xs.length; i++) { |
|
if (xs[i] === x) return i; |
|
} |
|
return -1; |
|
}; |
|
|
|
var isXHR2Compatible = function (obj) { |
|
if (typeof Blob !== 'undefined' && obj instanceof Blob) return true; |
|
if (typeof ArrayBuffer !== 'undefined' && obj instanceof ArrayBuffer) return true; |
|
if (typeof FormData !== 'undefined' && obj instanceof FormData) return true; |
|
}; |
|
|
|
},{"./response":317,"Base64":318,"inherits":320,"stream":339}],317:[function(require,module,exports){ |
|
var Stream = require('stream'); |
|
var util = require('util'); |
|
|
|
var Response = module.exports = function (res) { |
|
this.offset = 0; |
|
this.readable = true; |
|
}; |
|
|
|
util.inherits(Response, Stream); |
|
|
|
var capable = { |
|
streaming : true, |
|
status2 : true |
|
}; |
|
|
|
function parseHeaders (res) { |
|
var lines = res.getAllResponseHeaders().split(/\r?\n/); |
|
var headers = {}; |
|
for (var i = 0; i < lines.length; i++) { |
|
var line = lines[i]; |
|
if (line === '') continue; |
|
|
|
var m = line.match(/^([^:]+):\s*(.*)/); |
|
if (m) { |
|
var key = m[1].toLowerCase(), value = m[2]; |
|
|
|
if (headers[key] !== undefined) { |
|
|
|
if (isArray(headers[key])) { |
|
headers[key].push(value); |
|
} |
|
else { |
|
headers[key] = [ headers[key], value ]; |
|
} |
|
} |
|
else { |
|
headers[key] = value; |
|
} |
|
} |
|
else { |
|
headers[line] = true; |
|
} |
|
} |
|
return headers; |
|
} |
|
|
|
Response.prototype.getResponse = function (xhr) { |
|
var respType = String(xhr.responseType).toLowerCase(); |
|
if (respType === 'blob') return xhr.responseBlob || xhr.response; |
|
if (respType === 'arraybuffer') return xhr.response; |
|
return xhr.responseText; |
|
} |
|
|
|
Response.prototype.getHeader = function (key) { |
|
return this.headers[key.toLowerCase()]; |
|
}; |
|
|
|
Response.prototype.handle = function (res) { |
|
if (res.readyState === 2 && capable.status2) { |
|
try { |
|
this.statusCode = res.status; |
|
this.headers = parseHeaders(res); |
|
} |
|
catch (err) { |
|
capable.status2 = false; |
|
} |
|
|
|
if (capable.status2) { |
|
this.emit('ready'); |
|
} |
|
} |
|
else if (capable.streaming && res.readyState === 3) { |
|
try { |
|
if (!this.statusCode) { |
|
this.statusCode = res.status; |
|
this.headers = parseHeaders(res); |
|
this.emit('ready'); |
|
} |
|
} |
|
catch (err) {} |
|
|
|
try { |
|
this._emitData(res); |
|
} |
|
catch (err) { |
|
capable.streaming = false; |
|
} |
|
} |
|
else if (res.readyState === 4) { |
|
if (!this.statusCode) { |
|
this.statusCode = res.status; |
|
this.emit('ready'); |
|
} |
|
this._emitData(res); |
|
|
|
if (res.error) { |
|
this.emit('error', this.getResponse(res)); |
|
} |
|
else this.emit('end'); |
|
|
|
this.emit('close'); |
|
} |
|
}; |
|
|
|
Response.prototype._emitData = function (res) { |
|
var respBody = this.getResponse(res); |
|
if (respBody.toString().match(/ArrayBuffer/)) { |
|
this.emit('data', new Uint8Array(respBody, this.offset)); |
|
this.offset = respBody.byteLength; |
|
return; |
|
} |
|
if (respBody.length > this.offset) { |
|
this.emit('data', respBody.slice(this.offset)); |
|
this.offset = respBody.length; |
|
} |
|
}; |
|
|
|
var isArray = Array.isArray || function (xs) { |
|
return Object.prototype.toString.call(xs) === '[object Array]'; |
|
}; |
|
|
|
},{"stream":339,"util":343}],318:[function(require,module,exports){ |
|
;(function () { |
|
|
|
var object = typeof exports != 'undefined' ? exports : this; // #8: web workers |
|
var chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='; |
|
|
|
function InvalidCharacterError(message) { |
|
this.message = message; |
|
} |
|
InvalidCharacterError.prototype = new Error; |
|
InvalidCharacterError.prototype.name = 'InvalidCharacterError'; |
|
|
|
// encoder |
|
// [https://gist.github.com/999166] by [https://github.com/nignag] |
|
object.btoa || ( |
|
object.btoa = function (input) { |
|
for ( |
|
// initialize result and counter |
|
var block, charCode, idx = 0, map = chars, output = ''; |
|
// if the next input index does not exist: |
|
// change the mapping table to "=" |
|
// check if d has no fractional digits |
|
input.charAt(idx | 0) || (map = '=', idx % 1); |
|
// "8 - idx % 1 * 8" generates the sequence 2, 4, 6, 8 |
|
output += map.charAt(63 & block >> 8 - idx % 1 * 8) |
|
) { |
|
charCode = input.charCodeAt(idx += 3/4); |
|
if (charCode > 0xFF) { |
|
throw new InvalidCharacterError("'btoa' failed: The string to be encoded contains characters outside of the Latin1 range."); |
|
} |
|
block = block << 8 | charCode; |
|
} |
|
return output; |
|
}); |
|
|
|
// decoder |
|
// [https://gist.github.com/1020396] by [https://github.com/atk] |
|
object.atob || ( |
|
object.atob = function (input) { |
|
input = input.replace(/=+$/, ''); |
|
if (input.length % 4 == 1) { |
|
throw new InvalidCharacterError("'atob' failed: The string to be decoded is not correctly encoded."); |
|
} |
|
for ( |
|
// initialize result and counters |
|
var bc = 0, bs, buffer, idx = 0, output = ''; |
|
// get next character |
|
buffer = input.charAt(idx++); |
|
// character found in table? initialize bit storage and add its ascii value; |
|
~buffer && (bs = bc % 4 ? bs * 64 + buffer : buffer, |
|
// and if not first of each 4 characters, |
|
// convert the first 8 bits to one ascii character |
|
bc++ % 4) ? output += String.fromCharCode(255 & bs >> (-2 * bc & 6)) : 0 |
|
) { |
|
// try to find character in table (0-63, not found => -1) |
|
buffer = chars.indexOf(buffer); |
|
} |
|
return output; |
|
}); |
|
|
|
}()); |
|
|
|
},{}],319:[function(require,module,exports){ |
|
var http = require('http'); |
|
|
|
var https = module.exports; |
|
|
|
for (var key in http) { |
|
if (http.hasOwnProperty(key)) https[key] = http[key]; |
|
}; |
|
|
|
https.request = function (params, cb) { |
|
if (!params) params = {}; |
|
params.scheme = 'https'; |
|
return http.request.call(this, params, cb); |
|
} |
|
|
|
},{"http":315}],320:[function(require,module,exports){ |
|
arguments[4][14][0].apply(exports,arguments) |
|
},{"dup":14}],321:[function(require,module,exports){ |
|
arguments[4][71][0].apply(exports,arguments) |
|
},{"dup":71}],322:[function(require,module,exports){ |
|
(function (process){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// resolves . and .. elements in a path array with directory names there |
|
// must be no slashes, empty elements, or device names (c:\) in the array |
|
// (so also no leading and trailing slashes - it does not distinguish |
|
// relative and absolute paths) |
|
function normalizeArray(parts, allowAboveRoot) { |
|
// if the path tries to go above the root, `up` ends up > 0 |
|
var up = 0; |
|
for (var i = parts.length - 1; i >= 0; i--) { |
|
var last = parts[i]; |
|
if (last === '.') { |
|
parts.splice(i, 1); |
|
} else if (last === '..') { |
|
parts.splice(i, 1); |
|
up++; |
|
} else if (up) { |
|
parts.splice(i, 1); |
|
up--; |
|
} |
|
} |
|
|
|
// if the path is allowed to go above the root, restore leading ..s |
|
if (allowAboveRoot) { |
|
for (; up--; up) { |
|
parts.unshift('..'); |
|
} |
|
} |
|
|
|
return parts; |
|
} |
|
|
|
// Split a filename into [root, dir, basename, ext], unix version |
|
// 'root' is just a slash, or nothing. |
|
var splitPathRe = |
|
/^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/; |
|
var splitPath = function(filename) { |
|
return splitPathRe.exec(filename).slice(1); |
|
}; |
|
|
|
// path.resolve([from ...], to) |
|
// posix version |
|
exports.resolve = function() { |
|
var resolvedPath = '', |
|
resolvedAbsolute = false; |
|
|
|
for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) { |
|
var path = (i >= 0) ? arguments[i] : process.cwd(); |
|
|
|
// Skip empty and invalid entries |
|
if (typeof path !== 'string') { |
|
throw new TypeError('Arguments to path.resolve must be strings'); |
|
} else if (!path) { |
|
continue; |
|
} |
|
|
|
resolvedPath = path + '/' + resolvedPath; |
|
resolvedAbsolute = path.charAt(0) === '/'; |
|
} |
|
|
|
// At this point the path should be resolved to a full absolute path, but |
|
// handle relative paths to be safe (might happen when process.cwd() fails) |
|
|
|
// Normalize the path |
|
resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) { |
|
return !!p; |
|
}), !resolvedAbsolute).join('/'); |
|
|
|
return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.'; |
|
}; |
|
|
|
// path.normalize(path) |
|
// posix version |
|
exports.normalize = function(path) { |
|
var isAbsolute = exports.isAbsolute(path), |
|
trailingSlash = substr(path, -1) === '/'; |
|
|
|
// Normalize the path |
|
path = normalizeArray(filter(path.split('/'), function(p) { |
|
return !!p; |
|
}), !isAbsolute).join('/'); |
|
|
|
if (!path && !isAbsolute) { |
|
path = '.'; |
|
} |
|
if (path && trailingSlash) { |
|
path += '/'; |
|
} |
|
|
|
return (isAbsolute ? '/' : '') + path; |
|
}; |
|
|
|
// posix version |
|
exports.isAbsolute = function(path) { |
|
return path.charAt(0) === '/'; |
|
}; |
|
|
|
// posix version |
|
exports.join = function() { |
|
var paths = Array.prototype.slice.call(arguments, 0); |
|
return exports.normalize(filter(paths, function(p, index) { |
|
if (typeof p !== 'string') { |
|
throw new TypeError('Arguments to path.join must be strings'); |
|
} |
|
return p; |
|
}).join('/')); |
|
}; |
|
|
|
|
|
// path.relative(from, to) |
|
// posix version |
|
exports.relative = function(from, to) { |
|
from = exports.resolve(from).substr(1); |
|
to = exports.resolve(to).substr(1); |
|
|
|
function trim(arr) { |
|
var start = 0; |
|
for (; start < arr.length; start++) { |
|
if (arr[start] !== '') break; |
|
} |
|
|
|
var end = arr.length - 1; |
|
for (; end >= 0; end--) { |
|
if (arr[end] !== '') break; |
|
} |
|
|
|
if (start > end) return []; |
|
return arr.slice(start, end - start + 1); |
|
} |
|
|
|
var fromParts = trim(from.split('/')); |
|
var toParts = trim(to.split('/')); |
|
|
|
var length = Math.min(fromParts.length, toParts.length); |
|
var samePartsLength = length; |
|
for (var i = 0; i < length; i++) { |
|
if (fromParts[i] !== toParts[i]) { |
|
samePartsLength = i; |
|
break; |
|
} |
|
} |
|
|
|
var outputParts = []; |
|
for (var i = samePartsLength; i < fromParts.length; i++) { |
|
outputParts.push('..'); |
|
} |
|
|
|
outputParts = outputParts.concat(toParts.slice(samePartsLength)); |
|
|
|
return outputParts.join('/'); |
|
}; |
|
|
|
exports.sep = '/'; |
|
exports.delimiter = ':'; |
|
|
|
exports.dirname = function(path) { |
|
var result = splitPath(path), |
|
root = result[0], |
|
dir = result[1]; |
|
|
|
if (!root && !dir) { |
|
// No dirname whatsoever |
|
return '.'; |
|
} |
|
|
|
if (dir) { |
|
// It has a dirname, strip trailing slash |
|
dir = dir.substr(0, dir.length - 1); |
|
} |
|
|
|
return root + dir; |
|
}; |
|
|
|
|
|
exports.basename = function(path, ext) { |
|
var f = splitPath(path)[2]; |
|
// TODO: make this comparison case-insensitive on windows? |
|
if (ext && f.substr(-1 * ext.length) === ext) { |
|
f = f.substr(0, f.length - ext.length); |
|
} |
|
return f; |
|
}; |
|
|
|
|
|
exports.extname = function(path) { |
|
return splitPath(path)[3]; |
|
}; |
|
|
|
function filter (xs, f) { |
|
if (xs.filter) return xs.filter(f); |
|
var res = []; |
|
for (var i = 0; i < xs.length; i++) { |
|
if (f(xs[i], i, xs)) res.push(xs[i]); |
|
} |
|
return res; |
|
} |
|
|
|
// String.prototype.substr - negative index don't work in IE8 |
|
var substr = 'ab'.substr(-1) === 'b' |
|
? function (str, start, len) { return str.substr(start, len) } |
|
: function (str, start, len) { |
|
if (start < 0) start = str.length + start; |
|
return str.substr(start, len); |
|
} |
|
; |
|
|
|
}).call(this,require('_process')) |
|
},{"_process":323}],323:[function(require,module,exports){ |
|
// shim for using process in browser |
|
|
|
var process = module.exports = {}; |
|
var queue = []; |
|
var draining = false; |
|
|
|
function drainQueue() { |
|
if (draining) { |
|
return; |
|
} |
|
draining = true; |
|
var currentQueue; |
|
var len = queue.length; |
|
while(len) { |
|
currentQueue = queue; |
|
queue = []; |
|
var i = -1; |
|
while (++i < len) { |
|
currentQueue[i](); |
|
} |
|
len = queue.length; |
|
} |
|
draining = false; |
|
} |
|
process.nextTick = function (fun) { |
|
queue.push(fun); |
|
if (!draining) { |
|
setTimeout(drainQueue, 0); |
|
} |
|
}; |
|
|
|
process.title = 'browser'; |
|
process.browser = true; |
|
process.env = {}; |
|
process.argv = []; |
|
process.version = ''; // empty string to avoid regexp issues |
|
process.versions = {}; |
|
|
|
function noop() {} |
|
|
|
process.on = noop; |
|
process.addListener = noop; |
|
process.once = noop; |
|
process.off = noop; |
|
process.removeListener = noop; |
|
process.removeAllListeners = noop; |
|
process.emit = noop; |
|
|
|
process.binding = function (name) { |
|
throw new Error('process.binding is not supported'); |
|
}; |
|
|
|
// TODO(shtylman) |
|
process.cwd = function () { return '/' }; |
|
process.chdir = function (dir) { |
|
throw new Error('process.chdir is not supported'); |
|
}; |
|
process.umask = function() { return 0; }; |
|
|
|
},{}],324:[function(require,module,exports){ |
|
(function (global){ |
|
/*! http://mths.be/punycode v1.2.4 by @mathias */ |
|
;(function(root) { |
|
|
|
/** Detect free variables */ |
|
var freeExports = typeof exports == 'object' && exports; |
|
var freeModule = typeof module == 'object' && module && |
|
module.exports == freeExports && module; |
|
var freeGlobal = typeof global == 'object' && global; |
|
if (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal) { |
|
root = freeGlobal; |
|
} |
|
|
|
/** |
|
* The `punycode` object. |
|
* @name punycode |
|
* @type Object |
|
*/ |
|
var punycode, |
|
|
|
/** Highest positive signed 32-bit float value */ |
|
maxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1 |
|
|
|
/** Bootstring parameters */ |
|
base = 36, |
|
tMin = 1, |
|
tMax = 26, |
|
skew = 38, |
|
damp = 700, |
|
initialBias = 72, |
|
initialN = 128, // 0x80 |
|
delimiter = '-', // '\x2D' |
|
|
|
/** Regular expressions */ |
|
regexPunycode = /^xn--/, |
|
regexNonASCII = /[^ -~]/, // unprintable ASCII chars + non-ASCII chars |
|
regexSeparators = /\x2E|\u3002|\uFF0E|\uFF61/g, // RFC 3490 separators |
|
|
|
/** Error messages */ |
|
errors = { |
|
'overflow': 'Overflow: input needs wider integers to process', |
|
'not-basic': 'Illegal input >= 0x80 (not a basic code point)', |
|
'invalid-input': 'Invalid input' |
|
}, |
|
|
|
/** Convenience shortcuts */ |
|
baseMinusTMin = base - tMin, |
|
floor = Math.floor, |
|
stringFromCharCode = String.fromCharCode, |
|
|
|
/** Temporary variable */ |
|
key; |
|
|
|
/*--------------------------------------------------------------------------*/ |
|
|
|
/** |
|
* A generic error utility function. |
|
* @private |
|
* @param {String} type The error type. |
|
* @returns {Error} Throws a `RangeError` with the applicable error message. |
|
*/ |
|
function error(type) { |
|
throw RangeError(errors[type]); |
|
} |
|
|
|
/** |
|
* A generic `Array#map` utility function. |
|
* @private |
|
* @param {Array} array The array to iterate over. |
|
* @param {Function} callback The function that gets called for every array |
|
* item. |
|
* @returns {Array} A new array of values returned by the callback function. |
|
*/ |
|
function map(array, fn) { |
|
var length = array.length; |
|
while (length--) { |
|
array[length] = fn(array[length]); |
|
} |
|
return array; |
|
} |
|
|
|
/** |
|
* A simple `Array#map`-like wrapper to work with domain name strings. |
|
* @private |
|
* @param {String} domain The domain name. |
|
* @param {Function} callback The function that gets called for every |
|
* character. |
|
* @returns {Array} A new string of characters returned by the callback |
|
* function. |
|
*/ |
|
function mapDomain(string, fn) { |
|
return map(string.split(regexSeparators), fn).join('.'); |
|
} |
|
|
|
/** |
|
* Creates an array containing the numeric code points of each Unicode |
|
* character in the string. While JavaScript uses UCS-2 internally, |
|
* this function will convert a pair of surrogate halves (each of which |
|
* UCS-2 exposes as separate characters) into a single code point, |
|
* matching UTF-16. |
|
* @see `punycode.ucs2.encode` |
|
* @see <http://mathiasbynens.be/notes/javascript-encoding> |
|
* @memberOf punycode.ucs2 |
|
* @name decode |
|
* @param {String} string The Unicode input string (UCS-2). |
|
* @returns {Array} The new array of code points. |
|
*/ |
|
function ucs2decode(string) { |
|
var output = [], |
|
counter = 0, |
|
length = string.length, |
|
value, |
|
extra; |
|
while (counter < length) { |
|
value = string.charCodeAt(counter++); |
|
if (value >= 0xD800 && value <= 0xDBFF && counter < length) { |
|
// high surrogate, and there is a next character |
|
extra = string.charCodeAt(counter++); |
|
if ((extra & 0xFC00) == 0xDC00) { // low surrogate |
|
output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000); |
|
} else { |
|
// unmatched surrogate; only append this code unit, in case the next |
|
// code unit is the high surrogate of a surrogate pair |
|
output.push(value); |
|
counter--; |
|
} |
|
} else { |
|
output.push(value); |
|
} |
|
} |
|
return output; |
|
} |
|
|
|
/** |
|
* Creates a string based on an array of numeric code points. |
|
* @see `punycode.ucs2.decode` |
|
* @memberOf punycode.ucs2 |
|
* @name encode |
|
* @param {Array} codePoints The array of numeric code points. |
|
* @returns {String} The new Unicode string (UCS-2). |
|
*/ |
|
function ucs2encode(array) { |
|
return map(array, function(value) { |
|
var output = ''; |
|
if (value > 0xFFFF) { |
|
value -= 0x10000; |
|
output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800); |
|
value = 0xDC00 | value & 0x3FF; |
|
} |
|
output += stringFromCharCode(value); |
|
return output; |
|
}).join(''); |
|
} |
|
|
|
/** |
|
* Converts a basic code point into a digit/integer. |
|
* @see `digitToBasic()` |
|
* @private |
|
* @param {Number} codePoint The basic numeric code point value. |
|
* @returns {Number} The numeric value of a basic code point (for use in |
|
* representing integers) in the range `0` to `base - 1`, or `base` if |
|
* the code point does not represent a value. |
|
*/ |
|
function basicToDigit(codePoint) { |
|
if (codePoint - 48 < 10) { |
|
return codePoint - 22; |
|
} |
|
if (codePoint - 65 < 26) { |
|
return codePoint - 65; |
|
} |
|
if (codePoint - 97 < 26) { |
|
return codePoint - 97; |
|
} |
|
return base; |
|
} |
|
|
|
/** |
|
* Converts a digit/integer into a basic code point. |
|
* @see `basicToDigit()` |
|
* @private |
|
* @param {Number} digit The numeric value of a basic code point. |
|
* @returns {Number} The basic code point whose value (when used for |
|
* representing integers) is `digit`, which needs to be in the range |
|
* `0` to `base - 1`. If `flag` is non-zero, the uppercase form is |
|
* used; else, the lowercase form is used. The behavior is undefined |
|
* if `flag` is non-zero and `digit` has no uppercase form. |
|
*/ |
|
function digitToBasic(digit, flag) { |
|
// 0..25 map to ASCII a..z or A..Z |
|
// 26..35 map to ASCII 0..9 |
|
return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5); |
|
} |
|
|
|
/** |
|
* Bias adaptation function as per section 3.4 of RFC 3492. |
|
* http://tools.ietf.org/html/rfc3492#section-3.4 |
|
* @private |
|
*/ |
|
function adapt(delta, numPoints, firstTime) { |
|
var k = 0; |
|
delta = firstTime ? floor(delta / damp) : delta >> 1; |
|
delta += floor(delta / numPoints); |
|
for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) { |
|
delta = floor(delta / baseMinusTMin); |
|
} |
|
return floor(k + (baseMinusTMin + 1) * delta / (delta + skew)); |
|
} |
|
|
|
/** |
|
* Converts a Punycode string of ASCII-only symbols to a string of Unicode |
|
* symbols. |
|
* @memberOf punycode |
|
* @param {String} input The Punycode string of ASCII-only symbols. |
|
* @returns {String} The resulting string of Unicode symbols. |
|
*/ |
|
function decode(input) { |
|
// Don't use UCS-2 |
|
var output = [], |
|
inputLength = input.length, |
|
out, |
|
i = 0, |
|
n = initialN, |
|
bias = initialBias, |
|
basic, |
|
j, |
|
index, |
|
oldi, |
|
w, |
|
k, |
|
digit, |
|
t, |
|
/** Cached calculation results */ |
|
baseMinusT; |
|
|
|
// Handle the basic code points: let `basic` be the number of input code |
|
// points before the last delimiter, or `0` if there is none, then copy |
|
// the first basic code points to the output. |
|
|
|
basic = input.lastIndexOf(delimiter); |
|
if (basic < 0) { |
|
basic = 0; |
|
} |
|
|
|
for (j = 0; j < basic; ++j) { |
|
// if it's not a basic code point |
|
if (input.charCodeAt(j) >= 0x80) { |
|
error('not-basic'); |
|
} |
|
output.push(input.charCodeAt(j)); |
|
} |
|
|
|
// Main decoding loop: start just after the last delimiter if any basic code |
|
// points were copied; start at the beginning otherwise. |
|
|
|
for (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) { |
|
|
|
// `index` is the index of the next character to be consumed. |
|
// Decode a generalized variable-length integer into `delta`, |
|
// which gets added to `i`. The overflow checking is easier |
|
// if we increase `i` as we go, then subtract off its starting |
|
// value at the end to obtain `delta`. |
|
for (oldi = i, w = 1, k = base; /* no condition */; k += base) { |
|
|
|
if (index >= inputLength) { |
|
error('invalid-input'); |
|
} |
|
|
|
digit = basicToDigit(input.charCodeAt(index++)); |
|
|
|
if (digit >= base || digit > floor((maxInt - i) / w)) { |
|
error('overflow'); |
|
} |
|
|
|
i += digit * w; |
|
t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); |
|
|
|
if (digit < t) { |
|
break; |
|
} |
|
|
|
baseMinusT = base - t; |
|
if (w > floor(maxInt / baseMinusT)) { |
|
error('overflow'); |
|
} |
|
|
|
w *= baseMinusT; |
|
|
|
} |
|
|
|
out = output.length + 1; |
|
bias = adapt(i - oldi, out, oldi == 0); |
|
|
|
// `i` was supposed to wrap around from `out` to `0`, |
|
// incrementing `n` each time, so we'll fix that now: |
|
if (floor(i / out) > maxInt - n) { |
|
error('overflow'); |
|
} |
|
|
|
n += floor(i / out); |
|
i %= out; |
|
|
|
// Insert `n` at position `i` of the output |
|
output.splice(i++, 0, n); |
|
|
|
} |
|
|
|
return ucs2encode(output); |
|
} |
|
|
|
/** |
|
* Converts a string of Unicode symbols to a Punycode string of ASCII-only |
|
* symbols. |
|
* @memberOf punycode |
|
* @param {String} input The string of Unicode symbols. |
|
* @returns {String} The resulting Punycode string of ASCII-only symbols. |
|
*/ |
|
function encode(input) { |
|
var n, |
|
delta, |
|
handledCPCount, |
|
basicLength, |
|
bias, |
|
j, |
|
m, |
|
q, |
|
k, |
|
t, |
|
currentValue, |
|
output = [], |
|
/** `inputLength` will hold the number of code points in `input`. */ |
|
inputLength, |
|
/** Cached calculation results */ |
|
handledCPCountPlusOne, |
|
baseMinusT, |
|
qMinusT; |
|
|
|
// Convert the input in UCS-2 to Unicode |
|
input = ucs2decode(input); |
|
|
|
// Cache the length |
|
inputLength = input.length; |
|
|
|
// Initialize the state |
|
n = initialN; |
|
delta = 0; |
|
bias = initialBias; |
|
|
|
// Handle the basic code points |
|
for (j = 0; j < inputLength; ++j) { |
|
currentValue = input[j]; |
|
if (currentValue < 0x80) { |
|
output.push(stringFromCharCode(currentValue)); |
|
} |
|
} |
|
|
|
handledCPCount = basicLength = output.length; |
|
|
|
// `handledCPCount` is the number of code points that have been handled; |
|
// `basicLength` is the number of basic code points. |
|
|
|
// Finish the basic string - if it is not empty - with a delimiter |
|
if (basicLength) { |
|
output.push(delimiter); |
|
} |
|
|
|
// Main encoding loop: |
|
while (handledCPCount < inputLength) { |
|
|
|
// All non-basic code points < n have been handled already. Find the next |
|
// larger one: |
|
for (m = maxInt, j = 0; j < inputLength; ++j) { |
|
currentValue = input[j]; |
|
if (currentValue >= n && currentValue < m) { |
|
m = currentValue; |
|
} |
|
} |
|
|
|
// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>, |
|
// but guard against overflow |
|
handledCPCountPlusOne = handledCPCount + 1; |
|
if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) { |
|
error('overflow'); |
|
} |
|
|
|
delta += (m - n) * handledCPCountPlusOne; |
|
n = m; |
|
|
|
for (j = 0; j < inputLength; ++j) { |
|
currentValue = input[j]; |
|
|
|
if (currentValue < n && ++delta > maxInt) { |
|
error('overflow'); |
|
} |
|
|
|
if (currentValue == n) { |
|
// Represent delta as a generalized variable-length integer |
|
for (q = delta, k = base; /* no condition */; k += base) { |
|
t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); |
|
if (q < t) { |
|
break; |
|
} |
|
qMinusT = q - t; |
|
baseMinusT = base - t; |
|
output.push( |
|
stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)) |
|
); |
|
q = floor(qMinusT / baseMinusT); |
|
} |
|
|
|
output.push(stringFromCharCode(digitToBasic(q, 0))); |
|
bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength); |
|
delta = 0; |
|
++handledCPCount; |
|
} |
|
} |
|
|
|
++delta; |
|
++n; |
|
|
|
} |
|
return output.join(''); |
|
} |
|
|
|
/** |
|
* Converts a Punycode string representing a domain name to Unicode. Only the |
|
* Punycoded parts of the domain name will be converted, i.e. it doesn't |
|
* matter if you call it on a string that has already been converted to |
|
* Unicode. |
|
* @memberOf punycode |
|
* @param {String} domain The Punycode domain name to convert to Unicode. |
|
* @returns {String} The Unicode representation of the given Punycode |
|
* string. |
|
*/ |
|
function toUnicode(domain) { |
|
return mapDomain(domain, function(string) { |
|
return regexPunycode.test(string) |
|
? decode(string.slice(4).toLowerCase()) |
|
: string; |
|
}); |
|
} |
|
|
|
/** |
|
* Converts a Unicode string representing a domain name to Punycode. Only the |
|
* non-ASCII parts of the domain name will be converted, i.e. it doesn't |
|
* matter if you call it with a domain that's already in ASCII. |
|
* @memberOf punycode |
|
* @param {String} domain The domain name to convert, as a Unicode string. |
|
* @returns {String} The Punycode representation of the given domain name. |
|
*/ |
|
function toASCII(domain) { |
|
return mapDomain(domain, function(string) { |
|
return regexNonASCII.test(string) |
|
? 'xn--' + encode(string) |
|
: string; |
|
}); |
|
} |
|
|
|
/*--------------------------------------------------------------------------*/ |
|
|
|
/** Define the public API */ |
|
punycode = { |
|
/** |
|
* A string representing the current Punycode.js version number. |
|
* @memberOf punycode |
|
* @type String |
|
*/ |
|
'version': '1.2.4', |
|
/** |
|
* An object of methods to convert from JavaScript's internal character |
|
* representation (UCS-2) to Unicode code points, and back. |
|
* @see <http://mathiasbynens.be/notes/javascript-encoding> |
|
* @memberOf punycode |
|
* @type Object |
|
*/ |
|
'ucs2': { |
|
'decode': ucs2decode, |
|
'encode': ucs2encode |
|
}, |
|
'decode': decode, |
|
'encode': encode, |
|
'toASCII': toASCII, |
|
'toUnicode': toUnicode |
|
}; |
|
|
|
/** Expose `punycode` */ |
|
// Some AMD build optimizers, like r.js, check for specific condition patterns |
|
// like the following: |
|
if ( |
|
typeof define == 'function' && |
|
typeof define.amd == 'object' && |
|
define.amd |
|
) { |
|
define('punycode', function() { |
|
return punycode; |
|
}); |
|
} else if (freeExports && !freeExports.nodeType) { |
|
if (freeModule) { // in Node.js or RingoJS v0.8.0+ |
|
freeModule.exports = punycode; |
|
} else { // in Narwhal or RingoJS v0.7.0- |
|
for (key in punycode) { |
|
punycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]); |
|
} |
|
} |
|
} else { // in Rhino or a web browser |
|
root.punycode = punycode; |
|
} |
|
|
|
}(this)); |
|
|
|
}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) |
|
},{}],325:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
'use strict'; |
|
|
|
// If obj.hasOwnProperty has been overridden, then calling |
|
// obj.hasOwnProperty(prop) will break. |
|
// See: https://github.com/joyent/node/issues/1707 |
|
function hasOwnProperty(obj, prop) { |
|
return Object.prototype.hasOwnProperty.call(obj, prop); |
|
} |
|
|
|
module.exports = function(qs, sep, eq, options) { |
|
sep = sep || '&'; |
|
eq = eq || '='; |
|
var obj = {}; |
|
|
|
if (typeof qs !== 'string' || qs.length === 0) { |
|
return obj; |
|
} |
|
|
|
var regexp = /\+/g; |
|
qs = qs.split(sep); |
|
|
|
var maxKeys = 1000; |
|
if (options && typeof options.maxKeys === 'number') { |
|
maxKeys = options.maxKeys; |
|
} |
|
|
|
var len = qs.length; |
|
// maxKeys <= 0 means that we should not limit keys count |
|
if (maxKeys > 0 && len > maxKeys) { |
|
len = maxKeys; |
|
} |
|
|
|
for (var i = 0; i < len; ++i) { |
|
var x = qs[i].replace(regexp, '%20'), |
|
idx = x.indexOf(eq), |
|
kstr, vstr, k, v; |
|
|
|
if (idx >= 0) { |
|
kstr = x.substr(0, idx); |
|
vstr = x.substr(idx + 1); |
|
} else { |
|
kstr = x; |
|
vstr = ''; |
|
} |
|
|
|
k = decodeURIComponent(kstr); |
|
v = decodeURIComponent(vstr); |
|
|
|
if (!hasOwnProperty(obj, k)) { |
|
obj[k] = v; |
|
} else if (isArray(obj[k])) { |
|
obj[k].push(v); |
|
} else { |
|
obj[k] = [obj[k], v]; |
|
} |
|
} |
|
|
|
return obj; |
|
}; |
|
|
|
var isArray = Array.isArray || function (xs) { |
|
return Object.prototype.toString.call(xs) === '[object Array]'; |
|
}; |
|
|
|
},{}],326:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
'use strict'; |
|
|
|
var stringifyPrimitive = function(v) { |
|
switch (typeof v) { |
|
case 'string': |
|
return v; |
|
|
|
case 'boolean': |
|
return v ? 'true' : 'false'; |
|
|
|
case 'number': |
|
return isFinite(v) ? v : ''; |
|
|
|
default: |
|
return ''; |
|
} |
|
}; |
|
|
|
module.exports = function(obj, sep, eq, name) { |
|
sep = sep || '&'; |
|
eq = eq || '='; |
|
if (obj === null) { |
|
obj = undefined; |
|
} |
|
|
|
if (typeof obj === 'object') { |
|
return map(objectKeys(obj), function(k) { |
|
var ks = encodeURIComponent(stringifyPrimitive(k)) + eq; |
|
if (isArray(obj[k])) { |
|
return map(obj[k], function(v) { |
|
return ks + encodeURIComponent(stringifyPrimitive(v)); |
|
}).join(sep); |
|
} else { |
|
return ks + encodeURIComponent(stringifyPrimitive(obj[k])); |
|
} |
|
}).join(sep); |
|
|
|
} |
|
|
|
if (!name) return ''; |
|
return encodeURIComponent(stringifyPrimitive(name)) + eq + |
|
encodeURIComponent(stringifyPrimitive(obj)); |
|
}; |
|
|
|
var isArray = Array.isArray || function (xs) { |
|
return Object.prototype.toString.call(xs) === '[object Array]'; |
|
}; |
|
|
|
function map (xs, f) { |
|
if (xs.map) return xs.map(f); |
|
var res = []; |
|
for (var i = 0; i < xs.length; i++) { |
|
res.push(f(xs[i], i)); |
|
} |
|
return res; |
|
} |
|
|
|
var objectKeys = Object.keys || function (obj) { |
|
var res = []; |
|
for (var key in obj) { |
|
if (Object.prototype.hasOwnProperty.call(obj, key)) res.push(key); |
|
} |
|
return res; |
|
}; |
|
|
|
},{}],327:[function(require,module,exports){ |
|
'use strict'; |
|
|
|
exports.decode = exports.parse = require('./decode'); |
|
exports.encode = exports.stringify = require('./encode'); |
|
|
|
},{"./decode":325,"./encode":326}],328:[function(require,module,exports){ |
|
arguments[4][65][0].apply(exports,arguments) |
|
},{"./lib/_stream_duplex.js":329,"dup":65}],329:[function(require,module,exports){ |
|
arguments[4][66][0].apply(exports,arguments) |
|
},{"./_stream_readable":331,"./_stream_writable":333,"_process":323,"core-util-is":334,"dup":66,"inherits":320}],330:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// a passthrough stream. |
|
// basically just the most minimal sort of Transform stream. |
|
// Every written chunk gets output as-is. |
|
|
|
module.exports = PassThrough; |
|
|
|
var Transform = require('./_stream_transform'); |
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
util.inherits(PassThrough, Transform); |
|
|
|
function PassThrough(options) { |
|
if (!(this instanceof PassThrough)) |
|
return new PassThrough(options); |
|
|
|
Transform.call(this, options); |
|
} |
|
|
|
PassThrough.prototype._transform = function(chunk, encoding, cb) { |
|
cb(null, chunk); |
|
}; |
|
|
|
},{"./_stream_transform":332,"core-util-is":334,"inherits":320}],331:[function(require,module,exports){ |
|
(function (process){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
module.exports = Readable; |
|
|
|
/*<replacement>*/ |
|
var isArray = require('isarray'); |
|
/*</replacement>*/ |
|
|
|
|
|
/*<replacement>*/ |
|
var Buffer = require('buffer').Buffer; |
|
/*</replacement>*/ |
|
|
|
Readable.ReadableState = ReadableState; |
|
|
|
var EE = require('events').EventEmitter; |
|
|
|
/*<replacement>*/ |
|
if (!EE.listenerCount) EE.listenerCount = function(emitter, type) { |
|
return emitter.listeners(type).length; |
|
}; |
|
/*</replacement>*/ |
|
|
|
var Stream = require('stream'); |
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
var StringDecoder; |
|
|
|
|
|
/*<replacement>*/ |
|
var debug = require('util'); |
|
if (debug && debug.debuglog) { |
|
debug = debug.debuglog('stream'); |
|
} else { |
|
debug = function () {}; |
|
} |
|
/*</replacement>*/ |
|
|
|
|
|
util.inherits(Readable, Stream); |
|
|
|
function ReadableState(options, stream) { |
|
var Duplex = require('./_stream_duplex'); |
|
|
|
options = options || {}; |
|
|
|
// the point at which it stops calling _read() to fill the buffer |
|
// Note: 0 is a valid value, means "don't call _read preemptively ever" |
|
var hwm = options.highWaterMark; |
|
var defaultHwm = options.objectMode ? 16 : 16 * 1024; |
|
this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm; |
|
|
|
// cast to ints. |
|
this.highWaterMark = ~~this.highWaterMark; |
|
|
|
this.buffer = []; |
|
this.length = 0; |
|
this.pipes = null; |
|
this.pipesCount = 0; |
|
this.flowing = null; |
|
this.ended = false; |
|
this.endEmitted = false; |
|
this.reading = false; |
|
|
|
// a flag to be able to tell if the onwrite cb is called immediately, |
|
// or on a later tick. We set this to true at first, because any |
|
// actions that shouldn't happen until "later" should generally also |
|
// not happen before the first write call. |
|
this.sync = true; |
|
|
|
// whenever we return null, then we set a flag to say |
|
// that we're awaiting a 'readable' event emission. |
|
this.needReadable = false; |
|
this.emittedReadable = false; |
|
this.readableListening = false; |
|
|
|
|
|
// object stream flag. Used to make read(n) ignore n and to |
|
// make all the buffer merging and length checks go away |
|
this.objectMode = !!options.objectMode; |
|
|
|
if (stream instanceof Duplex) |
|
this.objectMode = this.objectMode || !!options.readableObjectMode; |
|
|
|
// Crypto is kind of old and crusty. Historically, its default string |
|
// encoding is 'binary' so we have to make this configurable. |
|
// Everything else in the universe uses 'utf8', though. |
|
this.defaultEncoding = options.defaultEncoding || 'utf8'; |
|
|
|
// when piping, we only care about 'readable' events that happen |
|
// after read()ing all the bytes and not getting any pushback. |
|
this.ranOut = false; |
|
|
|
// the number of writers that are awaiting a drain event in .pipe()s |
|
this.awaitDrain = 0; |
|
|
|
// if true, a maybeReadMore has been scheduled |
|
this.readingMore = false; |
|
|
|
this.decoder = null; |
|
this.encoding = null; |
|
if (options.encoding) { |
|
if (!StringDecoder) |
|
StringDecoder = require('string_decoder/').StringDecoder; |
|
this.decoder = new StringDecoder(options.encoding); |
|
this.encoding = options.encoding; |
|
} |
|
} |
|
|
|
function Readable(options) { |
|
var Duplex = require('./_stream_duplex'); |
|
|
|
if (!(this instanceof Readable)) |
|
return new Readable(options); |
|
|
|
this._readableState = new ReadableState(options, this); |
|
|
|
// legacy |
|
this.readable = true; |
|
|
|
Stream.call(this); |
|
} |
|
|
|
// Manually shove something into the read() buffer. |
|
// This returns true if the highWaterMark has not been hit yet, |
|
// similar to how Writable.write() returns true if you should |
|
// write() some more. |
|
Readable.prototype.push = function(chunk, encoding) { |
|
var state = this._readableState; |
|
|
|
if (util.isString(chunk) && !state.objectMode) { |
|
encoding = encoding || state.defaultEncoding; |
|
if (encoding !== state.encoding) { |
|
chunk = new Buffer(chunk, encoding); |
|
encoding = ''; |
|
} |
|
} |
|
|
|
return readableAddChunk(this, state, chunk, encoding, false); |
|
}; |
|
|
|
// Unshift should *always* be something directly out of read() |
|
Readable.prototype.unshift = function(chunk) { |
|
var state = this._readableState; |
|
return readableAddChunk(this, state, chunk, '', true); |
|
}; |
|
|
|
function readableAddChunk(stream, state, chunk, encoding, addToFront) { |
|
var er = chunkInvalid(state, chunk); |
|
if (er) { |
|
stream.emit('error', er); |
|
} else if (util.isNullOrUndefined(chunk)) { |
|
state.reading = false; |
|
if (!state.ended) |
|
onEofChunk(stream, state); |
|
} else if (state.objectMode || chunk && chunk.length > 0) { |
|
if (state.ended && !addToFront) { |
|
var e = new Error('stream.push() after EOF'); |
|
stream.emit('error', e); |
|
} else if (state.endEmitted && addToFront) { |
|
var e = new Error('stream.unshift() after end event'); |
|
stream.emit('error', e); |
|
} else { |
|
if (state.decoder && !addToFront && !encoding) |
|
chunk = state.decoder.write(chunk); |
|
|
|
if (!addToFront) |
|
state.reading = false; |
|
|
|
// if we want the data now, just emit it. |
|
if (state.flowing && state.length === 0 && !state.sync) { |
|
stream.emit('data', chunk); |
|
stream.read(0); |
|
} else { |
|
// update the buffer info. |
|
state.length += state.objectMode ? 1 : chunk.length; |
|
if (addToFront) |
|
state.buffer.unshift(chunk); |
|
else |
|
state.buffer.push(chunk); |
|
|
|
if (state.needReadable) |
|
emitReadable(stream); |
|
} |
|
|
|
maybeReadMore(stream, state); |
|
} |
|
} else if (!addToFront) { |
|
state.reading = false; |
|
} |
|
|
|
return needMoreData(state); |
|
} |
|
|
|
|
|
|
|
// if it's past the high water mark, we can push in some more. |
|
// Also, if we have no data yet, we can stand some |
|
// more bytes. This is to work around cases where hwm=0, |
|
// such as the repl. Also, if the push() triggered a |
|
// readable event, and the user called read(largeNumber) such that |
|
// needReadable was set, then we ought to push more, so that another |
|
// 'readable' event will be triggered. |
|
function needMoreData(state) { |
|
return !state.ended && |
|
(state.needReadable || |
|
state.length < state.highWaterMark || |
|
state.length === 0); |
|
} |
|
|
|
// backwards compatibility. |
|
Readable.prototype.setEncoding = function(enc) { |
|
if (!StringDecoder) |
|
StringDecoder = require('string_decoder/').StringDecoder; |
|
this._readableState.decoder = new StringDecoder(enc); |
|
this._readableState.encoding = enc; |
|
return this; |
|
}; |
|
|
|
// Don't raise the hwm > 128MB |
|
var MAX_HWM = 0x800000; |
|
function roundUpToNextPowerOf2(n) { |
|
if (n >= MAX_HWM) { |
|
n = MAX_HWM; |
|
} else { |
|
// Get the next highest power of 2 |
|
n--; |
|
for (var p = 1; p < 32; p <<= 1) n |= n >> p; |
|
n++; |
|
} |
|
return n; |
|
} |
|
|
|
function howMuchToRead(n, state) { |
|
if (state.length === 0 && state.ended) |
|
return 0; |
|
|
|
if (state.objectMode) |
|
return n === 0 ? 0 : 1; |
|
|
|
if (isNaN(n) || util.isNull(n)) { |
|
// only flow one buffer at a time |
|
if (state.flowing && state.buffer.length) |
|
return state.buffer[0].length; |
|
else |
|
return state.length; |
|
} |
|
|
|
if (n <= 0) |
|
return 0; |
|
|
|
// If we're asking for more than the target buffer level, |
|
// then raise the water mark. Bump up to the next highest |
|
// power of 2, to prevent increasing it excessively in tiny |
|
// amounts. |
|
if (n > state.highWaterMark) |
|
state.highWaterMark = roundUpToNextPowerOf2(n); |
|
|
|
// don't have that much. return null, unless we've ended. |
|
if (n > state.length) { |
|
if (!state.ended) { |
|
state.needReadable = true; |
|
return 0; |
|
} else |
|
return state.length; |
|
} |
|
|
|
return n; |
|
} |
|
|
|
// you can override either this method, or the async _read(n) below. |
|
Readable.prototype.read = function(n) { |
|
debug('read', n); |
|
var state = this._readableState; |
|
var nOrig = n; |
|
|
|
if (!util.isNumber(n) || n > 0) |
|
state.emittedReadable = false; |
|
|
|
// if we're doing read(0) to trigger a readable event, but we |
|
// already have a bunch of data in the buffer, then just trigger |
|
// the 'readable' event and move on. |
|
if (n === 0 && |
|
state.needReadable && |
|
(state.length >= state.highWaterMark || state.ended)) { |
|
debug('read: emitReadable', state.length, state.ended); |
|
if (state.length === 0 && state.ended) |
|
endReadable(this); |
|
else |
|
emitReadable(this); |
|
return null; |
|
} |
|
|
|
n = howMuchToRead(n, state); |
|
|
|
// if we've ended, and we're now clear, then finish it up. |
|
if (n === 0 && state.ended) { |
|
if (state.length === 0) |
|
endReadable(this); |
|
return null; |
|
} |
|
|
|
// All the actual chunk generation logic needs to be |
|
// *below* the call to _read. The reason is that in certain |
|
// synthetic stream cases, such as passthrough streams, _read |
|
// may be a completely synchronous operation which may change |
|
// the state of the read buffer, providing enough data when |
|
// before there was *not* enough. |
|
// |
|
// So, the steps are: |
|
// 1. Figure out what the state of things will be after we do |
|
// a read from the buffer. |
|
// |
|
// 2. If that resulting state will trigger a _read, then call _read. |
|
// Note that this may be asynchronous, or synchronous. Yes, it is |
|
// deeply ugly to write APIs this way, but that still doesn't mean |
|
// that the Readable class should behave improperly, as streams are |
|
// designed to be sync/async agnostic. |
|
// Take note if the _read call is sync or async (ie, if the read call |
|
// has returned yet), so that we know whether or not it's safe to emit |
|
// 'readable' etc. |
|
// |
|
// 3. Actually pull the requested chunks out of the buffer and return. |
|
|
|
// if we need a readable event, then we need to do some reading. |
|
var doRead = state.needReadable; |
|
debug('need readable', doRead); |
|
|
|
// if we currently have less than the highWaterMark, then also read some |
|
if (state.length === 0 || state.length - n < state.highWaterMark) { |
|
doRead = true; |
|
debug('length less than watermark', doRead); |
|
} |
|
|
|
// however, if we've ended, then there's no point, and if we're already |
|
// reading, then it's unnecessary. |
|
if (state.ended || state.reading) { |
|
doRead = false; |
|
debug('reading or ended', doRead); |
|
} |
|
|
|
if (doRead) { |
|
debug('do read'); |
|
state.reading = true; |
|
state.sync = true; |
|
// if the length is currently zero, then we *need* a readable event. |
|
if (state.length === 0) |
|
state.needReadable = true; |
|
// call internal read method |
|
this._read(state.highWaterMark); |
|
state.sync = false; |
|
} |
|
|
|
// If _read pushed data synchronously, then `reading` will be false, |
|
// and we need to re-evaluate how much data we can return to the user. |
|
if (doRead && !state.reading) |
|
n = howMuchToRead(nOrig, state); |
|
|
|
var ret; |
|
if (n > 0) |
|
ret = fromList(n, state); |
|
else |
|
ret = null; |
|
|
|
if (util.isNull(ret)) { |
|
state.needReadable = true; |
|
n = 0; |
|
} |
|
|
|
state.length -= n; |
|
|
|
// If we have nothing in the buffer, then we want to know |
|
// as soon as we *do* get something into the buffer. |
|
if (state.length === 0 && !state.ended) |
|
state.needReadable = true; |
|
|
|
// If we tried to read() past the EOF, then emit end on the next tick. |
|
if (nOrig !== n && state.ended && state.length === 0) |
|
endReadable(this); |
|
|
|
if (!util.isNull(ret)) |
|
this.emit('data', ret); |
|
|
|
return ret; |
|
}; |
|
|
|
function chunkInvalid(state, chunk) { |
|
var er = null; |
|
if (!util.isBuffer(chunk) && |
|
!util.isString(chunk) && |
|
!util.isNullOrUndefined(chunk) && |
|
!state.objectMode) { |
|
er = new TypeError('Invalid non-string/buffer chunk'); |
|
} |
|
return er; |
|
} |
|
|
|
|
|
function onEofChunk(stream, state) { |
|
if (state.decoder && !state.ended) { |
|
var chunk = state.decoder.end(); |
|
if (chunk && chunk.length) { |
|
state.buffer.push(chunk); |
|
state.length += state.objectMode ? 1 : chunk.length; |
|
} |
|
} |
|
state.ended = true; |
|
|
|
// emit 'readable' now to make sure it gets picked up. |
|
emitReadable(stream); |
|
} |
|
|
|
// Don't emit readable right away in sync mode, because this can trigger |
|
// another read() call => stack overflow. This way, it might trigger |
|
// a nextTick recursion warning, but that's not so bad. |
|
function emitReadable(stream) { |
|
var state = stream._readableState; |
|
state.needReadable = false; |
|
if (!state.emittedReadable) { |
|
debug('emitReadable', state.flowing); |
|
state.emittedReadable = true; |
|
if (state.sync) |
|
process.nextTick(function() { |
|
emitReadable_(stream); |
|
}); |
|
else |
|
emitReadable_(stream); |
|
} |
|
} |
|
|
|
function emitReadable_(stream) { |
|
debug('emit readable'); |
|
stream.emit('readable'); |
|
flow(stream); |
|
} |
|
|
|
|
|
// at this point, the user has presumably seen the 'readable' event, |
|
// and called read() to consume some data. that may have triggered |
|
// in turn another _read(n) call, in which case reading = true if |
|
// it's in progress. |
|
// However, if we're not ended, or reading, and the length < hwm, |
|
// then go ahead and try to read some more preemptively. |
|
function maybeReadMore(stream, state) { |
|
if (!state.readingMore) { |
|
state.readingMore = true; |
|
process.nextTick(function() { |
|
maybeReadMore_(stream, state); |
|
}); |
|
} |
|
} |
|
|
|
function maybeReadMore_(stream, state) { |
|
var len = state.length; |
|
while (!state.reading && !state.flowing && !state.ended && |
|
state.length < state.highWaterMark) { |
|
debug('maybeReadMore read 0'); |
|
stream.read(0); |
|
if (len === state.length) |
|
// didn't get any data, stop spinning. |
|
break; |
|
else |
|
len = state.length; |
|
} |
|
state.readingMore = false; |
|
} |
|
|
|
// abstract method. to be overridden in specific implementation classes. |
|
// call cb(er, data) where data is <= n in length. |
|
// for virtual (non-string, non-buffer) streams, "length" is somewhat |
|
// arbitrary, and perhaps not very meaningful. |
|
Readable.prototype._read = function(n) { |
|
this.emit('error', new Error('not implemented')); |
|
}; |
|
|
|
Readable.prototype.pipe = function(dest, pipeOpts) { |
|
var src = this; |
|
var state = this._readableState; |
|
|
|
switch (state.pipesCount) { |
|
case 0: |
|
state.pipes = dest; |
|
break; |
|
case 1: |
|
state.pipes = [state.pipes, dest]; |
|
break; |
|
default: |
|
state.pipes.push(dest); |
|
break; |
|
} |
|
state.pipesCount += 1; |
|
debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); |
|
|
|
var doEnd = (!pipeOpts || pipeOpts.end !== false) && |
|
dest !== process.stdout && |
|
dest !== process.stderr; |
|
|
|
var endFn = doEnd ? onend : cleanup; |
|
if (state.endEmitted) |
|
process.nextTick(endFn); |
|
else |
|
src.once('end', endFn); |
|
|
|
dest.on('unpipe', onunpipe); |
|
function onunpipe(readable) { |
|
debug('onunpipe'); |
|
if (readable === src) { |
|
cleanup(); |
|
} |
|
} |
|
|
|
function onend() { |
|
debug('onend'); |
|
dest.end(); |
|
} |
|
|
|
// when the dest drains, it reduces the awaitDrain counter |
|
// on the source. This would be more elegant with a .once() |
|
// handler in flow(), but adding and removing repeatedly is |
|
// too slow. |
|
var ondrain = pipeOnDrain(src); |
|
dest.on('drain', ondrain); |
|
|
|
function cleanup() { |
|
debug('cleanup'); |
|
// cleanup event handlers once the pipe is broken |
|
dest.removeListener('close', onclose); |
|
dest.removeListener('finish', onfinish); |
|
dest.removeListener('drain', ondrain); |
|
dest.removeListener('error', onerror); |
|
dest.removeListener('unpipe', onunpipe); |
|
src.removeListener('end', onend); |
|
src.removeListener('end', cleanup); |
|
src.removeListener('data', ondata); |
|
|
|
// if the reader is waiting for a drain event from this |
|
// specific writer, then it would cause it to never start |
|
// flowing again. |
|
// So, if this is awaiting a drain, then we just call it now. |
|
// If we don't know, then assume that we are waiting for one. |
|
if (state.awaitDrain && |
|
(!dest._writableState || dest._writableState.needDrain)) |
|
ondrain(); |
|
} |
|
|
|
src.on('data', ondata); |
|
function ondata(chunk) { |
|
debug('ondata'); |
|
var ret = dest.write(chunk); |
|
if (false === ret) { |
|
debug('false write response, pause', |
|
src._readableState.awaitDrain); |
|
src._readableState.awaitDrain++; |
|
src.pause(); |
|
} |
|
} |
|
|
|
// if the dest has an error, then stop piping into it. |
|
// however, don't suppress the throwing behavior for this. |
|
function onerror(er) { |
|
debug('onerror', er); |
|
unpipe(); |
|
dest.removeListener('error', onerror); |
|
if (EE.listenerCount(dest, 'error') === 0) |
|
dest.emit('error', er); |
|
} |
|
// This is a brutally ugly hack to make sure that our error handler |
|
// is attached before any userland ones. NEVER DO THIS. |
|
if (!dest._events || !dest._events.error) |
|
dest.on('error', onerror); |
|
else if (isArray(dest._events.error)) |
|
dest._events.error.unshift(onerror); |
|
else |
|
dest._events.error = [onerror, dest._events.error]; |
|
|
|
|
|
|
|
// Both close and finish should trigger unpipe, but only once. |
|
function onclose() { |
|
dest.removeListener('finish', onfinish); |
|
unpipe(); |
|
} |
|
dest.once('close', onclose); |
|
function onfinish() { |
|
debug('onfinish'); |
|
dest.removeListener('close', onclose); |
|
unpipe(); |
|
} |
|
dest.once('finish', onfinish); |
|
|
|
function unpipe() { |
|
debug('unpipe'); |
|
src.unpipe(dest); |
|
} |
|
|
|
// tell the dest that it's being piped to |
|
dest.emit('pipe', src); |
|
|
|
// start the flow if it hasn't been started already. |
|
if (!state.flowing) { |
|
debug('pipe resume'); |
|
src.resume(); |
|
} |
|
|
|
return dest; |
|
}; |
|
|
|
function pipeOnDrain(src) { |
|
return function() { |
|
var state = src._readableState; |
|
debug('pipeOnDrain', state.awaitDrain); |
|
if (state.awaitDrain) |
|
state.awaitDrain--; |
|
if (state.awaitDrain === 0 && EE.listenerCount(src, 'data')) { |
|
state.flowing = true; |
|
flow(src); |
|
} |
|
}; |
|
} |
|
|
|
|
|
Readable.prototype.unpipe = function(dest) { |
|
var state = this._readableState; |
|
|
|
// if we're not piping anywhere, then do nothing. |
|
if (state.pipesCount === 0) |
|
return this; |
|
|
|
// just one destination. most common case. |
|
if (state.pipesCount === 1) { |
|
// passed in one, but it's not the right one. |
|
if (dest && dest !== state.pipes) |
|
return this; |
|
|
|
if (!dest) |
|
dest = state.pipes; |
|
|
|
// got a match. |
|
state.pipes = null; |
|
state.pipesCount = 0; |
|
state.flowing = false; |
|
if (dest) |
|
dest.emit('unpipe', this); |
|
return this; |
|
} |
|
|
|
// slow case. multiple pipe destinations. |
|
|
|
if (!dest) { |
|
// remove all. |
|
var dests = state.pipes; |
|
var len = state.pipesCount; |
|
state.pipes = null; |
|
state.pipesCount = 0; |
|
state.flowing = false; |
|
|
|
for (var i = 0; i < len; i++) |
|
dests[i].emit('unpipe', this); |
|
return this; |
|
} |
|
|
|
// try to find the right one. |
|
var i = indexOf(state.pipes, dest); |
|
if (i === -1) |
|
return this; |
|
|
|
state.pipes.splice(i, 1); |
|
state.pipesCount -= 1; |
|
if (state.pipesCount === 1) |
|
state.pipes = state.pipes[0]; |
|
|
|
dest.emit('unpipe', this); |
|
|
|
return this; |
|
}; |
|
|
|
// set up data events if they are asked for |
|
// Ensure readable listeners eventually get something |
|
Readable.prototype.on = function(ev, fn) { |
|
var res = Stream.prototype.on.call(this, ev, fn); |
|
|
|
// If listening to data, and it has not explicitly been paused, |
|
// then call resume to start the flow of data on the next tick. |
|
if (ev === 'data' && false !== this._readableState.flowing) { |
|
this.resume(); |
|
} |
|
|
|
if (ev === 'readable' && this.readable) { |
|
var state = this._readableState; |
|
if (!state.readableListening) { |
|
state.readableListening = true; |
|
state.emittedReadable = false; |
|
state.needReadable = true; |
|
if (!state.reading) { |
|
var self = this; |
|
process.nextTick(function() { |
|
debug('readable nexttick read 0'); |
|
self.read(0); |
|
}); |
|
} else if (state.length) { |
|
emitReadable(this, state); |
|
} |
|
} |
|
} |
|
|
|
return res; |
|
}; |
|
Readable.prototype.addListener = Readable.prototype.on; |
|
|
|
// pause() and resume() are remnants of the legacy readable stream API |
|
// If the user uses them, then switch into old mode. |
|
Readable.prototype.resume = function() { |
|
var state = this._readableState; |
|
if (!state.flowing) { |
|
debug('resume'); |
|
state.flowing = true; |
|
if (!state.reading) { |
|
debug('resume read 0'); |
|
this.read(0); |
|
} |
|
resume(this, state); |
|
} |
|
return this; |
|
}; |
|
|
|
function resume(stream, state) { |
|
if (!state.resumeScheduled) { |
|
state.resumeScheduled = true; |
|
process.nextTick(function() { |
|
resume_(stream, state); |
|
}); |
|
} |
|
} |
|
|
|
function resume_(stream, state) { |
|
state.resumeScheduled = false; |
|
stream.emit('resume'); |
|
flow(stream); |
|
if (state.flowing && !state.reading) |
|
stream.read(0); |
|
} |
|
|
|
Readable.prototype.pause = function() { |
|
debug('call pause flowing=%j', this._readableState.flowing); |
|
if (false !== this._readableState.flowing) { |
|
debug('pause'); |
|
this._readableState.flowing = false; |
|
this.emit('pause'); |
|
} |
|
return this; |
|
}; |
|
|
|
function flow(stream) { |
|
var state = stream._readableState; |
|
debug('flow', state.flowing); |
|
if (state.flowing) { |
|
do { |
|
var chunk = stream.read(); |
|
} while (null !== chunk && state.flowing); |
|
} |
|
} |
|
|
|
// wrap an old-style stream as the async data source. |
|
// This is *not* part of the readable stream interface. |
|
// It is an ugly unfortunate mess of history. |
|
Readable.prototype.wrap = function(stream) { |
|
var state = this._readableState; |
|
var paused = false; |
|
|
|
var self = this; |
|
stream.on('end', function() { |
|
debug('wrapped end'); |
|
if (state.decoder && !state.ended) { |
|
var chunk = state.decoder.end(); |
|
if (chunk && chunk.length) |
|
self.push(chunk); |
|
} |
|
|
|
self.push(null); |
|
}); |
|
|
|
stream.on('data', function(chunk) { |
|
debug('wrapped data'); |
|
if (state.decoder) |
|
chunk = state.decoder.write(chunk); |
|
if (!chunk || !state.objectMode && !chunk.length) |
|
return; |
|
|
|
var ret = self.push(chunk); |
|
if (!ret) { |
|
paused = true; |
|
stream.pause(); |
|
} |
|
}); |
|
|
|
// proxy all the other methods. |
|
// important when wrapping filters and duplexes. |
|
for (var i in stream) { |
|
if (util.isFunction(stream[i]) && util.isUndefined(this[i])) { |
|
this[i] = function(method) { return function() { |
|
return stream[method].apply(stream, arguments); |
|
}}(i); |
|
} |
|
} |
|
|
|
// proxy certain important events. |
|
var events = ['error', 'close', 'destroy', 'pause', 'resume']; |
|
forEach(events, function(ev) { |
|
stream.on(ev, self.emit.bind(self, ev)); |
|
}); |
|
|
|
// when we try to consume some more bytes, simply unpause the |
|
// underlying stream. |
|
self._read = function(n) { |
|
debug('wrapped _read', n); |
|
if (paused) { |
|
paused = false; |
|
stream.resume(); |
|
} |
|
}; |
|
|
|
return self; |
|
}; |
|
|
|
|
|
|
|
// exposed for testing purposes only. |
|
Readable._fromList = fromList; |
|
|
|
// Pluck off n bytes from an array of buffers. |
|
// Length is the combined lengths of all the buffers in the list. |
|
function fromList(n, state) { |
|
var list = state.buffer; |
|
var length = state.length; |
|
var stringMode = !!state.decoder; |
|
var objectMode = !!state.objectMode; |
|
var ret; |
|
|
|
// nothing in the list, definitely empty. |
|
if (list.length === 0) |
|
return null; |
|
|
|
if (length === 0) |
|
ret = null; |
|
else if (objectMode) |
|
ret = list.shift(); |
|
else if (!n || n >= length) { |
|
// read it all, truncate the array. |
|
if (stringMode) |
|
ret = list.join(''); |
|
else |
|
ret = Buffer.concat(list, length); |
|
list.length = 0; |
|
} else { |
|
// read just some of it. |
|
if (n < list[0].length) { |
|
// just take a part of the first list item. |
|
// slice is the same for buffers and strings. |
|
var buf = list[0]; |
|
ret = buf.slice(0, n); |
|
list[0] = buf.slice(n); |
|
} else if (n === list[0].length) { |
|
// first list is a perfect match |
|
ret = list.shift(); |
|
} else { |
|
// complex case. |
|
// we have enough to cover it, but it spans past the first buffer. |
|
if (stringMode) |
|
ret = ''; |
|
else |
|
ret = new Buffer(n); |
|
|
|
var c = 0; |
|
for (var i = 0, l = list.length; i < l && c < n; i++) { |
|
var buf = list[0]; |
|
var cpy = Math.min(n - c, buf.length); |
|
|
|
if (stringMode) |
|
ret += buf.slice(0, cpy); |
|
else |
|
buf.copy(ret, c, 0, cpy); |
|
|
|
if (cpy < buf.length) |
|
list[0] = buf.slice(cpy); |
|
else |
|
list.shift(); |
|
|
|
c += cpy; |
|
} |
|
} |
|
} |
|
|
|
return ret; |
|
} |
|
|
|
function endReadable(stream) { |
|
var state = stream._readableState; |
|
|
|
// If we get here before consuming all the bytes, then that is a |
|
// bug in node. Should never happen. |
|
if (state.length > 0) |
|
throw new Error('endReadable called on non-empty stream'); |
|
|
|
if (!state.endEmitted) { |
|
state.ended = true; |
|
process.nextTick(function() { |
|
// Check that we didn't get one last unshift. |
|
if (!state.endEmitted && state.length === 0) { |
|
state.endEmitted = true; |
|
stream.readable = false; |
|
stream.emit('end'); |
|
} |
|
}); |
|
} |
|
} |
|
|
|
function forEach (xs, f) { |
|
for (var i = 0, l = xs.length; i < l; i++) { |
|
f(xs[i], i); |
|
} |
|
} |
|
|
|
function indexOf (xs, x) { |
|
for (var i = 0, l = xs.length; i < l; i++) { |
|
if (xs[i] === x) return i; |
|
} |
|
return -1; |
|
} |
|
|
|
}).call(this,require('_process')) |
|
},{"./_stream_duplex":329,"_process":323,"buffer":172,"core-util-is":334,"events":314,"inherits":320,"isarray":321,"stream":339,"string_decoder/":340,"util":158}],332:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
|
|
// a transform stream is a readable/writable stream where you do |
|
// something with the data. Sometimes it's called a "filter", |
|
// but that's not a great name for it, since that implies a thing where |
|
// some bits pass through, and others are simply ignored. (That would |
|
// be a valid example of a transform, of course.) |
|
// |
|
// While the output is causally related to the input, it's not a |
|
// necessarily symmetric or synchronous transformation. For example, |
|
// a zlib stream might take multiple plain-text writes(), and then |
|
// emit a single compressed chunk some time in the future. |
|
// |
|
// Here's how this works: |
|
// |
|
// The Transform stream has all the aspects of the readable and writable |
|
// stream classes. When you write(chunk), that calls _write(chunk,cb) |
|
// internally, and returns false if there's a lot of pending writes |
|
// buffered up. When you call read(), that calls _read(n) until |
|
// there's enough pending readable data buffered up. |
|
// |
|
// In a transform stream, the written data is placed in a buffer. When |
|
// _read(n) is called, it transforms the queued up data, calling the |
|
// buffered _write cb's as it consumes chunks. If consuming a single |
|
// written chunk would result in multiple output chunks, then the first |
|
// outputted bit calls the readcb, and subsequent chunks just go into |
|
// the read buffer, and will cause it to emit 'readable' if necessary. |
|
// |
|
// This way, back-pressure is actually determined by the reading side, |
|
// since _read has to be called to start processing a new chunk. However, |
|
// a pathological inflate type of transform can cause excessive buffering |
|
// here. For example, imagine a stream where every byte of input is |
|
// interpreted as an integer from 0-255, and then results in that many |
|
// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in |
|
// 1kb of data being output. In this case, you could write a very small |
|
// amount of input, and end up with a very large amount of output. In |
|
// such a pathological inflating mechanism, there'd be no way to tell |
|
// the system to stop doing the transform. A single 4MB write could |
|
// cause the system to run out of memory. |
|
// |
|
// However, even in such a pathological case, only a single written chunk |
|
// would be consumed, and then the rest would wait (un-transformed) until |
|
// the results of the previous transformed chunk were consumed. |
|
|
|
module.exports = Transform; |
|
|
|
var Duplex = require('./_stream_duplex'); |
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
util.inherits(Transform, Duplex); |
|
|
|
|
|
function TransformState(options, stream) { |
|
this.afterTransform = function(er, data) { |
|
return afterTransform(stream, er, data); |
|
}; |
|
|
|
this.needTransform = false; |
|
this.transforming = false; |
|
this.writecb = null; |
|
this.writechunk = null; |
|
} |
|
|
|
function afterTransform(stream, er, data) { |
|
var ts = stream._transformState; |
|
ts.transforming = false; |
|
|
|
var cb = ts.writecb; |
|
|
|
if (!cb) |
|
return stream.emit('error', new Error('no writecb in Transform class')); |
|
|
|
ts.writechunk = null; |
|
ts.writecb = null; |
|
|
|
if (!util.isNullOrUndefined(data)) |
|
stream.push(data); |
|
|
|
if (cb) |
|
cb(er); |
|
|
|
var rs = stream._readableState; |
|
rs.reading = false; |
|
if (rs.needReadable || rs.length < rs.highWaterMark) { |
|
stream._read(rs.highWaterMark); |
|
} |
|
} |
|
|
|
|
|
function Transform(options) { |
|
if (!(this instanceof Transform)) |
|
return new Transform(options); |
|
|
|
Duplex.call(this, options); |
|
|
|
this._transformState = new TransformState(options, this); |
|
|
|
// when the writable side finishes, then flush out anything remaining. |
|
var stream = this; |
|
|
|
// start out asking for a readable event once data is transformed. |
|
this._readableState.needReadable = true; |
|
|
|
// we have implemented the _read method, and done the other things |
|
// that Readable wants before the first _read call, so unset the |
|
// sync guard flag. |
|
this._readableState.sync = false; |
|
|
|
this.once('prefinish', function() { |
|
if (util.isFunction(this._flush)) |
|
this._flush(function(er) { |
|
done(stream, er); |
|
}); |
|
else |
|
done(stream); |
|
}); |
|
} |
|
|
|
Transform.prototype.push = function(chunk, encoding) { |
|
this._transformState.needTransform = false; |
|
return Duplex.prototype.push.call(this, chunk, encoding); |
|
}; |
|
|
|
// This is the part where you do stuff! |
|
// override this function in implementation classes. |
|
// 'chunk' is an input chunk. |
|
// |
|
// Call `push(newChunk)` to pass along transformed output |
|
// to the readable side. You may call 'push' zero or more times. |
|
// |
|
// Call `cb(err)` when you are done with this chunk. If you pass |
|
// an error, then that'll put the hurt on the whole operation. If you |
|
// never call cb(), then you'll never get another chunk. |
|
Transform.prototype._transform = function(chunk, encoding, cb) { |
|
throw new Error('not implemented'); |
|
}; |
|
|
|
Transform.prototype._write = function(chunk, encoding, cb) { |
|
var ts = this._transformState; |
|
ts.writecb = cb; |
|
ts.writechunk = chunk; |
|
ts.writeencoding = encoding; |
|
if (!ts.transforming) { |
|
var rs = this._readableState; |
|
if (ts.needTransform || |
|
rs.needReadable || |
|
rs.length < rs.highWaterMark) |
|
this._read(rs.highWaterMark); |
|
} |
|
}; |
|
|
|
// Doesn't matter what the args are here. |
|
// _transform does all the work. |
|
// That we got here means that the readable side wants more data. |
|
Transform.prototype._read = function(n) { |
|
var ts = this._transformState; |
|
|
|
if (!util.isNull(ts.writechunk) && ts.writecb && !ts.transforming) { |
|
ts.transforming = true; |
|
this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform); |
|
} else { |
|
// mark that we need a transform, so that any data that comes in |
|
// will get processed, now that we've asked for it. |
|
ts.needTransform = true; |
|
} |
|
}; |
|
|
|
|
|
function done(stream, er) { |
|
if (er) |
|
return stream.emit('error', er); |
|
|
|
// if there's nothing in the write buffer, then that means |
|
// that nothing more will ever be provided |
|
var ws = stream._writableState; |
|
var ts = stream._transformState; |
|
|
|
if (ws.length) |
|
throw new Error('calling transform done when ws.length != 0'); |
|
|
|
if (ts.transforming) |
|
throw new Error('calling transform done when still transforming'); |
|
|
|
return stream.push(null); |
|
} |
|
|
|
},{"./_stream_duplex":329,"core-util-is":334,"inherits":320}],333:[function(require,module,exports){ |
|
(function (process){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
// A bit simpler than readable streams. |
|
// Implement an async ._write(chunk, cb), and it'll handle all |
|
// the drain event emission and buffering. |
|
|
|
module.exports = Writable; |
|
|
|
/*<replacement>*/ |
|
var Buffer = require('buffer').Buffer; |
|
/*</replacement>*/ |
|
|
|
Writable.WritableState = WritableState; |
|
|
|
|
|
/*<replacement>*/ |
|
var util = require('core-util-is'); |
|
util.inherits = require('inherits'); |
|
/*</replacement>*/ |
|
|
|
var Stream = require('stream'); |
|
|
|
util.inherits(Writable, Stream); |
|
|
|
function WriteReq(chunk, encoding, cb) { |
|
this.chunk = chunk; |
|
this.encoding = encoding; |
|
this.callback = cb; |
|
} |
|
|
|
function WritableState(options, stream) { |
|
var Duplex = require('./_stream_duplex'); |
|
|
|
options = options || {}; |
|
|
|
// the point at which write() starts returning false |
|
// Note: 0 is a valid value, means that we always return false if |
|
// the entire buffer is not flushed immediately on write() |
|
var hwm = options.highWaterMark; |
|
var defaultHwm = options.objectMode ? 16 : 16 * 1024; |
|
this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm; |
|
|
|
// object stream flag to indicate whether or not this stream |
|
// contains buffers or objects. |
|
this.objectMode = !!options.objectMode; |
|
|
|
if (stream instanceof Duplex) |
|
this.objectMode = this.objectMode || !!options.writableObjectMode; |
|
|
|
// cast to ints. |
|
this.highWaterMark = ~~this.highWaterMark; |
|
|
|
this.needDrain = false; |
|
// at the start of calling end() |
|
this.ending = false; |
|
// when end() has been called, and returned |
|
this.ended = false; |
|
// when 'finish' is emitted |
|
this.finished = false; |
|
|
|
// should we decode strings into buffers before passing to _write? |
|
// this is here so that some node-core streams can optimize string |
|
// handling at a lower level. |
|
var noDecode = options.decodeStrings === false; |
|
this.decodeStrings = !noDecode; |
|
|
|
// Crypto is kind of old and crusty. Historically, its default string |
|
// encoding is 'binary' so we have to make this configurable. |
|
// Everything else in the universe uses 'utf8', though. |
|
this.defaultEncoding = options.defaultEncoding || 'utf8'; |
|
|
|
// not an actual buffer we keep track of, but a measurement |
|
// of how much we're waiting to get pushed to some underlying |
|
// socket or file. |
|
this.length = 0; |
|
|
|
// a flag to see when we're in the middle of a write. |
|
this.writing = false; |
|
|
|
// when true all writes will be buffered until .uncork() call |
|
this.corked = 0; |
|
|
|
// a flag to be able to tell if the onwrite cb is called immediately, |
|
// or on a later tick. We set this to true at first, because any |
|
// actions that shouldn't happen until "later" should generally also |
|
// not happen before the first write call. |
|
this.sync = true; |
|
|
|
// a flag to know if we're processing previously buffered items, which |
|
// may call the _write() callback in the same tick, so that we don't |
|
// end up in an overlapped onwrite situation. |
|
this.bufferProcessing = false; |
|
|
|
// the callback that's passed to _write(chunk,cb) |
|
this.onwrite = function(er) { |
|
onwrite(stream, er); |
|
}; |
|
|
|
// the callback that the user supplies to write(chunk,encoding,cb) |
|
this.writecb = null; |
|
|
|
// the amount that is being written when _write is called. |
|
this.writelen = 0; |
|
|
|
this.buffer = []; |
|
|
|
// number of pending user-supplied write callbacks |
|
// this must be 0 before 'finish' can be emitted |
|
this.pendingcb = 0; |
|
|
|
// emit prefinish if the only thing we're waiting for is _write cbs |
|
// This is relevant for synchronous Transform streams |
|
this.prefinished = false; |
|
|
|
// True if the error was already emitted and should not be thrown again |
|
this.errorEmitted = false; |
|
} |
|
|
|
function Writable(options) { |
|
var Duplex = require('./_stream_duplex'); |
|
|
|
// Writable ctor is applied to Duplexes, though they're not |
|
// instanceof Writable, they're instanceof Readable. |
|
if (!(this instanceof Writable) && !(this instanceof Duplex)) |
|
return new Writable(options); |
|
|
|
this._writableState = new WritableState(options, this); |
|
|
|
// legacy. |
|
this.writable = true; |
|
|
|
Stream.call(this); |
|
} |
|
|
|
// Otherwise people can pipe Writable streams, which is just wrong. |
|
Writable.prototype.pipe = function() { |
|
this.emit('error', new Error('Cannot pipe. Not readable.')); |
|
}; |
|
|
|
|
|
function writeAfterEnd(stream, state, cb) { |
|
var er = new Error('write after end'); |
|
// TODO: defer error events consistently everywhere, not just the cb |
|
stream.emit('error', er); |
|
process.nextTick(function() { |
|
cb(er); |
|
}); |
|
} |
|
|
|
// If we get something that is not a buffer, string, null, or undefined, |
|
// and we're not in objectMode, then that's an error. |
|
// Otherwise stream chunks are all considered to be of length=1, and the |
|
// watermarks determine how many objects to keep in the buffer, rather than |
|
// how many bytes or characters. |
|
function validChunk(stream, state, chunk, cb) { |
|
var valid = true; |
|
if (!util.isBuffer(chunk) && |
|
!util.isString(chunk) && |
|
!util.isNullOrUndefined(chunk) && |
|
!state.objectMode) { |
|
var er = new TypeError('Invalid non-string/buffer chunk'); |
|
stream.emit('error', er); |
|
process.nextTick(function() { |
|
cb(er); |
|
}); |
|
valid = false; |
|
} |
|
return valid; |
|
} |
|
|
|
Writable.prototype.write = function(chunk, encoding, cb) { |
|
var state = this._writableState; |
|
var ret = false; |
|
|
|
if (util.isFunction(encoding)) { |
|
cb = encoding; |
|
encoding = null; |
|
} |
|
|
|
if (util.isBuffer(chunk)) |
|
encoding = 'buffer'; |
|
else if (!encoding) |
|
encoding = state.defaultEncoding; |
|
|
|
if (!util.isFunction(cb)) |
|
cb = function() {}; |
|
|
|
if (state.ended) |
|
writeAfterEnd(this, state, cb); |
|
else if (validChunk(this, state, chunk, cb)) { |
|
state.pendingcb++; |
|
ret = writeOrBuffer(this, state, chunk, encoding, cb); |
|
} |
|
|
|
return ret; |
|
}; |
|
|
|
Writable.prototype.cork = function() { |
|
var state = this._writableState; |
|
|
|
state.corked++; |
|
}; |
|
|
|
Writable.prototype.uncork = function() { |
|
var state = this._writableState; |
|
|
|
if (state.corked) { |
|
state.corked--; |
|
|
|
if (!state.writing && |
|
!state.corked && |
|
!state.finished && |
|
!state.bufferProcessing && |
|
state.buffer.length) |
|
clearBuffer(this, state); |
|
} |
|
}; |
|
|
|
function decodeChunk(state, chunk, encoding) { |
|
if (!state.objectMode && |
|
state.decodeStrings !== false && |
|
util.isString(chunk)) { |
|
chunk = new Buffer(chunk, encoding); |
|
} |
|
return chunk; |
|
} |
|
|
|
// if we're already writing something, then just put this |
|
// in the queue, and wait our turn. Otherwise, call _write |
|
// If we return false, then we need a drain event, so set that flag. |
|
function writeOrBuffer(stream, state, chunk, encoding, cb) { |
|
chunk = decodeChunk(state, chunk, encoding); |
|
if (util.isBuffer(chunk)) |
|
encoding = 'buffer'; |
|
var len = state.objectMode ? 1 : chunk.length; |
|
|
|
state.length += len; |
|
|
|
var ret = state.length < state.highWaterMark; |
|
// we must ensure that previous needDrain will not be reset to false. |
|
if (!ret) |
|
state.needDrain = true; |
|
|
|
if (state.writing || state.corked) |
|
state.buffer.push(new WriteReq(chunk, encoding, cb)); |
|
else |
|
doWrite(stream, state, false, len, chunk, encoding, cb); |
|
|
|
return ret; |
|
} |
|
|
|
function doWrite(stream, state, writev, len, chunk, encoding, cb) { |
|
state.writelen = len; |
|
state.writecb = cb; |
|
state.writing = true; |
|
state.sync = true; |
|
if (writev) |
|
stream._writev(chunk, state.onwrite); |
|
else |
|
stream._write(chunk, encoding, state.onwrite); |
|
state.sync = false; |
|
} |
|
|
|
function onwriteError(stream, state, sync, er, cb) { |
|
if (sync) |
|
process.nextTick(function() { |
|
state.pendingcb--; |
|
cb(er); |
|
}); |
|
else { |
|
state.pendingcb--; |
|
cb(er); |
|
} |
|
|
|
stream._writableState.errorEmitted = true; |
|
stream.emit('error', er); |
|
} |
|
|
|
function onwriteStateUpdate(state) { |
|
state.writing = false; |
|
state.writecb = null; |
|
state.length -= state.writelen; |
|
state.writelen = 0; |
|
} |
|
|
|
function onwrite(stream, er) { |
|
var state = stream._writableState; |
|
var sync = state.sync; |
|
var cb = state.writecb; |
|
|
|
onwriteStateUpdate(state); |
|
|
|
if (er) |
|
onwriteError(stream, state, sync, er, cb); |
|
else { |
|
// Check if we're actually ready to finish, but don't emit yet |
|
var finished = needFinish(stream, state); |
|
|
|
if (!finished && |
|
!state.corked && |
|
!state.bufferProcessing && |
|
state.buffer.length) { |
|
clearBuffer(stream, state); |
|
} |
|
|
|
if (sync) { |
|
process.nextTick(function() { |
|
afterWrite(stream, state, finished, cb); |
|
}); |
|
} else { |
|
afterWrite(stream, state, finished, cb); |
|
} |
|
} |
|
} |
|
|
|
function afterWrite(stream, state, finished, cb) { |
|
if (!finished) |
|
onwriteDrain(stream, state); |
|
state.pendingcb--; |
|
cb(); |
|
finishMaybe(stream, state); |
|
} |
|
|
|
// Must force callback to be called on nextTick, so that we don't |
|
// emit 'drain' before the write() consumer gets the 'false' return |
|
// value, and has a chance to attach a 'drain' listener. |
|
function onwriteDrain(stream, state) { |
|
if (state.length === 0 && state.needDrain) { |
|
state.needDrain = false; |
|
stream.emit('drain'); |
|
} |
|
} |
|
|
|
|
|
// if there's something in the buffer waiting, then process it |
|
function clearBuffer(stream, state) { |
|
state.bufferProcessing = true; |
|
|
|
if (stream._writev && state.buffer.length > 1) { |
|
// Fast case, write everything using _writev() |
|
var cbs = []; |
|
for (var c = 0; c < state.buffer.length; c++) |
|
cbs.push(state.buffer[c].callback); |
|
|
|
// count the one we are adding, as well. |
|
// TODO(isaacs) clean this up |
|
state.pendingcb++; |
|
doWrite(stream, state, true, state.length, state.buffer, '', function(err) { |
|
for (var i = 0; i < cbs.length; i++) { |
|
state.pendingcb--; |
|
cbs[i](err); |
|
} |
|
}); |
|
|
|
// Clear buffer |
|
state.buffer = []; |
|
} else { |
|
// Slow case, write chunks one-by-one |
|
for (var c = 0; c < state.buffer.length; c++) { |
|
var entry = state.buffer[c]; |
|
var chunk = entry.chunk; |
|
var encoding = entry.encoding; |
|
var cb = entry.callback; |
|
var len = state.objectMode ? 1 : chunk.length; |
|
|
|
doWrite(stream, state, false, len, chunk, encoding, cb); |
|
|
|
// if we didn't call the onwrite immediately, then |
|
// it means that we need to wait until it does. |
|
// also, that means that the chunk and cb are currently |
|
// being processed, so move the buffer counter past them. |
|
if (state.writing) { |
|
c++; |
|
break; |
|
} |
|
} |
|
|
|
if (c < state.buffer.length) |
|
state.buffer = state.buffer.slice(c); |
|
else |
|
state.buffer.length = 0; |
|
} |
|
|
|
state.bufferProcessing = false; |
|
} |
|
|
|
Writable.prototype._write = function(chunk, encoding, cb) { |
|
cb(new Error('not implemented')); |
|
|
|
}; |
|
|
|
Writable.prototype._writev = null; |
|
|
|
Writable.prototype.end = function(chunk, encoding, cb) { |
|
var state = this._writableState; |
|
|
|
if (util.isFunction(chunk)) { |
|
cb = chunk; |
|
chunk = null; |
|
encoding = null; |
|
} else if (util.isFunction(encoding)) { |
|
cb = encoding; |
|
encoding = null; |
|
} |
|
|
|
if (!util.isNullOrUndefined(chunk)) |
|
this.write(chunk, encoding); |
|
|
|
// .end() fully uncorks |
|
if (state.corked) { |
|
state.corked = 1; |
|
this.uncork(); |
|
} |
|
|
|
// ignore unnecessary end() calls. |
|
if (!state.ending && !state.finished) |
|
endWritable(this, state, cb); |
|
}; |
|
|
|
|
|
function needFinish(stream, state) { |
|
return (state.ending && |
|
state.length === 0 && |
|
!state.finished && |
|
!state.writing); |
|
} |
|
|
|
function prefinish(stream, state) { |
|
if (!state.prefinished) { |
|
state.prefinished = true; |
|
stream.emit('prefinish'); |
|
} |
|
} |
|
|
|
function finishMaybe(stream, state) { |
|
var need = needFinish(stream, state); |
|
if (need) { |
|
if (state.pendingcb === 0) { |
|
prefinish(stream, state); |
|
state.finished = true; |
|
stream.emit('finish'); |
|
} else |
|
prefinish(stream, state); |
|
} |
|
return need; |
|
} |
|
|
|
function endWritable(stream, state, cb) { |
|
state.ending = true; |
|
finishMaybe(stream, state); |
|
if (cb) { |
|
if (state.finished) |
|
process.nextTick(cb); |
|
else |
|
stream.once('finish', cb); |
|
} |
|
state.ended = true; |
|
} |
|
|
|
}).call(this,require('_process')) |
|
},{"./_stream_duplex":329,"_process":323,"buffer":172,"core-util-is":334,"inherits":320,"stream":339}],334:[function(require,module,exports){ |
|
arguments[4][69][0].apply(exports,arguments) |
|
},{"buffer":172,"dup":69}],335:[function(require,module,exports){ |
|
module.exports = require("./lib/_stream_passthrough.js") |
|
|
|
},{"./lib/_stream_passthrough.js":330}],336:[function(require,module,exports){ |
|
exports = module.exports = require('./lib/_stream_readable.js'); |
|
exports.Stream = require('stream'); |
|
exports.Readable = exports; |
|
exports.Writable = require('./lib/_stream_writable.js'); |
|
exports.Duplex = require('./lib/_stream_duplex.js'); |
|
exports.Transform = require('./lib/_stream_transform.js'); |
|
exports.PassThrough = require('./lib/_stream_passthrough.js'); |
|
|
|
},{"./lib/_stream_duplex.js":329,"./lib/_stream_passthrough.js":330,"./lib/_stream_readable.js":331,"./lib/_stream_transform.js":332,"./lib/_stream_writable.js":333,"stream":339}],337:[function(require,module,exports){ |
|
module.exports = require("./lib/_stream_transform.js") |
|
|
|
},{"./lib/_stream_transform.js":332}],338:[function(require,module,exports){ |
|
module.exports = require("./lib/_stream_writable.js") |
|
|
|
},{"./lib/_stream_writable.js":333}],339:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
module.exports = Stream; |
|
|
|
var EE = require('events').EventEmitter; |
|
var inherits = require('inherits'); |
|
|
|
inherits(Stream, EE); |
|
Stream.Readable = require('readable-stream/readable.js'); |
|
Stream.Writable = require('readable-stream/writable.js'); |
|
Stream.Duplex = require('readable-stream/duplex.js'); |
|
Stream.Transform = require('readable-stream/transform.js'); |
|
Stream.PassThrough = require('readable-stream/passthrough.js'); |
|
|
|
// Backwards-compat with node 0.4.x |
|
Stream.Stream = Stream; |
|
|
|
|
|
|
|
// old-style streams. Note that the pipe method (the only relevant |
|
// part of this class) is overridden in the Readable class. |
|
|
|
function Stream() { |
|
EE.call(this); |
|
} |
|
|
|
Stream.prototype.pipe = function(dest, options) { |
|
var source = this; |
|
|
|
function ondata(chunk) { |
|
if (dest.writable) { |
|
if (false === dest.write(chunk) && source.pause) { |
|
source.pause(); |
|
} |
|
} |
|
} |
|
|
|
source.on('data', ondata); |
|
|
|
function ondrain() { |
|
if (source.readable && source.resume) { |
|
source.resume(); |
|
} |
|
} |
|
|
|
dest.on('drain', ondrain); |
|
|
|
// If the 'end' option is not supplied, dest.end() will be called when |
|
// source gets the 'end' or 'close' events. Only dest.end() once. |
|
if (!dest._isStdio && (!options || options.end !== false)) { |
|
source.on('end', onend); |
|
source.on('close', onclose); |
|
} |
|
|
|
var didOnEnd = false; |
|
function onend() { |
|
if (didOnEnd) return; |
|
didOnEnd = true; |
|
|
|
dest.end(); |
|
} |
|
|
|
|
|
function onclose() { |
|
if (didOnEnd) return; |
|
didOnEnd = true; |
|
|
|
if (typeof dest.destroy === 'function') dest.destroy(); |
|
} |
|
|
|
// don't leave dangling pipes when there are errors. |
|
function onerror(er) { |
|
cleanup(); |
|
if (EE.listenerCount(this, 'error') === 0) { |
|
throw er; // Unhandled stream error in pipe. |
|
} |
|
} |
|
|
|
source.on('error', onerror); |
|
dest.on('error', onerror); |
|
|
|
// remove all the event listeners that were added. |
|
function cleanup() { |
|
source.removeListener('data', ondata); |
|
dest.removeListener('drain', ondrain); |
|
|
|
source.removeListener('end', onend); |
|
source.removeListener('close', onclose); |
|
|
|
source.removeListener('error', onerror); |
|
dest.removeListener('error', onerror); |
|
|
|
source.removeListener('end', cleanup); |
|
source.removeListener('close', cleanup); |
|
|
|
dest.removeListener('close', cleanup); |
|
} |
|
|
|
source.on('end', cleanup); |
|
source.on('close', cleanup); |
|
|
|
dest.on('close', cleanup); |
|
|
|
dest.emit('pipe', source); |
|
|
|
// Allow for unix-like usage: A.pipe(B).pipe(C) |
|
return dest; |
|
}; |
|
|
|
},{"events":314,"inherits":320,"readable-stream/duplex.js":328,"readable-stream/passthrough.js":335,"readable-stream/readable.js":336,"readable-stream/transform.js":337,"readable-stream/writable.js":338}],340:[function(require,module,exports){ |
|
arguments[4][72][0].apply(exports,arguments) |
|
},{"buffer":172,"dup":72}],341:[function(require,module,exports){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
var punycode = require('punycode'); |
|
|
|
exports.parse = urlParse; |
|
exports.resolve = urlResolve; |
|
exports.resolveObject = urlResolveObject; |
|
exports.format = urlFormat; |
|
|
|
exports.Url = Url; |
|
|
|
function Url() { |
|
this.protocol = null; |
|
this.slashes = null; |
|
this.auth = null; |
|
this.host = null; |
|
this.port = null; |
|
this.hostname = null; |
|
this.hash = null; |
|
this.search = null; |
|
this.query = null; |
|
this.pathname = null; |
|
this.path = null; |
|
this.href = null; |
|
} |
|
|
|
// Reference: RFC 3986, RFC 1808, RFC 2396 |
|
|
|
// define these here so at least they only have to be |
|
// compiled once on the first module load. |
|
var protocolPattern = /^([a-z0-9.+-]+:)/i, |
|
portPattern = /:[0-9]*$/, |
|
|
|
// RFC 2396: characters reserved for delimiting URLs. |
|
// We actually just auto-escape these. |
|
delims = ['<', '>', '"', '`', ' ', '\r', '\n', '\t'], |
|
|
|
// RFC 2396: characters not allowed for various reasons. |
|
unwise = ['{', '}', '|', '\\', '^', '`'].concat(delims), |
|
|
|
// Allowed by RFCs, but cause of XSS attacks. Always escape these. |
|
autoEscape = ['\''].concat(unwise), |
|
// Characters that are never ever allowed in a hostname. |
|
// Note that any invalid chars are also handled, but these |
|
// are the ones that are *expected* to be seen, so we fast-path |
|
// them. |
|
nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape), |
|
hostEndingChars = ['/', '?', '#'], |
|
hostnameMaxLen = 255, |
|
hostnamePartPattern = /^[a-z0-9A-Z_-]{0,63}$/, |
|
hostnamePartStart = /^([a-z0-9A-Z_-]{0,63})(.*)$/, |
|
// protocols that can allow "unsafe" and "unwise" chars. |
|
unsafeProtocol = { |
|
'javascript': true, |
|
'javascript:': true |
|
}, |
|
// protocols that never have a hostname. |
|
hostlessProtocol = { |
|
'javascript': true, |
|
'javascript:': true |
|
}, |
|
// protocols that always contain a // bit. |
|
slashedProtocol = { |
|
'http': true, |
|
'https': true, |
|
'ftp': true, |
|
'gopher': true, |
|
'file': true, |
|
'http:': true, |
|
'https:': true, |
|
'ftp:': true, |
|
'gopher:': true, |
|
'file:': true |
|
}, |
|
querystring = require('querystring'); |
|
|
|
function urlParse(url, parseQueryString, slashesDenoteHost) { |
|
if (url && isObject(url) && url instanceof Url) return url; |
|
|
|
var u = new Url; |
|
u.parse(url, parseQueryString, slashesDenoteHost); |
|
return u; |
|
} |
|
|
|
Url.prototype.parse = function(url, parseQueryString, slashesDenoteHost) { |
|
if (!isString(url)) { |
|
throw new TypeError("Parameter 'url' must be a string, not " + typeof url); |
|
} |
|
|
|
var rest = url; |
|
|
|
// trim before proceeding. |
|
// This is to support parse stuff like " http://foo.com \n" |
|
rest = rest.trim(); |
|
|
|
var proto = protocolPattern.exec(rest); |
|
if (proto) { |
|
proto = proto[0]; |
|
var lowerProto = proto.toLowerCase(); |
|
this.protocol = lowerProto; |
|
rest = rest.substr(proto.length); |
|
} |
|
|
|
// figure out if it's got a host |
|
// user@server is *always* interpreted as a hostname, and url |
|
// resolution will treat //foo/bar as host=foo,path=bar because that's |
|
// how the browser resolves relative URLs. |
|
if (slashesDenoteHost || proto || rest.match(/^\/\/[^@\/]+@[^@\/]+/)) { |
|
var slashes = rest.substr(0, 2) === '//'; |
|
if (slashes && !(proto && hostlessProtocol[proto])) { |
|
rest = rest.substr(2); |
|
this.slashes = true; |
|
} |
|
} |
|
|
|
if (!hostlessProtocol[proto] && |
|
(slashes || (proto && !slashedProtocol[proto]))) { |
|
|
|
// there's a hostname. |
|
// the first instance of /, ?, ;, or # ends the host. |
|
// |
|
// If there is an @ in the hostname, then non-host chars *are* allowed |
|
// to the left of the last @ sign, unless some host-ending character |
|
// comes *before* the @-sign. |
|
// URLs are obnoxious. |
|
// |
|
// ex: |
|
// http://a@b@c/ => user:a@b host:c |
|
// http://a@b?@c => user:a host:c path:/?@c |
|
|
|
// v0.12 TODO(isaacs): This is not quite how Chrome does things. |
|
// Review our test case against browsers more comprehensively. |
|
|
|
// find the first instance of any hostEndingChars |
|
var hostEnd = -1; |
|
for (var i = 0; i < hostEndingChars.length; i++) { |
|
var hec = rest.indexOf(hostEndingChars[i]); |
|
if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) |
|
hostEnd = hec; |
|
} |
|
|
|
// at this point, either we have an explicit point where the |
|
// auth portion cannot go past, or the last @ char is the decider. |
|
var auth, atSign; |
|
if (hostEnd === -1) { |
|
// atSign can be anywhere. |
|
atSign = rest.lastIndexOf('@'); |
|
} else { |
|
// atSign must be in auth portion. |
|
// http://a@b/c@d => host:b auth:a path:/c@d |
|
atSign = rest.lastIndexOf('@', hostEnd); |
|
} |
|
|
|
// Now we have a portion which is definitely the auth. |
|
// Pull that off. |
|
if (atSign !== -1) { |
|
auth = rest.slice(0, atSign); |
|
rest = rest.slice(atSign + 1); |
|
this.auth = decodeURIComponent(auth); |
|
} |
|
|
|
// the host is the remaining to the left of the first non-host char |
|
hostEnd = -1; |
|
for (var i = 0; i < nonHostChars.length; i++) { |
|
var hec = rest.indexOf(nonHostChars[i]); |
|
if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) |
|
hostEnd = hec; |
|
} |
|
// if we still have not hit it, then the entire thing is a host. |
|
if (hostEnd === -1) |
|
hostEnd = rest.length; |
|
|
|
this.host = rest.slice(0, hostEnd); |
|
rest = rest.slice(hostEnd); |
|
|
|
// pull out port. |
|
this.parseHost(); |
|
|
|
// we've indicated that there is a hostname, |
|
// so even if it's empty, it has to be present. |
|
this.hostname = this.hostname || ''; |
|
|
|
// if hostname begins with [ and ends with ] |
|
// assume that it's an IPv6 address. |
|
var ipv6Hostname = this.hostname[0] === '[' && |
|
this.hostname[this.hostname.length - 1] === ']'; |
|
|
|
// validate a little. |
|
if (!ipv6Hostname) { |
|
var hostparts = this.hostname.split(/\./); |
|
for (var i = 0, l = hostparts.length; i < l; i++) { |
|
var part = hostparts[i]; |
|
if (!part) continue; |
|
if (!part.match(hostnamePartPattern)) { |
|
var newpart = ''; |
|
for (var j = 0, k = part.length; j < k; j++) { |
|
if (part.charCodeAt(j) > 127) { |
|
// we replace non-ASCII char with a temporary placeholder |
|
// we need this to make sure size of hostname is not |
|
// broken by replacing non-ASCII by nothing |
|
newpart += 'x'; |
|
} else { |
|
newpart += part[j]; |
|
} |
|
} |
|
// we test again with ASCII char only |
|
if (!newpart.match(hostnamePartPattern)) { |
|
var validParts = hostparts.slice(0, i); |
|
var notHost = hostparts.slice(i + 1); |
|
var bit = part.match(hostnamePartStart); |
|
if (bit) { |
|
validParts.push(bit[1]); |
|
notHost.unshift(bit[2]); |
|
} |
|
if (notHost.length) { |
|
rest = '/' + notHost.join('.') + rest; |
|
} |
|
this.hostname = validParts.join('.'); |
|
break; |
|
} |
|
} |
|
} |
|
} |
|
|
|
if (this.hostname.length > hostnameMaxLen) { |
|
this.hostname = ''; |
|
} else { |
|
// hostnames are always lower case. |
|
this.hostname = this.hostname.toLowerCase(); |
|
} |
|
|
|
if (!ipv6Hostname) { |
|
// IDNA Support: Returns a puny coded representation of "domain". |
|
// It only converts the part of the domain name that |
|
// has non ASCII characters. I.e. it dosent matter if |
|
// you call it with a domain that already is in ASCII. |
|
var domainArray = this.hostname.split('.'); |
|
var newOut = []; |
|
for (var i = 0; i < domainArray.length; ++i) { |
|
var s = domainArray[i]; |
|
newOut.push(s.match(/[^A-Za-z0-9_-]/) ? |
|
'xn--' + punycode.encode(s) : s); |
|
} |
|
this.hostname = newOut.join('.'); |
|
} |
|
|
|
var p = this.port ? ':' + this.port : ''; |
|
var h = this.hostname || ''; |
|
this.host = h + p; |
|
this.href += this.host; |
|
|
|
// strip [ and ] from the hostname |
|
// the host field still retains them, though |
|
if (ipv6Hostname) { |
|
this.hostname = this.hostname.substr(1, this.hostname.length - 2); |
|
if (rest[0] !== '/') { |
|
rest = '/' + rest; |
|
} |
|
} |
|
} |
|
|
|
// now rest is set to the post-host stuff. |
|
// chop off any delim chars. |
|
if (!unsafeProtocol[lowerProto]) { |
|
|
|
// First, make 100% sure that any "autoEscape" chars get |
|
// escaped, even if encodeURIComponent doesn't think they |
|
// need to be. |
|
for (var i = 0, l = autoEscape.length; i < l; i++) { |
|
var ae = autoEscape[i]; |
|
var esc = encodeURIComponent(ae); |
|
if (esc === ae) { |
|
esc = escape(ae); |
|
} |
|
rest = rest.split(ae).join(esc); |
|
} |
|
} |
|
|
|
|
|
// chop off from the tail first. |
|
var hash = rest.indexOf('#'); |
|
if (hash !== -1) { |
|
// got a fragment string. |
|
this.hash = rest.substr(hash); |
|
rest = rest.slice(0, hash); |
|
} |
|
var qm = rest.indexOf('?'); |
|
if (qm !== -1) { |
|
this.search = rest.substr(qm); |
|
this.query = rest.substr(qm + 1); |
|
if (parseQueryString) { |
|
this.query = querystring.parse(this.query); |
|
} |
|
rest = rest.slice(0, qm); |
|
} else if (parseQueryString) { |
|
// no query string, but parseQueryString still requested |
|
this.search = ''; |
|
this.query = {}; |
|
} |
|
if (rest) this.pathname = rest; |
|
if (slashedProtocol[lowerProto] && |
|
this.hostname && !this.pathname) { |
|
this.pathname = '/'; |
|
} |
|
|
|
//to support http.request |
|
if (this.pathname || this.search) { |
|
var p = this.pathname || ''; |
|
var s = this.search || ''; |
|
this.path = p + s; |
|
} |
|
|
|
// finally, reconstruct the href based on what has been validated. |
|
this.href = this.format(); |
|
return this; |
|
}; |
|
|
|
// format a parsed object into a url string |
|
function urlFormat(obj) { |
|
// ensure it's an object, and not a string url. |
|
// If it's an obj, this is a no-op. |
|
// this way, you can call url_format() on strings |
|
// to clean up potentially wonky urls. |
|
if (isString(obj)) obj = urlParse(obj); |
|
if (!(obj instanceof Url)) return Url.prototype.format.call(obj); |
|
return obj.format(); |
|
} |
|
|
|
Url.prototype.format = function() { |
|
var auth = this.auth || ''; |
|
if (auth) { |
|
auth = encodeURIComponent(auth); |
|
auth = auth.replace(/%3A/i, ':'); |
|
auth += '@'; |
|
} |
|
|
|
var protocol = this.protocol || '', |
|
pathname = this.pathname || '', |
|
hash = this.hash || '', |
|
host = false, |
|
query = ''; |
|
|
|
if (this.host) { |
|
host = auth + this.host; |
|
} else if (this.hostname) { |
|
host = auth + (this.hostname.indexOf(':') === -1 ? |
|
this.hostname : |
|
'[' + this.hostname + ']'); |
|
if (this.port) { |
|
host += ':' + this.port; |
|
} |
|
} |
|
|
|
if (this.query && |
|
isObject(this.query) && |
|
Object.keys(this.query).length) { |
|
query = querystring.stringify(this.query); |
|
} |
|
|
|
var search = this.search || (query && ('?' + query)) || ''; |
|
|
|
if (protocol && protocol.substr(-1) !== ':') protocol += ':'; |
|
|
|
// only the slashedProtocols get the //. Not mailto:, xmpp:, etc. |
|
// unless they had them to begin with. |
|
if (this.slashes || |
|
(!protocol || slashedProtocol[protocol]) && host !== false) { |
|
host = '//' + (host || ''); |
|
if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname; |
|
} else if (!host) { |
|
host = ''; |
|
} |
|
|
|
if (hash && hash.charAt(0) !== '#') hash = '#' + hash; |
|
if (search && search.charAt(0) !== '?') search = '?' + search; |
|
|
|
pathname = pathname.replace(/[?#]/g, function(match) { |
|
return encodeURIComponent(match); |
|
}); |
|
search = search.replace('#', '%23'); |
|
|
|
return protocol + host + pathname + search + hash; |
|
}; |
|
|
|
function urlResolve(source, relative) { |
|
return urlParse(source, false, true).resolve(relative); |
|
} |
|
|
|
Url.prototype.resolve = function(relative) { |
|
return this.resolveObject(urlParse(relative, false, true)).format(); |
|
}; |
|
|
|
function urlResolveObject(source, relative) { |
|
if (!source) return relative; |
|
return urlParse(source, false, true).resolveObject(relative); |
|
} |
|
|
|
Url.prototype.resolveObject = function(relative) { |
|
if (isString(relative)) { |
|
var rel = new Url(); |
|
rel.parse(relative, false, true); |
|
relative = rel; |
|
} |
|
|
|
var result = new Url(); |
|
Object.keys(this).forEach(function(k) { |
|
result[k] = this[k]; |
|
}, this); |
|
|
|
// hash is always overridden, no matter what. |
|
// even href="" will remove it. |
|
result.hash = relative.hash; |
|
|
|
// if the relative url is empty, then there's nothing left to do here. |
|
if (relative.href === '') { |
|
result.href = result.format(); |
|
return result; |
|
} |
|
|
|
// hrefs like //foo/bar always cut to the protocol. |
|
if (relative.slashes && !relative.protocol) { |
|
// take everything except the protocol from relative |
|
Object.keys(relative).forEach(function(k) { |
|
if (k !== 'protocol') |
|
result[k] = relative[k]; |
|
}); |
|
|
|
//urlParse appends trailing / to urls like http://www.example.com |
|
if (slashedProtocol[result.protocol] && |
|
result.hostname && !result.pathname) { |
|
result.path = result.pathname = '/'; |
|
} |
|
|
|
result.href = result.format(); |
|
return result; |
|
} |
|
|
|
if (relative.protocol && relative.protocol !== result.protocol) { |
|
// if it's a known url protocol, then changing |
|
// the protocol does weird things |
|
// first, if it's not file:, then we MUST have a host, |
|
// and if there was a path |
|
// to begin with, then we MUST have a path. |
|
// if it is file:, then the host is dropped, |
|
// because that's known to be hostless. |
|
// anything else is assumed to be absolute. |
|
if (!slashedProtocol[relative.protocol]) { |
|
Object.keys(relative).forEach(function(k) { |
|
result[k] = relative[k]; |
|
}); |
|
result.href = result.format(); |
|
return result; |
|
} |
|
|
|
result.protocol = relative.protocol; |
|
if (!relative.host && !hostlessProtocol[relative.protocol]) { |
|
var relPath = (relative.pathname || '').split('/'); |
|
while (relPath.length && !(relative.host = relPath.shift())); |
|
if (!relative.host) relative.host = ''; |
|
if (!relative.hostname) relative.hostname = ''; |
|
if (relPath[0] !== '') relPath.unshift(''); |
|
if (relPath.length < 2) relPath.unshift(''); |
|
result.pathname = relPath.join('/'); |
|
} else { |
|
result.pathname = relative.pathname; |
|
} |
|
result.search = relative.search; |
|
result.query = relative.query; |
|
result.host = relative.host || ''; |
|
result.auth = relative.auth; |
|
result.hostname = relative.hostname || relative.host; |
|
result.port = relative.port; |
|
// to support http.request |
|
if (result.pathname || result.search) { |
|
var p = result.pathname || ''; |
|
var s = result.search || ''; |
|
result.path = p + s; |
|
} |
|
result.slashes = result.slashes || relative.slashes; |
|
result.href = result.format(); |
|
return result; |
|
} |
|
|
|
var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'), |
|
isRelAbs = ( |
|
relative.host || |
|
relative.pathname && relative.pathname.charAt(0) === '/' |
|
), |
|
mustEndAbs = (isRelAbs || isSourceAbs || |
|
(result.host && relative.pathname)), |
|
removeAllDots = mustEndAbs, |
|
srcPath = result.pathname && result.pathname.split('/') || [], |
|
relPath = relative.pathname && relative.pathname.split('/') || [], |
|
psychotic = result.protocol && !slashedProtocol[result.protocol]; |
|
|
|
// if the url is a non-slashed url, then relative |
|
// links like ../.. should be able |
|
// to crawl up to the hostname, as well. This is strange. |
|
// result.protocol has already been set by now. |
|
// Later on, put the first path part into the host field. |
|
if (psychotic) { |
|
result.hostname = ''; |
|
result.port = null; |
|
if (result.host) { |
|
if (srcPath[0] === '') srcPath[0] = result.host; |
|
else srcPath.unshift(result.host); |
|
} |
|
result.host = ''; |
|
if (relative.protocol) { |
|
relative.hostname = null; |
|
relative.port = null; |
|
if (relative.host) { |
|
if (relPath[0] === '') relPath[0] = relative.host; |
|
else relPath.unshift(relative.host); |
|
} |
|
relative.host = null; |
|
} |
|
mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === ''); |
|
} |
|
|
|
if (isRelAbs) { |
|
// it's absolute. |
|
result.host = (relative.host || relative.host === '') ? |
|
relative.host : result.host; |
|
result.hostname = (relative.hostname || relative.hostname === '') ? |
|
relative.hostname : result.hostname; |
|
result.search = relative.search; |
|
result.query = relative.query; |
|
srcPath = relPath; |
|
// fall through to the dot-handling below. |
|
} else if (relPath.length) { |
|
// it's relative |
|
// throw away the existing file, and take the new path instead. |
|
if (!srcPath) srcPath = []; |
|
srcPath.pop(); |
|
srcPath = srcPath.concat(relPath); |
|
result.search = relative.search; |
|
result.query = relative.query; |
|
} else if (!isNullOrUndefined(relative.search)) { |
|
// just pull out the search. |
|
// like href='?foo'. |
|
// Put this after the other two cases because it simplifies the booleans |
|
if (psychotic) { |
|
result.hostname = result.host = srcPath.shift(); |
|
//occationaly the auth can get stuck only in host |
|
//this especialy happens in cases like |
|
//url.resolveObject('mailto:local1@domain1', 'local2@domain2') |
|
var authInHost = result.host && result.host.indexOf('@') > 0 ? |
|
result.host.split('@') : false; |
|
if (authInHost) { |
|
result.auth = authInHost.shift(); |
|
result.host = result.hostname = authInHost.shift(); |
|
} |
|
} |
|
result.search = relative.search; |
|
result.query = relative.query; |
|
//to support http.request |
|
if (!isNull(result.pathname) || !isNull(result.search)) { |
|
result.path = (result.pathname ? result.pathname : '') + |
|
(result.search ? result.search : ''); |
|
} |
|
result.href = result.format(); |
|
return result; |
|
} |
|
|
|
if (!srcPath.length) { |
|
// no path at all. easy. |
|
// we've already handled the other stuff above. |
|
result.pathname = null; |
|
//to support http.request |
|
if (result.search) { |
|
result.path = '/' + result.search; |
|
} else { |
|
result.path = null; |
|
} |
|
result.href = result.format(); |
|
return result; |
|
} |
|
|
|
// if a url ENDs in . or .., then it must get a trailing slash. |
|
// however, if it ends in anything else non-slashy, |
|
// then it must NOT get a trailing slash. |
|
var last = srcPath.slice(-1)[0]; |
|
var hasTrailingSlash = ( |
|
(result.host || relative.host) && (last === '.' || last === '..') || |
|
last === ''); |
|
|
|
// strip single dots, resolve double dots to parent dir |
|
// if the path tries to go above the root, `up` ends up > 0 |
|
var up = 0; |
|
for (var i = srcPath.length; i >= 0; i--) { |
|
last = srcPath[i]; |
|
if (last == '.') { |
|
srcPath.splice(i, 1); |
|
} else if (last === '..') { |
|
srcPath.splice(i, 1); |
|
up++; |
|
} else if (up) { |
|
srcPath.splice(i, 1); |
|
up--; |
|
} |
|
} |
|
|
|
// if the path is allowed to go above the root, restore leading ..s |
|
if (!mustEndAbs && !removeAllDots) { |
|
for (; up--; up) { |
|
srcPath.unshift('..'); |
|
} |
|
} |
|
|
|
if (mustEndAbs && srcPath[0] !== '' && |
|
(!srcPath[0] || srcPath[0].charAt(0) !== '/')) { |
|
srcPath.unshift(''); |
|
} |
|
|
|
if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) { |
|
srcPath.push(''); |
|
} |
|
|
|
var isAbsolute = srcPath[0] === '' || |
|
(srcPath[0] && srcPath[0].charAt(0) === '/'); |
|
|
|
// put the host back |
|
if (psychotic) { |
|
result.hostname = result.host = isAbsolute ? '' : |
|
srcPath.length ? srcPath.shift() : ''; |
|
//occationaly the auth can get stuck only in host |
|
//this especialy happens in cases like |
|
//url.resolveObject('mailto:local1@domain1', 'local2@domain2') |
|
var authInHost = result.host && result.host.indexOf('@') > 0 ? |
|
result.host.split('@') : false; |
|
if (authInHost) { |
|
result.auth = authInHost.shift(); |
|
result.host = result.hostname = authInHost.shift(); |
|
} |
|
} |
|
|
|
mustEndAbs = mustEndAbs || (result.host && srcPath.length); |
|
|
|
if (mustEndAbs && !isAbsolute) { |
|
srcPath.unshift(''); |
|
} |
|
|
|
if (!srcPath.length) { |
|
result.pathname = null; |
|
result.path = null; |
|
} else { |
|
result.pathname = srcPath.join('/'); |
|
} |
|
|
|
//to support request.http |
|
if (!isNull(result.pathname) || !isNull(result.search)) { |
|
result.path = (result.pathname ? result.pathname : '') + |
|
(result.search ? result.search : ''); |
|
} |
|
result.auth = relative.auth || result.auth; |
|
result.slashes = result.slashes || relative.slashes; |
|
result.href = result.format(); |
|
return result; |
|
}; |
|
|
|
Url.prototype.parseHost = function() { |
|
var host = this.host; |
|
var port = portPattern.exec(host); |
|
if (port) { |
|
port = port[0]; |
|
if (port !== ':') { |
|
this.port = port.substr(1); |
|
} |
|
host = host.substr(0, host.length - port.length); |
|
} |
|
if (host) this.hostname = host; |
|
}; |
|
|
|
function isString(arg) { |
|
return typeof arg === "string"; |
|
} |
|
|
|
function isObject(arg) { |
|
return typeof arg === 'object' && arg !== null; |
|
} |
|
|
|
function isNull(arg) { |
|
return arg === null; |
|
} |
|
function isNullOrUndefined(arg) { |
|
return arg == null; |
|
} |
|
|
|
},{"punycode":324,"querystring":327}],342:[function(require,module,exports){ |
|
module.exports = function isBuffer(arg) { |
|
return arg && typeof arg === 'object' |
|
&& typeof arg.copy === 'function' |
|
&& typeof arg.fill === 'function' |
|
&& typeof arg.readUInt8 === 'function'; |
|
} |
|
},{}],343:[function(require,module,exports){ |
|
(function (process,global){ |
|
// Copyright Joyent, Inc. and other Node contributors. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a |
|
// copy of this software and associated documentation files (the |
|
// "Software"), to deal in the Software without restriction, including |
|
// without limitation the rights to use, copy, modify, merge, publish, |
|
// distribute, sublicense, and/or sell copies of the Software, and to permit |
|
// persons to whom the Software is furnished to do so, subject to the |
|
// following conditions: |
|
// |
|
// The above copyright notice and this permission notice shall be included |
|
// in all copies or substantial portions of the Software. |
|
// |
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN |
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR |
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE |
|
// USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
|
|
var formatRegExp = /%[sdj%]/g; |
|
exports.format = function(f) { |
|
if (!isString(f)) { |
|
var objects = []; |
|
for (var i = 0; i < arguments.length; i++) { |
|
objects.push(inspect(arguments[i])); |
|
} |
|
return objects.join(' '); |
|
} |
|
|
|
var i = 1; |
|
var args = arguments; |
|
var len = args.length; |
|
var str = String(f).replace(formatRegExp, function(x) { |
|
if (x === '%%') return '%'; |
|
if (i >= len) return x; |
|
switch (x) { |
|
case '%s': return String(args[i++]); |
|
case '%d': return Number(args[i++]); |
|
case '%j': |
|
try { |
|
return JSON.stringify(args[i++]); |
|
} catch (_) { |
|
return '[Circular]'; |
|
} |
|
default: |
|
return x; |
|
} |
|
}); |
|
for (var x = args[i]; i < len; x = args[++i]) { |
|
if (isNull(x) || !isObject(x)) { |
|
str += ' ' + x; |
|
} else { |
|
str += ' ' + inspect(x); |
|
} |
|
} |
|
return str; |
|
}; |
|
|
|
|
|
// Mark that a method should not be used. |
|
// Returns a modified function which warns once by default. |
|
// If --no-deprecation is set, then it is a no-op. |
|
exports.deprecate = function(fn, msg) { |
|
// Allow for deprecating things in the process of starting up. |
|
if (isUndefined(global.process)) { |
|
return function() { |
|
return exports.deprecate(fn, msg).apply(this, arguments); |
|
}; |
|
} |
|
|
|
if (process.noDeprecation === true) { |
|
return fn; |
|
} |
|
|
|
var warned = false; |
|
function deprecated() { |
|
if (!warned) { |
|
if (process.throwDeprecation) { |
|
throw new Error(msg); |
|
} else if (process.traceDeprecation) { |
|
console.trace(msg); |
|
} else { |
|
console.error(msg); |
|
} |
|
warned = true; |
|
} |
|
return fn.apply(this, arguments); |
|
} |
|
|
|
return deprecated; |
|
}; |
|
|
|
|
|
var debugs = {}; |
|
var debugEnviron; |
|
exports.debuglog = function(set) { |
|
if (isUndefined(debugEnviron)) |
|
debugEnviron = process.env.NODE_DEBUG || ''; |
|
set = set.toUpperCase(); |
|
if (!debugs[set]) { |
|
if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) { |
|
var pid = process.pid; |
|
debugs[set] = function() { |
|
var msg = exports.format.apply(exports, arguments); |
|
console.error('%s %d: %s', set, pid, msg); |
|
}; |
|
} else { |
|
debugs[set] = function() {}; |
|
} |
|
} |
|
return debugs[set]; |
|
}; |
|
|
|
|
|
/** |
|
* Echos the value of a value. Trys to print the value out |
|
* in the best way possible given the different types. |
|
* |
|
* @param {Object} obj The object to print out. |
|
* @param {Object} opts Optional options object that alters the output. |
|
*/ |
|
/* legacy: obj, showHidden, depth, colors*/ |
|
function inspect(obj, opts) { |
|
// default options |
|
var ctx = { |
|
seen: [], |
|
stylize: stylizeNoColor |
|
}; |
|
// legacy... |
|
if (arguments.length >= 3) ctx.depth = arguments[2]; |
|
if (arguments.length >= 4) ctx.colors = arguments[3]; |
|
if (isBoolean(opts)) { |
|
// legacy... |
|
ctx.showHidden = opts; |
|
} else if (opts) { |
|
// got an "options" object |
|
exports._extend(ctx, opts); |
|
} |
|
// set default options |
|
if (isUndefined(ctx.showHidden)) ctx.showHidden = false; |
|
if (isUndefined(ctx.depth)) ctx.depth = 2; |
|
if (isUndefined(ctx.colors)) ctx.colors = false; |
|
if (isUndefined(ctx.customInspect)) ctx.customInspect = true; |
|
if (ctx.colors) ctx.stylize = stylizeWithColor; |
|
return formatValue(ctx, obj, ctx.depth); |
|
} |
|
exports.inspect = inspect; |
|
|
|
|
|
// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics |
|
inspect.colors = { |
|
'bold' : [1, 22], |
|
'italic' : [3, 23], |
|
'underline' : [4, 24], |
|
'inverse' : [7, 27], |
|
'white' : [37, 39], |
|
'grey' : [90, 39], |
|
'black' : [30, 39], |
|
'blue' : [34, 39], |
|
'cyan' : [36, 39], |
|
'green' : [32, 39], |
|
'magenta' : [35, 39], |
|
'red' : [31, 39], |
|
'yellow' : [33, 39] |
|
}; |
|
|
|
// Don't use 'blue' not visible on cmd.exe |
|
inspect.styles = { |
|
'special': 'cyan', |
|
'number': 'yellow', |
|
'boolean': 'yellow', |
|
'undefined': 'grey', |
|
'null': 'bold', |
|
'string': 'green', |
|
'date': 'magenta', |
|
// "name": intentionally not styling |
|
'regexp': 'red' |
|
}; |
|
|
|
|
|
function stylizeWithColor(str, styleType) { |
|
var style = inspect.styles[styleType]; |
|
|
|
if (style) { |
|
return '\u001b[' + inspect.colors[style][0] + 'm' + str + |
|
'\u001b[' + inspect.colors[style][1] + 'm'; |
|
} else { |
|
return str; |
|
} |
|
} |
|
|
|
|
|
function stylizeNoColor(str, styleType) { |
|
return str; |
|
} |
|
|
|
|
|
function arrayToHash(array) { |
|
var hash = {}; |
|
|
|
array.forEach(function(val, idx) { |
|
hash[val] = true; |
|
}); |
|
|
|
return hash; |
|
} |
|
|
|
|
|
function formatValue(ctx, value, recurseTimes) { |
|
// Provide a hook for user-specified inspect functions. |
|
// Check that value is an object with an inspect function on it |
|
if (ctx.customInspect && |
|
value && |
|
isFunction(value.inspect) && |
|
// Filter out the util module, it's inspect function is special |
|
value.inspect !== exports.inspect && |
|
// Also filter out any prototype objects using the circular check. |
|
!(value.constructor && value.constructor.prototype === value)) { |
|
var ret = value.inspect(recurseTimes, ctx); |
|
if (!isString(ret)) { |
|
ret = formatValue(ctx, ret, recurseTimes); |
|
} |
|
return ret; |
|
} |
|
|
|
// Primitive types cannot have properties |
|
var primitive = formatPrimitive(ctx, value); |
|
if (primitive) { |
|
return primitive; |
|
} |
|
|
|
// Look up the keys of the object. |
|
var keys = Object.keys(value); |
|
var visibleKeys = arrayToHash(keys); |
|
|
|
if (ctx.showHidden) { |
|
keys = Object.getOwnPropertyNames(value); |
|
} |
|
|
|
// IE doesn't make error fields non-enumerable |
|
// http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx |
|
if (isError(value) |
|
&& (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) { |
|
return formatError(value); |
|
} |
|
|
|
// Some type of object without properties can be shortcutted. |
|
if (keys.length === 0) { |
|
if (isFunction(value)) { |
|
var name = value.name ? ': ' + value.name : ''; |
|
return ctx.stylize('[Function' + name + ']', 'special'); |
|
} |
|
if (isRegExp(value)) { |
|
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); |
|
} |
|
if (isDate(value)) { |
|
return ctx.stylize(Date.prototype.toString.call(value), 'date'); |
|
} |
|
if (isError(value)) { |
|
return formatError(value); |
|
} |
|
} |
|
|
|
var base = '', array = false, braces = ['{', '}']; |
|
|
|
// Make Array say that they are Array |
|
if (isArray(value)) { |
|
array = true; |
|
braces = ['[', ']']; |
|
} |
|
|
|
// Make functions say that they are functions |
|
if (isFunction(value)) { |
|
var n = value.name ? ': ' + value.name : ''; |
|
base = ' [Function' + n + ']'; |
|
} |
|
|
|
// Make RegExps say that they are RegExps |
|
if (isRegExp(value)) { |
|
base = ' ' + RegExp.prototype.toString.call(value); |
|
} |
|
|
|
// Make dates with properties first say the date |
|
if (isDate(value)) { |
|
base = ' ' + Date.prototype.toUTCString.call(value); |
|
} |
|
|
|
// Make error with message first say the error |
|
if (isError(value)) { |
|
base = ' ' + formatError(value); |
|
} |
|
|
|
if (keys.length === 0 && (!array || value.length == 0)) { |
|
return braces[0] + base + braces[1]; |
|
} |
|
|
|
if (recurseTimes < 0) { |
|
if (isRegExp(value)) { |
|
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); |
|
} else { |
|
return ctx.stylize('[Object]', 'special'); |
|
} |
|
} |
|
|
|
ctx.seen.push(value); |
|
|
|
var output; |
|
if (array) { |
|
output = formatArray(ctx, value, recurseTimes, visibleKeys, keys); |
|
} else { |
|
output = keys.map(function(key) { |
|
return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array); |
|
}); |
|
} |
|
|
|
ctx.seen.pop(); |
|
|
|
return reduceToSingleString(output, base, braces); |
|
} |
|
|
|
|
|
function formatPrimitive(ctx, value) { |
|
if (isUndefined(value)) |
|
return ctx.stylize('undefined', 'undefined'); |
|
if (isString(value)) { |
|
var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '') |
|
.replace(/'/g, "\\'") |
|
.replace(/\\"/g, '"') + '\''; |
|
return ctx.stylize(simple, 'string'); |
|
} |
|
if (isNumber(value)) |
|
return ctx.stylize('' + value, 'number'); |
|
if (isBoolean(value)) |
|
return ctx.stylize('' + value, 'boolean'); |
|
// For some reason typeof null is "object", so special case here. |
|
if (isNull(value)) |
|
return ctx.stylize('null', 'null'); |
|
} |
|
|
|
|
|
function formatError(value) { |
|
return '[' + Error.prototype.toString.call(value) + ']'; |
|
} |
|
|
|
|
|
function formatArray(ctx, value, recurseTimes, visibleKeys, keys) { |
|
var output = []; |
|
for (var i = 0, l = value.length; i < l; ++i) { |
|
if (hasOwnProperty(value, String(i))) { |
|
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, |
|
String(i), true)); |
|
} else { |
|
output.push(''); |
|
} |
|
} |
|
keys.forEach(function(key) { |
|
if (!key.match(/^\d+$/)) { |
|
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, |
|
key, true)); |
|
} |
|
}); |
|
return output; |
|
} |
|
|
|
|
|
function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) { |
|
var name, str, desc; |
|
desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] }; |
|
if (desc.get) { |
|
if (desc.set) { |
|
str = ctx.stylize('[Getter/Setter]', 'special'); |
|
} else { |
|
str = ctx.stylize('[Getter]', 'special'); |
|
} |
|
} else { |
|
if (desc.set) { |
|
str = ctx.stylize('[Setter]', 'special'); |
|
} |
|
} |
|
if (!hasOwnProperty(visibleKeys, key)) { |
|
name = '[' + key + ']'; |
|
} |
|
if (!str) { |
|
if (ctx.seen.indexOf(desc.value) < 0) { |
|
if (isNull(recurseTimes)) { |
|
str = formatValue(ctx, desc.value, null); |
|
} else { |
|
str = formatValue(ctx, desc.value, recurseTimes - 1); |
|
} |
|
if (str.indexOf('\n') > -1) { |
|
if (array) { |
|
str = str.split('\n').map(function(line) { |
|
return ' ' + line; |
|
}).join('\n').substr(2); |
|
} else { |
|
str = '\n' + str.split('\n').map(function(line) { |
|
return ' ' + line; |
|
}).join('\n'); |
|
} |
|
} |
|
} else { |
|
str = ctx.stylize('[Circular]', 'special'); |
|
} |
|
} |
|
if (isUndefined(name)) { |
|
if (array && key.match(/^\d+$/)) { |
|
return str; |
|
} |
|
name = JSON.stringify('' + key); |
|
if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) { |
|
name = name.substr(1, name.length - 2); |
|
name = ctx.stylize(name, 'name'); |
|
} else { |
|
name = name.replace(/'/g, "\\'") |
|
.replace(/\\"/g, '"') |
|
.replace(/(^"|"$)/g, "'"); |
|
name = ctx.stylize(name, 'string'); |
|
} |
|
} |
|
|
|
return name + ': ' + str; |
|
} |
|
|
|
|
|
function reduceToSingleString(output, base, braces) { |
|
var numLinesEst = 0; |
|
var length = output.reduce(function(prev, cur) { |
|
numLinesEst++; |
|
if (cur.indexOf('\n') >= 0) numLinesEst++; |
|
return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1; |
|
}, 0); |
|
|
|
if (length > 60) { |
|
return braces[0] + |
|
(base === '' ? '' : base + '\n ') + |
|
' ' + |
|
output.join(',\n ') + |
|
' ' + |
|
braces[1]; |
|
} |
|
|
|
return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1]; |
|
} |
|
|
|
|
|
// NOTE: These type checking functions intentionally don't use `instanceof` |
|
// because it is fragile and can be easily faked with `Object.create()`. |
|
function isArray(ar) { |
|
return Array.isArray(ar); |
|
} |
|
exports.isArray = isArray; |
|
|
|
function isBoolean(arg) { |
|
return typeof arg === 'boolean'; |
|
} |
|
exports.isBoolean = isBoolean; |
|
|
|
function isNull(arg) { |
|
return arg === null; |
|
} |
|
exports.isNull = isNull; |
|
|
|
function isNullOrUndefined(arg) { |
|
return arg == null; |
|
} |
|
exports.isNullOrUndefined = isNullOrUndefined; |
|
|
|
function isNumber(arg) { |
|
return typeof arg === 'number'; |
|
} |
|
exports.isNumber = isNumber; |
|
|
|
function isString(arg) { |
|
return typeof arg === 'string'; |
|
} |
|
exports.isString = isString; |
|
|
|
function isSymbol(arg) { |
|
return typeof arg === 'symbol'; |
|
} |
|
exports.isSymbol = isSymbol; |
|
|
|
function isUndefined(arg) { |
|
return arg === void 0; |
|
} |
|
exports.isUndefined = isUndefined; |
|
|
|
function isRegExp(re) { |
|
return isObject(re) && objectToString(re) === '[object RegExp]'; |
|
} |
|
exports.isRegExp = isRegExp; |
|
|
|
function isObject(arg) { |
|
return typeof arg === 'object' && arg !== null; |
|
} |
|
exports.isObject = isObject; |
|
|
|
function isDate(d) { |
|
return isObject(d) && objectToString(d) === '[object Date]'; |
|
} |
|
exports.isDate = isDate; |
|
|
|
function isError(e) { |
|
return isObject(e) && |
|
(objectToString(e) === '[object Error]' || e instanceof Error); |
|
} |
|
exports.isError = isError; |
|
|
|
function isFunction(arg) { |
|
return typeof arg === 'function'; |
|
} |
|
exports.isFunction = isFunction; |
|
|
|
function isPrimitive(arg) { |
|
return arg === null || |
|
typeof arg === 'boolean' || |
|
typeof arg === 'number' || |
|
typeof arg === 'string' || |
|
typeof arg === 'symbol' || // ES6 symbol |
|
typeof arg === 'undefined'; |
|
} |
|
exports.isPrimitive = isPrimitive; |
|
|
|
exports.isBuffer = require('./support/isBuffer'); |
|
|
|
function objectToString(o) { |
|
return Object.prototype.toString.call(o); |
|
} |
|
|
|
|
|
function pad(n) { |
|
return n < 10 ? '0' + n.toString(10) : n.toString(10); |
|
} |
|
|
|
|
|
var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', |
|
'Oct', 'Nov', 'Dec']; |
|
|
|
// 26 Feb 16:19:34 |
|
function timestamp() { |
|
var d = new Date(); |
|
var time = [pad(d.getHours()), |
|
pad(d.getMinutes()), |
|
pad(d.getSeconds())].join(':'); |
|
return [d.getDate(), months[d.getMonth()], time].join(' '); |
|
} |
|
|
|
|
|
// log is just a thin wrapper to console.log that prepends a timestamp |
|
exports.log = function() { |
|
console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments)); |
|
}; |
|
|
|
|
|
/** |
|
* Inherit the prototype methods from one constructor into another. |
|
* |
|
* The Function.prototype.inherits from lang.js rewritten as a standalone |
|
* function (not on Function.prototype). NOTE: If this file is to be loaded |
|
* during bootstrapping this function needs to be rewritten using some native |
|
* functions as prototype setup using normal JavaScript does not work as |
|
* expected during bootstrapping (see mirror.js in r114903). |
|
* |
|
* @param {function} ctor Constructor function which needs to inherit the |
|
* prototype. |
|
* @param {function} superCtor Constructor function to inherit prototype from. |
|
*/ |
|
exports.inherits = require('inherits'); |
|
|
|
exports._extend = function(origin, add) { |
|
// Don't do anything if add isn't an object |
|
if (!add || !isObject(add)) return origin; |
|
|
|
var keys = Object.keys(add); |
|
var i = keys.length; |
|
while (i--) { |
|
origin[keys[i]] = add[keys[i]]; |
|
} |
|
return origin; |
|
}; |
|
|
|
function hasOwnProperty(obj, prop) { |
|
return Object.prototype.hasOwnProperty.call(obj, prop); |
|
} |
|
|
|
}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) |
|
},{"./support/isBuffer":342,"_process":323,"inherits":320}],344:[function(require,module,exports){ |
|
var indexOf = require('indexof'); |
|
|
|
var Object_keys = function (obj) { |
|
if (Object.keys) return Object.keys(obj) |
|
else { |
|
var res = []; |
|
for (var key in obj) res.push(key) |
|
return res; |
|
} |
|
}; |
|
|
|
var forEach = function (xs, fn) { |
|
if (xs.forEach) return xs.forEach(fn) |
|
else for (var i = 0; i < xs.length; i++) { |
|
fn(xs[i], i, xs); |
|
} |
|
}; |
|
|
|
var defineProp = (function() { |
|
try { |
|
Object.defineProperty({}, '_', {}); |
|
return function(obj, name, value) { |
|
Object.defineProperty(obj, name, { |
|
writable: true, |
|
enumerable: false, |
|
configurable: true, |
|
value: value |
|
}) |
|
}; |
|
} catch(e) { |
|
return function(obj, name, value) { |
|
obj[name] = value; |
|
}; |
|
} |
|
}()); |
|
|
|
var globals = ['Array', 'Boolean', 'Date', 'Error', 'EvalError', 'Function', |
|
'Infinity', 'JSON', 'Math', 'NaN', 'Number', 'Object', 'RangeError', |
|
'ReferenceError', 'RegExp', 'String', 'SyntaxError', 'TypeError', 'URIError', |
|
'decodeURI', 'decodeURIComponent', 'encodeURI', 'encodeURIComponent', 'escape', |
|
'eval', 'isFinite', 'isNaN', 'parseFloat', 'parseInt', 'undefined', 'unescape']; |
|
|
|
function Context() {} |
|
Context.prototype = {}; |
|
|
|
var Script = exports.Script = function NodeScript (code) { |
|
if (!(this instanceof Script)) return new Script(code); |
|
this.code = code; |
|
}; |
|
|
|
Script.prototype.runInContext = function (context) { |
|
if (!(context instanceof Context)) { |
|
throw new TypeError("needs a 'context' argument."); |
|
} |
|
|
|
var iframe = document.createElement('iframe'); |
|
if (!iframe.style) iframe.style = {}; |
|
iframe.style.display = 'none'; |
|
|
|
document.body.appendChild(iframe); |
|
|
|
var win = iframe.contentWindow; |
|
var wEval = win.eval, wExecScript = win.execScript; |
|
|
|
if (!wEval && wExecScript) { |
|
// win.eval() magically appears when this is called in IE: |
|
wExecScript.call(win, 'null'); |
|
wEval = win.eval; |
|
} |
|
|
|
forEach(Object_keys(context), function (key) { |
|
win[key] = context[key]; |
|
}); |
|
forEach(globals, function (key) { |
|
if (context[key]) { |
|
win[key] = context[key]; |
|
} |
|
}); |
|
|
|
var winKeys = Object_keys(win); |
|
|
|
var res = wEval.call(win, this.code); |
|
|
|
forEach(Object_keys(win), function (key) { |
|
// Avoid copying circular objects like `top` and `window` by only |
|
// updating existing context properties or new properties in the `win` |
|
// that was only introduced after the eval. |
|
if (key in context || indexOf(winKeys, key) === -1) { |
|
context[key] = win[key]; |
|
} |
|
}); |
|
|
|
forEach(globals, function (key) { |
|
if (!(key in context)) { |
|
defineProp(context, key, win[key]); |
|
} |
|
}); |
|
|
|
document.body.removeChild(iframe); |
|
|
|
return res; |
|
}; |
|
|
|
Script.prototype.runInThisContext = function () { |
|
return eval(this.code); // maybe... |
|
}; |
|
|
|
Script.prototype.runInNewContext = function (context) { |
|
var ctx = Script.createContext(context); |
|
var res = this.runInContext(ctx); |
|
|
|
forEach(Object_keys(ctx), function (key) { |
|
context[key] = ctx[key]; |
|
}); |
|
|
|
return res; |
|
}; |
|
|
|
forEach(Object_keys(Script.prototype), function (name) { |
|
exports[name] = Script[name] = function (code) { |
|
var s = Script(code); |
|
return s[name].apply(s, [].slice.call(arguments, 1)); |
|
}; |
|
}); |
|
|
|
exports.createScript = function (code) { |
|
return exports.Script(code); |
|
}; |
|
|
|
exports.createContext = Script.createContext = function (context) { |
|
var copy = new Context(); |
|
if(typeof context === 'object') { |
|
forEach(Object_keys(context), function (key) { |
|
copy[key] = context[key]; |
|
}); |
|
} |
|
return copy; |
|
}; |
|
|
|
},{"indexof":345}],345:[function(require,module,exports){ |
|
|
|
var indexOf = [].indexOf; |
|
|
|
module.exports = function(arr, obj){ |
|
if (indexOf) return arr.indexOf(obj); |
|
for (var i = 0; i < arr.length; ++i) { |
|
if (arr[i] === obj) return i; |
|
} |
|
return -1; |
|
}; |
|
},{}]},{},[142])(142) |
|
}); |