참고: 설정을 저장한 후에 바뀐 점을 확인하기 위해서는 브라우저의 캐시를 새로 고쳐야 합니다.
- 파이어폭스 / 사파리: Shift 키를 누르면서 새로 고침을 클릭하거나, Ctrl-F5 또는 Ctrl-R을 입력 (Mac에서는 ⌘-R)
- 구글 크롬: Ctrl-Shift-R키를 입력 (Mac에서는 ⌘-Shift-R)
- 인터넷 익스플로러 / 엣지: Ctrl 키를 누르면서 새로 고침을 클릭하거나, Ctrl-F5를 입력.
- 오페라: Ctrl-F5를 입력.
!function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.kbpgp=e()}}(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){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, DSA, ECDH, ECDSA, ElGamal, RSA;
C = require('./const').openpgp.public_key_algorithms;
RSA = require('./rsa').RSA;
DSA = require('./dsa').DSA;
ElGamal = require('./elgamal').ElGamal;
ECDSA = require('./ecc/ecdsa').ECDSA;
ECDH = require('./ecc/ecdh').ECDH;
exports.get_class = function(n) {
switch (n) {
case C.RSA:
case C.RSA_ENCRYPT_ONLY:
case C.RSA_SIGN_ONLY:
return RSA;
case C.ELGAMAL:
return ElGamal;
case C.DSA:
return DSA;
case C.ECDSA:
return ECDSA;
case C.ECDH:
return ECDH;
default:
throw new Error("unknown public key system: " + n);
}
};
}).call(this);
},{"./const":5,"./dsa":6,"./ecc/ecdh":9,"./ecc/ecdsa":10,"./elgamal":12,"./rsa":67}],2:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseKey, BaseKeyPair, C, K, SHA256, SHA512, SRF, bn, bufeq_secure, iced, konst, __iced_k, __iced_k_noop, _ref;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
konst = require('./const');
C = konst.openpgp;
K = konst.kb;
_ref = require('./hash'), SHA256 = _ref.SHA256, SHA512 = _ref.SHA512;
bn = require('./bn');
bufeq_secure = require('pgp-utils').util.bufeq_secure;
SRF = require('./rand').SRF;
exports.BaseKey = BaseKey = (function() {
function BaseKey() {}
BaseKey.alloc = function(klass, raw, d) {
var err, o, orig_len, _i, _len, _ref1, _ref2;
if (d == null) {
d = {};
}
orig_len = raw.length;
err = null;
_ref1 = klass.ORDER;
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
o = _ref1[_i];
if (err == null) {
_ref2 = bn.mpi_from_buffer(raw), err = _ref2[0], d[o] = _ref2[1], raw = _ref2[2];
}
}
if (err) {
return [err, null];
} else {
return [null, new klass(d), orig_len - raw.length];
}
};
BaseKey.prototype.serialize = function() {
var e;
return Buffer.concat((function() {
var _i, _len, _ref1, _results;
_ref1 = this.ORDER;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
e = _ref1[_i];
_results.push(this[e].to_mpi_buffer());
}
return _results;
}).call(this));
};
BaseKey.prototype.validity_check = function(cb) {
return cb(null);
};
return BaseKey;
})();
exports.BaseKeyPair = BaseKeyPair = (function() {
function BaseKeyPair(_arg) {
this.priv = _arg.priv, this.pub = _arg.pub;
this.pub.parent = this;
if (this.priv != null) {
this.priv.parent = this;
}
}
BaseKeyPair.prototype.serialize = function() {
return this.pub.serialize();
};
BaseKeyPair.prototype.hash = function() {
return SHA256(this.serialize());
};
BaseKeyPair.prototype.ekid = function() {
return Buffer.concat([new Buffer([K.kid.version, this.get_type()]), this.hash(), new Buffer([K.kid.trailer])]);
};
BaseKeyPair.prototype.can_sign = function() {
return this.priv != null;
};
BaseKeyPair.prototype.can_decrypt = function() {
return this.priv != null;
};
BaseKeyPair.prototype.has_private = function() {
return this.priv != null;
};
BaseKeyPair.prototype.fulfills_flags = function(flags) {
return false;
};
BaseKeyPair.prototype.is_toxic = function() {
return false;
};
BaseKeyPair.prototype.nbits = function() {
var _ref1;
return (_ref1 = this.pub) != null ? _ref1.nbits() : void 0;
};
BaseKeyPair.prototype.good_for_flags = function() {
return C.key_flags.encrypt_comm | C.key_flags.encrypt_storage | C.key_flags.certify_keys | C.key_flags.sign_data;
};
BaseKeyPair.prototype.eq = function(k2) {
return (this.type === k2.type) && (bufeq_secure(this.serialize(), k2.serialize()));
};
BaseKeyPair.prototype.can_perform = function(ops_mask) {
if ((ops_mask & konst.ops.sign) && !this.can_sign()) {
return false;
} else if ((ops_mask & konst.ops.decrypt) && !this.can_decrypt()) {
return false;
} else {
return true;
}
};
BaseKeyPair.parse = function(klass, pub_raw) {
var err, key, len, _ref1;
_ref1 = klass.Pub.alloc(pub_raw), err = _ref1[0], key = _ref1[1], len = _ref1[2];
if (key != null) {
key = new klass({
pub: key
});
}
return [err, key, len];
};
BaseKeyPair.parse_kb = function(klass, pub_raw) {
var err, key, len, _ref1;
_ref1 = klass.Pub.alloc_kb(pub_raw), err = _ref1[0], key = _ref1[1], len = _ref1[2];
if (key != null) {
key = new klass({
pub: key
});
}
return [err, key, len];
};
BaseKeyPair.prototype.add_priv = function(priv_raw) {
var err, len, _ref1;
_ref1 = Priv.alloc(priv_raw), err = _ref1[0], this.priv = _ref1[1], len = _ref1[2];
return [err, len];
};
BaseKeyPair.alloc = function(klass, _arg) {
var err, priv, pub, _ref1, _ref2;
pub = _arg.pub, priv = _arg.priv;
_ref1 = klass.Pub.alloc(pub), err = _ref1[0], pub = _ref1[1];
if ((err == null) && (priv != null)) {
_ref2 = klass.Priv.alloc(priv, pub), err = _ref2[0], priv = _ref2[1];
}
if (err != null) {
return [err, null];
} else {
return [
null, new klass({
priv: priv,
pub: pub
})
];
}
};
BaseKeyPair.prototype.read_priv = function(raw_priv) {
var err, _ref1;
_ref1 = this.Priv.alloc(raw_priv, this.pub), err = _ref1[0], this.priv = _ref1[1];
return err;
};
BaseKeyPair.prototype.find = function(i) {
return i.mod(this.max_value());
};
BaseKeyPair.prototype.hide = function(_arg, cb) {
var L, err, i, max, n, r, r_bits, ret, slosh, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
i = _arg.i, max = _arg.max, slosh = _arg.slosh;
ret = err = null;
n = this.max_value();
(function(_this) {
return (function(__iced_k) {
if ((L = n.bitLength()) > max) {
return __iced_k(err = new Error("Can't hide > " + max + " bits; got " + L));
} else {
r_bits = (max - L) + slosh;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/basekeypair.iced",
funcname: "BaseKeyPair.hide"
});
SRF().random_nbit(r_bits, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return r = arguments[0];
};
})(),
lineno: 127
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(ret = r.multiply(n).add(i));
});
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
BaseKeyPair.prototype.validity_check = function(cb) {
return this.pub.validity_check(cb);
};
return BaseKeyPair;
})();
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./bn":4,"./const":5,"./hash":14,"./rand":65,"buffer":80,"iced-runtime":118,"pgp-utils":163}],3:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseX, BigInteger, base32, base58, buffer_to_ui8a, nbi, nbs, nbv, _ref;
_ref = require('bn'), nbv = _ref.nbv, nbi = _ref.nbi, BigInteger = _ref.BigInteger;
nbs = require('./bn').nbs;
buffer_to_ui8a = require('./util').buffer_to_ui8a;
BaseX = (function() {
function BaseX(alphabet) {
var a, i, _i, _len, _ref1;
this.alphabet = alphabet;
this.base = this.alphabet.length;
this.basebn = nbv(this.base);
this.lookup = {};
_ref1 = this.alphabet;
for (i = _i = 0, _len = _ref1.length; _i < _len; i = ++_i) {
a = _ref1[i];
this.lookup[a] = i;
}
}
BaseX.prototype.encode = function(buffer) {
var c, chars, num, pad, q, r, _i, _len;
num = nbi().fromBuffer(buffer);
chars = (function() {
var _ref1, _results;
_results = [];
while (num.compareTo(BigInteger.ZERO) > 0) {
_ref1 = num.divideAndRemainder(this.basebn), q = _ref1[0], r = _ref1[1];
c = this.alphabet[r.intValue()];
num = q;
_results.push(c);
}
return _results;
}).call(this);
chars.reverse();
pad = [];
for (_i = 0, _len = buffer.length; _i < _len; _i++) {
c = buffer[_i];
if (c === 0) {
pad.push(this.alphabet[0]);
} else {
break;
}
}
return (pad.concat(chars)).join('');
};
BaseX.prototype.decode = function(str) {
var base, c, char_index, i, num, pad, start, _i, _j, _len, _ref1;
num = BigInteger.ZERO;
base = BigInteger.ONE;
i = 0;
for (i = _i = 0, _len = str.length; _i < _len; i = ++_i) {
c = str[i];
if (c !== this.alphabet[0]) {
break;
}
}
start = i;
pad = new Buffer((function() {
var _j, _results;
_results = [];
for (i = _j = 0; 0 <= start ? _j < start : _j > start; i = 0 <= start ? ++_j : --_j) {
_results.push(0);
}
return _results;
})());
_ref1 = str.slice(start);
for (i = _j = _ref1.length - 1; _j >= 0; i = _j += -1) {
c = _ref1[i];
if ((char_index = this.lookup[c]) == null) {
throw new Error('Value passed is not a valid BaseX string.');
}
num = num.add(base.multiply(nbv(char_index)));
base = base.multiply(this.basebn);
}
return Buffer.concat([pad, new Buffer(num.toByteArray())]);
};
return BaseX;
})();
exports.base58 = base58 = new BaseX('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');
exports.base32 = base32 = new BaseX('abcdefghijkmnpqrstuvwxyz23456789');
exports.base91 = new BaseX("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789`~!@#$%^&*()-_=+{}[]|;:,<>./?");
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./bn":4,"./util":70,"bn":71,"buffer":80}],4:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BigInteger, bn_from_left_n_bits, buffer_shift_right, buffer_to_ui8a, mpi_byte_length, mpi_from_buffer, mpi_to_padded_octets, nbi, nbits, nbs, nbv, toMPI, _ref;
_ref = require('bn'), nbv = _ref.nbv, nbi = _ref.nbi, BigInteger = _ref.BigInteger, nbits = _ref.nbits;
buffer_to_ui8a = require('./util').buffer_to_ui8a;
nbs = function(s, base) {
var r;
if (base == null) {
base = 10;
}
r = nbi();
return r.fromString(s, base);
};
mpi_byte_length = function(bn) {
return bn.toByteArray().length;
};
toMPI = function(bn) {
var ba, hdr, size;
ba = bn.toByteArray();
size = (ba.length - 1) * 8 + nbits(ba[0]);
hdr = new Buffer(2);
hdr.writeUInt16BE(size, 0);
return Buffer.concat([hdr, new Buffer(ba)]);
};
mpi_from_buffer = function(raw) {
var err, hdr, i, n_bits, n_bytes;
err = i = null;
if (raw.length < 2) {
err = new Error("need at least 2 bytes; got " + raw.length);
} else {
hdr = new Buffer(raw.slice(0, 2));
raw = raw.slice(2);
n_bits = hdr.readUInt16BE(0);
n_bytes = Math.ceil(n_bits / 8);
if (raw.length < n_bytes) {
err = new Error("MPI said " + n_bytes + " bytes but only got " + raw.length);
} else {
i = nbi().fromBuffer(raw.slice(0, n_bytes));
raw = raw.slice(n_bytes);
}
}
return [err, i, raw, n_bytes + 2];
};
mpi_to_padded_octets = function(bn, base) {
var ba, diff, i, n, pad;
n = base.mpi_byte_length();
ba = bn.toByteArray();
diff = n - ba.length;
pad = new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= diff ? _i < diff : _i > diff; i = 0 <= diff ? ++_i : --_i) {
_results.push(0);
}
return _results;
})());
return Buffer.concat([pad, new Buffer(ba)]);
};
buffer_shift_right = function(buf, nbits) {
var c, i, l, mask, nbytes, nxt, rem, _i, _ref1;
nbytes = nbits >> 3;
rem = nbits % 8;
buf = buf.slice(0, buf.length - nbytes);
l = buf.length;
mask = (1 << rem) - 1;
for (i = _i = _ref1 = l - 1; _ref1 <= 0 ? _i <= 0 : _i >= 0; i = _ref1 <= 0 ? ++_i : --_i) {
c = buf.readUInt8(i) >> rem;
if (i > 0) {
nxt = buf.readUInt8(i - 1) & mask;
c |= nxt << (8 - rem);
}
buf.writeUInt8(c, i);
}
return buf;
};
bn_from_left_n_bits = function(raw, bits) {
var buf, bytes, rem;
rem = bits % 8;
bytes = (bits >> 3) + (rem ? 1 : 0);
buf = raw.slice(0, bytes);
if (rem > 0) {
buf = buffer_shift_right(buf, 8 - rem);
}
return nbi().fromBuffer(buf);
};
exports.toMPI = toMPI;
exports.nbs = nbs;
exports.mpi_from_buffer = mpi_from_buffer;
exports.mpi_to_padded_octets = mpi_to_padded_octets;
exports.buffer_shift_right = buffer_shift_right;
exports.bn_from_left_n_bits = bn_from_left_n_bits;
BigInteger.prototype.to_mpi_buffer = function() {
return toMPI(this);
};
BigInteger.prototype.mpi_byte_length = function() {
return mpi_byte_length(this);
};
BigInteger.prototype.to_padded_octets = function(base) {
return mpi_to_padded_octets(this, base);
};
exports.BigInteger = BigInteger;
exports.nbi = nbi;
exports.nbv = nbv;
exports.nbits = nbits;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./util":70,"bn":71,"buffer":80}],5:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var config, k, openpgp, v;
exports.openpgp = openpgp = {
public_key_algorithms: {
RSA: 1,
RSA_ENCRYPT_ONLY: 2,
RSA_SIGN_ONLY: 3,
ELGAMAL: 16,
DSA: 17,
ECDH: 18,
ECDSA: 19,
ELGAMAL_SIGN_AND_ENCRYPT: 20
},
symmetric_key_algorithms: {
CAST5: 3,
AES128: 7,
AES192: 8,
AES256: 9
},
hash_algorithms: {
MD5: 1,
SHA1: 2,
RIPEMD160: 3,
SHA256: 8,
SHA384: 9,
SHA512: 10,
SHA224: 11
},
sig_subpacket: {
creation_time: 2,
expiration_time: 3,
exportable_certificate: 4,
trust_signature: 5,
regular_expression: 6,
revocable: 7,
key_expiration_time: 9,
preferred_symmetric_algorithms: 11,
revocation_key: 12,
issuer: 16,
notation_data: 20,
preferred_hash_algorithms: 21,
preferred_compression_algorithms: 22,
key_server_preferences: 23,
preferred_key_server: 24,
primary_user_id: 25,
policy_uri: 26,
key_flags: 27,
signers_user_id: 28,
reason_for_revocation: 29,
features: 30,
signature_target: 31,
embedded_signature: 32,
experimental_low: 101,
experimental_high: 110
},
sig_types: {
binary_doc: 0x00,
canonical_text: 0x01,
issuer: 0x10,
persona: 0x11,
casual: 0x12,
positive: 0x13,
subkey_binding: 0x18,
primary_binding: 0x19,
direct: 0x1f,
key_revocation: 0x20,
subkey_revocation: 0x28,
certificate_revocation: 0x30
},
message_types: {
generic: 0,
public_key: 4,
private_key: 5,
signature: 8,
clearsign: 9
},
s2k: {
plain: 0,
salt: 1,
salt_iter: 3,
gnu: 101,
gnu_dummy: 1001
},
s2k_convention: {
none: 0,
checksum: 255,
sha1: 254
},
ecdh: {
param_bytes: 3,
version: 1
},
packet_tags: {
PKESK: 1,
signature: 2,
one_pass_sig: 4,
secret_key: 5,
public_key: 6,
secret_subkey: 7,
compressed: 8,
literal: 11,
public_subkey: 14,
userid: 13,
user_attribute: 17,
SEIPD: 18,
MDC: 19
},
literal_formats: {
binary: 0x62,
text: 0x74,
utf8: 0x75
},
versions: {
PKESK: 3,
SEIPD: 1,
one_pass_sig: 3,
keymaterial: {
V4: 4
},
signature: {
V2: 2,
V3: 3,
V4: 4
}
},
signatures: {
key: 0x99,
userid: 0xb4,
user_attribute: 0xd1
},
key_flags: {
certify_keys: 0x1,
sign_data: 0x2,
encrypt_comm: 0x4,
encrypt_storage: 0x8,
private_split: 0x10,
auth: 0x20,
shared: 0x80
},
features: {
modification_detection: 0x1
},
key_server_preferences: {
no_modify: 0x80
},
compression: {
none: 0,
zip: 1,
zlib: 2,
bzip: 3
}
};
exports.kb = {
key_encryption: {
none: 0,
triplesec_v1: 1,
triplesec_v2: 2,
triplesec_v3: 3
},
packet_tags: {
p3skb: 0x201,
signature: 0x202,
encryption: 0x203
},
public_key_algorithms: {
NACL_EDDSA: 0x20,
NACL_DH: 0x21
},
versions: {
V1: 1
},
padding: {
EMSA_PCKS1_v1_5: 3,
RSASSA_PSS: 4
},
key_defaults: {
primary: {
expire_in: 0,
nbits: {
RSA: 4096,
ECDSA: 384,
DSA: 2048
}
},
sub: {
expire_in: 24 * 60 * 60 * 365 * 8,
nbits: {
RSA: 2048,
ECDH: 256,
ECDSA: 256,
DSA: 2048,
ELGAMAL: 2048
}
}
},
kid: {
version: 1,
trailer: 0x0a,
algo: 8,
len: 32
}
};
exports.ops = {
encrypt: 0x1,
decrypt: 0x2,
verify: 0x4,
sign: 0x8
};
exports.header = {
version: "Keybase OpenPGP",
comment: "https://keybase.io/crypto"
};
config = {
default_key_expire_in: 24 * 60 * 60 * 365 * 4
};
for (k in config) {
v = config[k];
exports[k] = v;
}
}).call(this);
},{}],6:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseKey, BaseKeyPair, BigInteger, C, K, MRF, Pair, Priv, Pub, SRF, bn, bufeq_secure, iced, konst, make_esc, nbits, nbv, __iced_k, __iced_k_noop, _ref, _ref1, _ref2, _ref3,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
bn = require('./bn');
nbits = bn.nbits, nbv = bn.nbv, BigInteger = bn.BigInteger;
_ref = require('./rand'), SRF = _ref.SRF, MRF = _ref.MRF;
_ref1 = require('./util'), bufeq_secure = _ref1.bufeq_secure, ASP = _ref1.ASP;
make_esc = require('iced-error').make_esc;
konst = require('./const');
C = konst.openpgp;
K = konst.kb;
_ref2 = require('./basekeypair'), BaseKey = _ref2.BaseKey, BaseKeyPair = _ref2.BaseKeyPair;
_ref3 = require('./rand'), SRF = _ref3.SRF, MRF = _ref3.MRF;
Pub = (function(_super) {
__extends(Pub, _super);
Pub.type = C.public_key_algorithms.DSA;
Pub.prototype.type = Pub.type;
Pub.ORDER = ['p', 'q', 'g', 'y'];
Pub.prototype.ORDER = Pub.ORDER;
function Pub(_arg) {
this.p = _arg.p, this.q = _arg.q, this.g = _arg.g, this.y = _arg.y;
}
Pub.alloc = function(raw) {
return BaseKey.alloc(Pub, raw);
};
Pub.prototype.trunc_hash = function(h) {
return bn.bn_from_left_n_bits(h, this.q.bitLength());
};
Pub.prototype.nbits = function() {
var _ref4;
return (_ref4 = this.p) != null ? _ref4.bitLength() : void 0;
};
Pub.prototype.verify = function(_arg, h, cb) {
var err, hi, r, s, u1, u2, v, w;
r = _arg[0], s = _arg[1];
err = null;
hi = this.trunc_hash(h);
w = s.modInverse(this.q);
u1 = hi.multiply(w).mod(this.q);
u2 = r.multiply(w).mod(this.q);
v = this.g.modPow(u1, this.p).multiply(this.y.modPow(u2, this.p)).mod(this.p).mod(this.q);
if (!v.equals(r)) {
err = new Error("verification failed");
}
return cb(err);
};
return Pub;
})(BaseKey);
Priv = (function(_super) {
__extends(Priv, _super);
Priv.ORDER = ['x'];
Priv.prototype.ORDER = Priv.ORDER;
function Priv(_arg) {
this.x = _arg.x, this.pub = _arg.pub;
}
Priv.alloc = function(raw, pub) {
return BaseKey.alloc(Priv, raw, {
pub: pub
});
};
Priv.prototype.sign = function(h, cb) {
var err, g, hi, k, p, q, r, s, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref4;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
_ref4 = this.pub, p = _ref4.p, q = _ref4.q, g = _ref4.g;
hi = this.pub.trunc_hash(h);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/dsa.iced",
funcname: "Priv.sign"
});
SRF().random_zn(q.subtract(bn.nbv(2)), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return k = arguments[0];
};
})(),
lineno: 76
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
k = k.add(bn.BigInteger.ONE);
r = g.modPow(k, p).mod(q);
s = (k.modInverse(q).multiply(hi.add(_this.x.multiply(r)))).mod(q);
return cb([r, s]);
};
})(this));
};
return Priv;
})(BaseKey);
Pair = (function(_super) {
__extends(Pair, _super);
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
Pair.type = C.public_key_algorithms.DSA;
Pair.prototype.type = Pair.type;
Pair.prototype.get_type = function() {
return this.type;
};
Pair.klass_name = "DSA";
function Pair(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
Pair.__super__.constructor.call(this, {
pub: pub,
priv: priv
});
}
Pair.parse = function(pub_raw) {
return BaseKeyPair.parse(Pair, pub_raw);
};
Pair.prototype.can_encrypt = function() {
return false;
};
Pair.prototype.fulfills_flags = function(flags) {
var good_for;
good_for = this.good_for_flags();
return (flags & good_for) === flags;
};
Pair.prototype.good_for_flags = function() {
return C.key_flags.certify_keys | C.key_flags.sign_data;
};
Pair.prototype.verify_unpad_and_check_hash = function(_arg, cb) {
var data, err, hash, hasher, sig, v, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref4;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sig = _arg.sig, data = _arg.data, hasher = _arg.hasher, hash = _arg.hash;
err = null;
if (Buffer.isBuffer(sig)) {
_ref4 = Pair.read_sig_from_buf(sig), err = _ref4[0], sig = _ref4[1];
}
hash || (hash = hasher(data));
(function(_this) {
return (function(__iced_k) {
if (sig.length !== 2) {
return __iced_k(err = new Error("Expected 2 Bigints in the signature"));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/dsa.iced",
funcname: "Pair.verify_unpad_and_check_hash"
});
_this.pub.verify(sig, hash, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return v = arguments[1];
};
})(),
lineno: 126
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Pair.prototype.pad_and_sign = function(data, _arg, cb) {
var h, hasher, s, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
hasher = _arg.hasher;
hasher || (hasher = SHA512);
h = hasher(data);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/dsa.iced",
funcname: "Pair.pad_and_sign"
});
_this.priv.sign(h, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 135
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(null, Buffer.concat((function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = sig.length; _i < _len; _i++) {
s = sig[_i];
_results.push(s.to_mpi_buffer());
}
return _results;
})()));
};
})(this));
};
Pair.parse_sig = function(slice) {
var buf, err, n, ret, _ref4;
buf = slice.peek_rest_to_buffer();
_ref4 = Pair.read_sig_from_buf(buf), err = _ref4[0], ret = _ref4[1], n = _ref4[2];
if (err != null) {
throw err;
}
slice.advance(n);
return ret;
};
Pair.read_sig_from_buf = function(buf) {
var err, n, o, order, orig_len, ret, x;
orig_len = buf.length;
order = ['r', 's'];
err = null;
ret = (function() {
var _i, _len, _ref4, _results;
_results = [];
for (_i = 0, _len = order.length; _i < _len; _i++) {
o = order[_i];
if (!(err == null)) {
continue;
}
_ref4 = bn.mpi_from_buffer(buf), err = _ref4[0], x = _ref4[1], buf = _ref4[2];
_results.push(x);
}
return _results;
})();
n = orig_len - buf.length;
return [err, ret, n];
};
return Pair;
})(BaseKeyPair);
exports.DSA = exports.Pair = Pair;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./basekeypair":2,"./bn":4,"./const":5,"./rand":65,"./util":70,"buffer":80,"iced-error":115,"iced-runtime":118}],7:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseEccKey, SlicerBuffer, alloc_by_nbits, alloc_by_oid, iced, __iced_k, __iced_k_noop, _ref;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
SlicerBuffer = require('../openpgp/buffer').SlicerBuffer;
_ref = require('./curves'), alloc_by_nbits = _ref.alloc_by_nbits, alloc_by_oid = _ref.alloc_by_oid;
exports.BaseEccKey = BaseEccKey = (function() {
function BaseEccKey(_arg) {
this.curve = _arg.curve, this.R = _arg.R;
}
BaseEccKey.prototype.serialize = function() {
var oid;
oid = this.curve.oid;
return Buffer.concat([new Buffer([oid.length]), oid, this.curve.point_to_mpi_buffer(this.R)]);
};
BaseEccKey._alloc = function(klass, raw) {
var R, curve, err, l, len, oid, pre, pub, sb, _ref1, _ref2;
sb = new SlicerBuffer(raw);
pre = sb.rem();
l = sb.read_uint8();
oid = sb.read_buffer(l);
_ref1 = alloc_by_oid(oid), err = _ref1[0], curve = _ref1[1];
if (err != null) {
throw err;
}
_ref2 = curve.mpi_point_from_slicer_buffer(sb), err = _ref2[0], R = _ref2[1];
if (err != null) {
throw err;
}
pub = new klass({
curve: curve,
R: R
});
pub.read_params(sb);
len = pre - sb.rem();
return [pub, len];
};
BaseEccKey.alloc = function(klass, raw) {
var e, err, len, pub, _ref1;
pub = len = err = null;
try {
_ref1 = BaseEccKey._alloc(klass, raw), pub = _ref1[0], len = _ref1[1];
} catch (_error) {
e = _error;
err = e;
}
return [err, pub, len];
};
BaseEccKey.prototype.validity_check = function(cb) {
return cb(null);
};
return BaseEccKey;
})();
exports.generate = function(_arg, cb) {
var Pair, R, asp, curve, err, nbits, priv, pub, ret, x, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref1;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
nbits = _arg.nbits, asp = _arg.asp, Pair = _arg.Pair;
ret = null;
_ref1 = alloc_by_nbits(nbits), err = _ref1[0], curve = _ref1[1];
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/base.iced",
funcname: "generate"
});
curve.random_scalar(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return x = arguments[0];
};
})(),
lineno: 55
}));
__iced_deferrals._fulfill();
})(function() {
R = curve.G.multiply(x);
pub = new Pair.Pub({
curve: curve,
R: R
});
priv = new Pair.Priv({
pub: pub,
x: x
});
return __iced_k(ret = new Pair({
pub: pub,
priv: priv
}));
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../openpgp/buffer":35,"./curves":8,"buffer":80,"iced-runtime":118}],8:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BigInteger, Curve, H, OIDS, OID_LOOKUP, SRF, SlicerBuffer, base, bn, iced, k, nist_p256, nist_p384, nist_p521, uint_to_buffer, v, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
BigInteger = require('../bn').BigInteger;
base = require('keybase-ecurve');
uint_to_buffer = require('../util').uint_to_buffer;
SlicerBuffer = require('../openpgp/buffer').SlicerBuffer;
SRF = require('../rand').SRF;
bn = require('../bn');
exports.H = H = function(x) {
return BigInteger.fromHex(x.split(/\s+/).join(''));
};
exports.Curve = Curve = (function(_super) {
__extends(Curve, _super);
function Curve(_arg) {
var Gx, Gy, a, b, h, n, p;
p = _arg.p, a = _arg.a, b = _arg.b, Gx = _arg.Gx, Gy = _arg.Gy, n = _arg.n, h = _arg.h, this.oid = _arg.oid;
h || (h = BigInteger.ONE);
Curve.__super__.constructor.call(this, p, a, b, Gx, Gy, n, h);
}
Curve.prototype.mkpoint = function(_arg) {
var x, y;
x = _arg.x, y = _arg.y;
return base.Point.fromAffine(this, x, y);
};
Curve.prototype.nbits = function() {
return this.p.bitLength();
};
Curve.prototype.mpi_bit_size = function() {
return 2 * this.mpi_coord_bit_size() + 3;
};
Curve.prototype.mpi_coord_byte_size = function() {
return Math.ceil(this.nbits() / 8);
};
Curve.prototype.mpi_coord_bit_size = function() {
return this.mpi_coord_byte_size() * 8;
};
Curve.prototype._mpi_point_from_slicer_buffer = function(sb) {
var b, n_bits, n_bytes, point, x, y, _ref;
n_bits = sb.read_uint16();
if (n_bits !== (b = this.mpi_bit_size())) {
throw new Error("Need " + b + " bits for this curve; got " + n_bits);
}
if (sb.read_uint8() !== 0x4) {
throw new Error("Can only handle 0x4 prefix for MPI representations");
}
n_bytes = this.mpi_coord_byte_size();
_ref = [BigInteger.fromBuffer(sb.read_buffer(n_bytes)), BigInteger.fromBuffer(sb.read_buffer(n_bytes))], x = _ref[0], y = _ref[1];
point = this.mkpoint({
x: x,
y: y
});
if (!this.isOnCurve(point)) {
throw new Error("Given ECC point isn't on the given curve; data corruption detected.");
}
return [null, point];
};
Curve.prototype.mpi_point_from_buffer = function(b) {
return this.mpi_point_from_slicer_buffer(new SlicerBuffer(b));
};
Curve.prototype.mpi_point_from_slicer_buffer = function(sb) {
var e, err, point, _ref;
err = point = null;
try {
_ref = this._mpi_point_from_slicer_buffer(sb), err = _ref[0], point = _ref[1];
} catch (_error) {
e = _error;
err = e;
}
return [err, point];
};
Curve.prototype.point_to_mpi_buffer_compact = function(p) {
return p.affineX.toBuffer(this.p.byteLength());
};
Curve.prototype.point_to_mpi_buffer = function(p) {
var ret, sz;
sz = this.mpi_coord_byte_size();
ret = Buffer.concat([uint_to_buffer(16, this.mpi_bit_size()), new Buffer([0x4]), p.affineX.toBuffer(sz), p.affineY.toBuffer(sz)]);
return ret;
};
Curve.prototype.random_scalar = function(cb) {
var k, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/ecc/curves.iced",
funcname: "Curve.random_scalar"
});
SRF().random_zn(_this.n.subtract(bn.nbv(2)), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return k = arguments[0];
};
})(),
lineno: 97
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
k = k.add(bn.BigInteger.ONE);
return cb(k);
};
})(this));
};
return Curve;
})(base.Curve);
exports.nist_p256 = nist_p256 = function() {
var Gx, Gy, a, b, n, p;
p = H("FFFFFFFF 00000001 00000000 00000000 00000000 FFFFFFFF FFFFFFFF FFFFFFFF");
a = H("FFFFFFFF 00000001 00000000 00000000 00000000 FFFFFFFF FFFFFFFF FFFFFFFC");
b = H("5AC635D8 AA3A93E7 B3EBBD55 769886BC 651D06B0 CC53B0F6 3BCE3C3E 27D2604B");
n = H("FFFFFFFF 00000000 FFFFFFFF FFFFFFFF BCE6FAAD A7179E84 F3B9CAC2 FC632551");
Gx = H("6B17D1F2 E12C4247 F8BCE6E5 63A440F2 77037D81 2DEB33A0 F4A13945 D898C296");
Gy = H("4FE342E2 FE1A7F9B 8EE7EB4A 7C0F9E16 2BCE3357 6B315ECE CBB64068 37BF51F5");
return new Curve({
p: p,
a: a,
b: b,
Gx: Gx,
Gy: Gy,
n: n,
oid: OIDS.nist_p256
});
};
exports.nist_p384 = nist_p384 = function() {
var Gx, Gy, a, b, n, p;
p = H('ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff');
a = H('ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc');
b = H('b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef');
n = H('ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973');
Gx = H('aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7');
Gy = H('3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f');
return new Curve({
p: p,
a: a,
b: b,
Gx: Gx,
Gy: Gy,
n: n,
oid: OIDS.nist_p384
});
};
exports.nist_p521 = nist_p521 = function() {
var Gx, Gy, a, b, n, p;
p = H('000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff');
a = H('000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc');
b = H('00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00');
n = H('000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409');
Gx = H('000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66');
Gy = H('00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650');
return new Curve({
p: p,
a: a,
b: b,
Gx: Gx,
Gy: Gy,
n: n,
oid: OIDS.nist_p521
});
};
OIDS = {
nist_p256: new Buffer([0x2a, 0x86, 0x48, 0xce, 0x3d, 0x03, 0x01, 0x07]),
nist_p384: new Buffer([0x2b, 0x81, 0x04, 0x00, 0x22]),
nist_p521: new Buffer([0x2b, 0x81, 0x04, 0x00, 0x23])
};
OID_LOOKUP = {};
for (k in OIDS) {
v = OIDS[k];
OID_LOOKUP[v.toString('hex')] = exports[k];
}
exports.alloc_by_oid = function(oid) {
var curve, err, f;
if (Buffer.isBuffer(oid)) {
oid = oid.toString('hex');
}
err = curve = null;
if ((f = OID_LOOKUP[oid.toLowerCase()]) != null) {
curve = f();
} else {
err = new Error("Unknown curve OID: " + oid);
}
return [err, curve];
};
exports.alloc_by_nbits = function(nbits) {
var err, f, ret;
ret = err = null;
nbits || (nbits = 256);
f = (function() {
switch (nbits) {
case 256:
return nist_p256;
case 384:
return nist_p384;
case 521:
return nist_p521;
default:
return null;
}
})();
if (f != null) {
ret = f();
} else {
err = new Error("No curve for " + nbits + " bits");
}
return [err, ret];
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../bn":4,"../openpgp/buffer":35,"../rand":65,"../util":70,"buffer":80,"iced-runtime":118,"keybase-ecurve":148}],9:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseEccKey, BaseKey, BaseKeyPair, Const, Output, Pair, Priv, Pub, SlicerBuffer, bufeq_secure, ecc_pkcs5_pad_data, generate, hashmod, iced, konst, make_esc, sym, uint_to_buffer, unwrap, wrap, __iced_k, __iced_k_noop, _ref, _ref1, _ref2, _ref3,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
_ref = require('../util'), uint_to_buffer = _ref.uint_to_buffer, bufeq_secure = _ref.bufeq_secure, ASP = _ref.ASP;
make_esc = require('iced-error').make_esc;
konst = require('../const');
Const = konst.openpgp;
_ref1 = require('../basekeypair'), BaseKeyPair = _ref1.BaseKeyPair, BaseKey = _ref1.BaseKey;
ecc_pkcs5_pad_data = require('../pad').ecc_pkcs5_pad_data;
_ref2 = require('./base'), generate = _ref2.generate, BaseEccKey = _ref2.BaseEccKey;
hashmod = require('../hash');
sym = require('../symmetric');
SlicerBuffer = require('../openpgp/buffer').SlicerBuffer;
_ref3 = require('../rfc3394'), wrap = _ref3.wrap, unwrap = _ref3.unwrap;
Pub = (function(_super) {
__extends(Pub, _super);
function Pub() {
return Pub.__super__.constructor.apply(this, arguments);
}
Pub.type = Const.public_key_algorithms.ECDH;
Pub.prototype.type = Pub.type;
Pub.prototype.apply_defaults = function() {
this.cipher || (this.cipher = sym.get_cipher());
return this.hasher || (this.hasher = hashmod.SHA512);
};
Pub.prototype.read_params = function(sb) {
var n, size, v, val;
if ((size = sb.read_uint8()) < (n = Const.ecdh.param_bytes)) {
throw new Error("Need at least " + n + " bytes of params; got " + size);
}
if ((val = sb.read_uint8()) !== (v = Const.ecdh.version)) {
throw new Error("Cannot deal with future extensions, byte=" + val + "; wanted " + v);
}
this.hasher = hashmod.alloc_or_throw(sb.read_uint8());
this.cipher = sym.get_cipher(sb.read_uint8());
return sb.advance(size - 3);
};
Pub.alloc = function(raw) {
return BaseEccKey.alloc(Pub, raw);
};
Pub.prototype.serialize_params = function() {
return Buffer.concat([uint_to_buffer(8, Const.ecdh.param_bytes), uint_to_buffer(8, Const.ecdh.version), uint_to_buffer(8, this.hasher.type), uint_to_buffer(8, this.cipher.type)]);
};
Pub.prototype.serialize = function() {
return Buffer.concat([Pub.__super__.serialize.call(this), this.serialize_params()]);
};
Pub.prototype.format_params = function(_arg) {
var fingerprint;
fingerprint = _arg.fingerprint;
return Buffer.concat([uint_to_buffer(8, this.curve.oid.length), this.curve.oid, uint_to_buffer(8, this.type), this.serialize_params(), new Buffer("Anonymous Sender ", "utf8"), fingerprint]);
};
Pub.prototype.kdf = function(_arg) {
var X, X_compact, buf, hash, o_bytes, params;
X = _arg.X, params = _arg.params;
o_bytes = this.cipher.key_size;
X_compact = this.curve.point_to_mpi_buffer_compact(X);
buf = Buffer.concat([new Buffer([0, 0, 0, 1]), X_compact, params]);
hash = this.hasher(buf);
return hash.slice(0, o_bytes);
};
Pub.prototype.encrypt = function(m, _arg, cb) {
var C, G, S, V, fingerprint, key, n, params, v, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref4;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
fingerprint = _arg.fingerprint;
_ref4 = this.curve, n = _ref4.n, G = _ref4.G;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdh.iced",
funcname: "Pub.encrypt"
});
_this.curve.random_scalar(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return v = arguments[0];
};
})(),
lineno: 100
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
V = G.multiply(v);
S = _this.R.multiply(v);
params = _this.format_params({
fingerprint: fingerprint
});
key = _this.kdf({
X: S,
params: params
});
C = wrap({
key: key,
plaintext: m,
cipher: _this.cipher
});
return cb({
V: V,
C: C
});
};
})(this));
};
return Pub;
})(BaseEccKey);
Priv = (function(_super) {
__extends(Priv, _super);
Priv.ORDER = ['x'];
Priv.prototype.ORDER = Priv.ORDER;
function Priv(_arg) {
this.x = _arg.x, this.pub = _arg.pub;
}
Priv.prototype.serialize = function() {
return this.x.to_mpi_buffer();
};
Priv.alloc = function(raw, pub) {
return BaseKey.alloc(Priv, raw, {
pub: pub
});
};
Priv.prototype.decrypt = function(c, _arg, cb) {
var S, V, curve, err, esc, fingerprint, key, params, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
fingerprint = _arg.fingerprint;
esc = make_esc(cb, "Priv::decrypt");
curve = this.pub.curve;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdh.iced",
funcname: "Priv.decrypt"
});
c.load_V(curve, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return V = arguments[0];
};
})(),
lineno: 141
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
var _ref4;
S = V.multiply(_this.x);
params = _this.pub.format_params({
fingerprint: fingerprint
});
key = _this.pub.kdf({
X: S,
params: params
});
_ref4 = unwrap({
key: key,
ciphertext: c.C,
cipher: _this.pub.cipher
}), err = _ref4[0], ret = _ref4[1];
return cb(err, ret);
};
})(this));
};
return Priv;
})(BaseKey);
Pair = (function(_super) {
__extends(Pair, _super);
function Pair() {
return Pair.__super__.constructor.apply(this, arguments);
}
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
Pair.type = Const.public_key_algorithms.ECDH;
Pair.prototype.type = Pair.type;
Pair.klass_name = "ECDH";
Pair.prototype.get_type = function() {
return this.type;
};
Pair.prototype.fulfills_flags = function(flags) {
var good_for;
good_for = Const.key_flags.encrypt_comm | Const.key_flags.encrypt_storage;
return (flags & good_for) === flags;
};
Pair.prototype.can_sign = function() {
return false;
};
Pair.parse = function(pub_raw) {
var ret;
ret = BaseKeyPair.parse(Pair, pub_raw);
return ret;
};
Pair.prototype.max_value = function() {
return this.pub.p;
};
Pair.prototype.pad_and_encrypt = function(data, _arg, cb) {
var C, V, err, fingerprint, m, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref4;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
fingerprint = _arg.fingerprint;
err = ret = null;
_ref4 = ecc_pkcs5_pad_data(data), err = _ref4[0], m = _ref4[1];
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdh.iced",
funcname: "Pair.pad_and_encrypt"
});
_this.pub.encrypt(m, {
fingerprint: fingerprint
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
C = arguments[0].C;
return V = arguments[0].V;
};
})(),
lineno: 196
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(ret = _this.export_output({
C: C,
V: V,
curve: _this.pub.curve
}));
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
Pair.prototype.decrypt_and_unpad = function(ciphertext, _arg, cb) {
var err, fingerprint, m, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
fingerprint = _arg.fingerprint;
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdh.iced",
funcname: "Pair.decrypt_and_unpad"
});
_this.priv.decrypt(ciphertext, {
fingerprint: fingerprint
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return m = arguments[1];
};
})(),
lineno: 204
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, m, true);
};
})(this));
};
Pair.parse_output = function(buf) {
return Output.parse(buf);
};
Pair.prototype.export_output = function(args) {
return new Output(args);
};
Pair.generate = function(_arg, cb) {
var asp, err, nbits, pair, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
nbits = _arg.nbits, asp = _arg.asp;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdh.iced",
funcname: "Pair.generate"
});
generate({
nbits: nbits,
asp: asp,
Pair: Pair
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return pair = arguments[1];
};
})(),
lineno: 215
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
pair.pub.apply_defaults();
}
return cb(err, pair);
};
})(this));
};
return Pair;
})(BaseKeyPair);
Output = (function() {
function Output(_arg) {
this.V_buf = _arg.V_buf, this.C = _arg.C, this.V = _arg.V, this.curve = _arg.curve;
}
Output.prototype.load_V = function(curve, cb) {
var err, _ref4;
this.curve = curve;
_ref4 = curve.mpi_point_from_buffer(this.V_buf), err = _ref4[0], this.V = _ref4[1];
return cb(err, this.V);
};
Output.parse = function(buf) {
var C, V_buf, a, n_bits, n_bytes, ret, sb;
sb = new SlicerBuffer(buf);
n_bits = sb.read_uint16();
n_bytes = Math.ceil(n_bits / 8);
V_buf = Buffer.concat([buf.slice(0, 2), sb.read_buffer(n_bytes)]);
n_bytes = sb.read_uint8();
C = sb.consume_rest_to_buffer();
if ((a = C.length) !== n_bytes) {
throw new Error("bad C input: wanted " + n_bytes + " bytes, but got " + a);
}
ret = new Output({
V_buf: V_buf,
C: C
});
return ret;
};
Output.prototype.get_V_buf = function() {
if (this.V_buf == null) {
this.V_buf = this.curve.point_to_mpi_buffer(this.V);
}
return this.V_buf;
};
Output.prototype.hide = function(_arg, cb) {
var key, max, slosh;
key = _arg.key, max = _arg.max, slosh = _arg.slosh;
return cb(null);
};
Output.prototype.find = function(_arg) {
var key;
key = _arg.key;
};
Output.prototype.good_for_flags = function() {
return C.key_flags.encrypt_comm | C.key_flags.encrypt_storage;
};
Output.prototype.output = function() {
return Buffer.concat([this.get_V_buf(), uint_to_buffer(8, this.C.length), this.C]);
};
return Output;
})();
exports.ECDH = exports.Pair = Pair;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../basekeypair":2,"../const":5,"../hash":14,"../openpgp/buffer":35,"../pad":62,"../rfc3394":66,"../symmetric":68,"../util":70,"./base":7,"buffer":80,"iced-error":115,"iced-runtime":118}],10:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseEccKey, BaseKey, BaseKeyPair, BigInteger, C, ECDH, K, Pair, Priv, Pub, bn, bufeq_secure, generate, iced, konst, make_esc, nbits, nbv, uint_to_buffer, __iced_k, __iced_k_noop, _ref, _ref1, _ref2,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
bn = require('../bn');
nbits = bn.nbits, nbv = bn.nbv, BigInteger = bn.BigInteger;
_ref = require('../util'), uint_to_buffer = _ref.uint_to_buffer, bufeq_secure = _ref.bufeq_secure, ASP = _ref.ASP;
make_esc = require('iced-error').make_esc;
konst = require('../const');
C = konst.openpgp;
K = konst.kb;
_ref1 = require('../basekeypair'), BaseKeyPair = _ref1.BaseKeyPair, BaseKey = _ref1.BaseKey;
_ref2 = require('./base'), generate = _ref2.generate, BaseEccKey = _ref2.BaseEccKey;
ECDH = require('./ecdh').ECDH;
Pub = (function(_super) {
__extends(Pub, _super);
function Pub() {
return Pub.__super__.constructor.apply(this, arguments);
}
Pub.type = C.public_key_algorithms.ECDSA;
Pub.prototype.type = Pub.type;
Pub.prototype.nbits = function() {
return this.curve.nbits();
};
Pub.prototype.read_params = function(sb) {};
Pub.prototype.trunc_hash = function(h) {
return bn.bn_from_left_n_bits(h, this.nbits());
};
Pub.alloc = function(raw) {
return BaseEccKey.alloc(Pub, raw);
};
Pub.prototype.verify = function(_arg, h, cb) {
var err, hi, n, p, r, s, u1, u2, v, w;
r = _arg[0], s = _arg[1];
err = null;
hi = this.trunc_hash(h);
if ((r.signum() <= 0) || (r.compareTo(this.curve.p) > 0)) {
err = new Error("bad r");
} else if ((r.signum() <= 0) || (s.compareTo(this.curve.p) > 0)) {
err = new Error("bad s");
} else {
n = this.curve.n;
w = s.modInverse(n);
u1 = hi.multiply(w).mod(n);
u2 = r.multiply(w).mod(n);
p = this.curve.G.multiplyTwo(u1, this.R, u2);
v = p.affineX.mod(n);
if (!v.equals(r)) {
err = new Error("verification failed");
}
}
return cb(err);
};
return Pub;
})(BaseEccKey);
Priv = (function(_super) {
__extends(Priv, _super);
Priv.ORDER = ['x'];
Priv.prototype.ORDER = Priv.ORDER;
function Priv(_arg) {
this.x = _arg.x, this.pub = _arg.pub;
}
Priv.alloc = function(raw, pub) {
return BaseKey.alloc(Priv, raw, {
pub: pub
});
};
Priv.prototype.sign = function(h, cb) {
var G, Q, err, hi, k, n, r, s, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref3;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
_ref3 = this.pub.curve, n = _ref3.n, G = _ref3.G;
hi = this.pub.trunc_hash(h);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdsa.iced",
funcname: "Priv.sign"
});
_this.pub.curve.random_scalar(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return k = arguments[0];
};
})(),
lineno: 79
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
Q = G.multiply(k);
r = Q.affineX.mod(n);
if (r.signum() === 0) {
throw new Error("invalid r-value");
}
s = k.modInverse(n).multiply(hi.add(_this.x.multiply(r))).mod(n);
return cb([r, s]);
};
})(this));
};
return Priv;
})(BaseKey);
Pair = (function(_super) {
__extends(Pair, _super);
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
Pair.type = C.public_key_algorithms.ECDSA;
Pair.prototype.type = Pair.type;
Pair.klass_name = "ECDSA";
Pair.prototype.get_type = function() {
return this.type;
};
function Pair(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
Pair.__super__.constructor.call(this, {
pub: pub,
priv: priv
});
}
Pair.parse = function(pub_raw) {
return BaseKeyPair.parse(Pair, pub_raw);
};
Pair.prototype.can_encrypt = function() {
return false;
};
Pair.subkey_algo = function(flags) {
if (flags & (C.key_flags.certify_keys | C.key_flags.sign_data)) {
return Pair;
} else {
return ECDH;
}
};
Pair.prototype.fulfills_flags = function(flags) {
var good_for;
good_for = C.key_flags.certify_keys | C.key_flags.sign_data;
return (flags & good_for) === flags;
};
Pair.prototype.verify_unpad_and_check_hash = function(_arg, cb) {
var data, err, hash, hasher, sig, v, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref3;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sig = _arg.sig, data = _arg.data, hasher = _arg.hasher, hash = _arg.hash;
err = null;
if (Buffer.isBuffer(sig)) {
_ref3 = Pair.read_sig_from_buf(sig), err = _ref3[0], sig = _ref3[1];
}
hash || (hash = hasher(data));
(function(_this) {
return (function(__iced_k) {
if (sig.length !== 2) {
return __iced_k(err = new Error("Expected 2 Bigints in the signature"));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdsa.iced",
funcname: "Pair.verify_unpad_and_check_hash"
});
_this.pub.verify(sig, hash, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return v = arguments[1];
};
})(),
lineno: 132
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Pair.prototype.pad_and_sign = function(data, _arg, cb) {
var h, hasher, s, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
hasher = _arg.hasher;
hasher || (hasher = SHA512);
h = hasher(data);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ecc/ecdsa.iced",
funcname: "Pair.pad_and_sign"
});
_this.priv.sign(h, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 141
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(null, Buffer.concat((function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = sig.length; _i < _len; _i++) {
s = sig[_i];
_results.push(s.to_mpi_buffer());
}
return _results;
})()));
};
})(this));
};
Pair.parse_sig = function(slice) {
var buf, err, n, ret, _ref3;
buf = slice.peek_rest_to_buffer();
_ref3 = Pair.read_sig_from_buf(buf), err = _ref3[0], ret = _ref3[1], n = _ref3[2];
if (err != null) {
throw err;
}
slice.advance(n);
return ret;
};
Pair.read_sig_from_buf = function(buf) {
var err, n, o, order, orig_len, ret, x;
orig_len = buf.length;
order = ['r', 's'];
err = null;
ret = (function() {
var _i, _len, _ref3, _results;
_results = [];
for (_i = 0, _len = order.length; _i < _len; _i++) {
o = order[_i];
if (!(err == null)) {
continue;
}
_ref3 = bn.mpi_from_buffer(buf), err = _ref3[0], x = _ref3[1], buf = _ref3[2];
_results.push(x);
}
return _results;
})();
n = orig_len - buf.length;
return [err, ret, n];
};
Pair.prototype.good_for_flags = function() {
return C.key_flags.certify_keys | C.key_flags.sign_data;
};
Pair.generate = function(_arg, cb) {
var asp, nbits;
nbits = _arg.nbits, asp = _arg.asp;
return generate({
nbits: nbits,
asp: asp,
Pair: Pair
}, cb);
};
return Pair;
})(BaseKeyPair);
exports.ECDSA = exports.Pair = Pair;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../basekeypair":2,"../bn":4,"../const":5,"../util":70,"./base":7,"./ecdh":9,"buffer":80,"iced-error":115,"iced-runtime":118}],11:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
exports.curves = require('./curves');
exports.ECDSA = require('./ecdsa').ECDSA;
exports.ECDH = require('./ecdh').ECDH;
}).call(this);
},{"./curves":8,"./ecdh":9,"./ecdsa":10}],12:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseKey, BaseKeyPair, C, K, MRF, Output, Pair, Priv, Pub, SRF, bn, bufeq_secure, eme_pkcs1_decode, eme_pkcs1_encode, iced, konst, make_esc, __iced_k, __iced_k_noop, _ref, _ref1, _ref2, _ref3,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
bn = require('./bn');
_ref = require('./util'), bufeq_secure = _ref.bufeq_secure, ASP = _ref.ASP;
make_esc = require('iced-error').make_esc;
konst = require('./const');
C = konst.openpgp;
K = konst.kb;
_ref1 = require('./basekeypair'), BaseKeyPair = _ref1.BaseKeyPair, BaseKey = _ref1.BaseKey;
_ref2 = require('./rand'), SRF = _ref2.SRF, MRF = _ref2.MRF;
_ref3 = require('./pad'), eme_pkcs1_encode = _ref3.eme_pkcs1_encode, eme_pkcs1_decode = _ref3.eme_pkcs1_decode;
Pub = (function(_super) {
__extends(Pub, _super);
Pub.type = C.public_key_algorithms.ELGAMAL;
Pub.prototype.type = Pub.type;
Pub.ORDER = ['p', 'g', 'y'];
Pub.prototype.ORDER = Pub.ORDER;
function Pub(_arg) {
this.p = _arg.p, this.g = _arg.g, this.y = _arg.y;
}
Pub.alloc = function(raw) {
return BaseKey.alloc(Pub, raw);
};
Pub.prototype.encrypt = function(m, cb) {
var c, k, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/elgamal.iced",
funcname: "Pub.encrypt"
});
SRF().random_zn(_this.p.subtract(bn.nbv(2)), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return k = arguments[0];
};
})(),
lineno: 35
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
k = k.add(bn.BigInteger.ONE);
c = [_this.g.modPow(k, _this.p), _this.y.modPow(k, _this.p).multiply(m).mod(_this.p)];
return cb(c);
};
})(this));
};
return Pub;
})(BaseKey);
Priv = (function(_super) {
__extends(Priv, _super);
Priv.ORDER = ['x'];
Priv.prototype.ORDER = Priv.ORDER;
function Priv(_arg) {
this.x = _arg.x, this.pub = _arg.pub;
}
Priv.prototype.serialize = function() {
return this.x.to_mpi_buffer();
};
Priv.alloc = function(raw, pub) {
return BaseKey.alloc(Priv, raw, {
pub: pub
});
};
Priv.prototype.decrypt = function(c, cb) {
var p, ret;
p = this.pub.p;
ret = c[0].modPow(this.x, p).modInverse(p).multiply(c[1]).mod(p);
return cb(null, ret);
};
return Priv;
})(BaseKey);
Pair = (function(_super) {
__extends(Pair, _super);
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
Pair.type = C.public_key_algorithms.ELGAMAL;
Pair.klass_name = "ELGAMAL";
Pair.prototype.type = Pair.type;
Pair.prototype.get_type = function() {
return this.type;
};
Pair.prototype.fulfills_flags = function(flags) {
var good_for;
good_for = this.good_for_flags();
return (flags & good_for) === flags;
};
Pair.prototype.good_for_flags = function() {
return C.key_flags.encrypt_comm | C.key_flags.encrypt_storage;
};
function Pair(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
Pair.__super__.constructor.call(this, {
pub: pub,
priv: priv
});
}
Pair.prototype.can_sign = function() {
return false;
};
Pair.parse = function(pub_raw) {
var ret;
ret = BaseKeyPair.parse(Pair, pub_raw);
return ret;
};
Pair.prototype.max_value = function() {
return this.pub.p;
};
Pair.prototype.pad_and_encrypt = function(data, params, cb) {
var c_mpis, err, m, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/elgamal.iced",
funcname: "Pair.pad_and_encrypt"
});
eme_pkcs1_encode(data, _this.pub.p.mpi_byte_length(), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return m = arguments[1];
};
})(),
lineno: 112
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/elgamal.iced",
funcname: "Pair.pad_and_encrypt"
});
_this.pub.encrypt(m, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return c_mpis = arguments[0];
};
})(),
lineno: 114
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(ret = _this.export_output({
c_mpis: c_mpis
}));
});
} else {
return __iced_k();
}
})(function() {
return cb(err, ret);
});
};
})(this));
};
Pair.prototype.decrypt_and_unpad = function(ciphertext, params, cb) {
var b, err, m, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/elgamal.iced",
funcname: "Pair.decrypt_and_unpad"
});
_this.priv.decrypt(ciphertext.c(), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return m = arguments[1];
};
})(),
lineno: 122
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
var _ref4;
if (err == null) {
b = m.to_padded_octets(_this.pub.p);
_ref4 = eme_pkcs1_decode(b), err = _ref4[0], ret = _ref4[1];
}
return cb(err, ret);
};
})(this));
};
Pair.parse_output = function(buf) {
return Output.parse(buf);
};
Pair.prototype.export_output = function(args) {
return new Output(args);
};
return Pair;
})(BaseKeyPair);
Output = (function() {
function Output(_arg) {
this.c_mpis = _arg.c_mpis, this.c_bufs = _arg.c_bufs;
}
Output.parse = function(buf) {
var c_mpis, err, i, n, ret;
c_mpis = (function() {
var _i, _ref4, _results;
_results = [];
for (i = _i = 0; _i < 2; i = ++_i) {
_ref4 = bn.mpi_from_buffer(buf), err = _ref4[0], ret = _ref4[1], buf = _ref4[2], n = _ref4[3];
if (err != null) {
throw err;
}
_results.push(ret);
}
return _results;
})();
if (buf.length !== 0) {
throw new Error("junk at the end of input");
}
return new Output({
c_mpis: c_mpis
});
};
Output.prototype.c = function() {
return this.c_mpis;
};
Output.prototype.hide = function(_arg, cb) {
var c_mpi, err, key, max, new_c_mpis, slosh, tmp, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, max = _arg.max, slosh = _arg.slosh;
max || (max = 4096);
slosh || (slosh = 128);
err = null;
this.c_bufs = null;
new_c_mpis = [];
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref4, _results, _while;
_ref4 = _this.c_mpis;
_len = _ref4.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
c_mpi = _ref4[_i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/elgamal.iced",
funcname: "Output.hide"
});
key.hide({
i: c_mpi,
max: max,
slosh: slosh
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return tmp = arguments[1];
};
})(),
lineno: 164
}));
__iced_deferrals._fulfill();
})(function() {
new_c_mpis.push(tmp);
(function(__iced_k) {
if (err != null) {
(function(__iced_k) {
_break()
})(__iced_k);
} else {
return __iced_k();
}
})(_next);
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
if (err == null) {
_this.c_mpis = new_c_mpis;
}
return cb(err);
};
})(this));
};
Output.prototype.find = function(_arg) {
var j, key;
key = _arg.key;
return this.c_mpis = (function() {
var _i, _len, _ref4, _results;
_ref4 = this.c_mpis;
_results = [];
for (_i = 0, _len = _ref4.length; _i < _len; _i++) {
j = _ref4[_i];
_results.push(key.find(j));
}
return _results;
}).call(this);
};
Output.prototype.get_c_bufs = function() {
var i;
if (this.c_bufs != null) {
return this.c_bufs;
} else {
return this.c_bufs = (function() {
var _i, _len, _ref4, _results;
_ref4 = this.c_mpis;
_results = [];
for (_i = 0, _len = _ref4.length; _i < _len; _i++) {
i = _ref4[_i];
_results.push(i.to_mpi_buffer());
}
return _results;
}).call(this);
}
};
Output.prototype.output = function() {
return Buffer.concat(this.get_c_bufs());
};
return Output;
})();
exports.ElGamal = exports.Pair = Pair;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./basekeypair":2,"./bn":4,"./const":5,"./pad":62,"./rand":65,"./util":70,"buffer":80,"iced-error":115,"iced-runtime":118}],13:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseKey, BaseKeyPair, C, K, MRF, Pair, Priv, Pub, SRF, bn, bufeq_secure, eme_pkcs1_decode, eme_pkcs1_encode, konst, make_esc, _ref, _ref1, _ref2, _ref3,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
bn = require('./bn');
_ref = require('./util'), bufeq_secure = _ref.bufeq_secure, ASP = _ref.ASP;
make_esc = require('iced-error').make_esc;
konst = require('./const');
C = konst.openpgp;
K = konst.kb;
_ref1 = require('./basekeypair'), BaseKeyPair = _ref1.BaseKeyPair, BaseKey = _ref1.BaseKey;
_ref2 = require('./rand'), SRF = _ref2.SRF, MRF = _ref2.MRF;
_ref3 = require('./pad'), eme_pkcs1_encode = _ref3.eme_pkcs1_encode, eme_pkcs1_decode = _ref3.eme_pkcs1_decode;
Pub = (function(_super) {
__extends(Pub, _super);
Pub.type = C.public_key_algorithms.ELGAMAL_SIGN_AND_ENCRYPT;
Pub.prototype.type = Pub.type;
Pub.ORDER = [];
Pub.prototype.ORDER = Pub.ORDER;
function Pub(raw) {
this.raw = raw;
}
Pub.alloc = function(raw) {
return BaseKey.alloc(Pub, raw);
};
Pub.prototype.encrypt = function(m, cb) {
return cb(null);
};
return Pub;
})(BaseKey);
Priv = (function(_super) {
__extends(Priv, _super);
Priv.ORDER = [];
Priv.prototype.ORDER = Priv.ORDER;
function Priv(raw) {
this.raw = raw;
}
Priv.prototype.serialize = function() {
return null;
};
Priv.alloc = function(raw, pub) {
return BaseKey.alloc(Priv, raw, {
pub: pub
});
};
Priv.prototype.decrypt = function(c, cb) {
return cb(null);
};
return Priv;
})(BaseKey);
Pair = (function(_super) {
__extends(Pair, _super);
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
Pair.type = C.public_key_algorithms.ELGAMAL_SIGN_AND_ENCRYPT;
Pair.prototype.type = Pair.type;
Pair.prototype.fulfills_flags = function(flags) {
return false;
};
Pair.prototype.is_toxic = function() {
return true;
};
function Pair(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
Pair.__super__.constructor.call(this, {
pub: pub,
priv: priv
});
}
Pair.prototype.can_sign = function() {
return false;
};
Pair.prototype.can_decrypt = function() {
return false;
};
Pair.prototype.err = function() {
return new Error("refusing to use ElGamal Sign+Encrypt");
};
Pair.parse = function(pub_raw) {
var ret;
ret = BaseKeyPair.parse(Pair, pub_raw);
return ret;
};
Pair.prototype.pad_and_encrypt = function(data, cb) {
return cb(this.err(), null);
};
Pair.prototype.decrypt_and_unpad = function(ciphertext, params, cb) {
return cb(this.err(), null);
};
Pair.parse_output = function(buf) {
return null;
};
Pair.prototype.export_output = function(args) {
return null;
};
return Pair;
})(BaseKeyPair);
exports.ElGamalSignEncrypt = exports.Pair = Pair;
}).call(this);
},{"./basekeypair":2,"./bn":4,"./const":5,"./pad":62,"./rand":65,"./util":70,"iced-error":115}],14:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, WordArray, algos, alloc, alloc_or_throw, decorate, k, make_hasher, make_streamer, streamers, triplesec, v, _lookup, _ref;
C = require('./const').openpgp;
triplesec = require('triplesec');
WordArray = triplesec.WordArray;
algos = triplesec.hash;
decorate = function(f, klass, name, type) {
f.type = type;
f.algname = name;
f.output_length = klass.output_size;
f.klass = klass;
return f;
};
make_hasher = function(klass, name, type) {
var f;
if (klass != null) {
f = function(x) {
return (new klass).bufhash(x);
};
return decorate(f, klass, name, type);
} else {
return null;
}
};
make_streamer = function(klass, name, type) {
return function() {
var obj, ret;
obj = new klass;
ret = function(buf) {
return obj.clone().finalize(buf != null ? WordArray.from_buffer(buf) : null).to_buffer();
};
ret.update = function(buf) {
if (buf != null) {
obj.update(WordArray.from_buffer(buf));
}
return this;
};
return decorate(ret, klass, name, type);
};
};
_lookup = {};
exports.streamers = streamers = {};
_ref = C.hash_algorithms;
for (k in _ref) {
v = _ref[k];
_lookup[v] = k;
exports[k] = make_hasher(algos[k], k, v);
streamers[k] = make_streamer(algos[k], k, v);
}
exports.alloc = alloc = function(typ) {
var klass, name, ret;
ret = null;
name = _lookup[typ];
if (name != null) {
klass = algos[name];
}
if (klass != null) {
ret = make_hasher(klass, name, typ);
}
return ret;
};
exports.alloc_or_throw = alloc_or_throw = function(typ) {
var ret;
ret = alloc(typ);
if (!ret) {
throw new Error("unknown hash type: " + typ);
}
return ret;
};
}).call(this);
},{"./const":5,"triplesec":181}],15:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, pjs;
C = require('./const');
pjs = require('../package.json');
exports.header = {
version: C.header.version + (" v" + pjs.version),
comment: C.header.comment
};
}).call(this);
},{"../package.json":202,"./const":5}],16:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var K, SHA256, alloc, bufeq_secure, katch, null_hash, obj_extract, pack, purepack, read_base64, seal, unpack, unseal, _ref, _ref1;
K = require('../const').kb;
_ref = require('../hash'), alloc = _ref.alloc, SHA256 = _ref.SHA256;
purepack = require('purepack');
_ref1 = require('../util'), katch = _ref1.katch, obj_extract = _ref1.obj_extract, bufeq_secure = _ref1.bufeq_secure;
null_hash = new Buffer(0);
pack = function(x) {
return purepack.pack(x, {
sort_keys: true
});
};
unpack = function(x) {
return purepack.unpack(x);
};
seal = function(_arg) {
var dohash, hasher, obj, oo, packed;
obj = _arg.obj, dohash = _arg.dohash;
hasher = SHA256;
oo = {
version: K.versions.V1,
tag: obj.tag,
body: obj.body
};
if (dohash) {
oo.hash = {
type: hasher.type,
value: null_hash
};
packed = pack(oo);
oo.hash.value = hasher(packed);
}
return pack(oo);
};
read_base64 = function(raw) {
var parts;
parts = (raw.split(/\s+/)).join('');
return new Buffer(parts, 'base64');
};
unseal = function(buf) {
var h, hasher, hv, oo, t, _ref2;
oo = unpack(buf);
if ((hv = oo != null ? (_ref2 = oo.hash) != null ? _ref2.value : void 0 : void 0) != null) {
oo.hash.value = null_hash;
hasher = alloc((t = oo.hash.type));
if (hasher == null) {
throw new Error("unknown hash algo: " + t);
}
h = hasher(pack(oo));
if (!bufeq_secure(h, hv)) {
throw new Error("hash mismatch");
}
if (oo.version !== K.versions.V1) {
throw new Error("unknown version");
}
}
return obj_extract(oo, ['tag', 'body']);
};
exports.seal = seal;
exports.pack = pack;
exports.unseal = unseal;
exports.unpack = unpack;
exports.read_base64 = read_base64;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../hash":14,"../util":70,"buffer":80,"purepack":169}],17:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, DH, EdDSA, EncKeyManager, Encryption, K, KeyManager, KeyManagerInterface, Signature, SignatureEngine, akatch, alloc, asyncify, base64u, box, buffer_xor, encode, iced, konst, make_esc, unbox, __iced_k, __iced_k_noop, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; },
__indexOf = [].indexOf || function(item) { for (var i = 0, l = this.length; i < l; i++) { if (i in this && this[i] === item) return i; } return -1; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
KeyManagerInterface = require('../kmi').KeyManagerInterface;
make_esc = require('iced-error').make_esc;
encode = require('./encode');
_ref = require('../util'), base64u = _ref.base64u, buffer_xor = _ref.buffer_xor, asyncify = _ref.asyncify, akatch = _ref.akatch;
konst = require('../const');
alloc = require('./packet/alloc').alloc;
Signature = require('./packet/signature').Signature;
Encryption = require('./packet/encryption').Encryption;
EdDSA = require('../nacl/eddsa').EdDSA;
DH = require('../nacl/dh').DH;
K = konst.kb;
C = konst.openpgp;
KeyManager = (function(_super) {
__extends(KeyManager, _super);
function KeyManager(_arg) {
this.key = _arg.key, this.server_half = _arg.server_half;
}
KeyManager.generate = function(_arg, cb) {
var algo, err, key, klass, seed, server_half, split, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
algo = _arg.algo, seed = _arg.seed, split = _arg.split, server_half = _arg.server_half, klass = _arg.klass;
algo || (algo = EdDSA);
klass || (klass = KeyManager);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced",
funcname: "KeyManager.generate"
});
algo.generate({
split: split,
seed: seed,
server_half: server_half
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
key = arguments[1];
return server_half = arguments[2];
};
})(),
lineno: 29
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, new klass({
key: key,
server_half: server_half
}));
};
})(this));
};
KeyManager.prototype.get_mask = function() {
return C.key_flags.sign_data | C.key_flags.certify_keys | C.key_flags.auth;
};
KeyManager.prototype.fetch = function(key_ids, flags, cb) {
var err, key, mask, s;
s = this.key.ekid().toString('hex');
key = null;
mask = this.get_mask();
if ((__indexOf.call(key_ids, s) >= 0) && (flags & mask) === flags) {
key = this.key;
} else {
err = new Error("Key not found");
}
return cb(err, key);
};
KeyManager.prototype.get_keypair = function() {
return this.key;
};
KeyManager.prototype.get_primary_keypair = function() {
return this.key;
};
KeyManager.prototype.can_verify = function() {
return true;
};
KeyManager.prototype.eq = function(km2) {
return this.key.eq(km2.key);
};
KeyManager.import_public = function(_arg, cb) {
var err, hex, key, raw, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref1;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
hex = _arg.hex, raw = _arg.raw;
err = ret = null;
if (hex != null) {
raw = new Buffer(hex, 'hex');
}
_ref1 = EdDSA.parse_kb(raw), err = _ref1[0], key = _ref1[1];
(function(_this) {
return (function(__iced_k) {
if (err != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced",
funcname: "KeyManager.import_public"
});
EncKeyManager.import_public({
raw: raw
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 66
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(ret = new KeyManager({
key: key
}));
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
KeyManager.prototype.check_public_eq = function(km2) {
return this.eq(km2);
};
KeyManager.prototype.export_public = function(_arg, cb) {
var asp, regen, ret;
asp = _arg.asp, regen = _arg.regen;
ret = this.key.ekid().toString('hex');
return cb(null, ret);
};
KeyManager.prototype.export_server_half = function() {
var _ref1;
return (_ref1 = this.server_half) != null ? _ref1.toString('hex') : void 0;
};
KeyManager.prototype.get_ekid = function() {
return this.get_keypair().ekid();
};
KeyManager.prototype.get_fp2 = function() {
return this.get_ekid();
};
KeyManager.prototype.get_fp2_formatted = function() {
return base64u.encode(this.get_fp2());
};
KeyManager.prototype.get_type = function() {
return "kb";
};
KeyManager.prototype.make_sig_eng = function() {
return new SignatureEngine({
km: this
});
};
return KeyManager;
})(KeyManagerInterface);
EncKeyManager = (function(_super) {
__extends(EncKeyManager, _super);
function EncKeyManager() {
return EncKeyManager.__super__.constructor.apply(this, arguments);
}
EncKeyManager.generate = function(params, cb) {
params.algo = DH;
params.klass = EncKeyManager;
return KeyManager.generate(params, cb);
};
EncKeyManager.prototype.make_sig_eng = function() {
return null;
};
EncKeyManager.prototype.can_sign = function() {
return false;
};
EncKeyManager.prototype.can_verify = function() {
return false;
};
EncKeyManager.prototype.get_mask = function() {
return C.key_flags.encrypt_comm | C.key_flags.encrypt_storage;
};
EncKeyManager.import_public = function(_arg, cb) {
var err, hex, key, raw, ret, _ref1;
hex = _arg.hex, raw = _arg.raw;
err = ret = null;
if (hex != null) {
raw = new Buffer(hex, 'hex');
}
_ref1 = DH.parse_kb(raw), err = _ref1[0], key = _ref1[1];
if (err == null) {
ret = new EncKeyManager({
key: key
});
}
return cb(err, ret);
};
return EncKeyManager;
})(KeyManager);
exports.unbox = unbox = function(_arg, cb) {
var armored, binary, encrypt_for, esc, packet, rawobj, res, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
armored = _arg.armored, binary = _arg.binary, rawobj = _arg.rawobj, encrypt_for = _arg.encrypt_for;
esc = make_esc(cb, "unbox");
(function(_this) {
return (function(__iced_k) {
if ((armored == null) && (rawobj == null) && (binary == null)) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced"
});
athrow(new Error("need either 'armored' or 'binary' or 'rawobj'"), esc(__iced_deferrals.defer({
lineno: 134
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
if (armored != null) {
binary = new Buffer(armored, 'base64');
}
(function(__iced_k) {
if (binary != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced"
});
akatch((function() {
return encode.unseal(binary);
}), esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return rawobj = arguments[0];
};
})(),
lineno: 139
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced"
});
asyncify(alloc(rawobj), esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return packet = arguments[0];
};
})(),
lineno: 141
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced"
});
packet.unbox({
encrypt_for: encrypt_for
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return res = arguments[0];
};
})(),
lineno: 142
})));
__iced_deferrals._fulfill();
})(function() {
if (res.keypair != null) {
res.km = new KeyManager({
key: res.keypair
});
}
if (res.sender_keypair != null) {
res.sender_km = new KeyManager({
key: res.sender_keypair
});
}
if (res.receiver_keypair != null) {
res.receiver_km = new KeyManager({
key: res.receiver_keypair
});
}
return cb(null, res, binary);
});
});
});
};
})(this));
};
box = function(_arg, cb) {
var anonymous, armored, encrypt_for, esc, msg, packed, packet, sealed, sign_with, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
msg = _arg.msg, sign_with = _arg.sign_with, encrypt_for = _arg.encrypt_for, anonymous = _arg.anonymous;
esc = make_esc(cb, "box");
(function(_this) {
return (function(__iced_k) {
if (encrypt_for != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced"
});
Encryption.box({
sign_with: sign_with,
encrypt_for: encrypt_for,
plaintext: msg,
anonymous: anonymous
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return packet = arguments[0];
};
})(),
lineno: 158
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced"
});
Signature.box({
km: sign_with,
payload: msg
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return packet = arguments[0];
};
})(),
lineno: 160
})));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
packed = packet.frame_packet();
sealed = encode.seal({
obj: packed,
dohash: false
});
armored = sealed.toString('base64');
return cb(null, armored, sealed);
};
})(this));
};
SignatureEngine = (function() {
function SignatureEngine(_arg) {
this.km = _arg.km;
}
SignatureEngine.prototype.get_km = function() {
return this.km;
};
SignatureEngine.prototype.box = function(msg, cb) {
var armored, esc, out, raw, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "SignatureEngine::box");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced",
funcname: "SignatureEngine.box"
});
box({
msg: msg,
sign_with: _this.km
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
armored = arguments[0];
return raw = arguments[1];
};
})(),
lineno: 179
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
out = {
type: "kb",
armored: armored,
kb: armored,
raw: raw
};
return cb(null, out);
};
})(this));
};
SignatureEngine.prototype.unbox = function(msg, cb) {
var a, arg, b, binary, err, esc, payload, res, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "SignatureEngine::unbox");
err = payload = null;
arg = Buffer.isBuffer(msg) ? {
binary: msg
} : {
armored: msg
};
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/hilev.iced",
funcname: "SignatureEngine.unbox"
});
unbox(arg, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
res = arguments[0];
return binary = arguments[1];
};
})(),
lineno: 190
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (!res.km.eq(_this.km)) {
a = res.km.get_ekid().toString('hex');
b = _this.km.get_ekid().toString('hex');
err = new Error("Got wrong signing key: " + a + " != " + b);
} else {
payload = res.payload;
}
return cb(err, payload, binary);
};
})(this));
};
return SignatureEngine;
})();
module.exports = {
box: box,
unbox: unbox,
KeyManager: KeyManager,
EncKeyManager: EncKeyManager
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../kmi":27,"../nacl/dh":30,"../nacl/eddsa":31,"../util":70,"./encode":16,"./packet/alloc":18,"./packet/encryption":20,"./packet/signature":22,"buffer":80,"iced-error":115,"iced-runtime":118}],18:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var Encryption, K, P3SKB, Signature;
K = require('../../const').kb;
P3SKB = require('./p3skb').P3SKB;
Signature = require('./signature').Signature;
Encryption = require('./encryption').Encryption;
exports.alloc = function(_arg) {
var body, err, ret, tag;
tag = _arg.tag, body = _arg.body;
ret = err = null;
ret = (function() {
switch (tag) {
case K.packet_tags.p3skb:
return P3SKB.alloc({
tag: tag,
body: body
});
case K.packet_tags.signature:
return Signature.alloc({
tag: tag,
body: body
});
case K.packet_tags.encryption:
return Encryption.alloc({
tag: tag,
body: body
});
default:
err = new Error("unknown packet tag: " + tag);
return null;
}
})();
return [err, ret];
};
}).call(this);
},{"../../const":5,"./encryption":20,"./p3skb":21,"./signature":22}],19:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var K, Packet, seal, util;
util = require('../../util');
seal = require('../encode').seal;
K = require('../../const').kb;
Packet = (function() {
function Packet() {}
Packet.prototype.frame_packet = function() {
return {
tag: this.tag(),
body: this.get_packet_body()
};
};
Packet.prototype.frame_packet_armored = function(_arg) {
var dohash, obj;
dohash = _arg.dohash;
obj = this.frame_packet();
return seal({
obj: obj,
dohash: dohash
}).toString('base64');
};
Packet.prototype.is_signature = function() {
return false;
};
Packet.prototype.is_p3skb = function() {
return false;
};
Packet.alloc = function(_arg) {
var P3SKB, Signature, body, err, ret, tag;
tag = _arg.tag, body = _arg.body;
ret = err = null;
ret = (function() {
switch (tag) {
case K.packet_tags.p3skb:
P3SKB = require('./p3skb').P3SKB;
return P3SKB.alloc({
tag: tag,
body: body
});
case K.packet_tags.signature:
Signature = require('./signature').Signature;
return Signature.alloc({
tag: tag,
body: body
});
default:
err = new Error("unknown packet tag: " + tag);
return null;
}
})();
return [err, ret];
};
Packet.prototype.unbox = function(params, cb) {
return cb(new Error("unbox() unimplemented for tag=" + this.tag));
};
return Packet;
})();
exports.Packet = Packet;
}).call(this);
},{"../../const":5,"../../util":70,"../encode":16,"./p3skb":21,"./signature":22}],20:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Encryption, K, Packet, dh, iced, konst, make_esc, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
konst = require('../../const');
K = konst.kb;
C = konst.openpgp;
Packet = require('./base').Packet;
make_esc = require('iced-error').make_esc;
dh = require('../../nacl/main').dh;
Encryption = (function(_super) {
__extends(Encryption, _super);
Encryption.ENC_TYPE = K.public_key_algorithms.NACL_DH;
Encryption.tag = function() {
return K.packet_tags.encryption;
};
Encryption.prototype.tag = function() {
return Encryption.tag();
};
function Encryption(_arg) {
this.encrypt_for = _arg.encrypt_for, this.sign_with = _arg.sign_with, this.plaintext = _arg.plaintext, this.ciphertext = _arg.ciphertext, this.sender_key = _arg.sender_key, this.nonce = _arg.nonce, this.anonymous = _arg.anonymous;
Encryption.__super__.constructor.call(this);
this.emphemeral = false;
}
Encryption.prototype.get_packet_body = function() {
var enc_type;
enc_type = Encryption.ENC_TYPE;
return {
sender_key: this.sender_key,
ciphertext: this.ciphertext,
nonce: this.nonce,
enc_type: enc_type,
receiver_key: this.receiver_key
};
};
Encryption.alloc = function(_arg) {
var a, b, body, err, ret, tag;
tag = _arg.tag, body = _arg.body;
ret = null;
err = tag !== Encryption.tag() ? new Error("wrong tag found: " + tag) : (a = body.enc_type) !== (b = Encryption.ENC_TYPE) ? err = new Error("Expected Curve25519 DH (type " + b + "); got " + a) : (ret = new Encryption(body), null);
if (err != null) {
throw err;
}
return ret;
};
Encryption.prototype.is_signature = function() {
return false;
};
Encryption.prototype.get_sender_keypair = function(_arg, cb) {
var encrypt, err, ret, sign_with, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sign_with = _arg.sign_with, encrypt = _arg.encrypt;
err = ret = null;
(function(_this) {
return (function(__iced_k) {
if (sign_with != null) {
return __iced_k(ret = sign_with.get_keypair());
} else {
(function(__iced_k) {
if (_this.sign_with != null) {
return __iced_k(ret = _this.sign_with.get_keypair());
} else {
(function(__iced_k) {
if (_this.sender_keypair != null) {
return __iced_k(ret = _this.sender_keypair);
} else {
(function(__iced_k) {
var _ref;
if (encrypt) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.get_sender_keypair"
});
dh.Pair.generate({}, __iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
err = arguments[0];
return __slot_1.sender_keypair = arguments[1];
};
})(_this),
lineno: 56
}));
__iced_deferrals._fulfill();
})(function() {
ret = _this.sender_keypair;
return __iced_k(_this.emphemeral = true);
});
} else {
return __iced_k(_this.sender_key != null ? ((_ref = dh.Pair.parse_kb(_this.sender_key), err = _ref[0], _this.sender_keypair = _ref[1], _ref), err == null ? ret = _this.sender_keypair : void 0) : err = new Error("Cannot encrypt without a sender keypair"));
}
})(__iced_k);
}
})(__iced_k);
}
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
Encryption.prototype.encrypt = function(params, cb) {
var esc, plaintext, recvr, sender, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "encrypt");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.encrypt"
});
_this.get_sender_keypair({
encrypt: true
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sender = arguments[0];
};
})(),
lineno: 71
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
recvr = _this.encrypt_for.get_keypair();
plaintext = Buffer.concat([_this.plaintext, new Buffer([_this.emphemeral ? 1 : 0])]);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.encrypt"
});
recvr.encrypt_kb({
plaintext: plaintext,
sender: sender
}, esc(__iced_deferrals.defer({
assign_fn: (function(__slot_1, __slot_2) {
return function() {
__slot_1.ciphertext = arguments[0].ciphertext;
return __slot_2.nonce = arguments[0].nonce;
};
})(_this, _this),
lineno: 77
})));
__iced_deferrals._fulfill();
})(function() {
if (!(_this.anonymous && !_this.emphemeral)) {
_this.sender_key = sender.ekid();
}
if (!_this.anonymous) {
_this.receiver_key = recvr.ekid();
}
return cb(null);
});
};
})(this));
};
Encryption.prototype.decrypt = function(_arg, cb) {
var args, encrypt_for, esc, plaintext, recvr, sender, sign_with, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sign_with = _arg.sign_with, encrypt_for = _arg.encrypt_for;
esc = make_esc(cb, "decrypt");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.decrypt"
});
_this.get_sender_keypair({
sign_with: sign_with
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sender = arguments[0];
};
})(),
lineno: 86
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
args = {
ciphertext: _this.ciphertext,
nonce: _this.nonce,
sender: sender
};
recvr = encrypt_for.get_keypair();
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.decrypt"
});
recvr.decrypt_kb(args, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return plaintext = arguments[0];
};
})(),
lineno: 89
})));
__iced_deferrals._fulfill();
})(function() {
_this.plaintext = plaintext.slice(0, -1);
_this.emphemeral = plaintext.slice(-1)[0];
return cb(null, {
sender_keypair: sender,
plaintext: _this.plaintext,
emphemeral: _this.emphemeral,
receiver_keypair: recvr
});
});
};
})(this));
};
Encryption.prototype.unbox = function(_arg, cb) {
var encrypt_for, err, res, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
encrypt_for = _arg.encrypt_for;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.unbox"
});
_this.decrypt({
encrypt_for: encrypt_for
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return res = arguments[1];
};
})(),
lineno: 97
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, res);
};
})(this));
};
Encryption.box = function(_arg, cb) {
var anonymous, encrypt_for, err, packet, plaintext, sign_with, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sign_with = _arg.sign_with, encrypt_for = _arg.encrypt_for, plaintext = _arg.plaintext, anonymous = _arg.anonymous;
packet = new Encryption({
sign_with: sign_with,
encrypt_for: encrypt_for,
plaintext: plaintext,
anonymous: anonymous
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/encryption.iced",
funcname: "Encryption.box"
});
packet.encrypt({}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 104
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err !== "undefined" && err !== null) {
packet = null;
}
return cb(err, packet);
};
})(this));
};
return Encryption;
})(Packet);
exports.Encryption = Encryption;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../const":5,"../../nacl/main":32,"./base":19,"buffer":80,"iced-error":115,"iced-runtime":118}],21:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var Decryptor, K, P3SKB, Packet, SHA512, box, bufeq_secure, bufferify, iced, make_esc, native_rng, pack, rsa, triplesec, __iced_k, __iced_k_noop, _ref, _ref1,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
K = require('../../const').kb;
triplesec = require('triplesec');
SHA512 = require('../../hash').SHA512;
Decryptor = triplesec.Decryptor;
native_rng = triplesec.prng.native_rng;
Packet = require('./base').Packet;
_ref = require('../encode'), pack = _ref.pack, box = _ref.box;
make_esc = require('iced-error').make_esc;
rsa = require('../../rsa');
_ref1 = require('../../util'), bufeq_secure = _ref1.bufeq_secure, bufferify = _ref1.bufferify;
P3SKB = (function(_super) {
__extends(P3SKB, _super);
P3SKB.tag = function() {
return K.packet_tags.p3skb;
};
P3SKB.prototype.tag = function() {
return P3SKB.tag();
};
function P3SKB(_arg) {
var priv, priv_clear;
this.pub = _arg.pub, priv_clear = _arg.priv_clear, priv = _arg.priv, this.type = _arg.type;
P3SKB.__super__.constructor.call(this);
this.priv = priv != null ? priv : priv_clear != null ? {
data: priv_clear,
encryption: K.key_encryption.none
} : void 0;
}
P3SKB.prototype.get_packet_body = function() {
var ret;
ret = {
pub: this.pub,
priv: this.priv
};
if (this.type != null) {
ret.type = this.type;
}
return ret;
};
P3SKB.prototype.lock = function(_arg, cb) {
var asp, ct, err, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, tsenc = _arg.tsenc;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/p3skb.iced",
funcname: "P3SKB.lock"
});
tsenc.run({
data: _this.priv.data,
progress_hook: asp != null ? asp.progress_hook() : void 0
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ct = arguments[1];
};
})(),
lineno: 30
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
_this.priv.data = ct;
_this.priv.encryption = K.key_encryption.triplesec_v3;
}
return cb(err);
};
})(this));
};
P3SKB.prototype.unlock = function(_arg, cb) {
var asp, dec, err, progress_hook, raw, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, tsenc = _arg.tsenc;
(function(_this) {
return (function(__iced_k) {
switch (_this.priv.encryption) {
case K.key_encryption.triplesec_v3:
case K.key_encryption.triplesec_v2:
case K.key_encryption.triplesec_v1:
dec = new Decryptor({
enc: tsenc
});
progress_hook = asp != null ? asp.progress_hook() : void 0;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/p3skb.iced",
funcname: "P3SKB.unlock"
});
dec.run({
data: _this.priv.data,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return raw = arguments[1];
};
})(),
lineno: 41
}));
__iced_deferrals._fulfill();
})(function() {
dec.scrub();
return __iced_k(typeof err === "undefined" || err === null ? (_this.priv.data = raw, _this.priv.encryption = K.key_encryption.none) : void 0);
});
break;
case K.key_encryption.none:
return __iced_k();
default:
return __iced_k(err = new Error("Unknown key encryption type: " + k.encryption));
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
P3SKB.alloc = function(_arg) {
var body, tag;
tag = _arg.tag, body = _arg.body;
if (tag === P3SKB.tag()) {
return new P3SKB(body);
} else {
throw new Error("wrong tag found: " + tag);
}
};
P3SKB.prototype.has_private = function() {
return this.priv != null;
};
P3SKB.prototype.is_locked = function() {
return this.priv.encryption !== K.key_encryption.none;
};
P3SKB.prototype.get_private_data = function() {
var _ref2;
return (_ref2 = this.priv) != null ? _ref2.data : void 0;
};
P3SKB.prototype.get_public_data = function() {
return this.pub;
};
P3SKB.prototype.get_key_type = function() {
return this.type;
};
P3SKB.prototype.is_p3skb = function() {
return true;
};
return P3SKB;
})(Packet);
exports.P3SKB = P3SKB;
}).call(this);
},{"../../const":5,"../../hash":14,"../../rsa":67,"../../util":70,"../encode":16,"./base":19,"iced-error":115,"iced-runtime":118,"triplesec":181}],22:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, K, Packet, Signature, eddsa, iced, konst, make_esc, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
konst = require('../../const');
K = konst.kb;
C = konst.openpgp;
Packet = require('./base').Packet;
make_esc = require('iced-error').make_esc;
eddsa = require('../../nacl/main').eddsa;
Signature = (function(_super) {
__extends(Signature, _super);
Signature.SIG_TYPE = K.public_key_algorithms.NACL_EDDSA;
Signature.HASH_TYPE = C.hash_algorithms.SHA512;
Signature.tag = function() {
return K.packet_tags.signature;
};
Signature.prototype.tag = function() {
return Signature.tag();
};
function Signature(_arg) {
this.key = _arg.key, this.payload = _arg.payload, this.sig = _arg.sig, this.detached = _arg.detached;
Signature.__super__.constructor.call(this);
}
Signature.prototype.get_packet_body = function() {
var hash_type, sig_type;
sig_type = Signature.SIG_TYPE;
hash_type = Signature.HASH_TYPE;
return {
key: this.key,
payload: this.payload,
sig: this.sig,
detached: this.detached,
sig_type: sig_type,
hash_type: hash_type
};
};
Signature.alloc = function(_arg) {
var a, b, body, err, ret, tag;
tag = _arg.tag, body = _arg.body;
ret = null;
err = tag !== Signature.tag() ? new Error("wrong tag found: " + tag) : (a = body.hash_type) !== (b = Signature.HASH_TYPE) ? new Error("Expected SHA512 (type " + b + "); got " + a) : (a = body.sig_type) !== (b = Signature.SIG_TYPE) ? err = new Error("Expected EDDSA (type " + b + "); got " + a) : (ret = new Signature(body), null);
if (err != null) {
throw err;
}
return ret;
};
Signature.prototype.is_signature = function() {
return true;
};
Signature.prototype.verify = function(cb) {
var err, esc, km, pair, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "verify");
err = km = null;
_ref = eddsa.Pair.parse_kb(this.key), err = _ref[0], pair = _ref[1];
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/signature.iced",
funcname: "Signature.verify"
});
pair.verify_kb(_this, esc(__iced_deferrals.defer({
lineno: 58
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err, {
keypair: pair,
payload: _this.payload
});
};
})(this));
};
Signature.prototype.unbox = function(params, cb) {
var err, res, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/signature.iced",
funcname: "Signature.unbox"
});
_this.verify(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return res = arguments[1];
};
})(),
lineno: 64
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, res);
};
})(this));
};
Signature.box = function(_arg, cb) {
var detached, esc, km, packet, pair, payload, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
km = _arg.km, payload = _arg.payload;
esc = make_esc(cb, "@sign");
pair = km.get_keypair();
detached = true;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/packet/signature.iced",
funcname: "Signature.box"
});
pair.sign_kb({
payload: payload,
detached: detached
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 73
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
packet = new Signature({
key: pair.ekid(),
payload: payload,
sig: sig,
detached: detached
});
return cb(null, packet);
};
})(this));
};
return Signature;
})(Packet);
exports.Signature = Signature;
exports.sign = Signature.sign;
}).call(this);
},{"../../const":5,"../../nacl/main":32,"./base":19,"iced-error":115,"iced-runtime":118}],23:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var SRF, bufxor, genseed, iced, __iced_k, __iced_k_noop;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
SRF = require('../rand').SRF;
exports.bufxor = bufxor = function(b1, b2) {
var arr, c, i;
arr = (function() {
var _i, _len, _results;
_results = [];
for (i = _i = 0, _len = b1.length; _i < _len; i = ++_i) {
c = b1[i];
_results.push(c ^ b2[i]);
}
return _results;
})();
return new Buffer(arr);
};
exports.genseed = genseed = function(_arg, cb) {
var err, len, rseed, seed, server_half, split, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
seed = _arg.seed, split = _arg.split, len = _arg.len, server_half = _arg.server_half;
err = rseed = null;
if (server_half == null) {
server_half = null;
}
(function(_this) {
return (function(__iced_k) {
if ((seed == null) || (split && (server_half == null))) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/keybase/util.iced"
});
SRF().random_bytes(len, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return rseed = arguments[0];
};
})(),
lineno: 16
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
if ((seed != null) && seed.length !== len) {
err = new Error("Wrong seed length; need " + len + " bytes; got " + seed.length);
} else if ((seed != null) && (rseed != null)) {
server_half = rseed;
seed = bufxor(seed, rseed);
} else if ((seed != null) && (server_half != null)) {
seed = bufxor(seed, server_half);
} else if (seed == null) {
seed = rseed;
}
return cb(err, {
seed: seed,
server_half: server_half
});
};
})(this));
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../rand":65,"buffer":80,"iced-runtime":118}],24:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var KeyFetcher;
KeyFetcher = (function() {
function KeyFetcher() {}
KeyFetcher.prototype.fetch = function(ids, ops, cb) {
return cb(new Error("not implemented"));
};
return KeyFetcher;
})();
exports.KeyFetcher = KeyFetcher;
}).call(this);
},{}],25:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var KeyFetcher, PgpKeyRing, hexkid,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
KeyFetcher = require('./keyfetch').KeyFetcher;
hexkid = function(k) {
return k.toString('hex');
};
PgpKeyRing = (function(_super) {
__extends(PgpKeyRing, _super);
function PgpKeyRing() {
this._keys = {};
this._kms = {};
}
PgpKeyRing.prototype.add_key_manager = function(km) {
var k, keys, kid, _i, _len, _results;
keys = km.export_pgp_keys_to_keyring();
_results = [];
for (_i = 0, _len = keys.length; _i < _len; _i++) {
k = keys[_i];
kid = hexkid(k.key_material.get_key_id());
this._keys[kid] = k;
_results.push(this._kms[kid] = km);
}
return _results;
};
PgpKeyRing.prototype.fetch = function(key_ids, ops, cb) {
var err, i, id, k, key_material, km, obj, ret_i, _i, _len, _ref;
key_material = err = obj = null;
key_ids = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = key_ids.length; _i < _len; _i++) {
k = key_ids[_i];
_results.push(hexkid(k));
}
return _results;
})();
km = null;
for (i = _i = 0, _len = key_ids.length; _i < _len; i = ++_i) {
id = key_ids[i];
k = this._keys[id];
if (k != null ? (_ref = k.key) != null ? _ref.can_perform(ops) : void 0 : void 0) {
ret_i = i;
km = this._kms[id];
break;
}
}
if (km == null) {
err = new Error("key not found: " + (JSON.stringify(key_ids)));
}
return cb(err, km, ret_i);
};
PgpKeyRing.prototype.find_best_key = function(_arg, cb) {
var err, flags, key, key_id, kid, km;
key_id = _arg.key_id, flags = _arg.flags;
if ((km = this._kms[(kid = hexkid(key_id))]) == null) {
err = new Error("Could not find key for fingerprint " + kid);
} else if ((key = km.find_best_pgp_key(flags)) == null) {
err = new Error("no matching key for flags: " + flags);
}
return cb(err, key);
};
PgpKeyRing.prototype.lookup = function(key_id) {
return this._keys[hexkid(key_id)];
};
return PgpKeyRing;
})(KeyFetcher);
exports.PgpKeyRing = PgpKeyRing;
exports.KeyRing = PgpKeyRing;
}).call(this);
},{"./keyfetch":24}],26:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, KeyWrapper, Lifespan, Primary, Subkey,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
C = require('./const');
Lifespan = (function() {
function Lifespan(_arg) {
this.generated = _arg.generated, this.expire_in = _arg.expire_in;
if (this.expire_in == null) {
this.expire_in = C.default_key_expire_in;
}
}
return Lifespan;
})();
KeyWrapper = (function() {
function KeyWrapper(_arg) {
this.key = _arg.key, this.lifespan = _arg.lifespan, this._pgp = _arg._pgp, this._keybase = _arg._keybase, this.flags = _arg.flags;
}
KeyWrapper.prototype.ekid = function() {
return this.key.ekid();
};
return KeyWrapper;
})();
Subkey = (function(_super) {
__extends(Subkey, _super);
function Subkey(_arg) {
var flags, key, lifespan, _keybase, _pgp;
key = _arg.key, flags = _arg.flags, _pgp = _arg._pgp, _keybase = _arg._keybase, this.desc = _arg.desc, lifespan = _arg.lifespan, this.primary = _arg.primary;
Subkey.__super__.constructor.call(this, {
key: key,
lifespan: lifespan,
flags: flags,
_pgp: _pgp,
_keybase: _keybase
});
}
return Subkey;
})(KeyWrapper);
Primary = (function(_super) {
__extends(Primary, _super);
function Primary(_arg) {
var flags, key, lifespan, _keybase, _pgp;
key = _arg.key, lifespan = _arg.lifespan, flags = _arg.flags, _pgp = _arg._pgp, _keybase = _arg._keybase;
Primary.__super__.constructor.call(this, {
key: key,
lifespan: lifespan,
flags: flags,
_pgp: _pgp,
_keybase: _keybase
});
}
return Primary;
})(KeyWrapper);
exports.Lifespan = Lifespan;
exports.Subkey = Subkey;
exports.Primary = Primary;
}).call(this);
},{"./const":5}],27:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var EUI, KeyFetcher, KeyManagerInterface, SignatureEngineInterface,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
KeyFetcher = require('./keyfetch').KeyFetcher;
EUI = new Error("not implemented");
exports.KeyManagerInterface = KeyManagerInterface = (function(_super) {
__extends(KeyManagerInterface, _super);
function KeyManagerInterface() {}
KeyManagerInterface.prototype.get_pgp_fingerprint = function() {
return null;
};
KeyManagerInterface.prototype.get_ekid = function() {
return null;
};
KeyManagerInterface.prototype.get_fp2 = function() {
return null;
};
KeyManagerInterface.prototype.get_fp2_formatted = function() {
return null;
};
KeyManagerInterface.prototype.get_type = function() {
return null;
};
KeyManagerInterface.prototype.check_public_eq = function(km2) {
return this.EUI;
};
KeyManagerInterface.prototype.get_userids = function() {
return [];
};
KeyManagerInterface.prototype.get_primary_keypair = function() {
return null;
};
KeyManagerInterface.prototype.get_all_pgp_key_materials = function() {
return [];
};
KeyManagerInterface.prototype.get_userids_mark_primary = function() {
return [];
};
KeyManagerInterface.prototype.make_sig_eng = function() {
return null;
};
KeyManagerInterface.prototype.export_public = function(_arg, cb) {
var asp, regen;
asp = _arg.asp, regen = _arg.regen;
return cb(EUI, null);
};
KeyManagerInterface.prototype.can_verify = function() {
return false;
};
return KeyManagerInterface;
})(KeyFetcher);
exports.SignatureEngineInterface = SignatureEngineInterface = (function() {
function SignatureEngineInterface(_arg) {
this.km = _arg.km;
}
SignatureEngineInterface.prototype.get_km = function() {
return this.km;
};
SignatureEngineInterface.prototype.box = function(msg, cb) {
return cb(EUI);
};
SignatureEngineInterface.prototype.unbox = function(msb, cb) {
return cb(EUI);
};
return SignatureEngineInterface;
})();
}).call(this);
},{"./keyfetch":24}],28:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var Lock, NamedLock, Table, iced, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
Lock = (function() {
function Lock() {
this._open = true;
this._waiters = [];
}
Lock.prototype.acquire = function(cb) {
if (this._open) {
this._open = false;
return cb();
} else {
return this._waiters.push(cb);
}
};
Lock.prototype.release = function() {
var w;
if (this._waiters.length) {
w = this._waiters.shift();
return w();
} else {
return this._open = true;
}
};
Lock.prototype.open = function() {
return this._open;
};
return Lock;
})();
NamedLock = (function(_super) {
__extends(NamedLock, _super);
function NamedLock(tab, name) {
this.tab = tab;
this.name = name;
NamedLock.__super__.constructor.call(this);
this.refs = 0;
}
NamedLock.prototype.incref = function() {
return ++this.refs;
};
NamedLock.prototype.decref = function() {
return --this.refs;
};
NamedLock.prototype.release = function() {
NamedLock.__super__.release.call(this);
if (this.decref() === 0) {
return delete this.tab[this.name];
}
};
return NamedLock;
})(Lock);
Table = (function() {
function Table() {
this.locks = {};
}
Table.prototype.create = function(name) {
var l;
l = new NamedLock(this, name);
return this.locks[name] = l;
};
Table.prototype.acquire = function(name, cb, wait) {
var l, was_open, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
l = this.locks[name] || this.create(name);
was_open = l._open;
l.incref();
(function(_this) {
return (function(__iced_k) {
if (wait || l._open) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/lock.iced",
funcname: "Table.acquire"
});
l.acquire(__iced_deferrals.defer({
lineno: 68
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(l = null);
}
});
})(this)((function(_this) {
return function() {
return cb(l, was_open);
};
})(this));
};
Table.prototype.lookup = function(name) {
return this.locks[name];
};
return Table;
})();
exports.Lock = Lock;
exports.Table = Table;
}).call(this);
},{"iced-runtime":118}],29:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var k, m, mods, util, v, _i, _len;
mods = [require("./openpgp/keymanager"), require("./basex"), require("./openpgp/burner"), require("./openpgp/hilev"), require("./keyfetch"), require("./keyring")];
for (_i = 0, _len = mods.length; _i < _len; _i++) {
m = mods[_i];
for (k in m) {
v = m[k];
exports[k] = v;
}
}
exports.util = util = require('./util');
exports.ASP = util.ASP;
exports.rand = require('./rand');
exports["const"] = require('./const');
exports.processor = require('./openpgp/processor');
exports.armor = require('./openpgp/armor');
exports.keyring = require('./keyring');
exports.parser = require('./openpgp/parser');
exports.Buffer = Buffer;
exports.triplesec = require('triplesec');
exports.hash = require('./hash');
exports.ecc = require('./ecc/main');
exports.nacl = require('./nacl/main');
exports.kb = require('./keybase/hilev');
exports.ukm = require('./ukm');
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./basex":3,"./const":5,"./ecc/main":11,"./hash":14,"./keybase/hilev":17,"./keyfetch":24,"./keyring":25,"./nacl/main":32,"./openpgp/armor":33,"./openpgp/burner":36,"./openpgp/hilev":41,"./openpgp/keymanager":42,"./openpgp/parser":56,"./openpgp/processor":57,"./rand":65,"./ukm":69,"./util":70,"buffer":80,"triplesec":181}],30:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseKey, BaseKeyPair, K, NaclEddsa, Pair, Priv, Pub, SRF, TYPE, b2u, box, bufeq_fast, genseed, iced, konst, u2b, __iced_k, __iced_k_noop, _ref, _ref1, _ref2,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
box = require('tweetnacl').box;
SRF = require('../rand').SRF;
konst = require('../const');
K = konst.kb;
_ref = require('../util'), genseed = _ref.genseed, bufeq_fast = _ref.bufeq_fast;
_ref1 = require('../basekeypair'), BaseKey = _ref1.BaseKey, BaseKeyPair = _ref1.BaseKeyPair;
_ref2 = require('./eddsa'), b2u = _ref2.b2u, u2b = _ref2.u2b;
NaclEddsa = require('./eddsa').Pair;
TYPE = K.public_key_algorithms.NACL_DH;
b2u = function(b) {
return new Uint8Array(b);
};
u2b = function(u) {
return new Buffer(u);
};
Pub = (function() {
Pub.HEADER = new Buffer([K.kid.version, TYPE]);
Pub.TRAILER = new Buffer([K.kid.trailer]);
Pub.LEN = Pub.HEADER.length + Pub.TRAILER.length + box.publicKeyLength;
function Pub(key) {
this.key = key;
}
Pub.alloc_kb = function(kid) {
var err, key;
err = key = null;
err = kid.length !== Pub.LEN ? new Error("bad key length") : !bufeq_fast(kid.slice(-1), Pub.TRAILER) ? new Error("bad trailing byte") : !bufeq_fast(kid.slice(0, 2), Pub.HEADER) ? new Error("bad header") : (key = new Pub(kid.slice(2, -1)), null);
return [err, key];
};
Pub.prototype.serialize = function() {
return this.key;
};
Pub.prototype.nbits = function() {
return 255;
};
Pub.prototype.read_params = function(sb) {};
Pub.prototype.encrypt = function(_arg, cb) {
var nonce, plaintext, res, sender, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
plaintext = _arg.plaintext, sender = _arg.sender;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/nacl/dh.iced",
funcname: "Pub.encrypt"
});
SRF().random_bytes(box.nonceLength, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return nonce = arguments[0];
};
})(),
lineno: 49
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
res = box(b2u(plaintext), b2u(nonce), b2u(_this.key), b2u(sender.priv.key));
return cb(null, {
ciphertext: u2b(res),
nonce: nonce
});
};
})(this));
};
return Pub;
})();
Priv = (function() {
function Priv(key) {
this.key = key;
}
Priv.prototype.alloc = function(raw) {
var err, key;
err = key = null;
if (raw.length !== box.secretKeyLength) {
err = new Error("Bad secret key length");
} else {
key = new Priv(raw);
}
return [err, key];
};
Priv.prototype.decrypt = function(_arg, cb) {
var ciphertext, err, nonce, res, sender;
ciphertext = _arg.ciphertext, nonce = _arg.nonce, sender = _arg.sender;
err = res = null;
res = box.open(b2u(ciphertext), b2u(nonce), b2u(sender.pub.key), b2u(this.key));
if (res === false) {
err = new Error("decryption failed");
res = null;
} else {
res = u2b(res);
}
return cb(err, res);
};
return Priv;
})();
Pair = (function(_super) {
__extends(Pair, _super);
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
function Pair(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
Pair.__super__.constructor.call(this, {
pub: pub,
priv: priv
});
}
Pair.type = K.public_key_algorithms.NACL_DH;
Pair.prototype.type = Pair.type;
Pair.prototype.get_type = function() {
return this.type;
};
Pair.klass_name = "DH";
Pair.prototype.can_encrypt = function() {
return true;
};
Pair.prototype.can_sign = function() {
return false;
};
Pair.prototype.hash = function() {
return this.serialize();
};
Pair.prototype.encrypt_kb = function(_arg, cb) {
var plaintext, sender;
plaintext = _arg.plaintext, sender = _arg.sender;
return this.pub.encrypt({
plaintext: plaintext,
sender: sender
}, cb);
};
Pair.prototype.decrypt_kb = function(_arg, cb) {
var ciphertext, err, nonce, plaintex, plaintext, sender, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
ciphertext = _arg.ciphertext, nonce = _arg.nonce, sender = _arg.sender;
err = plaintex = null;
(function(_this) {
return (function(__iced_k) {
if (_this.priv != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/nacl/dh.iced",
funcname: "Pair.decrypt_kb"
});
_this.priv.decrypt({
ciphertext: ciphertext,
nonce: nonce,
sender: sender
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return plaintext = arguments[1];
};
})(),
lineno: 117
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(err = new Error("no secret key available"));
}
});
})(this)((function(_this) {
return function() {
return cb(err, plaintext);
};
})(this));
};
Pair.subkey_algo = function(flags) {
if (flags & (C.key_flags.encrypt_comm | C.key_flags.encrypt_storage)) {
return Pair;
} else {
return NaclEddsa;
}
};
Pair.prototype.fulfills_flags = function(flags) {
var good_for;
good_for = C.key_flags.encrypt_comm | C.key_flags.encrypt_storage;
return (flags & good_for) === flags;
};
Pair.prototype.verify_unpad_and_check_hash = function(_arg, cb) {
var data, hash, hasher, sig;
sig = _arg.sig, data = _arg.data, hasher = _arg.hasher, hash = _arg.hash;
return cb(new Error("verify_unpad_and_check_hash unsupported"));
};
Pair.prototype.pad_and_sign = function(data, _arg, cb) {
var hasher;
hasher = _arg.hasher;
return cb(new Error("pad_and_sign unsupported"));
};
Pair.parse_kb = function(pub_raw) {
return BaseKeyPair.parse_kb(Pair, pub_raw);
};
Pair.parse_sig = function(slice) {
var err;
err = new Error("@parse_sig unsupported");
throw err;
};
Pair.read_sig_from_buf = function(buf) {
var err;
err = new Error("@read_sig_from_buf unsupported");
return [err];
};
Pair.generate = function(_arg, cb) {
var arg, err, priv, pub, publicKey, secretKey, seed, server_half, split, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
server_half = _arg.server_half, seed = _arg.seed, split = _arg.split;
arg = {
seed: seed,
split: split,
len: box.secretKeyLength,
server_half: server_half
};
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/nacl/dh.iced",
funcname: "Pair.generate"
});
genseed(arg, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
server_half = arguments[1].server_half;
return seed = arguments[1].seed;
};
})(),
lineno: 178
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
var _ref3;
if (typeof err === "undefined" || err === null) {
_ref3 = box.keyPair.fromSecretKey(b2u(seed)), secretKey = _ref3.secretKey, publicKey = _ref3.publicKey;
pub = new Pub(u2b(publicKey));
priv = new Priv(u2b(secretKey));
}
return cb(err, new Pair({
pub: pub,
priv: priv
}), server_half);
};
})(this));
};
return Pair;
})(BaseKeyPair);
exports.DH = exports.Pair = Pair;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../basekeypair":2,"../const":5,"../rand":65,"../util":70,"./eddsa":31,"buffer":80,"iced-runtime":118,"tweetnacl":201}],31:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseKey, BaseKeyPair, K, NaclDh, Pair, Priv, Pub, SRF, TYPE, b2u, bufeq_fast, bufeq_secure, genseed, iced, konst, sign, u2b, __iced_k, __iced_k_noop, _ref, _ref1,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
sign = require('tweetnacl/nacl-fast').sign;
SRF = require('../rand').SRF;
konst = require('../const');
K = konst.kb;
_ref = require('../util'), genseed = _ref.genseed, bufeq_secure = _ref.bufeq_secure, bufeq_fast = _ref.bufeq_fast;
_ref1 = require('../basekeypair'), BaseKey = _ref1.BaseKey, BaseKeyPair = _ref1.BaseKeyPair;
NaclDh = require('./dh').Pair;
TYPE = K.public_key_algorithms.NACL_EDDSA;
exports.b2u = b2u = function(b) {
return new Uint8Array(b);
};
exports.u2b = u2b = function(u) {
return new Buffer(u);
};
Pub = (function() {
Pub.HEADER = new Buffer([K.kid.version, TYPE]);
Pub.TRAILER = new Buffer([K.kid.trailer]);
Pub.LEN = Pub.HEADER.length + Pub.TRAILER.length + sign.publicKeyLength;
function Pub(key) {
this.key = key;
}
Pub.alloc_kb = function(kid) {
var err, key;
err = key = null;
err = kid.length !== Pub.LEN ? new Error("bad key length") : !bufeq_fast(kid.slice(-1), Pub.TRAILER) ? new Error("bad trailing byte") : !bufeq_fast(kid.slice(0, 2), Pub.HEADER) ? new Error("bad header") : (key = new Pub(kid.slice(2, -1)), null);
return [err, key];
};
Pub.prototype.serialize = function() {
return this.key;
};
Pub.prototype.nbits = function() {
return 255;
};
Pub.prototype.read_params = function(sb) {};
Pub.prototype.verify = function(_arg, cb) {
var detached, err, payload, r_payload, sig;
payload = _arg.payload, sig = _arg.sig, detached = _arg.detached;
if (detached) {
if (payload == null) {
payload = new Buffer([]);
}
if (!sign.detached.verify(b2u(payload), b2u(sig), b2u(this.key))) {
err = new Error("signature didn't verify");
}
} else if ((r_payload = sign.open(b2u(sig), b2u(this.key))) == null) {
err = new Error("signature didn't verify");
} else if ((r_payload = u2b(r_payload)) == null) {
err = new Error("failed to convert from a Uint8Array to a buffer");
} else if ((payload != null) && !bufeq_secure(r_payload, payload)) {
err = new Error("got unexpected payload");
} else {
payload = r_payload;
}
return cb(err, payload);
};
return Pub;
})();
Priv = (function() {
function Priv(key) {
this.key = key;
}
Priv.prototype.alloc = function(raw) {
var err, key;
err = key = null;
if (raw.length !== sign.secretKeyLength) {
err = new Error("Bad secret key length");
} else {
key = new Priv(raw);
}
return [err, key];
};
Priv.prototype.sign = function(_arg, cb) {
var detached, f, payload, sig;
payload = _arg.payload, detached = _arg.detached;
f = detached ? sign.detached : sign;
sig = u2b(f(b2u(payload), b2u(this.key)));
return cb(sig);
};
return Priv;
})();
Pair = (function(_super) {
__extends(Pair, _super);
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
Pair.type = K.public_key_algorithms.NACL_EDDSA;
Pair.prototype.type = Pair.type;
Pair.prototype.get_type = function() {
return this.type;
};
Pair.klass_name = "EDDSA";
function Pair(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
Pair.__super__.constructor.call(this, {
pub: pub,
priv: priv
});
}
Pair.prototype.can_encrypt = function() {
return false;
};
Pair.prototype.hash = function() {
return this.serialize();
};
Pair.prototype.sign_kb = function(_arg, cb) {
var detached, err, payload, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
payload = _arg.payload, detached = _arg.detached;
err = sig = null;
(function(_this) {
return (function(__iced_k) {
if (_this.priv != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/nacl/eddsa.iced",
funcname: "Pair.sign_kb"
});
_this.priv.sign({
payload: payload,
detached: detached
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 119
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(err = new Error("no secret key available"));
}
});
})(this)((function(_this) {
return function() {
return cb(err, sig);
};
})(this));
};
Pair.prototype.verify_kb = function(_arg, cb) {
var detached, payload, sig;
payload = _arg.payload, sig = _arg.sig, detached = _arg.detached;
return this.pub.verify({
payload: payload,
sig: sig,
detached: detached
}, cb);
};
Pair.subkey_algo = function(flags) {
if (flags & (C.key_flags.certify_keys | C.key_flags.sign_data)) {
return Pair;
} else {
return NaclDh;
}
};
Pair.prototype.fulfills_flags = function(flags) {
var good_for;
good_for = C.key_flags.certify_keys | C.key_flags.sign_data;
return (flags & good_for) === flags;
};
Pair.prototype.verify_unpad_and_check_hash = function(_arg, cb) {
var data, hash, hasher, sig;
sig = _arg.sig, data = _arg.data, hasher = _arg.hasher, hash = _arg.hash;
return cb(new Error("verify_unpad_and_check_hash unsupported"));
};
Pair.prototype.pad_and_sign = function(data, _arg, cb) {
var hasher;
hasher = _arg.hasher;
return cb(new Error("pad_and_sign unsupported"));
};
Pair.parse_kb = function(pub_raw) {
return BaseKeyPair.parse_kb(Pair, pub_raw);
};
Pair.parse_sig = function(slice) {
var err;
err = new Error("@parse_sig unsupported");
throw err;
};
Pair.read_sig_from_buf = function(buf) {
var err;
err = new Error("@read_sig_from_buf unsupported");
return [err];
};
Pair.generate = function(_arg, cb) {
var arg, err, priv, pub, publicKey, secretKey, seed, server_half, split, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
seed = _arg.seed, split = _arg.split, server_half = _arg.server_half;
arg = {
seed: seed,
split: split,
len: sign.seedLength,
server_half: server_half
};
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/nacl/eddsa.iced",
funcname: "Pair.generate"
});
genseed(arg, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
server_half = arguments[1].server_half;
return seed = arguments[1].seed;
};
})(),
lineno: 185
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
var _ref2;
if (typeof err === "undefined" || err === null) {
_ref2 = sign.keyPair.fromSeed(b2u(seed)), secretKey = _ref2.secretKey, publicKey = _ref2.publicKey;
pub = new Pub(u2b(publicKey));
priv = new Priv(u2b(secretKey));
}
return cb(err, new Pair({
pub: pub,
priv: priv
}), server_half);
};
})(this));
};
return Pair;
})(BaseKeyPair);
exports.EdDSA = exports.Pair = Pair;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../basekeypair":2,"../const":5,"../rand":65,"../util":70,"./dh":30,"buffer":80,"iced-runtime":118,"tweetnacl/nacl-fast":200}],32:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
exports.eddsa = require('./eddsa');
exports.dh = require('./dh');
}).call(this);
},{"./dh":30,"./eddsa":31}],33:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Ch, Parser, armor, bufeq_fast, decode, katch, uint_to_buffer, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
_ref = require('../util'), katch = _ref.katch, bufeq_fast = _ref.bufeq_fast, uint_to_buffer = _ref.uint_to_buffer;
C = require('../const');
Ch = require('../header');
armor = require('pgp-utils').armor;
exports.encode = function(type, data) {
var mt;
mt = C.openpgp.message_types;
type = (function() {
switch (type) {
case mt.public_key:
return "PUBLIC KEY BLOCK";
case mt.private_key:
return "PRIVATE KEY BLOCK";
case mt.signature:
return "SIGNATURE";
case mt.generic:
return "MESSAGE";
default:
throw new Error("Cannot encode tag type " + type);
}
})();
return armor.encode(Ch, type, data);
};
Parser = (function(_super) {
__extends(Parser, _super);
function Parser() {
return Parser.__super__.constructor.apply(this, arguments);
}
Parser.prototype.parse_type = function() {
var mt;
mt = C.openpgp.message_types;
this.ret.type = (function() {
switch (this.type) {
case "PUBLIC KEY BLOCK":
return mt.public_key;
case "PRIVATE KEY BLOCK":
return mt.private_key;
case "SIGNED MESSAGE":
if (this.ret.clearsign) {
return mt.clearsign;
} else {
throw new Error("Signed message, but not clear-signed");
}
break;
case "SIGNATURE":
return mt.signature;
case "MESSAGE":
return mt.generic;
default:
throw new Error("Unknown message type: " + this.type);
}
}).call(this);
return this.ret.fields.type = this.type;
};
return Parser;
})(armor.Parser);
exports.Message = armor.Message;
exports.decode = decode = function(data) {
return katch(function() {
return (new Parser(data)).parse();
});
};
exports.mdecode = decode = function(data) {
return katch(function() {
return (new Parser(data)).mparse();
});
};
}).call(this);
},{"../const":5,"../header":15,"../util":70,"pgp-utils":163}],34:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseBurner, iced, make_esc, __iced_k, __iced_k_noop,
__slice = [].slice;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
make_esc = require('iced-error').make_esc;
ASP = require('pgp-utils').util.ASP;
exports.BaseBurner = BaseBurner = (function() {
function BaseBurner(_arg) {
this.sign_with = _arg.sign_with, this.encrypt_for = _arg.encrypt_for, this.signing_key = _arg.signing_key, this.encryption_key = _arg.encryption_key, this.asp = _arg.asp;
this.asp = ASP.make(this.asp);
}
BaseBurner.prototype._find_keys = function(cb) {
var esc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "find_keys");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/baseburner.iced",
funcname: "BaseBurner._find_keys"
});
_this._find_signing_key(esc(__iced_deferrals.defer({
lineno: 17
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/baseburner.iced",
funcname: "BaseBurner._find_keys"
});
_this._find_encryption_key(esc(__iced_deferrals.defer({
lineno: 18
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/baseburner.iced",
funcname: "BaseBurner._find_keys"
});
_this._assert_one(esc(__iced_deferrals.defer({
lineno: 19
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null);
});
});
};
})(this));
};
BaseBurner.prototype._assert_one = function(cb) {
var err;
err = null;
if (!(this.signing_key != null) && !(this.encryption_keys != null)) {
err = new Error("need either an encryption or signing key, or both");
}
return cb(err);
};
BaseBurner.prototype._find_signing_key = function(cb) {
var err;
err = null;
if ((this.sign_with != null) && (this.signing_key != null)) {
err = new Error("specify either `sign_with` or `signing_key` but not both");
} else if ((this.sign_with != null) && ((this.signing_key = this.sign_with.find_signing_pgp_key()) == null)) {
err = new Error("cannot sign with the given KeyManager");
}
return cb(err);
};
BaseBurner.prototype._find_encryption_key = function(cb) {
var arrayize, count_true, err, f, i, k, _i, _len, _ref;
err = null;
count_true = function() {
var e, i, v, _i, _len;
v = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
i = 0;
for (_i = 0, _len = v.length; _i < _len; _i++) {
e = v[_i];
if (e) {
i++;
}
}
return i;
};
arrayize = function(e) {
if (e == null) {
return [];
} else if (typeof e === 'object' && Array.isArray(e)) {
return e;
} else {
return [e];
}
};
if (count_true(this.encrypt_for != null, this.encryption_key != null, this.encryption_keys != null) > 1) {
err = new Error("specify only one of `encrypt_for`, `encryption_keys` and `encryption_key`");
} else if (this.encrypt_for != null) {
this.encryption_keys = [];
_ref = (this.encrypt_for = arrayize(this.encrypt_for));
for (i = _i = 0, _len = _ref.length; _i < _len; i = ++_i) {
f = _ref[i];
if ((k = f.find_crypt_pgp_key()) != null) {
this.encryption_keys.push(k);
} else {
err = new Error("cannot encrypt with the given KeyManager (i=" + i + ")");
break;
}
}
} else if (this.encryption_key != null) {
this.encryption_keys = [this.encryption_key];
} else if (this.encryption_keys != null) {
this.encryption_keys = arrayize(this.encryption_keys);
}
return cb(err);
};
return BaseBurner;
})();
}).call(this);
},{"iced-error":115,"iced-runtime":118,"pgp-utils":163}],35:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var SlicerBuffer;
SlicerBuffer = (function() {
function SlicerBuffer(buf, start) {
this.buf = buf;
this.start = start != null ? start : 0;
if (!Buffer.isBuffer(this.buf)) {
throw new Error('need a Buffer!');
}
this.i = this.start;
this._end = null;
}
SlicerBuffer.prototype.clamp = function(len) {
var ret;
ret = this._end;
this._end = this.i + len;
return ret;
};
SlicerBuffer.prototype.unclamp = function(e) {
this.start = this.i;
return this._end = e;
};
SlicerBuffer.prototype.len = function() {
return this.buf.length - this.start;
};
SlicerBuffer.prototype.rem = function() {
return this.buf.length - this.i;
};
SlicerBuffer.prototype.offset = function() {
return this.i - this.start;
};
SlicerBuffer.prototype.check = function() {
if ((this._end && this.i > this._end) || (this.i > this.buf.length)) {
throw new Error("read off the end of the packet @" + this.i + "/" + this.buf.length + "/" + this._end);
}
};
SlicerBuffer.prototype.read_uint8 = function() {
var ret;
ret = this.buf.readUInt8(this.i++);
this.check();
return ret;
};
SlicerBuffer.prototype.read_uint16 = function() {
var ret;
ret = this.buf.readUInt16BE(this.i);
this.i += 2;
this.check();
return ret;
};
SlicerBuffer.prototype.read_uint32 = function() {
var ret;
ret = this.buf.readUInt32BE(this.i);
this.i += 4;
this.check();
return ret;
};
SlicerBuffer.prototype.read_buffer_at_most = function(l) {
return this.read_buffer(Math.min(l, this.rem()));
};
SlicerBuffer.prototype.read_buffer = function(l) {
var ret;
ret = this.buf.slice(this.i, this.i + l);
this.i += l;
this.check();
return ret;
};
SlicerBuffer.prototype.end = function() {
return this._end || this.buf.length;
};
SlicerBuffer.prototype.peek_rest_to_buffer = function() {
return this.buf.slice(this.i, this.end());
};
SlicerBuffer.prototype.consume_rest_to_buffer = function() {
var ret;
ret = this.peek_rest_to_buffer();
this.i = this.end();
return ret;
};
SlicerBuffer.prototype.advance = function(i) {
if (i == null) {
i = 1;
}
return this.i += i;
};
SlicerBuffer.prototype.peek_to_buffer = function(len) {
return this.buf.slice(this.i, this.i + len);
};
SlicerBuffer.prototype.peek_uint8 = function() {
return this.buf.readUInt8(this.i);
};
SlicerBuffer.prototype.peek_uint16 = function() {
return this.buf.readUInt16BE(this.i);
};
SlicerBuffer.prototype.read_string = function() {
return this.read_buffer(this.read_uint8());
};
SlicerBuffer.prototype.read_v4_length = function() {
var five_byte, len, p;
p = this.peek_uint8();
five_byte = false;
len = p < 192 ? (this.advance(1), p) : p < 224 ? this.read_uint16() - (192 << 8) + 192 : p < 0xff ? (this.advance(1), 1 << (p & 0x1f)) : (this.advance(1), five_byte = true, this.read_uint32());
return [len, five_byte];
};
return SlicerBuffer;
})();
exports.SlicerBuffer = SlicerBuffer;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"buffer":80}],36:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseBurner, Burner, C, Compressed, CreationTime, Issuer, Literal, OnePassSignature, PKESK, SEIPD, SHA512, SRF, Signature, WordArray, clearsign, detachsign, dummy_key_id, encode, export_key_pgp, get_cipher, iced, make_esc, make_simple_literals, scrub_buffer, triplesec, unix_time, __iced_k, __iced_k_noop, _ref, _ref1, _ref2,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
make_esc = require('iced-error').make_esc;
OnePassSignature = require('./packet/one_pass_sig').OnePassSignature;
_ref = require('./packet/signature'), Signature = _ref.Signature, CreationTime = _ref.CreationTime, Issuer = _ref.Issuer;
Compressed = require('./packet/compressed').Compressed;
Literal = require('./packet/literal').Literal;
unix_time = require('../util').unix_time;
SRF = require('../rand').SRF;
triplesec = require('triplesec');
_ref1 = require('../symmetric'), export_key_pgp = _ref1.export_key_pgp, get_cipher = _ref1.get_cipher;
scrub_buffer = triplesec.util.scrub_buffer;
WordArray = triplesec.WordArray;
_ref2 = require('./packet/sess'), SEIPD = _ref2.SEIPD, PKESK = _ref2.PKESK;
C = require('../const').openpgp;
SHA512 = require('../hash').SHA512;
encode = require('./armor').encode;
clearsign = require('./clearsign');
detachsign = require('./detachsign');
BaseBurner = require('./baseburner').BaseBurner;
dummy_key_id = new Buffer((function() {
var _i, _results;
_results = [];
for (_i = 0; _i < 16; _i++) {
_results.push(0);
}
return _results;
})());
Burner = (function(_super) {
__extends(Burner, _super);
function Burner(_arg) {
var asp, encrypt_for, encryption_key, sign_with, signing_key;
this.literals = _arg.literals, this.opts = _arg.opts, sign_with = _arg.sign_with, encrypt_for = _arg.encrypt_for, signing_key = _arg.signing_key, encryption_key = _arg.encryption_key, asp = _arg.asp;
Burner.__super__.constructor.call(this, {
sign_with: sign_with,
encrypt_for: encrypt_for,
signing_key: signing_key,
encryption_key: encryption_key,
asp: asp
});
this.packets = [];
this.opts || (this.opts = {});
this.signed_payload = null;
}
Burner.prototype._frame_literals = function(cb) {
var esc, l, p, sp, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Burner::_frame_literals");
sp = [];
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref3, _results, _while;
_ref3 = _this.literals;
_len = _ref3.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
l = _ref3[_i];
sp.push(l.to_signature_payload());
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._frame_literals"
});
l.write(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return p = arguments[0];
};
})(),
lineno: 51
})));
__iced_deferrals._fulfill();
})(function() {
return _next(_this.packets.push(p));
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
_this.signed_payload = Buffer.concat(sp);
return cb(null);
};
})(this));
};
Burner.prototype._sign = function(cb) {
var esc, fp, ops, ops_framed, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Burner::_sign'");
ops = new OnePassSignature({
sig_type: C.sig_types.binary_doc,
hasher: SHA512,
sig_klass: this.signing_key.get_klass(),
key_id: this.signing_key.get_key_id(),
is_final: 1
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._sign"
});
ops.write(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ops_framed = arguments[0];
};
})(),
lineno: 67
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
sig = new Signature({
type: C.sig_types.binary_doc,
key: _this.signing_key.key,
hashed_subpackets: [new CreationTime(unix_time())],
unhashed_subpackets: [new Issuer(_this.signing_key.get_key_id())]
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._sign"
});
_this.asp.progress({
what: 'sign',
i: 0,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 74
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._sign"
});
sig.write(_this.signed_payload, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return fp = arguments[0];
};
})(),
lineno: 75
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._sign"
});
_this.asp.progress({
what: 'sign',
i: 1,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 76
})));
__iced_deferrals._fulfill();
})(function() {
_this.packets.unshift(ops_framed);
_this.packets.push(fp);
return cb(null);
});
});
});
};
})(this));
};
Burner.prototype.collect_packets = function() {
var ret;
ret = Buffer.concat(this.packets);
this.packets = [];
return ret;
};
Burner.prototype._compress = function(cb) {
var esc, inflated, opkt, pkt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Burner::_compress");
inflated = this.collect_packets();
pkt = new Compressed({
algo: C.compression.zlib,
inflated: inflated
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._compress"
});
_this.asp.progress({
what: 'compress',
i: 0,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 94
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._compress"
});
pkt.write(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return opkt = arguments[0];
};
})(),
lineno: 95
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._compress"
});
_this.asp.progress({
what: 'compress',
i: 1,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 96
})));
__iced_deferrals._fulfill();
})(function() {
_this.packets.push(opkt);
return cb(null);
});
});
};
})(this));
};
Burner.prototype._make_session_key = function(cb) {
var ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
this._cipher_algo = C.symmetric_key_algorithms.AES256;
this._cipher_info = get_cipher(this._cipher_algo);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._make_session_key"
});
SRF().random_bytes(_this._cipher_info.key_size, __iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
return __slot_1._session_key = arguments[0];
};
})(_this),
lineno: 105
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
_this._cipher = new _this._cipher_info.klass(WordArray.from_buffer(_this._session_key));
return cb(null);
};
})(this));
};
Burner.prototype.scrub = function() {
if (this._cipher != null) {
this._cipher.scrub();
}
if (this._session_key != null) {
return scrub_buffer(this._session_key);
}
};
Burner.prototype._encrypt_session_key_once = function(encryption_key, cb) {
var ekey, esc, fingerprint, key_id, payload, pkesk, pkt, pub_k, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "_encrypt_session_key_once");
payload = export_key_pgp(this._cipher_algo, this._session_key);
pub_k = encryption_key.key;
fingerprint = encryption_key.get_fingerprint();
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
_this.asp.progress({
what: 'session key encrypt',
i: 0,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 122
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
pub_k.pad_and_encrypt(payload, {
fingerprint: fingerprint
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ekey = arguments[0];
};
})(),
lineno: 123
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
_this.asp.progress({
what: 'session key encrypt',
i: 1,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 124
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (_this.opts.hide) {
key_id = dummy_key_id;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
_this.asp.progress({
what: 'hide encryption',
i: 0,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 127
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
var _ref3, _ref4;
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
ekey.hide({
max: (_ref3 = _this.opts.hide) != null ? _ref3.max : void 0,
slosh: (_ref4 = _this.opts.hide) != null ? _ref4.slosh : void 0,
key: pub_k
}, esc(__iced_deferrals.defer({
lineno: 128
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
_this.asp.progress({
what: 'hide encryption',
i: 1,
total: 1
}, esc(__iced_deferrals.defer({
lineno: 129
})));
__iced_deferrals._fulfill();
})(__iced_k);
});
});
} else {
return __iced_k(key_id = encryption_key.get_key_id());
}
})(function() {
pkt = new PKESK({
crypto_type: pub_k.type,
key_id: key_id,
ekey: ekey
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key_once"
});
pkt.write(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return pkesk = arguments[0];
};
})(),
lineno: 137
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, pkesk);
});
});
});
});
};
})(this));
};
Burner.prototype._encrypt_session_key = function(cb) {
var esc, k, pkesk, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "_encrypt_session_key");
this._pkesks = [];
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref3, _results, _while;
_ref3 = _this.encryption_keys;
_len = _ref3.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
k = _ref3[_i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_session_key"
});
_this._encrypt_session_key_once(k, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return pkesk = arguments[0];
};
})(),
lineno: 146
})));
__iced_deferrals._fulfill();
})(function() {
return _next(_this._pkesks.push(pkesk));
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(null);
};
})(this));
};
Burner.prototype._encrypt_payload = function(cb) {
var asp, esc, pkt, plaintext, prefixrandom, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Burner::_encrypt_payload");
plaintext = this.collect_packets();
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_payload"
});
SRF().random_bytes(_this._cipher.blockSize, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return prefixrandom = arguments[0];
};
})(),
lineno: 155
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
pkt = new SEIPD({});
asp = _this.asp.section('encrypt payload');
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_payload"
});
pkt.encrypt({
cipher: _this._cipher,
plaintext: plaintext,
prefixrandom: prefixrandom,
asp: asp
}, esc(__iced_deferrals.defer({
lineno: 158
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt_payload"
});
pkt.write(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return pkt = arguments[0];
};
})(),
lineno: 159
})));
__iced_deferrals._fulfill();
})(function() {
scrub_buffer(plaintext);
_this.packets = _this._pkesks.concat([pkt]);
return cb(null);
});
});
};
})(this));
};
Burner.prototype._encrypt = function(cb) {
var esc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Burner::_encrypt");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt"
});
_this._make_session_key(esc(__iced_deferrals.defer({
lineno: 168
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt"
});
_this._encrypt_session_key(esc(__iced_deferrals.defer({
lineno: 169
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner._encrypt"
});
_this._encrypt_payload(esc(__iced_deferrals.defer({
lineno: 170
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null);
});
});
};
})(this));
};
Burner.prototype.scrub = function() {};
Burner.prototype.burn = function(cb) {
var esc, output, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Burner::burn");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner.burn"
});
_this._find_keys(esc(__iced_deferrals.defer({
lineno: 181
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner.burn"
});
_this._frame_literals(esc(__iced_deferrals.defer({
lineno: 182
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (_this.signing_key != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner.burn"
});
_this._sign(esc(__iced_deferrals.defer({
lineno: 184
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner.burn"
});
_this._compress(esc(__iced_deferrals.defer({
lineno: 185
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (_this.encryption_keys != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "Burner.burn"
});
_this._encrypt(esc(__iced_deferrals.defer({
lineno: 187
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
output = Buffer.concat(_this.packets);
return cb(null, output);
});
});
});
});
};
})(this));
};
return Burner;
})(BaseBurner);
exports.Burner = Burner;
exports.make_simple_literals = make_simple_literals = function(msg) {
return [
new Literal({
data: new Buffer(msg),
format: C.literal_formats.utf8,
date: unix_time()
})
];
};
exports.clearsign = clearsign.sign;
exports.detachsign = detachsign.sign;
exports.burn = function(_arg, cb) {
var aout, asp, b, encrypt_for, encryption_key, err, literals, msg, opts, raw, sign_with, signing_key, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
msg = _arg.msg, literals = _arg.literals, sign_with = _arg.sign_with, encrypt_for = _arg.encrypt_for, signing_key = _arg.signing_key, encryption_key = _arg.encryption_key, asp = _arg.asp, opts = _arg.opts;
if ((msg != null) && (literals == null)) {
literals = make_simple_literals(msg);
}
b = new Burner({
literals: literals,
sign_with: sign_with,
encrypt_for: encrypt_for,
signing_key: signing_key,
encryption_key: encryption_key,
asp: asp,
opts: opts
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/burner.iced",
funcname: "burn"
});
b.burn(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return raw = arguments[1];
};
})(),
lineno: 247
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
b.scrub();
if ((typeof raw !== "undefined" && raw !== null) && (typeof err === "undefined" || err === null)) {
aout = encode(C.message_types.generic, raw);
}
return cb(err, aout, raw);
};
})(this));
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../hash":14,"../rand":65,"../symmetric":68,"../util":70,"./armor":33,"./baseburner":34,"./clearsign":39,"./detachsign":40,"./packet/compressed":46,"./packet/literal":49,"./packet/one_pass_sig":50,"./packet/sess":52,"./packet/signature":53,"buffer":80,"iced-error":115,"iced-runtime":118,"triplesec":181}],37:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var CAST5, G, Global, WordArray, ui32a_to_ui8a, ui8a_to_ui32a, _ref;
WordArray = require('triplesec').WordArray;
_ref = require('../util'), ui8a_to_ui32a = _ref.ui8a_to_ui32a, ui32a_to_ui8a = _ref.ui32a_to_ui8a;
Global = (function() {
function Global() {
this.init_schedule();
this.init_sbox();
}
Global.prototype.init_schedule = function() {
var scheduleA, scheduleB;
scheduleA = new Array(4);
scheduleA[0] = new Array(4);
scheduleA[0][0] = new Uint8Array([4, 0, 0xd, 0xf, 0xc, 0xe, 0x8]);
scheduleA[0][1] = new Uint8Array([5, 2, 16 + 0, 16 + 2, 16 + 1, 16 + 3, 0xa]);
scheduleA[0][2] = new Uint8Array([6, 3, 16 + 7, 16 + 6, 16 + 5, 16 + 4, 9]);
scheduleA[0][3] = new Uint8Array([7, 1, 16 + 0xa, 16 + 9, 16 + 0xb, 16 + 8, 0xb]);
scheduleA[1] = new Array(4);
scheduleA[1][0] = new Uint8Array([0, 6, 16 + 5, 16 + 7, 16 + 4, 16 + 6, 16 + 0]);
scheduleA[1][1] = new Uint8Array([1, 4, 0, 2, 1, 3, 16 + 2]);
scheduleA[1][2] = new Uint8Array([2, 5, 7, 6, 5, 4, 16 + 1]);
scheduleA[1][3] = new Uint8Array([3, 7, 0xa, 9, 0xb, 8, 16 + 3]);
scheduleA[2] = new Array(4);
scheduleA[2][0] = new Uint8Array([4, 0, 0xd, 0xf, 0xc, 0xe, 8]);
scheduleA[2][1] = new Uint8Array([5, 2, 16 + 0, 16 + 2, 16 + 1, 16 + 3, 0xa]);
scheduleA[2][2] = new Uint8Array([6, 3, 16 + 7, 16 + 6, 16 + 5, 16 + 4, 9]);
scheduleA[2][3] = new Uint8Array([7, 1, 16 + 0xa, 16 + 9, 16 + 0xb, 16 + 8, 0xb]);
scheduleA[3] = new Array(4);
scheduleA[3][0] = new Uint8Array([0, 6, 16 + 5, 16 + 7, 16 + 4, 16 + 6, 16 + 0]);
scheduleA[3][1] = new Uint8Array([1, 4, 0, 2, 1, 3, 16 + 2]);
scheduleA[3][2] = new Uint8Array([2, 5, 7, 6, 5, 4, 16 + 1]);
scheduleA[3][3] = new Uint8Array([3, 7, 0xa, 9, 0xb, 8, 16 + 3]);
scheduleB = new Array(4);
scheduleB[0] = new Array(4);
scheduleB[0][0] = new Uint8Array([16 + 8, 16 + 9, 16 + 7, 16 + 6, 16 + 2]);
scheduleB[0][1] = new Uint8Array([16 + 0xa, 16 + 0xb, 16 + 5, 16 + 4, 16 + 6]);
scheduleB[0][2] = new Uint8Array([16 + 0xc, 16 + 0xd, 16 + 3, 16 + 2, 16 + 9]);
scheduleB[0][3] = new Uint8Array([16 + 0xe, 16 + 0xf, 16 + 1, 16 + 0, 16 + 0xc]);
scheduleB[1] = new Array(4);
scheduleB[1][0] = new Uint8Array([3, 2, 0xc, 0xd, 8]);
scheduleB[1][1] = new Uint8Array([1, 0, 0xe, 0xf, 0xd]);
scheduleB[1][2] = new Uint8Array([7, 6, 8, 9, 3]);
scheduleB[1][3] = new Uint8Array([5, 4, 0xa, 0xb, 7]);
scheduleB[2] = new Array(4);
scheduleB[2][0] = new Uint8Array([16 + 3, 16 + 2, 16 + 0xc, 16 + 0xd, 16 + 9]);
scheduleB[2][1] = new Uint8Array([16 + 1, 16 + 0, 16 + 0xe, 16 + 0xf, 16 + 0xc]);
scheduleB[2][2] = new Uint8Array([16 + 7, 16 + 6, 16 + 8, 16 + 9, 16 + 2]);
scheduleB[2][3] = new Uint8Array([16 + 5, 16 + 4, 16 + 0xa, 16 + 0xb, 16 + 6]);
scheduleB[3] = new Array(4);
scheduleB[3][0] = new Uint8Array([8, 9, 7, 6, 3]);
scheduleB[3][1] = new Uint8Array([0xa, 0xb, 5, 4, 7]);
scheduleB[3][2] = new Uint8Array([0xc, 0xd, 3, 2, 8]);
scheduleB[3][3] = new Uint8Array([0xe, 0xf, 1, 0, 0xd]);
this.scheduleA = scheduleA;
return this.scheduleB = scheduleB;
};
Global.prototype.init_sbox = function() {
var sBox;
sBox = new Array(8);
sBox[0] = new Uint32Array([0x30fb40d4, 0x9fa0ff0b, 0x6beccd2f, 0x3f258c7a, 0x1e213f2f, 0x9c004dd3, 0x6003e540, 0xcf9fc949, 0xbfd4af27, 0x88bbbdb5, 0xe2034090, 0x98d09675, 0x6e63a0e0, 0x15c361d2, 0xc2e7661d, 0x22d4ff8e, 0x28683b6f, 0xc07fd059, 0xff2379c8, 0x775f50e2, 0x43c340d3, 0xdf2f8656, 0x887ca41a, 0xa2d2bd2d, 0xa1c9e0d6, 0x346c4819, 0x61b76d87, 0x22540f2f, 0x2abe32e1, 0xaa54166b, 0x22568e3a, 0xa2d341d0, 0x66db40c8, 0xa784392f, 0x004dff2f, 0x2db9d2de, 0x97943fac, 0x4a97c1d8, 0x527644b7, 0xb5f437a7, 0xb82cbaef, 0xd751d159, 0x6ff7f0ed, 0x5a097a1f, 0x827b68d0, 0x90ecf52e, 0x22b0c054, 0xbc8e5935, 0x4b6d2f7f, 0x50bb64a2, 0xd2664910, 0xbee5812d, 0xb7332290, 0xe93b159f, 0xb48ee411, 0x4bff345d, 0xfd45c240, 0xad31973f, 0xc4f6d02e, 0x55fc8165, 0xd5b1caad, 0xa1ac2dae, 0xa2d4b76d, 0xc19b0c50, 0x882240f2, 0x0c6e4f38, 0xa4e4bfd7, 0x4f5ba272, 0x564c1d2f, 0xc59c5319, 0xb949e354, 0xb04669fe, 0xb1b6ab8a, 0xc71358dd, 0x6385c545, 0x110f935d, 0x57538ad5, 0x6a390493, 0xe63d37e0, 0x2a54f6b3, 0x3a787d5f, 0x6276a0b5, 0x19a6fcdf, 0x7a42206a, 0x29f9d4d5, 0xf61b1891, 0xbb72275e, 0xaa508167, 0x38901091, 0xc6b505eb, 0x84c7cb8c, 0x2ad75a0f, 0x874a1427, 0xa2d1936b, 0x2ad286af, 0xaa56d291, 0xd7894360, 0x425c750d, 0x93b39e26, 0x187184c9, 0x6c00b32d, 0x73e2bb14, 0xa0bebc3c, 0x54623779, 0x64459eab, 0x3f328b82, 0x7718cf82, 0x59a2cea6, 0x04ee002e, 0x89fe78e6, 0x3fab0950, 0x325ff6c2, 0x81383f05, 0x6963c5c8, 0x76cb5ad6, 0xd49974c9, 0xca180dcf, 0x380782d5, 0xc7fa5cf6, 0x8ac31511, 0x35e79e13, 0x47da91d0, 0xf40f9086, 0xa7e2419e, 0x31366241, 0x051ef495, 0xaa573b04, 0x4a805d8d, 0x548300d0, 0x00322a3c, 0xbf64cddf, 0xba57a68e, 0x75c6372b, 0x50afd341, 0xa7c13275, 0x915a0bf5, 0x6b54bfab, 0x2b0b1426, 0xab4cc9d7, 0x449ccd82, 0xf7fbf265, 0xab85c5f3, 0x1b55db94, 0xaad4e324, 0xcfa4bd3f, 0x2deaa3e2, 0x9e204d02, 0xc8bd25ac, 0xeadf55b3, 0xd5bd9e98, 0xe31231b2, 0x2ad5ad6c, 0x954329de, 0xadbe4528, 0xd8710f69, 0xaa51c90f, 0xaa786bf6, 0x22513f1e, 0xaa51a79b, 0x2ad344cc, 0x7b5a41f0, 0xd37cfbad, 0x1b069505, 0x41ece491, 0xb4c332e6, 0x032268d4, 0xc9600acc, 0xce387e6d, 0xbf6bb16c, 0x6a70fb78, 0x0d03d9c9, 0xd4df39de, 0xe01063da, 0x4736f464, 0x5ad328d8, 0xb347cc96, 0x75bb0fc3, 0x98511bfb, 0x4ffbcc35, 0xb58bcf6a, 0xe11f0abc, 0xbfc5fe4a, 0xa70aec10, 0xac39570a, 0x3f04442f, 0x6188b153, 0xe0397a2e, 0x5727cb79, 0x9ceb418f, 0x1cacd68d, 0x2ad37c96, 0x0175cb9d, 0xc69dff09, 0xc75b65f0, 0xd9db40d8, 0xec0e7779, 0x4744ead4, 0xb11c3274, 0xdd24cb9e, 0x7e1c54bd, 0xf01144f9, 0xd2240eb1, 0x9675b3fd, 0xa3ac3755, 0xd47c27af, 0x51c85f4d, 0x56907596, 0xa5bb15e6, 0x580304f0, 0xca042cf1, 0x011a37ea, 0x8dbfaadb, 0x35ba3e4a, 0x3526ffa0, 0xc37b4d09, 0xbc306ed9, 0x98a52666, 0x5648f725, 0xff5e569d, 0x0ced63d0, 0x7c63b2cf, 0x700b45e1, 0xd5ea50f1, 0x85a92872, 0xaf1fbda7, 0xd4234870, 0xa7870bf3, 0x2d3b4d79, 0x42e04198, 0x0cd0ede7, 0x26470db8, 0xf881814c, 0x474d6ad7, 0x7c0c5e5c, 0xd1231959, 0x381b7298, 0xf5d2f4db, 0xab838653, 0x6e2f1e23, 0x83719c9e, 0xbd91e046, 0x9a56456e, 0xdc39200c, 0x20c8c571, 0x962bda1c, 0xe1e696ff, 0xb141ab08, 0x7cca89b9, 0x1a69e783, 0x02cc4843, 0xa2f7c579, 0x429ef47d, 0x427b169c, 0x5ac9f049, 0xdd8f0f00, 0x5c8165bf]);
sBox[1] = new Uint32Array([0x1f201094, 0xef0ba75b, 0x69e3cf7e, 0x393f4380, 0xfe61cf7a, 0xeec5207a, 0x55889c94, 0x72fc0651, 0xada7ef79, 0x4e1d7235, 0xd55a63ce, 0xde0436ba, 0x99c430ef, 0x5f0c0794, 0x18dcdb7d, 0xa1d6eff3, 0xa0b52f7b, 0x59e83605, 0xee15b094, 0xe9ffd909, 0xdc440086, 0xef944459, 0xba83ccb3, 0xe0c3cdfb, 0xd1da4181, 0x3b092ab1, 0xf997f1c1, 0xa5e6cf7b, 0x01420ddb, 0xe4e7ef5b, 0x25a1ff41, 0xe180f806, 0x1fc41080, 0x179bee7a, 0xd37ac6a9, 0xfe5830a4, 0x98de8b7f, 0x77e83f4e, 0x79929269, 0x24fa9f7b, 0xe113c85b, 0xacc40083, 0xd7503525, 0xf7ea615f, 0x62143154, 0x0d554b63, 0x5d681121, 0xc866c359, 0x3d63cf73, 0xcee234c0, 0xd4d87e87, 0x5c672b21, 0x071f6181, 0x39f7627f, 0x361e3084, 0xe4eb573b, 0x602f64a4, 0xd63acd9c, 0x1bbc4635, 0x9e81032d, 0x2701f50c, 0x99847ab4, 0xa0e3df79, 0xba6cf38c, 0x10843094, 0x2537a95e, 0xf46f6ffe, 0xa1ff3b1f, 0x208cfb6a, 0x8f458c74, 0xd9e0a227, 0x4ec73a34, 0xfc884f69, 0x3e4de8df, 0xef0e0088, 0x3559648d, 0x8a45388c, 0x1d804366, 0x721d9bfd, 0xa58684bb, 0xe8256333, 0x844e8212, 0x128d8098, 0xfed33fb4, 0xce280ae1, 0x27e19ba5, 0xd5a6c252, 0xe49754bd, 0xc5d655dd, 0xeb667064, 0x77840b4d, 0xa1b6a801, 0x84db26a9, 0xe0b56714, 0x21f043b7, 0xe5d05860, 0x54f03084, 0x066ff472, 0xa31aa153, 0xdadc4755, 0xb5625dbf, 0x68561be6, 0x83ca6b94, 0x2d6ed23b, 0xeccf01db, 0xa6d3d0ba, 0xb6803d5c, 0xaf77a709, 0x33b4a34c, 0x397bc8d6, 0x5ee22b95, 0x5f0e5304, 0x81ed6f61, 0x20e74364, 0xb45e1378, 0xde18639b, 0x881ca122, 0xb96726d1, 0x8049a7e8, 0x22b7da7b, 0x5e552d25, 0x5272d237, 0x79d2951c, 0xc60d894c, 0x488cb402, 0x1ba4fe5b, 0xa4b09f6b, 0x1ca815cf, 0xa20c3005, 0x8871df63, 0xb9de2fcb, 0x0cc6c9e9, 0x0beeff53, 0xe3214517, 0xb4542835, 0x9f63293c, 0xee41e729, 0x6e1d2d7c, 0x50045286, 0x1e6685f3, 0xf33401c6, 0x30a22c95, 0x31a70850, 0x60930f13, 0x73f98417, 0xa1269859, 0xec645c44, 0x52c877a9, 0xcdff33a6, 0xa02b1741, 0x7cbad9a2, 0x2180036f, 0x50d99c08, 0xcb3f4861, 0xc26bd765, 0x64a3f6ab, 0x80342676, 0x25a75e7b, 0xe4e6d1fc, 0x20c710e6, 0xcdf0b680, 0x17844d3b, 0x31eef84d, 0x7e0824e4, 0x2ccb49eb, 0x846a3bae, 0x8ff77888, 0xee5d60f6, 0x7af75673, 0x2fdd5cdb, 0xa11631c1, 0x30f66f43, 0xb3faec54, 0x157fd7fa, 0xef8579cc, 0xd152de58, 0xdb2ffd5e, 0x8f32ce19, 0x306af97a, 0x02f03ef8, 0x99319ad5, 0xc242fa0f, 0xa7e3ebb0, 0xc68e4906, 0xb8da230c, 0x80823028, 0xdcdef3c8, 0xd35fb171, 0x088a1bc8, 0xbec0c560, 0x61a3c9e8, 0xbca8f54d, 0xc72feffa, 0x22822e99, 0x82c570b4, 0xd8d94e89, 0x8b1c34bc, 0x301e16e6, 0x273be979, 0xb0ffeaa6, 0x61d9b8c6, 0x00b24869, 0xb7ffce3f, 0x08dc283b, 0x43daf65a, 0xf7e19798, 0x7619b72f, 0x8f1c9ba4, 0xdc8637a0, 0x16a7d3b1, 0x9fc393b7, 0xa7136eeb, 0xc6bcc63e, 0x1a513742, 0xef6828bc, 0x520365d6, 0x2d6a77ab, 0x3527ed4b, 0x821fd216, 0x095c6e2e, 0xdb92f2fb, 0x5eea29cb, 0x145892f5, 0x91584f7f, 0x5483697b, 0x2667a8cc, 0x85196048, 0x8c4bacea, 0x833860d4, 0x0d23e0f9, 0x6c387e8a, 0x0ae6d249, 0xb284600c, 0xd835731d, 0xdcb1c647, 0xac4c56ea, 0x3ebd81b3, 0x230eabb0, 0x6438bc87, 0xf0b5b1fa, 0x8f5ea2b3, 0xfc184642, 0x0a036b7a, 0x4fb089bd, 0x649da589, 0xa345415e, 0x5c038323, 0x3e5d3bb9, 0x43d79572, 0x7e6dd07c, 0x06dfdf1e, 0x6c6cc4ef, 0x7160a539, 0x73bfbe70, 0x83877605, 0x4523ecf1]);
sBox[2] = new Uint32Array([0x8defc240, 0x25fa5d9f, 0xeb903dbf, 0xe810c907, 0x47607fff, 0x369fe44b, 0x8c1fc644, 0xaececa90, 0xbeb1f9bf, 0xeefbcaea, 0xe8cf1950, 0x51df07ae, 0x920e8806, 0xf0ad0548, 0xe13c8d83, 0x927010d5, 0x11107d9f, 0x07647db9, 0xb2e3e4d4, 0x3d4f285e, 0xb9afa820, 0xfade82e0, 0xa067268b, 0x8272792e, 0x553fb2c0, 0x489ae22b, 0xd4ef9794, 0x125e3fbc, 0x21fffcee, 0x825b1bfd, 0x9255c5ed, 0x1257a240, 0x4e1a8302, 0xbae07fff, 0x528246e7, 0x8e57140e, 0x3373f7bf, 0x8c9f8188, 0xa6fc4ee8, 0xc982b5a5, 0xa8c01db7, 0x579fc264, 0x67094f31, 0xf2bd3f5f, 0x40fff7c1, 0x1fb78dfc, 0x8e6bd2c1, 0x437be59b, 0x99b03dbf, 0xb5dbc64b, 0x638dc0e6, 0x55819d99, 0xa197c81c, 0x4a012d6e, 0xc5884a28, 0xccc36f71, 0xb843c213, 0x6c0743f1, 0x8309893c, 0x0feddd5f, 0x2f7fe850, 0xd7c07f7e, 0x02507fbf, 0x5afb9a04, 0xa747d2d0, 0x1651192e, 0xaf70bf3e, 0x58c31380, 0x5f98302e, 0x727cc3c4, 0x0a0fb402, 0x0f7fef82, 0x8c96fdad, 0x5d2c2aae, 0x8ee99a49, 0x50da88b8, 0x8427f4a0, 0x1eac5790, 0x796fb449, 0x8252dc15, 0xefbd7d9b, 0xa672597d, 0xada840d8, 0x45f54504, 0xfa5d7403, 0xe83ec305, 0x4f91751a, 0x925669c2, 0x23efe941, 0xa903f12e, 0x60270df2, 0x0276e4b6, 0x94fd6574, 0x927985b2, 0x8276dbcb, 0x02778176, 0xf8af918d, 0x4e48f79e, 0x8f616ddf, 0xe29d840e, 0x842f7d83, 0x340ce5c8, 0x96bbb682, 0x93b4b148, 0xef303cab, 0x984faf28, 0x779faf9b, 0x92dc560d, 0x224d1e20, 0x8437aa88, 0x7d29dc96, 0x2756d3dc, 0x8b907cee, 0xb51fd240, 0xe7c07ce3, 0xe566b4a1, 0xc3e9615e, 0x3cf8209d, 0x6094d1e3, 0xcd9ca341, 0x5c76460e, 0x00ea983b, 0xd4d67881, 0xfd47572c, 0xf76cedd9, 0xbda8229c, 0x127dadaa, 0x438a074e, 0x1f97c090, 0x081bdb8a, 0x93a07ebe, 0xb938ca15, 0x97b03cff, 0x3dc2c0f8, 0x8d1ab2ec, 0x64380e51, 0x68cc7bfb, 0xd90f2788, 0x12490181, 0x5de5ffd4, 0xdd7ef86a, 0x76a2e214, 0xb9a40368, 0x925d958f, 0x4b39fffa, 0xba39aee9, 0xa4ffd30b, 0xfaf7933b, 0x6d498623, 0x193cbcfa, 0x27627545, 0x825cf47a, 0x61bd8ba0, 0xd11e42d1, 0xcead04f4, 0x127ea392, 0x10428db7, 0x8272a972, 0x9270c4a8, 0x127de50b, 0x285ba1c8, 0x3c62f44f, 0x35c0eaa5, 0xe805d231, 0x428929fb, 0xb4fcdf82, 0x4fb66a53, 0x0e7dc15b, 0x1f081fab, 0x108618ae, 0xfcfd086d, 0xf9ff2889, 0x694bcc11, 0x236a5cae, 0x12deca4d, 0x2c3f8cc5, 0xd2d02dfe, 0xf8ef5896, 0xe4cf52da, 0x95155b67, 0x494a488c, 0xb9b6a80c, 0x5c8f82bc, 0x89d36b45, 0x3a609437, 0xec00c9a9, 0x44715253, 0x0a874b49, 0xd773bc40, 0x7c34671c, 0x02717ef6, 0x4feb5536, 0xa2d02fff, 0xd2bf60c4, 0xd43f03c0, 0x50b4ef6d, 0x07478cd1, 0x006e1888, 0xa2e53f55, 0xb9e6d4bc, 0xa2048016, 0x97573833, 0xd7207d67, 0xde0f8f3d, 0x72f87b33, 0xabcc4f33, 0x7688c55d, 0x7b00a6b0, 0x947b0001, 0x570075d2, 0xf9bb88f8, 0x8942019e, 0x4264a5ff, 0x856302e0, 0x72dbd92b, 0xee971b69, 0x6ea22fde, 0x5f08ae2b, 0xaf7a616d, 0xe5c98767, 0xcf1febd2, 0x61efc8c2, 0xf1ac2571, 0xcc8239c2, 0x67214cb8, 0xb1e583d1, 0xb7dc3e62, 0x7f10bdce, 0xf90a5c38, 0x0ff0443d, 0x606e6dc6, 0x60543a49, 0x5727c148, 0x2be98a1d, 0x8ab41738, 0x20e1be24, 0xaf96da0f, 0x68458425, 0x99833be5, 0x600d457d, 0x282f9350, 0x8334b362, 0xd91d1120, 0x2b6d8da0, 0x642b1e31, 0x9c305a00, 0x52bce688, 0x1b03588a, 0xf7baefd5, 0x4142ed9c, 0xa4315c11, 0x83323ec5, 0xdfef4636, 0xa133c501, 0xe9d3531c, 0xee353783]);
sBox[3] = new Uint32Array([0x9db30420, 0x1fb6e9de, 0xa7be7bef, 0xd273a298, 0x4a4f7bdb, 0x64ad8c57, 0x85510443, 0xfa020ed1, 0x7e287aff, 0xe60fb663, 0x095f35a1, 0x79ebf120, 0xfd059d43, 0x6497b7b1, 0xf3641f63, 0x241e4adf, 0x28147f5f, 0x4fa2b8cd, 0xc9430040, 0x0cc32220, 0xfdd30b30, 0xc0a5374f, 0x1d2d00d9, 0x24147b15, 0xee4d111a, 0x0fca5167, 0x71ff904c, 0x2d195ffe, 0x1a05645f, 0x0c13fefe, 0x081b08ca, 0x05170121, 0x80530100, 0xe83e5efe, 0xac9af4f8, 0x7fe72701, 0xd2b8ee5f, 0x06df4261, 0xbb9e9b8a, 0x7293ea25, 0xce84ffdf, 0xf5718801, 0x3dd64b04, 0xa26f263b, 0x7ed48400, 0x547eebe6, 0x446d4ca0, 0x6cf3d6f5, 0x2649abdf, 0xaea0c7f5, 0x36338cc1, 0x503f7e93, 0xd3772061, 0x11b638e1, 0x72500e03, 0xf80eb2bb, 0xabe0502e, 0xec8d77de, 0x57971e81, 0xe14f6746, 0xc9335400, 0x6920318f, 0x081dbb99, 0xffc304a5, 0x4d351805, 0x7f3d5ce3, 0xa6c866c6, 0x5d5bcca9, 0xdaec6fea, 0x9f926f91, 0x9f46222f, 0x3991467d, 0xa5bf6d8e, 0x1143c44f, 0x43958302, 0xd0214eeb, 0x022083b8, 0x3fb6180c, 0x18f8931e, 0x281658e6, 0x26486e3e, 0x8bd78a70, 0x7477e4c1, 0xb506e07c, 0xf32d0a25, 0x79098b02, 0xe4eabb81, 0x28123b23, 0x69dead38, 0x1574ca16, 0xdf871b62, 0x211c40b7, 0xa51a9ef9, 0x0014377b, 0x041e8ac8, 0x09114003, 0xbd59e4d2, 0xe3d156d5, 0x4fe876d5, 0x2f91a340, 0x557be8de, 0x00eae4a7, 0x0ce5c2ec, 0x4db4bba6, 0xe756bdff, 0xdd3369ac, 0xec17b035, 0x06572327, 0x99afc8b0, 0x56c8c391, 0x6b65811c, 0x5e146119, 0x6e85cb75, 0xbe07c002, 0xc2325577, 0x893ff4ec, 0x5bbfc92d, 0xd0ec3b25, 0xb7801ab7, 0x8d6d3b24, 0x20c763ef, 0xc366a5fc, 0x9c382880, 0x0ace3205, 0xaac9548a, 0xeca1d7c7, 0x041afa32, 0x1d16625a, 0x6701902c, 0x9b757a54, 0x31d477f7, 0x9126b031, 0x36cc6fdb, 0xc70b8b46, 0xd9e66a48, 0x56e55a79, 0x026a4ceb, 0x52437eff, 0x2f8f76b4, 0x0df980a5, 0x8674cde3, 0xedda04eb, 0x17a9be04, 0x2c18f4df, 0xb7747f9d, 0xab2af7b4, 0xefc34d20, 0x2e096b7c, 0x1741a254, 0xe5b6a035, 0x213d42f6, 0x2c1c7c26, 0x61c2f50f, 0x6552daf9, 0xd2c231f8, 0x25130f69, 0xd8167fa2, 0x0418f2c8, 0x001a96a6, 0x0d1526ab, 0x63315c21, 0x5e0a72ec, 0x49bafefd, 0x187908d9, 0x8d0dbd86, 0x311170a7, 0x3e9b640c, 0xcc3e10d7, 0xd5cad3b6, 0x0caec388, 0xf73001e1, 0x6c728aff, 0x71eae2a1, 0x1f9af36e, 0xcfcbd12f, 0xc1de8417, 0xac07be6b, 0xcb44a1d8, 0x8b9b0f56, 0x013988c3, 0xb1c52fca, 0xb4be31cd, 0xd8782806, 0x12a3a4e2, 0x6f7de532, 0x58fd7eb6, 0xd01ee900, 0x24adffc2, 0xf4990fc5, 0x9711aac5, 0x001d7b95, 0x82e5e7d2, 0x109873f6, 0x00613096, 0xc32d9521, 0xada121ff, 0x29908415, 0x7fbb977f, 0xaf9eb3db, 0x29c9ed2a, 0x5ce2a465, 0xa730f32c, 0xd0aa3fe8, 0x8a5cc091, 0xd49e2ce7, 0x0ce454a9, 0xd60acd86, 0x015f1919, 0x77079103, 0xdea03af6, 0x78a8565e, 0xdee356df, 0x21f05cbe, 0x8b75e387, 0xb3c50651, 0xb8a5c3ef, 0xd8eeb6d2, 0xe523be77, 0xc2154529, 0x2f69efdf, 0xafe67afb, 0xf470c4b2, 0xf3e0eb5b, 0xd6cc9876, 0x39e4460c, 0x1fda8538, 0x1987832f, 0xca007367, 0xa99144f8, 0x296b299e, 0x492fc295, 0x9266beab, 0xb5676e69, 0x9bd3ddda, 0xdf7e052f, 0xdb25701c, 0x1b5e51ee, 0xf65324e6, 0x6afce36c, 0x0316cc04, 0x8644213e, 0xb7dc59d0, 0x7965291f, 0xccd6fd43, 0x41823979, 0x932bcdf6, 0xb657c34d, 0x4edfd282, 0x7ae5290c, 0x3cb9536b, 0x851e20fe, 0x9833557e, 0x13ecf0b0, 0xd3ffb372, 0x3f85c5c1, 0x0aef7ed2]);
sBox[4] = new Uint32Array([0x7ec90c04, 0x2c6e74b9, 0x9b0e66df, 0xa6337911, 0xb86a7fff, 0x1dd358f5, 0x44dd9d44, 0x1731167f, 0x08fbf1fa, 0xe7f511cc, 0xd2051b00, 0x735aba00, 0x2ab722d8, 0x386381cb, 0xacf6243a, 0x69befd7a, 0xe6a2e77f, 0xf0c720cd, 0xc4494816, 0xccf5c180, 0x38851640, 0x15b0a848, 0xe68b18cb, 0x4caadeff, 0x5f480a01, 0x0412b2aa, 0x259814fc, 0x41d0efe2, 0x4e40b48d, 0x248eb6fb, 0x8dba1cfe, 0x41a99b02, 0x1a550a04, 0xba8f65cb, 0x7251f4e7, 0x95a51725, 0xc106ecd7, 0x97a5980a, 0xc539b9aa, 0x4d79fe6a, 0xf2f3f763, 0x68af8040, 0xed0c9e56, 0x11b4958b, 0xe1eb5a88, 0x8709e6b0, 0xd7e07156, 0x4e29fea7, 0x6366e52d, 0x02d1c000, 0xc4ac8e05, 0x9377f571, 0x0c05372a, 0x578535f2, 0x2261be02, 0xd642a0c9, 0xdf13a280, 0x74b55bd2, 0x682199c0, 0xd421e5ec, 0x53fb3ce8, 0xc8adedb3, 0x28a87fc9, 0x3d959981, 0x5c1ff900, 0xfe38d399, 0x0c4eff0b, 0x062407ea, 0xaa2f4fb1, 0x4fb96976, 0x90c79505, 0xb0a8a774, 0xef55a1ff, 0xe59ca2c2, 0xa6b62d27, 0xe66a4263, 0xdf65001f, 0x0ec50966, 0xdfdd55bc, 0x29de0655, 0x911e739a, 0x17af8975, 0x32c7911c, 0x89f89468, 0x0d01e980, 0x524755f4, 0x03b63cc9, 0x0cc844b2, 0xbcf3f0aa, 0x87ac36e9, 0xe53a7426, 0x01b3d82b, 0x1a9e7449, 0x64ee2d7e, 0xcddbb1da, 0x01c94910, 0xb868bf80, 0x0d26f3fd, 0x9342ede7, 0x04a5c284, 0x636737b6, 0x50f5b616, 0xf24766e3, 0x8eca36c1, 0x136e05db, 0xfef18391, 0xfb887a37, 0xd6e7f7d4, 0xc7fb7dc9, 0x3063fcdf, 0xb6f589de, 0xec2941da, 0x26e46695, 0xb7566419, 0xf654efc5, 0xd08d58b7, 0x48925401, 0xc1bacb7f, 0xe5ff550f, 0xb6083049, 0x5bb5d0e8, 0x87d72e5a, 0xab6a6ee1, 0x223a66ce, 0xc62bf3cd, 0x9e0885f9, 0x68cb3e47, 0x086c010f, 0xa21de820, 0xd18b69de, 0xf3f65777, 0xfa02c3f6, 0x407edac3, 0xcbb3d550, 0x1793084d, 0xb0d70eba, 0x0ab378d5, 0xd951fb0c, 0xded7da56, 0x4124bbe4, 0x94ca0b56, 0x0f5755d1, 0xe0e1e56e, 0x6184b5be, 0x580a249f, 0x94f74bc0, 0xe327888e, 0x9f7b5561, 0xc3dc0280, 0x05687715, 0x646c6bd7, 0x44904db3, 0x66b4f0a3, 0xc0f1648a, 0x697ed5af, 0x49e92ff6, 0x309e374f, 0x2cb6356a, 0x85808573, 0x4991f840, 0x76f0ae02, 0x083be84d, 0x28421c9a, 0x44489406, 0x736e4cb8, 0xc1092910, 0x8bc95fc6, 0x7d869cf4, 0x134f616f, 0x2e77118d, 0xb31b2be1, 0xaa90b472, 0x3ca5d717, 0x7d161bba, 0x9cad9010, 0xaf462ba2, 0x9fe459d2, 0x45d34559, 0xd9f2da13, 0xdbc65487, 0xf3e4f94e, 0x176d486f, 0x097c13ea, 0x631da5c7, 0x445f7382, 0x175683f4, 0xcdc66a97, 0x70be0288, 0xb3cdcf72, 0x6e5dd2f3, 0x20936079, 0x459b80a5, 0xbe60e2db, 0xa9c23101, 0xeba5315c, 0x224e42f2, 0x1c5c1572, 0xf6721b2c, 0x1ad2fff3, 0x8c25404e, 0x324ed72f, 0x4067b7fd, 0x0523138e, 0x5ca3bc78, 0xdc0fd66e, 0x75922283, 0x784d6b17, 0x58ebb16e, 0x44094f85, 0x3f481d87, 0xfcfeae7b, 0x77b5ff76, 0x8c2302bf, 0xaaf47556, 0x5f46b02a, 0x2b092801, 0x3d38f5f7, 0x0ca81f36, 0x52af4a8a, 0x66d5e7c0, 0xdf3b0874, 0x95055110, 0x1b5ad7a8, 0xf61ed5ad, 0x6cf6e479, 0x20758184, 0xd0cefa65, 0x88f7be58, 0x4a046826, 0x0ff6f8f3, 0xa09c7f70, 0x5346aba0, 0x5ce96c28, 0xe176eda3, 0x6bac307f, 0x376829d2, 0x85360fa9, 0x17e3fe2a, 0x24b79767, 0xf5a96b20, 0xd6cd2595, 0x68ff1ebf, 0x7555442c, 0xf19f06be, 0xf9e0659a, 0xeeb9491d, 0x34010718, 0xbb30cab8, 0xe822fe15, 0x88570983, 0x750e6249, 0xda627e55, 0x5e76ffa8, 0xb1534546, 0x6d47de08, 0xefe9e7d4]);
sBox[5] = new Uint32Array([0xf6fa8f9d, 0x2cac6ce1, 0x4ca34867, 0xe2337f7c, 0x95db08e7, 0x016843b4, 0xeced5cbc, 0x325553ac, 0xbf9f0960, 0xdfa1e2ed, 0x83f0579d, 0x63ed86b9, 0x1ab6a6b8, 0xde5ebe39, 0xf38ff732, 0x8989b138, 0x33f14961, 0xc01937bd, 0xf506c6da, 0xe4625e7e, 0xa308ea99, 0x4e23e33c, 0x79cbd7cc, 0x48a14367, 0xa3149619, 0xfec94bd5, 0xa114174a, 0xeaa01866, 0xa084db2d, 0x09a8486f, 0xa888614a, 0x2900af98, 0x01665991, 0xe1992863, 0xc8f30c60, 0x2e78ef3c, 0xd0d51932, 0xcf0fec14, 0xf7ca07d2, 0xd0a82072, 0xfd41197e, 0x9305a6b0, 0xe86be3da, 0x74bed3cd, 0x372da53c, 0x4c7f4448, 0xdab5d440, 0x6dba0ec3, 0x083919a7, 0x9fbaeed9, 0x49dbcfb0, 0x4e670c53, 0x5c3d9c01, 0x64bdb941, 0x2c0e636a, 0xba7dd9cd, 0xea6f7388, 0xe70bc762, 0x35f29adb, 0x5c4cdd8d, 0xf0d48d8c, 0xb88153e2, 0x08a19866, 0x1ae2eac8, 0x284caf89, 0xaa928223, 0x9334be53, 0x3b3a21bf, 0x16434be3, 0x9aea3906, 0xefe8c36e, 0xf890cdd9, 0x80226dae, 0xc340a4a3, 0xdf7e9c09, 0xa694a807, 0x5b7c5ecc, 0x221db3a6, 0x9a69a02f, 0x68818a54, 0xceb2296f, 0x53c0843a, 0xfe893655, 0x25bfe68a, 0xb4628abc, 0xcf222ebf, 0x25ac6f48, 0xa9a99387, 0x53bddb65, 0xe76ffbe7, 0xe967fd78, 0x0ba93563, 0x8e342bc1, 0xe8a11be9, 0x4980740d, 0xc8087dfc, 0x8de4bf99, 0xa11101a0, 0x7fd37975, 0xda5a26c0, 0xe81f994f, 0x9528cd89, 0xfd339fed, 0xb87834bf, 0x5f04456d, 0x22258698, 0xc9c4c83b, 0x2dc156be, 0x4f628daa, 0x57f55ec5, 0xe2220abe, 0xd2916ebf, 0x4ec75b95, 0x24f2c3c0, 0x42d15d99, 0xcd0d7fa0, 0x7b6e27ff, 0xa8dc8af0, 0x7345c106, 0xf41e232f, 0x35162386, 0xe6ea8926, 0x3333b094, 0x157ec6f2, 0x372b74af, 0x692573e4, 0xe9a9d848, 0xf3160289, 0x3a62ef1d, 0xa787e238, 0xf3a5f676, 0x74364853, 0x20951063, 0x4576698d, 0xb6fad407, 0x592af950, 0x36f73523, 0x4cfb6e87, 0x7da4cec0, 0x6c152daa, 0xcb0396a8, 0xc50dfe5d, 0xfcd707ab, 0x0921c42f, 0x89dff0bb, 0x5fe2be78, 0x448f4f33, 0x754613c9, 0x2b05d08d, 0x48b9d585, 0xdc049441, 0xc8098f9b, 0x7dede786, 0xc39a3373, 0x42410005, 0x6a091751, 0x0ef3c8a6, 0x890072d6, 0x28207682, 0xa9a9f7be, 0xbf32679d, 0xd45b5b75, 0xb353fd00, 0xcbb0e358, 0x830f220a, 0x1f8fb214, 0xd372cf08, 0xcc3c4a13, 0x8cf63166, 0x061c87be, 0x88c98f88, 0x6062e397, 0x47cf8e7a, 0xb6c85283, 0x3cc2acfb, 0x3fc06976, 0x4e8f0252, 0x64d8314d, 0xda3870e3, 0x1e665459, 0xc10908f0, 0x513021a5, 0x6c5b68b7, 0x822f8aa0, 0x3007cd3e, 0x74719eef, 0xdc872681, 0x073340d4, 0x7e432fd9, 0x0c5ec241, 0x8809286c, 0xf592d891, 0x08a930f6, 0x957ef305, 0xb7fbffbd, 0xc266e96f, 0x6fe4ac98, 0xb173ecc0, 0xbc60b42a, 0x953498da, 0xfba1ae12, 0x2d4bd736, 0x0f25faab, 0xa4f3fceb, 0xe2969123, 0x257f0c3d, 0x9348af49, 0x361400bc, 0xe8816f4a, 0x3814f200, 0xa3f94043, 0x9c7a54c2, 0xbc704f57, 0xda41e7f9, 0xc25ad33a, 0x54f4a084, 0xb17f5505, 0x59357cbe, 0xedbd15c8, 0x7f97c5ab, 0xba5ac7b5, 0xb6f6deaf, 0x3a479c3a, 0x5302da25, 0x653d7e6a, 0x54268d49, 0x51a477ea, 0x5017d55b, 0xd7d25d88, 0x44136c76, 0x0404a8c8, 0xb8e5a121, 0xb81a928a, 0x60ed5869, 0x97c55b96, 0xeaec991b, 0x29935913, 0x01fdb7f1, 0x088e8dfa, 0x9ab6f6f5, 0x3b4cbf9f, 0x4a5de3ab, 0xe6051d35, 0xa0e1d855, 0xd36b4cf1, 0xf544edeb, 0xb0e93524, 0xbebb8fbd, 0xa2d762cf, 0x49c92f54, 0x38b5f331, 0x7128a454, 0x48392905, 0xa65b1db8, 0x851c97bd, 0xd675cf2f]);
sBox[6] = new Uint32Array([0x85e04019, 0x332bf567, 0x662dbfff, 0xcfc65693, 0x2a8d7f6f, 0xab9bc912, 0xde6008a1, 0x2028da1f, 0x0227bce7, 0x4d642916, 0x18fac300, 0x50f18b82, 0x2cb2cb11, 0xb232e75c, 0x4b3695f2, 0xb28707de, 0xa05fbcf6, 0xcd4181e9, 0xe150210c, 0xe24ef1bd, 0xb168c381, 0xfde4e789, 0x5c79b0d8, 0x1e8bfd43, 0x4d495001, 0x38be4341, 0x913cee1d, 0x92a79c3f, 0x089766be, 0xbaeeadf4, 0x1286becf, 0xb6eacb19, 0x2660c200, 0x7565bde4, 0x64241f7a, 0x8248dca9, 0xc3b3ad66, 0x28136086, 0x0bd8dfa8, 0x356d1cf2, 0x107789be, 0xb3b2e9ce, 0x0502aa8f, 0x0bc0351e, 0x166bf52a, 0xeb12ff82, 0xe3486911, 0xd34d7516, 0x4e7b3aff, 0x5f43671b, 0x9cf6e037, 0x4981ac83, 0x334266ce, 0x8c9341b7, 0xd0d854c0, 0xcb3a6c88, 0x47bc2829, 0x4725ba37, 0xa66ad22b, 0x7ad61f1e, 0x0c5cbafa, 0x4437f107, 0xb6e79962, 0x42d2d816, 0x0a961288, 0xe1a5c06e, 0x13749e67, 0x72fc081a, 0xb1d139f7, 0xf9583745, 0xcf19df58, 0xbec3f756, 0xc06eba30, 0x07211b24, 0x45c28829, 0xc95e317f, 0xbc8ec511, 0x38bc46e9, 0xc6e6fa14, 0xbae8584a, 0xad4ebc46, 0x468f508b, 0x7829435f, 0xf124183b, 0x821dba9f, 0xaff60ff4, 0xea2c4e6d, 0x16e39264, 0x92544a8b, 0x009b4fc3, 0xaba68ced, 0x9ac96f78, 0x06a5b79a, 0xb2856e6e, 0x1aec3ca9, 0xbe838688, 0x0e0804e9, 0x55f1be56, 0xe7e5363b, 0xb3a1f25d, 0xf7debb85, 0x61fe033c, 0x16746233, 0x3c034c28, 0xda6d0c74, 0x79aac56c, 0x3ce4e1ad, 0x51f0c802, 0x98f8f35a, 0x1626a49f, 0xeed82b29, 0x1d382fe3, 0x0c4fb99a, 0xbb325778, 0x3ec6d97b, 0x6e77a6a9, 0xcb658b5c, 0xd45230c7, 0x2bd1408b, 0x60c03eb7, 0xb9068d78, 0xa33754f4, 0xf430c87d, 0xc8a71302, 0xb96d8c32, 0xebd4e7be, 0xbe8b9d2d, 0x7979fb06, 0xe7225308, 0x8b75cf77, 0x11ef8da4, 0xe083c858, 0x8d6b786f, 0x5a6317a6, 0xfa5cf7a0, 0x5dda0033, 0xf28ebfb0, 0xf5b9c310, 0xa0eac280, 0x08b9767a, 0xa3d9d2b0, 0x79d34217, 0x021a718d, 0x9ac6336a, 0x2711fd60, 0x438050e3, 0x069908a8, 0x3d7fedc4, 0x826d2bef, 0x4eeb8476, 0x488dcf25, 0x36c9d566, 0x28e74e41, 0xc2610aca, 0x3d49a9cf, 0xbae3b9df, 0xb65f8de6, 0x92aeaf64, 0x3ac7d5e6, 0x9ea80509, 0xf22b017d, 0xa4173f70, 0xdd1e16c3, 0x15e0d7f9, 0x50b1b887, 0x2b9f4fd5, 0x625aba82, 0x6a017962, 0x2ec01b9c, 0x15488aa9, 0xd716e740, 0x40055a2c, 0x93d29a22, 0xe32dbf9a, 0x058745b9, 0x3453dc1e, 0xd699296e, 0x496cff6f, 0x1c9f4986, 0xdfe2ed07, 0xb87242d1, 0x19de7eae, 0x053e561a, 0x15ad6f8c, 0x66626c1c, 0x7154c24c, 0xea082b2a, 0x93eb2939, 0x17dcb0f0, 0x58d4f2ae, 0x9ea294fb, 0x52cf564c, 0x9883fe66, 0x2ec40581, 0x763953c3, 0x01d6692e, 0xd3a0c108, 0xa1e7160e, 0xe4f2dfa6, 0x693ed285, 0x74904698, 0x4c2b0edd, 0x4f757656, 0x5d393378, 0xa132234f, 0x3d321c5d, 0xc3f5e194, 0x4b269301, 0xc79f022f, 0x3c997e7e, 0x5e4f9504, 0x3ffafbbd, 0x76f7ad0e, 0x296693f4, 0x3d1fce6f, 0xc61e45be, 0xd3b5ab34, 0xf72bf9b7, 0x1b0434c0, 0x4e72b567, 0x5592a33d, 0xb5229301, 0xcfd2a87f, 0x60aeb767, 0x1814386b, 0x30bcc33d, 0x38a0c07d, 0xfd1606f2, 0xc363519b, 0x589dd390, 0x5479f8e6, 0x1cb8d647, 0x97fd61a9, 0xea7759f4, 0x2d57539d, 0x569a58cf, 0xe84e63ad, 0x462e1b78, 0x6580f87e, 0xf3817914, 0x91da55f4, 0x40a230f3, 0xd1988f35, 0xb6e318d2, 0x3ffa50bc, 0x3d40f021, 0xc3c0bdae, 0x4958c24c, 0x518f36b2, 0x84b1d370, 0x0fedce83, 0x878ddada, 0xf2a279c7, 0x94e01be8, 0x90716f4b, 0x954b8aa3]);
sBox[7] = new Uint32Array([0xe216300d, 0xbbddfffc, 0xa7ebdabd, 0x35648095, 0x7789f8b7, 0xe6c1121b, 0x0e241600, 0x052ce8b5, 0x11a9cfb0, 0xe5952f11, 0xece7990a, 0x9386d174, 0x2a42931c, 0x76e38111, 0xb12def3a, 0x37ddddfc, 0xde9adeb1, 0x0a0cc32c, 0xbe197029, 0x84a00940, 0xbb243a0f, 0xb4d137cf, 0xb44e79f0, 0x049eedfd, 0x0b15a15d, 0x480d3168, 0x8bbbde5a, 0x669ded42, 0xc7ece831, 0x3f8f95e7, 0x72df191b, 0x7580330d, 0x94074251, 0x5c7dcdfa, 0xabbe6d63, 0xaa402164, 0xb301d40a, 0x02e7d1ca, 0x53571dae, 0x7a3182a2, 0x12a8ddec, 0xfdaa335d, 0x176f43e8, 0x71fb46d4, 0x38129022, 0xce949ad4, 0xb84769ad, 0x965bd862, 0x82f3d055, 0x66fb9767, 0x15b80b4e, 0x1d5b47a0, 0x4cfde06f, 0xc28ec4b8, 0x57e8726e, 0x647a78fc, 0x99865d44, 0x608bd593, 0x6c200e03, 0x39dc5ff6, 0x5d0b00a3, 0xae63aff2, 0x7e8bd632, 0x70108c0c, 0xbbd35049, 0x2998df04, 0x980cf42a, 0x9b6df491, 0x9e7edd53, 0x06918548, 0x58cb7e07, 0x3b74ef2e, 0x522fffb1, 0xd24708cc, 0x1c7e27cd, 0xa4eb215b, 0x3cf1d2e2, 0x19b47a38, 0x424f7618, 0x35856039, 0x9d17dee7, 0x27eb35e6, 0xc9aff67b, 0x36baf5b8, 0x09c467cd, 0xc18910b1, 0xe11dbf7b, 0x06cd1af8, 0x7170c608, 0x2d5e3354, 0xd4de495a, 0x64c6d006, 0xbcc0c62c, 0x3dd00db3, 0x708f8f34, 0x77d51b42, 0x264f620f, 0x24b8d2bf, 0x15c1b79e, 0x46a52564, 0xf8d7e54e, 0x3e378160, 0x7895cda5, 0x859c15a5, 0xe6459788, 0xc37bc75f, 0xdb07ba0c, 0x0676a3ab, 0x7f229b1e, 0x31842e7b, 0x24259fd7, 0xf8bef472, 0x835ffcb8, 0x6df4c1f2, 0x96f5b195, 0xfd0af0fc, 0xb0fe134c, 0xe2506d3d, 0x4f9b12ea, 0xf215f225, 0xa223736f, 0x9fb4c428, 0x25d04979, 0x34c713f8, 0xc4618187, 0xea7a6e98, 0x7cd16efc, 0x1436876c, 0xf1544107, 0xbedeee14, 0x56e9af27, 0xa04aa441, 0x3cf7c899, 0x92ecbae6, 0xdd67016d, 0x151682eb, 0xa842eedf, 0xfdba60b4, 0xf1907b75, 0x20e3030f, 0x24d8c29e, 0xe139673b, 0xefa63fb8, 0x71873054, 0xb6f2cf3b, 0x9f326442, 0xcb15a4cc, 0xb01a4504, 0xf1e47d8d, 0x844a1be5, 0xbae7dfdc, 0x42cbda70, 0xcd7dae0a, 0x57e85b7a, 0xd53f5af6, 0x20cf4d8c, 0xcea4d428, 0x79d130a4, 0x3486ebfb, 0x33d3cddc, 0x77853b53, 0x37effcb5, 0xc5068778, 0xe580b3e6, 0x4e68b8f4, 0xc5c8b37e, 0x0d809ea2, 0x398feb7c, 0x132a4f94, 0x43b7950e, 0x2fee7d1c, 0x223613bd, 0xdd06caa2, 0x37df932b, 0xc4248289, 0xacf3ebc3, 0x5715f6b7, 0xef3478dd, 0xf267616f, 0xc148cbe4, 0x9052815e, 0x5e410fab, 0xb48a2465, 0x2eda7fa4, 0xe87b40e4, 0xe98ea084, 0x5889e9e1, 0xefd390fc, 0xdd07d35b, 0xdb485694, 0x38d7e5b2, 0x57720101, 0x730edebc, 0x5b643113, 0x94917e4f, 0x503c2fba, 0x646f1282, 0x7523d24a, 0xe0779695, 0xf9c17a8f, 0x7a5b2121, 0xd187b896, 0x29263a4d, 0xba510cdf, 0x81f47c9f, 0xad1163ed, 0xea7b5965, 0x1a00726e, 0x11403092, 0x00da6d77, 0x4a0cdd61, 0xad1f4603, 0x605bdfb0, 0x9eedc364, 0x22ebe6a8, 0xcee7d28a, 0xa0e736a0, 0x5564a6b9, 0x10853209, 0xc7eb8f37, 0x2de705ca, 0x8951570f, 0xdf09822b, 0xbd691a6c, 0xaa12e4f2, 0x87451c0f, 0xe0f6a27a, 0x3ada4819, 0x4cf1764f, 0x0d771c2b, 0x67cdb156, 0x350d8384, 0x5938fa0f, 0x42399ef3, 0x36997b07, 0x0e84093d, 0x4aa93e61, 0x8360d87b, 0x1fa98b0c, 0x1149382c, 0xe97625a5, 0x0614d1b7, 0x0e25244b, 0x0c768347, 0x589e8d82, 0x0d2059d1, 0xa466bb1e, 0xf8da0a82, 0x04f19130, 0xba6e4ec0, 0x99265164, 0x1ee7230d, 0x50b2ad80, 0xeaee6801, 0x8db2a283, 0xea8bf59e]);
return this.sBox = sBox;
};
return Global;
})();
G = new Global();
CAST5 = (function() {
CAST5.blockSize = 8;
CAST5.prototype.blockSize = CAST5.blockSize;
CAST5.keySize = 16;
CAST5.prototype.keySize = CAST5.keySize;
function CAST5(key) {
var n;
this.masking = new Array(16);
this.rotate = new Array(16);
this.reset();
if (key.sigBytes !== (n = this.keySize)) {
throw new Error("key must be " + n + " bytes");
}
this.keySchedule(key);
}
CAST5.prototype.reset = function() {
var i, _i, _results;
_results = [];
for (i = _i = 0; _i < 16; i = ++_i) {
this.masking[i] = 0;
_results.push(this.rotate[i] = 0);
}
return _results;
};
CAST5.prototype.encryptBlock = function(words, offset) {
var bytes, res;
if (offset == null) {
offset = 0;
}
bytes = ui32a_to_ui8a(words);
res = this._encrypt_ui8a(bytes);
return ui8a_to_ui32a(res, words);
};
CAST5.prototype.decryptBlock = function(words, offset) {
var bytes, res;
if (offset == null) {
offset = 0;
}
bytes = ui32a_to_ui8a(words);
res = this._decrypt_ui8a(bytes);
return ui8a_to_ui32a(res, words);
};
CAST5.prototype._encrypt_ui8a = function(src) {
var dst, i, l, len, r, t, _i;
len = src.length;
dst = new Uint8Array(len);
for (i = _i = 0; _i < len; i = _i += 8) {
l = src[i] << 24 | src[i + 1] << 16 | src[i + 2] << 8 | src[i + 3];
r = src[i + 4] << 24 | src[i + 5] << 16 | src[i + 6] << 8 | src[i + 7];
t = r;
r = l ^ this.f1(r, this.masking[0], this.rotate[0]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[1], this.rotate[1]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[2], this.rotate[2]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[3], this.rotate[3]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[4], this.rotate[4]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[5], this.rotate[5]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[6], this.rotate[6]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[7], this.rotate[7]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[8], this.rotate[8]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[9], this.rotate[9]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[10], this.rotate[10]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[11], this.rotate[11]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[12], this.rotate[12]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[13], this.rotate[13]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[14], this.rotate[14]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[15], this.rotate[15]);
l = t;
dst[i] = (r >>> 24) & 255;
dst[i + 1] = (r >>> 16) & 255;
dst[i + 2] = (r >>> 8) & 255;
dst[i + 3] = r & 255;
dst[i + 4] = (l >>> 24) & 255;
dst[i + 5] = (l >>> 16) & 255;
dst[i + 6] = (l >>> 8) & 255;
dst[i + 7] = l & 255;
}
return dst;
};
CAST5.prototype._decrypt_ui8a = function(src) {
var dst, i, l, len, r, t, _i;
len = src.length;
dst = new Uint8Array(len);
for (i = _i = 0; _i < len; i = _i += 8) {
l = src[i] << 24 | src[i + 1] << 16 | src[i + 2] << 8 | src[i + 3];
r = src[i + 4] << 24 | src[i + 5] << 16 | src[i + 6] << 8 | src[i + 7];
t = r;
r = l ^ this.f1(r, this.masking[15], this.rotate[15]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[14], this.rotate[14]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[13], this.rotate[13]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[12], this.rotate[12]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[11], this.rotate[11]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[10], this.rotate[10]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[9], this.rotate[9]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[8], this.rotate[8]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[7], this.rotate[7]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[6], this.rotate[6]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[5], this.rotate[5]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[4], this.rotate[4]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[3], this.rotate[3]);
l = t;
t = r;
r = l ^ this.f3(r, this.masking[2], this.rotate[2]);
l = t;
t = r;
r = l ^ this.f2(r, this.masking[1], this.rotate[1]);
l = t;
t = r;
r = l ^ this.f1(r, this.masking[0], this.rotate[0]);
l = t;
dst[i] = (r >>> 24) & 255;
dst[i + 1] = (r >>> 16) & 255;
dst[i + 2] = (r >>> 8) & 255;
dst[i + 3] = r & 255;
dst[i + 4] = (l >>> 24) & 255;
dst[i + 5] = (l >> 16) & 255;
dst[i + 6] = (l >> 8) & 255;
dst[i + 7] = l & 255;
}
return dst;
};
CAST5.prototype.keySchedule = function(key) {
var a, b, half, i, j, k, ki, kw, round, t, w, x, _i, _j, _k, _l, _m, _results;
t = (function() {
var _i, _len, _ref1, _results;
_ref1 = key.words;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
kw = _ref1[_i];
_results.push(kw);
}
return _results;
})();
k = new Array(32);
x = [6, 7, 4, 5];
ki = 0;
for (half = _i = 0; _i < 2; half = ++_i) {
for (round = _j = 0; _j < 4; round = ++_j) {
for (j = _k = 0; _k < 4; j = ++_k) {
a = G.scheduleA[round][j];
w = t[a[1]];
w ^= G.sBox[4][(t[a[2] >>> 2] >>> (24 - 8 * (a[2] & 3))) & 0xff];
w ^= G.sBox[5][(t[a[3] >>> 2] >>> (24 - 8 * (a[3] & 3))) & 0xff];
w ^= G.sBox[6][(t[a[4] >>> 2] >>> (24 - 8 * (a[4] & 3))) & 0xff];
w ^= G.sBox[7][(t[a[5] >>> 2] >>> (24 - 8 * (a[5] & 3))) & 0xff];
w ^= G.sBox[x[j]][(t[a[6] >>> 2] >>> (24 - 8 * (a[6] & 3))) & 0xff];
t[a[0]] = w;
}
for (j = _l = 0; _l < 4; j = ++_l) {
b = G.scheduleB[round][j];
w = G.sBox[4][(t[b[0] >>> 2] >>> (24 - 8 * (b[0] & 3))) & 0xff];
w ^= G.sBox[5][(t[b[1] >>> 2] >>> (24 - 8 * (b[1] & 3))) & 0xff];
w ^= G.sBox[6][(t[b[2] >>> 2] >>> (24 - 8 * (b[2] & 3))) & 0xff];
w ^= G.sBox[7][(t[b[3] >>> 2] >>> (24 - 8 * (b[3] & 3))) & 0xff];
w ^= G.sBox[4 + j][(t[b[4] >>> 2] >>> (24 - 8 * (b[4] & 3))) & 0xff];
k[ki] = w;
ki++;
}
}
}
_results = [];
for (i = _m = 0; _m < 16; i = ++_m) {
this.masking[i] = k[i];
_results.push(this.rotate[i] = k[16 + i] & 0x1f);
}
return _results;
};
CAST5.prototype.f1 = function(d, m, r) {
var I, t;
t = m + d;
I = (t << r) | (t >>> (32 - r));
return ((G.sBox[0][I >>> 24] ^ G.sBox[1][(I >>> 16) & 255]) - G.sBox[2][(I >>> 8) & 255]) + G.sBox[3][I & 255];
};
CAST5.prototype.f2 = function(d, m, r) {
var I, t;
t = m ^ d;
I = (t << r) | (t >>> (32 - r));
return ((G.sBox[0][I >>> 24] - G.sBox[1][(I >>> 16) & 255]) + G.sBox[2][(I >>> 8) & 255]) ^ G.sBox[3][I & 255];
};
CAST5.prototype.f3 = function(d, m, r) {
var I, t;
t = m - d;
I = (t << r) | (t >>> (32 - r));
return ((G.sBox[0][I >>> 24] + G.sBox[1][(I >>> 16) & 255]) ^ G.sBox[2][(I >>> 8) & 255]) - G.sBox[3][I & 255];
};
return CAST5;
})();
exports.CAST5 = CAST5;
}).call(this);
},{"../util":70,"triplesec":181}],38:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var AES, WordArray, ciphers, decrypt, encrypt, _ref;
_ref = require('triplesec'), ciphers = _ref.ciphers, WordArray = _ref.WordArray;
AES = ciphers.AES;
encrypt = function(_arg) {
var block_cipher_class, block_size, c, cipher, e, iv, key, list, out, plaintext, pos;
block_cipher_class = _arg.block_cipher_class, key = _arg.key, cipher = _arg.cipher, plaintext = _arg.plaintext, iv = _arg.iv;
block_cipher_class || (block_cipher_class = AES);
cipher || (cipher = new block_cipher_class(WordArray.from_buffer(key)));
block_size = cipher.blockSize;
c = WordArray.from_buffer(iv.slice(0, block_size));
pos = 0;
list = (function() {
var _results;
_results = [];
while (plaintext.length > pos) {
cipher.encryptBlock(c.words, 0);
e = c;
c = WordArray.from_buffer(plaintext.slice(pos, pos + block_size));
e.xor(c, {
n_words: c.words.length
});
pos += block_size;
c = e;
_results.push(e.to_buffer());
}
return _results;
})();
out = Buffer.concat(list);
return out.slice(0, plaintext.length);
};
decrypt = function(_arg) {
var b, block_cipher_class, block_size, cipher, ciphertext, d, i, iv, key, list, out, pos;
block_cipher_class = _arg.block_cipher_class, key = _arg.key, cipher = _arg.cipher, ciphertext = _arg.ciphertext, iv = _arg.iv;
block_cipher_class || (block_cipher_class = AES);
cipher || (cipher = new block_cipher_class(WordArray.from_buffer(key)));
block_size = cipher.blockSize;
iv || (iv = new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= block_size ? _i < block_size : _i > block_size; i = 0 <= block_size ? ++_i : --_i) {
_results.push(0);
}
return _results;
})()));
b = WordArray.from_buffer(iv.slice(0, block_size));
pos = 0;
list = (function() {
var _results;
_results = [];
while (ciphertext.length > pos) {
cipher.encryptBlock(b.words, 0);
d = b;
b = WordArray.from_buffer(ciphertext.slice(pos, pos + block_size));
d.xor(b, {});
pos += block_size;
_results.push(d.to_buffer());
}
return _results;
})();
out = Buffer.concat(list);
return out.slice(out, ciphertext.length);
};
exports.encrypt = encrypt;
exports.decrypt = decrypt;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"buffer":80,"triplesec":181}],39:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Ch, ClearSigner, CreationTime, Issuer, Literal, SHA512, SRF, Signature, Verifier, VerifierBase, WordArray, bufferify, clearsign_header, clearsign_to_sign, dash_escape, dash_unescape_line, dash_unescape_lines, encode, export_key_pgp, get_cipher, hashmod, iced, input_to_cleartext, input_to_cleartext_display, input_to_cleartext_sign, konst, make_esc, scrub_buffer, triplesec, unix_time, whitespace_strip, __iced_k, __iced_k_noop, _ref, _ref1, _ref2,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
make_esc = require('iced-error').make_esc;
_ref = require('./packet/signature'), Signature = _ref.Signature, CreationTime = _ref.CreationTime, Issuer = _ref.Issuer;
_ref1 = require('../util'), bufferify = _ref1.bufferify, unix_time = _ref1.unix_time;
SRF = require('../rand').SRF;
triplesec = require('triplesec');
_ref2 = require('../symmetric'), export_key_pgp = _ref2.export_key_pgp, get_cipher = _ref2.get_cipher;
scrub_buffer = triplesec.util.scrub_buffer;
WordArray = triplesec.WordArray;
konst = require('../const');
C = konst.openpgp;
Ch = require('../header');
hashmod = require('../hash');
SHA512 = hashmod.SHA512;
encode = require('./armor').encode;
clearsign_header = require('pgp-utils').armor.clearsign_header;
Literal = require("./packet/literal").Literal;
VerifierBase = require('./verifier').Base;
exports.input_to_cleartext = input_to_cleartext = function(raw) {
var lines, ret;
lines = raw.split(/\n/);
ret = {
show: bufferify(input_to_cleartext_display(lines)),
sign: bufferify(input_to_cleartext_sign(lines))
};
return ret;
};
exports.dash_escape = dash_escape = function(line) {
if (line.length >= 1 && line[0] === '-') {
return "- " + line;
} else {
return line;
}
};
exports.dash_unescape_line = dash_unescape_line = function(line) {
var m, out, warn, _ref3;
warn = false;
out = (m = line.match(/^-( )?(.*?)$/)) != null ? (((_ref3 = m[1]) != null ? _ref3.length : void 0) !== 1 ? warn = true : void 0, m[2]) : line;
return [out, warn];
};
exports.dash_unescape_lines = dash_unescape_lines = function(lines, warnings) {
var i, l, line, ret, warn;
if (warnings == null) {
warnings = null;
}
ret = (function() {
var _i, _len, _ref3, _results;
_results = [];
for (i = _i = 0, _len = lines.length; _i < _len; i = ++_i) {
line = lines[i];
_ref3 = dash_unescape_line(line), l = _ref3[0], warn = _ref3[1];
if (warn) {
if (warnings != null) {
warnings.push("Bad dash-encoding on line " + (i + 1));
}
}
_results.push(l);
}
return _results;
})();
return ret;
};
exports.input_to_cleartext_display = input_to_cleartext_display = function(lines) {
var line, out;
out = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = lines.length; _i < _len; _i++) {
line = lines[_i];
_results.push(dash_escape(line));
}
return _results;
})();
if (lines.length === 0 || lines.slice(-1)[0] !== '') {
out.push('');
}
return out.join("\n");
};
exports.clearsign_to_sign = clearsign_to_sign = function(lines, warnings) {
lines = dash_unescape_lines(lines, warnings);
return input_to_cleartext_sign(lines);
};
exports.input_to_cleartext_sign = input_to_cleartext_sign = function(lines) {
var line, num_trailing_newlines, t, tmp, _i;
tmp = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = lines.length; _i < _len; _i++) {
line = lines[_i];
_results.push(whitespace_strip(line));
}
return _results;
})();
num_trailing_newlines = 0;
for (_i = tmp.length - 1; _i >= 0; _i += -1) {
t = tmp[_i];
if (t === '') {
num_trailing_newlines++;
} else {
break;
}
}
if (num_trailing_newlines > 0) {
tmp.pop();
}
return tmp.join("\r\n");
};
exports.whitespace_strip = whitespace_strip = function(line) {
var m;
line = line.replace(/\r/g, '');
if ((m = line.match(/^(.*?)([ \t]*)$/))) {
return m[1];
} else {
return line;
}
};
ClearSigner = (function() {
function ClearSigner(_arg) {
this.msg = _arg.msg, this.signing_key = _arg.signing_key;
}
ClearSigner.prototype._fix_msg = function(cb) {
this._cleartext = input_to_cleartext(this.msg.toString('utf8'));
return cb(null);
};
ClearSigner.prototype._sign_msg = function(cb) {
var err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
this.sig = new Signature({
sig_type: C.sig_types.canonical_text,
key: this.signing_key.key,
hashed_subpackets: [new CreationTime(unix_time())],
unhashed_subpackets: [new Issuer(this.signing_key.get_key_id())]
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "ClearSigner._sign_msg"
});
_this.sig.write(_this._cleartext.sign, __iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
err = arguments[0];
return __slot_1._sig_output = arguments[1];
};
})(_this),
lineno: 117
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, _this._sig_output);
};
})(this));
};
ClearSigner.prototype.scrub = function() {};
ClearSigner.prototype.hasher_name = function() {
return this.sig.hasher.algname;
};
ClearSigner.prototype._encode = function(cb) {
var body, hdr;
hdr = clearsign_header(Ch, this._cleartext.show, this.hasher_name());
body = encode(C.message_types.signature, this._sig_output);
return cb(null, hdr + body);
};
ClearSigner.prototype.run = function(cb) {
var encoded, esc, signature, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "ClearSigner::run");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "ClearSigner.run"
});
_this._fix_msg(esc(__iced_deferrals.defer({
lineno: 139
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "ClearSigner.run"
});
_this._sign_msg(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return signature = arguments[0];
};
})(),
lineno: 140
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "ClearSigner.run"
});
_this._encode(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return encoded = arguments[0];
};
})(),
lineno: 141
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, encoded, signature);
});
});
};
})(this));
};
return ClearSigner;
})();
Verifier = (function(_super) {
__extends(Verifier, _super);
function Verifier(_arg) {
var keyfetch, packets;
packets = _arg.packets, this.clearsign = _arg.clearsign, keyfetch = _arg.keyfetch;
Verifier.__super__.constructor.call(this, {
packets: packets,
keyfetch: keyfetch
});
}
Verifier.prototype._reformat_text = function(cb) {
var data;
data = bufferify(clearsign_to_sign(this.clearsign.lines));
this._literal = new Literal({
data: data,
format: C.literal_formats.utf8,
date: unix_time()
});
return cb(null);
};
Verifier.prototype._make_hasher = function(cb) {
var err, h;
err = null;
h = this.clearsign.headers.hash || 'MD5';
if ((this._sig.hasher = hashmod[h]) == null) {
err = new Error("Unknown hash algorithm: " + h);
}
return cb(err);
};
Verifier.prototype._verify = function(cb) {
var err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier._verify"
});
_this._sig.verify([_this._literal], __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 182
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Verifier.prototype._check_headers = function(cb) {
var err, k, v, _ref3;
err = null;
_ref3 = this.clearsign.headers;
for (k in _ref3) {
v = _ref3[k];
if (k !== 'hash') {
err = new Error("Unallowed header: " + k);
break;
}
}
return cb(err);
};
Verifier.prototype.run = function(cb) {
var esc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Verifier::run");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier.run"
});
_this._check_headers(esc(__iced_deferrals.defer({
lineno: 199
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier.run"
});
_this._find_signature(esc(__iced_deferrals.defer({
lineno: 200
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier.run"
});
_this._reformat_text(esc(__iced_deferrals.defer({
lineno: 201
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier.run"
});
_this._fetch_key(esc(__iced_deferrals.defer({
lineno: 202
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier.run"
});
_this._make_hasher(esc(__iced_deferrals.defer({
lineno: 203
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "Verifier.run"
});
_this._verify(esc(__iced_deferrals.defer({
lineno: 204
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, _this._literal);
});
});
});
});
});
};
})(this));
};
return Verifier;
})(VerifierBase);
exports.sign = function(_arg, cb) {
var b, encoded, err, msg, signature, signing_key, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
msg = _arg.msg, signing_key = _arg.signing_key;
b = new ClearSigner({
msg: msg,
signing_key: signing_key
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "sign"
});
b.run(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
encoded = arguments[1];
return signature = arguments[2];
};
})(),
lineno: 215
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
b.scrub();
return cb(err, encoded, signature);
};
})(this));
};
exports.verify = function(_arg, cb) {
var clearsign, err, keyfetch, literal, packets, v, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
packets = _arg.packets, clearsign = _arg.clearsign, keyfetch = _arg.keyfetch;
v = new Verifier({
packets: packets,
clearsign: clearsign,
keyfetch: keyfetch
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/clearsign.iced",
funcname: "verify"
});
v.run(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literal = arguments[1];
};
})(),
lineno: 223
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, literal);
};
})(this));
};
}).call(this);
},{"../const":5,"../hash":14,"../header":15,"../rand":65,"../symmetric":68,"../util":70,"./armor":33,"./packet/literal":49,"./packet/signature":53,"./verifier":61,"iced-error":115,"iced-runtime":118,"pgp-utils":163,"triplesec":181}],40:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Ch, CreationTime, Issuer, Literal, Signature, Signer, Verifier, VerifierBase, WordArray, encode, hash_obj_to_fn, iced, konst, make_esc, packetsigs, streamers, unix_time, __iced_k, __iced_k_noop, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
make_esc = require('iced-error').make_esc;
_ref = require('./packet/signature'), Signature = _ref.Signature, CreationTime = _ref.CreationTime, Issuer = _ref.Issuer;
unix_time = require('../util').unix_time;
WordArray = require('triplesec').WordArray;
konst = require('../const');
C = konst.openpgp;
Ch = require('../header');
streamers = require('../hash').streamers;
encode = require('./armor').encode;
Literal = require("./packet/literal").Literal;
VerifierBase = require('./verifier').Base;
packetsigs = require('./packet/packetsigs');
hash_obj_to_fn = function(obj) {
var fn;
fn = function(buf) {
return obj.finalize(WordArray.from_buffer(buf)).to_buffer();
};
return fn.algname = buf.algname;
};
Signer = (function() {
function Signer(_arg) {
this.data = _arg.data, this.hash_streamer = _arg.hash_streamer, this.signing_key = _arg.signing_key;
}
Signer.prototype.run = function(cb) {
var encoded, esc, signature, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Signer::run");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Signer.run"
});
_this._run_hash(esc(__iced_deferrals.defer({
lineno: 39
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Signer.run"
});
_this._sign(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return signature = arguments[0];
};
})(),
lineno: 40
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Signer.run"
});
_this._encode(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return encoded = arguments[0];
};
})(),
lineno: 41
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, encoded, signature);
});
});
};
})(this));
};
Signer.prototype.scrub = function() {};
Signer.prototype._sign = function(cb) {
var emptybuf, err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
this.sig = new Signature({
sig_type: C.sig_types.canonical_text,
key: this.signing_key.key,
hashed_subpackets: [new CreationTime(unix_time())],
unhashed_subpackets: [new Issuer(this.signing_key.get_key_id())],
hasher: this.hash_streamer
});
emptybuf = new Buffer([]);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Signer._sign"
});
_this.sig.write(emptybuf, __iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
err = arguments[0];
return __slot_1._sig_output = arguments[1];
};
})(_this),
lineno: 60
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, _this._sig_output);
};
})(this));
};
Signer.prototype._encode = function(cb) {
var err, ret;
err = null;
ret = encode(C.message_types.signature, this._sig_output);
return cb(err, ret);
};
Signer.prototype._run_hash = function(cb) {
var err;
err = null;
if (this.hash_streamer != null) {
} else if (this.data != null) {
this.hash_streamer = streamers.SHA512();
this.hash_streamer.update(this.data);
} else {
err = new Error("Need either a hasher or data");
}
return cb(err);
};
return Signer;
})();
Verifier = (function(_super) {
__extends(Verifier, _super);
function Verifier(_arg) {
var keyfetch, packets;
packets = _arg.packets, this.data = _arg.data, this.data_fn = _arg.data_fn, keyfetch = _arg.keyfetch;
Verifier.__super__.constructor.call(this, {
packets: packets,
keyfetch: keyfetch
});
}
Verifier.prototype._consume_data = function(cb) {
var buf_hasher, done, err, go, klass, streamer, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
(function(_this) {
return (function(__iced_k) {
if (_this.data_fn != null) {
err = null;
klass = _this._sig.hasher.klass;
streamer = streamers[_this._sig.hasher.algname]();
buf_hasher = function(buf) {
return streamer.update(buf);
};
go = true;
(function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!go) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier._consume_data"
});
_this.data_fn(buf_hasher, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return done = arguments[1];
};
})(),
lineno: 102
}));
__iced_deferrals._fulfill();
})(function() {
return _next((err != null) || done ? go = false : void 0);
});
}
};
_while(__iced_k);
})(function() {
return __iced_k(_this._sig.hasher = streamer);
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Verifier.prototype._verify = function(cb) {
var data, err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
data = this.data ? [
new Literal({
data: this.data
})
] : [];
this.literals = data;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier._verify"
});
_this._sig.verify(data, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 113
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Verifier.prototype._make_literals = function(cb) {
if (!this.literals.length) {
this.literals.push(new Literal({
data: new Buffer([])
}));
}
this.literals[0].push_sig(new packetsigs.Data({
sig: this._sig
}));
return cb(null);
};
Verifier.prototype.run = function(cb) {
var esc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Verifier::run");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier.run"
});
_this._find_signature(esc(__iced_deferrals.defer({
lineno: 128
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier.run"
});
_this._fetch_key(esc(__iced_deferrals.defer({
lineno: 129
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier.run"
});
_this._consume_data(esc(__iced_deferrals.defer({
lineno: 130
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier.run"
});
_this._verify(esc(__iced_deferrals.defer({
lineno: 131
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "Verifier.run"
});
_this._make_literals(esc(__iced_deferrals.defer({
lineno: 132
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, _this.literals);
});
});
});
});
};
})(this));
};
return Verifier;
})(VerifierBase);
exports.sign = function(_arg, cb) {
var data, encoded, err, hash_streamer, s, signature, signing_key, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
data = _arg.data, hash_streamer = _arg.hash_streamer, signing_key = _arg.signing_key;
s = new Signer({
data: data,
hash_streamer: hash_streamer,
signing_key: signing_key
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "sign"
});
s.run(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
encoded = arguments[1];
return signature = arguments[2];
};
})(),
lineno: 139
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
s.scrub();
return cb(err, encoded, signature);
};
})(this));
};
exports.verify = function(_arg, cb) {
var data, data_fn, err, keyfetch, literals, packets, v, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
data = _arg.data, data_fn = _arg.data_fn, packets = _arg.packets, keyfetch = _arg.keyfetch;
v = new Verifier({
data: data,
data_fn: data_fn,
packets: packets,
keyfetch: keyfetch
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/detachsign.iced",
funcname: "verify"
});
v.run(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literals = arguments[1];
};
})(),
lineno: 147
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, literals);
};
})(this));
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../hash":14,"../header":15,"../util":70,"./armor":33,"./packet/literal":49,"./packet/packetsigs":51,"./packet/signature":53,"./verifier":61,"buffer":80,"iced-error":115,"iced-runtime":118,"triplesec":181}],41:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var SignatureEngine, burn, processor;
burn = require('./burner').burn;
processor = require('./processor');
SignatureEngine = require('./sigeng').SignatureEngine;
exports.box = burn;
exports.unbox = processor.do_message;
}).call(this);
},{"./burner":36,"./processor":57,"./sigeng":59}],42:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, C, ECDSA, Encryptor, Engine, K, KeyBlock, KeyFetched, KeyFetcher, KeyManager, KeyManagerInterface, Lifespan, Message, P3SKB, PgpEngine, Primary, RSA, SignatureEngine, Subkey, assert_no_nulls, athrow, bufeq_secure, bufferify, decode, encode, format_pgp_fingerprint_2, iced, katch, make_esc, opkts, ops_to_keyflags, parse, read_base64, unix_time, unseal, __iced_k, __iced_k_noop, _ref, _ref1, _ref2, _ref3, _ref4,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; },
__slice = [].slice;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
RSA = require('../rsa').RSA;
ECDSA = require('../ecc/ecdsa').ECDSA;
K = require('../const').kb;
C = require('../const').openpgp;
make_esc = require('iced-error').make_esc;
_ref = require('../util'), format_pgp_fingerprint_2 = _ref.format_pgp_fingerprint_2, athrow = _ref.athrow, assert_no_nulls = _ref.assert_no_nulls, ASP = _ref.ASP, katch = _ref.katch, bufeq_secure = _ref.bufeq_secure, unix_time = _ref.unix_time, bufferify = _ref.bufferify;
ops_to_keyflags = require('./util').ops_to_keyflags;
_ref1 = require('../keywrapper'), Lifespan = _ref1.Lifespan, Subkey = _ref1.Subkey, Primary = _ref1.Primary;
_ref2 = require('./armor'), Message = _ref2.Message, encode = _ref2.encode, decode = _ref2.decode;
parse = require('./parser').parse;
KeyBlock = require('./processor').KeyBlock;
opkts = require('./packet/all');
_ref3 = require('../keybase/encode'), read_base64 = _ref3.read_base64, unseal = _ref3.unseal;
P3SKB = require('../keybase/packet/p3skb').P3SKB;
_ref4 = require('../keyfetch'), KeyFetcher = _ref4.KeyFetcher, KeyFetched = _ref4.KeyFetched;
SignatureEngine = require('./sigeng').SignatureEngine;
Encryptor = require('triplesec').Encryptor;
KeyManagerInterface = require('../kmi').KeyManagerInterface;
Engine = (function() {
function Engine(_arg) {
var k, _i, _len, _ref5;
this.primary = _arg.primary, this.subkeys = _arg.subkeys, this.userids = _arg.userids, this.key_manager = _arg.key_manager;
this.packets = [];
this.messages = [];
this._allocate_key_packets();
_ref5 = this.subkeys;
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
k.primary = this.primary;
}
this._index_keys();
true;
}
Engine.prototype._index_keys = function() {
var k, _i, _len, _ref5, _results;
this._index = {};
_ref5 = this._all_keys();
_results = [];
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
_results.push(this._index[this.ekid(k)] = k);
}
return _results;
};
Engine.prototype.ekid = function(k) {
return this.key(k).ekid();
};
Engine.prototype._allocate_key_packets = function() {
var key, _i, _len, _ref5, _results;
this._v_allocate_key_packet(this.primary, {
subkey: false
});
_ref5 = this.subkeys;
_results = [];
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
key = _ref5[_i];
_results.push(this._v_allocate_key_packet(key, {
subkey: true
}));
}
return _results;
};
Engine.prototype._all_keys = function() {
return [this.primary].concat(this.subkeys);
};
Engine.prototype.self_sign_primary = function(args, cb) {
return this._v_self_sign_primary(args, cb);
};
Engine.prototype.get_all_key_materials = function() {
var k;
return [[this.key(this.primary), true]].concat((function() {
var _i, _len, _ref5, _results;
_ref5 = this.subkeys;
_results = [];
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
_results.push([this.key(k), false]);
}
return _results;
}).call(this));
};
Engine.prototype.sign_subkeys = function(_arg, cb) {
var asp, err, subkey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp;
err = null;
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref5, _results, _while;
_ref5 = _this.subkeys;
_len = _ref5.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
subkey = _ref5[_i];
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "Engine.sign_subkeys"
});
_this._v_sign_subkey({
asp: asp,
subkey: subkey
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 73
}));
__iced_deferrals._fulfill();
})(_next);
} else {
return _continue();
}
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Engine.prototype.get_subkey_materials = function() {
var k, _i, _len, _ref5, _results;
_ref5 = this.subkeys;
_results = [];
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
_results.push(this.key(k));
}
return _results;
};
Engine.prototype.is_locked = function() {
var i, k, _i, _len, _ref5;
_ref5 = this._all_keys();
for (i = _i = 0, _len = _ref5.length; _i < _len; i = ++_i) {
k = _ref5[i];
if (this.key(k).is_locked()) {
return true;
}
}
return false;
};
Engine.prototype.has_private = function() {
var k, _i, _len, _ref5;
_ref5 = this._all_keys();
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
if (this.key(k).has_private()) {
return true;
}
}
return false;
};
Engine.prototype.sign = function(_arg, cb) {
var asp, err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "Engine.sign"
});
_this.self_sign_primary({
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 97
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (typeof err === "undefined" || err === null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "Engine.sign"
});
_this.sign_subkeys({
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 98
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err);
});
};
})(this));
};
Engine.prototype.check_eq = function(eng2) {
var err, i, key, _i, _len, _ref5;
err = null;
if (!this.primary.key.eq(eng2.primary.key)) {
err = new Error("Primary keys don't match");
} else if (this.subkeys.length !== eng2.subkeys.length) {
err = new Error("different # of subkeys");
} else {
_ref5 = this.subkeys;
for (i = _i = 0, _len = _ref5.length; _i < _len; i = ++_i) {
key = _ref5[i];
if (this.err == null) {
if (!key.key.eq(eng2.subkeys[i].key)) {
err = new Error("subkey " + i + " doesn't match");
}
}
}
}
return err;
};
Engine.prototype.merge_private = function(eng2) {
var err, i, k, _i, _len, _ref5;
err = this._merge_private_primary(eng2);
if (err == null) {
_ref5 = eng2.subkeys;
for (i = _i = 0, _len = _ref5.length; _i < _len; i = ++_i) {
k = _ref5[i];
if ((err = this._merge_private_subkey(k, i)) != null) {
break;
}
}
}
return err;
};
Engine.prototype._merge_private_primary = function(eng2) {
var err;
err = !this.key(eng2.primary).has_secret_key_material() ? null : this._merge_1_private(this.primary, eng2.primary) ? null : new Error("primary public key doesn't match private key");
return err;
};
Engine.prototype._merge_private_subkey = function(k2, i) {
var ekid, err, k;
err = !this.key(k2).has_secret_key_material() ? null : (ekid = this.ekid(k2)) == null ? new Error("Subkey " + i + " is malformed") : (k = this._index[ekid]) == null ? new Error("Subkey " + i + " wasn't found in public key") : this._merge_1_private(k, k2) ? null : new Error("subkey " + i + " can't be merged");
return err;
};
Engine.prototype.unlock_keys = function(_arg, cb) {
var asp, esc, i, passphrase, subkey, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, passphrase = _arg.passphrase, tsenc = _arg.tsenc;
esc = make_esc(cb, "Engine::unlock_keys");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "Engine.unlock_keys"
});
_this.key(_this.primary).unlock({
asp: asp,
tsenc: tsenc,
passphrase: passphrase
}, esc(__iced_deferrals.defer({
lineno: 146
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
var _i, _len, _ref5, _results, _while;
_ref5 = _this.subkeys;
_len = _ref5.length;
i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(i < _len)) {
return _break();
} else {
subkey = _ref5[i];
if (_this.key(subkey).has_private()) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "Engine.unlock_keys"
});
_this.key(subkey).unlock({
asp: asp,
tsenc: tsenc,
passphrase: passphrase
}, esc(__iced_deferrals.defer({
lineno: 148
})));
__iced_deferrals._fulfill();
})(_next);
} else {
return _continue();
}
}
};
_while(__iced_k);
})(function() {
return cb(null);
});
};
})(this));
};
Engine.prototype.export_keys_to_keyring = function(km) {
var k, x;
x = (function(_this) {
return function(key_wrapper, is_primary) {
return {
km: km,
is_primary: is_primary,
key_wrapper: key_wrapper,
key_material: _this.key(key_wrapper),
key: _this.key(key_wrapper).key
};
};
})(this);
return [x(this.primary, true)].concat((function() {
var _i, _len, _ref5, _results;
_ref5 = this.subkeys;
_results = [];
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
_results.push(x(k, false));
}
return _results;
}).call(this));
};
Engine.prototype._merge_1_private = function(k1, k2) {
if (bufeq_secure(this.ekid(k1), this.ekid(k2))) {
this.key(k1).merge_private(this.key(k2));
return true;
} else {
return false;
}
};
return Engine;
})();
PgpEngine = (function(_super) {
__extends(PgpEngine, _super);
function PgpEngine(_arg) {
var key_manager, primary, subkeys, userids;
primary = _arg.primary, subkeys = _arg.subkeys, userids = _arg.userids, this.user_attributes = _arg.user_attributes, key_manager = _arg.key_manager;
PgpEngine.__super__.constructor.call(this, {
primary: primary,
subkeys: subkeys,
userids: userids,
key_manager: key_manager
});
}
PgpEngine.prototype.key = function(k) {
return k._pgp;
};
PgpEngine.prototype._v_allocate_key_packet = function(key, opts) {
if (key._pgp == null) {
return key._pgp = new opkts.KeyMaterial({
key: key.key,
timestamp: key.lifespan.generated,
flags: key.flags,
opts: opts
});
}
};
PgpEngine.prototype._v_self_sign_primary = function(_arg, cb) {
var asp, err, raw_payload, sigs, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, raw_payload = _arg.raw_payload;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "PgpEngine._v_self_sign_primary"
});
_this.key(_this.primary).self_sign_key({
lifespan: _this.primary.lifespan,
userids: _this.userids,
raw_payload: raw_payload
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return sigs = arguments[1];
};
})(),
lineno: 198
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, sigs);
};
})(this));
};
PgpEngine.prototype._v_sign_subkey = function(_arg, cb) {
var asp, err, subkey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, subkey = _arg.subkey;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "PgpEngine._v_sign_subkey"
});
_this.key(_this.primary).sign_subkey({
subkey: _this.key(subkey),
lifespan: subkey.lifespan
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 204
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
PgpEngine.prototype.set_passphrase = function(pp) {
var k, _i, _len, _ref5, _results;
this.primary.passphrase = pp;
_ref5 = this.subkeys;
_results = [];
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
_results.push(k.passphrase = pp);
}
return _results;
};
PgpEngine.prototype._export_keys_to_binary = function(opts) {
var packets, subkey, userid, _i, _j, _len, _len1, _ref5, _ref6;
packets = [this.key(this.primary).export_framed(opts)];
_ref5 = this.userids;
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
userid = _ref5[_i];
packets.push(userid.write(), userid.get_framed_signature_output());
}
opts.subkey = true;
_ref6 = this.subkeys;
for (_j = 0, _len1 = _ref6.length; _j < _len1; _j++) {
subkey = _ref6[_j];
packets.push(this.key(subkey).export_framed(opts), this.key(subkey).get_subkey_binding_signature_output());
}
assert_no_nulls(packets);
return Buffer.concat(packets);
};
PgpEngine.prototype.export_keys = function(opts) {
var msg, mt, type;
mt = C.message_types;
type = opts["private"] ? mt.private_key : mt.public_key;
msg = this._export_keys_to_binary(opts);
return encode(type, msg);
};
PgpEngine.prototype.export_to_p3skb = function() {
var priv_clear, pub;
pub = this._export_keys_to_binary({
"private": false
});
priv_clear = this._export_keys_to_binary({
"private": true
});
return new P3SKB({
pub: pub,
priv_clear: priv_clear
});
};
PgpEngine.prototype.find_key = function(key_id) {
var k, _i, _len, _ref5;
_ref5 = this._all_keys();
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
if (bufeq_secure(this.key(k).get_key_id(), key_id)) {
return k;
}
}
return null;
};
PgpEngine.prototype.find_key_material = function(key_id) {
var key;
key = this.find_key(key_id);
if (key != null) {
return this.key(key);
} else {
return null;
}
};
PgpEngine.prototype.get_key_id = function() {
return this.key(this.primary).get_key_id();
};
PgpEngine.prototype.get_short_key_id = function() {
return this.key(this.primary).get_short_key_id();
};
PgpEngine.prototype.get_fingerprint = function() {
return this.key(this.primary).get_fingerprint();
};
PgpEngine.prototype.get_ekid = function() {
return this.key(this.primary).ekid();
};
PgpEngine.prototype.validity_check = function(cb) {
var err, k, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref5, _results, _while;
_ref5 = _this._all_keys();
_len = _ref5.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
k = _ref5[_i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "PgpEngine.validity_check"
});
_this.key(k).validity_check(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 267
}));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (err != null) {
(function(__iced_k) {
_break()
})(__iced_k);
} else {
return __iced_k();
}
})(_next);
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
PgpEngine.prototype.find_best_key = function(flags, need_priv) {
var check, k, wrapper, _i, _len, _ref5;
if (need_priv == null) {
need_priv = false;
}
wrapper = null;
check = (function(_this) {
return function(k) {
var km, ok1, ok2;
km = _this.key(k);
ok1 = km.fulfills_flags(flags) || ((k.flags & flags) === flags);
ok2 = !need_priv || km.has_private();
return ok1 && ok2;
};
})(this);
_ref5 = this.subkeys;
for (_i = 0, _len = _ref5.length; _i < _len; _i++) {
k = _ref5[_i];
if (wrapper == null) {
if (check(k)) {
wrapper = k;
}
}
}
if ((wrapper == null) && check(this.primary)) {
wrapper = this.primary;
}
return (wrapper != null ? this.key(wrapper) : null);
};
PgpEngine.prototype.fetch = function(key_ids, op_mask, cb) {
var err, flags, i, key, kid, ret, ret_i, _i, _len;
flags = ops_to_keyflags(op_mask);
err = key = ret = null;
key = null;
ret_i = null;
for (i = _i = 0, _len = key_ids.length; _i < _len; i = ++_i) {
kid = key_ids[i];
if (!(key == null)) {
continue;
}
key = this.find_key(kid);
if (key != null) {
ret_i = i;
}
}
if (key == null) {
err = new Error("No keys match the given fingerprint");
} else if (!this.key(key).fulfills_flags(flags)) {
err = new Error("We don't have a key for the requested PGP ops");
} else {
ret = this.key(key);
}
return cb(err, this.key_manager, ret_i);
};
return PgpEngine;
})(Engine);
KeyManager = (function(_super) {
__extends(KeyManager, _super);
function KeyManager(_arg) {
this.primary = _arg.primary, this.subkeys = _arg.subkeys, this.userids = _arg.userids, this.armored_pgp_public = _arg.armored_pgp_public, this.armored_pgp_private = _arg.armored_pgp_private, this.user_attributes = _arg.user_attributes;
this.pgp = new PgpEngine({
primary: this.primary,
subkeys: this.subkeys,
userids: this.userids,
user_attributes: this.user_attributes,
key_manager: this
});
this.engines = [this.pgp];
this._signed = false;
this.p3skb = null;
}
KeyManager.generate = function(_arg, cb) {
var F, KEY_FLAGS_PRIMARY, KEY_FLAGS_STD, asp, bundle, ecc, err, esc, expire_in, flags, gen, generated, i, nbits, nsubs, primary, primary_flags, s, sub_flags, subkey, subkeys, subkeys_out, u, userid, userids, ___iced_passed_deferral, __iced_deferrals, __iced_k, _i, _len;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, userid = _arg.userid, userids = _arg.userids, primary = _arg.primary, subkeys = _arg.subkeys, ecc = _arg.ecc, sub_flags = _arg.sub_flags, nsubs = _arg.nsubs, primary_flags = _arg.primary_flags, nbits = _arg.nbits, expire_in = _arg.expire_in;
asp = ASP.make(asp);
F = C.key_flags;
KEY_FLAGS_STD = F.sign_data | F.encrypt_comm | F.encrypt_storage | F.auth;
KEY_FLAGS_PRIMARY = KEY_FLAGS_STD | F.certify_keys;
primary || (primary = {});
primary.flags || (primary.flags = primary_flags || KEY_FLAGS_PRIMARY);
primary.expire_in || (primary.expire_in = (expire_in != null ? expire_in.primary : void 0) || K.key_defaults.primary.expire_in);
primary.algo || (primary.algo = (ecc ? ECDSA : RSA));
primary.nbits || (primary.nbits = nbits || K.key_defaults.primary.nbits[primary.algo.klass_name]);
if ((nsubs != null) && (sub_flags == null)) {
sub_flags = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= nsubs ? _i < nsubs : _i > nsubs; i = 0 <= nsubs ? ++_i : --_i) {
_results.push(KEY_FLAGS_STD);
}
return _results;
})();
}
subkeys || (subkeys = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = sub_flags.length; _i < _len; _i++) {
flags = sub_flags[_i];
_results.push({
flags: flags
});
}
return _results;
})());
for (_i = 0, _len = subkeys.length; _i < _len; _i++) {
subkey = subkeys[_i];
subkey.expire_in || (subkey.expire_in = (expire_in != null ? expire_in.subkey : void 0) || K.key_defaults.sub.expire_in);
subkey.flags || (subkey.flags = KEY_FLAGS_STD);
subkey.algo || (subkey.algo = primary.algo.subkey_algo(subkey.flags));
subkey.nbits || (subkey.nbits = nbits || K.key_defaults.sub.nbits[subkey.algo.klass_name]);
}
generated = unix_time();
esc = make_esc(cb, "KeyManager::generate");
if (userid != null) {
userids = [userid];
}
(function(_this) {
return (function(__iced_k) {
if ((userids != null) && Array.isArray(userids)) {
return __iced_k(userids = (function() {
var _j, _len1, _results;
_results = [];
for (_j = 0, _len1 = userids.length; _j < _len1; _j++) {
u = userids[_j];
_results.push(new opkts.UserID(u));
}
return _results;
})());
} else {
err = new Error("Need either 'userid' or 'userids' specified as an array");
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.generate"
});
athrow(err, esc(__iced_deferrals.defer({
lineno: 391
})));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
gen = function(_arg1, cb) {
var err, key, klass, lifespan, params, primary, section, wrapper, ___iced_passed_deferral1, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral1 = iced.findDeferral(arguments);
klass = _arg1.klass, section = _arg1.section, params = _arg1.params, primary = _arg1.primary;
asp.section(section);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral1,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced"
});
params.algo.generate({
asp: asp,
nbits: params.nbits
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return key = arguments[1];
};
})(),
lineno: 395
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
lifespan = new Lifespan({
generated: generated,
expire_in: params.expire_in
});
wrapper = new klass({
key: key,
lifespan: lifespan,
flags: params.flags,
primary: primary
});
}
return cb(err, wrapper);
};
})(this));
};
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.generate"
});
gen({
klass: Primary,
section: "primary",
params: primary
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return primary = arguments[0];
};
})(),
lineno: 401
})));
__iced_deferrals._fulfill();
})(function() {
subkeys_out = [];
(function(__iced_k) {
var _j, _len1, _ref5, _results, _while;
_ref5 = subkeys;
_len1 = _ref5.length;
i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(i < _len1)) {
return _break();
} else {
subkey = _ref5[i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.generate"
});
gen({
klass: Subkey,
section: "subkey " + (i + 1),
params: subkey,
primary: primary
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return s = arguments[0];
};
})(),
lineno: 404
})));
__iced_deferrals._fulfill();
})(function() {
return _next(subkeys_out.push(s));
});
}
};
_while(__iced_k);
})(function() {
bundle = new KeyManager({
primary: primary,
subkeys: subkeys_out,
userids: userids
});
return cb(null, bundle);
});
});
};
})(this));
};
KeyManager.generate_rsa = function(_arg, cb) {
var F, asp, primary, subkeys, userid, userids;
asp = _arg.asp, userid = _arg.userid, userids = _arg.userids;
F = C.key_flags;
primary = {
flags: F.certify_keys,
nbits: 4096
};
subkeys = [
{
flags: F.encrypt_data | F.encrypt_comm,
nbits: 2048
}, {
flags: F.sign_data | F.auth,
nbits: 2048
}
];
return KeyManager.generate({
asp: asp,
userid: userid,
userids: userids,
primary: primary,
subkeys: subkeys
}, cb);
};
KeyManager.generate_ecc = function(_arg, cb) {
var F, asp, primary, subkeys, userid, userids;
asp = _arg.asp, userid = _arg.userid, userids = _arg.userids;
F = C.key_flags;
primary = {
flags: F.certify_keys,
nbits: 384,
algo: ECDSA
};
subkeys = [
{
flags: F.encrypt_data | F.encrypt_comm,
nbits: 256
}, {
flags: F.sign_data | F.auth,
nbits: 256
}
];
return KeyManager.generate({
asp: asp,
userid: userid,
userids: userids,
primary: primary,
subkeys: subkeys
}, cb);
};
KeyManager.prototype.set_enc = function(e) {
return this.tsenc = e;
};
KeyManager.import_from_armored_pgp = function(_arg, cb) {
var armored, asp, binary, err, msg, opts, raw, ret, warnings, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref5, _ref6;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
armored = _arg.armored, raw = _arg.raw, binary = _arg.binary, asp = _arg.asp, opts = _arg.opts;
msg = binary;
err = null;
if (msg == null) {
raw || (raw = armored);
asp = ASP.make(asp);
warnings = null;
ret = null;
_ref5 = decode(raw), err = _ref5[0], msg = _ref5[1];
if (err == null) {
if (!((_ref6 = msg.type) === C.message_types.public_key || _ref6 === C.message_types.private_key)) {
err = new Error("Wanted a public or private key; got: " + msg.type);
}
}
}
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.import_from_armored_pgp"
});
KeyManager.import_from_pgp_message({
msg: msg,
asp: asp,
opts: opts
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
ret = arguments[1];
return warnings = arguments[2];
};
})(),
lineno: 482
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (!(err != null)) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.import_from_armored_pgp"
});
ret.simple_unlock({}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 488
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err, ret, warnings);
});
};
})(this));
};
KeyManager.prototype.simple_unlock = function(opts, cb) {
var err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
(function(_this) {
return (function(__iced_k) {
if (_this.has_pgp_private() && !_this.is_pgp_locked()) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.simple_unlock"
});
_this.unlock_pgp({}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 500
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
KeyManager.import_from_p3skb = function(_arg, cb) {
var armored, asp, err, km, msg, p3skb, raw, warnings, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref5;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
raw = _arg.raw, armored = _arg.armored, asp = _arg.asp;
armored || (armored = raw);
asp = ASP.make(asp);
km = null;
warnings = null;
_ref5 = katch(function() {
return P3SKB.alloc(unseal(read_base64(armored)));
}), err = _ref5[0], p3skb = _ref5[1];
(function(_this) {
return (function(__iced_k) {
if (err == null) {
msg = new Message({
body: p3skb.pub,
type: C.message_types.public_key
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.import_from_p3skb"
});
KeyManager.import_from_pgp_message({
msg: msg,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
km = arguments[1];
return warnings = arguments[2];
};
})(),
lineno: 515
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(km != null ? km.p3skb = p3skb : void 0);
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err, km, warnings);
};
})(this));
};
KeyManager.prototype.unlock_p3skb = function(_arg, cb) {
var asp, err, km, msg, passphrase, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, tsenc = _arg.tsenc, passphrase = _arg.passphrase;
asp = ASP.make(asp);
if ((tsenc == null) && (passphrase != null)) {
tsenc = new Encryptor({
key: bufferify(passphrase)
});
}
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.unlock_p3skb"
});
_this.p3skb.unlock({
tsenc: tsenc,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 525
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
msg = new Message({
body: _this.p3skb.priv.data,
type: C.message_types.private_key
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.unlock_p3skb"
});
KeyManager.import_from_pgp_message({
msg: msg,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return km = arguments[1];
};
})(),
lineno: 528
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
if (typeof err === "undefined" || err === null) {
err = _this.pgp.merge_private(km.pgp);
}
(function(__iced_k) {
if (err == null) {
passphrase = new Buffer([]);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.unlock_p3skb"
});
_this.unlock_pgp({
passphrase: passphrase
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 537
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err);
});
});
};
})(this));
};
KeyManager.import_from_pgp_message = function(_arg, cb) {
var asp, bundle, err, k, kb, msg, opts, packets, warnings, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref5;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
msg = _arg.msg, asp = _arg.asp, opts = _arg.opts;
asp = ASP.make(asp);
bundle = null;
warnings = null;
if (typeof err === "undefined" || err === null) {
_ref5 = parse(msg.body), err = _ref5[0], packets = _ref5[1];
}
(function(_this) {
return (function(__iced_k) {
if (err == null) {
kb = new KeyBlock(packets, opts);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.import_from_pgp_message"
});
kb.process(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 552
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(warnings = kb.warnings);
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
if (err == null) {
bundle = new KeyManager({
primary: KeyManager._wrap_pgp(Primary, kb.primary),
subkeys: (function() {
var _i, _len, _ref6, _results;
_ref6 = kb.subkeys;
_results = [];
for (_i = 0, _len = _ref6.length; _i < _len; _i++) {
k = _ref6[_i];
_results.push(KeyManager._wrap_pgp(Subkey, k));
}
return _results;
})(),
armored_pgp_public: msg.raw(),
user_attributes: kb.user_attributes,
userids: kb.userids
});
}
(function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.import_from_pgp_message"
});
bundle.check_pgp_validity(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 562
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err, bundle, warnings);
});
};
})(this));
};
KeyManager.prototype.merge_pgp_private = function(_arg, cb) {
var armored, asp, b2, err, esc, raw, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
armored = _arg.armored, raw = _arg.raw, asp = _arg.asp;
asp = ASP.make(asp);
esc = make_esc(cb, "merge_pgp_private");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.merge_pgp_private"
});
KeyManager.import_from_armored_pgp({
armored: armored,
raw: raw,
asp: asp
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return b2 = arguments[0];
};
})(),
lineno: 573
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
err = _this.pgp.merge_private(b2.pgp);
(function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.merge_pgp_private"
});
_this.simple_unlock({}, esc(__iced_deferrals.defer({
lineno: 575
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err);
});
};
})(this));
};
KeyManager.prototype.check_pgp_public_eq = function(km2) {
return this.pgp.check_eq(km2.pgp);
};
KeyManager.prototype.unlock_pgp = function(_arg, cb) {
var err, passphrase, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
passphrase = _arg.passphrase;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.unlock_pgp"
});
_this.pgp.unlock_keys({
passphrase: passphrase
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 588
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
KeyManager.prototype.is_pgp_locked = function() {
return this.pgp.is_locked();
};
KeyManager.prototype.is_keybase_locked = function() {
return this.keybase.is_locked();
};
KeyManager.prototype.has_pgp_private = function() {
return this.pgp.has_private();
};
KeyManager.prototype.has_p3skb_private = function() {
var _ref5;
return (_ref5 = this.p3skb) != null ? _ref5.has_private() : void 0;
};
KeyManager.prototype.has_keybase_private = function() {
return this.keybase.has_private();
};
KeyManager.prototype.is_p3skb_locked = function() {
var _ref5;
return (_ref5 = this.p3skb) != null ? _ref5.is_locked() : void 0;
};
KeyManager.prototype.unlock_keybase = function(_arg, cb) {
var asp, err, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
tsenc = _arg.tsenc, asp = _arg.asp;
asp = ASP.make(asp);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.unlock_keybase"
});
_this.keybase.unlock_keys({
tsenc: tsenc,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 606
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
KeyManager.prototype.export_private_to_server = function(_arg, cb) {
var asp, err, p3skb, ret, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
tsenc = _arg.tsenc, asp = _arg.asp;
asp = ASP.make(asp);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
if ((err = _this._assert_signed()) == null) {
p3skb = _this.pgp.export_to_p3skb();
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.export_private_to_server"
});
p3skb.lock({
tsenc: tsenc,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 619
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
if (err == null) {
ret = p3skb.frame_packet_armored({
dohash: true
});
}
return cb(err, ret);
};
})(this));
};
KeyManager.prototype.export_pgp_private_to_client = function(_arg, cb) {
var asp, err, msg, passphrase, regen;
passphrase = _arg.passphrase, asp = _arg.asp, regen = _arg.regen;
asp = ASP.make(asp);
err = msg = null;
if (passphrase != null) {
passphrase = bufferify(passphrase);
}
if (!regen && (msg = this.armored_pgp_private)) {
} else if ((err = this._assert_signed()) == null) {
msg = this.pgp.export_keys({
"private": true,
passphrase: passphrase
});
}
return cb(err, msg);
};
KeyManager.prototype.export_pgp_private = function() {
var args;
args = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
return this.export_pgp_private_to_client.apply(this, args);
};
KeyManager.prototype.export_pgp_public = function(_arg, cb) {
var asp, err, msg, regen;
asp = _arg.asp, regen = _arg.regen;
asp = ASP.make(asp);
err = null;
if ((err = this._assert_signed()) == null) {
if (!regen) {
msg = this.armored_pgp_public;
}
if (msg == null) {
msg = this.pgp.export_keys({
"private": false
});
}
}
return cb(err, msg);
};
KeyManager.prototype.export_public = function(_arg, cb) {
var asp, err, msg, regen, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp, regen = _arg.regen;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.export_public"
});
_this.export_pgp_public({
asp: asp,
regen: regen
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return msg = arguments[1];
};
})(),
lineno: 654
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, msg);
};
})(this));
};
KeyManager.prototype.export_private = function(_arg, cb) {
var asp, err, p3skb, passphrase, res, tsenc, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
passphrase = _arg.passphrase, p3skb = _arg.p3skb, asp = _arg.asp;
(function(_this) {
return (function(__iced_k) {
if (p3skb) {
tsenc = new Encryptor({
key: bufferify(passphrase)
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.export_private"
});
_this.export_private_to_server({
tsenc: tsenc,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return res = arguments[1];
};
})(),
lineno: 662
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.export_private"
});
_this.export_pgp_private_to_client({
passphrase: passphrase,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return res = arguments[1];
};
})(),
lineno: 664
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err, res);
};
})(this));
};
KeyManager.prototype.sign_pgp = function(_arg, cb) {
var asp;
asp = _arg.asp;
return this.pgp.sign({
asp: asp
}, cb);
};
KeyManager.prototype.sign = function(_arg, cb) {
var asp, err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
asp = _arg.asp;
asp = ASP.make(asp);
asp.section("sign");
asp.progress({
what: "sign PGP",
total: 1,
i: 0
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager.sign"
});
_this.sign_pgp({
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 677
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
asp.progress({
what: "sign PGP",
total: 1,
i: 1
});
if (typeof err === "undefined" || err === null) {
_this._signed = true;
}
return cb(err);
};
})(this));
};
KeyManager.prototype.get_userids = function() {
return this.userids;
};
KeyManager.prototype.get_userids_mark_primary = function() {
var do_insert, i, k, max, max_s, mymax, obj, pair, prev, primary_time, ret, s, tab, userid, _i, _len, _ref5;
max = null;
max_s = null;
tab = {};
mymax = function(a, b) {
if ((a == null) && (b == null)) {
return null;
} else if (a == null) {
return b;
} else if (b == null) {
return a;
} else if (a > b) {
return a;
} else {
return b;
}
};
_ref5 = this.userids;
for (i = _i = 0, _len = _ref5.length; _i < _len; i = ++_i) {
userid = _ref5[i];
if (!(userid != null)) {
continue;
}
s = userid.utf8();
pair = userid.time_primary_pair();
obj = {
userid: userid,
pair: pair,
i: i
};
do_insert = false;
if ((prev = tab[s]) != null) {
primary_time = mymax(prev.pair[1], pair[1]);
if (!(prev.pair[0] != null) || (pair[0] && prev.pair[0] < pair[0])) {
do_insert = true;
}
} else {
primary_time = pair[1];
do_insert = true;
}
if (do_insert) {
tab[s] = obj;
}
if ((primary_time != null) && ((max == null) || max < primary_time)) {
max_s = s;
max = primary_time;
}
}
if (max_s != null) {
tab[max_s].userid.primary = true;
}
ret = [];
for (k in tab) {
obj = tab[k];
obj.userid.most_recent_sig = obj.pair[0];
ret.push(obj.userid);
}
return ret;
};
KeyManager.prototype.fetch = function(key_ids, flags, cb) {
return this.pgp.fetch(key_ids, flags, cb);
};
KeyManager.prototype.find_pgp_key = function(key_id) {
return this.pgp.find_key(key_id);
};
KeyManager.prototype.find_pgp_key_material = function(key_id) {
return this.pgp.find_key_material(key_id);
};
KeyManager.prototype.find_best_pgp_key = function(flags, need_priv) {
return this.pgp.find_best_key(flags, need_priv);
};
KeyManager.prototype.find_signing_pgp_key = function() {
return this.find_best_pgp_key(C.key_flags.sign_data, true);
};
KeyManager.prototype.find_verifying_pgp_key = function() {
return this.find_best_pgp_key(C.key_flags.sign_data, false);
};
KeyManager.prototype.find_crypt_pgp_key = function(need_priv) {
if (need_priv == null) {
need_priv = false;
}
return this.find_best_pgp_key(C.key_flags.encrypt_comm, need_priv);
};
KeyManager.prototype.can_verify = function() {
return this.find_verifying_pgp_key() != null;
};
KeyManager.prototype.get_primary_keypair = function() {
return this.primary.key;
};
KeyManager.prototype.get_all_pgp_key_materials = function() {
return this.pgp.get_all_key_materials();
};
KeyManager.prototype.export_pgp_keys_to_keyring = function() {
return this.pgp.export_keys_to_keyring(this);
};
KeyManager.prototype.get_pgp_key_id = function() {
return this.pgp.get_key_id();
};
KeyManager.prototype.get_pgp_short_key_id = function() {
return this.pgp.get_short_key_id();
};
KeyManager.prototype.get_pgp_fingerprint = function() {
return this.pgp.get_fingerprint();
};
KeyManager.prototype.get_pgp_fingerprint_str = function() {
var _ref5;
return (_ref5 = this.get_pgp_fingerprint()) != null ? _ref5.toString('hex') : void 0;
};
KeyManager.prototype.get_ekid = function() {
return this.pgp.get_ekid();
};
KeyManager.prototype.get_ekid_b64_str = function() {
var k;
if ((k = this.get_ekid()) != null) {
return base64u.encode(k);
} else {
return null;
}
};
KeyManager.prototype.get_fp2 = function() {
return this.get_pgp_fingerprint();
};
KeyManager.prototype.get_fp2_formatted = function(opts) {
var p;
if ((p = this.get_fp2()) != null) {
return format_pgp_fingerprint_2(p, opts);
} else {
return null;
}
};
KeyManager.prototype.get_type = function() {
return "pgp";
};
KeyManager.prototype.check_pgp_validity = function(cb) {
return this.pgp.validity_check(cb);
};
KeyManager.prototype.make_sig_eng = function() {
return new SignatureEngine({
km: this
});
};
KeyManager.prototype._apply_to_engines = function(_arg, cb) {
var args, e, err, meth, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
args = _arg.args, meth = _arg.meth;
err = null;
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref5, _results, _while;
_ref5 = _this.engines;
_len = _ref5.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
e = _ref5[_i];
if (!err) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/keymanager.iced",
funcname: "KeyManager._apply_to_engines"
});
meth.call(e, args, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 803
}));
__iced_deferrals._fulfill();
})(_next);
} else {
return _continue();
}
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
KeyManager.prototype._assert_signed = function() {
if (this._signed) {
return null;
} else {
return new Error("need to sign before export");
}
};
KeyManager._wrap_pgp = function(klass, kmp) {
return new klass({
key: kmp.key,
lifespan: new Lifespan({
generated: kmp.timestamp
}),
_pgp: kmp
});
};
return KeyManager;
})(KeyManagerInterface);
exports.KeyManager = KeyManager;
exports.opkts = opkts;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../ecc/ecdsa":10,"../keybase/encode":16,"../keybase/packet/p3skb":21,"../keyfetch":24,"../keywrapper":26,"../kmi":27,"../rsa":67,"../util":70,"./armor":33,"./packet/all":44,"./parser":56,"./processor":57,"./sigeng":59,"./util":60,"buffer":80,"iced-error":115,"iced-runtime":118,"triplesec":181}],43:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var AES, ASP, Base, Decryptor, Encryptor, SlicerBuffer, WordArray, decrypt, encrypt, iced, make_esc, repeat, rng, test, triplesec, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
WordArray = require('triplesec').WordArray;
SlicerBuffer = require('./buffer').SlicerBuffer;
triplesec = require('triplesec');
AES = triplesec.ciphers.AES;
ASP = require('pgp-utils').util.ASP;
make_esc = require('iced-error').make_esc;
repeat = function(b, n) {
return Buffer.concat([b, b.slice(b.length - n)]);
};
Base = (function() {
function Base(_arg) {
var asp, key;
this.block_cipher_class = _arg.block_cipher_class, key = _arg.key, this.cipher = _arg.cipher, this.resync = _arg.resync, asp = _arg.asp;
this.block_cipher_class || (this.block_cipher_class = AES);
this.cipher || (this.cipher = new this.block_cipher_class(WordArray.from_buffer(key)));
this.block_size = this.cipher.blockSize;
this.out_bufs = [];
this.asp = ASP.make(asp);
}
Base.prototype.compact = function() {
var b;
b = Buffer.concat(this.out_bufs);
this.out_bufs = [b];
return b;
};
return Base;
})();
Encryptor = (function(_super) {
__extends(Encryptor, _super);
function Encryptor(_arg) {
var asp, block_cipher_class, cipher, key, prefixrandom, resync;
block_cipher_class = _arg.block_cipher_class, key = _arg.key, cipher = _arg.cipher, prefixrandom = _arg.prefixrandom, resync = _arg.resync, asp = _arg.asp;
Encryptor.__super__.constructor.call(this, {
block_cipher_class: block_cipher_class,
key: key,
cipher: cipher,
resync: resync,
asp: asp
});
this._init(prefixrandom);
}
Encryptor.prototype._enc = function() {
this.FRE = WordArray.from_buffer(this.FR);
return this.cipher.encryptBlock(this.FRE.words, 0);
};
Encryptor.prototype._emit_sb = function(sb) {
var buf, deficit, i, pad;
buf = (deficit = this.block_size - sb.rem()) > 0 ? (pad = new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= deficit ? _i < deficit : _i > deficit; i = 0 <= deficit ? ++_i : --_i) {
_results.push(0);
}
return _results;
})()), Buffer.concat([sb.consume_rest_to_buffer(), pad])) : sb.read_buffer(this.block_size);
return this._emit_buf(buf);
};
Encryptor.prototype._emit_buf = function(buf) {
var wa;
wa = WordArray.from_buffer(buf.slice(0, this.block_size));
wa.xor(this.FRE, {
n_words: Math.min(wa.words.length, this.FRE.words.length)
});
buf = wa.to_buffer();
this.out_bufs.push(buf);
return this.FR = new Buffer(buf);
};
Encryptor.prototype._init = function(prefixrandom) {
var b, canary, ct, i, offset;
this.FR = new Buffer((function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = this.block_size; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
_results.push(0);
}
return _results;
}).call(this));
prefixrandom = repeat(prefixrandom, 2);
this._enc();
this._emit_buf(prefixrandom);
this._enc();
b = this.FRE.to_buffer();
canary = new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 2; i = ++_i) {
_results.push(b.readUInt8(i) ^ prefixrandom.readUInt8(this.block_size + i));
}
return _results;
}).call(this));
this.out_bufs.push(canary);
offset = this.resync ? 2 : 0;
ct = this.compact();
ct.copy(this.FR, 0, offset, offset + this.block_size);
return this._enc();
};
Encryptor.prototype.enc = function(plaintext, cb) {
var buf, ct, esc, j, n_wanted, ret, sb, total, wa, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sb = new SlicerBuffer(plaintext);
esc = make_esc(cb, "Encryptor::enc");
if (this.resync) {
this._emit_sb(sb);
} else {
buf = Buffer.concat([new Buffer([0, 0]), sb.read_buffer(this.block_size - 2)]);
wa = WordArray.from_buffer(buf);
wa.xor(this.FRE, {});
buf = wa.to_buffer().slice(2);
this.out_bufs.push(buf);
ct = this.compact();
ct.copy(this.FR, 0, ct.length - this.block_size, ct.length);
}
total = sb.rem();
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/ocfb.iced",
funcname: "Encryptor.enc"
});
_this.asp.progress({
what: "ofcb encryption",
i: 0,
total: total
}, esc(__iced_deferrals.defer({
lineno: 168
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _i, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(j = sb.rem())) {
return _break();
} else {
for (_i = 0; _i < 4096; _i++) {
_this._enc();
_this._emit_sb(sb);
if (!(j = sb.rem())) {
break;
}
}
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/ocfb.iced",
funcname: "Encryptor.enc"
});
_this.asp.progress({
what: "ofcb encryption",
i: total - j,
total: total
}, esc(__iced_deferrals.defer({
lineno: 177
})));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
})(function() {
ret = _this.compact();
n_wanted = plaintext.length + _this.block_size + 2;
ret = ret.slice(0, n_wanted);
return cb(null, ret);
});
};
})(this));
};
return Encryptor;
})(Base);
Decryptor = (function(_super) {
__extends(Decryptor, _super);
function Decryptor(_arg) {
var asp, block_cipher_class, cipher, key, prefixrandom, resync;
block_cipher_class = _arg.block_cipher_class, key = _arg.key, cipher = _arg.cipher, prefixrandom = _arg.prefixrandom, resync = _arg.resync, this.ciphertext = _arg.ciphertext, asp = _arg.asp;
Decryptor.__super__.constructor.call(this, {
block_cipher_class: block_cipher_class,
key: key,
cipher: cipher,
resync: resync,
asp: asp
});
this._init();
}
Decryptor.prototype._init = function() {
return this.reset();
};
Decryptor.prototype.reset = function() {
return this.sb = new SlicerBuffer(this.ciphertext);
};
Decryptor.prototype.next_block = function() {
return WordArray.from_buffer(this.sb.read_buffer_at_most(this.block_size));
};
Decryptor.prototype.get_prefix = function() {
return this._prefix;
};
Decryptor.prototype.check = function(cb) {
var ablock, err, i, iblock, lhs, rhs;
this.reset();
iblock = new WordArray((function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = this.block_size / 4; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
_results.push(0);
}
return _results;
}).call(this));
this.cipher.encryptBlock(iblock.words, 0);
ablock = this.next_block();
iblock.xor(ablock, {});
this._prefix = iblock.to_buffer();
this.cipher.encryptBlock(ablock.words, 0);
lhs = iblock.words.slice(-1)[0] & 0xffff;
rhs = (ablock.words[0] >>> 16) ^ (this.sb.peek_uint16());
err = lhs === rhs ? null : new Error("Canary block mismatch: " + lhs + " != " + rhs);
return cb(err);
};
Decryptor.prototype.dec = function(cb) {
var ablock, esc, iblock, j, out, total, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
this.reset();
if (this.resync) {
this.sb.advance(2);
}
iblock = this.next_block();
esc = make_esc(cb, "Decryption::dec");
total = this.sb.rem();
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/ocfb.iced",
funcname: "Decryptor.dec"
});
_this.asp.progress({
what: "ofcb decrypt",
i: 0,
total: total
}, esc(__iced_deferrals.defer({
lineno: 239
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _i, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(j = _this.sb.rem())) {
return _break();
} else {
for (_i = 0; _i < 4096; _i++) {
ablock = iblock;
_this.cipher.encryptBlock(ablock.words, 0);
iblock = _this.next_block();
ablock.xor(iblock, {});
_this.out_bufs.push(ablock.to_buffer().slice(0, iblock.sigBytes));
if (!(j = _this.sb.rem())) {
break;
}
}
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/ocfb.iced",
funcname: "Decryptor.dec"
});
_this.asp.progress({
what: "ofcb decrypt",
i: total - j,
total: total
}, esc(__iced_deferrals.defer({
lineno: 251
})));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
})(function() {
out = _this.compact();
if (!_this.resync) {
out = out.slice(2);
}
return cb(null, out);
});
};
})(this));
};
return Decryptor;
})(Base);
encrypt = function(_arg, cb) {
var asp, block_cipher_class, cipher, eng, key, plaintext, prefixrandom, resync;
block_cipher_class = _arg.block_cipher_class, key = _arg.key, cipher = _arg.cipher, prefixrandom = _arg.prefixrandom, resync = _arg.resync, plaintext = _arg.plaintext, asp = _arg.asp;
eng = new Encryptor({
block_cipher_class: block_cipher_class,
key: key,
cipher: cipher,
prefixrandom: prefixrandom,
resync: resync,
asp: asp
});
return eng.enc(plaintext, cb);
};
decrypt = function(_arg, cb) {
var asp, block_cipher_class, cipher, ciphertext, eng, err, key, pt, resync, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
block_cipher_class = _arg.block_cipher_class, key = _arg.key, cipher = _arg.cipher, resync = _arg.resync, ciphertext = _arg.ciphertext, asp = _arg.asp;
eng = new Decryptor({
block_cipher_class: block_cipher_class,
key: key,
cipher: cipher,
resync: resync,
ciphertext: ciphertext,
asp: asp
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/ocfb.iced"
});
eng.check(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 267
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (typeof err === "undefined" || err === null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/ocfb.iced"
});
eng.dec(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return pt = arguments[1];
};
})(),
lineno: 268
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err, pt);
});
};
})(this));
};
exports.encrypt = encrypt;
exports.decrypt = decrypt;
exports.Decryptor = Decryptor;
rng = require('crypto').rng;
test = function() {
var block_cipher_class, ct, key, plaintext, prefixrandom, pt;
plaintext = new Buffer("a man a plan a canal panama. and you know the rest");
key = rng(32);
prefixrandom = new Buffer([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]);
block_cipher_class = AES;
ct = encrypt({
block_cipher_class: block_cipher_class,
key: key,
prefixrandom: prefixrandom,
plaintext: plaintext
});
console.log(ct.toString('hex'));
pt = decrypt({
block_cipher_class: block_cipher_class,
key: key,
prefixrandom: prefixrandom,
ciphertext: ct
});
return console.log(pt.toString('utf8'));
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./buffer":35,"buffer":80,"crypto":86,"iced-error":115,"iced-runtime":118,"pgp-utils":163,"triplesec":181}],44:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
exports.KeyMaterial = require('./keymaterial').KeyMaterial;
exports.Signature = require('./signature').Signature;
exports.UserID = require('./userid').UserID;
}).call(this);
},{"./keymaterial":48,"./signature":53,"./userid":55}],45:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Packet, packetsigs, util;
util = require('../util');
C = require('../../const').openpgp;
packetsigs = require('./packetsigs');
Packet = (function() {
function Packet() {
this._psc = new packetsigs.Collection();
}
Packet.prototype.frame_packet = function(tag, body) {
var bufs;
bufs = [new Buffer([0xc0 | tag]), util.encode_length(body.length), body];
return Buffer.concat(bufs);
};
Packet.prototype.set = function(d) {
var k, v, _results;
_results = [];
for (k in d) {
v = d[k];
_results.push(this[k] = v);
}
return _results;
};
Packet.prototype.is_signature = function() {
return false;
};
Packet.prototype.is_key_material = function() {
return false;
};
Packet.prototype.is_duplicate_primary = function() {
return false;
};
Packet.prototype.to_userid = function() {
return null;
};
Packet.prototype.to_user_attribute = function() {
return null;
};
Packet.prototype.to_literal = function() {
return null;
};
Packet.prototype.to_esk_packet = function() {
return null;
};
Packet.prototype.to_enc_data_packet = function() {
return null;
};
Packet.prototype.replay = function() {
return this.frame_packet(this.tag, this.raw);
};
Packet.prototype.inflate = function(cb) {
return cb(null, null);
};
Packet.prototype.push_sig = function(packetsig) {
return this._psc.push(packetsig);
};
Packet.prototype.get_psc = function() {
return this._psc;
};
Packet.prototype.get_data_signer = function() {
return this.get_psc().get_data_signer();
};
Packet.prototype.get_data_signers = function() {
return this.get_psc().get_data_signers();
};
Packet.prototype.get_signed_userids = function() {
return [];
};
Packet.prototype.get_subkey_binding = function() {
return null;
};
Packet.prototype.is_self_signed = function() {
return false;
};
return Packet;
})();
exports.Packet = Packet;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../const":5,"../util":60,"./packetsigs":51,"buffer":80}],46:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Compressed, CompressionParser, Packet, asymmetric, bzip_inflate, compressjs, fake_zip_inflate, fix_zip_deflate, iced, uint_to_buffer, zlib, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
Packet = require('./base').Packet;
C = require('../../const').openpgp;
asymmetric = require('../../asymmetric');
zlib = require('zlib');
uint_to_buffer = require('../../util').uint_to_buffer;
compressjs = require('keybase-compressjs');
fake_zip_inflate = function(buf, cb) {
var bufs, call_end, err, inflater, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
buf = Buffer.concat([new Buffer([0x78, 0x9c]), buf]);
inflater = zlib.createInflate({
flush: zlib.Z_FULL_FLUSH
});
bufs = [];
call_end = function(err) {
var ret, tmp;
if ((tmp = cb) != null) {
if ((err != null) && err.code === "Z_BUF_ERROR") {
err = null;
}
cb = null;
if (err != null) {
ret = null;
} else {
ret = Buffer.concat(bufs);
}
return tmp(err, ret);
}
};
inflater.on('readable', function() {
var read_buf;
read_buf = inflater.read();
if (read_buf != null) {
return bufs.push(read_buf);
}
});
inflater.on('end', function() {
return call_end(null);
});
inflater.on('error', function(e) {
return call_end(e);
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced"
});
inflater.write(buf, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 53
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (typeof err === "undefined" || err === null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced"
});
inflater.end(err);
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
if (typeof err !== "undefined" && err !== null) {
return call_end(err);
}
});
};
})(this));
};
fix_zip_deflate = function(buf, cb) {
var err, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced"
});
zlib.deflate(buf, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 62
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
bzip_inflate = function(buf, cb) {
var e, err, ret;
err = null;
try {
ret = compressjs.Bzip2.decompressFile(buf);
if (ret != null) {
ret = new Buffer(ret);
}
} catch (_error) {
e = _error;
err = e;
}
return cb(err, ret);
};
Compressed = (function(_super) {
__extends(Compressed, _super);
function Compressed(_arg) {
this.algo = _arg.algo, this.compressed = _arg.compressed, this.inflated = _arg.inflated;
}
Compressed.parse = function(slice) {
return (new CompressionParser(slice)).parse();
};
Compressed.prototype.inflate = function(cb) {
var err, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
switch (_this.algo) {
case C.compression.none:
return __iced_k(ret = _this.compressed);
case C.compression.zlib:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.inflate"
});
zlib.inflate(_this.compressed, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 96
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
case C.compression.zip:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.inflate"
});
fake_zip_inflate(_this.compressed, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 98
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
case C.compression.bzip:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.inflate"
});
bzip_inflate(_this.compressed, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 100
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
default:
return __iced_k(err = new Error("no known inflation -- algo: " + _this.algo));
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
Compressed.prototype.deflate = function(cb) {
var err, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
switch (_this.algo) {
case C.compression.none:
return __iced_k(ret = _this.inflated);
case C.compression.zlib:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.deflate"
});
zlib.deflate(_this.inflated, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 112
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
case C.compression.zip:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.deflate"
});
fake_zip_deflate(_this.inflated, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 114
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
default:
return __iced_k(err = new Error("no known deflation -- algo: " + _this.algo));
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
Compressed.prototype.write_unframed = function(cb) {
var bufs, err, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.write_unframed"
});
_this.deflate(__iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
err = arguments[0];
return __slot_1.compressed = arguments[1];
};
})(_this),
lineno: 123
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (err == null) {
bufs = [uint_to_buffer(8, _this.algo), _this.compressed];
ret = Buffer.concat(bufs);
}
return cb(err, ret);
};
})(this));
};
Compressed.prototype.write = function(cb) {
var err, ret, unframed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/compressed.iced",
funcname: "Compressed.write"
});
_this.write_unframed(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return unframed = arguments[1];
};
})(),
lineno: 133
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (err == null) {
ret = _this.frame_packet(C.packet_tags.compressed, unframed);
}
return cb(err, ret);
};
})(this));
};
return Compressed;
})(Packet);
CompressionParser = (function() {
function CompressionParser(slice) {
this.slice = slice;
}
CompressionParser.prototype.parse = function() {
var algo, compressed;
algo = this.slice.read_uint8();
compressed = this.slice.consume_rest_to_buffer();
return new Compressed({
algo: algo,
compressed: compressed
});
};
return CompressionParser;
})();
exports.Compressed = Compressed;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../asymmetric":1,"../../const":5,"../../util":70,"./base":45,"buffer":80,"iced-runtime":118,"keybase-compressjs":120,"zlib":79}],47:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var Generic, Packet,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
Packet = require('./base').Packet;
Generic = (function(_super) {
__extends(Generic, _super);
function Generic(type, body) {
this.type = type;
this.body = body;
}
return Generic;
})(Packet);
exports.Generic = Generic;
}).call(this);
},{"./base":45}],48:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var AES, C, DSA, ECDH, ECDSA, ElGamal, ElGamalSE, KeyMaterial, Packet, Parser, RSA, S, S2K, SHA1, SHA256, SecretKeyMaterial, Signature, bufeq_secure, bufferify, calc_checksum, decrypt, encode, encrypt, iced, katch, make_time_packet, native_rng, packetsigs, symmetric, triplesec, uint_to_buffer, unix_time, util, __iced_k, __iced_k_noop, _ref, _ref1, _ref2, _ref3,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
C = require('../../const').openpgp;
triplesec = require('triplesec');
_ref = triplesec.hash, SHA1 = _ref.SHA1, SHA256 = _ref.SHA256;
RSA = require('../../rsa').Pair;
DSA = require('../../dsa').Pair;
ElGamal = require('../../elgamal').Pair;
ElGamalSE = require('../../elgamalse').Pair;
ECDSA = require('../../ecc/ecdsa').Pair;
ECDH = require('../../ecc/ecdh').Pair;
AES = triplesec.ciphers.AES;
native_rng = triplesec.prng.native_rng;
calc_checksum = require('../util').calc_checksum;
_ref1 = require('../../util'), bufferify = _ref1.bufferify, unix_time = _ref1.unix_time, bufeq_secure = _ref1.bufeq_secure, katch = _ref1.katch, make_time_packet = _ref1.make_time_packet, uint_to_buffer = _ref1.uint_to_buffer;
_ref2 = require('../cfb'), decrypt = _ref2.decrypt, encrypt = _ref2.encrypt;
Packet = require('./base').Packet;
S = require('./signature');
Signature = S.Signature;
encode = require('../armor').encode;
_ref3 = require('../s2k'), S2K = _ref3.S2K, SecretKeyMaterial = _ref3.SecretKeyMaterial;
symmetric = require('../../symmetric');
util = require('util');
packetsigs = require('./packetsigs');
KeyMaterial = (function(_super) {
__extends(KeyMaterial, _super);
function KeyMaterial(_arg) {
this.key = _arg.key, this.timestamp = _arg.timestamp, this.passphrase = _arg.passphrase, this.skm = _arg.skm, this.opts = _arg.opts, this.flags = _arg.flags;
this.opts || (this.opts = {});
this.flags || (this.flags = 0);
this._is_duplicate_primary = false;
KeyMaterial.__super__.constructor.call(this);
}
KeyMaterial.prototype._write_private_enc = function(bufs, priv, pp) {
var c, ct, iv, ivlen, k, ks, plaintext, salt, sha1hash;
bufs.push(new Buffer([C.s2k_convention.sha1, C.symmetric_key_algorithms.AES256, C.s2k.salt_iter, C.hash_algorithms.SHA256]));
sha1hash = (new SHA1).bufhash(priv);
salt = native_rng(8);
bufs.push(salt);
c = 96;
bufs.push(new Buffer([c]));
ks = AES.keySize;
k = (new S2K).write(pp, salt, c, ks);
ivlen = AES.blockSize;
iv = native_rng(ivlen);
bufs.push(iv);
plaintext = Buffer.concat([priv, sha1hash]);
ct = encrypt({
block_cipher_class: AES,
key: k,
plaintext: plaintext,
iv: iv
});
return bufs.push(ct);
};
KeyMaterial.prototype._write_private_clear = function(bufs, priv) {
return bufs.push(new Buffer([C.s2k_convention.none]), priv, uint_to_buffer(16, calc_checksum(priv)));
};
KeyMaterial.prototype._write_public = function(bufs) {
var pub;
pub = this.key.serialize();
return bufs.push(new Buffer([C.versions.keymaterial.V4]), uint_to_buffer(32, this.timestamp), new Buffer([this.key.type]), pub);
};
KeyMaterial.prototype._write_dummy = function(bufs) {
return bufs.push(new Buffer([C.s2k_convention.sha1, C.symmetric_key_algorithms.AES256, C.s2k.gnu, 0x2]), new Buffer("GNU", "utf8"), new Buffer([0x1]));
};
KeyMaterial.prototype.add_flags = function(v) {
return this.flags |= v;
};
KeyMaterial.prototype.private_body = function(opts) {
var bufs, p, pp, priv, ret;
bufs = [];
this._write_public(bufs);
priv = (p = this.key.priv) != null ? p.serialize() : null;
pp = opts.passphrase || this.passphrase;
if (priv == null) {
this._write_dummy(bufs);
} else if (pp != null) {
this._write_private_enc(bufs, priv, pp);
} else {
this._write_private_clear(bufs, priv);
}
ret = Buffer.concat(bufs);
return ret;
};
KeyMaterial.prototype.private_framed = function(opts) {
var T, body, tag;
body = this.private_body(opts);
T = C.packet_tags;
tag = opts.subkey ? T.secret_subkey : T.secret_key;
return this.frame_packet(tag, body);
};
KeyMaterial.prototype.public_body = function() {
var bufs;
bufs = [];
this._write_public(bufs);
return Buffer.concat(bufs);
};
KeyMaterial.prototype.get_fingerprint = function() {
var data;
data = this.public_body();
return (new SHA1).bufhash(Buffer.concat([new Buffer([C.signatures.key]), uint_to_buffer(16, data.length), data]));
};
KeyMaterial.prototype.get_key_id = function() {
return this.get_fingerprint().slice(12, 20);
};
KeyMaterial.prototype.get_short_key_id = function() {
return this.get_key_id().slice(-4).toString('hex').toUpperCase();
};
KeyMaterial.prototype.get_klass = function() {
return this.key.constructor;
};
KeyMaterial.prototype.export_framed = function(opts) {
if (opts == null) {
opts = {};
}
if (opts["private"]) {
return this.private_framed(opts);
} else {
return this.public_framed(opts);
}
};
KeyMaterial.prototype.public_framed = function(opts) {
var T, body, tag;
if (opts == null) {
opts = {};
}
body = this.public_body();
T = C.packet_tags;
tag = opts.subkey ? T.public_subkey : T.public_key;
return this.frame_packet(tag, body);
};
KeyMaterial.prototype.to_signature_payload = function() {
var pk;
pk = this.public_body();
return Buffer.concat([new Buffer([C.signatures.key]), uint_to_buffer(16, pk.length), pk]);
};
KeyMaterial.prototype.self_sign_key = function(_arg, cb) {
var err, lifespan, primary, raw_payload, sig, sigs, userid, userids, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
userids = _arg.userids, lifespan = _arg.lifespan, raw_payload = _arg.raw_payload;
err = null;
sigs = [];
primary = true;
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref4, _results, _while;
_ref4 = userids;
_len = _ref4.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
userid = _ref4[_i];
if (err == null) {
sig = null;
(function(__iced_k) {
if (_this.key.can_sign() || raw_payload) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial.self_sign_key"
});
_this._self_sign_key({
userid: userid,
lifespan: lifespan,
raw_payload: raw_payload,
primary: primary
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return sig = arguments[1];
};
})(),
lineno: 193
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k((sig = userid.get_framed_signature_output()) == null ? err = new Error("Cannot sign key --- don't have a private key, and can't replay") : void 0);
}
})(function() {
primary = false;
return _next(sigs.push(sig));
});
} else {
return _continue();
}
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(err, sig);
};
})(this));
};
KeyMaterial.prototype._self_sign_key = function(_arg, cb) {
var err, hsp, lifespan, payload, primary, ps, raw_payload, sig, type, userid, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
userid = _arg.userid, lifespan = _arg.lifespan, raw_payload = _arg.raw_payload, primary = _arg.primary;
payload = Buffer.concat([this.to_signature_payload(), userid.to_signature_payload()]);
type = C.sig_types.positive;
hsp = [new S.CreationTime(lifespan.generated), new S.KeyFlags([this.flags]), new S.PreferredSymmetricAlgorithms([C.symmetric_key_algorithms.AES256, C.symmetric_key_algorithms.AES128]), new S.PreferredHashAlgorithms([C.hash_algorithms.SHA512, C.hash_algorithms.SHA256]), new S.Features([C.features.modification_detection]), new S.KeyServerPreferences([C.key_server_preferences.no_modify])];
if (primary) {
hsp.push(new S.PrimaryUserId(1));
}
if (lifespan.expire_in) {
hsp.push(new S.KeyExpirationTime(lifespan.expire_in));
}
sig = new Signature({
type: type,
key: this.key,
hashed_subpackets: hsp,
unhashed_subpackets: [new S.Issuer(this.get_key_id())]
});
(function(_this) {
return (function(__iced_k) {
if (raw_payload) {
return __iced_k(sig = payload);
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial._self_sign_key"
});
sig.write(payload, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 235
}));
__iced_deferrals._fulfill();
})(function() {
ps = new packetsigs.SelfSig({
userid: userid,
type: type,
sig: sig,
options: _this.flags
});
userid.push_sig(ps);
return __iced_k(_this.push_sig(ps));
});
}
});
})(this)((function(_this) {
return function() {
return cb(err, sig);
};
})(this));
};
KeyMaterial.prototype.sign_subkey = function(_arg, cb) {
var err, lifespan, sig, subkey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
subkey = _arg.subkey, lifespan = _arg.lifespan;
err = sig = null;
(function(_this) {
return (function(__iced_k) {
var _ref4, _ref5;
if (_this.key.can_sign()) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial.sign_subkey"
});
_this._sign_subkey({
subkey: subkey,
lifespan: lifespan
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 248
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(!((_ref4 = subkey.get_subkey_binding()) != null ? (_ref5 = _ref4.sig) != null ? _ref5.get_framed_output() : void 0 : void 0) ? err = new Error("Cannot sign with subkey --- don't have private key and can't replay") : void 0);
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
KeyMaterial.prototype._sign_subkey = function(_arg, cb) {
var SKB, err, lifespan, primary_binding, ps, sig, subkey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
subkey = _arg.subkey, lifespan = _arg.lifespan;
sig = err = primary_binding = null;
(function(_this) {
return (function(__iced_k) {
if (subkey.can_sign()) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial._sign_subkey"
});
subkey._sign_primary_with_subkey({
primary: _this,
lifespan: lifespan
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return primary_binding = arguments[1];
};
})(),
lineno: 260
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial._sign_subkey"
});
_this._sign_subkey_with_primary({
subkey: subkey,
lifespan: lifespan,
primary_binding: primary_binding
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return sig = arguments[1];
};
})(),
lineno: 262
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
if (err == null) {
SKB = packetsigs.SubkeyBinding;
ps = new SKB({
primary: _this,
sig: sig,
direction: SKB.DOWN
});
subkey.push_sig(ps);
}
return cb(err);
});
};
})(this));
};
KeyMaterial.prototype._sign_primary_with_subkey = function(_arg, cb) {
var err, lifespan, payload, primary, sig, sig_unframed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
primary = _arg.primary, lifespan = _arg.lifespan;
payload = Buffer.concat([primary.to_signature_payload(), this.to_signature_payload()]);
sig = new Signature({
type: C.sig_types.primary_binding,
key: this.key,
hashed_subpackets: [new S.CreationTime(lifespan.generated)],
unhashed_subpackets: [new S.Issuer(this.get_key_id())]
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial._sign_primary_with_subkey"
});
sig.write_unframed(payload, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return sig_unframed = arguments[1];
};
})(),
lineno: 286
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, sig_unframed);
};
})(this));
};
KeyMaterial.prototype._sign_subkey_with_primary = function(_arg, cb) {
var err, lifespan, payload, primary_binding, sig, subkey, unhashed_subpackets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
subkey = _arg.subkey, lifespan = _arg.lifespan, primary_binding = _arg.primary_binding;
payload = Buffer.concat([this.to_signature_payload(), subkey.to_signature_payload()]);
unhashed_subpackets = [new S.Issuer(this.get_key_id())];
if (primary_binding != null) {
unhashed_subpackets.push(new S.EmbeddedSignature({
rawsig: primary_binding
}));
}
sig = new Signature({
type: C.sig_types.subkey_binding,
key: this.key,
hashed_subpackets: [new S.CreationTime(lifespan.generated), new S.KeyExpirationTime(lifespan.expire_in), new S.KeyFlags([subkey.flags])],
unhashed_subpackets: unhashed_subpackets
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial._sign_subkey_with_primary"
});
sig.write(payload, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 310
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, sig);
};
})(this));
};
KeyMaterial.prototype.merge_private = function(k2) {
return this.skm = k2.skm;
};
KeyMaterial.parse_public_key = function(slice, opts) {
return (new Parser(slice)).parse_public_key(opts);
};
KeyMaterial.parse_private_key = function(slice, opts) {
return (new Parser(slice)).parse_private_key(opts);
};
KeyMaterial.prototype.is_key_material = function() {
return true;
};
KeyMaterial.prototype.is_primary = function() {
var _ref4;
return !((_ref4 = this.opts) != null ? _ref4.subkey : void 0);
};
KeyMaterial.prototype.is_duplicate_primary = function() {
return this._is_duplicate_primary;
};
KeyMaterial.prototype.set_duplicate_primary = function() {
return this._is_duplicate_primary = true;
};
KeyMaterial.prototype.ekid = function() {
return this.key.ekid();
};
KeyMaterial.prototype.can_sign = function() {
return this.key.can_sign();
};
KeyMaterial.prototype.is_locked = function() {
return (!this.key.has_private()) && (this.skm != null) && this.skm.is_locked();
};
KeyMaterial.prototype.has_private = function() {
return this.has_unlocked_private() || this.has_locked_private();
};
KeyMaterial.prototype.has_locked_private = function() {
return this.skm && this.skm.has_private();
};
KeyMaterial.prototype.has_unlocked_private = function() {
return this.key.has_private();
};
KeyMaterial.prototype.has_secret_key_material = function() {
return this.skm != null;
};
KeyMaterial.prototype.validity_check = function(cb) {
var err, msg, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/keymaterial.iced",
funcname: "KeyMaterial.validity_check"
});
_this.key.validity_check(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 344
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err !== "undefined" && err !== null) {
msg = "In key " + (_this.get_fingerprint().toString('hex')) + ": " + err.message;
err = new Error(err);
}
return cb(err);
};
})(this));
};
KeyMaterial.prototype.is_signed_subkey_of = function(primary) {
return (!this.primary_flag) && this.get_psc().is_signed_subkey_of(primary);
};
KeyMaterial.prototype.get_subkey_binding = function() {
if (this.opts.subkey) {
return this.get_psc().get_subkey_binding();
} else {
return null;
}
};
KeyMaterial.prototype.get_subkey_binding_signature_output = function() {
var _ref4, _ref5;
return (_ref4 = this.get_subkey_binding()) != null ? (_ref5 = _ref4.sig) != null ? _ref5.get_framed_output() : void 0 : void 0;
};
KeyMaterial.prototype.equal = function(k2) {
return bufeq_secure(this.ekid(), k2.ekid());
};
KeyMaterial.prototype.unlock = function(_arg, cb) {
var c1, c2, end, err, h1, h2, key, passphrase, pt;
passphrase = _arg.passphrase;
if (passphrase != null) {
passphrase = bufferify(passphrase);
}
err = null;
if (this.skm == null) {
err = new Error("Cannot unlock secret key -- no material!");
return cb(err);
}
pt = this.skm.s2k_convention === C.s2k_convention.none ? this.skm.payload : this.skm.s2k.type === C.s2k.gnu_dummy ? null : passphrase == null ? (err = new Error("Key was locked, but no passphrase given"), null) : (key = this.skm.s2k.produce_key(passphrase, this.skm.cipher.key_size), decrypt({
ciphertext: this.skm.payload,
block_cipher_class: this.skm.cipher.klass,
iv: this.skm.iv,
key: key
}));
if (pt) {
switch (this.skm.s2k_convention) {
case C.s2k_convention.sha1:
end = pt.length - SHA1.output_size;
h1 = pt.slice(end);
pt = pt.slice(0, end);
h2 = (new SHA1).bufhash(pt);
if (!bufeq_secure(h1, h2)) {
err = new Error("bad private key passphrase (hash mismatch)");
}
break;
case C.s2k_convention.checksum:
case C.s2k_convention.none:
end = pt.length - 2;
c1 = pt.readUInt16BE(end);
pt = pt.slice(0, end);
c2 = calc_checksum(pt);
if (c1 !== c2) {
err = new Error("bad private key passphrase (checksum mismatch)");
}
}
if (err == null) {
err = this.key.read_priv(pt);
}
}
return cb(err);
};
KeyMaterial.prototype.get_all_key_flags = function() {
return this._psc.get_all_key_flags();
};
KeyMaterial.prototype.add_flags = function(v) {
return this.flags |= v;
};
KeyMaterial.prototype.fulfills_flags = function(flags) {
var akf, ret;
if (this.is_revoked()) {
return false;
}
akf = this.get_all_key_flags();
ret = ((akf & flags) === flags) || this.key.fulfills_flags(flags) || (this.is_primary() && (akf === 0) && ((this.key.good_for_flags() & flags) === flags));
return ret;
};
KeyMaterial.prototype.get_signed_userids = function() {
return this.get_psc().get_signed_userids();
};
KeyMaterial.prototype.get_signed_user_attributes = function() {
return this.get_psc().get_signed_user_attributes();
};
KeyMaterial.prototype.is_self_signed = function() {
return this.get_psc().is_self_signed();
};
KeyMaterial.prototype.push_sig = function(packetsig) {
this.add_flags(packetsig.sig.get_key_flags());
return KeyMaterial.__super__.push_sig.call(this, packetsig);
};
KeyMaterial.prototype.mark_revoked = function(sig) {
return this.revocation = sig;
};
KeyMaterial.prototype.is_revoked = function() {
return this.revocation != null;
};
return KeyMaterial;
})(Packet);
Parser = (function() {
function Parser(slice) {
this.slice = slice;
this.key = null;
}
Parser.prototype.parse_public_key_v3 = function() {
this.timestamp = this.slice.read_uint32();
this.expiration = this.slice.read_uint16();
return this.parse_public_key_mpis();
};
Parser.prototype.parse_public_key_v4 = function() {
this.timestamp = this.slice.read_uint32();
return this.parse_public_key_mpis();
};
Parser.prototype.parse_public_key_mpis = function() {
var A, err, key, klass, len, _ref4;
this.algorithm = this.slice.read_uint8();
A = C.public_key_algorithms;
klass = (function() {
switch (this.algorithm) {
case A.RSA:
case A.RSA_ENCRYPT_ONLY:
case A.RSA_SIGN_ONLY:
return RSA;
case A.DSA:
return DSA;
case A.ELGAMAL:
return ElGamal;
case A.ELGAMAL_SIGN_AND_ENCRYPT:
return ElGamalSE;
case A.ECDSA:
return ECDSA;
case A.ECDH:
return ECDH;
default:
throw new Error("Unknown key type: " + this.algorithm);
}
}).call(this);
_ref4 = klass.parse(this.slice.peek_rest_to_buffer()), err = _ref4[0], key = _ref4[1], len = _ref4[2];
if (err != null) {
throw err;
}
this.slice.advance(len);
return key;
};
Parser.prototype._parse_public_key = function() {
var version;
switch ((version = this.slice.read_uint8())) {
case C.versions.keymaterial.V3:
return this.parse_public_key_v3();
case C.versions.keymaterial.V4:
return this.parse_public_key_v4();
default:
throw new Error("Unknown public key version: " + version);
}
};
Parser.prototype.parse_public_key = function(opts) {
var key;
key = this._parse_public_key();
return new KeyMaterial({
key: key,
timestamp: this.timestamp,
opts: opts
});
};
Parser.prototype.parse_private_key = function(opts) {
var encrypted_private_key, iv_len, key, skm, sym_enc_alg, _ref4;
skm = new SecretKeyMaterial();
key = this._parse_public_key();
encrypted_private_key = true;
sym_enc_alg = null;
if ((skm.s2k_convention = this.slice.read_uint8()) === C.s2k_convention.none) {
encrypted_private_key = false;
} else {
if ((_ref4 = skm.s2k_convention) === C.s2k_convention.sha1 || _ref4 === C.s2k_convention.checksum) {
sym_enc_alg = this.slice.read_uint8();
skm.s2k = (new S2K).read(this.slice);
} else {
sym_enc_alg = skm.s2k_convention;
}
}
if ((skm.s2k_convention !== C.s2k_convention.none) && (skm.s2k.type === C.s2k.gnu_dummy)) {
skm.payload = null;
} else {
if (sym_enc_alg) {
skm.cipher = symmetric.get_cipher(sym_enc_alg);
iv_len = skm.cipher.klass.blockSize;
skm.iv = this.slice.read_buffer(iv_len);
}
skm.payload = this.slice.consume_rest_to_buffer();
}
return new KeyMaterial({
key: key,
skm: skm,
timestamp: this.timestamp,
opts: opts
});
};
return Parser;
})();
exports.KeyMaterial = KeyMaterial;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../const":5,"../../dsa":6,"../../ecc/ecdh":9,"../../ecc/ecdsa":10,"../../elgamal":12,"../../elgamalse":13,"../../rsa":67,"../../symmetric":68,"../../util":70,"../armor":33,"../cfb":38,"../s2k":58,"../util":60,"./base":45,"./packetsigs":51,"./signature":53,"buffer":80,"iced-runtime":118,"triplesec":181,"util":114}],49:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Literal, LiteralParser, Packet, asymmetric, iced, uint_to_buffer, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; },
__indexOf = [].indexOf || function(item) { for (var i = 0, l = this.length; i < l; i++) { if (i in this && this[i] === item) return i; } return -1; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
Packet = require('./base').Packet;
C = require('../../const').openpgp;
asymmetric = require('../../asymmetric');
uint_to_buffer = require('../../util').uint_to_buffer;
Literal = (function(_super) {
__extends(Literal, _super);
function Literal(_arg) {
this.format = _arg.format, this.filename = _arg.filename, this.date = _arg.date, this.data = _arg.data;
Literal.__super__.constructor.call(this);
}
Literal.parse = function(slice) {
return (new LiteralParser(slice)).parse();
};
Literal.prototype.toString = function(encoding) {
if (encoding == null) {
encoding = null;
}
return this.data.toString(encoding || this.buffer_format());
};
Literal.prototype.toBuffer = function() {
return this.data;
};
Literal.prototype.buffer_format = function() {
switch (this.format) {
case C.literal_formats.text:
return 'ascii';
case C.literal_formats.utf8:
return 'utf8';
default:
return 'binary';
}
};
Literal.prototype.to_signature_payload = function() {
return Buffer.concat([this.data]);
};
Literal.prototype.write_unframed = function(cb) {
var bufs, ret;
this.filename || (this.filename = new Buffer([]));
bufs = [new Buffer([this.format]), uint_to_buffer(8, this.filename.length), this.filename, uint_to_buffer(32, this.date), this.data];
ret = Buffer.concat(bufs);
return cb(null, ret);
};
Literal.prototype.write = function(cb) {
var err, raw, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/literal.iced",
funcname: "Literal.write"
});
_this.write_unframed(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return raw = arguments[1];
};
})(),
lineno: 41
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (err == null) {
ret = _this.frame_packet(C.packet_tags.literal, raw);
}
return cb(err, ret);
};
})(this));
};
Literal.prototype.to_literal = function() {
return this;
};
return Literal;
})(Packet);
LiteralParser = (function() {
function LiteralParser(slice) {
this.slice = slice;
}
LiteralParser.prototype.parse = function() {
var data, date, filename, format, k, known_formats, v;
known_formats = (function() {
var _ref, _results;
_ref = C.literal_formats;
_results = [];
for (k in _ref) {
v = _ref[k];
_results.push(v);
}
return _results;
})();
format = this.slice.read_uint8();
if (__indexOf.call(known_formats, format) < 0) {
throw new Error("unknwon format: " + format);
}
filename = this.slice.read_string();
date = this.slice.read_uint32();
data = this.slice.consume_rest_to_buffer();
return new Literal({
format: format,
filename: filename,
date: date,
data: data
});
};
return LiteralParser;
})();
exports.Literal = Literal;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../asymmetric":1,"../../const":5,"../../util":70,"./base":45,"buffer":80,"iced-runtime":118}],50:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, OPS_Parser, OnePassSignature, Packet, asymmetric, hash, iced, uint_to_buffer, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
Packet = require('./base').Packet;
C = require('../../const').openpgp;
asymmetric = require('../../asymmetric');
hash = require('../../hash');
uint_to_buffer = require('../../util').uint_to_buffer;
OnePassSignature = (function(_super) {
__extends(OnePassSignature, _super);
function OnePassSignature(_arg) {
this.sig_type = _arg.sig_type, this.hasher = _arg.hasher, this.sig_klass = _arg.sig_klass, this.key_id = _arg.key_id, this.is_final = _arg.is_final;
}
OnePassSignature.parse = function(slice) {
return (new OPS_Parser(slice)).parse();
};
OnePassSignature.prototype.write_unframed = function(cb) {
var bufs, unframed, vals, x;
vals = [C.versions.one_pass_sig, this.sig_type, this.hasher.type, this.sig_klass.type];
bufs = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = vals.length; _i < _len; _i++) {
x = vals[_i];
_results.push(uint_to_buffer(8, x));
}
return _results;
})();
bufs.push(this.key_id);
bufs.push(uint_to_buffer(8, this.is_final));
unframed = Buffer.concat(bufs);
return cb(null, unframed);
};
OnePassSignature.prototype.write = function(cb) {
var err, framed, unframed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/one_pass_sig.iced",
funcname: "OnePassSignature.write"
});
_this.write_unframed(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return unframed = arguments[1];
};
})(),
lineno: 38
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
framed = _this.frame_packet(C.packet_tags.one_pass_sig, unframed);
return cb(err, framed);
};
})(this));
};
return OnePassSignature;
})(Packet);
OPS_Parser = (function() {
function OPS_Parser(slice) {
this.slice = slice;
}
OPS_Parser.prototype.parse = function() {
var hasher, is_final, key_id, sig_klass, sig_type, v;
if ((v = this.slice.read_uint8()) !== C.versions.one_pass_sig) {
throw new Error("Unknown OnePassSignature version " + v);
}
sig_type = this.slice.read_uint8();
hasher = hash.alloc_or_throw(this.slice.read_uint8());
sig_klass = asymmetric.get_class(this.slice.read_uint8());
key_id = this.slice.read_buffer(8);
is_final = this.slice.read_uint8();
return new OnePassSignature({
sig_type: sig_type,
hasher: hasher,
sig_klass: sig_klass,
key_id: key_id,
is_final: is_final
});
};
return OPS_Parser;
})();
exports.OnePassSignature = OnePassSignature;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../asymmetric":1,"../../const":5,"../../hash":14,"../../util":70,"./base":45,"buffer":80,"iced-runtime":118}],51:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var Base, Collection, Data, SelfSig, SubkeyBinding,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
Base = (function() {
function Base(_arg) {
this.sig = _arg.sig;
}
Base.prototype.typ = function() {
return "none";
};
Base.prototype.get_key_flags = function() {
return this.sig.get_key_flags();
};
return Base;
})();
SelfSig = (function(_super) {
__extends(SelfSig, _super);
function SelfSig(_arg) {
var sig;
this.userid = _arg.userid, this.user_attribute = _arg.user_attribute, this.type = _arg.type, sig = _arg.sig, this.options = _arg.options;
SelfSig.__super__.constructor.call(this, {
sig: sig
});
}
SelfSig.prototype.typ = function() {
return "self_sig";
};
return SelfSig;
})(Base);
SubkeyBinding = (function(_super) {
__extends(SubkeyBinding, _super);
SubkeyBinding.UP = 1;
SubkeyBinding.DOWN = 2;
function SubkeyBinding(_arg) {
var sig;
this.primary = _arg.primary, sig = _arg.sig, this.direction = _arg.direction;
SubkeyBinding.__super__.constructor.call(this, {
sig: sig
});
}
SubkeyBinding.prototype.typ = function() {
return "subkey_binding";
};
SubkeyBinding.prototype.is_down = function() {
return this.direction === SubkeyBinding.DOWN;
};
return SubkeyBinding;
})(Base);
Data = (function(_super) {
__extends(Data, _super);
function Data(_arg) {
var sig;
this.key = _arg.key, sig = _arg.sig;
Data.__super__.constructor.call(this, {
sig: sig
});
}
Data.prototype.typ = function() {
return "data";
};
Data.prototype.get_key_manager = function() {
var _ref;
return (_ref = this.sig) != null ? _ref.key_manager : void 0;
};
return Data;
})(Base);
Collection = (function() {
function Collection() {
this.all = [];
this.lookup = {
self_sig: [],
subkey_binding: [],
data: []
};
}
Collection.prototype.push = function(ps) {
this.all.push(ps);
return this.lookup[ps.typ()].push(ps);
};
Collection.prototype.is_signed_subkey_of = function(primary) {
var skb, _i, _len, _ref;
_ref = this.lookup.subkey_binding;
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
skb = _ref[_i];
if (skb.primary.equal(primary) && skb.is_down()) {
return true;
}
}
return false;
};
Collection.prototype.get_all_key_flags = function() {
var p, ret, _i, _len, _ref;
ret = 0;
_ref = this.all;
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
p = _ref[_i];
ret |= p.get_key_flags();
}
return ret;
};
Collection.prototype.get_signed_userids = function() {
var p, u, _i, _len, _ref, _results;
_ref = this.lookup.self_sig;
_results = [];
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
p = _ref[_i];
if ((u = p.userid) != null) {
_results.push(u);
}
}
return _results;
};
Collection.prototype.get_signed_user_attributes = function() {
var p, u, _i, _len, _ref, _results;
_ref = this.lookup.self_sig;
_results = [];
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
p = _ref[_i];
if ((u = p.user_attribute) != null) {
_results.push(u);
}
}
return _results;
};
Collection.prototype.get_self_sig = function() {
if (this.lookup.self_sig.length) {
return this.lookup.self_sig[0];
} else {
return null;
}
};
Collection.prototype.get_self_sigs = function() {
return this.lookup.self_sig;
};
Collection.prototype.is_self_signed = function() {
return this.get_signed_userids().length > 0;
};
Collection.prototype.get_data_signer = function() {
if (this.lookup.data.length > 0) {
return this.lookup.data[0];
} else {
return null;
}
};
Collection.prototype.get_data_signers = function() {
return this.lookup.data;
};
Collection.prototype.get_subkey_binding = function() {
if (this.lookup.subkey_binding.length) {
return this.lookup.subkey_binding[0];
} else {
return null;
}
};
return Collection;
})();
exports.SelfSig = SelfSig;
exports.SubkeyBinding = SubkeyBinding;
exports.Data = Data;
exports.Collection = Collection;
}).call(this);
},{}],52:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, C, Decryptor, MDC, MDC_Parser, PKESK, PKESK_Parser, Packet, SEIPD, SEIPD_Parser, SHA1, asymmetric, bufeq_fast, bufeq_secure, encrypt, iced, make_esc, streamers, uint_to_buffer, __iced_k, __iced_k_noop, _ref, _ref1, _ref2,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
Packet = require('./base').Packet;
C = require('../../const').openpgp;
asymmetric = require('../../asymmetric');
_ref = require('../../hash'), SHA1 = _ref.SHA1, streamers = _ref.streamers;
_ref1 = require('../../util'), uint_to_buffer = _ref1.uint_to_buffer, bufeq_secure = _ref1.bufeq_secure, bufeq_fast = _ref1.bufeq_fast;
_ref2 = require('../ocfb'), encrypt = _ref2.encrypt, Decryptor = _ref2.Decryptor;
ASP = require('pgp-utils').util.ASP;
make_esc = require('iced-error').make_esc;
PKESK = (function(_super) {
__extends(PKESK, _super);
function PKESK(_arg) {
this.crypto_type = _arg.crypto_type, this.key_id = _arg.key_id, this.ekey = _arg.ekey;
}
PKESK.parse = function(slice) {
return (new PKESK_Parser(slice)).parse();
};
PKESK.prototype.to_esk_packet = function() {
return this;
};
PKESK.prototype.get_key_id = function() {
return this.key_id;
};
PKESK.prototype.write_unframed = function(cb) {
var bufs, err, ret;
bufs = [uint_to_buffer(8, C.versions.PKESK), this.key_id, uint_to_buffer(8, this.crypto_type), this.ekey.output()];
ret = Buffer.concat(bufs);
err = null;
return cb(err, ret);
};
PKESK.prototype.write = function(cb) {
var err, ret, unframed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "PKESK.write"
});
_this.write_unframed(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return unframed = arguments[1];
};
})(),
lineno: 36
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
ret = _this.frame_packet(C.packet_tags.PKESK, unframed);
}
return cb(err, ret);
};
})(this));
};
return PKESK;
})(Packet);
SEIPD = (function(_super) {
__extends(SEIPD, _super);
function SEIPD(_arg) {
this.ciphertext = _arg.ciphertext;
}
SEIPD.parse = function(slice) {
return (new SEIPD_Parser(slice)).parse();
};
SEIPD.prototype.to_enc_data_packet = function() {
return this;
};
SEIPD.prototype.check = function() {};
SEIPD.prototype.decrypt = function(_arg, cb) {
var asp, cipher, eng, err, esc, mdc, plaintext, prefix, pt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
cipher = _arg.cipher, asp = _arg.asp;
eng = new Decryptor({
cipher: cipher,
ciphertext: this.ciphertext,
asp: asp
});
esc = make_esc(cb, "SEIPD::decrypt");
asp = ASP.make(asp);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "SEIPD.decrypt"
});
eng.check(esc(__iced_deferrals.defer({
lineno: 63
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "SEIPD.decrypt"
});
eng.dec(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return pt = arguments[0];
};
})(),
lineno: 64
})));
__iced_deferrals._fulfill();
})(function() {
var _ref3;
_ref3 = MDC.parse(pt), mdc = _ref3[0], plaintext = _ref3[1];
prefix = eng.get_prefix();
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "SEIPD.decrypt"
});
mdc.compute({
prefix: prefix,
plaintext: plaintext,
asp: asp
}, esc(__iced_deferrals.defer({
lineno: 70
})));
__iced_deferrals._fulfill();
})(function() {
err = mdc.check() ? null : new Error("MDC mismatch");
return cb(err, plaintext);
});
});
};
})(this));
};
SEIPD.prototype.encrypt = function(_arg, cb) {
var asp, cipher, esc, mdc, mdc_buf, plaintext, prefixrandom, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
cipher = _arg.cipher, plaintext = _arg.plaintext, prefixrandom = _arg.prefixrandom, asp = _arg.asp;
mdc = new MDC({});
esc = make_esc(cb, "SEIPD::encrypt");
asp = ASP.make(asp);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "SEIPD.encrypt"
});
mdc.compute({
plaintext: plaintext,
prefix: prefixrandom,
asp: asp
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return mdc_buf = arguments[0];
};
})(),
lineno: 81
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
plaintext = Buffer.concat([plaintext, MDC.header, mdc_buf]);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "SEIPD.encrypt"
});
encrypt({
cipher: cipher,
plaintext: plaintext,
prefixrandom: prefixrandom
}, esc(__iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
return __slot_1.ciphertext = arguments[0];
};
})(_this),
lineno: 83
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null);
});
};
})(this));
};
SEIPD.prototype.write_unframed = function(cb) {
var err, ret;
err = ret = null;
ret = Buffer.concat([uint_to_buffer(8, C.versions.SEIPD), this.ciphertext]);
return cb(err, ret);
};
SEIPD.prototype.write = function(cb) {
var err, ret, unframed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
ret = err = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "SEIPD.write"
});
_this.write_unframed(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return unframed = arguments[1];
};
})(),
lineno: 97
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (err == null) {
ret = _this.frame_packet(C.packet_tags.SEIPD, unframed);
}
return cb(err, ret);
};
})(this));
};
return SEIPD;
})(Packet);
MDC = (function(_super) {
__extends(MDC, _super);
MDC.header = new Buffer([0xc0 | C.packet_tags.MDC, SHA1.output_length]);
MDC.prototype.header = MDC.header;
function MDC(_arg) {
this.digest = _arg.digest;
}
MDC.parse = function(buf) {
return (new MDC_Parser(buf)).parse();
};
MDC.prototype.compute = function(_arg, cb) {
var asp, esc, hasher, i, plaintext, prefix, step, ___iced_passed_deferral, __iced_deferrals, __iced_k, _begin, _end, _positive;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
plaintext = _arg.plaintext, prefix = _arg.prefix, asp = _arg.asp;
asp = ASP.make(asp);
hasher = streamers.SHA1();
hasher.update(Buffer.concat([prefix, prefix.slice(-2)]));
esc = make_esc(cb, "MDC::compute");
step = 0x100000;
(function(_this) {
return (function(__iced_k) {
var _i, _results, _while;
i = 0;
_begin = 0;
_end = plaintext.length;
_positive = _end > _begin;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
if (_positive) {
i += step;
} else {
i -= step;
}
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!!((_positive === true && i >= plaintext.length) || (_positive === false && i <= plaintext.length))) {
return _break();
} else {
hasher.update(plaintext.slice(i, i + step));
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/packet/sess.iced",
funcname: "MDC.compute"
});
asp.progress({
what: "MDC",
total: plaintext.length,
i: i
}, esc(__iced_deferrals.defer({
lineno: 122
})));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
hasher.update(_this.header);
_this.computed = hasher();
return cb(null, _this.computed);
};
})(this));
};
MDC.prototype.check = function() {
return bufeq_secure(this.digest, this.computed);
};
return MDC;
})(Packet);
MDC_Parser = (function() {
function MDC_Parser(buf) {
this.buf = buf;
}
MDC_Parser.prototype.parse = function() {
var chunk, digest, hl, len, rem;
hl = MDC.header.length;
len = SHA1.output_length + hl;
rem = this.buf.slice(0, -len);
chunk = this.buf.slice(-len);
if (!bufeq_fast(chunk.slice(0, hl), MDC.header)) {
throw new Error('Missing MDC header');
}
digest = chunk.slice(hl);
return [
new MDC({
digest: digest
}), rem
];
};
return MDC_Parser;
})();
SEIPD_Parser = (function() {
function SEIPD_Parser(slice) {
this.slice = slice;
}
SEIPD_Parser.prototype.payload_split = function(raw) {};
SEIPD_Parser.prototype.parse = function() {
var ciphertext, v;
if ((v = this.slice.read_uint8()) !== C.versions.SEIPD) {
throw new Error("Unknown SEIPD version " + v);
}
ciphertext = this.slice.consume_rest_to_buffer();
return new SEIPD({
ciphertext: ciphertext
});
};
return SEIPD_Parser;
})();
PKESK_Parser = (function() {
function PKESK_Parser(slice) {
this.slice = slice;
}
PKESK_Parser.prototype.parse = function() {
var crypto_type, ekey, key_id, klass, v;
if ((v = this.slice.read_uint8()) !== C.versions.PKESK) {
throw new Error("Unknown PKESK version: " + v);
}
key_id = this.slice.read_buffer(8);
crypto_type = this.slice.read_uint8();
klass = asymmetric.get_class(crypto_type);
ekey = klass.parse_output(this.slice.consume_rest_to_buffer());
return new PKESK({
crypto_type: crypto_type,
key_id: key_id,
ekey: ekey
});
};
return PKESK_Parser;
})();
exports.SEIPD = SEIPD;
exports.PKESK = PKESK;
exports.MDC = MDC;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../asymmetric":1,"../../const":5,"../../hash":14,"../../util":70,"../ocfb":43,"./base":45,"buffer":80,"iced-error":115,"iced-runtime":118,"pgp-utils":163}],53:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, CreationTime, EmbeddedSignature, Experimental, ExpirationTime, Exportable, Features, Issuer, KeyExpirationTime, KeyFlags, KeyServerPreferences, NotationData, Packet, Parser, PolicyURI, Preference, PreferredCompressionAlgorithms, PreferredHashAlgorithms, PreferredKeyServer, PreferredSymmetricAlgorithms, PrimaryUserId, ReasonForRevocation, RegularExpression, Revocable, RevocationKey, S, SHA1, SHA512, Signature, SignatureTarget, Signature_v2, Signature_v2_or_v3, Signature_v3, SignersUserID, SlicerBuffer, SubPacket, Time, Trust, alloc_or_throw, assert, asymmetric, encode_length, iced, make_esc, make_time_packet, packetsigs, uint_to_buffer, unix_time, util, __iced_k, __iced_k_noop, _ref, _ref1, _ref2,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
Packet = require('./base').Packet;
C = require('../../const').openpgp;
S = C.sig_subpacket;
_ref = require('../util'), encode_length = _ref.encode_length, make_time_packet = _ref.make_time_packet;
_ref1 = require('../../util'), unix_time = _ref1.unix_time, uint_to_buffer = _ref1.uint_to_buffer;
_ref2 = require('../../hash'), alloc_or_throw = _ref2.alloc_or_throw, SHA512 = _ref2.SHA512, SHA1 = _ref2.SHA1;
asymmetric = require('../../asymmetric');
util = require('util');
packetsigs = require('./packetsigs');
assert = require('assert');
SlicerBuffer = require('../buffer').SlicerBuffer;
make_esc = require('iced-error').make_esc;
Signature_v2_or_v3 = (function(_super) {
__extends(Signature_v2_or_v3, _super);
function Signature_v2_or_v3(_arg) {
this.key = _arg.key, this.hasher = _arg.hasher, this.key_id = _arg.key_id, this.sig_data = _arg.sig_data, this.public_key_class = _arg.public_key_class, this.signed_hash_value_hash = _arg.signed_hash_value_hash, this.time = _arg.time, this.sig = _arg.sig, this.type = _arg.type, this.version = _arg.version;
if (this.hasher == null) {
this.hasher = SHA512;
}
this._framed_output = null;
}
Signature_v2_or_v3.prototype.is_signature = function() {
return true;
};
Signature_v2_or_v3.prototype.get_key_id = function() {
return this.key_id;
};
Signature_v2_or_v3.prototype.get_issuer_key_id = function() {
return this.key_id;
};
Signature_v2_or_v3.prototype.when_generated = function() {
return this.time;
};
Signature_v2_or_v3.prototype.time_of_primary_uid_sig = function() {
return null;
};
Signature_v2_or_v3.prototype.gen_prefix = function() {
return Buffer.concat([new Buffer([C.versions.signature.V3, this.type], uint_to_buffer(32, this.time), this.key_id, new Buffer([this.key.type, this.hasher.type]))]);
};
Signature_v2_or_v3.prototype.prepare_payload = function(data_packets) {
var bufs, dp;
bufs = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = data_packets.length; _i < _len; _i++) {
dp = data_packets[_i];
_results.push(dp.to_signature_payload());
}
return _results;
})();
bufs.push(new Buffer([this.type]), uint_to_buffer(32, this.time));
return Buffer.concat(bufs);
};
Signature_v2_or_v3.prototype.verify = function(data_packets, cb) {
var T, b, d, err, hash, payload, s, v, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
payload = this.prepare_payload(data_packets);
hash = this.hasher(payload);
s = new SlicerBuffer(hash);
v = s.read_uint16();
T = C.sig_types;
(function(_this) {
return (function(__iced_k) {
if (v !== (b = _this.signed_hash_value_hash)) {
return __iced_k(err = new Error("quick hash check failed: " + v + " != " + b));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/signature.iced",
funcname: "Signature_v2_or_v3.verify"
});
_this.key.verify_unpad_and_check_hash({
hash: hash,
hasher: _this.hasher,
sig: _this.sig
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 76
}));
__iced_deferrals._fulfill();
})(function() {
var _i, _len, _ref3;
if ((err == null) && ((_ref3 = _this.type) === T.binary_doc || _ref3 === T.canonical_text)) {
for (_i = 0, _len = data_packets.length; _i < _len; _i++) {
d = data_packets[_i];
d.push_sig(new packetsigs.Data({
sig: _this
}));
}
}
return __iced_k();
});
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
return Signature_v2_or_v3;
})(Packet);
Signature_v2 = (function(_super) {
__extends(Signature_v2, _super);
function Signature_v2() {
return Signature_v2.__super__.constructor.apply(this, arguments);
}
return Signature_v2;
})(Signature_v2_or_v3);
Signature_v3 = (function(_super) {
__extends(Signature_v3, _super);
function Signature_v3() {
return Signature_v3.__super__.constructor.apply(this, arguments);
}
return Signature_v3;
})(Signature_v2_or_v3);
Signature = (function(_super) {
__extends(Signature, _super);
function Signature(_arg) {
this.key = _arg.key, this.hasher = _arg.hasher, this.key_id = _arg.key_id, this.sig_data = _arg.sig_data, this.public_key_class = _arg.public_key_class, this.signed_hash_value_hash = _arg.signed_hash_value_hash, this.hashed_subpackets = _arg.hashed_subpackets, this.time = _arg.time, this.sig = _arg.sig, this.type = _arg.type, this.unhashed_subpackets = _arg.unhashed_subpackets, this.version = _arg.version;
if (this.hasher == null) {
this.hasher = SHA512;
}
if (this.hashed_subpackets == null) {
this.hashed_subpackets = [];
}
if (this.unhashed_subpackets == null) {
this.unhashed_subpackets = [];
}
this.subpacket_index = this._make_subpacket_index();
this._framed_output = null;
}
Signature.prototype.get_key_id = function() {
var _ref3;
if (this.key_id) {
return this.key_id;
} else {
return (_ref3 = this.subpacket_index.all[S.issuer]) != null ? _ref3.id : void 0;
}
};
Signature.prototype._make_subpacket_index = function() {
var p, ret, _i, _j, _len, _len1, _ref3, _ref4;
ret = {
hashed: {},
unhashed: {},
all: {}
};
_ref3 = this.hashed_subpackets;
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
p = _ref3[_i];
ret.hashed[p.type] = p;
ret.all[p.type] = p;
}
_ref4 = this.unhashed_subpackets;
for (_j = 0, _len1 = _ref4.length; _j < _len1; _j++) {
p = _ref4[_j];
ret.unhashed[p.type] = p;
ret.all[p.type] = p;
}
return ret;
};
Signature.prototype.prepare_payload = function(data) {
var flatsp, hvalue, payload, prefix, s, trailer;
flatsp = Buffer.concat((function() {
var _i, _len, _ref3, _results;
_ref3 = this.hashed_subpackets;
_results = [];
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
s = _ref3[_i];
_results.push(s.to_buffer());
}
return _results;
}).call(this));
prefix = Buffer.concat([new Buffer([C.versions.signature.V4, this.type, this.key.type, this.hasher.type]), uint_to_buffer(16, flatsp.length), flatsp]);
trailer = Buffer.concat([new Buffer([C.versions.signature.V4, 0xff]), uint_to_buffer(32, prefix.length)]);
payload = Buffer.concat([data, prefix, trailer]);
hvalue = this.hasher(payload);
return {
prefix: prefix,
payload: payload,
hvalue: hvalue
};
};
Signature.prototype.write_unframed = function(data, cb) {
var esc, hvalue, payload, prefix, result2, results, s, sig, uhsp, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref3;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "write_unframed");
uhsp = Buffer.concat((function() {
var _i, _len, _ref3, _results;
_ref3 = this.unhashed_subpackets;
_results = [];
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
s = _ref3[_i];
_results.push(s.to_buffer());
}
return _results;
}).call(this));
_ref3 = this.prepare_payload(data), prefix = _ref3.prefix, payload = _ref3.payload, hvalue = _ref3.hvalue;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/signature.iced",
funcname: "Signature.write_unframed"
});
_this.key.pad_and_sign(payload, {
hasher: _this.hasher
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 154
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
result2 = Buffer.concat([uint_to_buffer(16, uhsp.length), uhsp, new Buffer([hvalue.readUInt8(0), hvalue.readUInt8(1)]), sig]);
results = Buffer.concat([prefix, result2]);
return cb(null, results);
};
})(this));
};
Signature.prototype.write = function(data, cb) {
var err, ret, unframed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/signature.iced",
funcname: "Signature.write"
});
_this.write_unframed(data, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return unframed = arguments[1];
};
})(),
lineno: 167
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
_this._framed_output = ret = _this.frame_packet(C.packet_tags.signature, unframed);
}
return cb(err, ret);
};
})(this));
};
Signature.prototype.get_framed_output = function() {
return this._framed_output || this.replay();
};
Signature.parse = function(slice) {
return (new Parser(slice)).parse();
};
Signature.prototype.extract_key = function(data_packets) {
var p, _i, _len, _results;
_results = [];
for (_i = 0, _len = data_packets.length; _i < _len; _i++) {
p = data_packets[_i];
if (p.key != null) {
this.key = p.key;
break;
} else {
_results.push(void 0);
}
}
return _results;
};
Signature.prototype.verify = function(data_packets, cb) {
var err, p, s, subkey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/signature.iced",
funcname: "Signature.verify"
});
_this._verify(data_packets, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 196
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
var _i, _len, _ref3, _results, _while;
_ref3 = _this.unhashed_subpackets;
_len = _ref3.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
p = _ref3[_i];
if ((typeof err === "undefined" || err === null) && ((s = p.to_sig()) != null)) {
(function(__iced_k) {
if (s.type !== C.sig_types.primary_binding) {
return __iced_k(err = new Error("unknown subpacket signature type: " + s.type));
} else {
(function(__iced_k) {
if (data_packets.length !== 1) {
return __iced_k(err = new Error("Needed 1 data packet for a primary_binding signature"));
} else {
subkey = data_packets[0];
s.primary = _this.primary;
s.key = subkey.key;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/signature.iced",
funcname: "Signature.verify"
});
s._verify([subkey], __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 206
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
})(__iced_k);
}
})(_next);
} else {
return _continue();
}
}
};
_while(__iced_k);
})(function() {
return cb(err);
});
};
})(this));
};
Signature.prototype._verify = function(data_packets, cb) {
var SKB, T, buffers, d, data, dp, err, hvalue, n, packets, payload, ps, sig, subkey, user_attribute, userid, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
T = C.sig_types;
subkey = null;
this.data_packets = (function() {
switch (this.type) {
case T.binary_doc:
case T.canonical_text:
return data_packets;
case T.issuer:
case T.personal:
case T.casual:
case T.positive:
case T.certificate_revocation:
if ((n = data_packets.length) !== 1) {
err = new Error("Only expecting one UserID-style packet in a self-sig (got " + n + ")");
return [];
} else {
return [this.primary].concat(data_packets);
}
break;
case T.subkey_binding:
case T.primary_binding:
case T.subkey_revocation:
packets = [];
if (data_packets.length !== 1) {
err = new Error("Wrong number of data packets; expected only 1");
} else if (this.primary == null) {
err = new Error("Need a primary key for subkey signature");
} else {
subkey = data_packets[0];
packets = [this.primary, subkey];
}
return packets;
case T.direct:
return [this.primary].concat(data_packets);
default:
err = new Error("cannot verify sigtype " + this.type);
return [];
}
}).call(this);
(function(_this) {
return (function(__iced_k) {
var _ref3;
if (err == null) {
buffers = (function() {
var _i, _len, _ref3, _results;
_ref3 = this.data_packets;
_results = [];
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
dp = _ref3[_i];
_results.push(dp.to_signature_payload());
}
return _results;
}).call(_this);
data = Buffer.concat(buffers);
_ref3 = _this.prepare_payload(data), payload = _ref3.payload, hvalue = _ref3.hvalue;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/packet/signature.iced",
funcname: "Signature._verify"
});
_this.key.verify_unpad_and_check_hash({
sig: _this.sig,
hash: hvalue,
hasher: _this.hasher
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 256
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
var _i, _len, _ref3;
if (err == null) {
err = _this._check_key_sig_expiration();
}
sig = _this;
if (err == null) {
SKB = packetsigs.SubkeyBinding;
switch (_this.type) {
case T.binary_doc:
case T.canonical_text:
_ref3 = _this.data_packets;
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
d = _ref3[_i];
d.push_sig(new packetsigs.Data({
sig: sig
}));
}
break;
case T.issuer:
case T.personal:
case T.casual:
case T.positive:
ps = null;
if ((userid = _this.data_packets[1].to_userid()) != null) {
ps = new packetsigs.SelfSig({
type: _this.type,
userid: userid,
sig: sig
});
userid.push_sig(ps);
} else if ((user_attribute = _this.data_packets[1].to_user_attribute()) != null) {
ps = new packetsigs.SelfSig({
type: _this.type,
user_attribute: user_attribute,
sig: sig
});
user_attribute.push_sig(ps);
}
if (ps) {
_this.primary.push_sig(ps);
}
break;
case T.subkey_binding:
subkey.push_sig(new SKB({
primary: _this.primary,
sig: sig,
direction: SKB.DOWN
}));
break;
case T.primary_binding:
subkey.push_sig(new SKB({
primary: _this.primary,
sig: sig,
direction: SKB.UP
}));
break;
case T.subkey_revocation:
subkey.mark_revoked(sig);
}
}
return cb(err);
};
})(this));
};
Signature.prototype.is_signature = function() {
return true;
};
Signature.prototype.when_generated = function() {
var _ref3;
return (_ref3 = this.subpacket_index.hashed[S.creation_time]) != null ? _ref3.time : void 0;
};
Signature.prototype.time_primary_pair = function() {
var T, _ref3, _ref4;
T = C.sig_types;
if ((_ref3 = this.type) === T.issuer || _ref3 === T.personal || _ref3 === T.casual || _ref3 === T.positive) {
return [this.when_generated(), !!((_ref4 = this.subpacket_index.hashed[S.primary_user_id]) != null ? _ref4.flag : void 0)];
} else {
return null;
}
};
Signature.prototype._check_key_sig_expiration = function() {
var T, creation, err, expiration, now, _ref3;
err = null;
T = C.sig_types;
if ((_ref3 = this.type) === T.issuer || _ref3 === T.personal || _ref3 === T.casual || _ref3 === T.positive || _ref3 === T.subkey_binding || _ref3 === T.primary_binding) {
creation = this.subpacket_index.hashed[S.creation_time];
expiration = this.subpacket_index.hashed[S.key_expiration_time];
now = unix_time();
if ((creation != null) && (expiration != null)) {
expiration = creation.time + expiration.time;
if ((now > expiration) && expiration !== 0) {
err = new Error("Key expired " + (now - expiration) + "s ago");
}
}
if ((err == null) && ((expiration = this.subpacket_index.hashed[S.expiration_time]) != null) && (now > expiration.time) && expiration.time !== 0) {
err = new Error("Signature expired " + (now - expiration.time) + "s ago");
}
}
return err;
};
Signature.prototype.get_key_flags = function() {
var _ref3, _ref4, _ref5;
return ((_ref3 = this.subpacket_index) != null ? (_ref4 = _ref3.hashed) != null ? (_ref5 = _ref4[C.sig_subpacket.key_flags]) != null ? _ref5.all_flags() : void 0 : void 0 : void 0) || 0;
};
Signature.prototype.get_issuer_key_id = function() {
var _ref3, _ref4;
return (_ref3 = this.subpacket_index) != null ? (_ref4 = _ref3.all[C.sig_subpacket.issuer]) != null ? _ref4.id : void 0 : void 0;
};
return Signature;
})(Packet);
SubPacket = (function() {
function SubPacket(type) {
this.type = type;
this.critical = false;
this.five_byte_len = false;
}
SubPacket.prototype.set_opts = function(d) {
var k, v;
for (k in d) {
v = d[k];
this[k] = v;
}
return true;
};
SubPacket.prototype.to_buffer = function() {
var inner;
inner = this._v_to_buffer();
return Buffer.concat([encode_length(inner.length + 1, this.five_byte_len), uint_to_buffer(8, this.type | (this.critical ? 0x80 : 0x00)), inner]);
};
SubPacket.prototype.to_sig = function() {
return null;
};
SubPacket.prototype.export_to_option = function() {
return null;
};
return SubPacket;
})();
Experimental = (function(_super) {
__extends(Experimental, _super);
function Experimental(buf, type) {
this.buf = buf;
this.type = type;
}
Experimental.parse = function(slice, type) {
return new Experimental(slice.consume_rest_to_buffer(), type);
};
Experimental.prototype._v_to_buffer = function() {
return this.buf;
};
return Experimental;
})(SubPacket);
Time = (function(_super) {
__extends(Time, _super);
function Time(type, time) {
this.time = time;
this.never_expires = this.time === 0;
Time.__super__.constructor.call(this, type);
}
Time.parse = function(slice, klass) {
return new klass(slice.read_uint32());
};
Time.prototype._v_to_buffer = function() {
return uint_to_buffer(32, this.time);
};
return Time;
})(SubPacket);
Preference = (function(_super) {
__extends(Preference, _super);
function Preference(type, v) {
var e, _i, _len, _ref3;
this.v = v;
Preference.__super__.constructor.call(this, type);
_ref3 = this.v;
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
e = _ref3[_i];
assert(e != null);
}
}
Preference.parse = function(slice, klass) {
var c, v;
v = (function() {
var _i, _len, _ref3, _results;
_ref3 = slice.consume_rest_to_buffer();
_results = [];
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
c = _ref3[_i];
_results.push(c);
}
return _results;
})();
return new klass(v);
};
Preference.prototype._v_to_buffer = function() {
var e;
return new Buffer((function() {
var _i, _len, _ref3, _results;
_ref3 = this.v;
_results = [];
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
e = _ref3[_i];
_results.push(e);
}
return _results;
}).call(this));
};
return Preference;
})(SubPacket);
CreationTime = (function(_super) {
__extends(CreationTime, _super);
function CreationTime(t) {
CreationTime.__super__.constructor.call(this, S.creation_time, t);
}
CreationTime.parse = function(slice) {
return Time.parse(slice, CreationTime);
};
return CreationTime;
})(Time);
ExpirationTime = (function(_super) {
__extends(ExpirationTime, _super);
function ExpirationTime(t) {
ExpirationTime.__super__.constructor.call(this, S.expiration_time, t);
}
ExpirationTime.parse = function(slice) {
return Time.parse(slice, ExpirationTime);
};
return ExpirationTime;
})(Time);
Exportable = (function(_super) {
__extends(Exportable, _super);
function Exportable(flag) {
this.flag = flag;
Exportable.__super__.constructor.call(this, S.exportable_certificate);
}
Exportable.parse = function(slice) {
return new Exportable(slice.read_uint8());
};
Exportable.prototype._v_to_buffer = function() {
return uint_to_buffer(8, this.flag);
};
return Exportable;
})(SubPacket);
Trust = (function(_super) {
__extends(Trust, _super);
function Trust(level, amount) {
this.level = level;
this.amount = amount;
Trust.__super__.constructor.call(this, S.trust_signature);
}
Trust.parse = function(slice) {
return new Trust(slice.read_uint8(), slice.read_uint8());
};
Trust.prototype._v_to_buffer = function() {
return Buffer.concat([uint_to_buffer(8, this.level), uint_to_buffer(8, this.amount)]);
};
return Trust;
})(SubPacket);
RegularExpression = (function(_super) {
__extends(RegularExpression, _super);
function RegularExpression(re) {
this.re = re;
RegularExpression.__super__.constructor.call(this, S.regular_expression);
}
RegularExpression.parse = function(slice) {
var ret;
ret = new RegularExpression(slice.consume_rest_to_buffer().toString('utf8'));
return ret;
};
RegularExpression.prototype._v_to_buffer = function() {
return new Buffer(this.re, 'utf8');
};
return RegularExpression;
})(SubPacket);
Revocable = (function(_super) {
__extends(Revocable, _super);
function Revocable(flag) {
this.flag = flag;
Revocable.__super__.constructor.call(this, S.revocable);
}
Revocable.parse = function(slice) {
return new Revocable(slice.read_uint8());
};
Revocable.prototype._v_to_buffer = function() {
return uint_to_buffer(8, this.flag);
};
return Revocable;
})(SubPacket);
KeyExpirationTime = (function(_super) {
__extends(KeyExpirationTime, _super);
function KeyExpirationTime(t) {
KeyExpirationTime.__super__.constructor.call(this, S.key_expiration_time, t);
}
KeyExpirationTime.parse = function(slice) {
return Time.parse(slice, KeyExpirationTime);
};
return KeyExpirationTime;
})(Time);
PreferredSymmetricAlgorithms = (function(_super) {
__extends(PreferredSymmetricAlgorithms, _super);
function PreferredSymmetricAlgorithms(v) {
PreferredSymmetricAlgorithms.__super__.constructor.call(this, S.preferred_symmetric_algorithms, v);
}
PreferredSymmetricAlgorithms.parse = function(slice) {
return Preference.parse(slice, PreferredSymmetricAlgorithms);
};
return PreferredSymmetricAlgorithms;
})(Preference);
RevocationKey = (function(_super) {
__extends(RevocationKey, _super);
function RevocationKey(key_class, alg, fingerprint) {
this.key_class = key_class;
this.alg = alg;
this.fingerprint = fingerprint;
RevocationKey.__super__.constructor.call(this, S.revocation_key);
}
RevocationKey.parse = function(slice) {
var fp, ka, kc;
kc = slice.read_uint8();
ka = slice.read_uint8();
fp = slice.read_buffer(SHA1.output_length);
return new RevocationKey(kc, ka, fp);
};
RevocationKey.prototype._v_to_buffer = function() {
return Buffer.concat([uint_to_buffer(8, this.key_class), uint_to_buffer(8, this.alg), new Buffer(this.fingerprint)]);
};
return RevocationKey;
})(SubPacket);
Issuer = (function(_super) {
__extends(Issuer, _super);
function Issuer(id) {
this.id = id;
Issuer.__super__.constructor.call(this, S.issuer);
}
Issuer.parse = function(slice) {
return new Issuer(slice.read_buffer(8));
};
Issuer.prototype._v_to_buffer = function() {
return new Buffer(this.id);
};
return Issuer;
})(SubPacket);
NotationData = (function(_super) {
__extends(NotationData, _super);
function NotationData(flags, name, value) {
this.flags = flags;
this.name = name;
this.value = value;
NotationData.__super__.constructor.call(this, S.notation_data);
}
NotationData.parse = function(slice) {
var flags, name, nl, value, vl;
flags = slice.read_uint32();
nl = slice.read_uint16();
vl = slice.read_uint16();
name = slice.read_buffer(nl);
value = slice.read_buffer(vl);
return new NotationData(flags, name, value);
};
NotationData.prototype._v_to_buffer = function() {
return Buffer.concat([uint_to_buffer(32, this.flags), uint_to_buffer(16, this.name.length), uint_to_buffer(16, this.value.length), new Buffer(this.name), new Buffer(this.value)]);
};
return NotationData;
})(SubPacket);
PreferredHashAlgorithms = (function(_super) {
__extends(PreferredHashAlgorithms, _super);
function PreferredHashAlgorithms(v) {
PreferredHashAlgorithms.__super__.constructor.call(this, S.preferred_hash_algorithms, v);
}
PreferredHashAlgorithms.parse = function(slice) {
return Preference.parse(slice, PreferredHashAlgorithms);
};
return PreferredHashAlgorithms;
})(Preference);
PreferredCompressionAlgorithms = (function(_super) {
__extends(PreferredCompressionAlgorithms, _super);
function PreferredCompressionAlgorithms(v) {
PreferredCompressionAlgorithms.__super__.constructor.call(this, S.preferred_compression_algorithms, v);
}
PreferredCompressionAlgorithms.parse = function(slice) {
return Preference.parse(slice, PreferredCompressionAlgorithms);
};
return PreferredCompressionAlgorithms;
})(Preference);
KeyServerPreferences = (function(_super) {
__extends(KeyServerPreferences, _super);
function KeyServerPreferences(v) {
KeyServerPreferences.__super__.constructor.call(this, S.key_server_preferences, v);
}
KeyServerPreferences.parse = function(slice) {
return Preference.parse(slice, KeyServerPreferences);
};
return KeyServerPreferences;
})(Preference);
Features = (function(_super) {
__extends(Features, _super);
function Features(v) {
Features.__super__.constructor.call(this, S.features, v);
}
Features.parse = function(slice) {
return Preference.parse(slice, Features);
};
return Features;
})(Preference);
PreferredKeyServer = (function(_super) {
__extends(PreferredKeyServer, _super);
function PreferredKeyServer(server) {
this.server = server;
PreferredKeyServer.__super__.constructor.call(this, S.preferred_key_server);
}
PreferredKeyServer.parse = function(slice) {
return new PreferredKeyServer(slice.consume_rest_to_buffer());
};
PreferredKeyServer.prototype._v_to_buffer = function() {
return this.server;
};
return PreferredKeyServer;
})(SubPacket);
PrimaryUserId = (function(_super) {
__extends(PrimaryUserId, _super);
function PrimaryUserId(flag) {
this.flag = flag;
PrimaryUserId.__super__.constructor.call(this, S.primary_user_id);
}
PrimaryUserId.parse = function(slice) {
return new PrimaryUserId(slice.read_uint8());
};
PrimaryUserId.prototype._v_to_buffer = function() {
return uint_to_buffer(8, this.flag);
};
return PrimaryUserId;
})(SubPacket);
PolicyURI = (function(_super) {
__extends(PolicyURI, _super);
function PolicyURI(flag) {
this.flag = flag;
PolicyURI.__super__.constructor.call(this, S.policy_uri);
}
PolicyURI.parse = function(slice) {
return new PolicyURI(slice.consume_rest_to_buffer());
};
PolicyURI.prototype._v_to_buffer = function() {
return this.flag;
};
return PolicyURI;
})(SubPacket);
KeyFlags = (function(_super) {
__extends(KeyFlags, _super);
function KeyFlags(v) {
KeyFlags.__super__.constructor.call(this, S.key_flags, v);
}
KeyFlags.parse = function(slice) {
return Preference.parse(slice, KeyFlags);
};
KeyFlags.prototype.all_flags = function() {
var e, ret, _i, _len, _ref3;
ret = 0;
_ref3 = this.v;
for (_i = 0, _len = _ref3.length; _i < _len; _i++) {
e = _ref3[_i];
ret |= e;
}
return ret;
};
return KeyFlags;
})(Preference);
SignersUserID = (function(_super) {
__extends(SignersUserID, _super);
function SignersUserID(uid) {
this.uid = uid;
SignersUserID.__super__.constructor.call(this, S.signers_user_id);
}
SignersUserID.parse = function(slice) {
return new SignersUserID(slice.consume_rest_to_buffer());
};
SignersUserID.prototype._v_to_buffer = function() {
return this.uid;
};
return SignersUserID;
})(SubPacket);
ReasonForRevocation = (function(_super) {
__extends(ReasonForRevocation, _super);
function ReasonForRevocation(flag, reason) {
this.flag = flag;
this.reason = reason;
ReasonForRevocation.__super__.constructor.call(this, S.reason_for_revocation);
}
ReasonForRevocation.parse = function(slice) {
var flag, reason;
flag = slice.read_uint8();
reason = slice.consume_rest_to_buffer();
return new ReasonForRevocation(flag, reason);
};
ReasonForRevocation.prototype._v_to_buffer = function() {
return Buffer.concat([uint_to_buffer(8, this.flag), this.reason]);
};
return ReasonForRevocation;
})(SubPacket);
SignatureTarget = (function(_super) {
__extends(SignatureTarget, _super);
function SignatureTarget(pub_key_alg, hasher, hval) {
this.pub_key_alg = pub_key_alg;
this.hasher = hasher;
this.hval = hval;
SignatureTarget.__super__.constructor.call(this, S.signature_target);
}
SignatureTarget.parse = function(slice) {
var hasher, hval, pka;
pka = slice.read_uint8();
hasher = alloc_or_throw(slice.read_uint8());
hval = slice.read_buffer(hasher.output_length);
return new SignatureTarget(pka, hasher, hval);
};
SignatureTarget.prototype._v_to_buffer = function() {
return Buffer.concat([uint_to_buffer(8, this.pub_key_alg), uint_to_buffer(8, this.hasher.type), this.hval]);
};
return SignatureTarget;
})(SubPacket);
EmbeddedSignature = (function(_super) {
__extends(EmbeddedSignature, _super);
function EmbeddedSignature(_arg) {
this.sig = _arg.sig, this.rawsig = _arg.rawsig;
EmbeddedSignature.__super__.constructor.call(this, S.embedded_signature);
}
EmbeddedSignature.prototype._v_to_buffer = function() {
return this.rawsig;
};
EmbeddedSignature.prototype.to_sig = function() {
return this.sig;
};
EmbeddedSignature.parse = function(slice) {
var rawsig, sig;
rawsig = slice.peek_rest_to_buffer();
sig = Signature.parse(slice);
return new EmbeddedSignature({
sig: sig,
rawsig: rawsig
});
};
return EmbeddedSignature;
})(SubPacket);
exports.Signature = Signature;
Parser = (function() {
function Parser(slice) {
this.slice = slice;
}
Parser.prototype.parse_v2_or_v3 = function(v, klass) {
var o;
if (this.slice.read_uint8() !== 5) {
throw new error("Bad one-octet length");
}
o = {};
o.type = this.slice.read_uint8();
o.time = this.slice.read_uint32();
o.sig_data = this.slice.peek_rest_to_buffer();
o.key_id = this.slice.read_buffer(8);
o.public_key_class = asymmetric.get_class(this.slice.read_uint8());
o.hasher = alloc_or_throw(this.slice.read_uint8());
o.signed_hash_value_hash = this.slice.read_uint16();
o.sig = o.public_key_class.parse_sig(this.slice);
o.version = v;
return new klass(o);
};
Parser.prototype.parse_v4 = function() {
var end, hashed_subpacket_count, o, unhashed_subpacket_count;
o = {};
o.type = this.slice.read_uint8();
o.public_key_class = asymmetric.get_class(this.slice.read_uint8());
o.hasher = alloc_or_throw(this.slice.read_uint8());
hashed_subpacket_count = this.slice.read_uint16();
end = this.slice.i + hashed_subpacket_count;
o.sig_data = this.slice.peek_to_buffer(hashed_subpacket_count);
o.hashed_subpackets = ((function() {
var _results;
_results = [];
while (this.slice.i < end) {
_results.push(this.parse_subpacket());
}
return _results;
}).call(this));
unhashed_subpacket_count = this.slice.read_uint16();
end = this.slice.i + unhashed_subpacket_count;
o.unhashed_subpackets = ((function() {
var _results;
_results = [];
while (this.slice.i < end) {
_results.push(this.parse_subpacket());
}
return _results;
}).call(this));
o.signed_hash_value_hash = this.slice.read_uint16();
o.sig = o.public_key_class.parse_sig(this.slice);
o.version = 4;
return new Signature(o);
};
Parser.prototype.parse_subpacket = function() {
var critical, end, five_byte_len, klass, len, raw_type, ret, type, _ref3;
_ref3 = this.slice.read_v4_length(), len = _ref3[0], five_byte_len = _ref3[1];
raw_type = this.slice.read_uint8();
type = raw_type & 0x7f;
critical = !!(raw_type & 0x80);
end = this.slice.clamp(len - 1);
klass = (function() {
switch (type) {
case S.creation_time:
return CreationTime;
case S.expiration_time:
return ExpirationTime;
case S.exportable_certificate:
return Exportable;
case S.trust_signature:
return Trust;
case S.regular_expression:
return RegularExpression;
case S.revocable:
return Revocable;
case S.key_expiration_time:
return KeyExpirationTime;
case S.preferred_symmetric_algorithms:
return PreferredSymmetricAlgorithms;
case S.revocation_key:
return RevocationKey;
case S.issuer:
return Issuer;
case S.notation_data:
return NotationData;
case S.preferred_hash_algorithms:
return PreferredHashAlgorithms;
case S.preferred_compression_algorithms:
return PreferredCompressionAlgorithms;
case S.key_server_preferences:
return KeyServerPreferences;
case S.preferred_key_server:
return PreferredKeyServer;
case S.primary_user_id:
return PrimaryUserId;
case S.policy_uri:
return PolicyURI;
case S.key_flags:
return KeyFlags;
case S.signers_user_id:
return SignersUserID;
case S.reason_for_revocation:
return ReasonForRevocation;
case S.features:
return Features;
case S.signature_target:
return SignatureTarget;
case S.embedded_signature:
return EmbeddedSignature;
default:
if (type >= S.experimental_low && type <= S.experimental_high) {
return Experimental;
} else {
throw new Error("Unknown signature subpacket: " + type);
}
}
})();
ret = klass.parse(this.slice, type);
ret.set_opts({
critical: critical,
five_byte_len: five_byte_len
});
this.slice.unclamp(end);
return ret;
};
Parser.prototype.parse = function() {
var version;
version = this.slice.read_uint8();
switch (version) {
case C.versions.signature.V2:
return this.parse_v2_or_v3(version, Signature_v2);
case C.versions.signature.V3:
return this.parse_v2_or_v3(version, Signature_v3);
case C.versions.signature.V4:
return this.parse_v4();
default:
throw new Error("Unknown signature version: " + version);
}
};
return Parser;
})();
exports.CreationTime = CreationTime;
exports.KeyFlags = KeyFlags;
exports.KeyExpirationTime = KeyExpirationTime;
exports.PreferredSymmetricAlgorithms = PreferredSymmetricAlgorithms;
exports.PreferredHashAlgorithms = PreferredHashAlgorithms;
exports.Features = Features;
exports.KeyServerPreferences = KeyServerPreferences;
exports.Issuer = Issuer;
exports.EmbeddedSignature = EmbeddedSignature;
exports.PrimaryUserId = PrimaryUserId;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../asymmetric":1,"../../const":5,"../../hash":14,"../../util":70,"../buffer":35,"../util":60,"./base":45,"./packetsigs":51,"assert":75,"buffer":80,"iced-error":115,"iced-runtime":118,"util":114}],54:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var AES, C, Packet, SHA1, SHA256, UserAttribute, bufferify, encrypt, native_rng, parse, triplesec, uint_to_buffer, _ref, _ref1,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
C = require('../../const').openpgp;
triplesec = require('triplesec');
_ref = triplesec.hash, SHA1 = _ref.SHA1, SHA256 = _ref.SHA256;
AES = triplesec.ciphers.AES;
native_rng = triplesec.prng.native_rng;
_ref1 = require('../../util'), bufferify = _ref1.bufferify, uint_to_buffer = _ref1.uint_to_buffer;
encrypt = require('../cfb').encrypt;
Packet = require('./base').Packet;
parse = require('pgp-utils').userid.parse;
UserAttribute = (function(_super) {
__extends(UserAttribute, _super);
function UserAttribute(data) {
this.data = data;
UserAttribute.__super__.constructor.call(this);
}
UserAttribute.prototype.write = function() {
return this.frame_packet(C.packet_tags.user_attribute, this.data);
};
UserAttribute.parse = function(slice) {
return new UserAttribute(slice.consume_rest_to_buffer());
};
UserAttribute.prototype.to_user_attribute = function() {
return this;
};
UserAttribute.prototype.to_signature_payload = function() {
return Buffer.concat([new Buffer([C.signatures.user_attribute]), uint_to_buffer(32, this.data.length), this.data]);
};
return UserAttribute;
})(Packet);
exports.UserAttribute = UserAttribute;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../const":5,"../../util":70,"../cfb":38,"./base":45,"buffer":80,"pgp-utils":163,"triplesec":181}],55:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var AES, C, Packet, SHA1, SHA256, UserID, bufferify, encrypt, native_rng, parse, triplesec, uint_to_buffer, _ref, _ref1,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
C = require('../../const').openpgp;
triplesec = require('triplesec');
_ref = triplesec.hash, SHA1 = _ref.SHA1, SHA256 = _ref.SHA256;
AES = triplesec.ciphers.AES;
native_rng = triplesec.prng.native_rng;
_ref1 = require('../../util'), bufferify = _ref1.bufferify, uint_to_buffer = _ref1.uint_to_buffer;
encrypt = require('../cfb').encrypt;
Packet = require('./base').Packet;
parse = require('pgp-utils').userid.parse;
UserID = (function(_super) {
__extends(UserID, _super);
function UserID(userid, components) {
this.components = components != null ? components : null;
this.userid = bufferify(userid);
if (this.compontents == null) {
this._parse();
}
UserID.__super__.constructor.call(this);
this._time_primary_pair = null;
this.primary = false;
this.most_recent_sig = null;
}
UserID.prototype.utf8 = function() {
return this.userid.toString('utf8');
};
UserID.prototype.write = function() {
return this.frame_packet(C.packet_tags.userid, this.userid);
};
UserID.parse = function(slice) {
return new UserID(slice.consume_rest_to_buffer());
};
UserID.prototype.to_userid = function() {
return this;
};
UserID.prototype.cmp = function(b) {
var x, y;
x = this.utf8();
y = b.utf8();
if (x < y) {
return -1;
} else if (x === y) {
return 0;
} else {
return 1;
}
};
UserID.prototype.to_signature_payload = function() {
return Buffer.concat([new Buffer([C.signatures.userid]), uint_to_buffer(32, this.userid.length), this.userid]);
};
UserID.prototype._parse = function() {
var c;
if ((c = parse(this.utf8())) != null) {
return this.components = c;
}
};
UserID.prototype.get_username = function() {
var _ref2;
return (_ref2 = this.components) != null ? _ref2.username : void 0;
};
UserID.prototype.get_comment = function() {
var _ref2;
return (_ref2 = this.components) != null ? _ref2.comment : void 0;
};
UserID.prototype.get_email = function() {
var _ref2;
return (_ref2 = this.components) != null ? _ref2.email : void 0;
};
UserID.prototype.time_primary_pair = function() {
var max, p, pairs, ret, s, _i, _len;
if (this._time_primary_pair == null) {
pairs = (function() {
var _i, _len, _ref2, _ref3, _results;
_ref2 = this.get_psc().get_self_sigs();
_results = [];
for (_i = 0, _len = _ref2.length; _i < _len; _i++) {
s = _ref2[_i];
_results.push(s != null ? (_ref3 = s.sig) != null ? _ref3.time_primary_pair() : void 0 : void 0);
}
return _results;
}).call(this);
max = null;
ret = [null, null];
for (_i = 0, _len = pairs.length; _i < _len; _i++) {
p = pairs[_i];
if (!(p != null)) {
continue;
}
if (p[0] && ((ret[0] == null) || (ret[0] < p[0]))) {
ret[0] = p[0];
}
if (p[1] && ((ret[1] == null) || (ret[1] < p[0]))) {
ret[1] = p[0];
}
}
this._time_primary_pair = ret;
this.most_recent_sig = ret[0];
}
return this._time_primary_pair;
};
UserID.make = function(components) {
var c, comment, userid;
comment = (c = components.comment) != null ? "(" + c + ") " : "";
userid = "" + components.username + " " + comment + "<" + components.email + ">";
return new UserID(userid, components);
};
UserID.prototype.get_framed_signature_output = function() {
var _ref2, _ref3, _ref4;
return (_ref2 = this.get_psc()) != null ? (_ref3 = _ref2.get_self_sig()) != null ? (_ref4 = _ref3.sig) != null ? _ref4.get_framed_output() : void 0 : void 0 : void 0;
};
return UserID;
})(Packet);
exports.UserID = UserID;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../../const":5,"../../util":70,"../cfb":38,"./base":45,"buffer":80,"pgp-utils":163,"triplesec":181}],56:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, Compressed, Generic, KeyMaterial, Literal, MessageParser, OnePassSignature, PKESK, PacketParser, SEIPD, Signature, SlicerBuffer, UserAttribute, UserID, inspect, parse, util, _ref;
util = require('../util');
SlicerBuffer = require('./buffer').SlicerBuffer;
C = require('../const').openpgp;
KeyMaterial = require('./packet/keymaterial').KeyMaterial;
Signature = require('./packet/signature').Signature;
_ref = require('./packet/sess'), SEIPD = _ref.SEIPD, PKESK = _ref.PKESK;
UserID = require('./packet/userid').UserID;
UserAttribute = require('./packet/user_attribute').UserAttribute;
Compressed = require('./packet/compressed').Compressed;
Generic = require('./packet/generic').Generic;
OnePassSignature = require('./packet/one_pass_sig').OnePassSignature;
Literal = require('./packet/literal').Literal;
inspect = require('util').inspect;
MessageParser = (function() {
function MessageParser(slice) {
this.slice = slice;
}
MessageParser.prototype.parse = function() {
var _results;
_results = [];
while (this.slice.rem()) {
_results.push(this.parse_packet());
}
return _results;
};
MessageParser.prototype.parse_packet = function() {
return (new PacketParser(this.slice)).parse();
};
return MessageParser;
})();
PacketParser = (function() {
function PacketParser(slice) {
this.slice = slice;
this.body = null;
this.real_packet_len = null;
this.tag = null;
this.len = null;
this.header_len = null;
}
PacketParser.prototype.parse_header = function() {
this.parse_tag_and_len();
this.header_len || (this.header_len = this.slice.offset());
this.body || (this.body = new SlicerBuffer(this.slice.read_buffer(this.len)));
this.real_packet_len || (this.real_packet_len = this.len);
return this.slice.unclamp();
};
PacketParser.prototype.parse = function() {
var ret;
this.parse_header();
ret = this.parse_body();
return ret;
};
PacketParser.prototype.parse_body = function() {
var packet, pt, raw, sb;
pt = C.packet_tags;
sb = this.body;
raw = sb.peek_rest_to_buffer();
packet = (function() {
switch (this.tag) {
case pt.PKESK:
return PKESK.parse(sb);
case pt.one_pass_sig:
return OnePassSignature.parse(sb);
case pt.secret_key:
return KeyMaterial.parse_private_key(sb, {
subkey: false
});
case pt.secret_subkey:
return KeyMaterial.parse_private_key(sb, {
subkey: true
});
case pt.public_key:
return KeyMaterial.parse_public_key(sb, {
subkey: false
});
case pt.public_subkey:
return KeyMaterial.parse_public_key(sb, {
subkey: true
});
case pt.signature:
return Signature.parse(sb);
case pt.userid:
return UserID.parse(sb);
case pt.user_attribute:
return UserAttribute.parse(sb);
case pt.SEIPD:
return SEIPD.parse(sb);
case pt.literal:
return Literal.parse(sb);
case pt.compressed:
return Compressed.parse(sb);
default:
return new Generic(this.tag, sb);
}
}).call(this);
packet.set({
tag: this.tag,
real_packet_len: this.real_packet_len,
header_len: this.header_len,
raw: raw
});
return packet;
};
PacketParser.prototype.parse_tag_and_len = function() {
var c;
if (this.slice.len() < 2 || ((c = this.slice.read_uint8()) & 0x80) === 0) {
throw new Error("This doesn't look like a binary PGP packet (c=" + c + ")");
}
if ((c & 0x40) === 0) {
return this.parse_tag_and_len_old(c);
} else {
return this.parse_tag_and_len_new(c);
}
};
PacketParser.prototype.parse_tag_and_len_old = function(c) {
this.tag = (c & 0x3f) >> 2;
return this.len = (function() {
switch (c & 0x03) {
case 0:
return this.slice.read_uint8();
case 1:
return this.slice.read_uint16();
case 2:
return this.slice.read_uint32();
case 3:
return this.slice.rem();
}
}).call(this);
};
PacketParser.prototype.parse_tag_and_len_new = function(c) {
var ret;
this.tag = c & 0x3f;
ret = this.parse_tag_len_new();
return ret;
};
PacketParser.prototype.parse_tag_len_new = function() {
var c, d, go, lastlen, packet_length, segments;
go = true;
segments = [];
this.len = 0;
lastlen = 0;
while (go) {
go = false;
c = this.slice.read_uint8();
lastlen = c < 192 ? c : c === 255 ? this.slice.read_uint32() : c < 224 ? (d = this.slice.read_uint8(), ((c - 192) << 8) + (d + 192)) : (this.header_len || (this.header_len = this.slice.offset()), packet_length = 1 << (c & 0x1f), segments.push(this.slice.read_buffer(packet_length)), go = true, packet_length);
this.len += lastlen;
}
if (segments.length) {
segments.push(this.slice.read_buffer(lastlen));
this.body = new SlicerBuffer(Buffer.concat(segments));
this.len = this.body.length;
return this.real_packet_len = this.slice.offset();
}
};
return PacketParser;
})();
exports.parse = parse = function(buf) {
return util.katch(function() {
return (new MessageParser(new SlicerBuffer(buf))).parse();
});
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../util":70,"./buffer":35,"./packet/compressed":46,"./packet/generic":47,"./packet/keymaterial":48,"./packet/literal":49,"./packet/one_pass_sig":50,"./packet/sess":52,"./packet/signature":53,"./packet/user_attribute":54,"./packet/userid":55,"buffer":80,"util":114}],57:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, KeyBlock, Message, OPS, Warnings, armor, athrow, bufeq_secure, do_message, hashmod, iced, import_key_pgp, katch, konst, make_esc, parse, unix_time, util, verify_clearsign, verify_detached, __iced_k, __iced_k_noop, _ref;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
make_esc = require('iced-error').make_esc;
OPS = require('../keyfetch').OPS;
konst = require('../const');
C = konst.openpgp;
_ref = require('../util'), katch = _ref.katch, unix_time = _ref.unix_time, athrow = _ref.athrow, Warnings = _ref.Warnings, bufeq_secure = _ref.bufeq_secure;
parse = require('./parser').parse;
import_key_pgp = require('../symmetric').import_key_pgp;
util = require('util');
armor = require('./armor');
hashmod = require('../hash');
verify_clearsign = require('./clearsign').verify;
verify_detached = require('./detachsign').verify;
KeyBlock = (function() {
function KeyBlock(packets, opts) {
this.packets = packets;
this.verified_signatures = [];
this.subkeys = [];
this.primary = null;
this.userids = [];
this.user_attributes = [];
this.warnings = new Warnings();
this.opts = opts || {};
}
KeyBlock.prototype.to_obj = function() {
return {
subkeys: this.subkeys,
primary: this.primary,
userids: this.userids
};
};
KeyBlock.prototype._extract_keys = function() {
var err, i, p, _i, _len, _ref1;
err = null;
if (!this.packets.length) {
err = new Error("No packets; cannot extract a key");
} else if (!(this.primary = this.packets[0]).is_primary()) {
err = new Error("First packet must be the primary key");
} else {
_ref1 = this.packets.slice(1);
for (i = _i = 0, _len = _ref1.length; _i < _len; i = ++_i) {
p = _ref1[i];
if (p.is_key_material() && (err == null)) {
if (p.key.is_toxic()) {
this.warnings.push("Ignoring toxic subkey (ElGamal Encrypt+Sign)");
} else if (!p.is_primary()) {
this.subkeys.push(p);
} else if (bufeq_secure(p.get_fingerprint(), this.primary.get_fingerprint())) {
p.set_duplicate_primary();
} else {
err = new Error("cannot have 2 primary keys");
}
}
}
}
return err;
};
KeyBlock.prototype._check_keys = function() {
return this._check_primary() || this._check_subkeys();
};
KeyBlock.prototype._check_primary = function() {
var err;
return err = !this.primary.is_self_signed() ? new Error("no valid primary key self-signature") : (this.userids = this.primary.get_signed_userids()).length === 0 ? new Error("no valid Userid signed into key") : (this.user_attributes = this.primary.get_signed_user_attributes(), null);
};
KeyBlock.prototype._check_subkeys = function() {
var err, i, k, msg, subkeys, _i, _len;
subkeys = this.subkeys;
err = null;
this.subkeys = [];
for (i = _i = 0, _len = subkeys.length; _i < _len; i = ++_i) {
k = subkeys[i];
if (err == null) {
if (k.is_signed_subkey_of(this.primary)) {
this.subkeys.push(k);
} else {
msg = "Subkey " + i + " was invalid; discarding";
this.warnings.push(msg);
}
}
}
return err;
};
KeyBlock.prototype.process = function(cb) {
var err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = this._extract_keys();
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "KeyBlock.process"
});
_this._verify_sigs(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 86
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
var _ref1;
if (!((err != null) || ((_ref1 = _this.opts) != null ? _ref1.no_check_keys : void 0))) {
err = _this._check_keys();
}
return cb(err);
};
})(this));
};
KeyBlock.prototype._verify_sigs = function(cb) {
var err, i, iid, msg, n_sigs, p, pid, tmp, working_set, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
working_set = [];
n_sigs = 0;
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref1, _results, _while;
_ref1 = _this.packets.slice(1);
_len = _ref1.length;
i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(i < _len)) {
return _break();
} else {
p = _ref1[i];
if (err == null) {
(function(__iced_k) {
if (!p.is_signature()) {
if (n_sigs > 0) {
n_sigs = 0;
working_set = [];
}
return __iced_k(!p.is_duplicate_primary() ? working_set.push(p) : void 0);
} else {
(function(__iced_k) {
if (!bufeq_secure((iid = p.get_issuer_key_id()), (pid = _this.primary.get_key_id()))) {
n_sigs++;
return __iced_k(_this.warnings.push("Skipping signature by another issuer: " + (iid != null ? iid.toString('hex') : void 0) + " != " + (pid != null ? pid.toString('hex') : void 0)));
} else {
n_sigs++;
p.key = _this.primary.key;
p.primary = _this.primary;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "KeyBlock._verify_sigs"
});
p.verify(working_set, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return tmp = arguments[0];
};
})(),
lineno: 110
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(typeof tmp !== "undefined" && tmp !== null ? (msg = "Signature failure in packet " + i + ": " + tmp.message, _this.warnings.push(msg)) : _this.verified_signatures.push(p));
});
}
})(__iced_k);
}
})(_next);
} else {
return _continue();
}
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
return KeyBlock;
})();
Message = (function() {
function Message(_arg) {
this.keyfetch = _arg.keyfetch, this.data_fn = _arg.data_fn, this.data = _arg.data, this.strict = _arg.strict;
this.literals = [];
this.enc_data_packet = null;
this.warnings = new Warnings();
}
Message.prototype._get_session_key = function(cb) {
var enc, err, esk_packets, fingerprint, index, key_ids, key_material, km, p, packet, pkcs5, privk, sesskey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key_ids = [];
esk_packets = [];
err = null;
pkcs5 = false;
key_ids = (function() {
var _results;
_results = [];
while (this.packets.length && (p = this.packets[0].to_esk_packet())) {
esk_packets.push(p);
this.packets.shift();
_results.push(p.get_key_id());
}
return _results;
}).call(this);
(function(_this) {
return (function(__iced_k) {
if (key_ids.length) {
enc = true;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._get_session_key"
});
_this.keyfetch.fetch(key_ids, konst.ops.decrypt, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
km = arguments[1];
return index = arguments[2];
};
})(),
lineno: 151
}));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (err == null) {
packet = esk_packets[index];
key_material = km.find_pgp_key_material(key_ids[index]);
fingerprint = key_material.get_fingerprint();
privk = key_material.key;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._get_session_key"
});
privk.decrypt_and_unpad(packet.ekey, {
fingerprint: fingerprint
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
sesskey = arguments[1];
return pkcs5 = arguments[2];
};
})(),
lineno: 157
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(err == null ? _this.encryption_subkey = key_material : void 0);
});
} else {
return __iced_k();
}
})(__iced_k);
});
} else {
return __iced_k(enc = false);
}
});
})(this)((function(_this) {
return function() {
return cb(err, enc, sesskey, pkcs5);
};
})(this));
};
Message.prototype._find_encrypted_data = function(cb) {
var err, ret;
err = ret = null;
if (this.packets.length && (ret = this.packets[0].to_enc_data_packet())) {
this.packets.pop();
} else {
err = new Error("Could not find encrypted data packet");
}
return cb(err, ret);
};
Message.prototype._decrypt_with_session_key = function(sesskey, edat, pkcs5, cb) {
var cipher, err, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref1;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
_ref1 = katch(function() {
return import_key_pgp(sesskey, pkcs5);
}), err = _ref1[0], cipher = _ref1[1];
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._decrypt_with_session_key"
});
edat.decrypt({
cipher: cipher
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 179
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
Message.prototype._parse = function(raw, cb) {
var err, packets, _ref1;
_ref1 = parse(raw), err = _ref1[0], packets = _ref1[1];
return cb(err, packets);
};
Message.prototype._decrypt = function(cb) {
var edat, err, esc, is_enc, packets, pkcs5, plaintext, sesskey, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
esc = make_esc(cb, "Message::decrypt");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._decrypt"
});
_this._get_session_key(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
is_enc = arguments[0];
sesskey = arguments[1];
return pkcs5 = arguments[2];
};
})(),
lineno: 193
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (is_enc) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._decrypt"
});
_this._find_encrypted_data(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return edat = arguments[0];
};
})(),
lineno: 195
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._decrypt"
});
_this._decrypt_with_session_key(sesskey, edat, pkcs5, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return plaintext = arguments[0];
};
})(),
lineno: 196
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._decrypt"
});
_this._parse(plaintext, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return packets = arguments[0];
};
})(),
lineno: 197
})));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(_this.packets = packets.concat(_this.packets));
});
});
});
} else {
return __iced_k();
}
})(function() {
return cb(err);
});
};
})(this));
};
Message.prototype._inflate = function(cb) {
var esc, inflated, p, packets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
packets = [];
esc = make_esc(cb, "Message::_inflate");
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref1, _results, _while;
_ref1 = _this.packets;
_len = _ref1.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
p = _ref1[_i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._inflate"
});
p.inflate(esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return inflated = arguments[0];
};
})(),
lineno: 207
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (typeof inflated !== "undefined" && inflated !== null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._inflate"
});
_this._parse(inflated, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return p = arguments[0];
};
})(),
lineno: 209
})));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(packets.push.apply(packets, p));
});
} else {
return __iced_k(packets.push(p));
}
})(_next);
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
_this.packets = packets;
return cb(null);
};
})(this));
};
Message.prototype._frame_signatures = function() {
var o, p, payload, ret, stack, _i, _j, _len, _len1, _ref1;
ret = [];
stack = [];
payload = [];
_ref1 = this.packets;
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
p = _ref1[_i];
if (p.tag === C.packet_tags.one_pass_sig) {
stack.push({
open: p
});
} else if (!stack.length) {
} else if (p.tag === C.packet_tags.signature) {
o = stack.pop();
o.close = p;
ret.push(o);
} else {
payload.push(p);
}
}
for (_j = 0, _len1 = ret.length; _j < _len1; _j++) {
o = ret[_j];
o.payload = payload;
}
return ret;
};
Message.prototype._verify_sig = function(sig, cb) {
var a, b, err, i, key_material, km, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = null;
if (!bufeq_secure((a = sig.open.key_id), (b = sig.close.get_key_id()))) {
err = new Error("signature mismatch open v close: " + (a != null ? a.toString('hex') : void 0) + " != " + (b != null ? b.toString('hex') : void 0));
}
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._verify_sig"
});
_this.keyfetch.fetch([a], konst.ops.verify, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
km = arguments[1];
return i = arguments[2];
};
})(),
lineno: 247
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
key_material = km.find_pgp_key_material(a);
sig.close.key = key_material.key;
sig.close.key_manager = km;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._verify_sig"
});
sig.close.verify(sig.payload, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 259
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(!_this.strict ? (_this.warnings.push("Problem fetching key " + (a.toString('hex')) + ": " + (err.toString())), err = null) : void 0);
}
})(function() {
return cb(err);
});
};
})(this));
};
Message.prototype._verify = function(cb) {
var esc, sig, sigs, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Message::_verify_sigs");
sigs = this._frame_signatures();
(function(_this) {
return (function(__iced_k) {
var _i, _len, _ref1, _results, _while;
_ref1 = sigs;
_len = _ref1.length;
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _len)) {
return _break();
} else {
sig = _ref1[_i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._verify"
});
_this._verify_sig(sig, esc(__iced_deferrals.defer({
lineno: 273
})));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(null);
};
})(this));
};
Message.prototype.collect_literals = function() {
var p, _i, _len, _ref1, _results;
_ref1 = this.packets;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
p = _ref1[_i];
if (p.tag === C.packet_tags.literal) {
_results.push(p);
}
}
return _results;
};
Message.prototype._process_generic = function(_arg, cb) {
var esc, packets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
packets = _arg.packets;
this.packets = packets;
esc = make_esc(cb, "Message:process");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._process_generic"
});
_this._decrypt(esc(__iced_deferrals.defer({
lineno: 286
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._process_generic"
});
_this._inflate(esc(__iced_deferrals.defer({
lineno: 287
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._process_generic"
});
_this._verify(esc(__iced_deferrals.defer({
lineno: 288
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, _this.collect_literals());
});
});
};
})(this));
};
Message.prototype._verify_clearsign = function(_arg, cb) {
var clearsign, err, literal, packets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
packets = _arg.packets, clearsign = _arg.clearsign;
(function(_this) {
return (function(__iced_k) {
if (clearsign == null) {
return __iced_k(err = new Error("no clearsign data found"));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._verify_clearsign"
});
verify_clearsign({
packets: packets,
clearsign: clearsign,
keyfetch: _this.keyfetch
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literal = arguments[1];
};
})(),
lineno: 297
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err, [literal]);
};
})(this));
};
Message.prototype.parse_and_process = function(msg, cb) {
var esc, literals, packets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "Message::parse_and_process");
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message.parse_and_process"
});
_this._parse(msg.body, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return packets = arguments[0];
};
})(),
lineno: 304
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message.parse_and_process"
});
_this._process({
msg: msg,
packets: packets
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return literals = arguments[0];
};
})(),
lineno: 305
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, literals);
});
};
})(this));
};
Message.prototype._verify_signature = function(_arg, cb) {
var err, literals, packets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
packets = _arg.packets;
(function(_this) {
return (function(__iced_k) {
if (!((_this.data != null) || (_this.data_fn != null))) {
return __iced_k(err = new Error("Cannot verify detached signature without data input"));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._verify_signature"
});
verify_detached({
packets: packets,
data: _this.data,
data_fn: _this.data_fn,
keyfetch: _this.keyfetch
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literals = arguments[1];
};
})(),
lineno: 314
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err, literals);
};
})(this));
};
Message.prototype._process = function(_arg, cb) {
var err, literals, msg, packets, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
msg = _arg.msg, packets = _arg.packets;
msg.type || (msg.type = C.message_types.generic);
(function(_this) {
return (function(__iced_k) {
switch (msg.type) {
case C.message_types.generic:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._process"
});
_this._process_generic({
packets: packets
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literals = arguments[1];
};
})(),
lineno: 323
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
case C.message_types.clearsign:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._process"
});
_this._verify_clearsign({
packets: packets,
clearsign: msg.clearsign
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literals = arguments[1];
};
})(),
lineno: 325
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
case C.message_types.signature:
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced",
funcname: "Message._process"
});
_this._verify_signature({
packets: packets
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literals = arguments[1];
};
})(),
lineno: 327
}));
__iced_deferrals._fulfill();
})(__iced_k);
break;
default:
return __iced_k(err = new Error("Needed a 'generic', 'clearsign', or 'signature' PGP message, got " + msg.type));
}
});
})(this)((function(_this) {
return function() {
return cb(err, literals);
};
})(this));
};
return Message;
})();
exports.KeyBlock = KeyBlock;
exports.Message = Message;
exports.do_message = do_message = function(_arg, cb) {
var armored, data, data_fn, err, esk, keyfetch, literals, msg, msg_type, proc, raw, strict, warnings, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref1;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
armored = _arg.armored, raw = _arg.raw, msg_type = _arg.msg_type, keyfetch = _arg.keyfetch, data_fn = _arg.data_fn, data = _arg.data, strict = _arg.strict;
literals = null;
err = msg = warnings = esk = null;
if (armored != null) {
_ref1 = armor.decode(armored), err = _ref1[0], msg = _ref1[1];
} else if (raw != null) {
msg_type || (msg_type = C.message_types.generic);
msg = {
body: raw,
type: msg_type
};
} else {
err = new Error("No input to do_message; need either 'armored' or 'raw' input");
}
(function(_this) {
return (function(__iced_k) {
if (err == null) {
if (strict == null) {
strict = true;
}
proc = new Message({
keyfetch: keyfetch,
data_fn: data_fn,
data: data,
strict: strict
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/processor.iced"
});
proc.parse_and_process(msg, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return literals = arguments[1];
};
})(),
lineno: 373
}));
__iced_deferrals._fulfill();
})(function() {
warnings = proc.warnings;
return __iced_k(esk = proc.encryption_subkey);
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err, literals, warnings, esk);
};
})(this));
};
}).call(this);
},{"../const":5,"../hash":14,"../keyfetch":24,"../symmetric":68,"../util":70,"./armor":33,"./clearsign":39,"./detachsign":40,"./parser":56,"iced-error":115,"iced-runtime":118,"util":114}],58:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, S2K, SHA256, SecretKeyMaterial, alloc, iterated_s2k, streamers, triplesec, _iterated_s2k_cache, _ref;
triplesec = require('triplesec');
C = require('../const').openpgp;
_ref = require('../hash'), alloc = _ref.alloc, SHA256 = _ref.SHA256, streamers = _ref.streamers;
S2K = (function() {
S2K.prototype._count = function(c, bias) {
return (16 + (c & 15)) << ((c >> 4) + bias);
};
function S2K() {
this.hash = SHA256;
this.streamer = streamers.SHA256();
}
S2K.prototype.set_hash_algorithm = function(which) {
if ((this.hash = alloc(which)) != null) {
return this.streamer = streamers[this.hash.algname]();
} else {
console.warn("No such hash: " + which + "; defaulting to SHA-256");
this.hash = SHA256;
return this.streamer = streamers.SHA256();
}
};
S2K.prototype.read = function(slice) {
var c;
this.type = slice.read_uint8();
switch (this.type) {
case C.s2k.plain:
this.set_hash_algorithm(slice.read_uint8());
break;
case C.s2k.salt:
this.set_hash_algorithm(slice.read_uint8());
this.salt = slice.read_buffer(8);
break;
case C.s2k.salt_iter:
this.set_hash_algorithm(slice.read_uint8());
this.salt = slice.read_buffer(8);
this.EXPBIAS = 6;
c = slice.read_uint8();
this.count = this._count(c, this.EXPBIAS);
break;
case C.s2k.gnu:
this.read_gnu_extensions(slice);
break;
default:
throw new Error("unknown s2k type! " + this.type);
}
return this;
};
S2K.prototype.read_gnu_extensions = function(slice) {
var buf, gnu_ext_type, id, version;
version = slice.read_uint8();
if ((id = (buf = slice.read_buffer(3)).toString('utf8')) === "GNU") {
gnu_ext_type = slice.read_uint8() + 1000;
switch (gnu_ext_type) {
case 1001:
return this.type = C.s2k.gnu_dummy;
default:
throw new ("unknown s2k gnu protection mode: " + gnu_ext_type);
}
} else {
throw new Error("Malformed GNU-extension: " + ext);
}
};
S2K.prototype.write = function(passphrase, salt, c, keysize) {
var type;
this.type = type = 3;
this.salt = salt;
this.count = this._count(c, 6);
this.s2kLength = 10;
return this.produce_key(passphrase, keysize);
};
S2K.prototype.is_dummy = function() {
return this.type === C.s2k.gnu_dummy;
};
S2K.prototype.produce_key = function(passphrase, numBytes) {
var key, key2, prefix, ret, seed;
if (numBytes == null) {
numBytes = 16;
}
ret = (function() {
switch (this.type) {
case C.s2k.plain:
return this.hash(passphrase);
case C.s2k.salt:
return this.hash(Buffer.concat([this.salt, passphrase]));
case C.s2k.salt_iter:
seed = Buffer.concat([this.salt, passphrase]);
key = iterated_s2k({
alg: this.hash.algname,
seed: seed,
count: this.count
});
if ((numBytes != null) && (numBytes === 24 || numBytes === 32)) {
prefix = new Buffer([0]);
key2 = iterated_s2k({
alg: this.hash.algname,
seed: seed,
count: this.count,
prefix: prefix
});
return Buffer.concat([key, key2]);
} else {
return key;
}
break;
default:
return null;
}
}).call(this);
return ret.slice(0, numBytes);
};
return S2K;
})();
_iterated_s2k_cache = {};
iterated_s2k = function(_arg) {
var alg, bigbuf, count, i, k, n, prefix, rem, rembuf, ret, seed, streamer, tot, val;
alg = _arg.alg, seed = _arg.seed, count = _arg.count, prefix = _arg.prefix;
k = "" + alg + "-" + (seed.toString('base64')) + "-" + count;
if (prefix != null) {
k += "-" + (prefix.toString('base64'));
}
if ((val = _iterated_s2k_cache[k]) != null) {
return val;
}
streamer = streamers[alg]();
if (prefix != null) {
streamer.update(prefix);
}
bigbuf = Buffer.concat((function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 4096; i = ++_i) {
_results.push(seed);
}
return _results;
})());
tot = 0;
while (tot + bigbuf.length <= count) {
streamer.update(bigbuf);
tot += bigbuf.length;
}
rem = count - tot;
n = Math.ceil(rem / seed.length);
rembuf = Buffer.concat((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= n ? _i < n : _i > n; i = 0 <= n ? ++_i : --_i) {
_results.push(seed);
}
return _results;
})());
ret = streamer(rembuf.slice(0, rem));
_iterated_s2k_cache[k] = ret;
return ret;
};
SecretKeyMaterial = (function() {
function SecretKeyMaterial() {
this.s2k_convention = null;
this.s2k = null;
this.iv = null;
this.cipher = null;
this.payload = null;
}
SecretKeyMaterial.prototype.is_dummy = function() {
return (this.s2k != null) && this.s2k.is_dummy();
};
SecretKeyMaterial.prototype.has_private = function() {
return !this.is_dummy();
};
SecretKeyMaterial.prototype.is_locked = function() {
return (this.s2k_convention !== C.s2k_convention.none) && !(this.is_dummy());
};
return SecretKeyMaterial;
})();
exports.S2K = S2K;
exports.SecretKeyMaterial = SecretKeyMaterial;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"../hash":14,"buffer":80,"triplesec":181}],59:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, SignatureEngine, burn, decode, iced, make_esc, processor, __iced_k, __iced_k_noop;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
make_esc = require('iced-error').make_esc;
burn = require('./burner').burn;
processor = require('./processor');
decode = require('./armor').decode;
C = require('../const');
exports.SignatureEngine = SignatureEngine = (function() {
function SignatureEngine(_arg) {
this.km = _arg.km;
}
SignatureEngine.prototype.get_km = function() {
return this.km;
};
SignatureEngine.prototype.box = function(msg, cb) {
var err, out, signing_key, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
out = {
type: "pgp"
};
(function(_this) {
return (function(__iced_k) {
if ((signing_key = _this.km.find_signing_pgp_key()) != null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/sigeng.iced",
funcname: "SignatureEngine.box"
});
burn({
msg: msg,
signing_key: signing_key
}, __iced_deferrals.defer({
assign_fn: (function(__slot_1, __slot_2) {
return function() {
err = arguments[0];
__slot_1.pgp = arguments[1];
return __slot_2.raw = arguments[2];
};
})(out, out),
lineno: 21
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(typeof err === "undefined" || err === null ? out.armored = out.pgp : void 0);
});
} else {
return __iced_k(err = new Error("No signing key found"));
}
});
})(this)((function(_this) {
return function() {
return cb(err, out);
};
})(this));
};
SignatureEngine.prototype.decode = function(armored, cb) {
var err, msg, mt, _ref;
_ref = decode(armored), err = _ref[0], msg = _ref[1];
mt = C.openpgp.message_types;
if ((err == null) && (msg.type !== mt.generic)) {
err = new Error("wrong message type; expected a generic message; got " + msg.type);
}
return cb(err, msg);
};
SignatureEngine.prototype.unbox = function(msg, cb) {
var eng, esc, literals, msg, payload, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
esc = make_esc(cb, "SignatureEngine::unbox");
(function(_this) {
return (function(__iced_k) {
if (typeof msg === 'string') {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/sigeng.iced",
funcname: "SignatureEngine.unbox"
});
_this.decode(msg, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return msg = arguments[0];
};
})(),
lineno: 40
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
eng = new processor.Message({
keyfetch: _this.km
});
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/sigeng.iced",
funcname: "SignatureEngine.unbox"
});
eng.parse_and_process({
body: msg.body
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return literals = arguments[0];
};
})(),
lineno: 42
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/openpgp/sigeng.iced",
funcname: "SignatureEngine.unbox"
});
_this._check_result(literals, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return payload = arguments[0];
};
})(),
lineno: 43
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, payload, msg.body);
});
});
};
})(this));
};
SignatureEngine.prototype._check_result = function(literals, cb) {
var b, err, l, n, payload, sw, _ref;
err = payload = null;
if ((n = literals.length) !== 1 || ((l = literals[0]) == null)) {
err = new Error("Expected only one pgp literal; got " + n);
} else if ((sw = (_ref = l.get_data_signer()) != null ? _ref.sig : void 0) == null) {
err = new Error("Expected a signature on the payload message");
} else if ((this.km.find_pgp_key((b = sw.get_key_id()))) == null) {
err = new Error("Failed sanity check; didn't have a key for '" + (b.toString('hex')) + "'");
} else {
payload = l.data;
}
return cb(err, payload);
};
return SignatureEngine;
})();
}).call(this);
},{"../const":5,"./armor":33,"./burner":36,"./processor":57,"iced-error":115,"iced-runtime":118}],60:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, calc_checksum, encode_length, ops_to_keyflags;
C = require('../const');
exports.make_time_packet = function(d) {
var b;
d || (d = Math.floor(Date.now() / 1000));
b = new Buffer(4);
b.writeUInt32BE(d, 0);
return b;
};
exports.calc_checksum = calc_checksum = function(text) {
var i, ret, _i, _ref;
ret = 0;
for (i = _i = 0, _ref = text.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
ret = (ret + text.readUInt8(i)) % 65536;
}
return ret;
};
exports.encode_length = encode_length = function(l, five_byte) {
var ret;
if (five_byte == null) {
five_byte = false;
}
ret = null;
if (l >= 8384 || five_byte) {
ret = new Buffer(5);
ret.writeUInt8(0xff, 0);
ret.writeUInt32BE(l, 1);
} else if (l < 192) {
ret = new Buffer(1);
ret.writeUInt8(l, 0);
} else if (l >= 192 && l < 8384) {
ret = new Buffer(2);
ret.writeUInt16BE((l - 192) + (192 << 8), 0);
}
return ret;
};
exports.ops_to_keyflags = ops_to_keyflags = function(ops) {
var out;
out = 0;
if (ops & C.ops.encrypt) {
out |= C.openpgp.key_flags.encrypt_comm;
}
if (ops & C.ops.decrypt) {
out |= C.openpgp.key_flags.encrypt_comm;
}
if (ops & C.ops.verify) {
out |= C.openpgp.key_flags.sign_data;
}
if (ops & C.ops.sign) {
out |= C.openpgp.key_flags.sign_data;
}
return out;
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"../const":5,"buffer":80}],61:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var Base, C, iced, konst, __iced_k, __iced_k_noop;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
konst = require('../const');
C = konst.openpgp;
exports.Base = Base = (function() {
function Base(_arg) {
this.packets = _arg.packets, this.keyfetch = _arg.keyfetch;
this._sig = null;
}
Base.prototype._find_signature = function(cb) {
var err, n;
err = (n = this.packets.length) !== 1 ? new Error("Expected one signature packet; got " + n) : (this._sig = this.packets[0]).tag !== C.packet_tags.signature ? new Error("Expected a signature packet; but got type=" + this.packets[0].tag) : null;
return cb(err);
};
Base.prototype._fetch_key = function(cb) {
var err, i, key_id, keymat, km, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key_id = this._sig.get_key_id();
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/openpgp/verifier.iced",
funcname: "Base._fetch_key"
});
_this.keyfetch.fetch([key_id], konst.ops.verify, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
km = arguments[1];
return i = arguments[2];
};
})(),
lineno: 28
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
keymat = km.find_pgp_key_material(key_id);
_this._sig.key = keymat.key;
_this._sig.key_manager = km;
}
return cb(err);
};
})(this));
};
return Base;
})();
}).call(this);
},{"../const":5,"iced-runtime":118}],62:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var C, SHA512, SRF, bufeq_secure, buffer_to_ui8a, eme_random, emsa_pkcs1_decode, emsa_pkcs1_encode, hash_headers, iced, nbs, __iced_k, __iced_k_noop, _ref;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
SHA512 = require('./hash').SHA512;
C = require('./const').openpgp;
nbs = require('./bn').nbs;
_ref = require('./util'), buffer_to_ui8a = _ref.buffer_to_ui8a, bufeq_secure = _ref.bufeq_secure;
SRF = require('./rand').SRF;
hash_headers = {
MD5: [0x30, 0x20, 0x30, 0x0C, 0x06, 0x08, 0x2A, 0x86, 0x48, 0x86, 0xF7, 0x0D, 0x02, 0x05, 0x05, 0x00, 0x04, 0x10],
SHA1: [0x30, 0x21, 0x30, 0x09, 0x06, 0x05, 0x2b, 0x0e, 0x03, 0x02, 0x1a, 0x05, 0x00, 0x04, 0x14],
SHA224: [0x30, 0x2d, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x04, 0x05, 0x00, 0x04, 0x1C],
SHA256: [0x30, 0x31, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x05, 0x00, 0x04, 0x20],
SHA384: [0x30, 0x41, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x05, 0x00, 0x04, 0x30],
SHA512: [0x30, 0x51, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x05, 0x00, 0x04, 0x40]
};
exports.emsa_pkcs1_encode = emsa_pkcs1_encode = function(hashed_data, len, opts) {
var buf, hasher, headers, i, n;
if (opts == null) {
opts = {};
}
hasher = opts.hasher || SHA512;
headers = hash_headers[hasher.algname];
n = len - headers.length - 3 - hasher.output_length;
buf = Buffer.concat([
new Buffer([0x00, 0x01]), new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= n ? _i < n : _i > n; i = 0 <= n ? ++_i : --_i) {
_results.push(0xff);
}
return _results;
})()), new Buffer([0x00]), new Buffer(headers), hashed_data
]);
return nbs(buffer_to_ui8a(buf), 256);
};
exports.emsa_pkcs1_decode = emsa_pkcs1_decode = function(v, hasher) {
var err, h, header, i, ret;
err = ret = null;
i = 0;
if (v.length < 2) {
err = new Error("signature was way too short: < 2 bytes");
} else {
if (v.readUInt16BE(0) !== 0x0001) {
err = new Error("Sig verify error: Didn't get two-byte header 0x00 0x01");
} else {
i = 2;
while (i < v.length && (v.readUInt8(i) === 0xff)) {
i++;
}
if (i >= v.length || v.readUInt8(i) !== 0) {
err = new Error("Sig verify error: Missed the 0x0 separator");
} else {
i++;
header = hash_headers[hasher.algname];
if (!bufeq_secure(new Buffer(header), v.slice(i, header.length + i))) {
err = new Error("Sig verify error: missing ASN header for " + hasher.algname);
} else {
i += header.length;
h = v.slice(i);
if (h.length !== hasher.output_length) {
err = new Error("Sig verify error: trailing garbage in signature");
} else {
ret = h;
}
}
}
}
}
return [err, ret];
};
eme_random = function(n, cb) {
var b, bytes, c, diff, i, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
bytes = [];
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(bytes.length < n)) {
return _break();
} else {
diff = n - bytes.length;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/pad.iced"
});
SRF().random_bytes(diff, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return b = arguments[0];
};
})(),
lineno: 77
}));
__iced_deferrals._fulfill();
})(function() {
var _i;
for (i = _i = 0; 0 <= diff ? _i < diff : _i > diff; i = 0 <= diff ? ++_i : --_i) {
c = b.readUInt8(i);
if (c !== 0) {
bytes.push(c);
}
}
return _next();
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(new Buffer(bytes));
};
})(this));
};
exports.eme_pkcs1_encode = function(v, len, cb) {
var PS, buf, err, n_randos, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
ret = err = null;
(function(_this) {
return (function(__iced_k) {
if (v.length > len - 11) {
return __iced_k(err = new Error("cannot encrypt message -- it's too long!"));
} else {
n_randos = len - 3 - v.length;
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/pad.iced",
funcname: "eme_pkcs1_encode"
});
eme_random(n_randos, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return PS = arguments[0];
};
})(),
lineno: 93
}));
__iced_deferrals._fulfill();
})(function() {
buf = Buffer.concat([new Buffer([0x00, 0x02]), PS, new Buffer([0x00]), v]);
return __iced_k(ret = nbs(buffer_to_ui8a(buf), 256));
});
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
exports.eme_pkcs1_decode = function(v) {
var err, i, ret;
err = ret = null;
if (v.length < 12) {
err = new Error("Ciphertext too short, needs to be >= 12 bytes");
} else if (v.readUInt16BE(0) !== 0x0002) {
err = new Error("Failed to find expected header: 0x00 0x02");
} else {
i = 2;
while (i < v.length && (v.readUInt8(i) !== 0x0)) {
i++;
}
if (i >= v.length) {
err = new Error("didn't get 0x00 seperator octet");
} else {
i++;
ret = v.slice(i);
}
}
return [err, ret];
};
exports.ecc_pkcs5_pad_data = function(d) {
var err, pad_len, ret, v;
err = ret = null;
pad_len = 40 - d.length;
if (pad_len < 0) {
err = new Error("Pad underrun");
} else {
v = (function() {
var _i, _results;
_results = [];
for (_i = 0; 0 <= pad_len ? _i < pad_len : _i > pad_len; 0 <= pad_len ? _i++ : _i--) {
_results.push(pad_len);
}
return _results;
})();
ret = Buffer.concat([d, new Buffer(v)]);
}
return [err, ret];
};
exports.ecc_pkcs5_unpad_data = function(buf, data_len) {
var c, err, i, pad_len, _i, _ref1;
err = null;
pad_len = buf.length - data_len;
if (pad_len < 0) {
err = new Error("Pad length was < 0; pad underrun");
} else if ((buf.length % 8) !== 0) {
err = new Error("Padded data must be a multiple of 8 bytes long");
} else {
for (i = _i = data_len, _ref1 = buf.length; data_len <= _ref1 ? _i < _ref1 : _i > _ref1; i = data_len <= _ref1 ? ++_i : --_i) {
if ((c = buf.readUInt8(i)) !== pad_len) {
err = new Error("Got bad PKCS#5 pad character " + c + " at position " + i + "; wanted " + pad_len);
break;
}
}
}
return err;
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./bn":4,"./const":5,"./hash":14,"./rand":65,"./util":70,"buffer":80,"iced-runtime":118}],63:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, Avg, BigInteger, MRF, PrimeFinder, SRF, Timer, fermat2_test, fta, iced, make_esc, miller_rabin, naive_is_prime, native_rng, nbi, nbs, nbv, prime_search, prng, quickmod, random_prime, small_primes, _MR_inner, _MR_small_check, __iced_k, __iced_k_noop, _ref, _ref1;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
_ref = require('bn'), nbv = _ref.nbv, nbi = _ref.nbi, BigInteger = _ref.BigInteger;
prng = require('triplesec').prng;
native_rng = prng.native_rng;
small_primes = require('./primes').small_primes;
make_esc = require('iced-error').make_esc;
ASP = require('./util').ASP;
nbs = require('./bn').nbs;
_ref1 = require('./rand'), MRF = _ref1.MRF, SRF = _ref1.SRF;
Timer = (function() {
function Timer() {
this.start = Date.now();
}
Timer.prototype.stop = function() {
return Date.now() - this.start;
};
return Timer;
})();
Avg = (function() {
function Avg() {
this.tot = 0;
this.n = 0;
}
Avg.prototype.start = function() {
return this._t = Date.now();
};
Avg.prototype.stop = function() {
var s;
s = Date.now() - this._t;
console.log("ran in " + s);
this.tot += s;
return this.n++;
};
Avg.prototype.avg = function() {
return this.tot / this.n;
};
return Avg;
})();
quickmod = function(p, d) {
return p.modInt(d);
};
fta = new Avg();
fermat2_test = function(n) {
var Bl, bl, i, ret, t, _i;
t = nbv(1);
bl = n.bitLength();
bl--;
Bl = n.byteLength();
for (i = _i = bl; bl <= 0 ? _i <= 0 : _i >= 0; i = bl <= 0 ? ++_i : --_i) {
t = t.square();
if (t.byteLength() > Bl) {
t = t.mod(n);
}
if (n.testBit(i)) {
t = t.shiftLeft(1);
}
}
if (t.compareTo(n) > 0) {
t = t.mod(n);
}
ret = t.compareTo(nbv(2)) === 0;
return ret;
};
_MR_inner = function(_arg) {
var a, j, p, p1, r, s, y, _i, _ref2;
s = _arg.s, r = _arg.r, p = _arg.p, p1 = _arg.p1;
a = MRF().random_zn(p);
y = a.modPow(r, p);
if (y.compareTo(BigInteger.ONE) !== 0) {
for (j = _i = _ref2 = s - 1; _ref2 <= 0 ? _i <= 0 : _i >= 0; j = _ref2 <= 0 ? ++_i : --_i) {
if (!(y.compareTo(p1) !== 0)) {
continue;
}
if (j === 0) {
return false;
}
y = y.square().mod(p);
if (y.compareTo(BigInteger.ONE) === 0) {
return false;
}
}
}
return true;
};
_MR_small_check = function(_arg) {
var p, _ref2;
p = _arg.p;
if (p.compareTo(BigInteger.ZERO) <= 0) {
return false;
} else if (p.compareTo(nbv(7)) <= 0) {
return (_ref2 = p.intValue()) === 2 || _ref2 === 3 || _ref2 === 5 || _ref2 === 7;
} else if (!p.testBit(0)) {
return false;
} else {
return true;
}
};
miller_rabin = function(_arg, cb) {
var asp, esc, i, iter, p, p1, r, ret, s, ___iced_passed_deferral, __iced_deferrals, __iced_k, _begin, _end, _positive;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
p = _arg.p, iter = _arg.iter, asp = _arg.asp;
asp || (asp = new ASP({}));
iter || (iter = 10);
esc = make_esc(cb, "miller_rabin");
ret = _MR_small_check({
p: p
});
(function(_this) {
return (function(__iced_k) {
if (ret) {
p1 = p.subtract(BigInteger.ONE);
s = p1.getLowestSetBit();
r = p1.shiftRight(s);
ret = true;
(function(__iced_k) {
var _i, _results, _while;
i = 0;
_begin = 0;
_end = iter;
_positive = _end > _begin;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
if (_positive) {
i += 1;
} else {
i -= 1;
}
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!!((_positive === true && i >= iter) || (_positive === false && i <= iter))) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
asp.progress({
what: "mr",
i: i,
total: iter,
p: p
}, esc(__iced_deferrals.defer({
lineno: 122
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (!_MR_inner({
s: s,
r: r,
p: p,
p1: p1
})) {
ret = false;
(function(__iced_k) {
_break()
})(__iced_k);
} else {
return __iced_k();
}
})(_next);
});
}
};
_while(__iced_k);
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
asp.progress({
what: "mr",
i: iter,
total: iter,
p: p
}, esc(__iced_deferrals.defer({
lineno: 127
})));
__iced_deferrals._fulfill();
})(__iced_k);
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(null, ret);
};
})(this));
};
PrimeFinder = (function() {
function PrimeFinder(p, sieve) {
this.p = p;
this.sieve = sieve;
this.inc = 0;
this.maxinc = -1;
this.sievepos = quickmod(this.p, this.sieve.length);
this.calcmods();
}
PrimeFinder.prototype.getp = function() {
return this.p;
};
PrimeFinder.prototype.setmax = function(i) {
if (this.maxinc !== -1) {
throw new Error("can only setmax() once");
}
return this.maxinc = i;
};
PrimeFinder.prototype.calcmods = function() {
var sp;
this.p = this.p.add(nbv(this.inc));
if (this.maxinc !== -1) {
this.maxinc -= this.inc;
}
this.inc = 0;
return this.mods = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = small_primes.length; _i < _len; _i++) {
sp = small_primes[_i];
_results.push(quickmod(this.p, sp));
}
return _results;
}).call(this);
};
PrimeFinder.prototype.decrement_mods_find_divisor = function() {
var i, sp, _i, _len;
for (i = _i = 0, _len = small_primes.length; _i < _len; i = ++_i) {
sp = small_primes[i];
while (this.mods[i] + this.inc >= sp) {
this.mods[i] -= sp;
if ((this.mods[i] + this.inc) === 0) {
return true;
}
}
}
return false;
};
PrimeFinder.prototype.next_weak = function() {
var step;
while (true) {
step = this.sieve[this.sievepos];
this.sievepos = (this.sievepos + step) % this.sieve.length;
this.inc += step;
if (this.inc > this.maxinc && this.maxinc > 0) {
this.tmp = nbv(0);
return this.tmp;
}
if (this.inc < 0) {
this.calcmods();
}
if (!this.decrement_mods_find_divisor()) {
this.tmp = this.p.add(nbv(this.inc));
return this.tmp;
}
}
};
PrimeFinder.prototype.next_fermat = function() {
while (true) {
this.next_weak();
if (!this.tmp || fermat2_test(this.tmp)) {
return this.tmp;
}
}
};
PrimeFinder.prototype.next_strong = function(iter) {
if (iter == null) {
iter = 32;
}
while (true) {
this.next_weak();
if (!this.tmp || (fermat2_test(this.tmp) && probab_prime(this.tmp, iter))) {
return this.tmp;
}
}
};
return PrimeFinder;
})();
prime_search = function(_arg, cb) {
var asp, esc, i, is_prime, iters, p, pf, pp, pvec, range, ret, sieve, start, tmp, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
start = _arg.start, range = _arg.range, sieve = _arg.sieve, asp = _arg.asp, iters = _arg.iters;
iters || (iters = 20);
pf = new PrimeFinder(start, sieve);
pf.setmax(range);
pvec = ((function() {
var _results;
_results = [];
while ((pp = pf.next_weak()).compareTo(BigInteger.ZERO) > 0) {
_results.push(pp);
}
return _results;
})());
esc = make_esc(cb, "prime_search");
ret = null;
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(pvec.length && (ret == null))) {
return _break();
} else {
i = MRF().random_word() % pvec.length;
p = pvec[i];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
asp.progress({
what: "fermat",
p: p
}, esc(__iced_deferrals.defer({
lineno: 226
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if (!fermat2_test(p)) {
return __iced_k();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
miller_rabin({
p: p,
iters: iters,
asp: asp
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return is_prime = arguments[0];
};
})(),
lineno: 229
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
asp.progress({
what: "passed_mr",
p: p
}, esc(__iced_deferrals.defer({
lineno: 230
})));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(is_prime ? ret = p : asp.progress({
what: "failed_mr",
p: p
}));
});
});
}
})(function() {
tmp = pvec.pop();
return _next(i < pvec.length ? pvec[i] = tmp : void 0);
});
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
if (ret == null) {
ret = nbv(0);
}
return cb(null, ret);
};
})(this));
};
random_prime = function(_arg, cb) {
var asp, e, esc, go, iters, nbits, p, range, sieve, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
nbits = _arg.nbits, iters = _arg.iters, asp = _arg.asp, e = _arg.e;
sieve = [1, 2];
go = true;
esc = make_esc(cb, "random_prime");
range = nbits;
p = null;
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!go) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
SRF().random_nbit(nbits, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return p = arguments[0];
};
})(),
lineno: 262
}));
__iced_deferrals._fulfill();
})(function() {
p = p.setBit(0).setBit(nbits - 1).setBit(nbits - 2);
(function(__iced_k) {
if ((e == null) || p.subtract(BigInteger.ONE).gcd(e).compareTo(BigInteger.ONE) === 0) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
asp.progress({
what: "guess",
p: p
}, esc(__iced_deferrals.defer({
lineno: 265
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
prime_search({
start: p,
range: range,
sieve: sieve,
asp: asp,
iters: iters
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return p = arguments[0];
};
})(),
lineno: 266
})));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(go = (p == null) || (p.compareTo(BigInteger.ZERO) === 0));
});
});
} else {
return __iced_k();
}
})(_next);
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/primegen.iced"
});
asp.progress({
what: "found",
p: p
}, esc(__iced_deferrals.defer({
lineno: 269
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, p);
});
};
})(this));
};
exports.naive_is_prime = naive_is_prime = function(n) {
var biggest, p, _i, _len;
biggest = Math.floor(Math.sqrt(n));
for (_i = 0, _len = small_primes.length; _i < _len; _i++) {
p = small_primes[_i];
if (p > biggest) {
return true;
}
if ((n % p) === 0) {
return false;
}
}
return false;
};
exports.fermat2_test = fermat2_test;
exports.nbs = nbs;
exports.small_primes = small_primes;
exports.miller_rabin = miller_rabin;
exports.random_prime = random_prime;
}).call(this);
},{"./bn":4,"./primes":64,"./rand":65,"./util":70,"bn":71,"iced-error":115,"iced-runtime":118,"triplesec":181}],64:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
exports.small_primes = [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, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973, 10007, 10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093, 10099, 10103, 10111, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177, 10181, 10193, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271, 10273, 10289, 10301, 10303, 10313, 10321, 10331, 10333, 10337, 10343, 10357, 10369, 10391, 10399, 10427, 10429, 10433, 10453, 10457, 10459, 10463, 10477, 10487, 10499, 10501, 10513, 10529, 10531, 10559, 10567, 10589, 10597, 10601, 10607, 10613, 10627, 10631, 10639, 10651, 10657, 10663, 10667, 10687, 10691, 10709, 10711, 10723, 10729, 10733, 10739, 10753, 10771, 10781, 10789, 10799, 10831, 10837, 10847, 10853, 10859, 10861, 10867, 10883, 10889, 10891, 10903, 10909, 10937, 10939, 10949, 10957, 10973, 10979, 10987, 10993, 11003, 11027, 11047, 11057, 11059, 11069, 11071, 11083, 11087, 11093, 11113, 11117, 11119, 11131, 11149, 11159, 11161, 11171, 11173, 11177, 11197, 11213, 11239, 11243, 11251, 11257, 11261, 11273, 11279, 11287, 11299, 11311, 11317, 11321, 11329, 11351, 11353, 11369, 11383, 11393, 11399, 11411, 11423, 11437, 11443, 11447, 11467, 11471, 11483, 11489, 11491, 11497, 11503, 11519, 11527, 11549, 11551, 11579, 11587, 11593, 11597, 11617, 11621, 11633, 11657, 11677, 11681, 11689, 11699, 11701, 11717, 11719, 11731, 11743, 11777, 11779, 11783, 11789, 11801, 11807, 11813, 11821, 11827, 11831, 11833, 11839, 11863, 11867, 11887, 11897, 11903, 11909, 11923, 11927, 11933, 11939, 11941, 11953, 11959, 11969, 11971, 11981, 11987, 12007, 12011, 12037, 12041, 12043, 12049, 12071, 12073, 12097, 12101, 12107, 12109, 12113, 12119, 12143, 12149, 12157, 12161, 12163, 12197, 12203, 12211, 12227, 12239, 12241, 12251, 12253, 12263, 12269, 12277, 12281, 12289, 12301, 12323, 12329, 12343, 12347, 12373, 12377, 12379, 12391, 12401, 12409, 12413, 12421, 12433, 12437, 12451, 12457, 12473, 12479, 12487, 12491, 12497, 12503, 12511, 12517, 12527, 12539, 12541, 12547, 12553, 12569, 12577, 12583, 12589, 12601, 12611, 12613, 12619, 12637, 12641, 12647, 12653, 12659, 12671, 12689, 12697, 12703, 12713, 12721, 12739, 12743, 12757, 12763, 12781, 12791, 12799, 12809, 12821, 12823, 12829, 12841, 12853, 12889, 12893, 12899, 12907, 12911, 12917, 12919, 12923, 12941, 12953, 12959, 12967, 12973, 12979, 12983, 13001, 13003, 13007, 13009, 13033, 13037, 13043, 13049, 13063, 13093, 13099, 13103, 13109, 13121, 13127, 13147, 13151, 13159, 13163, 13171, 13177, 13183, 13187, 13217, 13219, 13229, 13241, 13249, 13259, 13267, 13291, 13297, 13309, 13313, 13327, 13331, 13337, 13339, 13367, 13381, 13397, 13399, 13411, 13417, 13421, 13441, 13451, 13457, 13463, 13469, 13477, 13487, 13499, 13513, 13523, 13537, 13553, 13567, 13577, 13591, 13597, 13613, 13619, 13627, 13633, 13649, 13669, 13679, 13681, 13687, 13691, 13693, 13697, 13709, 13711, 13721, 13723, 13729, 13751, 13757, 13759, 13763, 13781, 13789, 13799, 13807, 13829, 13831, 13841, 13859, 13873, 13877, 13879, 13883, 13901, 13903, 13907, 13913, 13921, 13931, 13933, 13963, 13967, 13997, 13999, 14009, 14011, 14029, 14033, 14051, 14057, 14071, 14081, 14083, 14087, 14107, 14143, 14149, 14153, 14159, 14173, 14177, 14197, 14207, 14221, 14243, 14249, 14251, 14281, 14293, 14303, 14321, 14323, 14327, 14341, 14347, 14369, 14387, 14389, 14401, 14407, 14411, 14419, 14423, 14431, 14437, 14447, 14449, 14461, 14479, 14489, 14503, 14519, 14533, 14537, 14543, 14549, 14551, 14557, 14561, 14563, 14591, 14593, 14621, 14627, 14629, 14633, 14639, 14653, 14657, 14669, 14683, 14699, 14713, 14717, 14723, 14731, 14737, 14741, 14747, 14753, 14759, 14767, 14771, 14779, 14783, 14797, 14813, 14821, 14827, 14831, 14843, 14851, 14867, 14869, 14879, 14887, 14891, 14897, 14923, 14929, 14939, 14947, 14951, 14957, 14969, 14983, 15013, 15017, 15031, 15053, 15061, 15073, 15077, 15083, 15091, 15101, 15107, 15121, 15131, 15137, 15139, 15149, 15161, 15173, 15187, 15193, 15199, 15217, 15227, 15233, 15241, 15259, 15263, 15269, 15271, 15277, 15287, 15289, 15299, 15307, 15313, 15319, 15329, 15331, 15349, 15359, 15361, 15373, 15377, 15383, 15391, 15401, 15413, 15427, 15439, 15443, 15451, 15461, 15467, 15473, 15493, 15497, 15511, 15527, 15541, 15551, 15559, 15569, 15581, 15583, 15601, 15607, 15619, 15629, 15641, 15643, 15647, 15649, 15661, 15667, 15671, 15679, 15683, 15727, 15731, 15733, 15737, 15739, 15749, 15761, 15767, 15773, 15787, 15791, 15797, 15803, 15809, 15817, 15823, 15859, 15877, 15881, 15887, 15889, 15901, 15907, 15913, 15919, 15923, 15937, 15959, 15971, 15973, 15991, 16001, 16007, 16033, 16057, 16061, 16063, 16067, 16069, 16073, 16087, 16091, 16097, 16103, 16111, 16127, 16139, 16141, 16183, 16187, 16189, 16193, 16217, 16223, 16229, 16231, 16249, 16253, 16267, 16273, 16301, 16319, 16333, 16339, 16349, 16361, 16363, 16369, 16381, 16411, 16417, 16421, 16427, 16433, 16447, 16451, 16453, 16477, 16481, 16487, 16493, 16519, 16529, 16547, 16553, 16561, 16567, 16573, 16603, 16607, 16619, 16631, 16633, 16649, 16651, 16657, 16661, 16673, 16691, 16693, 16699, 16703, 16729, 16741, 16747, 16759, 16763, 16787, 16811, 16823, 16829, 16831, 16843, 16871, 16879, 16883, 16889, 16901, 16903, 16921, 16927, 16931, 16937, 16943, 16963, 16979, 16981, 16987, 16993, 17011, 17021, 17027, 17029, 17033, 17041, 17047, 17053, 17077, 17093, 17099, 17107, 17117, 17123, 17137, 17159, 17167, 17183, 17189, 17191, 17203, 17207, 17209, 17231, 17239, 17257, 17291, 17293, 17299, 17317, 17321, 17327, 17333, 17341, 17351, 17359, 17377, 17383, 17387, 17389, 17393, 17401, 17417, 17419, 17431, 17443, 17449, 17467, 17471, 17477, 17483, 17489, 17491, 17497, 17509, 17519, 17539, 17551, 17569, 17573, 17579, 17581, 17597, 17599, 17609, 17623, 17627, 17657, 17659, 17669, 17681, 17683, 17707, 17713, 17729, 17737, 17747, 17749, 17761, 17783, 17789, 17791, 17807, 17827, 17837, 17839, 17851, 17863, 17881, 17891, 17903, 17909, 17911, 17921, 17923, 17929, 17939, 17957, 17959, 17971, 17977, 17981, 17987, 17989, 18013, 18041, 18043, 18047, 18049, 18059, 18061, 18077, 18089, 18097, 18119, 18121, 18127, 18131, 18133, 18143, 18149, 18169, 18181, 18191, 18199, 18211, 18217, 18223, 18229, 18233, 18251, 18253, 18257, 18269, 18287, 18289, 18301, 18307, 18311, 18313, 18329, 18341, 18353, 18367, 18371, 18379, 18397, 18401, 18413, 18427, 18433, 18439, 18443, 18451, 18457, 18461, 18481, 18493, 18503, 18517, 18521, 18523, 18539, 18541, 18553, 18583, 18587, 18593, 18617, 18637, 18661, 18671, 18679, 18691, 18701, 18713, 18719, 18731, 18743, 18749, 18757, 18773, 18787, 18793, 18797, 18803, 18839, 18859, 18869, 18899, 18911, 18913, 18917, 18919, 18947, 18959, 18973, 18979, 19001, 19009, 19013, 19031, 19037, 19051, 19069, 19073, 19079, 19081, 19087, 19121, 19139, 19141, 19157, 19163, 19181, 19183, 19207, 19211, 19213, 19219, 19231, 19237, 19249, 19259, 19267, 19273, 19289, 19301, 19309, 19319, 19333, 19373, 19379, 19381, 19387, 19391, 19403, 19417, 19421, 19423, 19427, 19429, 19433, 19441, 19447, 19457, 19463, 19469, 19471, 19477, 19483, 19489, 19501, 19507, 19531, 19541, 19543, 19553, 19559, 19571, 19577, 19583, 19597, 19603, 19609, 19661, 19681, 19687, 19697, 19699, 19709, 19717, 19727, 19739, 19751, 19753, 19759, 19763, 19777, 19793, 19801, 19813, 19819, 19841, 19843, 19853, 19861, 19867, 19889, 19891, 19913, 19919, 19927, 19937, 19949, 19961, 19963, 19973, 19979, 19991, 19993, 19997, 20011, 20021, 20023, 20029, 20047, 20051, 20063, 20071, 20089, 20101, 20107, 20113, 20117, 20123, 20129, 20143, 20147, 20149, 20161, 20173, 20177, 20183, 20201, 20219, 20231, 20233, 20249, 20261, 20269, 20287, 20297, 20323, 20327, 20333, 20341, 20347, 20353, 20357, 20359, 20369, 20389, 20393, 20399, 20407, 20411, 20431, 20441, 20443, 20477, 20479, 20483, 20507, 20509, 20521, 20533, 20543, 20549, 20551, 20563, 20593, 20599, 20611, 20627, 20639, 20641, 20663, 20681, 20693, 20707, 20717, 20719, 20731, 20743, 20747, 20749, 20753, 20759, 20771, 20773, 20789, 20807, 20809, 20849, 20857, 20873, 20879, 20887, 20897, 20899, 20903, 20921, 20929, 20939, 20947, 20959, 20963, 20981, 20983, 21001, 21011, 21013, 21017, 21019, 21023, 21031, 21059, 21061, 21067, 21089, 21101, 21107, 21121, 21139, 21143, 21149, 21157, 21163, 21169, 21179, 21187, 21191, 21193, 21211, 21221, 21227, 21247, 21269, 21277, 21283, 21313, 21317, 21319, 21323, 21341, 21347, 21377, 21379, 21383, 21391, 21397, 21401, 21407, 21419, 21433, 21467, 21481, 21487, 21491, 21493, 21499, 21503, 21517, 21521, 21523, 21529, 21557, 21559, 21563, 21569, 21577, 21587, 21589, 21599, 21601, 21611, 21613, 21617, 21647, 21649, 21661, 21673, 21683, 21701, 21713, 21727, 21737, 21739, 21751, 21757, 21767, 21773, 21787, 21799, 21803, 21817, 21821, 21839, 21841, 21851, 21859, 21863, 21871, 21881, 21893, 21911, 21929, 21937, 21943, 21961, 21977, 21991, 21997, 22003, 22013, 22027, 22031, 22037, 22039, 22051, 22063, 22067, 22073, 22079, 22091, 22093, 22109, 22111, 22123, 22129, 22133, 22147, 22153, 22157, 22159, 22171, 22189, 22193, 22229, 22247, 22259, 22271, 22273, 22277, 22279, 22283, 22291, 22303, 22307, 22343, 22349, 22367, 22369, 22381, 22391, 22397, 22409, 22433, 22441, 22447, 22453, 22469, 22481, 22483, 22501, 22511, 22531, 22541, 22543, 22549, 22567, 22571, 22573, 22613, 22619, 22621, 22637, 22639, 22643, 22651, 22669, 22679, 22691, 22697, 22699, 22709, 22717, 22721, 22727, 22739, 22741, 22751, 22769, 22777, 22783, 22787, 22807, 22811, 22817, 22853, 22859, 22861, 22871, 22877, 22901, 22907, 22921, 22937, 22943, 22961, 22963, 22973, 22993, 23003, 23011, 23017, 23021, 23027, 23029, 23039, 23041, 23053, 23057, 23059, 23063, 23071, 23081, 23087, 23099, 23117, 23131, 23143, 23159, 23167, 23173, 23189, 23197, 23201, 23203, 23209, 23227, 23251, 23269, 23279, 23291, 23293, 23297, 23311, 23321, 23327, 23333, 23339, 23357, 23369, 23371, 23399, 23417, 23431, 23447, 23459, 23473, 23497, 23509, 23531, 23537, 23539, 23549, 23557, 23561, 23563, 23567, 23581, 23593, 23599, 23603, 23609, 23623, 23627, 23629, 23633, 23663, 23669, 23671, 23677, 23687, 23689, 23719, 23741, 23743, 23747, 23753, 23761, 23767, 23773, 23789, 23801, 23813, 23819, 23827, 23831, 23833, 23857, 23869, 23873, 23879, 23887, 23893, 23899, 23909, 23911, 23917, 23929, 23957, 23971, 23977, 23981, 23993, 24001, 24007, 24019, 24023, 24029, 24043, 24049, 24061, 24071, 24077, 24083, 24091, 24097, 24103, 24107, 24109, 24113, 24121, 24133, 24137, 24151, 24169, 24179, 24181, 24197, 24203, 24223, 24229, 24239, 24247, 24251, 24281, 24317, 24329, 24337, 24359, 24371, 24373, 24379, 24391, 24407, 24413, 24419, 24421, 24439, 24443, 24469, 24473, 24481, 24499, 24509, 24517, 24527, 24533, 24547, 24551, 24571, 24593, 24611, 24623, 24631, 24659, 24671, 24677, 24683, 24691, 24697, 24709, 24733, 24749, 24763, 24767, 24781, 24793, 24799, 24809, 24821, 24841, 24847, 24851, 24859, 24877, 24889, 24907, 24917, 24919, 24923, 24943, 24953, 24967, 24971, 24977, 24979, 24989, 25013, 25031, 25033, 25037, 25057, 25073, 25087, 25097, 25111, 25117, 25121, 25127, 25147, 25153, 25163, 25169, 25171, 25183, 25189, 25219, 25229, 25237, 25243, 25247, 25253, 25261, 25301, 25303, 25307, 25309, 25321, 25339, 25343, 25349, 25357, 25367, 25373, 25391, 25409, 25411, 25423, 25439, 25447, 25453, 25457, 25463, 25469, 25471, 25523, 25537, 25541, 25561, 25577, 25579, 25583, 25589, 25601, 25603, 25609, 25621, 25633, 25639, 25643, 25657, 25667, 25673, 25679, 25693, 25703, 25717, 25733, 25741, 25747, 25759, 25763, 25771, 25793, 25799, 25801, 25819, 25841, 25847, 25849, 25867, 25873, 25889, 25903, 25913, 25919, 25931, 25933, 25939, 25943, 25951, 25969, 25981, 25997, 25999, 26003, 26017, 26021, 26029, 26041, 26053, 26083, 26099, 26107, 26111, 26113, 26119, 26141, 26153, 26161, 26171, 26177, 26183, 26189, 26203, 26209, 26227, 26237, 26249, 26251, 26261, 26263, 26267, 26293, 26297, 26309, 26317, 26321, 26339, 26347, 26357, 26371, 26387, 26393, 26399, 26407, 26417, 26423, 26431, 26437, 26449, 26459, 26479, 26489, 26497, 26501, 26513, 26539, 26557, 26561, 26573, 26591, 26597, 26627, 26633, 26641, 26647, 26669, 26681, 26683, 26687, 26693, 26699, 26701, 26711, 26713, 26717, 26723, 26729, 26731, 26737, 26759, 26777, 26783, 26801, 26813, 26821, 26833, 26839, 26849, 26861, 26863, 26879, 26881, 26891, 26893, 26903, 26921, 26927, 26947, 26951, 26953, 26959, 26981, 26987, 26993, 27011, 27017, 27031, 27043, 27059, 27061, 27067, 27073, 27077, 27091, 27103, 27107, 27109, 27127, 27143, 27179, 27191, 27197, 27211, 27239, 27241, 27253, 27259, 27271, 27277, 27281, 27283, 27299, 27329, 27337, 27361, 27367, 27397, 27407, 27409, 27427, 27431, 27437, 27449, 27457, 27479, 27481, 27487, 27509, 27527, 27529, 27539, 27541, 27551, 27581, 27583, 27611, 27617, 27631, 27647, 27653, 27673, 27689, 27691, 27697, 27701, 27733, 27737, 27739, 27743, 27749, 27751, 27763, 27767, 27773, 27779, 27791, 27793, 27799, 27803, 27809, 27817, 27823, 27827, 27847, 27851, 27883, 27893, 27901, 27917, 27919, 27941, 27943, 27947, 27953, 27961, 27967, 27983, 27997, 28001, 28019, 28027, 28031, 28051, 28057, 28069, 28081, 28087, 28097, 28099, 28109, 28111, 28123, 28151, 28163, 28181, 28183, 28201, 28211, 28219, 28229, 28277, 28279, 28283, 28289, 28297, 28307, 28309, 28319, 28349, 28351, 28387, 28393, 28403, 28409, 28411, 28429, 28433, 28439, 28447, 28463, 28477, 28493, 28499, 28513, 28517, 28537, 28541, 28547, 28549, 28559, 28571, 28573, 28579, 28591, 28597, 28603, 28607, 28619, 28621, 28627, 28631, 28643, 28649, 28657, 28661, 28663, 28669, 28687, 28697, 28703, 28711, 28723, 28729, 28751, 28753, 28759, 28771, 28789, 28793, 28807, 28813, 28817, 28837, 28843, 28859, 28867, 28871, 28879, 28901, 28909, 28921, 28927, 28933, 28949, 28961, 28979, 29009, 29017, 29021, 29023, 29027, 29033, 29059, 29063, 29077, 29101, 29123, 29129, 29131, 29137, 29147, 29153, 29167, 29173, 29179, 29191, 29201, 29207, 29209, 29221, 29231, 29243, 29251, 29269, 29287, 29297, 29303, 29311, 29327, 29333, 29339, 29347, 29363, 29383, 29387, 29389, 29399, 29401, 29411, 29423, 29429, 29437, 29443, 29453, 29473, 29483, 29501, 29527, 29531, 29537, 29567, 29569, 29573, 29581, 29587, 29599, 29611, 29629, 29633, 29641, 29663, 29669, 29671, 29683, 29717, 29723, 29741, 29753, 29759, 29761, 29789, 29803, 29819, 29833, 29837, 29851, 29863, 29867, 29873, 29879, 29881, 29917, 29921, 29927, 29947, 29959, 29983, 29989, 30011, 30013, 30029, 30047, 30059, 30071, 30089, 30091, 30097, 30103, 30109, 30113, 30119, 30133, 30137, 30139, 30161, 30169, 30181, 30187, 30197, 30203, 30211, 30223, 30241, 30253, 30259, 30269, 30271, 30293, 30307, 30313, 30319, 30323, 30341, 30347, 30367, 30389, 30391, 30403, 30427, 30431, 30449, 30467, 30469, 30491, 30493, 30497, 30509, 30517, 30529, 30539, 30553, 30557, 30559, 30577, 30593, 30631, 30637, 30643, 30649, 30661, 30671, 30677, 30689, 30697, 30703, 30707, 30713, 30727, 30757, 30763, 30773, 30781, 30803, 30809, 30817, 30829, 30839, 30841, 30851, 30853, 30859, 30869, 30871, 30881, 30893, 30911, 30931, 30937, 30941, 30949, 30971, 30977, 30983, 31013, 31019, 31033, 31039, 31051, 31063, 31069, 31079, 31081, 31091, 31121, 31123, 31139, 31147, 31151, 31153, 31159, 31177, 31181, 31183, 31189, 31193, 31219, 31223, 31231, 31237, 31247, 31249, 31253, 31259, 31267, 31271, 31277, 31307, 31319, 31321, 31327, 31333, 31337, 31357, 31379, 31387, 31391, 31393, 31397, 31469, 31477, 31481, 31489, 31511, 31513, 31517, 31531, 31541, 31543, 31547, 31567, 31573, 31583, 31601, 31607, 31627, 31643, 31649, 31657, 31663, 31667, 31687, 31699, 31721, 31723, 31727, 31729, 31741, 31751, 31769, 31771, 31793, 31799, 31817, 31847, 31849, 31859, 31873, 31883, 31891, 31907, 31957, 31963, 31973, 31981, 31991, 32003, 32009, 32027, 32029, 32051, 32057, 32059, 32063, 32069, 32077, 32083, 32089, 32099, 32117, 32119, 32141, 32143, 32159, 32173, 32183, 32189, 32191, 32203, 32213, 32233, 32237, 32251, 32257, 32261, 32297, 32299, 32303, 32309, 32321, 32323, 32327, 32341, 32353, 32359, 32363, 32369, 32371, 32377, 32381, 32401, 32411, 32413, 32423, 32429, 32441, 32443, 32467, 32479, 32491, 32497, 32503, 32507, 32531, 32533, 32537, 32561, 32563, 32569, 32573, 32579, 32587, 32603, 32609, 32611, 32621, 32633, 32647, 32653, 32687, 32693, 32707, 32713, 32717, 32719, 32749, 32771, 32779, 32783, 32789, 32797, 32801, 32803, 32831, 32833, 32839, 32843, 32869, 32887, 32909, 32911, 32917, 32933, 32939, 32941, 32957, 32969, 32971, 32983, 32987, 32993, 32999, 33013, 33023, 33029, 33037, 33049, 33053, 33071, 33073, 33083, 33091, 33107, 33113, 33119, 33149, 33151, 33161, 33179, 33181, 33191, 33199, 33203, 33211, 33223, 33247, 33287, 33289, 33301, 33311, 33317, 33329, 33331, 33343, 33347, 33349, 33353, 33359, 33377, 33391, 33403, 33409, 33413, 33427, 33457, 33461, 33469, 33479, 33487, 33493, 33503, 33521, 33529, 33533, 33547, 33563, 33569, 33577, 33581, 33587, 33589, 33599, 33601, 33613, 33617, 33619, 33623, 33629, 33637, 33641, 33647, 33679, 33703, 33713, 33721, 33739, 33749, 33751, 33757, 33767, 33769, 33773, 33791, 33797, 33809, 33811, 33827, 33829, 33851, 33857, 33863, 33871, 33889, 33893, 33911, 33923, 33931, 33937, 33941, 33961, 33967, 33997, 34019, 34031, 34033, 34039, 34057, 34061, 34123, 34127, 34129, 34141, 34147, 34157, 34159, 34171, 34183, 34211, 34213, 34217, 34231, 34253, 34259, 34261, 34267, 34273, 34283, 34297, 34301, 34303, 34313, 34319, 34327, 34337, 34351, 34361, 34367, 34369, 34381, 34403, 34421, 34429, 34439, 34457, 34469, 34471, 34483, 34487, 34499, 34501, 34511, 34513, 34519, 34537, 34543, 34549, 34583, 34589, 34591, 34603, 34607, 34613, 34631, 34649, 34651, 34667, 34673, 34679, 34687, 34693, 34703, 34721, 34729, 34739, 34747, 34757, 34759, 34763, 34781, 34807, 34819, 34841, 34843, 34847, 34849, 34871, 34877, 34883, 34897, 34913, 34919, 34939, 34949, 34961, 34963, 34981, 35023, 35027, 35051, 35053, 35059, 35069, 35081, 35083, 35089, 35099, 35107, 35111, 35117, 35129, 35141, 35149, 35153, 35159, 35171, 35201, 35221, 35227, 35251, 35257, 35267, 35279, 35281, 35291, 35311, 35317, 35323, 35327, 35339, 35353, 35363, 35381, 35393, 35401, 35407, 35419, 35423, 35437, 35447, 35449, 35461, 35491, 35507, 35509, 35521, 35527, 35531, 35533, 35537, 35543, 35569, 35573, 35591, 35593, 35597, 35603, 35617, 35671, 35677, 35729, 35731, 35747, 35753, 35759, 35771, 35797, 35801, 35803, 35809, 35831, 35837, 35839, 35851, 35863, 35869, 35879, 35897, 35899, 35911, 35923, 35933, 35951, 35963, 35969, 35977, 35983, 35993, 35999, 36007, 36011, 36013, 36017, 36037, 36061, 36067, 36073, 36083, 36097, 36107, 36109, 36131, 36137, 36151, 36161, 36187, 36191, 36209, 36217, 36229, 36241, 36251, 36263, 36269, 36277, 36293, 36299, 36307, 36313, 36319, 36341, 36343, 36353, 36373, 36383, 36389, 36433, 36451, 36457, 36467, 36469, 36473, 36479, 36493, 36497, 36523, 36527, 36529, 36541, 36551, 36559, 36563, 36571, 36583, 36587, 36599, 36607, 36629, 36637, 36643, 36653, 36671, 36677, 36683, 36691, 36697, 36709, 36713, 36721, 36739, 36749, 36761, 36767, 36779, 36781, 36787, 36791, 36793, 36809, 36821, 36833, 36847, 36857, 36871, 36877, 36887, 36899, 36901, 36913, 36919, 36923, 36929, 36931, 36943, 36947, 36973, 36979, 36997, 37003, 37013, 37019, 37021, 37039, 37049, 37057, 37061, 37087, 37097, 37117, 37123, 37139, 37159, 37171, 37181, 37189, 37199, 37201, 37217, 37223, 37243, 37253, 37273, 37277, 37307, 37309, 37313, 37321, 37337, 37339, 37357, 37361, 37363, 37369, 37379, 37397, 37409, 37423, 37441, 37447, 37463, 37483, 37489, 37493, 37501, 37507, 37511, 37517, 37529, 37537, 37547, 37549, 37561, 37567, 37571, 37573, 37579, 37589, 37591, 37607, 37619, 37633, 37643, 37649, 37657, 37663, 37691, 37693, 37699, 37717, 37747, 37781, 37783, 37799, 37811, 37813, 37831, 37847, 37853, 37861, 37871, 37879, 37889, 37897, 37907, 37951, 37957, 37963, 37967, 37987, 37991, 37993, 37997, 38011, 38039, 38047, 38053, 38069, 38083, 38113, 38119, 38149, 38153, 38167, 38177, 38183, 38189, 38197, 38201, 38219, 38231, 38237, 38239, 38261, 38273, 38281, 38287, 38299, 38303, 38317, 38321, 38327, 38329, 38333, 38351, 38371, 38377, 38393, 38431, 38447, 38449, 38453, 38459, 38461, 38501, 38543, 38557, 38561, 38567, 38569, 38593, 38603, 38609, 38611, 38629, 38639, 38651, 38653, 38669, 38671, 38677, 38693, 38699, 38707, 38711, 38713, 38723, 38729, 38737, 38747, 38749, 38767, 38783, 38791, 38803, 38821, 38833, 38839, 38851, 38861, 38867, 38873, 38891, 38903, 38917, 38921, 38923, 38933, 38953, 38959, 38971, 38977, 38993, 39019, 39023, 39041, 39043, 39047, 39079, 39089, 39097, 39103, 39107, 39113, 39119, 39133, 39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217, 39227, 39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323, 39341, 39343, 39359, 39367, 39371, 39373, 39383, 39397, 39409, 39419, 39439, 39443, 39451, 39461, 39499, 39503, 39509, 39511, 39521, 39541, 39551, 39563, 39569, 39581, 39607, 39619, 39623, 39631, 39659, 39667, 39671, 39679, 39703, 39709, 39719, 39727, 39733, 39749, 39761, 39769, 39779, 39791, 39799, 39821, 39827, 39829, 39839, 39841, 39847, 39857, 39863, 39869, 39877, 39883, 39887, 39901, 39929, 39937, 39953, 39971, 39979, 39983, 39989, 40009, 40013, 40031, 40037, 40039, 40063, 40087, 40093, 40099, 40111, 40123, 40127, 40129, 40151, 40153, 40163, 40169, 40177, 40189, 40193, 40213, 40231, 40237, 40241, 40253, 40277, 40283, 40289, 40343, 40351, 40357, 40361, 40387, 40423, 40427, 40429, 40433, 40459, 40471, 40483, 40487, 40493, 40499, 40507, 40519, 40529, 40531, 40543, 40559, 40577, 40583, 40591, 40597, 40609, 40627, 40637, 40639, 40693, 40697, 40699, 40709, 40739, 40751, 40759, 40763, 40771, 40787, 40801, 40813, 40819, 40823, 40829, 40841, 40847, 40849, 40853, 40867, 40879, 40883, 40897, 40903, 40927, 40933, 40939, 40949, 40961, 40973, 40993, 41011, 41017, 41023, 41039, 41047, 41051, 41057, 41077, 41081, 41113, 41117, 41131, 41141, 41143, 41149, 41161, 41177, 41179, 41183, 41189, 41201, 41203, 41213, 41221, 41227, 41231, 41233, 41243, 41257, 41263, 41269, 41281, 41299, 41333, 41341, 41351, 41357, 41381, 41387, 41389, 41399, 41411, 41413, 41443, 41453, 41467, 41479, 41491, 41507, 41513, 41519, 41521, 41539, 41543, 41549, 41579, 41593, 41597, 41603, 41609, 41611, 41617, 41621, 41627, 41641, 41647, 41651, 41659, 41669, 41681, 41687, 41719, 41729, 41737, 41759, 41761, 41771, 41777, 41801, 41809, 41813, 41843, 41849, 41851, 41863, 41879, 41887, 41893, 41897, 41903, 41911, 41927, 41941, 41947, 41953, 41957, 41959, 41969, 41981, 41983, 41999, 42013, 42017, 42019, 42023, 42043, 42061, 42071, 42073, 42083, 42089, 42101, 42131, 42139, 42157, 42169, 42179, 42181, 42187, 42193, 42197, 42209, 42221, 42223, 42227, 42239, 42257, 42281, 42283, 42293, 42299, 42307, 42323, 42331, 42337, 42349, 42359, 42373, 42379, 42391, 42397, 42403, 42407, 42409, 42433, 42437, 42443, 42451, 42457, 42461, 42463, 42467, 42473, 42487, 42491, 42499, 42509, 42533, 42557, 42569, 42571, 42577, 42589, 42611, 42641, 42643, 42649, 42667, 42677, 42683, 42689, 42697, 42701, 42703, 42709, 42719, 42727, 42737, 42743, 42751, 42767, 42773, 42787, 42793, 42797, 42821, 42829, 42839, 42841, 42853, 42859, 42863, 42899, 42901, 42923, 42929, 42937, 42943, 42953, 42961, 42967, 42979, 42989, 43003, 43013, 43019, 43037, 43049, 43051, 43063, 43067, 43093, 43103, 43117, 43133, 43151, 43159, 43177, 43189, 43201, 43207, 43223, 43237, 43261, 43271, 43283, 43291, 43313, 43319, 43321, 43331, 43391, 43397, 43399, 43403, 43411, 43427, 43441, 43451, 43457, 43481, 43487, 43499, 43517, 43541, 43543, 43573, 43577, 43579, 43591, 43597, 43607, 43609, 43613, 43627, 43633, 43649, 43651, 43661, 43669, 43691, 43711, 43717, 43721, 43753, 43759, 43777, 43781, 43783, 43787, 43789, 43793, 43801, 43853, 43867, 43889, 43891, 43913, 43933, 43943, 43951, 43961, 43963, 43969, 43973, 43987, 43991, 43997, 44017, 44021, 44027, 44029, 44041, 44053, 44059, 44071, 44087, 44089, 44101, 44111, 44119, 44123, 44129, 44131, 44159, 44171, 44179, 44189, 44201, 44203, 44207, 44221, 44249, 44257, 44263, 44267, 44269, 44273, 44279, 44281, 44293, 44351, 44357, 44371, 44381, 44383, 44389, 44417, 44449, 44453, 44483, 44491, 44497, 44501, 44507, 44519, 44531, 44533, 44537, 44543, 44549, 44563, 44579, 44587, 44617, 44621, 44623, 44633, 44641, 44647, 44651, 44657, 44683, 44687, 44699, 44701, 44711, 44729, 44741, 44753, 44771, 44773, 44777, 44789, 44797, 44809, 44819, 44839, 44843, 44851, 44867, 44879, 44887, 44893, 44909, 44917, 44927, 44939, 44953, 44959, 44963, 44971, 44983, 44987, 45007, 45013, 45053, 45061, 45077, 45083, 45119, 45121, 45127, 45131, 45137, 45139, 45161, 45179, 45181, 45191, 45197, 45233, 45247, 45259, 45263, 45281, 45289, 45293, 45307, 45317, 45319, 45329, 45337, 45341, 45343, 45361, 45377, 45389, 45403, 45413, 45427, 45433, 45439, 45481, 45491, 45497, 45503, 45523, 45533, 45541, 45553, 45557, 45569, 45587, 45589, 45599, 45613, 45631, 45641, 45659, 45667, 45673, 45677, 45691, 45697, 45707, 45737, 45751, 45757, 45763, 45767, 45779, 45817, 45821, 45823, 45827, 45833, 45841, 45853, 45863, 45869, 45887, 45893, 45943, 45949, 45953, 45959, 45971, 45979, 45989, 46021, 46027, 46049, 46051, 46061, 46073, 46091, 46093, 46099, 46103, 46133, 46141, 46147, 46153, 46171, 46181, 46183, 46187, 46199, 46219, 46229, 46237, 46261, 46271, 46273, 46279, 46301, 46307, 46309, 46327, 46337, 46349, 46351, 46381, 46399, 46411, 46439, 46441, 46447, 46451, 46457, 46471, 46477, 46489, 46499, 46507, 46511, 46523, 46549, 46559, 46567, 46573, 46589, 46591, 46601, 46619, 46633, 46639, 46643, 46649, 46663, 46679, 46681, 46687, 46691, 46703, 46723, 46727, 46747, 46751, 46757, 46769, 46771, 46807, 46811, 46817, 46819, 46829, 46831, 46853, 46861, 46867, 46877, 46889, 46901, 46919, 46933, 46957, 46993, 46997, 47017, 47041, 47051, 47057, 47059, 47087, 47093, 47111, 47119, 47123, 47129, 47137, 47143, 47147, 47149, 47161, 47189, 47207, 47221, 47237, 47251, 47269, 47279, 47287, 47293, 47297, 47303, 47309, 47317, 47339, 47351, 47353, 47363, 47381, 47387, 47389, 47407, 47417, 47419, 47431, 47441, 47459, 47491, 47497, 47501, 47507, 47513, 47521, 47527, 47533, 47543, 47563, 47569, 47581, 47591, 47599, 47609, 47623, 47629, 47639, 47653, 47657, 47659, 47681, 47699, 47701, 47711, 47713, 47717, 47737, 47741, 47743, 47777, 47779, 47791, 47797, 47807, 47809, 47819, 47837, 47843, 47857, 47869, 47881, 47903, 47911, 47917, 47933, 47939, 47947, 47951, 47963, 47969, 47977, 47981, 48017, 48023, 48029, 48049, 48073, 48079, 48091, 48109, 48119, 48121, 48131, 48157, 48163, 48179, 48187, 48193, 48197, 48221, 48239, 48247, 48259, 48271, 48281, 48299, 48311, 48313, 48337, 48341, 48353, 48371, 48383, 48397, 48407, 48409, 48413, 48437, 48449, 48463, 48473, 48479, 48481, 48487, 48491, 48497, 48523, 48527, 48533, 48539, 48541, 48563, 48571, 48589, 48593, 48611, 48619, 48623, 48647, 48649, 48661, 48673, 48677, 48679, 48731, 48733, 48751, 48757, 48761, 48767, 48779, 48781, 48787, 48799, 48809, 48817, 48821, 48823, 48847, 48857, 48859, 48869, 48871, 48883, 48889, 48907, 48947, 48953, 48973, 48989, 48991, 49003, 49009, 49019, 49031, 49033, 49037, 49043, 49057, 49069, 49081, 49103, 49109, 49117, 49121, 49123, 49139, 49157, 49169, 49171, 49177, 49193, 49199, 49201, 49207, 49211, 49223, 49253, 49261, 49277, 49279, 49297, 49307, 49331, 49333, 49339, 49363, 49367, 49369, 49391, 49393, 49409, 49411, 49417, 49429, 49433, 49451, 49459, 49463, 49477, 49481, 49499, 49523, 49529, 49531, 49537, 49547, 49549, 49559, 49597, 49603, 49613, 49627, 49633, 49639, 49663, 49667, 49669, 49681, 49697, 49711, 49727, 49739, 49741, 49747, 49757, 49783, 49787, 49789, 49801, 49807, 49811, 49823, 49831, 49843, 49853, 49871, 49877, 49891, 49919, 49921, 49927, 49937, 49939, 49943, 49957, 49991, 49993, 49999, 50021, 50023, 50033, 50047, 50051, 50053, 50069, 50077, 50087, 50093, 50101, 50111, 50119, 50123, 50129, 50131, 50147, 50153, 50159, 50177, 50207, 50221, 50227, 50231, 50261, 50263, 50273, 50287, 50291, 50311, 50321, 50329, 50333, 50341, 50359, 50363, 50377, 50383, 50387, 50411, 50417, 50423, 50441, 50459, 50461, 50497, 50503, 50513, 50527, 50539, 50543, 50549, 50551, 50581, 50587, 50591, 50593, 50599, 50627, 50647, 50651, 50671, 50683, 50707, 50723, 50741, 50753, 50767, 50773, 50777, 50789, 50821, 50833, 50839, 50849, 50857, 50867, 50873, 50891, 50893, 50909, 50923, 50929, 50951, 50957, 50969, 50971, 50989, 50993, 51001, 51031, 51043, 51047, 51059, 51061, 51071, 51109, 51131, 51133, 51137, 51151, 51157, 51169, 51193, 51197, 51199, 51203, 51217, 51229, 51239, 51241, 51257, 51263, 51283, 51287, 51307, 51329, 51341, 51343, 51347, 51349, 51361, 51383, 51407, 51413, 51419, 51421, 51427, 51431, 51437, 51439, 51449, 51461, 51473, 51479, 51481, 51487, 51503, 51511, 51517, 51521, 51539, 51551, 51563, 51577, 51581, 51593, 51599, 51607, 51613, 51631, 51637, 51647, 51659, 51673, 51679, 51683, 51691, 51713, 51719, 51721, 51749, 51767, 51769, 51787, 51797, 51803, 51817, 51827, 51829, 51839, 51853, 51859, 51869, 51871, 51893, 51899, 51907, 51913, 51929, 51941, 51949, 51971, 51973, 51977, 51991, 52009, 52021, 52027, 52051, 52057, 52067, 52069, 52081, 52103, 52121, 52127, 52147, 52153, 52163, 52177, 52181, 52183, 52189, 52201, 52223, 52237, 52249, 52253, 52259, 52267, 52289, 52291, 52301, 52313, 52321, 52361, 52363, 52369, 52379, 52387, 52391, 52433, 52453, 52457, 52489, 52501, 52511, 52517, 52529, 52541, 52543, 52553, 52561, 52567, 52571, 52579, 52583, 52609, 52627, 52631, 52639, 52667, 52673, 52691, 52697, 52709, 52711, 52721, 52727, 52733, 52747, 52757, 52769, 52783, 52807, 52813, 52817, 52837, 52859, 52861, 52879, 52883, 52889, 52901, 52903, 52919, 52937, 52951, 52957, 52963, 52967, 52973, 52981, 52999, 53003, 53017, 53047, 53051, 53069, 53077, 53087, 53089, 53093, 53101, 53113, 53117, 53129, 53147, 53149, 53161, 53171, 53173, 53189, 53197, 53201, 53231, 53233, 53239, 53267, 53269, 53279, 53281, 53299, 53309, 53323, 53327, 53353, 53359, 53377, 53381, 53401, 53407, 53411, 53419, 53437, 53441, 53453, 53479, 53503, 53507, 53527, 53549, 53551, 53569, 53591, 53593, 53597, 53609, 53611, 53617, 53623, 53629, 53633, 53639, 53653, 53657, 53681, 53693, 53699, 53717, 53719, 53731, 53759, 53773, 53777, 53783, 53791, 53813, 53819, 53831, 53849, 53857, 53861, 53881, 53887, 53891, 53897, 53899, 53917, 53923, 53927, 53939, 53951, 53959, 53987, 53993, 54001, 54011, 54013, 54037, 54049, 54059, 54083, 54091, 54101, 54121, 54133, 54139, 54151, 54163, 54167, 54181, 54193, 54217, 54251, 54269, 54277, 54287, 54293, 54311, 54319, 54323, 54331, 54347, 54361, 54367, 54371, 54377, 54401, 54403, 54409, 54413, 54419, 54421, 54437, 54443, 54449, 54469, 54493, 54497, 54499, 54503, 54517, 54521, 54539, 54541, 54547, 54559, 54563, 54577, 54581, 54583, 54601, 54617, 54623, 54629, 54631, 54647, 54667, 54673, 54679, 54709, 54713, 54721, 54727, 54751, 54767, 54773, 54779, 54787, 54799, 54829, 54833, 54851, 54869, 54877, 54881, 54907, 54917, 54919, 54941, 54949, 54959, 54973, 54979, 54983, 55001, 55009, 55021, 55049, 55051, 55057, 55061, 55073, 55079, 55103, 55109, 55117, 55127, 55147, 55163, 55171, 55201, 55207, 55213, 55217, 55219, 55229, 55243, 55249, 55259, 55291, 55313, 55331, 55333, 55337, 55339, 55343, 55351, 55373, 55381, 55399, 55411, 55439, 55441, 55457, 55469, 55487, 55501, 55511, 55529, 55541, 55547, 55579, 55589, 55603, 55609, 55619, 55621, 55631, 55633, 55639, 55661, 55663, 55667, 55673, 55681, 55691, 55697, 55711, 55717, 55721, 55733, 55763, 55787, 55793, 55799, 55807, 55813, 55817, 55819, 55823, 55829, 55837, 55843, 55849, 55871, 55889, 55897, 55901, 55903, 55921, 55927, 55931, 55933, 55949, 55967, 55987, 55997, 56003, 56009, 56039, 56041, 56053, 56081, 56087, 56093, 56099, 56101, 56113, 56123, 56131, 56149, 56167, 56171, 56179, 56197, 56207, 56209, 56237, 56239, 56249, 56263, 56267, 56269, 56299, 56311, 56333, 56359, 56369, 56377, 56383, 56393, 56401, 56417, 56431, 56437, 56443, 56453, 56467, 56473, 56477, 56479, 56489, 56501, 56503, 56509, 56519, 56527, 56531, 56533, 56543, 56569, 56591, 56597, 56599, 56611, 56629, 56633, 56659, 56663, 56671, 56681, 56687, 56701, 56711, 56713, 56731, 56737, 56747, 56767, 56773, 56779, 56783, 56807, 56809, 56813, 56821, 56827, 56843, 56857, 56873, 56891, 56893, 56897, 56909, 56911, 56921, 56923, 56929, 56941, 56951, 56957, 56963, 56983, 56989, 56993, 56999, 57037, 57041, 57047, 57059, 57073, 57077, 57089, 57097, 57107, 57119, 57131, 57139, 57143, 57149, 57163, 57173, 57179, 57191, 57193, 57203, 57221, 57223, 57241, 57251, 57259, 57269, 57271, 57283, 57287, 57301, 57329, 57331, 57347, 57349, 57367, 57373, 57383, 57389, 57397, 57413, 57427, 57457, 57467, 57487, 57493, 57503, 57527, 57529, 57557, 57559, 57571, 57587, 57593, 57601, 57637, 57641, 57649, 57653, 57667, 57679, 57689, 57697, 57709, 57713, 57719, 57727, 57731, 57737, 57751, 57773, 57781, 57787, 57791, 57793, 57803, 57809, 57829, 57839, 57847, 57853, 57859, 57881, 57899, 57901, 57917, 57923, 57943, 57947, 57973, 57977, 57991, 58013, 58027, 58031, 58043, 58049, 58057, 58061, 58067, 58073, 58099, 58109, 58111, 58129, 58147, 58151, 58153, 58169, 58171, 58189, 58193, 58199, 58207, 58211, 58217, 58229, 58231, 58237, 58243, 58271, 58309, 58313, 58321, 58337, 58363, 58367, 58369, 58379, 58391, 58393, 58403, 58411, 58417, 58427, 58439, 58441, 58451, 58453, 58477, 58481, 58511, 58537, 58543, 58549, 58567, 58573, 58579, 58601, 58603, 58613, 58631, 58657, 58661, 58679, 58687, 58693, 58699, 58711, 58727, 58733, 58741, 58757, 58763, 58771, 58787, 58789, 58831, 58889, 58897, 58901, 58907, 58909, 58913, 58921, 58937, 58943, 58963, 58967, 58979, 58991, 58997, 59009, 59011, 59021, 59023, 59029, 59051, 59053, 59063, 59069, 59077, 59083, 59093, 59107, 59113, 59119, 59123, 59141, 59149, 59159, 59167, 59183, 59197, 59207, 59209, 59219, 59221, 59233, 59239, 59243, 59263, 59273, 59281, 59333, 59341, 59351, 59357, 59359, 59369, 59377, 59387, 59393, 59399, 59407, 59417, 59419, 59441, 59443, 59447, 59453, 59467, 59471, 59473, 59497, 59509, 59513, 59539, 59557, 59561, 59567, 59581, 59611, 59617, 59621, 59627, 59629, 59651, 59659, 59663, 59669, 59671, 59693, 59699, 59707, 59723, 59729, 59743, 59747, 59753, 59771, 59779, 59791, 59797, 59809, 59833, 59863, 59879, 59887, 59921, 59929, 59951, 59957, 59971, 59981, 59999, 60013, 60017, 60029, 60037, 60041, 60077, 60083, 60089, 60091, 60101, 60103, 60107, 60127, 60133, 60139, 60149, 60161, 60167, 60169, 60209, 60217, 60223, 60251, 60257, 60259, 60271, 60289, 60293, 60317, 60331, 60337, 60343, 60353, 60373, 60383, 60397, 60413, 60427, 60443, 60449, 60457, 60493, 60497, 60509, 60521, 60527, 60539, 60589, 60601, 60607, 60611, 60617, 60623, 60631, 60637, 60647, 60649, 60659, 60661, 60679, 60689, 60703, 60719, 60727, 60733, 60737, 60757, 60761, 60763, 60773, 60779, 60793, 60811, 60821, 60859, 60869, 60887, 60889, 60899, 60901, 60913, 60917, 60919, 60923, 60937, 60943, 60953, 60961, 61001, 61007, 61027, 61031, 61043, 61051, 61057, 61091, 61099, 61121, 61129, 61141, 61151, 61153, 61169, 61211, 61223, 61231, 61253, 61261, 61283, 61291, 61297, 61331, 61333, 61339, 61343, 61357, 61363, 61379, 61381, 61403, 61409, 61417, 61441, 61463, 61469, 61471, 61483, 61487, 61493, 61507, 61511, 61519, 61543, 61547, 61553, 61559, 61561, 61583, 61603, 61609, 61613, 61627, 61631, 61637, 61643, 61651, 61657, 61667, 61673, 61681, 61687, 61703, 61717, 61723, 61729, 61751, 61757, 61781, 61813, 61819, 61837, 61843, 61861, 61871, 61879, 61909, 61927, 61933, 61949, 61961, 61967, 61979, 61981, 61987, 61991, 62003, 62011, 62017, 62039, 62047, 62053, 62057, 62071, 62081, 62099, 62119, 62129, 62131, 62137, 62141, 62143, 62171, 62189, 62191, 62201, 62207, 62213, 62219, 62233, 62273, 62297, 62299, 62303, 62311, 62323, 62327, 62347, 62351, 62383, 62401, 62417, 62423, 62459, 62467, 62473, 62477, 62483, 62497, 62501, 62507, 62533, 62539, 62549, 62563, 62581, 62591, 62597, 62603, 62617, 62627, 62633, 62639, 62653, 62659, 62683, 62687, 62701, 62723, 62731, 62743, 62753, 62761, 62773, 62791, 62801, 62819, 62827, 62851, 62861, 62869, 62873, 62897, 62903, 62921, 62927, 62929, 62939, 62969, 62971, 62981, 62983, 62987, 62989, 63029, 63031, 63059, 63067, 63073, 63079, 63097, 63103, 63113, 63127, 63131, 63149, 63179, 63197, 63199, 63211, 63241, 63247, 63277, 63281, 63299, 63311, 63313, 63317, 63331, 63337, 63347, 63353, 63361, 63367, 63377, 63389, 63391, 63397, 63409, 63419, 63421, 63439, 63443, 63463, 63467, 63473, 63487, 63493, 63499, 63521, 63527, 63533, 63541, 63559, 63577, 63587, 63589, 63599, 63601, 63607, 63611, 63617, 63629, 63647, 63649, 63659, 63667, 63671, 63689, 63691, 63697, 63703, 63709, 63719, 63727, 63737, 63743, 63761, 63773, 63781, 63793, 63799, 63803, 63809, 63823, 63839, 63841, 63853, 63857, 63863, 63901, 63907, 63913, 63929, 63949, 63977, 63997, 64007, 64013, 64019, 64033, 64037, 64063, 64067, 64081, 64091, 64109, 64123, 64151, 64153, 64157, 64171, 64187, 64189, 64217, 64223, 64231, 64237, 64271, 64279, 64283, 64301, 64303, 64319, 64327, 64333, 64373, 64381, 64399, 64403, 64433, 64439, 64451, 64453, 64483, 64489, 64499, 64513, 64553, 64567, 64577, 64579, 64591, 64601, 64609, 64613, 64621, 64627, 64633, 64661, 64663, 64667, 64679, 64693, 64709, 64717, 64747, 64763, 64781, 64783, 64793, 64811, 64817, 64849, 64853, 64871, 64877, 64879, 64891, 64901, 64919, 64921, 64927, 64937, 64951, 64969, 64997, 65003, 65011, 65027, 65029, 65033, 65053, 65063, 65071, 65089, 65099, 65101, 65111, 65119, 65123, 65129, 65141, 65147, 65167, 65171, 65173, 65179, 65183, 65203, 65213, 65239, 65257, 65267, 65269, 65287, 65293, 65309, 65323, 65327, 65353, 65357, 65371, 65381, 65393, 65407, 65413, 65419, 65423, 65437, 65447, 65449, 65479, 65497, 65519, 65521, 65537, 65539, 65543, 65551, 65557, 65563, 65579, 65581, 65587, 65599, 65609, 65617, 65629, 65633, 65647, 65651, 65657, 65677, 65687, 65699, 65701, 65707, 65713, 65717, 65719, 65729, 65731, 65761, 65777, 65789, 65809, 65827, 65831, 65837, 65839, 65843, 65851, 65867, 65881, 65899, 65921, 65927, 65929, 65951, 65957, 65963, 65981, 65983, 65993, 66029, 66037, 66041, 66047, 66067, 66071, 66083, 66089, 66103, 66107, 66109, 66137, 66161, 66169, 66173, 66179, 66191, 66221, 66239, 66271, 66293, 66301, 66337, 66343, 66347, 66359, 66361, 66373, 66377, 66383, 66403, 66413, 66431, 66449, 66457, 66463, 66467, 66491, 66499, 66509, 66523, 66529, 66533, 66541, 66553, 66569, 66571, 66587, 66593, 66601, 66617, 66629, 66643, 66653, 66683, 66697, 66701, 66713, 66721, 66733, 66739, 66749, 66751, 66763, 66791, 66797, 66809, 66821, 66841, 66851, 66853, 66863, 66877, 66883, 66889, 66919, 66923, 66931, 66943, 66947, 66949, 66959, 66973, 66977, 67003, 67021, 67033, 67043, 67049, 67057, 67061, 67073, 67079, 67103, 67121, 67129, 67139, 67141, 67153, 67157, 67169, 67181, 67187, 67189, 67211, 67213, 67217, 67219, 67231, 67247, 67261, 67271, 67273, 67289, 67307, 67339, 67343, 67349, 67369, 67391, 67399, 67409, 67411, 67421, 67427, 67429, 67433, 67447, 67453, 67477, 67481, 67489, 67493, 67499, 67511, 67523, 67531, 67537, 67547, 67559, 67567, 67577, 67579, 67589, 67601, 67607, 67619, 67631, 67651, 67679, 67699, 67709, 67723, 67733, 67741, 67751, 67757, 67759, 67763, 67777, 67783, 67789, 67801, 67807, 67819, 67829, 67843, 67853, 67867, 67883, 67891, 67901, 67927, 67931, 67933, 67939, 67943, 67957, 67961, 67967, 67979, 67987, 67993, 68023, 68041, 68053, 68059, 68071, 68087, 68099, 68111, 68113, 68141, 68147, 68161, 68171, 68207, 68209, 68213, 68219, 68227, 68239, 68261, 68279, 68281, 68311, 68329, 68351, 68371, 68389, 68399, 68437, 68443, 68447, 68449, 68473, 68477, 68483, 68489, 68491, 68501, 68507, 68521, 68531, 68539, 68543, 68567, 68581, 68597, 68611, 68633, 68639, 68659, 68669, 68683, 68687, 68699, 68711, 68713, 68729, 68737, 68743, 68749, 68767, 68771, 68777, 68791, 68813, 68819, 68821, 68863, 68879, 68881, 68891, 68897, 68899, 68903, 68909, 68917, 68927, 68947, 68963, 68993, 69001, 69011, 69019, 69029, 69031, 69061, 69067, 69073, 69109, 69119, 69127, 69143, 69149, 69151, 69163, 69191, 69193, 69197, 69203, 69221, 69233, 69239, 69247, 69257, 69259, 69263, 69313, 69317, 69337, 69341, 69371, 69379, 69383, 69389, 69401, 69403, 69427, 69431, 69439, 69457, 69463, 69467, 69473, 69481, 69491, 69493, 69497, 69499, 69539, 69557, 69593, 69623, 69653, 69661, 69677, 69691, 69697, 69709, 69737, 69739, 69761, 69763, 69767, 69779, 69809, 69821, 69827, 69829, 69833, 69847, 69857, 69859, 69877, 69899, 69911, 69929, 69931, 69941, 69959, 69991, 69997, 70001, 70003, 70009, 70019, 70039, 70051, 70061, 70067, 70079, 70099, 70111, 70117, 70121, 70123, 70139, 70141, 70157, 70163, 70177, 70181, 70183, 70199, 70201, 70207, 70223, 70229, 70237, 70241, 70249, 70271, 70289, 70297, 70309, 70313, 70321, 70327, 70351, 70373, 70379, 70381, 70393, 70423, 70429, 70439, 70451, 70457, 70459, 70481, 70487, 70489, 70501, 70507, 70529, 70537, 70549, 70571, 70573, 70583, 70589, 70607, 70619, 70621, 70627, 70639, 70657, 70663, 70667, 70687, 70709, 70717, 70729, 70753, 70769, 70783, 70793, 70823, 70841, 70843, 70849, 70853, 70867, 70877, 70879, 70891, 70901, 70913, 70919, 70921, 70937, 70949, 70951, 70957, 70969, 70979, 70981, 70991, 70997, 70999, 71011, 71023, 71039, 71059, 71069, 71081, 71089, 71119, 71129, 71143, 71147, 71153, 71161, 71167, 71171, 71191, 71209, 71233, 71237, 71249, 71257, 71261, 71263, 71287, 71293, 71317, 71327, 71329, 71333, 71339, 71341, 71347, 71353, 71359, 71363, 71387, 71389, 71399, 71411, 71413, 71419, 71429, 71437, 71443, 71453, 71471, 71473, 71479, 71483, 71503, 71527, 71537, 71549, 71551, 71563, 71569, 71593, 71597, 71633, 71647, 71663, 71671, 71693, 71699, 71707, 71711, 71713, 71719, 71741, 71761, 71777, 71789, 71807, 71809, 71821, 71837, 71843, 71849, 71861, 71867, 71879, 71881, 71887, 71899, 71909, 71917, 71933, 71941, 71947, 71963, 71971, 71983, 71987, 71993, 71999, 72019, 72031, 72043, 72047, 72053, 72073, 72077, 72089, 72091, 72101, 72103, 72109, 72139, 72161, 72167, 72169, 72173, 72211, 72221, 72223, 72227, 72229, 72251, 72253, 72269, 72271, 72277, 72287, 72307, 72313, 72337, 72341, 72353, 72367, 72379, 72383, 72421, 72431, 72461, 72467, 72469, 72481, 72493, 72497, 72503, 72533, 72547, 72551, 72559, 72577, 72613, 72617, 72623, 72643, 72647, 72649, 72661, 72671, 72673, 72679, 72689, 72701, 72707, 72719, 72727, 72733, 72739, 72763, 72767, 72797, 72817, 72823, 72859, 72869, 72871, 72883, 72889, 72893, 72901, 72907, 72911, 72923, 72931, 72937, 72949, 72953, 72959, 72973, 72977, 72997, 73009, 73013, 73019, 73037, 73039, 73043, 73061, 73063, 73079, 73091, 73121, 73127, 73133, 73141, 73181, 73189, 73237, 73243, 73259, 73277, 73291, 73303, 73309, 73327, 73331, 73351, 73361, 73363, 73369, 73379, 73387, 73417, 73421, 73433, 73453, 73459, 73471, 73477, 73483, 73517, 73523, 73529, 73547, 73553, 73561, 73571, 73583, 73589, 73597, 73607, 73609, 73613, 73637, 73643, 73651, 73673, 73679, 73681, 73693, 73699, 73709, 73721, 73727, 73751, 73757, 73771, 73783, 73819, 73823, 73847, 73849, 73859, 73867, 73877, 73883, 73897, 73907, 73939, 73943, 73951, 73961, 73973, 73999, 74017, 74021, 74027, 74047, 74051, 74071, 74077, 74093, 74099, 74101, 74131, 74143, 74149, 74159, 74161, 74167, 74177, 74189, 74197, 74201, 74203, 74209, 74219, 74231, 74257, 74279, 74287, 74293, 74297, 74311, 74317, 74323, 74353, 74357, 74363, 74377, 74381, 74383, 74411, 74413, 74419, 74441, 74449, 74453, 74471, 74489, 74507, 74509, 74521, 74527, 74531, 74551, 74561, 74567, 74573, 74587, 74597, 74609, 74611, 74623, 74653, 74687, 74699, 74707, 74713, 74717, 74719, 74729, 74731, 74747, 74759, 74761, 74771, 74779, 74797, 74821, 74827, 74831, 74843, 74857, 74861, 74869, 74873, 74887, 74891, 74897, 74903, 74923, 74929, 74933, 74941, 74959, 75011, 75013, 75017, 75029, 75037, 75041, 75079, 75083, 75109, 75133, 75149, 75161, 75167, 75169, 75181, 75193, 75209, 75211, 75217, 75223, 75227, 75239, 75253, 75269, 75277, 75289, 75307, 75323, 75329, 75337, 75347, 75353, 75367, 75377, 75389, 75391, 75401, 75403, 75407, 75431, 75437, 75479, 75503, 75511, 75521, 75527, 75533, 75539, 75541, 75553, 75557, 75571, 75577, 75583, 75611, 75617, 75619, 75629, 75641, 75653, 75659, 75679, 75683, 75689, 75703, 75707, 75709, 75721, 75731, 75743, 75767, 75773, 75781, 75787, 75793, 75797, 75821, 75833, 75853, 75869, 75883, 75913, 75931, 75937, 75941, 75967, 75979, 75983, 75989, 75991, 75997, 76001, 76003, 76031, 76039, 76079, 76081, 76091, 76099, 76103, 76123, 76129, 76147, 76157, 76159, 76163, 76207, 76213, 76231, 76243, 76249, 76253, 76259, 76261, 76283, 76289, 76303, 76333, 76343, 76367, 76369, 76379, 76387, 76403, 76421, 76423, 76441, 76463, 76471, 76481, 76487, 76493, 76507, 76511, 76519, 76537, 76541, 76543, 76561, 76579, 76597, 76603, 76607, 76631, 76649, 76651, 76667, 76673, 76679, 76697, 76717, 76733, 76753, 76757, 76771, 76777, 76781, 76801, 76819, 76829, 76831, 76837, 76847, 76871, 76873, 76883, 76907, 76913, 76919, 76943, 76949, 76961, 76963, 76991, 77003, 77017, 77023, 77029, 77041, 77047, 77069, 77081, 77093, 77101, 77137, 77141, 77153, 77167, 77171, 77191, 77201, 77213, 77237, 77239, 77243, 77249, 77261, 77263, 77267, 77269, 77279, 77291, 77317, 77323, 77339, 77347, 77351, 77359, 77369, 77377, 77383, 77417, 77419, 77431, 77447, 77471, 77477, 77479, 77489, 77491, 77509, 77513, 77521, 77527, 77543, 77549, 77551, 77557, 77563, 77569, 77573, 77587, 77591, 77611, 77617, 77621, 77641, 77647, 77659, 77681, 77687, 77689, 77699, 77711, 77713, 77719, 77723, 77731, 77743, 77747, 77761, 77773, 77783, 77797, 77801, 77813, 77839, 77849, 77863, 77867, 77893, 77899, 77929, 77933, 77951, 77969, 77977, 77983, 77999, 78007, 78017, 78031, 78041, 78049, 78059, 78079, 78101, 78121, 78137, 78139, 78157, 78163, 78167, 78173, 78179, 78191, 78193, 78203, 78229, 78233, 78241, 78259, 78277, 78283, 78301, 78307, 78311, 78317, 78341, 78347, 78367, 78401, 78427, 78437, 78439, 78467, 78479, 78487, 78497, 78509, 78511, 78517, 78539, 78541, 78553, 78569, 78571, 78577, 78583, 78593, 78607, 78623, 78643, 78649, 78653, 78691, 78697, 78707, 78713, 78721, 78737, 78779, 78781, 78787, 78791, 78797, 78803, 78809, 78823, 78839, 78853, 78857, 78877, 78887, 78889, 78893, 78901, 78919, 78929, 78941, 78977, 78979, 78989, 79031, 79039, 79043, 79063, 79087, 79103, 79111, 79133, 79139, 79147, 79151, 79153, 79159, 79181, 79187, 79193, 79201, 79229, 79231, 79241, 79259, 79273, 79279, 79283, 79301, 79309, 79319, 79333, 79337, 79349, 79357, 79367, 79379, 79393, 79397, 79399, 79411, 79423, 79427, 79433, 79451, 79481, 79493, 79531, 79537, 79549, 79559, 79561, 79579, 79589, 79601, 79609, 79613, 79621, 79627, 79631, 79633, 79657, 79669, 79687, 79691, 79693, 79697, 79699, 79757, 79769, 79777, 79801, 79811, 79813, 79817, 79823, 79829, 79841, 79843, 79847, 79861, 79867, 79873, 79889, 79901, 79903, 79907, 79939, 79943, 79967, 79973, 79979, 79987, 79997, 79999, 80021, 80039, 80051, 80071, 80077, 80107, 80111, 80141, 80147, 80149, 80153, 80167, 80173, 80177, 80191, 80207, 80209, 80221, 80231, 80233, 80239, 80251, 80263, 80273, 80279, 80287, 80309, 80317, 80329, 80341, 80347, 80363, 80369, 80387, 80407, 80429, 80447, 80449, 80471, 80473, 80489, 80491, 80513, 80527, 80537, 80557, 80567, 80599, 80603, 80611, 80621, 80627, 80629, 80651, 80657, 80669, 80671, 80677, 80681, 80683, 80687, 80701, 80713, 80737, 80747, 80749, 80761, 80777, 80779, 80783, 80789, 80803, 80809, 80819, 80831, 80833, 80849, 80863, 80897, 80909, 80911, 80917, 80923, 80929, 80933, 80953, 80963, 80989, 81001, 81013, 81017, 81019, 81023, 81031, 81041, 81043, 81047, 81049, 81071, 81077, 81083, 81097, 81101, 81119, 81131, 81157, 81163, 81173, 81181, 81197, 81199, 81203, 81223, 81233, 81239, 81281, 81283, 81293, 81299, 81307, 81331, 81343, 81349, 81353, 81359, 81371, 81373, 81401, 81409, 81421, 81439, 81457, 81463, 81509, 81517, 81527, 81533, 81547, 81551, 81553, 81559, 81563, 81569, 81611, 81619, 81629, 81637, 81647, 81649, 81667, 81671, 81677, 81689, 81701, 81703, 81707, 81727, 81737, 81749, 81761, 81769, 81773, 81799, 81817, 81839, 81847, 81853, 81869, 81883, 81899, 81901, 81919, 81929, 81931, 81937, 81943, 81953, 81967, 81971, 81973, 82003, 82007, 82009, 82013, 82021, 82031, 82037, 82039, 82051, 82067, 82073, 82129, 82139, 82141, 82153, 82163, 82171, 82183, 82189, 82193, 82207, 82217, 82219, 82223, 82231, 82237, 82241, 82261, 82267, 82279, 82301, 82307, 82339, 82349, 82351, 82361, 82373, 82387, 82393, 82421, 82457, 82463, 82469, 82471, 82483, 82487, 82493, 82499, 82507, 82529, 82531, 82549, 82559, 82561, 82567, 82571, 82591, 82601, 82609, 82613, 82619, 82633, 82651, 82657, 82699, 82721, 82723, 82727, 82729, 82757, 82759, 82763, 82781, 82787, 82793, 82799, 82811, 82813, 82837, 82847, 82883, 82889, 82891, 82903, 82913, 82939, 82963, 82981, 82997, 83003, 83009, 83023, 83047, 83059, 83063, 83071, 83077, 83089, 83093, 83101, 83117, 83137, 83177, 83203, 83207, 83219, 83221, 83227, 83231, 83233, 83243, 83257, 83267, 83269, 83273, 83299, 83311, 83339, 83341, 83357, 83383, 83389, 83399, 83401, 83407, 83417, 83423, 83431, 83437, 83443, 83449, 83459, 83471, 83477, 83497, 83537, 83557, 83561, 83563, 83579, 83591, 83597, 83609, 83617, 83621, 83639, 83641, 83653, 83663, 83689, 83701, 83717, 83719, 83737, 83761, 83773, 83777, 83791, 83813, 83833, 83843, 83857, 83869, 83873, 83891, 83903, 83911, 83921, 83933, 83939, 83969, 83983, 83987, 84011, 84017, 84047, 84053, 84059, 84061, 84067, 84089, 84121, 84127, 84131, 84137, 84143, 84163, 84179, 84181, 84191, 84199, 84211, 84221, 84223, 84229, 84239, 84247, 84263, 84299, 84307, 84313, 84317, 84319, 84347, 84349, 84377, 84389, 84391, 84401, 84407, 84421, 84431, 84437, 84443, 84449, 84457, 84463, 84467, 84481, 84499, 84503, 84509, 84521, 84523, 84533, 84551, 84559, 84589, 84629, 84631, 84649, 84653, 84659, 84673, 84691, 84697, 84701, 84713, 84719, 84731, 84737, 84751, 84761, 84787, 84793, 84809, 84811, 84827, 84857, 84859, 84869, 84871, 84913, 84919, 84947, 84961, 84967, 84977, 84979, 84991, 85009, 85021, 85027, 85037, 85049, 85061, 85081, 85087, 85091, 85093, 85103, 85109, 85121, 85133, 85147, 85159, 85193, 85199, 85201, 85213, 85223, 85229, 85237, 85243, 85247, 85259, 85297, 85303, 85313, 85331, 85333, 85361, 85363, 85369, 85381, 85411, 85427, 85429, 85439, 85447, 85451, 85453, 85469, 85487, 85513, 85517, 85523, 85531, 85549, 85571, 85577, 85597, 85601, 85607, 85619, 85621, 85627, 85639, 85643, 85661, 85667, 85669, 85691, 85703, 85711, 85717, 85733, 85751, 85781, 85793, 85817, 85819, 85829, 85831, 85837, 85843, 85847, 85853, 85889, 85903, 85909, 85931, 85933, 85991, 85999, 86011, 86017, 86027, 86029, 86069, 86077, 86083, 86111, 86113, 86117, 86131, 86137, 86143, 86161, 86171, 86179, 86183, 86197, 86201, 86209, 86239, 86243, 86249, 86257, 86263, 86269, 86287, 86291, 86293, 86297, 86311, 86323, 86341, 86351, 86353, 86357, 86369, 86371, 86381, 86389, 86399, 86413, 86423, 86441, 86453, 86461, 86467, 86477, 86491, 86501, 86509, 86531, 86533, 86539, 86561, 86573, 86579, 86587, 86599, 86627, 86629, 86677, 86689, 86693, 86711, 86719, 86729, 86743, 86753, 86767, 86771, 86783, 86813, 86837, 86843, 86851, 86857, 86861, 86869, 86923, 86927, 86929, 86939, 86951, 86959, 86969, 86981, 86993, 87011, 87013, 87037, 87041, 87049, 87071, 87083, 87103, 87107, 87119, 87121, 87133, 87149, 87151, 87179, 87181, 87187, 87211, 87221, 87223, 87251, 87253, 87257, 87277, 87281, 87293, 87299, 87313, 87317, 87323, 87337, 87359, 87383, 87403, 87407, 87421, 87427, 87433, 87443, 87473, 87481, 87491, 87509, 87511, 87517, 87523, 87539, 87541, 87547, 87553, 87557, 87559, 87583, 87587, 87589, 87613, 87623, 87629, 87631, 87641, 87643, 87649, 87671, 87679, 87683, 87691, 87697, 87701, 87719, 87721, 87739, 87743, 87751, 87767, 87793, 87797, 87803, 87811, 87833, 87853, 87869, 87877, 87881, 87887, 87911, 87917, 87931, 87943, 87959, 87961, 87973, 87977, 87991, 88001, 88003, 88007, 88019, 88037, 88069, 88079, 88093, 88117, 88129, 88169, 88177, 88211, 88223, 88237, 88241, 88259, 88261, 88289, 88301, 88321, 88327, 88337, 88339, 88379, 88397, 88411, 88423, 88427, 88463, 88469, 88471, 88493, 88499, 88513, 88523, 88547, 88589, 88591, 88607, 88609, 88643, 88651, 88657, 88661, 88663, 88667, 88681, 88721, 88729, 88741, 88747, 88771, 88789, 88793, 88799, 88801, 88807, 88811, 88813, 88817, 88819, 88843, 88853, 88861, 88867, 88873, 88883, 88897, 88903, 88919, 88937, 88951, 88969, 88993, 88997, 89003, 89009, 89017, 89021, 89041, 89051, 89057, 89069, 89071, 89083, 89087, 89101, 89107, 89113, 89119, 89123, 89137, 89153, 89189, 89203, 89209, 89213, 89227, 89231, 89237, 89261, 89269, 89273, 89293, 89303, 89317, 89329, 89363, 89371, 89381, 89387, 89393, 89399, 89413, 89417, 89431, 89443, 89449, 89459, 89477, 89491, 89501, 89513, 89519, 89521, 89527, 89533, 89561, 89563, 89567, 89591, 89597, 89599, 89603, 89611, 89627, 89633, 89653, 89657, 89659, 89669, 89671, 89681, 89689, 89753, 89759, 89767, 89779, 89783, 89797, 89809, 89819, 89821, 89833, 89839, 89849, 89867, 89891, 89897, 89899, 89909, 89917, 89923, 89939, 89959, 89963, 89977, 89983, 89989, 90001, 90007, 90011, 90017, 90019, 90023, 90031, 90053, 90059, 90067, 90071, 90073, 90089, 90107, 90121, 90127, 90149, 90163, 90173, 90187, 90191, 90197, 90199, 90203, 90217, 90227, 90239, 90247, 90263, 90271, 90281, 90289, 90313, 90353, 90359, 90371, 90373, 90379, 90397, 90401, 90403, 90407, 90437, 90439, 90469, 90473, 90481, 90499, 90511, 90523, 90527, 90529, 90533, 90547, 90583, 90599, 90617, 90619, 90631, 90641, 90647, 90659, 90677, 90679, 90697, 90703, 90709, 90731, 90749, 90787, 90793, 90803, 90821, 90823, 90833, 90841, 90847, 90863, 90887, 90901, 90907, 90911, 90917, 90931, 90947, 90971, 90977, 90989, 90997, 91009, 91019, 91033, 91079, 91081, 91097, 91099, 91121, 91127, 91129, 91139, 91141, 91151, 91153, 91159, 91163, 91183, 91193, 91199, 91229, 91237, 91243, 91249, 91253, 91283, 91291, 91297, 91303, 91309, 91331, 91367, 91369, 91373, 91381, 91387, 91393, 91397, 91411, 91423, 91433, 91453, 91457, 91459, 91463, 91493, 91499, 91513, 91529, 91541, 91571, 91573, 91577, 91583, 91591, 91621, 91631, 91639, 91673, 91691, 91703, 91711, 91733, 91753, 91757, 91771, 91781, 91801, 91807, 91811, 91813, 91823, 91837, 91841, 91867, 91873, 91909, 91921, 91939, 91943, 91951, 91957, 91961, 91967, 91969, 91997, 92003, 92009, 92033, 92041, 92051, 92077, 92083, 92107, 92111, 92119, 92143, 92153, 92173, 92177, 92179, 92189, 92203, 92219, 92221, 92227, 92233, 92237, 92243, 92251, 92269, 92297, 92311, 92317, 92333, 92347, 92353, 92357, 92363, 92369, 92377, 92381, 92383, 92387, 92399, 92401, 92413, 92419, 92431, 92459, 92461, 92467, 92479, 92489, 92503, 92507, 92551, 92557, 92567, 92569, 92581, 92593, 92623, 92627, 92639, 92641, 92647, 92657, 92669, 92671, 92681, 92683, 92693, 92699, 92707, 92717, 92723, 92737, 92753, 92761, 92767, 92779, 92789, 92791, 92801, 92809, 92821, 92831, 92849, 92857, 92861, 92863, 92867, 92893, 92899, 92921, 92927, 92941, 92951, 92957, 92959, 92987, 92993, 93001, 93047, 93053, 93059, 93077, 93083, 93089, 93097, 93103, 93113, 93131, 93133, 93139, 93151, 93169, 93179, 93187, 93199, 93229, 93239, 93241, 93251, 93253, 93257, 93263, 93281, 93283, 93287, 93307, 93319, 93323, 93329, 93337, 93371, 93377, 93383, 93407, 93419, 93427, 93463, 93479, 93481, 93487, 93491, 93493, 93497, 93503, 93523, 93529, 93553, 93557, 93559, 93563, 93581, 93601, 93607, 93629, 93637, 93683, 93701, 93703, 93719, 93739, 93761, 93763, 93787, 93809, 93811, 93827, 93851, 93871, 93887, 93889, 93893, 93901, 93911, 93913, 93923, 93937, 93941, 93949, 93967, 93971, 93979, 93983, 93997, 94007, 94009, 94033, 94049, 94057, 94063, 94079, 94099, 94109, 94111, 94117, 94121, 94151, 94153, 94169, 94201, 94207, 94219, 94229, 94253, 94261, 94273, 94291, 94307, 94309, 94321, 94327, 94331, 94343, 94349, 94351, 94379, 94397, 94399, 94421, 94427, 94433, 94439, 94441, 94447, 94463, 94477, 94483, 94513, 94529, 94531, 94541, 94543, 94547, 94559, 94561, 94573, 94583, 94597, 94603, 94613, 94621, 94649, 94651, 94687, 94693, 94709, 94723, 94727, 94747, 94771, 94777, 94781, 94789, 94793, 94811, 94819, 94823, 94837, 94841, 94847, 94849, 94873, 94889, 94903, 94907, 94933, 94949, 94951, 94961, 94993, 94999, 95003, 95009, 95021, 95027, 95063, 95071, 95083, 95087, 95089, 95093, 95101, 95107, 95111, 95131, 95143, 95153, 95177, 95189, 95191, 95203, 95213, 95219, 95231, 95233, 95239, 95257, 95261, 95267, 95273, 95279, 95287, 95311, 95317, 95327, 95339, 95369, 95383, 95393, 95401, 95413, 95419, 95429, 95441, 95443, 95461, 95467, 95471, 95479, 95483, 95507, 95527, 95531, 95539, 95549, 95561, 95569, 95581, 95597, 95603, 95617, 95621, 95629, 95633, 95651, 95701, 95707, 95713, 95717, 95723, 95731, 95737, 95747, 95773, 95783, 95789, 95791, 95801, 95803, 95813, 95819, 95857, 95869, 95873, 95881, 95891, 95911, 95917, 95923, 95929, 95947, 95957, 95959, 95971, 95987, 95989, 96001, 96013, 96017, 96043, 96053, 96059, 96079, 96097, 96137, 96149, 96157, 96167, 96179, 96181, 96199, 96211, 96221, 96223, 96233, 96259, 96263, 96269, 96281, 96289, 96293, 96323, 96329, 96331, 96337, 96353, 96377, 96401, 96419, 96431, 96443, 96451, 96457, 96461, 96469, 96479, 96487, 96493, 96497, 96517, 96527, 96553, 96557, 96581, 96587, 96589, 96601, 96643, 96661, 96667, 96671, 96697, 96703, 96731, 96737, 96739, 96749, 96757, 96763, 96769, 96779, 96787, 96797, 96799, 96821, 96823, 96827, 96847, 96851, 96857, 96893, 96907, 96911, 96931, 96953, 96959, 96973, 96979, 96989, 96997, 97001, 97003, 97007, 97021, 97039, 97073, 97081, 97103, 97117, 97127, 97151, 97157, 97159, 97169, 97171, 97177, 97187, 97213, 97231, 97241, 97259, 97283, 97301, 97303, 97327, 97367, 97369, 97373, 97379, 97381, 97387, 97397, 97423, 97429, 97441, 97453, 97459, 97463, 97499, 97501, 97511, 97523, 97547, 97549, 97553, 97561, 97571, 97577, 97579, 97583, 97607, 97609, 97613, 97649, 97651, 97673, 97687, 97711, 97729, 97771, 97777, 97787, 97789, 97813, 97829, 97841, 97843, 97847, 97849, 97859, 97861, 97871, 97879, 97883, 97919, 97927, 97931, 97943, 97961, 97967, 97973, 97987, 98009, 98011, 98017, 98041, 98047, 98057, 98081, 98101, 98123, 98129, 98143, 98179, 98207, 98213, 98221, 98227, 98251, 98257, 98269, 98297, 98299, 98317, 98321, 98323, 98327, 98347, 98369, 98377, 98387, 98389, 98407, 98411, 98419, 98429, 98443, 98453, 98459, 98467, 98473, 98479, 98491, 98507, 98519, 98533, 98543, 98561, 98563, 98573, 98597, 98621, 98627, 98639, 98641, 98663, 98669, 98689, 98711, 98713, 98717, 98729, 98731, 98737, 98773, 98779, 98801, 98807, 98809, 98837, 98849, 98867, 98869, 98873, 98887, 98893, 98897, 98899, 98909, 98911, 98927, 98929, 98939, 98947, 98953, 98963, 98981, 98993, 98999, 99013, 99017, 99023, 99041, 99053, 99079, 99083, 99089, 99103, 99109, 99119, 99131, 99133, 99137, 99139, 99149, 99173, 99181, 99191, 99223, 99233, 99241, 99251, 99257, 99259, 99277, 99289, 99317, 99347, 99349, 99367, 99371, 99377, 99391, 99397, 99401, 99409, 99431, 99439, 99469, 99487, 99497, 99523, 99527, 99529, 99551, 99559, 99563, 99571, 99577, 99581, 99607, 99611, 99623, 99643, 99661, 99667, 99679, 99689, 99707, 99709, 99713, 99719, 99721, 99733, 99761, 99767, 99787, 99793, 99809, 99817, 99823, 99829, 99833, 99839, 99859, 99871, 99877, 99881, 99901, 99907, 99923, 99929, 99961, 99971, 99989, 99991, 100003, 100019, 100043, 100049, 100057, 100069, 100103, 100109, 100129, 100151, 100153, 100169, 100183, 100189, 100193, 100207, 100213, 100237, 100267, 100271, 100279, 100291, 100297, 100313, 100333, 100343, 100357, 100361, 100363, 100379, 100391, 100393, 100403, 100411, 100417, 100447, 100459, 100469, 100483, 100493, 100501, 100511, 100517, 100519, 100523, 100537, 100547, 100549, 100559, 100591, 100609, 100613, 100621, 100649, 100669, 100673, 100693, 100699, 100703, 100733, 100741, 100747, 100769, 100787, 100799, 100801, 100811, 100823, 100829, 100847, 100853, 100907, 100913, 100927, 100931, 100937, 100943, 100957, 100981, 100987, 100999, 101009, 101021, 101027, 101051, 101063, 101081, 101089, 101107, 101111, 101113, 101117, 101119, 101141, 101149, 101159, 101161, 101173, 101183, 101197, 101203, 101207, 101209, 101221, 101267, 101273, 101279, 101281, 101287, 101293, 101323, 101333, 101341, 101347, 101359, 101363, 101377, 101383, 101399, 101411, 101419, 101429, 101449, 101467, 101477, 101483, 101489, 101501, 101503, 101513, 101527, 101531, 101533, 101537, 101561, 101573, 101581, 101599, 101603, 101611, 101627, 101641, 101653, 101663, 101681, 101693, 101701, 101719, 101723, 101737, 101741, 101747, 101749, 101771, 101789, 101797, 101807, 101833, 101837, 101839, 101863, 101869, 101873, 101879, 101891, 101917, 101921, 101929, 101939, 101957, 101963, 101977, 101987, 101999, 102001, 102013, 102019, 102023, 102031, 102043, 102059, 102061, 102071, 102077, 102079, 102101, 102103, 102107, 102121, 102139, 102149, 102161, 102181, 102191, 102197, 102199, 102203, 102217, 102229, 102233, 102241, 102251, 102253, 102259, 102293, 102299, 102301, 102317, 102329, 102337, 102359, 102367, 102397, 102407, 102409, 102433, 102437, 102451, 102461, 102481, 102497, 102499, 102503, 102523, 102533, 102539, 102547, 102551, 102559, 102563, 102587, 102593, 102607, 102611, 102643, 102647, 102653, 102667, 102673, 102677, 102679, 102701, 102761, 102763, 102769, 102793, 102797, 102811, 102829, 102841, 102859, 102871, 102877, 102881, 102911, 102913, 102929, 102931, 102953, 102967, 102983, 103001, 103007, 103043, 103049, 103067, 103069, 103079, 103087, 103091, 103093, 103099, 103123, 103141, 103171, 103177, 103183, 103217, 103231, 103237, 103289, 103291, 103307, 103319, 103333, 103349, 103357, 103387, 103391, 103393, 103399, 103409, 103421, 103423, 103451, 103457, 103471, 103483, 103511, 103529, 103549, 103553, 103561, 103567, 103573, 103577, 103583, 103591, 103613, 103619, 103643, 103651, 103657, 103669, 103681, 103687, 103699, 103703, 103723, 103769, 103787, 103801, 103811, 103813, 103837, 103841, 103843, 103867, 103889, 103903, 103913, 103919, 103951, 103963, 103967, 103969, 103979, 103981, 103991, 103993, 103997, 104003, 104009, 104021, 104033, 104047, 104053, 104059, 104087, 104089, 104107, 104113, 104119, 104123, 104147, 104149, 104161, 104173, 104179, 104183, 104207, 104231, 104233, 104239, 104243, 104281, 104287, 104297, 104309, 104311, 104323, 104327, 104347, 104369, 104381, 104383, 104393, 104399, 104417, 104459, 104471, 104473, 104479, 104491, 104513, 104527, 104537, 104543, 104549, 104551, 104561, 104579, 104593, 104597, 104623, 104639, 104651, 104659, 104677, 104681, 104683, 104693, 104701, 104707, 104711, 104717, 104723, 104729];
}).call(this);
},{}],65:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BigInteger, Lock, MRF, MediumRandomFountain, SRF, StrongRandomFountain, WordArray, iced, native_rng, prng, __iced_k, __iced_k_noop, _mrf, _ref, _srf;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
BigInteger = require('bn').BigInteger;
_ref = require('triplesec'), WordArray = _ref.WordArray, prng = _ref.prng;
native_rng = prng.native_rng;
Lock = require('./lock').Lock;
MediumRandomFountain = (function() {
function MediumRandomFountain() {}
MediumRandomFountain.prototype.nextBytes = function(v) {
var b, c, i, _i, _len, _results;
b = native_rng(v.length);
_results = [];
for (i = _i = 0, _len = b.length; _i < _len; i = ++_i) {
c = b[i];
_results.push(v[i] = c);
}
return _results;
};
MediumRandomFountain.prototype.random_word = function() {
return native_rng(4).readUInt32BE(0);
};
MediumRandomFountain.prototype.random_zn = function(n) {
var i;
while (true) {
i = BigInteger.random_nbit(n.bitLength(), this);
if (i.compareTo(BigInteger.ONE) > 0 && i.compareTo(n) < 0) {
return i;
}
}
};
return MediumRandomFountain;
})();
_mrf = null;
MRF = function() {
if (_mrf == null) {
_mrf = new MediumRandomFountain();
}
return _mrf;
};
StrongRandomFountain = (function() {
function StrongRandomFountain() {
this.buf = null;
this.lock = new Lock();
}
StrongRandomFountain.prototype.random_word = function(cb) {
var wa, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_word"
});
prng.generate(4, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return wa = arguments[0];
};
})(),
lineno: 49
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(wa.to_buffer().readUInt32BE(0));
};
})(this));
};
StrongRandomFountain.prototype.random_double = function(cb) {
var wa, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_double"
});
prng.generate(8, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return wa = arguments[0];
};
})(),
lineno: 55
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(wa.to_buffer().readDoubleBE(0));
};
})(this));
};
StrongRandomFountain.prototype.rand_0_1 = function(cb) {
var ret, w1, w2, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.rand_0_1"
});
_this.random_word(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return w1 = arguments[0];
};
})(),
lineno: 61
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.rand_0_1"
});
_this.random_word(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return w2 = arguments[0];
};
})(),
lineno: 62
}));
__iced_deferrals._fulfill();
})(function() {
ret = w1 * Math.pow(2, -32) + w2 * Math.pow(2, -64);
return cb(ret);
});
};
})(this));
};
StrongRandomFountain.prototype.random_zn = function(n, cb) {
var go, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
go = true;
ret = false;
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!go) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_zn"
});
_this.random_nbit(n.bitLength(), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ret = arguments[0];
};
})(),
lineno: 72
}));
__iced_deferrals._fulfill();
})(function() {
return _next(go = (ret.compareTo(BigInteger.ONE) <= 0) || (ret.compareTo(n) >= 0));
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(ret);
};
})(this));
};
StrongRandomFountain.prototype.nextBytes = function(v) {
var i, _i, _ref1, _results;
_results = [];
for (i = _i = 0, _ref1 = v.length; 0 <= _ref1 ? _i < _ref1 : _i > _ref1; i = 0 <= _ref1 ? ++_i : --_i) {
_results.push(v[i] = this.buf[i]);
}
return _results;
};
StrongRandomFountain.prototype.random_word_array = function(nbytes, cb) {
var b, d, max_pull, n, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
ret = new WordArray();
max_pull = 512;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_word_array"
});
_this.lock.acquire(__iced_deferrals.defer({
lineno: 88
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!((d = nbytes - ret.sigBytes) > 0)) {
return _break();
} else {
n = Math.min(max_pull, d);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_word_array"
});
prng.generate(n, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return b = arguments[0];
};
})(),
lineno: 91
}));
__iced_deferrals._fulfill();
})(function() {
return _next(ret = ret.concat(b));
});
}
};
_while(__iced_k);
})(function() {
_this.lock.release();
return cb(ret);
});
};
})(this));
};
StrongRandomFountain.prototype.random_bytes = function(nbytes, cb) {
var tmp, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_bytes"
});
_this.random_word_array(nbytes, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return tmp = arguments[0];
};
})(),
lineno: 99
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(tmp.to_buffer());
};
})(this));
};
StrongRandomFountain.prototype.random_nbit = function(nbits, cb) {
var nbytes, ret, tmp, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
nbytes = (nbits >> 3) + 1;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_nbit"
});
_this.random_bytes(nbytes, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return tmp = arguments[0];
};
})(),
lineno: 106
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/kbpgp/src/rand.iced",
funcname: "StrongRandomFountain.random_nbit"
});
_this.lock.acquire(__iced_deferrals.defer({
lineno: 107
}));
__iced_deferrals._fulfill();
})(function() {
_this.buf = tmp;
ret = BigInteger.random_nbit(nbits, _this);
_this.lock.release();
return cb(ret);
});
};
})(this));
};
return StrongRandomFountain;
})();
_srf = null;
SRF = function() {
if (_srf == null) {
_srf = new StrongRandomFountain();
}
return _srf;
};
exports.MRF = MRF;
exports.SRF = SRF;
}).call(this);
},{"./lock":28,"bn":71,"iced-runtime":118,"triplesec":181}],66:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var IV, WordArray, bufeq_secure, setup, split64, unwrap, wrap;
WordArray = require('triplesec').WordArray;
bufeq_secure = require('./util').bufeq_secure;
IV = WordArray.from_hex("A6A6A6A6A6A6A6A6");
split64 = function(wa) {
return wa.split(wa.words.length >> 1);
};
exports.wrap = wrap = function(_arg) {
var A, AES, B, C, P, R, cipher, err, i, j, key, plaintext, r, t, _i, _j, _k, _len, _len1, _ref;
plaintext = _arg.plaintext, key = _arg.key, cipher = _arg.cipher;
_ref = setup({
input: plaintext,
key: key,
cipher: cipher
}), err = _ref[0], P = _ref[1], AES = _ref[2];
if (err != null) {
throw err;
}
A = IV;
R = P;
t = new WordArray([0, 0]);
for (j = _i = 0; _i < 6; j = ++_i) {
for (i = _j = 0, _len = R.length; _j < _len; i = ++_j) {
r = R[i];
t.words[1]++;
B = A.clone().concat(r);
AES.encryptBlock(B.words);
A = B.slice(0, 2);
R[i] = B.slice(2, 4);
A.xor(t, {});
}
}
C = A;
for (_k = 0, _len1 = R.length; _k < _len1; _k++) {
r = R[_k];
C.concat(r);
}
return C.to_buffer();
};
setup = function(_arg) {
var AES, K, P, a, b, cipher, err, input, key, klass;
input = _arg.input, key = _arg.key, cipher = _arg.cipher;
P = split64(WordArray.from_buffer(input));
K = WordArray.from_buffer(key);
klass = cipher.klass;
AES = new klass(K);
err = null;
if ((a = cipher.key_size) !== (b = key.length)) {
err = new Error("Bad key, needed " + a + " bytes, but got " + b);
}
return [err, P, AES];
};
exports.unwrap = unwrap = function(_arg) {
var A, AES, B, C, P, R, cipher, ciphertext, err, i, j, key, n, r, t, _i, _j, _k, _len, _ref;
ciphertext = _arg.ciphertext, key = _arg.key, cipher = _arg.cipher;
_ref = setup({
input: ciphertext,
key: key,
cipher: cipher
}), err = _ref[0], C = _ref[1], AES = _ref[2], n = _ref[3];
if (err != null) {
return [err, null];
}
A = C[0];
R = C.slice(1);
t = new WordArray([0, 6 * R.length]);
for (j = _i = 0; _i < 6; j = ++_i) {
for (i = _j = R.length - 1; _j >= 0; i = _j += -1) {
r = R[i];
A.xor(t, {});
B = A.clone().concat(r);
AES.decryptBlock(B.words);
A = B.slice(0, 2);
R[i] = B.slice(2, 4);
t.words[1]--;
}
}
if (A.equal(IV)) {
P = new WordArray([]);
for (_k = 0, _len = R.length; _k < _len; _k++) {
r = R[_k];
P.concat(r);
}
return [null, P.to_buffer()];
} else {
return [new Error("integrity check failure; got bad IV in decryption"), null];
}
};
}).call(this);
},{"./util":70,"triplesec":181}],67:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var ASP, BaseKey, BaseKeyPair, BigInteger, C, K, MRF, Output, Pair, Priv, Pub, SHA512, SRF, bn, bufeq_secure, eme_pkcs1_decode, eme_pkcs1_encode, emsa_pkcs1_decode, emsa_pkcs1_encode, iced, konst, make_esc, naive_is_prime, nbi, nbits, nbv, random_prime, __iced_k, __iced_k_noop, _ref, _ref1, _ref2, _ref3, _ref4,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
_ref = require('./primegen'), naive_is_prime = _ref.naive_is_prime, random_prime = _ref.random_prime;
bn = require('./bn');
nbits = bn.nbits, nbv = bn.nbv, nbs = bn.nbs, nbi = bn.nbi, BigInteger = bn.BigInteger;
_ref1 = require('./util'), bufeq_secure = _ref1.bufeq_secure, ASP = _ref1.ASP;
make_esc = require('iced-error').make_esc;
konst = require('./const');
C = konst.openpgp;
K = konst.kb;
SHA512 = require('./hash').SHA512;
_ref2 = require('./pad'), eme_pkcs1_encode = _ref2.eme_pkcs1_encode, eme_pkcs1_decode = _ref2.eme_pkcs1_decode, emsa_pkcs1_decode = _ref2.emsa_pkcs1_decode, emsa_pkcs1_encode = _ref2.emsa_pkcs1_encode;
_ref3 = require('./rand'), SRF = _ref3.SRF, MRF = _ref3.MRF;
_ref4 = require('./basekeypair'), BaseKey = _ref4.BaseKey, BaseKeyPair = _ref4.BaseKeyPair;
Priv = (function(_super) {
__extends(Priv, _super);
function Priv(_arg) {
this.p = _arg.p, this.q = _arg.q, this.d = _arg.d, this.dmp1 = _arg.dmp1, this.dmq1 = _arg.dmq1, this.u = _arg.u, this.pub = _arg.pub;
}
Priv.prototype.decrypt = function(c, cb) {
var x, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Priv.decrypt"
});
_this.mod_pow_d_crt(c, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return x = arguments[0];
};
})(),
lineno: 22
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(null, x);
};
})(this));
};
Priv.prototype.sign = function(m, cb) {
return this.mod_pow_d_crt(m, cb);
};
Priv.ORDER = ['d', 'p', 'q', 'u'];
Priv.prototype.ORDER = Priv.ORDER;
Priv.prototype.n = function() {
return this.p.multiply(this.q);
};
Priv.prototype.phi = function() {
return this.p.subtract(BigInteger.ONE).multiply(this.q.subtract(BigInteger.ONE));
};
Priv.prototype.lambda = function() {
return this.phi.divide(this.p.subtract(BigInteger.ONE).gcd(this.q.subtract(BigInteger.ONE)));
};
Priv.alloc = function(raw, pub) {
return BaseKey.alloc(Priv, raw, {
pub: pub
});
};
Priv.prototype.mod_pow_d_crt = function(x, cb) {
var n, r, r_e, r_inv, x_1, xp, xq, y, y_0, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
if (this.dP == null) {
this.dP = this.d.mod(this.p.subtract(BigInteger.ONE));
}
if (this.dQ == null) {
this.dQ = this.d.mod(this.q.subtract(BigInteger.ONE));
}
if (this.qInv == null) {
this.qInv = this.q.modInverse(this.p);
}
/* Chinese remainder theorem (CRT) states:
Suppose n1, n2, ..., nk are positive integers which are pairwise
coprime (n1 and n2 have no common factors other than 1). For any
integers x1, x2, ..., xk there exists an integer x solving the
system of simultaneous congruences (where ~= means modularly
congruent so a ~= b mod n means a mod n = b mod n):
x ~= x1 mod n1
x ~= x2 mod n2
...
x ~= xk mod nk
This system of congruences has a single simultaneous solution x
between 0 and n - 1. Furthermore, each xk solution and x itself
is congruent modulo the product n = n1*n2*...*nk.
So x1 mod n = x2 mod n = xk mod n = x mod n.
The single simultaneous solution x can be solved with the following
equation:
x = sum(xi*ri*si) mod n where ri = n/ni and si = ri^-1 mod ni.
Where x is less than n, xi = x mod ni.
For RSA we are only concerned with k = 2. The modulus n = pq, where
p and q are coprime. The RSA decryption algorithm is:
y = x^d mod n
Given the above:
x1 = x^d mod p
r1 = n/p = q
s1 = q^-1 mod p
x2 = x^d mod q
r2 = n/q = p
s2 = p^-1 mod q
So y = (x1r1s1 + x2r2s2) mod n
= ((x^d mod p)q(q^-1 mod p) + (x^d mod q)p(p^-1 mod q)) mod n
According to Fermat's Little Theorem, if the modulus P is prime,
for any integer A not evenly divisible by P, A^(P-1) ~= 1 mod P.
Since A is not divisible by P it follows that if:
N ~= M mod (P - 1), then A^N mod P = A^M mod P. Therefore:
A^N mod P = A^(M mod (P - 1)) mod P. (The latter takes less effort
to calculate). In order to calculate x^d mod p more quickly the
exponent d mod (p - 1) is stored in the RSA private key (the same
is done for x^d mod q). These values are referred to as dP and dQ
respectively. Therefore we now have:
y = ((x^dP mod p)q(q^-1 mod p) + (x^dQ mod q)p(p^-1 mod q)) mod n
Since we'll be reducing x^dP by modulo p (same for q) we can also
reduce x by p (and q respectively) before hand. Therefore, let
xp = ((x mod p)^dP mod p), and
xq = ((x mod q)^dQ mod q), yielding:
y = (xp*q*(q^-1 mod p) + xq*p*(p^-1 mod q)) mod n
This can be further reduced to a simple algorithm that only
requires 1 inverse (the q inverse is used) to be used and stored.
The algorithm is called Garner's algorithm. If qInv is the
inverse of q, we simply calculate:
y = (qInv*(xp - xq) mod p) * q + xq
However, there are two further complications. First, we need to
ensure that xp > xq to prevent signed BigIntegers from being used
so we add p until this is true (since we will be mod'ing with
p anyway). Then, there is a known timing attack on algorithms
using the CRT. To mitigate this risk, "cryptographic blinding"
should be used (*Not yet implemented*). This requires simply
generating a random number r between 0 and n-1 and its inverse
and multiplying x by r^e before calculating y and then multiplying
y by r^-1 afterwards.
*/
n = this.pub.n;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Priv.mod_pow_d_crt"
});
SRF().random_zn(n, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return r = arguments[0];
};
})(),
lineno: 141
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
r_inv = r.modInverse(n);
r_e = r.modPow(_this.pub.e, n);
x_1 = x.multiply(r_e).mod(n);
xp = x_1.mod(_this.p).modPow(_this.dP, _this.p);
xq = x_1.mod(_this.q).modPow(_this.dQ, _this.q);
while (xp.compareTo(xq) < 0) {
xp = xp.add(_this.p);
}
y_0 = xp.subtract(xq).multiply(_this.qInv).mod(_this.p).multiply(_this.q).add(xq);
y = y_0.multiply(r_inv).mod(n);
return cb(y);
};
})(this));
};
return Priv;
})(BaseKey);
Pub = (function(_super) {
__extends(Pub, _super);
Pub.type = C.public_key_algorithms.RSA;
Pub.prototype.type = Pub.type;
Pub.ORDER = ['n', 'e'];
Pub.prototype.ORDER = Pub.ORDER;
function Pub(_arg) {
this.n = _arg.n, this.e = _arg.e;
}
Pub.prototype.encrypt = function(p, cb) {
return this.mod_pow(p, this.e, cb);
};
Pub.prototype.verify = function(s, cb) {
return this.mod_pow(s, this.e, cb);
};
Pub.prototype.nbits = function() {
var _ref5;
return (_ref5 = this.n) != null ? _ref5.bitLength() : void 0;
};
Pub.alloc = function(raw) {
return BaseKey.alloc(Pub, raw);
};
Pub.prototype.mod_pow = function(x, d, cb) {
return cb(x.modPow(d, this.n));
};
Pub.prototype.validity_check = function(cb) {
var err;
err = !this.n.gcd(this.e).equals(BigInteger.ONE) ? new Error("gcd(n,e) != 1") : !this.n.mod(nbv(2)).equals(BigInteger.ONE) ? new Error("n % 2 != 1") : this.e.compareTo(BigInteger.ONE) <= 0 ? new Error("e <= 1") : this.e.bitLength() > 32 ? new Error("e=" + this.e + " > 2^32") : null;
return cb(err);
};
return Pub;
})(BaseKey);
Pair = (function(_super) {
__extends(Pair, _super);
Pair.type = C.public_key_algorithms.RSA;
Pair.prototype.type = Pair.type;
Pair.prototype.get_type = function() {
return this.type;
};
Pair.klass_name = 'RSA';
Pair.Pub = Pub;
Pair.prototype.Pub = Pub;
Pair.Priv = Priv;
Pair.prototype.Priv = Priv;
function Pair(_arg) {
var priv, pub;
priv = _arg.priv, pub = _arg.pub;
Pair.__super__.constructor.call(this, {
priv: priv,
pub: pub
});
}
Pair.parse = function(pub_raw) {
return BaseKeyPair.parse(Pair, pub_raw);
};
Pair.alloc = function(_arg) {
var priv, pub;
pub = _arg.pub, priv = _arg.priv;
return BaseKeyPair.alloc({
pub: pub,
priv: priv
});
};
Pair.subkey_algo = function(flags) {
return Pair;
};
Pair.prototype.sanity_check = function(cb) {
var err, x0, x1, x2, y0, y1, y2, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = this.priv.n().compareTo(this.pub.n) === 0 ? null : new Error("pq != n");
(function(_this) {
return (function(__iced_k) {
if (err == null) {
x0 = MRF().random_zn(_this.pub.n);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.sanity_check"
});
_this.encrypt(x0, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return x1 = arguments[0];
};
})(),
lineno: 240
}));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.sanity_check"
});
_this.decrypt(x1, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return x2 = arguments[1];
};
})(),
lineno: 241
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k((err == null) && x0.compareTo(x2) !== 0 ? err = new Error("Decrypt/encrypt failed") : void 0);
});
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
y0 = MRF().random_zn(_this.pub.n);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.sanity_check"
});
_this.sign(y0, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return y1 = arguments[0];
};
})(),
lineno: 246
}));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.sanity_check"
});
_this.verify(y1, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return y2 = arguments[0];
};
})(),
lineno: 247
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(y0.compareTo(y2) !== 0 ? err = new Error("Sign/verify failed") : void 0);
});
});
} else {
return __iced_k();
}
})(function() {
return cb(err);
});
};
})(this));
};
Pair.parse_sig = function(slice) {
var err, n, raw, ret, _ref5;
_ref5 = bn.mpi_from_buffer(slice.peek_rest_to_buffer()), err = _ref5[0], ret = _ref5[1], raw = _ref5[2], n = _ref5[3];
if (err != null) {
throw err;
}
slice.advance(n);
return ret;
};
Pair.prototype.encrypt = function(p, cb) {
return this.pub.encrypt(p, cb);
};
Pair.prototype.decrypt = function(c, cb) {
return this.priv.decrypt(c, cb);
};
Pair.prototype.max_value = function() {
return this.pub.n;
};
Pair.make = function(_arg) {
var d, dmp1, dmq1, e, lambda, n, p, p1, phi, priv, pub, q, q1, u;
p = _arg.p, q = _arg.q, e = _arg.e, phi = _arg.phi, p1 = _arg.p1, q1 = _arg.q1, lambda = _arg.lambda;
n = p.multiply(q);
d = e.modInverse(lambda);
dmp1 = d.mod(p1);
dmq1 = d.mod(q1);
u = p.modInverse(q);
pub = new Pub({
n: n,
e: e
});
priv = new Priv({
p: p,
q: q,
d: d,
dmp1: dmp1,
dmq1: dmq1,
u: u,
pub: pub
});
return new Pair({
priv: priv,
pub: pub
});
};
Pair.prototype.to_openpgp = function() {
var key;
key = new (new RSA).keyObject();
key.n = this.pub.n;
key.e = this.pub.e.intValue();
key.ee = this.pub.e;
key.d = this.priv.d;
key.p = this.priv.p;
key.q = this.priv.q;
key.dmp1 = this.priv.dmp1;
key.dmq1 = this.priv.dmq1;
key.u = this.priv.u;
return key;
};
Pair.prototype.sign = function(m, cb) {
return this.priv.sign(m, cb);
};
Pair.prototype.verify = function(s, cb) {
return this.pub.verify(s, cb);
};
Pair.prototype.pad_and_encrypt = function(data, params, cb) {
var ct, err, m, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.pad_and_encrypt"
});
eme_pkcs1_encode(data, _this.pub.n.mpi_byte_length(), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return m = arguments[1];
};
})(),
lineno: 306
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.pad_and_encrypt"
});
_this.encrypt(m, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct = arguments[0];
};
})(),
lineno: 308
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(ret = _this.export_output({
y_mpi: ct
}));
});
} else {
return __iced_k();
}
})(function() {
return cb(err, ret);
});
};
})(this));
};
Pair.prototype.decrypt_and_unpad = function(ciphertext, params, cb) {
var b, err, p, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
err = ret = null;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.decrypt_and_unpad"
});
_this.decrypt(ciphertext.y(), __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return p = arguments[1];
};
})(),
lineno: 318
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
var _ref5;
if (err == null) {
b = p.to_padded_octets(_this.pub.n);
_ref5 = eme_pkcs1_decode(b), err = _ref5[0], ret = _ref5[1];
}
return cb(err, ret);
};
})(this));
};
Pair.prototype.pad_and_sign = function(data, _arg, cb) {
var hashed_data, hasher, m, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
hasher = _arg.hasher;
hasher || (hasher = SHA512);
hashed_data = hasher(data);
m = emsa_pkcs1_encode(hashed_data, this.pub.n.mpi_byte_length(), {
hasher: hasher
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.pad_and_sign"
});
_this.sign(m, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 330
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(null, sig.to_mpi_buffer());
};
})(this));
};
Pair.prototype.verify_unpad_and_check_hash = function(_arg, cb) {
var b, data, err, hash, hasher, hd1, sig, v, ___iced_passed_deferral, __iced_deferrals, __iced_k, _ref5;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
sig = _arg.sig, data = _arg.data, hasher = _arg.hasher, hash = _arg.hash;
err = null;
if (Buffer.isBuffer(sig)) {
_ref5 = bn.mpi_from_buffer(sig), err = _ref5[0], sig = _ref5[1];
}
(function(_this) {
return (function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.verify_unpad_and_check_hash"
});
_this.verify(sig, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return v = arguments[0];
};
})(),
lineno: 339
}));
__iced_deferrals._fulfill();
})(function() {
var _ref6;
b = v.to_padded_octets(_this.pub.n);
_ref6 = emsa_pkcs1_decode(b, hasher), err = _ref6[0], hd1 = _ref6[1];
return __iced_k(err == null ? (hash || (hash = hasher(data)), !bufeq_secure(hd1, hash) ? err = new Error("hash mismatch") : void 0) : void 0);
});
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Pair.generate = function(_arg, cb) {
var asp, e, e_orig, esc, go, iters, key, lambda, nbits, p, p1, phi, q, q1, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
nbits = _arg.nbits, iters = _arg.iters, e = _arg.e, asp = _arg.asp;
e || (e = (1 << 16) + 1);
e_orig = e;
nbits || (nbits = 4096);
iters || (iters = 10);
asp || (asp = new ASP({}));
e = nbv(e_orig);
esc = make_esc(cb, "generate_rsa_keypair");
go = true;
nbits >>= 1;
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!go) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.generate"
});
random_prime({
asp: asp.section('p'),
e: e,
nbits: nbits,
iters: iters
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return p = arguments[0];
};
})(),
lineno: 363
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.generate"
});
asp.progress({
what: "found",
p: p
}, esc(__iced_deferrals.defer({
lineno: 364
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.generate"
});
random_prime({
asp: asp.section('q'),
e: e,
nbits: nbits,
iters: iters
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return q = arguments[0];
};
})(),
lineno: 365
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.generate"
});
asp.progress({
what: "found",
q: q
}, esc(__iced_deferrals.defer({
lineno: 366
})));
__iced_deferrals._fulfill();
})(function() {
var _ref5;
if (p.compareTo(q) <= 0) {
_ref5 = [q, p], p = _ref5[0], q = _ref5[1];
}
q1 = q.subtract(BigInteger.ONE);
p1 = p.subtract(BigInteger.ONE);
phi = p1.multiply(q1);
lambda = phi.divide(q1.gcd(p1));
return _next(phi.gcd(e).compareTo(BigInteger.ONE) !== 0 ? (typeof progress_hook === "function" ? progress_hook({
what: "unlucky_phi"
}) : void 0, go = true) : go = false);
});
});
});
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
key = Pair.make({
p: p,
q: q,
e: e,
phi: phi,
p1: p1,
q1: q1,
lambda: lambda
});
return cb(null, key);
};
})(this));
};
Pair.parse_output = function(buf) {
return Output.parse(buf);
};
Pair.prototype.export_output = function(args) {
return new Output(args);
};
Pair.prototype.validity_check = function(cb) {
var err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Pair.validity_check"
});
_this.pub.validity_check(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 391
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
return Pair;
})(BaseKeyPair);
Output = (function() {
function Output(_arg) {
this.y_mpi = _arg.y_mpi, this.y_buf = _arg.y_buf;
}
Output.parse = function(buf) {
var err, n, raw, ret, _ref5;
_ref5 = bn.mpi_from_buffer(buf), err = _ref5[0], ret = _ref5[1], raw = _ref5[2], n = _ref5[3];
if (err != null) {
throw err;
}
if (raw.length !== 0) {
throw new Error("junk at the end of input");
}
return new Output({
y_mpi: ret
});
};
Output.prototype.y = function() {
return this.y_mpi;
};
Output.prototype.hide = function(_arg, cb) {
var err, i, key, max, slosh, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, max = _arg.max, slosh = _arg.slosh;
max || (max = 8192);
slosh || (slosh = 128);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/rsa.iced",
funcname: "Output.hide"
});
key.hide({
i: _this.y(),
max: max,
slosh: slosh
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return i = arguments[1];
};
})(),
lineno: 417
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (typeof err === "undefined" || err === null) {
_this.y_mpi = i;
_this.y_buf = null;
}
return cb(err);
};
})(this));
};
Output.prototype.find = function(_arg) {
var key;
key = _arg.key;
return this.y_mpi = key.find(this.y_mpi);
};
Output.prototype.output = function() {
return this.y_buf || this.y_mpi.to_mpi_buffer();
};
return Output;
})();
exports.RSA = exports.Pair = Pair;
exports.Output = Output;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./basekeypair":2,"./bn":4,"./const":5,"./hash":14,"./pad":62,"./primegen":63,"./rand":65,"./util":70,"buffer":80,"iced-error":115,"iced-runtime":118}],68:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var AES, C, CAST5, SlicerBuffer, WordArray, checksum2, ecc_pkcs5_unpad_data, export_key_pgp, get_cipher, import_key_pgp, triplesec, uint_to_buffer;
C = require('./const').openpgp.symmetric_key_algorithms;
triplesec = require('triplesec');
AES = triplesec.ciphers.AES;
CAST5 = require('./openpgp/cast5').CAST5;
SlicerBuffer = require('./openpgp/buffer').SlicerBuffer;
WordArray = triplesec.WordArray;
uint_to_buffer = require('./util').uint_to_buffer;
ecc_pkcs5_unpad_data = require('./pad').ecc_pkcs5_unpad_data;
exports.get_cipher = get_cipher = function(n) {
var ret;
n || (n = C.AES256);
ret = (function() {
switch (n) {
case C.AES128:
return {
klass: AES,
key_size: 16
};
case C.AES192:
return {
klass: AES,
key_size: 24
};
case C.AES256:
return {
klass: AES,
key_size: 32
};
case C.CAST5:
return {
klass: CAST5,
key_size: CAST5.keySize
};
default:
throw new Error("unknown cipher: " + n);
}
})();
ret.type = n;
return ret;
};
exports.checksum2 = checksum2 = function(buf) {
var i, res, _i, _ref;
res = 0;
for (i = _i = 0, _ref = buf.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
res = (res + buf.readUInt8(i)) & 0xffff;
}
return res;
};
exports.import_key_pgp = import_key_pgp = function(msg, pkcs5_padding) {
var checksum, cipher, err, key, ret, sb;
if (pkcs5_padding == null) {
pkcs5_padding = false;
}
sb = new SlicerBuffer(msg);
ret = err = null;
cipher = get_cipher(sb.read_uint8());
key = sb.read_buffer(cipher.key_size);
checksum = sb.read_uint16();
err = checksum2(key) !== checksum ? new Error("Checksum mismatch") : pkcs5_padding ? ecc_pkcs5_unpad_data(msg, sb.offset()) : !sb.rem() ? null : new Error("Junk at the end of input");
if (err != null) {
throw err;
}
return new cipher.klass(WordArray.from_buffer(key));
};
exports.export_key_pgp = export_key_pgp = function(algo_id, key) {
var csum;
csum = checksum2(key);
return Buffer.concat([new Buffer([algo_id]), key, uint_to_buffer(16, csum)]);
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./const":5,"./openpgp/buffer":35,"./openpgp/cast5":37,"./pad":62,"./util":70,"buffer":80,"triplesec":181}],69:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var iced, kb, pgp, __iced_k, __iced_k_noop;
iced = require('iced-runtime').iced;
__iced_k = __iced_k_noop = function() {};
pgp = require('./openpgp/keymanager');
kb = require('./keybase/hilev');
exports.import_armored_public = function(_arg, cb) {
var armored, asp, err, ret, warnings, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
armored = _arg.armored, asp = _arg.asp;
(function(_this) {
return (function(__iced_k) {
if (armored.match(/^-{5}BEGIN PGP PUBLIC KEY BLOCK-{5}/)) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ukm.iced",
funcname: "import_armored_public"
});
pgp.KeyManager.import_from_armored_pgp({
armored: armored,
asp: asp
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
ret = arguments[1];
return warnings = arguments[2];
};
})(),
lineno: 10
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/kbpgp/src/ukm.iced",
funcname: "import_armored_public"
});
kb.KeyManager.import_public({
hex: armored
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 12
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb(err, ret);
};
})(this));
};
}).call(this);
},{"./keybase/hilev":17,"./openpgp/keymanager":42,"iced-runtime":118}],70:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var k, m, mods, v, _i, _len;
mods = [require("pgp-utils").util, require("./openpgp/util"), require("./keybase/util")];
for (_i = 0, _len = mods.length; _i < _len; _i++) {
m = mods[_i];
for (k in m) {
v = m[k];
exports[k] = v;
}
}
}).call(this);
},{"./keybase/util":23,"./openpgp/util":60,"pgp-utils":163}],71:[function(require,module,exports){
var engine = require('./lib/wrap').engine;
if (!engine) {
syms = require("./lib/pure");
} else {
syms = require("./lib/fast");
}
for (var k in syms) {
exports[k] = syms[k];
}
},{"./lib/fast":72,"./lib/pure":73,"./lib/wrap":74}],72:[function(require,module,exports){
(function (Buffer){
(function (){
var bigint = require("./wrap").engine;
var zed = bigint(0);
var one = bigint(1);
function BigInteger (a,b) {
if (!(this instanceof BigInteger))
return new BigInteger(a,b);
if (typeof(a) == 'string') {
// Filter out any empty spaces.
a = a.replace(/\s+/g,'');
if (!b) { b = 10; }
this._v = bigint(a,b);
} else if (typeof(a) == 'number') {
this._v = bigint(a);
} else if (typeof(a) == 'object' && Array.isArray(a)) {
this._v = bigint.fromBuffer(new Buffer(a));
} else if (a.constructor != zed.constructor) {
throw new Error("failed to get valid inner object in constructor");
} else {
this._v = a;
}
};
function nbi() { return new BigInteger(bigint(0)); }
function nbv(i) { return new BigInteger(bigint(i)); }
function bigint_or_number(x) {
if (typeof(x) === 'number') { return nbv(x); }
else { return x; }
};
function buffer_to_array (b) {
var ret = new Array();
for (var i = 0; i < b.length; i++) {
ret[i] = b.readUInt8(i);
}
return ret;
};
BigInteger.prototype.bitLength = function () {
var ret;
if (this.signum() == 0) { ret = 0; }
else { ret = this._v.bitLength(); }
return ret;
};
BigInteger.prototype.byteLength = function () { return (this.bitLength() >> 3); }
BigInteger.prototype.modPowInt = function (i,n) {
return new BigInteger(this._v.powm(bigint(i),n._v));
};
BigInteger.prototype.modInt = function (i) {
return this._v.mod(bigint(i)).toNumber();
};
BigInteger.prototype.testBit = function (i) {
var bi = one.shiftLeft(i);
var tmp = this._v.and(bi);
var ret = tmp.eq(zed) ? 0 : 1;
return ret;
};
BigInteger.prototype.setBit = function (i) {
var mask = bigint(1).shiftLeft(i);
return new BigInteger(this._v.or(mask));
};
BigInteger.prototype.shiftLeft = function (i) {
return new BigInteger(this._v.shiftLeft(i));
};
BigInteger.prototype.shiftRight = function (i) {
return new BigInteger(this._v.shiftRight(i));
};
BigInteger.prototype.compareTo = function (b) {
return this._v.cmp(b._v);
};
BigInteger.prototype.modPow = function (e, n) {
return new BigInteger(this._v.powm(e._v, n._v));
};
BigInteger.prototype.square = function() {
return new BigInteger(this._v.mul(this._v));
};
BigInteger.prototype.mod = function (m) {
var x = this._v.mod(m._v);
// BigNum (and not BigInt) allows for mod outcome to be < 0
if (x.cmp(zed) < 0) {
x = x.add(m._v);
}
return new BigInteger(x);
};
BigInteger.prototype.abs = function () {
return new BigInteger(this._v.abs());
};
BigInteger.prototype.pow = function (e) {
return new BigInteger(this._v.pow(bigint_or_number(e)._v));
};
BigInteger.prototype.intValue = function () {
return this._v.toNumber();
};
BigInteger.prototype.signum = function () {
var cmp = this._v.cmp(zed);
if (cmp > 0) { ret = 1; }
else if (cmp === 0) { ret = 0; }
else { ret = -1; }
return ret;
};
BigInteger.prototype.negate = function () {
return new BigInteger(this._v.neg());
};
BigInteger.prototype.equals = function (b) {
return this._v.eq(b._v);
};
BigInteger.prototype.subtract = function (x) {
return new BigInteger(this._v.sub(x._v));
};
BigInteger.prototype.add = function(x) {
return new BigInteger(this._v.add(x._v));
};
BigInteger.prototype.multiply = function (x) {
return new BigInteger(this._v.mul(x._v));
};
BigInteger.prototype.divide = function (x) {
if (this._v.ge(zed) && x._v.ge(zed)) {
i = this._v.div(x._v);
} else {
var sign = this.signum() * x.signum();
i = this._v.abs().div(x._v.abs());
if (sign < 0) { i = i.neg(); }
}
return new BigInteger(i);
};
BigInteger.prototype.gcd = function (x) {
return new BigInteger(this._v.gcd(x._v));
};
BigInteger.prototype.fromBuffer = function (x) {
return new BigInteger(bigint.fromBuffer(x));
};
BigInteger.fromByteArrayUnsigned = function (b) {
return BigInteger.fromBuffer(new Buffer(b));
};
BigInteger.fromBuffer = function (x) {
return new BigInteger(bigint.fromBuffer(x));
};
BigInteger.fromDERInteger = function (buf) {
var ret;
if (buf.length == 0) { ret = BigInteger.ZERO; }
else if (buf[0] == 0) { ret = BigInteger.fromBuffer(buf); }
else {
ret = BigInteger.fromBuffer(buf);
if (buf[0] & 0x80) {
var z = BigInteger.ONE.shiftLeft(ret.bitLength())
ret = ret.subtract(z);
}
}
return ret;
};
BigInteger.prototype.compute_twos_complement = function () {
// Compute 2's complement: 2^n - this
// What should n be? It should be rounded up to the next byte...
// So keep in mind that -128 is encoded 0x80. So it matters how
// many bits (this+1) takes up.
var l = this.add(BigInteger.ONE).bitLength();
var bytes = Math.floor(l/8) + 1;
var y = BigInteger.ONE.shiftLeft(bytes*8);
// Compute the 2's-complement of this, which is 2^l - |this|.
return y.add(this);
};
BigInteger.prototype.toDERInteger = function () {
var ret = null;
var s = this.signum();
if (s == 0) { ret = new Buffer([0]); }
else if (s < 0) {
var z = this.compute_twos_complement();
ret = z.toBuffer();
} else {
var ret = this.toBuffer();
// If the high bit is on, and we're unsigned, we have to prepend a \x00
// byte to show that we're positive.
if (this.bitLength() % 8 == 0) {
pad = new Buffer([0]);
ret = Buffer.concat([ pad, ret ]);
}
}
return buffer_to_array(ret);
};
BigInteger.prototype.divideAndRemainder = function (m) {
var q = new BigInteger(this._v.div(m._v));
var r = new BigInteger(this._v.mod(m._v));
return [q,r];
}
BigInteger.fromString = function (s, base) {
// Ignore the current object, that's cool....
var bi;
if (base === 256) {
bi = bigint.fromBuffer(s);
} else {
bi = bigint(s, base);
}
return new BigInteger(bi);
};
BigInteger.prototype.fromString = function (s, base) {
return BigInteger.fromString(s, base);
};
BigInteger.prototype.toByteArray = function () {
var b = this.toBuffer();
var l = b.length;
var ret = new Array(l);
for (var i = 0; i < l; i++) {
ret[i] = b[i];
}
return ret;
};
BigInteger.prototype.toByteArrayUnsigned = function () {
return new Uint8Array(this.toBuffer());
};
BigInteger.prototype.toBuffer = function (size) {
var ret = null;
if (!size) { size = 0; }
if (this.signum() == 0) { ret = new Buffer([]); }
else { ret = this._v.toBuffer(); }
if ((diff = size - ret.length) > 0) {
var pad = new Buffer(diff);
pad.fill(0);
ret = Buffer.concat([pad, ret]);
}
return ret;
};
BigInteger.prototype.toHex = function(size) {
var x = this;
if (this.signum() < 0) {
x = this.compute_twos_complement();
}
return x.toBuffer(size).toString('hex');
};
BigInteger.prototype.clone = function () {
return new BigInteger(bigint(this._v));
};
BigInteger.prototype.getLowestSetBit = function () {
var bl = this._v.bitLength();
var ret = -1;
var mask = bigint(1);
for (var i = 0; i < bl && ret < 0; i++) {
if (!mask.and(this._v).eq(zed)) {
ret = i;
} else {
mask = mask.shiftLeft(1);
}
}
return ret;
};
BigInteger.prototype.modInverse = function (n) {
return new BigInteger(this._v.invertm(n._v));
};
BigInteger.prototype.isEven = function () {
var mask = bigint(1);
var res = mask.and(this._v);
return res.eq(zed);
};
// returns bit length of the integer x. stolen from
// elsewhere is jsbn.
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;
};
BigInteger.random_nbit = function (nbits, rf) {
var nbytes = Math.ceil(nbits / 8);
var buf = new Buffer(nbytes);
rf.nextBytes(buf);
var ret = bigint.fromBuffer(buf);
var mask = bigint(1).shiftLeft(nbits).sub(bigint(1));
ret = ret.and(mask);
return new BigInteger(ret);
};
BigInteger.fromHex = function (s) {
if (!s.match(/^[a-fA-F0-9]*$/)) { throw new Error("hex string invalid: "+ s); }
if (s.length % 2 != 0) { throw new Error("got an odd-length hex-string"); }
return new BigInteger(s, 16);
};
BigInteger.prototype.inspect = function () {
return "<BigInteger/fast " + this._v.toString() + ">";
};
BigInteger.prototype.toString = function (base) {
if (!base) { base = 10; }
var raw = this._v.toString(base);
if (raw.length == 0) {
raw = "0";
} else if (base == 16 && raw.length > 1) {
if (raw[0] == "0") {
raw = raw.slice(1);
} else if (raw.slice(0,2) == "-0") {
raw = "-" + raw.slice(2);
}
}
return raw;
};
BigInteger.valueOf = function (x) {
return bigint_or_number(x);
};
BigInteger.ZERO = nbv(0);
BigInteger.ONE = nbv(1);
module.exports = {
BigInteger : BigInteger,
nbi : nbi,
nbv : nbv,
nbits : nbits
};
})(this);
}).call(this,require("buffer").Buffer)
},{"./wrap":74,"buffer":80}],73:[function(require,module,exports){
(function (Buffer){
(function (){
/*
* Copyright (c) 2003-2005 Tom Wu (tjw@cs.Stanford.EDU)
* All Rights Reserved.
*
* Modified by Recurity Labs GmbH
*
* 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" AND WITHOUT WARRANTY OF ANY KIND,
* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
* INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
* RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF
* THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT
* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* In addition, the following condition applies:
*
* All redistributions must retain an intact copy of this copyright notice
* and disclaimer.
*/
// Basic JavaScript BN library - subset useful for RSA encryption.
// Bits per digit
var dbits;
// JavaScript engine analysis
var canary = 0xdeadbeefcafe;
var j_lm = ((canary&0xffffff)==0xefcafe);
// (public) Constructor
function BigInteger(a,b,c) {
// bigi has this, so add it in...
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);
}
// return new, unset BigInteger
function nbi() { return new BigInteger(null); }
// 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;
}
// Chrome seems to prefer this...
BigInteger.prototype.am = am3;
dbits = 28;
BigInteger.prototype.DB = dbits;
BigInteger.prototype.DM = ((1<<dbits)-1);
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+this.DV;
else this.t = 0;
}
// return bigint initialized to value
function nbv(i) { var r = nbi(); r.fromInt(i); return r; }
// (protected) set from string and radix
function bnpFromString(s,b,unsigned) {
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 { this.fromRadix(s,b); return this; }
this.t = 0;
this.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)
this[this.t++] = x;
else if(sh+k > this.DB) {
this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;
this[this.t++] = (x>>(this.DB-sh));
}
else
this[this.t-1] |= x<<sh;
sh += k;
if(sh >= this.DB) sh -= this.DB;
}
if(!unsigned && k == 8 && (s[0]&0x80) != 0) {
this.s = -1;
if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;
}
this.clamp();
if(mi) BigInteger.ZERO.subTo(this,this);
return this;
}
// (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) {
if(this.s < 0) return "-"+this.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 this.toRadix(b);
var km = (1<<k)-1, d, m = false, r = "", i = this.t;
var p = this.DB-(i*this.DB)%k;
if(i-- > 0) {
if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }
while(i >= 0) {
if(p < k) {
d = (this[i]&((1<<p)-1))<<(k-p);
d |= this[--i]>>(p+=this.DB-k);
}
else {
d = (this[i]>>(p-=k))&km;
if(p <= 0) { p += this.DB; --i; }
}
if(d > 0) m = true;
if(m) r += int2char(d);
}
}
return m?r:"0";
}
// (public) -this
function bnNegate() { var r = nbi(); 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 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));
}
// (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 bs = n%this.DB;
var cbs = this.DB-bs;
var bm = (1<<cbs)-1;
var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;
for(i = this.t-1; i >= 0; --i) {
r[i+ds+1] = (this[i]>>cbs)|c;
c = (this[i]&bm)<<bs;
}
for(i = ds-1; i >= 0; --i) r[i] = 0;
r[ds] = c;
r.t = this.t+ds+1;
r.s = this.s;
r.clamp();
}
// (protected) r = this >> n
function bnpRShiftTo(n,r) {
r.s = this.s;
var ds = Math.floor(n/this.DB);
if(ds >= this.t) { r.t = 0; return; }
var bs = n%this.DB;
var cbs = this.DB-bs;
var bm = (1<<bs)-1;
r[0] = this[ds]>>bs;
for(var i = ds+1; i < this.t; ++i) {
r[i-ds-1] |= (this[i]&bm)<<cbs;
r[i-ds] = this[i]>>bs;
}
if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;
r.t = this.t-ds;
r.clamp();
}
// (protected) r = this - a
function bnpSubTo(a,r) {
var i = 0, c = 0, m = Math.min(a.t,this.t);
while(i < m) {
c += this[i]-a[i];
r[i++] = c&this.DM;
c >>= this.DB;
}
if(a.t < this.t) {
c -= a.s;
while(i < this.t) {
c += this[i];
r[i++] = c&this.DM;
c >>= this.DB;
}
c += this.s;
}
else {
c += this.s;
while(i < a.t) {
c -= a[i];
r[i++] = c&this.DM;
c >>= this.DB;
}
c -= a.s;
}
r.s = (c<0)?-1:0;
if(c < -1) r[i++] = this.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 pm = m.abs();
if(pm.t <= 0) return;
var pt = this.abs();
if(pt.t < pm.t) {
if(q != null) q.fromInt(0);
if(r != null) this.copyTo(r);
return;
}
if(r == null) r = nbi();
var y = nbi(), ts = this.s, ms = m.s;
var nsh = this.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<<this.F1)+((ys>1)?y[ys-2]>>this.F2:0);
var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;
var i = r.t, j = i-ys, t = (q==null)?nbi():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)?this.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 = nbi();
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 = nbi();
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 = nbi();
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 = nbi(), r2 = nbi(), 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
BigInteger.prototype.copyTo = bnpCopyTo;
BigInteger.prototype.fromInt = bnpFromInt;
BigInteger.prototype.fromString = bnpFromString;
BigInteger.prototype.clamp = bnpClamp;
BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
BigInteger.prototype.drShiftTo = bnpDRShiftTo;
BigInteger.prototype.lShiftTo = bnpLShiftTo;
BigInteger.prototype.rShiftTo = bnpRShiftTo;
BigInteger.prototype.subTo = bnpSubTo;
BigInteger.prototype.multiplyTo = bnpMultiplyTo;
BigInteger.prototype.squareTo = bnpSquareTo;
BigInteger.prototype.divRemTo = bnpDivRemTo;
BigInteger.prototype.invDigit = bnpInvDigit;
BigInteger.prototype.isEven = bnpIsEven;
BigInteger.prototype.exp = bnpExp;
// public
BigInteger.prototype.toString = bnToString;
BigInteger.prototype.negate = bnNegate;
BigInteger.prototype.abs = bnAbs;
BigInteger.prototype.compareTo = bnCompareTo;
BigInteger.prototype.bitLength = bnBitLength;
BigInteger.prototype.mod = bnMod;
BigInteger.prototype.modPowInt = bnModPowInt;
// "constants"
BigInteger.ZERO = nbv(0);
BigInteger.ONE = nbv(1);
/*
* Copyright (c) 2003-2005 Tom Wu (tjw@cs.Stanford.EDU)
* All Rights Reserved.
*
* Modified by Recurity Labs GmbH
*
* 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" AND WITHOUT WARRANTY OF ANY KIND,
* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
* INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
* RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF
* THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT
* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* In addition, the following condition applies:
*
* All redistributions must retain an intact copy of this copyright notice
* and disclaimer.
*/
// Extended JavaScript BN functions, required for RSA private ops.
// Version 1.1: new BigInteger("0", 10) returns "proper" zero
// Version 1.2: square() API, isProbablePrime fix
// (public)
function bnClone() { var r = nbi(); 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 = nbi(), z = nbi(), 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) {
this.fromInt(0);
if(b == null) b = 10;
var cs = this.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) == "-" && this.signum() == 0) mi = true;
continue;
}
w = b*w+x;
if(++j >= cs) {
this.dMultiply(d);
this.dAddOffset(w,0);
j = 0;
w = 0;
}
}
if(j > 0) {
this.dMultiply(Math.pow(b,j));
this.dAddOffset(w,0);
}
if(mi) BigInteger.ZERO.subTo(this,this);
}
// (protected) alternate constructor
function bnpFromNumber(a,b,c) {
if("number" == typeof b) {
// new BigInteger(int,int,RNG)
if(a < 2) this.fromInt(1);
else {
this.fromNumber(a,c);
if(!this.testBit(a-1)) // force MSB set
this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);
if(this.isEven()) this.dAddOffset(1,0); // force odd
while(!this.isProbablePrime(b)) {
this.dAddOffset(2,0);
if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);
}
}
}
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;
this.fromString(x,256);
}
}
// (public) convert to bigendian byte array
function bnToByteArray(encode_sign_bit) {
var i = this.t, r = new Array();
r[0] = this.s;
var p = this.DB-(i*this.DB)%8, d, k = 0;
if(i-- > 0) {
if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)
r[k++] = d|(this.s<<(this.DB-p));
while(i >= 0) {
if(p < 8) {
d = (this[i]&((1<<p)-1))<<(8-p);
d |= this[--i]>>(p+=this.DB-8);
}
else {
d = (this[i]>>(p-=8))&0xff;
if(p <= 0) { p += this.DB; --i; }
}
if (encode_sign_bit) {
if((d&0x80) != 0) d |= -256;
if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;
}
if(k > 0 || d != this.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 i, f, m = Math.min(a.t,this.t);
for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);
if(a.t < this.t) {
f = a.s&this.DM;
for(i = m; i < this.t; ++i) r[i] = op(this[i],f);
r.t = this.t;
}
else {
f = this.s&this.DM;
for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);
r.t = a.t;
}
r.s = op(this.s,a.s);
r.clamp();
}
// (public) this & a
function op_and(x,y) { return x&y; }
function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }
// (public) this | a
function op_or(x,y) { return x|y; }
function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }
// (public) this ^ a
function op_xor(x,y) { return x^y; }
function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }
// (public) this & ~a
function op_andnot(x,y) { return x&~y; }
function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }
// (public) ~this
function bnNot() {
var r = nbi();
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 = nbi();
if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);
return r;
}
// (public) this >> n
function bnShiftRight(n) {
var r = nbi();
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 i = 0, c = 0, m = Math.min(a.t,this.t);
while(i < m) {
c += this[i]+a[i];
r[i++] = c&this.DM;
c >>= this.DB;
}
if(a.t < this.t) {
c += a.s;
while(i < this.t) {
c += this[i];
r[i++] = c&this.DM;
c >>= this.DB;
}
c += this.s;
}
else {
c += this.s;
while(i < a.t) {
c += a[i];
r[i++] = c&this.DM;
c >>= this.DB;
}
c += a.s;
}
r.s = (c<0)?-1:0;
if(c > 0) r[i++] = c;
else if(c < -1) r[i++] = this.DV+c;
r.t = i;
r.clamp();
}
// (public) this + a
function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }
// (public) this - a
function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }
// (public) this * a
function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }
// (public) this^2
function bnSquare() { var r = nbi(); this.squareTo(r); return r; }
// (public) this / a
function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }
// (public) this % a
function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }
// (public) [this/a,this%a]
function bnDivideAndRemainder(a) {
var q = nbi(), r = nbi();
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 = nbi();
this.q3 = nbi();
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 = nbi(); x.copyTo(r); this.reduce(r); return r; }
}
function barrettRevert(x) { return x; }
// x = x mod m (HAC 14.42)
function barrettReduce(x) {
x.drShiftTo(this.m.t-1,this.r2);
if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }
this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);
this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);
while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);
x.subTo(this.r2,x);
while(x.compareTo(this.m) >= 0) x.subTo(this.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 = nbi();
z.sqrTo(g[1],g2);
while(n <= km) {
g[n] = nbi();
z.mulTo(g2,g[n-2],g[n]);
n += 2;
}
}
var j = e.t-1, w, is1 = true, r2 = nbi(), 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);
}
/* added by Recurity Labs */
function nbits(x) {
var n = 1, t;
if ((t = x >>> 16) != 0) {
x = t;
n += 16;
}
if ((t = x >> 8) != 0) {
x = t;
n += 8;
}
if ((t = x >> 4) != 0) {
x = t;
n += 4;
}
if ((t = x >> 2) != 0) {
x = t;
n += 2;
}
if ((t = x >> 1) != 0) {
x = t;
n += 1;
}
return n;
}
function bnToMPI () {
var ba = this.toByteArray();
var size = (ba.length-1)*8+nbits(ba[0]);
var result = "";
result += String.fromCharCode((size & 0xFF00) >> 8);
result += String.fromCharCode(size & 0xFF);
result += util.bin2str(ba);
return result;
}
/* END of addition */
// (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 = nbi();
for(var i = 0; i < t; ++i) {
//Pick bases at random, instead of starting at 2
a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);
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
BigInteger.prototype.chunkSize = bnpChunkSize;
BigInteger.prototype.toRadix = bnpToRadix;
BigInteger.prototype.fromRadix = bnpFromRadix;
BigInteger.prototype.fromNumber = bnpFromNumber;
BigInteger.prototype.bitwiseTo = bnpBitwiseTo;
BigInteger.prototype.changeBit = bnpChangeBit;
BigInteger.prototype.addTo = bnpAddTo;
BigInteger.prototype.dMultiply = bnpDMultiply;
BigInteger.prototype.dAddOffset = bnpDAddOffset;
BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;
BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;
BigInteger.prototype.modInt = bnpModInt;
BigInteger.prototype.millerRabin = bnpMillerRabin;
// public
BigInteger.prototype.clone = bnClone;
BigInteger.prototype.intValue = bnIntValue;
BigInteger.prototype.byteValue = bnByteValue;
BigInteger.prototype.shortValue = bnShortValue;
BigInteger.prototype.signum = bnSigNum;
BigInteger.prototype.toByteArray = bnToByteArray;
BigInteger.prototype.equals = bnEquals;
BigInteger.prototype.min = bnMin;
BigInteger.prototype.max = bnMax;
BigInteger.prototype.and = bnAnd;
BigInteger.prototype.or = bnOr;
BigInteger.prototype.xor = bnXor;
BigInteger.prototype.andNot = bnAndNot;
BigInteger.prototype.not = bnNot;
BigInteger.prototype.shiftLeft = bnShiftLeft;
BigInteger.prototype.shiftRight = bnShiftRight;
BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;
BigInteger.prototype.bitCount = bnBitCount;
BigInteger.prototype.testBit = bnTestBit;
BigInteger.prototype.setBit = bnSetBit;
BigInteger.prototype.clearBit = bnClearBit;
BigInteger.prototype.flipBit = bnFlipBit;
BigInteger.prototype.add = bnAdd;
BigInteger.prototype.subtract = bnSubtract;
BigInteger.prototype.multiply = bnMultiply;
BigInteger.prototype.divide = bnDivide;
BigInteger.prototype.remainder = bnRemainder;
BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;
BigInteger.prototype.modPow = bnModPow;
BigInteger.prototype.modInverse = bnModInverse;
BigInteger.prototype.pow = bnPow;
BigInteger.prototype.gcd = bnGCD;
BigInteger.prototype.isProbablePrime = bnIsProbablePrime;
BigInteger.prototype.toMPI = bnToMPI;
// JSBN-specific extension
BigInteger.prototype.square = bnSquare;
function bigint_or_number (x) {
if (typeof(x) === 'number') { return nbv(x); }
else { return x; }
};
function buffer_to_ui8a (b) {
var l = b.length;
var ret = new Uint8Array(l);
for (var i = 0; i < l; i++) {
ret[i] = b.readUInt8(i);
}
return ret;
};
// Match this function to the bigint/bignum native JS interface
// in node. Typically we're doing it the other way around.
BigInteger.prototype.fromBuffer = function (buf) {
// the last 'true' is for 'unsigned', our hack to jsbn.js to
// shut off DER-integer interpretation
this.fromString(buffer_to_ui8a(buf), 256, true);
return this;
};
BigInteger.fromBuffer = function (buf) {
var ret = nbi();
ret.fromBuffer(buf);
return ret;
};
BigInteger.random_nbit = function (nbits, rf) {
return new BigInteger(nbits, rf);
};
BigInteger.prototype.inspect = function () {
return "<BigInteger/pure " + this.toString() + ">";
};
// For compatability with the 'bigi' package used by ecurve
BigInteger.fromHex = function (s) {
if (!s.match(/^[a-fA-F0-9]*$/)) { throw new Error("hex string invalid: "+ s); }
if (s.length % 2 != 0) { throw new Error("got an odd-length hex-string"); }
return new BigInteger(s, 16);
};
BigInteger.valueOf = function (x) {
return bigint_or_number(x);
};
BigInteger.prototype.toBuffer = function (size) {
var x;
if (!size) { size = 0; }
var s = this.signum();
if (s == 0) { x = []; }
else {x = this.toByteArray(s < 0); }
var ret = new Buffer(x);
if ((diff = size - x.length) > 0) {
var pad = new Buffer(diff);
pad.fill(0);
ret = Buffer.concat([pad,ret]);
}
return ret;
};
BigInteger.prototype.byteLength = function () { return this.t; }
BigInteger.prototype.toDERInteger = function () {
return this.toByteArray(true);
};
BigInteger.fromDERInteger = function (buf) {
var x = nbi();
x.fromString(buf, 256, false);
return x;
};
BigInteger.prototype.toByteArrayUnsigned = function () {
return new Uint8Array(this.toBuffer());
};
BigInteger.fromByteArrayUnsigned = function (b) {
return BigInteger.fromBuffer(new Buffer(b));
};
BigInteger.prototype.toHex = function (size) {
return this.toBuffer(size).toString('hex');
};
module.exports = {
BigInteger : BigInteger,
nbi : nbi,
nbv : nbv,
Montgomery : Montgomery,
Classic : Classic,
nbits : nbits
};
})(this);
}).call(this,require("buffer").Buffer)
},{"buffer":80}],74:[function(require,module,exports){
var engine = null;
var modules = [ "bigint", "bignum" ];
for (var i in modules) {
try {
engine = require(modules[i]);
break;
} catch (e) {}
}
exports.engine = engine;
},{}],75:[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) && (isNaN(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;
//[[사용자:LiteHell2|<big><span style="background:orange; color:white;" title="라이트헬">Lite</span><span title="라이트헬" style="background:gold; color:white;">Hell</span></big>]]<sup>[[사용자토론:LiteHell2|토론]]</sup>I've managed to break Object.keys through screwy arguments passing.
// Converting to array solves the problem.
if (isArguments(a)) {
if (!isArguments(b)) {
return false;
}
a = pSlice.call(a);
b = pSlice.call(b);
return _deepEqual(a, b);
}
try {
var ka = objectKeys(a),
kb = objectKeys(b),
key, i;
} catch (e) {//happens when one is a string literal and the other isn't
return false;
}
// 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();
//[[사용자:LiteHell2|<big><span style="background:orange; color:white;" title="라이트헬">Lite</span><span title="라이트헬" style="background:gold; color:white;">Hell</span></big>]]<sup>[[사용자토론:LiteHell2|토론]]</sup>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
//[[사용자:LiteHell2|<big><span style="background:orange; color:white;" title="라이트헬">Lite</span><span title="라이트헬" style="background:gold; color:white;">Hell</span></big>]]<sup>[[사용자토론:LiteHell2|토론]]</sup>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/":77}],76:[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';
}
},{}],77:[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":76,"_process":99,"inherits":97}],78:[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":99,"buffer":80,"pako/lib/zlib/constants":153,"pako/lib/zlib/deflate.js":155,"pako/lib/zlib/inflate.js":157,"pako/lib/zlib/messages":159,"pako/lib/zlib/zstream":161}],79:[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":78,"_process":99,"_stream_transform":110,"assert":75,"buffer":80,"util":114}],80:[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')
exports.Buffer = Buffer
exports.SlowBuffer = Buffer
exports.INSPECT_MAX_BYTES = 50
Buffer.poolSize = 8192
/**
* If `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 `TYPED_ARRAY_SUPPORT` to `false` so they will
* get the Object implementation, which is slower but will work correctly.
*/
var TYPED_ARRAY_SUPPORT = (function () {
try {
var buf = new ArrayBuffer(0)
var arr = new Uint8Array(buf)
arr.foo = function () { return 42 }
return 42 === arr.foo() && // 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, noZero) {
if (!(this instanceof Buffer))
return new Buffer(subject, encoding, noZero)
var type = typeof subject
// Find the length
var length
if (type === 'number')
length = subject > 0 ? subject >>> 0 : 0
else if (type === 'string') {
if (encoding === 'base64')
subject = base64clean(subject)
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 > 0 ? Math.floor(+subject.length) : 0
} else
throw new Error('First argument needs to be a number, array or string.')
var buf
if (TYPED_ARRAY_SUPPORT) {
// Preferred: Return an augmented `Uint8Array` instance for best performance
buf = Buffer._augment(new Uint8Array(length))
} else {
// Fallback: Return THIS instance of Buffer (created by `new`)
buf = this
buf.length = length
buf._isBuffer = true
}
var i
if (TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {
// Speed optimization -- use set if we're copying from a typed array
buf._set(subject)
} else if (isArrayish(subject)) {
// Treat array-ish objects as a byte array
if (Buffer.isBuffer(subject)) {
for (i = 0; i < length; i++)
buf[i] = subject.readUInt8(i)
} else {
for (i = 0; i < length; i++)
buf[i] = ((subject[i] % 256) + 256) % 256
}
} else if (type === 'string') {
buf.write(subject, 0, encoding)
} else if (type === 'number' && !TYPED_ARRAY_SUPPORT && !noZero) {
for (i = 0; i < length; i++) {
buf[i] = 0
}
}
return buf
}
// STATIC METHODS
// ==============
Buffer.isEncoding = function (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.isBuffer = function (b) {
return !!(b != null && b._isBuffer)
}
Buffer.byteLength = function (str, encoding) {
var ret
str = str.toString()
switch (encoding || 'utf8') {
case 'hex':
ret = str.length / 2
break
case 'utf8':
case 'utf-8':
ret = utf8ToBytes(str).length
break
case 'ascii':
case 'binary':
case 'raw':
ret = str.length
break
case 'base64':
ret = base64ToBytes(str).length
break
case 'ucs2':
case 'ucs-2':
case 'utf16le':
case 'utf-16le':
ret = str.length * 2
break
default:
throw new Error('Unknown encoding')
}
return ret
}
Buffer.concat = function (list, totalLength) {
assert(isArray(list), 'Usage: Buffer.concat(list[, length])')
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.compare = function (a, b) {
assert(Buffer.isBuffer(a) && Buffer.isBuffer(b), 'Arguments must be Buffers')
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 INSTANCE METHODS
// =======================
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
assert(strLen % 2 === 0, 'Invalid hex string')
if (length > strLen / 2) {
length = strLen / 2
}
for (var i = 0; i < length; i++) {
var byte = parseInt(string.substr(i * 2, 2), 16)
assert(!isNaN(byte), 'Invalid hex string')
buf[offset + i] = byte
}
return i
}
function utf8Write (buf, string, offset, length) {
var charsWritten = blitBuffer(utf8ToBytes(string), 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, offset, length)
return charsWritten
}
Buffer.prototype.write = function (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
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 Error('Unknown encoding')
}
return ret
}
Buffer.prototype.toString = function (encoding, start, end) {
var self = this
encoding = String(encoding || 'utf8').toLowerCase()
start = Number(start) || 0
end = (end === undefined) ? self.length : Number(end)
// Fastpath empty strings
if (end === start)
return ''
var ret
switch (encoding) {
case 'hex':
ret = hexSlice(self, start, end)
break
case 'utf8':
case 'utf-8':
ret = utf8Slice(self, start, end)
break
case 'ascii':
ret = asciiSlice(self, start, end)
break
case 'binary':
ret = binarySlice(self, start, end)
break
case 'base64':
ret = base64Slice(self, start, end)
break
case 'ucs2':
case 'ucs-2':
case 'utf16le':
case 'utf-16le':
ret = utf16leSlice(self, start, end)
break
default:
throw new Error('Unknown encoding')
}
return ret
}
Buffer.prototype.toJSON = function () {
return {
type: 'Buffer',
data: Array.prototype.slice.call(this._arr || this, 0)
}
}
Buffer.prototype.equals = function (b) {
assert(Buffer.isBuffer(b), 'Argument must be a Buffer')
return Buffer.compare(this, b) === 0
}
Buffer.prototype.compare = function (b) {
assert(Buffer.isBuffer(b), 'Argument must be a Buffer')
return Buffer.compare(this, b)
}
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
Buffer.prototype.copy = function (target, target_start, start, end) {
var source = this
if (!start) start = 0
if (!end && end !== 0) end = this.length
if (!target_start) target_start = 0
// Copy 0 bytes; we're done
if (end === start) return
if (target.length === 0 || source.length === 0) return
// Fatal error conditions
assert(end >= start, 'sourceEnd < sourceStart')
assert(target_start >= 0 && target_start < target.length,
'targetStart out of bounds')
assert(start >= 0 && start < source.length, 'sourceStart out of bounds')
assert(end >= 0 && end <= source.length, '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 < 100 || !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)
}
}
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])
}
return ret
}
function binarySlice (buf, start, end) {
return asciiSlice(buf, start, end)
}
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 (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
if (TYPED_ARRAY_SUPPORT) {
return Buffer._augment(this.subarray(start, end))
} else {
var sliceLen = end - start
var newBuf = new Buffer(sliceLen, undefined, true)
for (var i = 0; i < sliceLen; i++) {
newBuf[i] = this[i + start]
}
return newBuf
}
}
// `get` will be removed in Node 0.13+
Buffer.prototype.get = function (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 (v, offset) {
console.log('.set() is deprecated. Access using array indexes instead.')
return this.writeUInt8(v, offset)
}
Buffer.prototype.readUInt8 = function (offset, noAssert) {
if (!noAssert) {
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset < this.length, 'Trying to read beyond buffer length')
}
if (offset >= this.length)
return
return this[offset]
}
function readUInt16 (buf, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 1 < buf.length, 'Trying to read beyond buffer length')
}
var len = buf.length
if (offset >= len)
return
var val
if (littleEndian) {
val = buf[offset]
if (offset + 1 < len)
val |= buf[offset + 1] << 8
} else {
val = buf[offset] << 8
if (offset + 1 < len)
val |= buf[offset + 1]
}
return val
}
Buffer.prototype.readUInt16LE = function (offset, noAssert) {
return readUInt16(this, offset, true, noAssert)
}
Buffer.prototype.readUInt16BE = function (offset, noAssert) {
return readUInt16(this, offset, false, noAssert)
}
function readUInt32 (buf, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 3 < buf.length, 'Trying to read beyond buffer length')
}
var len = buf.length
if (offset >= len)
return
var val
if (littleEndian) {
if (offset + 2 < len)
val = buf[offset + 2] << 16
if (offset + 1 < len)
val |= buf[offset + 1] << 8
val |= buf[offset]
if (offset + 3 < len)
val = val + (buf[offset + 3] << 24 >>> 0)
} else {
if (offset + 1 < len)
val = buf[offset + 1] << 16
if (offset + 2 < len)
val |= buf[offset + 2] << 8
if (offset + 3 < len)
val |= buf[offset + 3]
val = val + (buf[offset] << 24 >>> 0)
}
return val
}
Buffer.prototype.readUInt32LE = function (offset, noAssert) {
return readUInt32(this, offset, true, noAssert)
}
Buffer.prototype.readUInt32BE = function (offset, noAssert) {
return readUInt32(this, offset, false, noAssert)
}
Buffer.prototype.readInt8 = function (offset, noAssert) {
if (!noAssert) {
assert(offset !== undefined && offset !== null,
'missing offset')
assert(offset < this.length, 'Trying to read beyond buffer length')
}
if (offset >= this.length)
return
var neg = this[offset] & 0x80
if (neg)
return (0xff - this[offset] + 1) * -1
else
return this[offset]
}
function readInt16 (buf, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 1 < buf.length, 'Trying to read beyond buffer length')
}
var len = buf.length
if (offset >= len)
return
var val = readUInt16(buf, offset, littleEndian, true)
var neg = val & 0x8000
if (neg)
return (0xffff - val + 1) * -1
else
return val
}
Buffer.prototype.readInt16LE = function (offset, noAssert) {
return readInt16(this, offset, true, noAssert)
}
Buffer.prototype.readInt16BE = function (offset, noAssert) {
return readInt16(this, offset, false, noAssert)
}
function readInt32 (buf, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 3 < buf.length, 'Trying to read beyond buffer length')
}
var len = buf.length
if (offset >= len)
return
var val = readUInt32(buf, offset, littleEndian, true)
var neg = val & 0x80000000
if (neg)
return (0xffffffff - val + 1) * -1
else
return val
}
Buffer.prototype.readInt32LE = function (offset, noAssert) {
return readInt32(this, offset, true, noAssert)
}
Buffer.prototype.readInt32BE = function (offset, noAssert) {
return readInt32(this, offset, false, noAssert)
}
function readFloat (buf, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset + 3 < buf.length, 'Trying to read beyond buffer length')
}
return ieee754.read(buf, offset, littleEndian, 23, 4)
}
Buffer.prototype.readFloatLE = function (offset, noAssert) {
return readFloat(this, offset, true, noAssert)
}
Buffer.prototype.readFloatBE = function (offset, noAssert) {
return readFloat(this, offset, false, noAssert)
}
function readDouble (buf, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset + 7 < buf.length, 'Trying to read beyond buffer length')
}
return ieee754.read(buf, offset, littleEndian, 52, 8)
}
Buffer.prototype.readDoubleLE = function (offset, noAssert) {
return readDouble(this, offset, true, noAssert)
}
Buffer.prototype.readDoubleBE = function (offset, noAssert) {
return readDouble(this, offset, false, noAssert)
}
Buffer.prototype.writeUInt8 = function (value, offset, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset < this.length, 'trying to write beyond buffer length')
verifuint(value, 0xff)
}
if (offset >= this.length) return
this[offset] = value
return offset + 1
}
function writeUInt16 (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 1 < buf.length, 'trying to write beyond buffer length')
verifuint(value, 0xffff)
}
var len = buf.length
if (offset >= len)
return
for (var i = 0, j = Math.min(len - offset, 2); i < j; i++) {
buf[offset + i] =
(value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
(littleEndian ? i : 1 - i) * 8
}
return offset + 2
}
Buffer.prototype.writeUInt16LE = function (value, offset, noAssert) {
return writeUInt16(this, value, offset, true, noAssert)
}
Buffer.prototype.writeUInt16BE = function (value, offset, noAssert) {
return writeUInt16(this, value, offset, false, noAssert)
}
function writeUInt32 (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 3 < buf.length, 'trying to write beyond buffer length')
verifuint(value, 0xffffffff)
}
var len = buf.length
if (offset >= len)
return
for (var i = 0, j = Math.min(len - offset, 4); i < j; i++) {
buf[offset + i] =
(value >>> (littleEndian ? i : 3 - i) * 8) & 0xff
}
return offset + 4
}
Buffer.prototype.writeUInt32LE = function (value, offset, noAssert) {
return writeUInt32(this, value, offset, true, noAssert)
}
Buffer.prototype.writeUInt32BE = function (value, offset, noAssert) {
return writeUInt32(this, value, offset, false, noAssert)
}
Buffer.prototype.writeInt8 = function (value, offset, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset < this.length, 'Trying to write beyond buffer length')
verifsint(value, 0x7f, -0x80)
}
if (offset >= this.length)
return
if (value >= 0)
this.writeUInt8(value, offset, noAssert)
else
this.writeUInt8(0xff + value + 1, offset, noAssert)
return offset + 1
}
function writeInt16 (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 1 < buf.length, 'Trying to write beyond buffer length')
verifsint(value, 0x7fff, -0x8000)
}
var len = buf.length
if (offset >= len)
return
if (value >= 0)
writeUInt16(buf, value, offset, littleEndian, noAssert)
else
writeUInt16(buf, 0xffff + value + 1, offset, littleEndian, noAssert)
return offset + 2
}
Buffer.prototype.writeInt16LE = function (value, offset, noAssert) {
return writeInt16(this, value, offset, true, noAssert)
}
Buffer.prototype.writeInt16BE = function (value, offset, noAssert) {
return writeInt16(this, value, offset, false, noAssert)
}
function writeInt32 (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 3 < buf.length, 'Trying to write beyond buffer length')
verifsint(value, 0x7fffffff, -0x80000000)
}
var len = buf.length
if (offset >= len)
return
if (value >= 0)
writeUInt32(buf, value, offset, littleEndian, noAssert)
else
writeUInt32(buf, 0xffffffff + value + 1, offset, littleEndian, noAssert)
return offset + 4
}
Buffer.prototype.writeInt32LE = function (value, offset, noAssert) {
return writeInt32(this, value, offset, true, noAssert)
}
Buffer.prototype.writeInt32BE = function (value, offset, noAssert) {
return writeInt32(this, value, offset, false, noAssert)
}
function writeFloat (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 3 < buf.length, 'Trying to write beyond buffer length')
verifIEEE754(value, 3.4028234663852886e+38, -3.4028234663852886e+38)
}
var len = buf.length
if (offset >= len)
return
ieee754.write(buf, value, offset, littleEndian, 23, 4)
return offset + 4
}
Buffer.prototype.writeFloatLE = function (value, offset, noAssert) {
return writeFloat(this, value, offset, true, noAssert)
}
Buffer.prototype.writeFloatBE = function (value, offset, noAssert) {
return writeFloat(this, value, offset, false, noAssert)
}
function writeDouble (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
assert(value !== undefined && value !== null, 'missing value')
assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
assert(offset !== undefined && offset !== null, 'missing offset')
assert(offset + 7 < buf.length,
'Trying to write beyond buffer length')
verifIEEE754(value, 1.7976931348623157E+308, -1.7976931348623157E+308)
}
var len = buf.length
if (offset >= len)
return
ieee754.write(buf, value, offset, littleEndian, 52, 8)
return offset + 8
}
Buffer.prototype.writeDoubleLE = function (value, offset, noAssert) {
return writeDouble(this, value, offset, true, noAssert)
}
Buffer.prototype.writeDoubleBE = function (value, offset, noAssert) {
return writeDouble(this, value, offset, false, noAssert)
}
// fill(value, start=0, end=buffer.length)
Buffer.prototype.fill = function (value, start, end) {
if (!value) value = 0
if (!start) start = 0
if (!end) end = this.length
assert(end >= start, 'end < start')
// Fill 0 bytes; we're done
if (end === start) return
if (this.length === 0) return
assert(start >= 0 && start < this.length, 'start out of bounds')
assert(end >= 0 && end <= this.length, '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
}
Buffer.prototype.inspect = function () {
var out = []
var len = this.length
for (var i = 0; i < len; i++) {
out[i] = toHex(this[i])
if (i === exports.INSPECT_MAX_BYTES) {
out[i + 1] = '...'
break
}
}
return '<Buffer ' + out.join(' ') + '>'
}
/**
* 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 () {
if (typeof Uint8Array !== 'undefined') {
if (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 Error('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 (arr) {
arr._isBuffer = true
// save reference to original Uint8Array get/set methods before overwriting
arr._get = arr.get
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.copy = BP.copy
arr.slice = BP.slice
arr.readUInt8 = BP.readUInt8
arr.readUInt16LE = BP.readUInt16LE
arr.readUInt16BE = BP.readUInt16BE
arr.readUInt32LE = BP.readUInt32LE
arr.readUInt32BE = BP.readUInt32BE
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.writeUInt16LE = BP.writeUInt16LE
arr.writeUInt16BE = BP.writeUInt16BE
arr.writeUInt32LE = BP.writeUInt32LE
arr.writeUInt32BE = BP.writeUInt32BE
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 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 isArray (subject) {
return (Array.isArray || function (subject) {
return Object.prototype.toString.call(subject) === '[object Array]'
})(subject)
}
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 (str) {
var byteArray = []
for (var i = 0; i < str.length; i++) {
var b = str.charCodeAt(i)
if (b <= 0x7F) {
byteArray.push(b)
} else {
var start = i
if (b >= 0xD800 && b <= 0xDFFF) i++
var h = encodeURIComponent(str.slice(start, i+1)).substr(1).split('%')
for (var j = 0; j < h.length; j++) {
byteArray.push(parseInt(h[j], 16))
}
}
}
return byteArray
}
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) {
var c, hi, lo
var byteArray = []
for (var i = 0; i < str.length; i++) {
c = str.charCodeAt(i)
hi = c >> 8
lo = c % 256
byteArray.push(lo)
byteArray.push(hi)
}
return byteArray
}
function base64ToBytes (str) {
return base64.toByteArray(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
}
}
/*
* 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.
*/
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 verifsint (value, max, min) {
assert(typeof value === 'number', 'cannot write a non-number as a number')
assert(value <= max, 'value larger than maximum allowed value')
assert(value >= min, 'value smaller than minimum allowed value')
assert(Math.floor(value) === value, 'value has a fractional component')
}
function verifIEEE754 (value, max, min) {
assert(typeof value === 'number', 'cannot write a non-number as a number')
assert(value <= max, 'value larger than maximum allowed value')
assert(value >= min, 'value smaller than minimum allowed value')
}
function assert (test, message) {
if (!test) throw new Error(message || 'Failed assertion')
}
},{"base64-js":81,"ieee754":82}],81:[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)
function decode (elt) {
var code = elt.charCodeAt(0)
if (code === PLUS)
return 62 // '+'
if (code === SLASH)
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))
},{}],82:[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;
};
},{}],83:[function(require,module,exports){
(function (Buffer){
var createHash = require('sha.js')
var md5 = toConstructor(require('./md5'))
var rmd160 = toConstructor(require('ripemd160'))
function toConstructor (fn) {
return function () {
var buffers = []
var m= {
update: function (data, enc) {
if(!Buffer.isBuffer(data)) data = new Buffer(data, enc)
buffers.push(data)
return this
},
digest: function (enc) {
var buf = Buffer.concat(buffers)
var r = fn(buf)
buffers = null
return enc ? r.toString(enc) : r
}
}
return m
}
}
module.exports = function (alg) {
if('md5' === alg) return new md5()
if('rmd160' === alg) return new rmd160()
return createHash(alg)
}
}).call(this,require("buffer").Buffer)
},{"./md5":87,"buffer":80,"ripemd160":88,"sha.js":90}],84:[function(require,module,exports){
(function (Buffer){
var createHash = require('./create-hash')
var blocksize = 64
var zeroBuffer = new Buffer(blocksize); zeroBuffer.fill(0)
module.exports = Hmac
function Hmac (alg, key) {
if(!(this instanceof Hmac)) return new Hmac(alg, key)
this._opad = opad
this._alg = alg
key = this._key = !Buffer.isBuffer(key) ? new Buffer(key) : key
if(key.length > blocksize) {
key = createHash(alg).update(key).digest()
} else if(key.length < blocksize) {
key = Buffer.concat([key, zeroBuffer], 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)
}
Hmac.prototype.update = function (data, enc) {
this._hash.update(data, enc)
return this
}
Hmac.prototype.digest = function (enc) {
var h = this._hash.digest()
return createHash(this._alg).update(this._opad).update(h).digest(enc)
}
}).call(this,require("buffer").Buffer)
},{"./create-hash":83,"buffer":80}],85:[function(require,module,exports){
(function (Buffer){
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);
}
module.exports = { hash: hash };
}).call(this,require("buffer").Buffer)
},{"buffer":80}],86:[function(require,module,exports){
(function (Buffer){
var rng = require('./rng')
function error () {
var m = [].slice.call(arguments).join(' ')
throw new Error([
m,
'we accept pull requests',
'http://github.com/dominictarr/crypto-browserify'
].join('\n'))
}
exports.createHash = require('./create-hash')
exports.createHmac = require('./create-hmac')
exports.randomBytes = function(size, callback) {
if (callback && callback.call) {
try {
callback.call(this, undefined, new Buffer(rng(size)))
} catch (err) { callback(err) }
} else {
return new Buffer(rng(size))
}
}
function each(a, f) {
for(var i in a)
f(a[i], i)
}
exports.getHashes = function () {
return ['sha1', 'sha256', 'md5', 'rmd160']
}
var p = require('./pbkdf2')(exports.createHmac)
exports.pbkdf2 = p.pbkdf2
exports.pbkdf2Sync = p.pbkdf2Sync
// the least I can do is make error messages for the rest of the node.js/crypto api.
each(['createCredentials'
, 'createCipher'
, 'createCipheriv'
, 'createDecipher'
, 'createDecipheriv'
, 'createSign'
, 'createVerify'
, 'createDiffieHellman'
], function (name) {
exports[name] = function () {
error('sorry,', name, 'is not implemented yet')
}
})
}).call(this,require("buffer").Buffer)
},{"./create-hash":83,"./create-hmac":84,"./pbkdf2":94,"./rng":95,"buffer":80}],87:[function(require,module,exports){
/*
* 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":85}],88:[function(require,module,exports){
(function (Buffer){
module.exports = ripemd160
/*
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];
var bytesToWords = function (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;
};
var wordsToBytes = function (words) {
var bytes = [];
for (var b = 0; b < words.length * 32; b += 8) {
bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
}
return bytes;
};
var processBlock = function (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);
}
}).call(this,require("buffer").Buffer)
},{"buffer":80}],89:[function(require,module,exports){
var u = require('./util')
var write = u.write
var fill = u.zeroFill
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.init = function () {
this._s = 0
this._len = 0
}
function lengthOf(data, enc) {
if(enc == null) return data.byteLength || data.length
if(enc == 'ascii' || enc == 'binary') return data.length
if(enc == 'hex') return data.length/2
if(enc == 'base64') return data.length/3
}
Hash.prototype.update = function (data, enc) {
var bl = this._blockSize
//I'd rather do this with a streaming encoder, like the opposite of
//http://nodejs.org/api/string_decoder.html
var length
if(!enc && 'string' === typeof data)
enc = 'utf8'
if(enc) {
if(enc === 'utf-8')
enc = 'utf8'
if(enc === 'base64' || enc === 'utf8')
data = new Buffer(data, enc), enc = null
length = lengthOf(data, enc)
} else
length = data.byteLength || data.length
var l = this._len += length
var s = this._s = (this._s || 0)
var f = 0
var buffer = this._block
while(s < l) {
var t = Math.min(length, f + bl - s%bl)
write(buffer, data, enc, s%bl, f, t)
var ch = (t - f);
s += ch; f += ch
if(!(s%bl))
this._update(buffer)
}
this._s = s
return this
}
Hash.prototype.digest = function (enc) {
var bl = this._blockSize
var fl = this._finalSize
var len = this._len*8
var x = this._block
var bits = len % (bl*8)
//add end marker, so that appending 0's creats a different hash.
x[this._len % bl] = 0x80
fill(this._block, this._len % bl + 1)
if(bits >= fl*8) {
this._update(this._block)
u.zeroFill(this._block, 0)
}
//TODO: handle case where the bit length is > Math.pow(2, 29)
x.writeInt32BE(len, fl + 4) //big endian
var hash = this._update(this._block) || this._hash()
if(enc == null) return hash
return hash.toString(enc)
}
Hash.prototype._update = function () {
throw new Error('_update must be implemented by subclass')
}
return Hash
}
},{"./util":93}],90:[function(require,module,exports){
var exports = module.exports = function (alg) {
var Alg = exports[alg]
if(!Alg) throw new Error(alg + ' is not supported (we accept pull requests)')
return new Alg()
}
var Buffer = require('buffer').Buffer
var Hash = require('./hash')(Buffer)
exports.sha =
exports.sha1 = require('./sha1')(Buffer, Hash)
exports.sha256 = require('./sha256')(Buffer, Hash)
},{"./hash":89,"./sha1":91,"./sha256":92,"buffer":80}],91:[function(require,module,exports){
/*
* 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.
*/
module.exports = function (Buffer, Hash) {
var inherits = require('util').inherits
inherits(Sha1, Hash)
var A = 0|0
var B = 4|0
var C = 8|0
var D = 12|0
var E = 16|0
var BE = false
var LE = true
var W = new Int32Array(80)
var POOL = []
function Sha1 () {
if(POOL.length)
return POOL.pop().init()
if(!(this instanceof Sha1)) return new Sha1()
this._w = W
Hash.call(this, 16*4, 14*4)
this._h = null
this.init()
}
Sha1.prototype.init = function () {
this._a = 0x67452301
this._b = 0xefcdab89
this._c = 0x98badcfe
this._d = 0x10325476
this._e = 0xc3d2e1f0
Hash.prototype.init.call(this)
return this
}
Sha1.prototype._POOL = POOL
// assume that array is a Uint32Array with length=16,
// and that if it is the last block, it already has the length and the 1 bit appended.
var isDV = new Buffer(1) instanceof DataView
function readInt32BE (X, i) {
return isDV
? X.getInt32(i, false)
: X.readInt32BE(i)
}
Sha1.prototype._update = function (array) {
var X = this._block
var h = this._h
var a, b, c, d, e, _a, _b, _c, _d, _e
a = _a = this._a
b = _b = this._b
c = _c = this._c
d = _d = this._d
e = _e = this._e
var w = this._w
for(var j = 0; j < 80; j++) {
var W = w[j]
= j < 16
//? X.getInt32(j*4, false)
//? readInt32BE(X, j*4) //*/ X.readInt32BE(j*4) //*/
? X.readInt32BE(j*4)
: rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1)
var t =
add(
add(rol(a, 5), sha1_ft(j, b, c, d)),
add(add(e, W), sha1_kt(j))
);
e = d
d = c
c = rol(b, 30)
b = a
a = t
}
this._a = add(a, _a)
this._b = add(b, _b)
this._c = add(c, _c)
this._d = add(d, _d)
this._e = add(e, _e)
}
Sha1.prototype._hash = function () {
if(POOL.length < 100) POOL.push(this)
var H = new Buffer(20)
//console.log(this._a|0, this._b|0, this._c|0, this._d|0, this._e|0)
H.writeInt32BE(this._a|0, A)
H.writeInt32BE(this._b|0, B)
H.writeInt32BE(this._c|0, C)
H.writeInt32BE(this._d|0, D)
H.writeInt32BE(this._e|0, E)
return H
}
/*
* Perform the appropriate triplet combination function for the current
* iteration
*/
function sha1_ft(t, b, c, d) {
if(t < 20) return (b & c) | ((~b) & d);
if(t < 40) return b ^ c ^ d;
if(t < 60) return (b & c) | (b & d) | (c & d);
return b ^ c ^ d;
}
/*
* Determine the appropriate additive constant for the current iteration
*/
function sha1_kt(t) {
return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
(t < 60) ? -1894007588 : -899497514;
}
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
* //dominictarr: this is 10 years old, so maybe this can be dropped?)
*
*/
function add(x, y) {
return (x + y ) | 0
//lets see how this goes on testling.
// 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 rol(num, cnt) {
return (num << cnt) | (num >>> (32 - cnt));
}
return Sha1
}
},{"util":114}],92:[function(require,module,exports){
/**
* 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('util').inherits
var BE = false
var LE = true
var u = require('./util')
module.exports = function (Buffer, 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
]
inherits(Sha256, Hash)
var W = new Array(64)
var POOL = []
function Sha256() {
if(POOL.length) {
//return POOL.shift().init()
}
//this._data = new Buffer(32)
this.init()
this._w = W //new Array(64)
Hash.call(this, 16*4, 14*4)
};
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
this._len = this._s = 0
return this
}
var safe_add = function(x, y) {
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
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 M = this._block
var W = this._w
var a, b, c, d, e, f, g, h
var T1, T2
a = this._a | 0
b = this._b | 0
c = this._c | 0
d = this._d | 0
e = this._e | 0
f = this._f | 0
g = this._g | 0
h = this._h | 0
for (var j = 0; j < 64; j++) {
var w = W[j] = j < 16
? M.readInt32BE(j * 4)
: Gamma1256(W[j - 2]) + W[j - 7] + Gamma0256(W[j - 15]) + W[j - 16]
T1 = h + Sigma1256(e) + Ch(e, f, g) + K[j] + w
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;
}
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 () {
if(POOL.length < 10)
POOL.push(this)
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
}
return Sha256
}
},{"./util":93,"util":114}],93:[function(require,module,exports){
exports.write = write
exports.zeroFill = zeroFill
exports.toString = toString
function write (buffer, string, enc, start, from, to, LE) {
var l = (to - from)
if(enc === 'ascii' || enc === 'binary') {
for( var i = 0; i < l; i++) {
buffer[start + i] = string.charCodeAt(i + from)
}
}
else if(enc == null) {
for( var i = 0; i < l; i++) {
buffer[start + i] = string[i + from]
}
}
else if(enc === 'hex') {
for(var i = 0; i < l; i++) {
var j = from + i
buffer[start + i] = parseInt(string[j*2] + string[(j*2)+1], 16)
}
}
else if(enc === 'base64') {
throw new Error('base64 encoding not yet supported')
}
else
throw new Error(enc +' encoding not yet supported')
}
//always fill to the end!
function zeroFill(buf, from) {
for(var i = from; i < buf.length; i++)
buf[i] = 0
}
},{}],94:[function(require,module,exports){
(function (Buffer){
// JavaScript PBKDF2 Implementation
// Based on http://git.io/qsv2zw
// Licensed under LGPL v3
// Copyright (c) 2013 jduncanator
var blocksize = 64
var zeroBuffer = new Buffer(blocksize); zeroBuffer.fill(0)
module.exports = function (createHmac, exports) {
exports = exports || {}
exports.pbkdf2 = function(password, salt, iterations, keylen, cb) {
if('function' !== typeof cb)
throw new Error('No callback provided to pbkdf2');
setTimeout(function () {
cb(null, exports.pbkdf2Sync(password, salt, iterations, keylen))
})
}
exports.pbkdf2Sync = function(key, salt, iterations, keylen) {
if('number' !== typeof iterations)
throw new TypeError('Iterations not a number')
if(iterations < 0)
throw new TypeError('Bad iterations')
if('number' !== typeof keylen)
throw new TypeError('Key length not a number')
if(keylen < 0)
throw new TypeError('Bad key length')
//stretch key to the correct length that hmac wants it,
//otherwise this will happen every time hmac is called
//twice per iteration.
var key = !Buffer.isBuffer(key) ? new Buffer(key) : key
if(key.length > blocksize) {
key = createHash(alg).update(key).digest()
} else if(key.length < blocksize) {
key = Buffer.concat([key, zeroBuffer], blocksize)
}
var HMAC;
var cplen, p = 0, i = 1, itmp = new Buffer(4), digtmp;
var out = new Buffer(keylen);
out.fill(0);
while(keylen) {
if(keylen > 20)
cplen = 20;
else
cplen = keylen;
/* We are unlikely to ever use more than 256 blocks (5120 bits!)
* but just in case...
*/
itmp[0] = (i >> 24) & 0xff;
itmp[1] = (i >> 16) & 0xff;
itmp[2] = (i >> 8) & 0xff;
itmp[3] = i & 0xff;
HMAC = createHmac('sha1', key);
HMAC.update(salt)
HMAC.update(itmp);
digtmp = HMAC.digest();
digtmp.copy(out, p, 0, cplen);
for(var j = 1; j < iterations; j++) {
HMAC = createHmac('sha1', key);
HMAC.update(digtmp);
digtmp = HMAC.digest();
for(var k = 0; k < cplen; k++) {
out[k] ^= digtmp[k];
}
}
keylen -= cplen;
i++;
p += cplen;
}
return out;
}
return exports
}
}).call(this,require("buffer").Buffer)
},{"buffer":80}],95:[function(require,module,exports){
(function (Buffer){
(function() {
module.exports = function(size) {
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);
return bytes;
}
}())
}).call(this,require("buffer").Buffer)
},{"buffer":80}],96:[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
} else {
throw TypeError('Uncaught, unspecified "error" event.');
}
return false;
}
}
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;
}
},{}],97:[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
}
}
},{}],98:[function(require,module,exports){
module.exports = Array.isArray || function (arr) {
return Object.prototype.toString.call(arr) == '[object Array]';
};
},{}],99:[function(require,module,exports){
// shim for using process in browser
var process = module.exports = {};
process.nextTick = (function () {
var canSetImmediate = typeof window !== 'undefined'
&& window.setImmediate;
var canPost = typeof window !== 'undefined'
&& window.postMessage && window.addEventListener
;
if (canSetImmediate) {
return function (f) { return window.setImmediate(f) };
}
if (canPost) {
var queue = [];
window.addEventListener('message', function (ev) {
var source = ev.source;
if ((source === window || source === null) && ev.data === 'process-tick') {
ev.stopPropagation();
if (queue.length > 0) {
var fn = queue.shift();
fn();
}
}
}, true);
return function nextTick(fn) {
queue.push(fn);
window.postMessage('process-tick', '*');
};
}
return function nextTick(fn) {
setTimeout(fn, 0);
};
})();
process.title = 'browser';
process.browser = true;
process.env = {};
process.argv = [];
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');
};
},{}],100:[function(require,module,exports){
module.exports = require("./lib/_stream_duplex.js")
},{"./lib/_stream_duplex.js":101}],101:[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":103,"./_stream_writable":105,"_process":99,"core-util-is":106,"inherits":97}],102:[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":104,"core-util-is":106,"inherits":97}],103:[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 (isNaN(n) || n === null) {
// 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;
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) {
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;
// 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);
var ret;
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) {
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);
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 (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":99,"buffer":80,"core-util-is":106,"events":96,"inherits":97,"isarray":98,"stream":112,"string_decoder/":107}],104:[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 (data !== null && data !== undefined)
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);
var ts = 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('finish', function() {
if ('function' === typeof 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 (ts.writechunk !== null && 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 rs = stream._readableState;
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":101,"core-util-is":106,"inherits":97}],105:[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":101,"_process":99,"buffer":80,"core-util-is":106,"inherits":97,"stream":112}],106:[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":80}],107:[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);
}
}
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;
}
this.charBuffer = new Buffer(6);
this.charReceived = 0;
this.charLength = 0;
};
StringDecoder.prototype.write = function(buffer) {
var charStr = '';
var offset = 0;
// 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 i = (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, offset, i);
this.charReceived += (i - offset);
offset = i;
if (this.charReceived < this.charLength) {
// still not enough chars in this buffer? wait for more ...
return '';
}
// get the character that was split
charStr = this.charBuffer.slice(0, this.charLength).toString(this.encoding);
// 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 (i == buffer.length) return charStr;
// otherwise cut off the characters end from the beginning of this buffer
buffer = buffer.slice(i, buffer.length);
break;
}
var lenIncomplete = this.detectIncompleteChar(buffer);
var end = buffer.length;
if (this.charLength) {
// buffer the incomplete character bytes we got
buffer.copy(this.charBuffer, 0, buffer.length - lenIncomplete, end);
this.charReceived = lenIncomplete;
end -= lenIncomplete;
}
charStr += buffer.toString(this.encoding, 0, end);
var end = charStr.length - 1;
var charCode = charStr.charCodeAt(end);
// 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);
this.charBuffer.write(charStr.charAt(charStr.length - 1), this.encoding);
return charStr.substring(0, end);
}
// or just emit the charStr
return charStr;
};
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;
}
}
return 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) {
var incomplete = this.charReceived = buffer.length % 2;
this.charLength = incomplete ? 2 : 0;
return incomplete;
}
function base64DetectIncompleteChar(buffer) {
var incomplete = this.charReceived = buffer.length % 3;
this.charLength = incomplete ? 3 : 0;
return incomplete;
}
},{"buffer":80}],108:[function(require,module,exports){
module.exports = require("./lib/_stream_passthrough.js")
},{"./lib/_stream_passthrough.js":102}],109:[function(require,module,exports){
exports = module.exports = require('./lib/_stream_readable.js');
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":101,"./lib/_stream_passthrough.js":102,"./lib/_stream_readable.js":103,"./lib/_stream_transform.js":104,"./lib/_stream_writable.js":105}],110:[function(require,module,exports){
module.exports = require("./lib/_stream_transform.js")
},{"./lib/_stream_transform.js":104}],111:[function(require,module,exports){
module.exports = require("./lib/_stream_writable.js")
},{"./lib/_stream_writable.js":105}],112:[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":96,"inherits":97,"readable-stream/duplex.js":100,"readable-stream/passthrough.js":108,"readable-stream/readable.js":109,"readable-stream/transform.js":110,"readable-stream/writable.js":111}],113:[function(require,module,exports){
module.exports=require(76)
},{}],114:[function(require,module,exports){
module.exports=require(77)
},{"./support/isBuffer":113,"_process":99,"inherits":97}],115:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
var BaseError, Canceler, EscErr, EscOk, c_to_camel, ipush, make_error_klass, make_errors, make_esc, to_lower, util,
__slice = [].slice;
util = require('util');
exports.BaseError = BaseError = function(msg, constructor) {
Error.captureStackTrace(this, this.constructor);
return this.message = msg || 'Error';
};
util.inherits(BaseError, Error);
BaseError.prototype.name = "BaseError";
to_lower = function(s) {
return s[0].toUpperCase() + s.slice(1).toLowerCase();
};
c_to_camel = function(s) {
var p;
return ((function() {
var _i, _len, _ref, _results;
_ref = s.split(/_/);
_results = [];
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
p = _ref[_i];
_results.push(to_lower(p));
}
return _results;
})()).join('');
};
make_error_klass = function(k, code, default_msg) {
var ctor;
ctor = function(msg) {
BaseError.call(this, msg || default_msg, this.constructor);
this.istack = [];
this.code = code;
return this;
};
util.inherits(ctor, BaseError);
ctor.prototype.name = k;
ctor.prototype.inspect = function() {
return "[" + k + ": " + this.message + " (code " + this.code + ")]";
};
return ctor;
};
exports.make_errors = make_errors = function(d) {
var enam, errno, k, msg, out, val;
out = {
msg: {},
name: {},
code: {}
};
d.OK = "Success";
errno = 100;
for (k in d) {
msg = d[k];
if (k !== "OK") {
enam = (c_to_camel(k)) + "Error";
val = errno++;
out[enam] = make_error_klass(enam, val, msg);
} else {
val = 0;
}
out[k] = val;
out.msg[k] = out.msg[val] = msg;
out.name[k] = out.name[val] = k;
out.code[k] = val;
}
return out;
};
ipush = function(e, msg) {
if (msg != null) {
if (e.istack == null) {
e.istack = [];
}
return e.istack.push(msg);
}
};
exports.make_esc = make_esc = function(gcb, where) {
return function(lcb) {
return function() {
var args, err;
err = arguments[0], args = 2 <= arguments.length ? __slice.call(arguments, 1) : [];
if (err == null) {
return lcb.apply(null, args);
} else if (!gcb.__esc) {
gcb.__esc = true;
ipush(err, where);
return gcb(err);
}
};
};
};
exports.EscOk = EscOk = (function() {
function EscOk(gcb, where) {
this.gcb = gcb;
this.where = where;
}
EscOk.prototype.bailout = function() {
var t;
if (this.gcb) {
t = this.gcb;
this.gcb = null;
return t(false);
}
};
EscOk.prototype.check_ok = function(cb) {
return (function(_this) {
return function() {
var args, ok;
ok = arguments[0], args = 2 <= arguments.length ? __slice.call(arguments, 1) : [];
if (!ok) {
return _this.bailout();
} else {
return cb.apply(null, args);
}
};
})(this);
};
EscOk.prototype.check_err = function(cb) {
return (function(_this) {
return function() {
var args, err;
err = arguments[0], args = 2 <= arguments.length ? __slice.call(arguments, 1) : [];
if (err != null) {
ipush(err, _this.where);
return _this.bailout();
} else {
return cb.apply(null, args);
}
};
})(this);
};
EscOk.prototype.check_non_null = function(cb) {
return (function(_this) {
return function() {
var args;
args = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
if (args[0] == null) {
return _this.bailout();
} else {
return cb.apply(null, args);
}
};
})(this);
};
return EscOk;
})();
exports.EscErr = EscErr = (function() {
function EscErr(gcb, where) {
this.gcb = gcb;
this.where = where;
}
EscErr.prototype.finish = function(err) {
var t;
if (this.gcb) {
t = this.gcb;
this.gcb = null;
return t(err);
}
};
EscErr.prototype.check_ok = function(cb, eclass, emsg) {
if (eclass == null) {
eclass = Error;
}
if (emsg == null) {
emsg = null;
}
return function() {
var args, err, ok;
ok = arguments[0], args = 2 <= arguments.length ? __slice.call(arguments, 1) : [];
if (!ok) {
err = new eclass(emsg);
ipush(err, this.where);
return this.finish(err);
} else {
return cb.apply(null, args);
}
};
};
EscErr.prototype.check_err = function(cb) {
return function() {
var args, err;
err = arguments[0], args = 2 <= arguments.length ? __slice.call(arguments, 1) : [];
if (err != null) {
ipush(err, this.where);
return this.finish(err);
} else {
return cb.apply(null, args);
}
};
};
return EscErr;
})();
exports.Canceler = Canceler = (function() {
function Canceler(klass) {
this.klass = klass != null ? klass : Error;
this._canceled = false;
}
Canceler.prototype.is_canceled = function() {
return this._canceled;
};
Canceler.prototype.is_ok = function() {
return !this._canceled;
};
Canceler.prototype.cancel = function() {
return this._canceled = true;
};
Canceler.prototype.err = function() {
if (this._canceled) {
return new this.klass("Aborted");
} else {
return null;
}
};
return Canceler;
})();
exports.chain = function(cb, f) {
return function() {
var args;
args = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
return f(function() {
return cb.apply(null, args);
});
};
};
exports.chain_err = function(cb, f) {
return function() {
var args0;
args0 = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
return f(function() {
var args1;
args1 = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
return cb.apply(null, ((args1[0] != null) && !(args0[0] != null) ? args1 : args0));
});
};
};
}).call(this);
//# sourceMappingURL=index.map
},{"util":114}],116:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
module.exports = {
k: "__iced_k",
k_noop: "__iced_k_noop",
param: "__iced_p_",
ns: "iced",
runtime: "runtime",
Deferrals: "Deferrals",
deferrals: "__iced_deferrals",
fulfill: "_fulfill",
b_while: "_break",
t_while: "_while",
c_while: "_continue",
n_while: "_next",
n_arg: "__iced_next_arg",
defer_method: "defer",
slot: "__slot",
assign_fn: "assign_fn",
autocb: "autocb",
retslot: "ret",
trace: "__iced_trace",
passed_deferral: "__iced_passed_deferral",
findDeferral: "findDeferral",
lineno: "lineno",
parent: "parent",
filename: "filename",
funcname: "funcname",
catchExceptions: 'catchExceptions',
runtime_modes: ["node", "inline", "window", "none", "browserify", "interp"],
trampoline: "trampoline",
context: "context"
};
}).call(this);
},{}],117:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var C, Pipeliner, iced, __iced_k, __iced_k_noop, _iand, _ior, _timeout,
__slice = [].slice;
__iced_k = __iced_k_noop = function() {};
C = require('./const');
exports.iced = iced = require('./runtime');
_timeout = function(cb, t, res, tmp) {
var arr, rv, which, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
rv = new iced.Rendezvous;
tmp[0] = rv.id(true).defer({
assign_fn: (function(_this) {
return function() {
return function() {
return arr = __slice.call(arguments, 0);
};
};
})(this)(),
lineno: 20,
context: __iced_deferrals
});
setTimeout(rv.id(false).defer({
lineno: 21,
context: __iced_deferrals
}), t);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced"
});
rv.wait(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return which = arguments[0];
};
})(),
lineno: 22
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (res) {
res[0] = which;
}
return cb.apply(null, arr);
};
})(this));
};
exports.timeout = function(cb, t, res) {
var tmp;
tmp = [];
_timeout(cb, t, res, tmp);
return tmp[0];
};
_iand = function(cb, res, tmp) {
var ok, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced"
});
tmp[0] = __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ok = arguments[0];
};
})(),
lineno: 39
});
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (!ok) {
res[0] = false;
}
return cb();
};
})(this));
};
exports.iand = function(cb, res) {
var tmp;
tmp = [];
_iand(cb, res, tmp);
return tmp[0];
};
_ior = function(cb, res, tmp) {
var ok, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced"
});
tmp[0] = __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ok = arguments[0];
};
})(),
lineno: 58
});
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
if (ok) {
res[0] = true;
}
return cb();
};
})(this));
};
exports.ior = function(cb, res) {
var tmp;
tmp = [];
_ior(cb, res, tmp);
return tmp[0];
};
exports.Pipeliner = Pipeliner = (function() {
function Pipeliner(window, delay) {
this.window = window || 1;
this.delay = delay || 0;
this.queue = [];
this.n_out = 0;
this.cb = null;
this[C.deferrals] = this;
this["defer"] = this._defer;
}
Pipeliner.prototype.waitInQueue = function(cb) {
var ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_this.n_out >= _this.window)) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced",
funcname: "Pipeliner.waitInQueue"
});
_this.cb = __iced_deferrals.defer({
lineno: 100
});
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
_this.n_out++;
(function(__iced_k) {
if (_this.delay) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced",
funcname: "Pipeliner.waitInQueue"
});
setTimeout(__iced_deferrals.defer({
lineno: 108
}), _this.delay);
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb();
});
};
})(this));
};
Pipeliner.prototype.__defer = function(out, deferArgs) {
var tmp, voidCb, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced",
funcname: "Pipeliner.__defer"
});
voidCb = __iced_deferrals.defer({
lineno: 122
});
out[0] = function() {
var args, _ref;
args = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
if ((_ref = deferArgs.assign_fn) != null) {
_ref.apply(null, args);
}
return voidCb();
};
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
_this.n_out--;
if (_this.cb) {
tmp = _this.cb;
_this.cb = null;
return tmp();
}
};
})(this));
};
Pipeliner.prototype._defer = function(deferArgs) {
var tmp;
tmp = [];
this.__defer(tmp, deferArgs);
return tmp[0];
};
Pipeliner.prototype.flush = function(autocb) {
var ___iced_passed_deferral, __iced_k, _results, _while;
__iced_k = autocb;
___iced_passed_deferral = iced.findDeferral(arguments);
_results = [];
_while = (function(_this) {
var __iced_deferrals;
return function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!_this.n_out) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/iced/iced-runtime/src/library.iced",
funcname: "Pipeliner.flush"
});
_this.cb = __iced_deferrals.defer({
lineno: 151
});
__iced_deferrals._fulfill();
})(_next);
}
};
})(this);
_while(__iced_k);
};
return Pipeliner;
})();
}).call(this);
},{"./const":116,"./runtime":119}],118:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var k, mod, mods, v, _i, _len;
exports["const"] = require('./const');
mods = [require('./runtime'), require('./library')];
for (_i = 0, _len = mods.length; _i < _len; _i++) {
mod = mods[_i];
for (k in mod) {
v = mod[k];
exports[k] = v;
}
}
}).call(this);
},{"./const":116,"./library":117,"./runtime":119}],119:[function(require,module,exports){
(function (process){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var C, Deferrals, Rendezvous, exceptionHandler, findDeferral, make_defer_return, stackWalk, tick_counter, trampoline, warn, __active_trace, __c, _trace_to_string,
__slice = [].slice;
C = require('./const');
make_defer_return = function(obj, defer_args, id, trace_template, multi) {
var k, ret, trace, v;
trace = {};
for (k in trace_template) {
v = trace_template[k];
trace[k] = v;
}
trace[C.lineno] = defer_args != null ? defer_args[C.lineno] : void 0;
ret = function() {
var inner_args, o, _ref;
inner_args = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
if (defer_args != null) {
if ((_ref = defer_args.assign_fn) != null) {
_ref.apply(null, inner_args);
}
}
if (obj) {
o = obj;
if (!multi) {
obj = null;
}
return o._fulfill(id, trace);
} else {
return warn("overused deferral at " + (_trace_to_string(trace)));
}
};
ret[C.trace] = trace;
return ret;
};
__c = 0;
tick_counter = function(mod) {
__c++;
if ((__c % mod) === 0) {
__c = 0;
return true;
} else {
return false;
}
};
__active_trace = null;
_trace_to_string = function(tr) {
var fn;
fn = tr[C.funcname] || "<anonymous>";
return "" + fn + " (" + tr[C.filename] + ":" + (tr[C.lineno] + 1) + ")";
};
warn = function(m) {
return typeof console !== "undefined" && console !== null ? console.error("ICED warning: " + m) : void 0;
};
exports.trampoline = trampoline = function(fn) {
if (!tick_counter(500)) {
return fn();
} else if (typeof process !== "undefined" && process !== null) {
return process.nextTick(fn);
} else {
return setTimeout(fn);
}
};
exports.Deferrals = Deferrals = (function() {
function Deferrals(k, trace) {
this.trace = trace;
this.continuation = k;
this.count = 1;
this.ret = null;
}
Deferrals.prototype._call = function(trace) {
var c;
if (this.continuation) {
__active_trace = trace;
c = this.continuation;
this.continuation = null;
return c(this.ret);
} else {
return warn("Entered dead await at " + (_trace_to_string(trace)));
}
};
Deferrals.prototype._fulfill = function(id, trace) {
if (--this.count > 0) {
} else {
return trampoline(((function(_this) {
return function() {
return _this._call(trace);
};
})(this)));
}
};
Deferrals.prototype.defer = function(args) {
var self;
this.count++;
self = this;
return make_defer_return(self, args, null, this.trace);
};
return Deferrals;
})();
exports.findDeferral = findDeferral = function(args) {
var a, _i, _len;
for (_i = 0, _len = args.length; _i < _len; _i++) {
a = args[_i];
if (a != null ? a[C.trace] : void 0) {
return a;
}
}
return null;
};
exports.Rendezvous = Rendezvous = (function() {
var RvId;
function Rendezvous() {
this.completed = [];
this.waiters = [];
this.defer_id = 0;
}
RvId = (function() {
function RvId(rv, id, multi) {
this.rv = rv;
this.id = id;
this.multi = multi;
}
RvId.prototype.defer = function(defer_args) {
return this.rv._defer_with_id(this.id, defer_args, this.multi);
};
return RvId;
})();
Rendezvous.prototype.wait = function(cb) {
var x;
if (this.completed.length) {
x = this.completed.shift();
return cb(x);
} else {
return this.waiters.push(cb);
}
};
Rendezvous.prototype.defer = function(defer_args) {
var id;
id = this.defer_id++;
return this._defer_with_id(id, defer_args);
};
Rendezvous.prototype.id = function(i, multi) {
multi = !!multi;
return new RvId(this, i, multi);
};
Rendezvous.prototype._fulfill = function(id, trace) {
var cb;
if (this.waiters.length) {
cb = this.waiters.shift();
return cb(id);
} else {
return this.completed.push(id);
}
};
Rendezvous.prototype._defer_with_id = function(id, defer_args, multi) {
this.count++;
return make_defer_return(this, defer_args, id, {}, multi);
};
return Rendezvous;
})();
exports.stackWalk = stackWalk = function(cb) {
var line, ret, tr, _ref;
ret = [];
tr = cb ? cb[C.trace] : __active_trace;
while (tr) {
line = " at " + (_trace_to_string(tr));
ret.push(line);
tr = tr != null ? (_ref = tr[C.parent]) != null ? _ref[C.trace] : void 0 : void 0;
}
return ret;
};
exports.exceptionHandler = exceptionHandler = function(err, logger) {
var stack;
if (!logger) {
logger = console.error;
}
logger(err.stack);
stack = stackWalk();
if (stack.length) {
logger("Iced 'stack' trace (w/ real line numbers):");
return logger(stack.join("\n"));
}
};
exports.catchExceptions = function(logger) {
return typeof process !== "undefined" && process !== null ? process.on('uncaughtException', function(err) {
exceptionHandler(err, logger);
return process.exit(1);
}) : void 0;
};
}).call(this);
}).call(this,require('_process'))
},{"./const":116,"_process":99}],120:[function(require,module,exports){
if (typeof console.assert !== "function") { console.assert = function () {} };
exports.BWT = require('./outlib/BWT');
exports.BWTC = require('./outlib/BWTC');
exports.BitStream = require('./outlib/BitStream');
exports.Bzip2 = require('./outlib/Bzip2');
exports.CRC32 = require('./outlib/CRC32');
exports.Context1Model = require('./outlib/Context1Model');
exports.DefSumModel = require('./outlib/DefSumModel');
exports.DeflateDistanceModel = require('./outlib/DeflateDistanceModel');
exports.Dmc = require('./outlib/Dmc');
exports.DummyRangeCoder = require('./outlib/DummyRangeCoder');
exports.FenwickModel = require('./outlib/FenwickModel');
exports.Huffman = require('./outlib/Huffman');
exports.HuffmanAllocator = require('./outlib/HuffmanAllocator');
exports.LogDistanceModel = require('./outlib/LogDistanceModel');
exports.Lzjb = require('./outlib/Lzjb');
exports.LzjbR = require('./outlib/LzjbR');
exports.Lzp3 = require('./outlib/Lzp3');
exports.MTFModel = require('./outlib/MTFModel');
exports.NoModel = require('./outlib/NoModel');
exports.PPM = require('./outlib/PPM');
exports.RangeCoder = require('./outlib/RangeCoder');
exports.Simple = require('./outlib/Simple');
exports.Stream = require('./outlib/Stream');
exports.Util = require('./outlib/Util');
exports.freeze = require('./outlib/freeze');
},{"./outlib/BWT":121,"./outlib/BWTC":122,"./outlib/BitStream":123,"./outlib/Bzip2":124,"./outlib/CRC32":125,"./outlib/Context1Model":126,"./outlib/DefSumModel":127,"./outlib/DeflateDistanceModel":128,"./outlib/Dmc":129,"./outlib/DummyRangeCoder":130,"./outlib/FenwickModel":131,"./outlib/Huffman":132,"./outlib/HuffmanAllocator":133,"./outlib/LogDistanceModel":134,"./outlib/Lzjb":135,"./outlib/LzjbR":136,"./outlib/Lzp3":137,"./outlib/MTFModel":138,"./outlib/NoModel":139,"./outlib/PPM":140,"./outlib/RangeCoder":141,"./outlib/Simple":142,"./outlib/Stream":143,"./outlib/Util":144,"./outlib/freeze":145}],121:[function(require,module,exports){
/** Burrows-Wheeler transform, computed with the Induced Sorting Suffix Array
* construction mechanism (sais). Code is a port of:
* https://sites.google.com/site/yuta256/sais
* which is:
* Copyright (c) 2008-2010 Yuta Mori All Rights Reserved.
* and licensed under an MIT/X11 license. I generally looked at both
* the C and the Java implementations to guide my work.
*
* This JavaScript port is:
* Copyright (c) 2013 C. Scott Ananian
* and licensed under GPLv2; see the README at the top level of this package.
*/
var libs = [
require('./freeze'),
require('./Util')
];
var body_fn = function (freeze, Util) {
var ASSERT = console.assert.bind(console);
// we're dispensing with the "arbitrary alphabet" stuff of the source
// and just using Uint8Arrays.
/** Find the start or end of each bucket. */
var getCounts = function(T, C, n, k) {
var i;
for (i = 0; i < k; i++) { C[i] = 0; }
for (i = 0; i < n; i++) { C[T[i]]++; }
};
var getBuckets = function(C, B, k, end) {
var i, sum = 0;
if (end) {
for (i = 0; i < k; i++) { sum += C[i]; B[i] = sum; }
} else {
for (i = 0; i < k; i++) { sum += C[i]; B[i] = sum - C[i]; }
}
};
/** Sort all type LMS suffixes */
var LMSsort = function(T, SA, C, B, n, k) {
var b, i, j;
var c0, c1;
/* compute SAl */
if (C === B) { getCounts(T, C, n, k); }
getBuckets(C, B, k, false); /* find starts of buckets */
j = n - 1;
b = B[c1 = T[j]];
j--;
SA[b++] = (T[j] < c1) ? ~j : j;
for (i = 0; i < n; i++) {
if ((j = SA[i]) > 0) {
ASSERT(T[j] >= T[j+1]);
if ((c0 = T[j]) !== c1) { B[c1] = b; b = B[c1 = c0]; }
ASSERT(i < b);
j--;
SA[b++] = (T[j] < c1) ? ~j : j;
SA[i] = 0;
} else if (j < 0) {
SA[i] = ~j;
}
}
/* compute SAs */
if (C === B) { getCounts(T, C, n, k); }
getBuckets(C, B, k, 1); /* find ends of buckets */
for (i = n-1, b = B[c1 = 0]; i >= 0; i--) {
if ((j = SA[i]) > 0) {
ASSERT(T[j] <= T[j+1]);
if ((c0 = T[j]) !== c1) { B[c1] = b; b = B[c1 = c0]; }
ASSERT(b <= i);
j--;
SA[--b] = (T[j] > c1) ? ~(j+1) : j;
SA[i] = 0;
}
}
};
var LMSpostproc = function(T, SA, n, m) {
var i, j, p, q, plen, qlen, name;
var c0, c1;
var diff;
/* compact all the sorted substrings into the first m items of SA
* 2*m must not be larger than n (provable) */
ASSERT(n > 0);
for (i = 0; (p = SA[i]) < 0; i++) { SA[i] = ~p; ASSERT((i+1) < n); }
if (i < m) {
for (j = i, i++; ; i++) {
ASSERT(i < n);
if ((p = SA[i]) < 0) {
SA[j++] = ~p; SA[i] = 0;
if (j === m) { break; }
}
}
}
/* store the length of all substrings */
c0 = T[i = j = n - 1];
do { c1 = c0; } while ( ((--i) >= 0 ) && ((c0=T[i]) >= c1) );
for (; i >= 0; ) {
do { c1 = c0; } while ( ((--i) >= 0 ) && ((c0=T[i]) <= c1) );
if (i >= 0) {
SA[m + ((i + 1) >>> 1)] = j - i; j = i + 1;
do { c1 = c0; } while ( ((--i) >= 0 ) && ((c0=T[i]) >= c1) );
}
}
/* find the lexicographic names of all substrings */
for (i = 0, name = 0, q = n, qlen = 0; i < m; i++) {
p = SA[i]; plen = SA[m + (p >>> 1)]; diff = true;
if ((plen === qlen) && ((q + plen) < n)) {
for (j = 0; (j < plen) && (T[p + j] === T[q + j]); ) { j++; }
if (j === plen) { diff = false; }
}
if (diff) { name++; q = p; qlen = plen; }
SA[m + (p >>> 1)] = name;
}
return name;
};
/* compute SA and BWT */
var induceSA = function(T, SA, C, B, n, k) {
var b, i, j;
var c0, c1;
/* compute SAl */
if (C === B) { getCounts(T, C, n, k); }
getBuckets(C, B, k, false); /* find starts of buckets */
j = n - 1;
b = B[c1 = T[j]];
SA[b++] = ((j > 0) && (T[j-1] < c1)) ? ~j : j;
for (i = 0; i < n; i++) {
j = SA[i]; SA[i] = ~j;
if (j > 0) {
j--;
ASSERT( T[j] >= T[j + 1] );
if ((c0 = T[j]) !== c1) { B[c1] = b; b = B[c1=c0]; }
ASSERT( i < b );
SA[b++] = ((j > 0) && (T[j-1] < c1)) ? ~j : j;
}
}
/* compute SAs */
if (C === B) { getCounts(T, C, n, k); }
getBuckets(C, B, k, true); /* find ends of buckets */
for (i = n-1, b = B[c1 = 0]; i >= 0; i--) {
if ((j = SA[i]) > 0) {
j--;
ASSERT( T[j] <= T[j + 1] );
if ((c0 = T[j]) !== c1) { B[c1] = b; b = B[c1 = c0]; }
ASSERT( b <= i );
SA[--b] = ((j === 0) || (T[j - 1] > c1)) ? ~j : j;
} else {
SA[i] = ~j;
}
}
};
var computeBWT = function(T, SA, C, B, n, k) {
var b, i, j, pidx = -1;
var c0, c1;
/* compute SAl */
if (C === B) { getCounts(T, C, n, k); }
getBuckets(C, B, k, false); /* find starts of buckets */
j = n - 1;
b = B[c1 = T[j]];
SA[b++] = ((j > 0) && (T[j - 1] < c1)) ? ~j : j;
for (i = 0; i < n; i++) {
if ((j=SA[i]) > 0) {
j--;
ASSERT( T[j] >= T[j+1] );
SA[i] = ~(c0 = T[j]);
if (c0 !== c1) { B[c1] = b; b = B[c1 = c0]; }
ASSERT( i < b );
SA[b++] = ((j > 0) && (T[j - 1] < c1)) ? ~j : j;
} else if (j !== 0) {
SA[i] = ~j;
}
}
/* compute SAs */
if (C === B) { getCounts(T, C, n, k); }
getBuckets(C, B, k, true); /* find ends of buckets */
for (i = n-1, b = B[c1 = 0]; i >= 0; i--) {
if ((j = SA[i]) > 0) {
j--;
ASSERT( T[j] <= T[j+1] );
SA[i] = c0 = T[j];
if (c0 !== c1) { B[c1] = b; b = B[c1 = c0]; }
ASSERT( b <= i );
SA[--b] = ((j > 0) && (T[j-1] > c1)) ? (~T[j-1]) : j;
} else if (j !== 0) {
SA[i] = ~j;
} else {
pidx = i;
}
}
return pidx;
};
/* find the suffix array SA of T[0..n-1] in {0..k-1}^n
use a working space (excluding T and SA) of at most 2n+O(1) for a
constant alphabet */
var SA_IS = function(T, SA, fs, n, k, isbwt) {
var C, B, RA;
var i, j, b, c, m, p, q, name, pidx = 0, newfs;
var c0, c1;
var flags = 0;
// allocate temporary storage [CSA]
if (k <= 256) {
C = Util.makeS32Buffer(k);
if (k <= fs) { B = SA.subarray(n + fs - k); flags = 1; }
else { B = Util.makeS32Buffer(k); flags = 3; }
} else if (k <= fs) {
C = SA.subarray(n + fs - k);
if (k <= (fs - k)) { B = SA.subarray(n + fs - k * 2); flags = 0; }
else if (k <= 1024) { B = Util.makeS32Buffer(k); flags = 2; }
else { B = C; flags = 8; }
} else {
C = B = Util.makeS32Buffer(k);
flags = 4 | 8;
}
/* stage 1: reduce the problem by at least 1/2
sort all the LMS-substrings */
getCounts(T, C, n, k);
getBuckets(C, B, k, true); /* find ends of buckets */
for (i = 0; i < n; i++) { SA[i] = 0; }
b = -1; i = n - 1; j = n; m = 0; c0 = T[n - 1];
do { c1 = c0; } while ((--i >= 0) && ((c0 = T[i]) >= c1));
for (; i >= 0 ;) {
do { c1 = c0; } while ((--i >= 0) && ((c0 = T[i]) <= c1));
if ( i >= 0 ) {
if ( b >= 0 ) { SA[b] = j; }
b = --B[c1];
j = i;
++m;
do { c1 = c0; } while ((--i >= 0) && ((c0 = T[i]) >= c1));
}
}
if (m > 1) {
LMSsort(T, SA, C, B, n, k);
name = LMSpostproc(T, SA, n, m);
} else if (m === 1) {
SA[b] = j + 1;
name = 1;
} else {
name = 0;
}
/* stage 2: solve the reduced problem
recurse if names are not yet unique */
if(name < m) {
if((flags & 4) !== 0) { C = null; B = null; }
if((flags & 2) !== 0) { B = null; }
newfs = (n + fs) - (m * 2);
if((flags & (1 | 4 | 8)) === 0) {
if((k + name) <= newfs) { newfs -= k; }
else { flags |= 8; }
}
ASSERT( (n >>> 1) <= (newfs + m) );
for (i = m + (n >>> 1) - 1, j = m * 2 + newfs - 1; m <= i; i--) {
if(SA[i] !== 0) { SA[j--] = SA[i] - 1; }
}
RA = SA.subarray(m + newfs);
SA_IS(RA, SA, newfs, m, name, false);
RA = null;
i = n - 1; j = m * 2 - 1; c0 = T[n - 1];
do { c1 = c0; } while ((--i >= 0) && ((c0 = T[i]) >= c1));
for (; i >= 0 ;) {
do { c1 = c0; } while ((--i >= 0) && ((c0 = T[i]) <= c1));
if ( i >= 0 ) {
SA[j--] = i + 1;
do { c1 = c0; } while ((--i >= 0) && ((c0 = T[i]) >= c1));
}
}
for (i = 0; i < m; i++) { SA[i] = SA[m + SA[i]]; }
if((flags & 4) !== 0) { C = B = Util.makeS32Buffer(k); }
if((flags & 2) !== 0) { B = Util.makeS32Buffer(k); }
}
/* stage 3: induce the result for the original problem */
if((flags & 8) !== 0) { getCounts(T, C, n, k); }
/* put all left-most S characters into their buckets */
if (m > 1) {
getBuckets(C, B, k, true); /* find ends of buckets */
i = m - 1; j = n; p = SA[m - 1]; c1 = T[p];
do {
q = B[c0 = c1];
while (q < j) { SA[--j] = 0; }
do {
SA[--j] = p;
if(--i < 0) { break; }
p = SA[i];
} while((c1 = T[p]) === c0);
} while (i >= 0 );
while ( j > 0 ) { SA[--j] = 0; }
}
if (!isbwt) { induceSA(T, SA, C, B, n, k); }
else { pidx = computeBWT(T, SA, C, B, n, k); }
C = null; B = null;
return pidx;
};
var BWT = Object.create(null);
/** SA should be a Int32Array (signed!); T can be any typed array.
* alphabetSize is optional if T is an Uint8Array or Uint16Array. */
BWT.suffixsort = function(T, SA, n, alphabetSize) {
ASSERT( T && SA && T.length >= n && SA.length >= n );
if (n <= 1) {
if (n === 1) { SA[0] = 0; }
return 0;
}
if (!alphabetSize) {
if (T.BYTES_PER_ELEMENT === 1) { alphabetSize = 256; }
else if (T.BYTES_PER_ELEMENT === 2) { alphabetSize = 65536; }
else throw new Error('Need to specify alphabetSize');
}
ASSERT( alphabetSize > 0 );
if (T.BYTES_PER_ELEMENT) {
ASSERT( alphabetSize <= (1 << (T.BYTES_PER_ELEMENT*8) ) );
}
return SA_IS(T, SA, 0, n, alphabetSize, false);
};
/** Burrows-Wheeler Transform.
A should be Int32Array (signed!); T can be any typed array.
U is the same type as T (it is used for output).
alphabetSize is optional if T is an Uint8Array or Uint16Array.
ASSUMES STRING IS TERMINATED WITH AN EOF CHARACTER.
*/
BWT.bwtransform = function(T, U, A, n, alphabetSize) {
var i, pidx;
ASSERT( T && U && A );
ASSERT( T.length >= n && U.length >= n && A.length >= n );
if (n <= 1) {
if (n === 1) { U[0] = T[0]; }
return n;
}
if (!alphabetSize) {
if (T.BYTES_PER_ELEMENT === 1) { alphabetSize = 256; }
else if (T.BYTES_PER_ELEMENT === 2) { alphabetSize = 65536; }
else throw new Error('Need to specify alphabetSize');
}
ASSERT( alphabetSize > 0 );
if (T.BYTES_PER_ELEMENT) {
ASSERT( alphabetSize <= (1 << (T.BYTES_PER_ELEMENT*8) ) );
}
pidx = SA_IS(T, A, 0, n, alphabetSize, true);
U[0] = T[n - 1];
for (i = 0; i < pidx ; i++) { U[i + 1] = A[i]; }
for (i += 1; i < n; i++) { U[i] = A[i]; }
return pidx + 1;
};
/** Reverses transform above. (ASSUMED STRING IS TERMINATED WITH EOF.) */
BWT.unbwtransform = function(T, U, LF, n, pidx) {
var C = Util.makeU32Buffer(256);
var i, t;
for (i=0; i<256; i++) { C[i] = 0; }
for (i=0; i<n; i++) { LF[i] = C[T[i]]++; }
for (i=0, t=0; i<256; i++) { t += C[i]; C[i] = t - C[i]; }
for (i=n-1, t=0; i>=0; i--) {
t = LF[t] + C[U[i]=T[t]];
t += (t<pidx) ? 1 : 0;
}
C = null;
};
/** Burrows-Wheeler Transform.
A should be Int32Array (signed!); T can be any typed array.
U is the same type as T (it is used for output).
alphabetSize is optional if T is an Uint8Array or Uint16Array.
ASSUMES STRING IS CYCLIC.
(XXX: this is twice as inefficient as I'd like! [CSA])
*/
BWT.bwtransform2 = function(T, U, n, alphabetSize) {
var i, j, pidx = 0;
ASSERT( T && U );
ASSERT( T.length >= n && U.length >= n );
if (n <= 1) {
if (n === 1) { U[0] = T[0]; }
return 0;
}
if (!alphabetSize) {
if (T.BYTES_PER_ELEMENT === 1) { alphabetSize = 256; }
else if (T.BYTES_PER_ELEMENT === 2) { alphabetSize = 65536; }
else throw new Error('Need to specify alphabetSize');
}
ASSERT( alphabetSize > 0 );
if (T.BYTES_PER_ELEMENT) {
ASSERT( alphabetSize <= (1 << (T.BYTES_PER_ELEMENT*8) ) );
}
// double length of T
var TT;
if (T.length >= n*2) {
TT = T; // do it in place if possible
} else if (alphabetSize <= 256) {
TT = Util.makeU8Buffer(n*2);
} else if (alphabetSize <= 65536) {
TT = Util.makeU16Buffer(n*2);
} else {
TT = Util.makeU32Buffer(n*2);
}
if (TT!==T) {
for (i=0; i<n; i++) { TT[i] = T[i]; }
}
for (i=0; i<n; i++) { TT[n+i] = TT[i]; }
// sort doubled string
var A = Util.makeS32Buffer(n*2);
SA_IS(TT, A, 0, n*2, alphabetSize, false);
for (i=0, j=0; i<2*n; i++) {
var s = A[i];
if (s < n) {
if (s === 0) { pidx = j; }
if (--s < 0) { s = n-1; }
U[j++] = T[s];
}
}
ASSERT(j===n);
return pidx;
};
return freeze(BWT);
};
module.exports = body_fn.apply(null, libs);
},{"./Util":144,"./freeze":145}],122:[function(require,module,exports){
/* A simple bzip-like BWT compressor with a range encoder; written as a
* self-test of the BWT package. */
var libs = [
require('./freeze'),
require('./BWT'),
require('./DefSumModel'),
require('./FenwickModel'),
require('./LogDistanceModel'),
require('./NoModel'),
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (freeze, BWT, DefSumModel, FenwickModel, LogDistanceModel, NoModel, RangeCoder, Stream, Util) {
var EOF = Stream.EOF;
var F_PROB_MAX = 0xFF00;
var F_PROB_INCR = 0x0100;
BWTC = Object.create(null);
BWTC.MAGIC = "bwtc";
BWTC.compressFile = Util.compressFileHelper(BWTC.MAGIC, function(input, output, size, props, finalByte) {
var encoder = new RangeCoder(output);
encoder.encodeStart(finalByte, 1);
var blockSize = 9;
if (typeof(props)==='number' && props >= 1 && props <= 9) {
blockSize = props;
}
encoder.encodeByte(blockSize);
var fast = (blockSize <= 5);
blockSize *= 100000;
var block = Util.makeU8Buffer(blockSize);
var readBlock = function() {
var pos;
for (pos=0; pos < blockSize; ) {
var ch = input.readByte();
if (ch < 0) { break; }
block[pos++] = ch;
}
return pos;
};
var U = Util.makeU8Buffer(blockSize);
var A = Util.makeS32Buffer(blockSize);
var M = Util.makeU8Buffer(256); // move to front array
var bitModelFactory = NoModel.factory(encoder);
var lenModel = new LogDistanceModel(blockSize, 0,
bitModelFactory,
bitModelFactory);
var length, b, c, pidx, i, j;
do {
length = readBlock();
if (length === 0) { break; }
// indicate that there's another block comin'
// and encode the length of the block if necessary
if (length === block.length) {
encoder.encodeFreq(1, 0, 3); // "full size block"
b = block;
} else {
encoder.encodeFreq(1, 1, 3); // "short block"
lenModel.encode(length);
b = block.subarray(0, length);
}
pidx = BWT.bwtransform(b, U, A, length, 256);
lenModel.encode(pidx); // starting index
// encode the alphabet subset used
var useTree = Util.makeU16Buffer(512);
for (i=0; i<length; i++) {
c = U[i];
useTree[256+c] = 1;
}
for (i=255; i>0; i--) { // sum all the way up the tree
useTree[i] = useTree[2*i] + useTree[2*i + 1];
}
useTree[0] = 1; // sentinel
for (i=1; i<512; i++) {
var parent = i>>>1;
var full = 1 << (9-Util.fls(i));
if (useTree[parent] === 0 || useTree[parent] === (full*2)) {
/* already known full/empty */
} else if (i >= 256) {
encoder.encodeBit(useTree[i]); // leaf node
} else {
var v = useTree[i];
v = (v===0) ? 0 : (v===full) ? 2 : 1;
encoder.encodeFreq(1, v, 3);
}
}
// remap symbols to this subset
var alphabetSize = 0;
for (i=0; i<256; i++) {
if (useTree[256+i]) { // symbol in use
M[alphabetSize++] = i;
}
}
useTree = null;
// MTF encoding of U
for (i=0; i<length; i++) {
c = U[i];
for (j=0; j<alphabetSize; j++) {
if (M[j] === c) {
break;
}
}
console.assert(j<alphabetSize);
U[i] = j;
// move to front
for (; j>0; j--) {
M[j] = M[j-1];
}
M[0] = c;
}
// RLE/range encoding
var model = new FenwickModel(encoder, alphabetSize+1,
F_PROB_MAX, F_PROB_INCR);
if (fast) { model = new DefSumModel(encoder, alphabetSize+1); }
var runLength = 0;
var emitLastRun = function() {
// binary encode runs of zeros
while (runLength !== 0) {
if (runLength&1) {
model.encode(0); // RUNA
runLength-=1;
} else {
model.encode(1); // RUNB
runLength-=2;
}
runLength >>>= 1;
}
};
for (i=0; i<length; i++) {
c = U[i];
if (c === 0) {
runLength++;
} else {
emitLastRun();
model.encode(c+1);
// reset for next
runLength = 0;
}
}
emitLastRun();
// done with this block!
} while (length === block.length);
encoder.encodeFreq(1, 2, 3); // "no more blocks"
encoder.encodeFinish();
}, true);
BWTC.decompressFile = Util.decompressFileHelper(BWTC.MAGIC, function(input, output, size) {
var decoder = new RangeCoder(input);
decoder.decodeStart(true/* already read the extra byte */);
var blockSize = decoder.decodeByte();
console.assert(blockSize >= 1 && blockSize <= 9);
var fast = (blockSize <= 5);
blockSize *= 100000;
var block = Util.makeU8Buffer(blockSize);
var U = Util.makeU8Buffer(blockSize);
var A = Util.makeS32Buffer(blockSize);
var M = Util.makeU8Buffer(256); // move to front array
var bitModelFactory = NoModel.factory(decoder);
var lenModel = new LogDistanceModel(blockSize, 0,
bitModelFactory,
bitModelFactory);
var b, length, i, j, c;
while (true) {
var blockIndicator = decoder.decodeCulFreq(3);
decoder.decodeUpdate(1, blockIndicator, 3);
if (blockIndicator === 0) { // full-length block
length = blockSize;
b = block;
} else if (blockIndicator === 1) { // short block
length = lenModel.decode();
b = block.subarray(0, length);
} else if (blockIndicator === 2) { // all done, no more blocks
break;
}
// read starting index for unBWT
var pidx = lenModel.decode();
// decode the alphabet subset used
var useTree = Util.makeU16Buffer(512);
useTree[0] = 1; // sentinel
for (i=1; i<512; i++) {
var parent = i>>>1;
var full = 1 << (9-Util.fls(i));
if (useTree[parent] === 0 || useTree[parent] === (full*2)) {
/* already known full/empty */
useTree[i] = useTree[parent] >>> 1;
} else if (i >= 256) {
useTree[i] = decoder.decodeBit(); // leaf node
} else {
var v = decoder.decodeCulFreq(3);
decoder.decodeUpdate(1, v, 3);
useTree[i] = (v===2) ? full : v;
}
}
// remap symbols to this subset
var alphabetSize = 0;
for (i=0; i<256; i++) {
if (useTree[256+i]) { // symbol in use
M[alphabetSize++] = i;
}
}
useTree = null;
// RLE/range decoding
var model = new FenwickModel(decoder, alphabetSize+1,
F_PROB_MAX, F_PROB_INCR);
if (fast) { model = new DefSumModel(decoder, alphabetSize+1, true);}
var val = 1; // repeat count
for (i=0; i<length; ) {
c = model.decode();
if (c===0) {
for (j=0; j<val; j++) { b[i++] = 0; }
val *= 2;
} else if (c===1) {
for (j=0; j<val; j++) { b[i++] = 0; b[i++] = 0; }
val *= 2;
} else {
val = 1;
b[i++] = c-1;
}
}
// MTF decode
for (i=0; i<length; i++) {
j = b[i];
b[i] = c = M[j];
// move to front
for (; j>0; j--) {
M[j] = M[j-1];
}
M[0] = c;
}
// unBWT
BWT.unbwtransform(block, U, A, length, pidx);
// emit!
output.write(U, 0, length);
}
decoder.decodeFinish();
});
return BWTC;
};
module.exports = body_fn.apply(null, libs);
},{"./BWT":121,"./DefSumModel":127,"./FenwickModel":131,"./LogDistanceModel":134,"./NoModel":139,"./RangeCoder":141,"./Stream":143,"./Util":144,"./freeze":145}],123:[function(require,module,exports){
/** Big-Endian Bit Stream, implemented on top of a (normal byte) stream. */
var libs = [
require('./Stream')
];
var body_fn = function (Stream) {
var BitStream = function(stream) {
(function() {
var bufferByte = 0x100; // private var for readers
this.readBit = function() {
if ((bufferByte & 0xFF) === 0) {
var ch = stream.readByte();
if (ch === Stream.EOF) {
this._eof = true;
return ch; /* !!! */
}
bufferByte = (ch << 1) | 1;
}
var bit = (bufferByte & 0x100) ? 1 : 0;
bufferByte <<= 1;
return bit;
};
// seekable iff the provided stream is
this.seekBit = function(pos) {
var n_byte = pos >>> 3;
var n_bit = pos - (n_byte*8);
this.seek(n_byte);
this._eof = false;
this.readBits(n_bit);
};
this.tellBit = function() {
var pos = stream.tell() * 8;
var b = bufferByte;
while ((b & 0xFF) !== 0) {
pos--;
b <<= 1;
}
return pos;
};
// implement byte stream interface as well.
this.readByte = function() {
if ((bufferByte & 0xFF) === 0) {
return stream.readByte();
}
return this.readBits(8);
};
this.seek = function(pos) {
stream.seek(pos);
bufferByte = 0x100;
};
}).call(this);
(function() {
var bufferByte = 1; // private var for writers
this.writeBit = function(b) {
bufferByte <<= 1;
if (b) { bufferByte |= 1; }
if (bufferByte & 0x100) {
stream.writeByte(bufferByte & 0xFF);
bufferByte = 1;
}
};
// implement byte stream interface as well
this.writeByte = function(_byte) {
if (bufferByte===1) {
stream.writeByte(_byte);
} else {
stream.writeBits(8, _byte);
}
};
this.flush = function() {
while (bufferByte !== 1) {
this.writeBit(0);
}
if (stream.flush) { stream.flush(); }
};
}).call(this);
};
// inherit read/write methods from Stream.
BitStream.EOF = Stream.EOF;
BitStream.prototype = Object.create(Stream.prototype);
// bit chunk read/write
BitStream.prototype.readBits = function(n) {
var i, r = 0, b;
if (n > 31) {
r = this.readBits(n-16)*0x10000; // fp multiply, not shift
return r + this.readBits(16);
}
for (i = 0; i < n; i++) {
r <<= 1; // this could make a negative value if n>31
// bits read past EOF are all zeros!
if (this.readBit() > 0) { r++; }
}
return r;
};
BitStream.prototype.writeBits = function(n, value) {
if (n > 32) {
var low = (value & 0xFFFF);
var high = (value - low) / (0x10000); // fp division, not shift
this.writeBits(n-16, high);
this.writeBits(16, low);
return;
}
var i;
for (i = n-1; i >= 0; i--) {
this.writeBit( (value >>> i) & 1 );
}
};
return BitStream;
};
module.exports = body_fn.apply(null, libs);
},{"./Stream":143}],124:[function(require,module,exports){
/*
An implementation of Bzip2 de/compression, including the ability to
seek within bzip2 data.
Copyright (C) 2013 C. Scott Ananian
Copyright (C) 2012 Eli Skeggs
Copyright (C) 2011 Kevin Kwok
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, see
http://www.gnu.org/licenses/lgpl-2.1.html
Adapted from node-bzip, copyright 2012 Eli Skeggs.
Adapted from bzip2.js, copyright 2011 Kevin Kwok (antimatter15@gmail.com).
Based on micro-bunzip by Rob Landley (rob@landley.net).
Based on bzip2 decompression code by Julian R Seward (jseward@acm.org),
which also acknowledges contributions by Mike Burrows, David Wheeler,
Peter Fenwick, Alistair Moffat, Radford Neal, Ian H. Witten,
Robert Sedgewick, and Jon L. Bentley.
BWT implementation based on work by Yuta Mori; see BWT.js for details.
bzip2 compression code inspired by https://code.google.com/p/jbzip2
*/
var libs = [
require('./freeze'),
require('./BitStream'),
require('./BWT'),
require('./CRC32'),
require('./HuffmanAllocator'),
require('./Stream'),
require('./Util')
];
var body_fn = function (freeze, BitStream, BWT, CRC32, HuffmanAllocator, Stream, Util) {
var MAX_HUFCODE_BITS = 20;
var MAX_SYMBOLS = 258;
var SYMBOL_RUNA = 0;
var SYMBOL_RUNB = 1;
var MIN_GROUPS = 2;
var MAX_GROUPS = 6;
var GROUP_SIZE = 50;
var WHOLEPI = 0x314159265359; // 48-bit integer
var SQRTPI = 0x177245385090; // 48-bit integer
var EOF = Stream.EOF;
var mtf = function(array, index) {
var src = array[index], i;
for (i = index; i > 0; i--) {
array[i] = array[i-1];
}
array[0] = src;
return src;
};
var Err = {
OK: 0,
LAST_BLOCK: -1,
NOT_BZIP_DATA: -2,
UNEXPECTED_INPUT_EOF: -3,
UNEXPECTED_OUTPUT_EOF: -4,
DATA_ERROR: -5,
OUT_OF_MEMORY: -6,
OBSOLETE_INPUT: -7,
END_OF_BLOCK: -8
};
var ErrorMessages = {};
ErrorMessages[Err.LAST_BLOCK] = "Bad file checksum";
ErrorMessages[Err.NOT_BZIP_DATA] = "Not bzip data";
ErrorMessages[Err.UNEXPECTED_INPUT_EOF] = "Unexpected input EOF";
ErrorMessages[Err.UNEXPECTED_OUTPUT_EOF] = "Unexpected output EOF";
ErrorMessages[Err.DATA_ERROR] = "Data error";
ErrorMessages[Err.OUT_OF_MEMORY] = "Out of memory";
ErrorMessages[Err.OBSOLETE_INPUT] = "Obsolete (pre 0.9.5) bzip format not supported.";
var _throw = function(status, optDetail) {
var msg = ErrorMessages[status] || 'unknown error';
if (optDetail) { msg += ': '+optDetail; }
var e = new TypeError(msg);
e.errorCode = status;
throw e;
};
var Bunzip = function(inputStream, outputStream) {
this.writePos = this.writeCurrent = this.writeCount = 0;
this._start_bunzip(inputStream, outputStream);
};
Bunzip.prototype._init_block = function() {
var moreBlocks = this._get_next_block();
if ( !moreBlocks ) {
this.writeCount = -1;
return false; /* no more blocks */
}
this.blockCRC = new CRC32();
return true;
};
/* XXX micro-bunzip uses (inputStream, inputBuffer, len) as arguments */
Bunzip.prototype._start_bunzip = function(inputStream, outputStream) {
/* Ensure that file starts with "BZh['1'-'9']." */
var buf = Util.makeU8Buffer(4);
if (inputStream.read(buf, 0, 4) !== 4 ||
String.fromCharCode(buf[0], buf[1], buf[2]) !== 'BZh')
_throw(Err.NOT_BZIP_DATA, 'bad magic');
var level = buf[3] - 0x30;
if (level < 1 || level > 9)
_throw(Err.NOT_BZIP_DATA, 'level out of range');
this.reader = new BitStream(inputStream);
/* Fourth byte (ascii '1'-'9'), indicates block size in units of 100k of
uncompressed data. Allocate intermediate buffer for block. */
this.dbufSize = 100000 * level;
this.nextoutput = 0;
this.outputStream = outputStream;
this.streamCRC = 0;
};
Bunzip.prototype._get_next_block = function() {
var i, j, k;
var reader = this.reader;
// this is get_next_block() function from micro-bunzip:
/* Read in header signature and CRC, then validate signature.
(last block signature means CRC is for whole file, return now) */
var h = reader.readBits(48);
if (h === SQRTPI) { // last block
return false; /* no more blocks */
}
if (h !== WHOLEPI)
_throw(Err.NOT_BZIP_DATA);
this.targetBlockCRC = reader.readBits(32);
this.streamCRC = (this.targetBlockCRC ^
((this.streamCRC << 1) | (this.streamCRC>>>31))) >>> 0;
/* We can add support for blockRandomised if anybody complains. There was
some code for this in busybox 1.0.0-pre3, but nobody ever noticed that
it didn't actually work. */
if (reader.readBits(1))
_throw(Err.OBSOLETE_INPUT);
var origPointer = reader.readBits(24);
if (origPointer > this.dbufSize)
_throw(Err.DATA_ERROR, 'initial position out of bounds');
/* mapping table: if some byte values are never used (encoding things
like ASCII text), the compression code removes the gaps to have fewer
symbols to deal with, and writes a sparse bitfield indicating which
values were present. We make a translation table to convert the symbols
back to the corresponding bytes. */
var t = reader.readBits(16);
var symToByte = Util.makeU8Buffer(256), symTotal = 0;
for (i = 0; i < 16; i++) {
if (t & (1 << (0xF - i))) {
var o = i * 16;
k = reader.readBits(16);
for (j = 0; j < 16; j++)
if (k & (1 << (0xF - j)))
symToByte[symTotal++] = o + j;
}
}
/* How many different Huffman coding groups does this block use? */
var groupCount = reader.readBits(3);
if (groupCount < MIN_GROUPS || groupCount > MAX_GROUPS)
_throw(Err.DATA_ERROR);
/* nSelectors: Every GROUP_SIZE many symbols we select a new Huffman coding
group. Read in the group selector list, which is stored as MTF encoded
bit runs. (MTF=Move To Front, as each value is used it's moved to the
start of the list.) */
var nSelectors = reader.readBits(15);
if (nSelectors === 0)
_throw(Err.DATA_ERROR);
var mtfSymbol = Util.makeU8Buffer(256);
for (i = 0; i < groupCount; i++)
mtfSymbol[i] = i;
var selectors = Util.makeU8Buffer(nSelectors); // was 32768...
for (i = 0; i < nSelectors; i++) {
/* Get next value */
for (j = 0; reader.readBits(1); j++)
if (j >= groupCount) _throw(Err.DATA_ERROR);
/* Decode MTF to get the next selector */
selectors[i] = mtf(mtfSymbol, j);
}
/* Read the Huffman coding tables for each group, which code for symTotal
literal symbols, plus two run symbols (RUNA, RUNB) */
var symCount = symTotal + 2;
var groups = [], hufGroup;
for (j = 0; j < groupCount; j++) {
var length = Util.makeU8Buffer(symCount), temp = Util.makeU8Buffer(MAX_HUFCODE_BITS + 1);
/* Read Huffman code lengths for each symbol. They're stored in
a way similar to MTF; record a starting value for the first symbol,
and an offset from the previous value for every symbol after that. */
t = reader.readBits(5); // lengths
for (i = 0; i < symCount; i++) {
for (;;) {
if (t < 1 || t > MAX_HUFCODE_BITS) _throw(Err.DATA_ERROR);
/* If first bit is 0, stop. Else second bit indicates whether
to increment or decrement the value. */
if(!reader.readBits(1))
break;
if(!reader.readBits(1))
t++;
else
t--;
}
length[i] = t;
}
/* Find largest and smallest lengths in this group */
var minLen, maxLen;
minLen = maxLen = length[0];
for (i = 1; i < symCount; i++) {
if (length[i] > maxLen)
maxLen = length[i];
else if (length[i] < minLen)
minLen = length[i];
}
/* Calculate permute[], base[], and limit[] tables from length[].
*
* permute[] is the lookup table for converting Huffman coded symbols
* into decoded symbols. base[] is the amount to subtract from the
* value of a Huffman symbol of a given length when using permute[].
*
* limit[] indicates the largest numerical value a symbol with a given
* number of bits can have. This is how the Huffman codes can vary in
* length: each code with a value>limit[length] needs another bit.
*/
hufGroup = {};
groups.push(hufGroup);
hufGroup.permute = Util.makeU16Buffer(MAX_SYMBOLS);
hufGroup.limit = Util.makeU32Buffer(MAX_HUFCODE_BITS + 2);
hufGroup.base = Util.makeU32Buffer(MAX_HUFCODE_BITS + 1);
hufGroup.minLen = minLen;
hufGroup.maxLen = maxLen;
/* Calculate permute[]. Concurrently, initialize temp[] and limit[]. */
var pp = 0;
for (i = minLen; i <= maxLen; i++) {
temp[i] = hufGroup.limit[i] = 0;
for (t = 0; t < symCount; t++)
if (length[t] === i)
hufGroup.permute[pp++] = t;
}
/* Count symbols coded for at each bit length */
for (i = 0; i < symCount; i++)
temp[length[i]]++;
/* Calculate limit[] (the largest symbol-coding value at each bit
* length, which is (previous limit<<1)+symbols at this level), and
* base[] (number of symbols to ignore at each bit length, which is
* limit minus the cumulative count of symbols coded for already). */
pp = t = 0;
for (i = minLen; i < maxLen; i++) {
pp += temp[i];
/* We read the largest possible symbol size and then unget bits
after determining how many we need, and those extra bits could
be set to anything. (They're noise from future symbols.) At
each level we're really only interested in the first few bits,
so here we set all the trailing to-be-ignored bits to 1 so they
don't affect the value>limit[length] comparison. */
hufGroup.limit[i] = pp - 1;
pp <<= 1;
t += temp[i];
hufGroup.base[i + 1] = pp - t;
}
hufGroup.limit[maxLen + 1] = Number.MAX_VALUE; /* Sentinel value for reading next sym. */
hufGroup.limit[maxLen] = pp + temp[maxLen] - 1;
hufGroup.base[minLen] = 0;
}
/* We've finished reading and digesting the block header. Now read this
block's Huffman coded symbols from the file and undo the Huffman coding
and run length encoding, saving the result into dbuf[dbufCount++]=uc */
/* Initialize symbol occurrence counters and symbol Move To Front table */
var byteCount = Util.makeU32Buffer(256);
for (i = 0; i < 256; i++)
mtfSymbol[i] = i;
/* Loop through compressed symbols. */
var runPos = 0, dbufCount = 0, selector = 0, uc;
var dbuf = this.dbuf = Util.makeU32Buffer(this.dbufSize);
symCount = 0;
for (;;) {
/* Determine which Huffman coding group to use. */
if (!(symCount--)) {
symCount = GROUP_SIZE - 1;
if (selector >= nSelectors) { _throw(Err.DATA_ERROR); }
hufGroup = groups[selectors[selector++]];
}
/* Read next Huffman-coded symbol. */
i = hufGroup.minLen;
j = reader.readBits(i);
for (;;i++) {
if (i > hufGroup.maxLen) { _throw(Err.DATA_ERROR); }
if (j <= hufGroup.limit[i])
break;
j = (j << 1) | reader.readBits(1);
}
/* Huffman decode value to get nextSym (with bounds checking) */
j -= hufGroup.base[i];
if (j < 0 || j >= MAX_SYMBOLS) { _throw(Err.DATA_ERROR); }
var nextSym = hufGroup.permute[j];
/* We have now decoded the symbol, which indicates either a new literal
byte, or a repeated run of the most recent literal byte. First,
check if nextSym indicates a repeated run, and if so loop collecting
how many times to repeat the last literal. */
if (nextSym === SYMBOL_RUNA || nextSym === SYMBOL_RUNB) {
/* If this is the start of a new run, zero out counter */
if (!runPos){
runPos = 1;
t = 0;
}
/* Neat trick that saves 1 symbol: instead of or-ing 0 or 1 at
each bit position, add 1 or 2 instead. For example,
1011 is 1<<0 + 1<<1 + 2<<2. 1010 is 2<<0 + 2<<1 + 1<<2.
You can make any bit pattern that way using 1 less symbol than
the basic or 0/1 method (except all bits 0, which would use no
symbols, but a run of length 0 doesn't mean anything in this
context). Thus space is saved. */
if (nextSym === SYMBOL_RUNA)
t += runPos;
else
t += 2 * runPos;
runPos <<= 1;
continue;
}
/* When we hit the first non-run symbol after a run, we now know
how many times to repeat the last literal, so append that many
copies to our buffer of decoded symbols (dbuf) now. (The last
literal used is the one at the head of the mtfSymbol array.) */
if (runPos){
runPos = 0;
if (dbufCount + t >= this.dbufSize) { _throw(Err.DATA_ERROR); }
uc = symToByte[mtfSymbol[0]];
byteCount[uc] += t;
while (t--)
dbuf[dbufCount++] = uc;
}
/* Is this the terminating symbol? */
if (nextSym > symTotal)
break;
/* At this point, nextSym indicates a new literal character. Subtract
one to get the position in the MTF array at which this literal is
currently to be found. (Note that the result can't be -1 or 0,
because 0 and 1 are RUNA and RUNB. But another instance of the
first symbol in the MTF array, position 0, would have been handled
as part of a run above. Therefore 1 unused MTF position minus
2 non-literal nextSym values equals -1.) */
if (dbufCount >= this.dbufSize) { _throw(Err.DATA_ERROR); }
i = nextSym - 1;
uc = mtf(mtfSymbol, i);
uc = symToByte[uc];
/* We have our literal byte. Save it into dbuf. */
byteCount[uc]++;
dbuf[dbufCount++] = uc;
}
/* At this point, we've read all the Huffman-coded symbols (and repeated
runs) for this block from the input stream, and decoded them into the
intermediate buffer. There are dbufCount many decoded bytes in dbuf[].
Now undo the Burrows-Wheeler transform on dbuf.
See http://dogma.net/markn/articles/bwt/bwt.htm
*/
if (origPointer < 0 || origPointer >= dbufCount) { _throw(Err.DATA_ERROR); }
/* Turn byteCount into cumulative occurrence counts of 0 to n-1. */
j = 0;
for (i = 0; i < 256; i++) {
k = j + byteCount[i];
byteCount[i] = j;
j = k;
}
/* Figure out what order dbuf would be in if we sorted it. */
for (i = 0; i < dbufCount; i++) {
uc = dbuf[i] & 0xff;
dbuf[byteCount[uc]] |= (i << 8);
byteCount[uc]++;
}
/* Decode first byte by hand to initialize "previous" byte. Note that it
doesn't get output, and if the first three characters are identical
it doesn't qualify as a run (hence writeRunCountdown=5). */
var pos = 0, current = 0, run = 0;
if (dbufCount) {
pos = dbuf[origPointer];
current = (pos & 0xff);
pos >>= 8;
run = -1;
}
this.writePos = pos;
this.writeCurrent = current;
this.writeCount = dbufCount;
this.writeRun = run;
return true; /* more blocks to come */
};
/* Undo burrows-wheeler transform on intermediate buffer to produce output.
If start_bunzip was initialized with out_fd=-1, then up to len bytes of
data are written to outbuf. Return value is number of bytes written or
error (all errors are negative numbers). If out_fd!=-1, outbuf and len
are ignored, data is written to out_fd and return is RETVAL_OK or error.
*/
Bunzip.prototype._read_bunzip = function(outputBuffer, len) {
var copies, previous, outbyte;
/* james@jamestaylor.org: writeCount goes to -1 when the buffer is fully
decoded, which results in this returning RETVAL_LAST_BLOCK, also
equal to -1... Confusing, I'm returning 0 here to indicate no
bytes written into the buffer */
if (this.writeCount < 0) { return 0; }
var gotcount = 0;
var dbuf = this.dbuf, pos = this.writePos, current = this.writeCurrent;
var dbufCount = this.writeCount, outputsize = this.outputsize;
var run = this.writeRun;
while (dbufCount) {
dbufCount--;
previous = current;
pos = dbuf[pos];
current = pos & 0xff;
pos >>= 8;
if (run++ === 3){
copies = current;
outbyte = previous;
current = -1;
} else {
copies = 1;
outbyte = current;
}
this.blockCRC.updateCRCRun(outbyte, copies);
while (copies--) {
this.outputStream.writeByte(outbyte);
this.nextoutput++;
}
if (current != previous)
run = 0;
}
this.writeCount = dbufCount;
// check CRC
if (this.blockCRC.getCRC() !== this.targetBlockCRC) {
_throw(Err.DATA_ERROR, "Bad block CRC "+
"(got "+this.blockCRC.getCRC().toString(16)+
" expected "+this.targetBlockCRC.toString(16)+")");
}
return this.nextoutput;
};
/* Static helper functions */
Bunzip.Err = Err;
// 'input' can be a stream or a buffer
// 'output' can be a stream or a buffer or a number (buffer size)
Bunzip.decode = function(input, output, multistream) {
// make a stream from a buffer, if necessary
var inputStream = Util.coerceInputStream(input);
var o = Util.coerceOutputStream(output, output);
var outputStream = o.stream;
var bz = new Bunzip(inputStream, outputStream);
while (true) {
if ('eof' in inputStream && inputStream.eof()) break;
if (bz._init_block()) {
bz._read_bunzip();
} else {
var targetStreamCRC = bz.reader.readBits(32);
if (targetStreamCRC !== bz.streamCRC) {
_throw(Err.DATA_ERROR, "Bad stream CRC "+
"(got "+bz.streamCRC.toString(16)+
" expected "+targetStreamCRC.toString(16)+")");
}
if (multistream &&
'eof' in inputStream &&
!inputStream.eof()) {
// note that start_bunzip will also resync the bit reader to next byte
bz._start_bunzip(inputStream, outputStream);
} else break;
}
}
return o.retval;
};
Bunzip.decodeBlock = function(input, pos, output) {
// make a stream from a buffer, if necessary
var inputStream = Util.coerceInputStream(input);
var o = Util.coerceOutputStream(output, output);
var outputStream = o.stream;
var bz = new Bunzip(inputStream, outputStream);
bz.reader.seekBit(pos);
/* Fill the decode buffer for the block */
var moreBlocks = bz._get_next_block();
if (moreBlocks) {
/* Init the CRC for writing */
bz.blockCRC = new CRC32();
/* Zero this so the current byte from before the seek is not written */
bz.writeCopies = 0;
/* Decompress the block and write to stdout */
bz._read_bunzip();
// XXX keep writing?
}
return o.retval;
};
/* Reads bzip2 file from stream or buffer `input`, and invoke
* `callback(position, size)` once for each bzip2 block,
* where position gives the starting position (in *bits*)
* and size gives uncompressed size of the block (in *bytes*). */
Bunzip.table = function(input, callback, multistream) {
// make a stream from a buffer, if necessary
var inputStream = new Stream();
inputStream.delegate = Util.coerceInputStream(input);
inputStream.pos = 0;
inputStream.readByte = function() {
this.pos++;
return this.delegate.readByte();
};
inputStream.tell = function() { return this.pos; };
if (inputStream.delegate.eof) {
inputStream.eof = inputStream.delegate.eof.bind(inputStream.delegate);
}
var outputStream = new Stream();
outputStream.pos = 0;
outputStream.writeByte = function() { this.pos++; };
var bz = new Bunzip(inputStream, outputStream);
var blockSize = bz.dbufSize;
while (true) {
if ('eof' in inputStream && inputStream.eof()) break;
var position = bz.reader.tellBit();
if (bz._init_block()) {
var start = outputStream.pos;
bz._read_bunzip();
callback(position, outputStream.pos - start);
} else {
var crc = bz.reader.readBits(32); // (but we ignore the crc)
if (multistream &&
'eof' in inputStream &&
!inputStream.eof()) {
// note that start_bunzip will also resync the bit reader to next byte
bz._start_bunzip(inputStream, outputStream);
console.assert(bz.dbufSize === blockSize,
"shouldn't change block size within multistream file");
} else break;
}
}
};
// create a Huffman tree from the table of frequencies
var StaticHuffman = function(freq, alphabetSize) {
// As in BZip2HuffmanStageEncoder.java (from jbzip2):
// The Huffman allocator needs its input symbol frequencies to be
// sorted, but we need to return code lengths in the same order as
// the corresponding frequencies are passed in.
// The symbol frequency and index are merged into a single array of
// integers - frequency in the high 23 bits, index in the low 9
// bits.
// 2^23 = 8,388,608 which is higher than the maximum possible
// frequency for one symbol in a block
// 2^9 = 512 which is higher than the maximum possible
// alphabet size (== 258)
// Sorting this array simultaneously sorts the frequencies and
// leaves a lookup that can be used to cheaply invert the sort
var i, mergedFreq = [];
for (i=0; i<alphabetSize; i++) {
mergedFreq[i] = (freq[i] << 9) | i;
}
mergedFreq.sort(function(a,b) { return a-b; });
var sortedFreq = mergedFreq.map(function(v) { return v>>>9; });
// allocate code lengths in place. (result in sortedFreq array)
HuffmanAllocator.allocateHuffmanCodeLengths(sortedFreq, MAX_HUFCODE_BITS);
// reverse the sort to put codes & code lengths in order of input symbols
this.codeLengths = Util.makeU8Buffer(alphabetSize);
for (i=0; i<alphabetSize; i++) {
var sym = mergedFreq[i] & 0x1FF;
this.codeLengths[sym] = sortedFreq[i];
}
};
// compute canonical Huffman codes, given code lengths
StaticHuffman.prototype.computeCanonical = function() {
var alphabetSize = this.codeLengths.length;
// merge arrays; sort first by length then by symbol.
var i, merged = [];
for (i=0; i<alphabetSize; i++) {
merged[i] = (this.codeLengths[i] << 9) | i;
}
merged.sort(function(a,b) { return a-b; });
// use sorted lengths to assign codes
this.code = Util.makeU32Buffer(alphabetSize);
var code = 0, prevLen = 0;
for (i=0; i<alphabetSize; i++) {
var curLen = merged[i] >>> 9;
var sym = merged[i] & 0x1FF;
console.assert(prevLen <= curLen);
code <<= (curLen - prevLen);
this.code[sym] = code++;
prevLen = curLen;
}
};
// compute the cost of encoding the given range of symbols w/ this Huffman code
StaticHuffman.prototype.cost = function(array, offset, length) {
var i, cost = 0;
for (i=0; i<length; i++) {
cost += this.codeLengths[array[offset+i]];
}
return cost;
};
// emit the bit lengths used by this Huffman code
StaticHuffman.prototype.emit = function(outStream) {
// write the starting length
var i, currentLength = this.codeLengths[0];
outStream.writeBits(5, currentLength);
for (i=0; i<this.codeLengths.length; i++) {
var codeLength = this.codeLengths[i];
var value, delta;
console.assert(codeLength > 0 && codeLength <= MAX_HUFCODE_BITS);
if (currentLength < codeLength) {
value = 2; delta = codeLength - currentLength;
} else {
value = 3; delta = currentLength - codeLength;
}
while (delta-- > 0) {
outStream.writeBits(2, value);
}
outStream.writeBit(0);
currentLength = codeLength;
}
};
// encode the given symbol with this Huffman code
StaticHuffman.prototype.encode = function(outStream, symbol) {
outStream.writeBits(this.codeLengths[symbol], this.code[symbol]);
};
// read a block for bzip2 compression.
var readBlock = function(inStream, block, length, crc) {
var pos = 0;
var lastChar = -1;
var runLength = 0;
while (pos < length) {
if (runLength===4) {
block[pos++] = 0;
if (pos >= length) { break; }
}
var ch = inStream.readByte();
if (ch === EOF) {
break;
}
crc.updateCRC(ch);
if (ch !== lastChar) {
lastChar = ch;
runLength = 1;
} else {
runLength++;
if (runLength > 4) {
if (runLength < 256) {
block[pos-1]++;
continue;
} else {
runLength = 1;
}
}
}
block[pos++] = ch;
}
return pos;
};
// divide the input into groups at most GROUP_SIZE symbols long.
// assign each group to the Huffman table which compresses it best.
var assignSelectors = function(selectors, groups, input) {
var i, j, k;
for (i=0, k=0; i<input.length; i+=GROUP_SIZE) {
var groupSize = Math.min(GROUP_SIZE, input.length - i);
var best = 0, bestCost = groups[0].cost(input, i, groupSize);
for (j=1; j<groups.length; j++) {
var groupCost = groups[j].cost(input, i, groupSize);
if (groupCost < bestCost) {
best = j; bestCost = groupCost;
}
}
selectors[k++] = best;
}
};
var optimizeHuffmanGroups = function(groups, targetGroups, input,
selectors, alphabetSize) {
// until we've got "targetGroups" Huffman codes, pick the Huffman code which
// matches the largest # of groups and split it by picking the groups
// which require more than the median number of bits to encode.
// then recompute frequencies and reassign Huffman codes.
var i, j, k, groupCounts = [];
while (groups.length < targetGroups) {
assignSelectors(selectors, groups, input);
// which code gets used the most?
for (i=0; i<groups.length; i++) { groupCounts[i] = 0; }
for (i=0; i<selectors.length; i++) {
groupCounts[selectors[i]]++;
}
var which = groupCounts.indexOf(Math.max.apply(Math, groupCounts));
// ok, let's look at the size of those blocks
var splits = [];
for (i=0, j=0; i<selectors.length; i++) {
if (selectors[i] !== which) { continue; }
var start = i*GROUP_SIZE;
var end = Math.min(start + GROUP_SIZE, input.length);
splits.push({index: i, cost:groups[which].cost(input, start, end-start)});
}
// find the median. there are O(n) algorithms to do this, but we'll
// be lazy and use a full O(n ln n) sort.
splits.sort(function(s1, s2) { return s1.cost - s2.cost; });
// assign the groups in the top half to the "new" selector
for (i=(splits.length>>>1); i<splits.length; i++) {
selectors[splits[i].index] = groups.length;
}
groups.push(null);
// recompute frequencies
var freq = [], f;
for (i=0; i<groups.length; i++) {
f = freq[i] = [];
for (j=0; j<alphabetSize; j++) { f[j] = 0; }
}
for (i=0, j=0; i<input.length; ) {
f = freq[selectors[j++]];
for (k=0; k<GROUP_SIZE && i<input.length; k++) {
f[input[i++]]++;
}
}
// reconstruct Huffman codes
for (i=0; i<groups.length; i++) {
groups[i] = new StaticHuffman(freq[i], alphabetSize);
}
}
};
var compressBlock = function(block, length, outStream) {
var c, i, j, k;
// do BWT transform
var U = Util.makeU8Buffer(length);
var pidx = BWT.bwtransform2(block, U, length, 256);
outStream.writeBit(0); // not randomized
outStream.writeBits(24, pidx);
// track values used; write bitmap
var used = [], compact = [];
for (i=0; i<length; i++) {
c = block[i];
used[c] = true;
compact[c>>>4] = true;
}
for (i=0; i<16; i++) {
outStream.writeBit(!!compact[i]);
}
for (i=0; i<16; i++) {
if (compact[i]) {
for (j=0; j<16; j++) {
outStream.writeBit(!!used[(i<<4)|j]);
}
}
}
var alphabetSize = 0;
for (i=0; i<256; i++) {
if (used[i]) {
alphabetSize++;
}
}
// now MTF and RLE/2 encoding, while tracking symbol statistics.
// output can be one longer than length, because we include the
// end-of-block character at the end. Similarly, we need a U16
// array because the end-of-block character can be 256.
var A = Util.makeU16Buffer(length+1);
var endOfBlock = alphabetSize + 1;
var freq = [];
for (i=0; i<=endOfBlock; i++) { freq[i] = 0; }
var M = Util.makeU8Buffer(alphabetSize);
for (i=0, j=0; i<256; i++) {
if (used[i]) { M[j++] = i; }
}
used = null; compact = null;
var pos = 0, runLength = 0;
var emit = function(c) {
A[pos++] = c;
freq[c]++;
};
var emitLastRun = function() {
while (runLength !== 0) {
if (runLength & 1) {
emit(0); // RUNA
runLength -= 1;
} else {
emit(1); // RUNB
runLength -= 2;
}
runLength >>>= 1;
}
};
for (i=0; i<U.length; i++) {
c = U[i];
// look for C in M
for (j=0; j<alphabetSize; j++) {
if (M[j]===c) { break; }
}
console.assert(j!==alphabetSize);
// shift MTF array
mtf(M, j);
// emit j
if (j===0) {
runLength++;
} else {
emitLastRun();
emit(j+1);
runLength = 0;
}
}
emitLastRun();
emit(endOfBlock); // end of block symbol
A = A.subarray(0, pos);
// now A[0...pos) has the encoded output, and freq[0-alphabetSize] has the
// frequencies. Use these to construct Huffman tables.
// the canonical bzip2 encoder does some complicated optimization
// to attempt to select the best tables. We're going to simplify things:
// (unless the block is very short) we're always going to create MAX_GROUPS
// tables; 1 based on global frequencies, and the rest based on dividing the
// block into MAX_GROUPS-1 pieces.
var groups = [];
var targetGroups; // how many Huffman groups should we create?
// look at length of MTF-encoded block to pick a good number of groups
if (pos >= 2400) { targetGroups = 6; }
else if (pos >= 1200) { targetGroups = 5; }
else if (pos >= 600) { targetGroups = 4; }
else if (pos >= 200) { targetGroups = 3; }
else { targetGroups = 2; }
// start with two Huffman groups: one with the global frequencies, and
// a second with a flat frequency distribution (which is also the smallest
// possible Huffman table to encode, which is handy to prevent excessive
// bloat if the input file size is very small)
groups.push(new StaticHuffman(freq, endOfBlock+1));
for (i=0; i<=endOfBlock; i++) { freq[i] = 1; }
groups.push(new StaticHuffman(freq, endOfBlock+1));
freq = null;
// Now optimize the Huffman groups! this is a black art.
// we probably don't want to waste too much time on it, though.
var selectors = Util.makeU8Buffer(Math.ceil(pos / GROUP_SIZE));
optimizeHuffmanGroups(groups, targetGroups, A, selectors, endOfBlock+1);
assignSelectors(selectors, groups, A);
// okay, let's start writing out our Huffman tables
console.assert(groups.length >= MIN_GROUPS && groups.length <= MAX_GROUPS);
outStream.writeBits(3, groups.length);
// and write out the best selector for each group
outStream.writeBits(15, selectors.length);
for (i=0; i<groups.length; i++) { M[i] = i; } // initialize MTF table.
for (i=0; i<selectors.length; i++) {
var s = selectors[i];
// find selector in MTF list
for (j=0; j<groups.length; j++) { if (M[j]===s) { break; } }
console.assert(j<groups.length);
mtf(M, j);
// emit 'j' as a unary number
for (;j>0; j--) {
outStream.writeBit(1);
}
outStream.writeBit(0);
}
// okay, now emit the Huffman tables in order.
for (i=0; i<groups.length; i++) {
groups[i].emit(outStream);
groups[i].computeCanonical(); // get ready for next step while we're at it
}
// okay, now (finally!) emit the actual data!
for (i=0, k=0; i<pos; ) {
var huff = groups[selectors[k++]];
for (j=0; j<GROUP_SIZE && i<pos; j++) {
huff.encode(outStream, A[i++]);
}
}
// done.
};
var Bzip2 = Object.create(null);
Bzip2.compressFile = function(inStream, outStream, props) {
inStream = Util.coerceInputStream(inStream);
var o = Util.coerceOutputStream(outStream, outStream);
outStream = new BitStream(o.stream);
var blockSizeMultiplier = 9;
if (typeof(props)==='number') {
blockSizeMultiplier = props;
}
if (blockSizeMultiplier < 1 || blockSizeMultiplier > 9) {
throw new Error('Invalid block size multiplier');
}
var blockSize = blockSizeMultiplier * 100000;
// the C implementation always writes at least length-19 characters,
// but it reads ahead enough that if the last character written was part
// of a run, it writes out the full run.
// That's really annoying to implement.
// So instead just subtract 19 from the blockSize; in most cases (unless
// there's a run at the end of the block) this will yield block divisions
// matching the C implementation.
blockSize -= 19;
// write file magic
outStream.writeByte('B'.charCodeAt(0));
outStream.writeByte('Z'.charCodeAt(0));
outStream.writeByte('h'.charCodeAt(0)); // Huffman-coded bzip
outStream.writeByte('0'.charCodeAt(0) + blockSizeMultiplier);
// allocate a buffer for the block
var block = Util.makeU8Buffer(blockSize);
var streamCRC = 0;
var length;
do {
var crc = new CRC32();
length = readBlock(inStream, block, blockSize, crc);
if (length > 0) {
streamCRC = (((streamCRC << 1) | (streamCRC>>>31)) ^ crc.getCRC()) >>> 0;
outStream.writeBits(48, WHOLEPI);
outStream.writeBits(32, crc.getCRC());
compressBlock(block, length, outStream);
}
} while (length === blockSize);
// finish up
outStream.writeBits(48, SQRTPI);
outStream.writeBits(32, streamCRC);
outStream.flush(); // get the last bits flushed out
return o.retval;
};
Bzip2.decompressFile = Bunzip.decode;
Bzip2.decompressBlock = Bunzip.decodeBlock;
Bzip2.table = Bunzip.table;
return Bzip2;
};
module.exports = body_fn.apply(null, libs);
},{"./BWT":121,"./BitStream":123,"./CRC32":125,"./HuffmanAllocator":133,"./Stream":143,"./Util":144,"./freeze":145}],125:[function(require,module,exports){
/* CRC32, used in Bzip2 implementation.
* This is a port of CRC32.java from the jbzip2 implementation at
* https://code.google.com/p/jbzip2
* which is:
* Copyright (c) 2011 Matthew Francis
*
* 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.
* This JavaScript implementation is:
* Copyright (c) 2013 C. Scott Ananian
* with the same licensing terms as Matthew Francis' original implementation.
*/
var libs = [
require('./Util')
];
var body_fn = function (Util) {
/**
* A static CRC lookup table
*/
var crc32Lookup = Util.arraycopy(Util.makeU32Buffer(256), [
0x00000000, 0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b, 0x1a864db2, 0x1e475005,
0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, 0x2b4bcb61, 0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd,
0x4c11db70, 0x48d0c6c7, 0x4593e01e, 0x4152fda9, 0x5f15adac, 0x5bd4b01b, 0x569796c2, 0x52568b75,
0x6a1936c8, 0x6ed82b7f, 0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3, 0x709f7b7a, 0x745e66cd,
0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039, 0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5,
0xbe2b5b58, 0xbaea46ef, 0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033, 0xa4ad16ea, 0xa06c0b5d,
0xd4326d90, 0xd0f37027, 0xddb056fe, 0xd9714b49, 0xc7361b4c, 0xc3f706fb, 0xceb42022, 0xca753d95,
0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1, 0xe13ef6f4, 0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d,
0x34867077, 0x30476dc0, 0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5, 0x2ac12072,
0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16, 0x018aeb13, 0x054bf6a4, 0x0808d07d, 0x0cc9cdca,
0x7897ab07, 0x7c56b6b0, 0x71159069, 0x75d48dde, 0x6b93dddb, 0x6f52c06c, 0x6211e6b5, 0x66d0fb02,
0x5e9f46bf, 0x5a5e5b08, 0x571d7dd1, 0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b, 0xbb60adfc, 0xb6238b25, 0xb2e29692,
0x8aad2b2f, 0x8e6c3698, 0x832f1041, 0x87ee0df6, 0x99a95df3, 0x9d684044, 0x902b669d, 0x94ea7b2a,
0xe0b41de7, 0xe4750050, 0xe9362689, 0xedf73b3e, 0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2,
0xc6bcf05f, 0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34, 0xdc3abded, 0xd8fba05a,
0x690ce0ee, 0x6dcdfd59, 0x608edb80, 0x644fc637, 0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb,
0x4f040d56, 0x4bc510e1, 0x46863638, 0x42472b8f, 0x5c007b8a, 0x58c1663d, 0x558240e4, 0x51435d53,
0x251d3b9e, 0x21dc2629, 0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5, 0x3f9b762c, 0x3b5a6b9b,
0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff, 0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623,
0xf12f560e, 0xf5ee4bb9, 0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65, 0xeba91bbc, 0xef68060b,
0xd727bbb6, 0xd3e6a601, 0xdea580d8, 0xda649d6f, 0xc423cd6a, 0xc0e2d0dd, 0xcda1f604, 0xc960ebb3,
0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7, 0xae3afba2, 0xaafbe615, 0xa7b8c0cc, 0xa379dd7b,
0x9b3660c6, 0x9ff77d71, 0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74, 0x857130c3,
0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640, 0x4e8ee645, 0x4a4ffbf2, 0x470cdd2b, 0x43cdc09c,
0x7b827d21, 0x7f436096, 0x7200464f, 0x76c15bf8, 0x68860bfd, 0x6c47164a, 0x61043093, 0x65c52d24,
0x119b4be9, 0x155a565e, 0x18197087, 0x1cd86d30, 0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec,
0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d, 0x2056cd3a, 0x2d15ebe3, 0x29d4f654,
0xc5a92679, 0xc1683bce, 0xcc2b1d17, 0xc8ea00a0, 0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb, 0xdbee767c,
0xe3a1cbc1, 0xe760d676, 0xea23f0af, 0xeee2ed18, 0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4,
0x89b8fd09, 0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662, 0x933eb0bb, 0x97ffad0c,
0xafb010b1, 0xab710d06, 0xa6322bdf, 0xa2f33668, 0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4
]);
var CRC32 = function() {
/**
* The current CRC
*/
var crc = 0xffffffff;
/**
* @return The current CRC
*/
this.getCRC = function() {
return (~crc) >>> 0; // return an unsigned value
};
/**
* Update the CRC with a single byte
* @param value The value to update the CRC with
*/
this.updateCRC = function(value) {
crc = (crc << 8) ^ crc32Lookup[((crc >>> 24) ^ value) & 0xff];
};
/**
* Update the CRC with a sequence of identical bytes
* @param value The value to update the CRC with
* @param count The number of bytes
*/
this.updateCRCRun = function(value, count) {
while (count-- > 0) {
crc = (crc << 8) ^ crc32Lookup[((crc >>> 24) ^ value) & 0xff];
}
};
};
return CRC32;
};
module.exports = body_fn.apply(null, libs);
},{"./Util":144}],126:[function(require,module,exports){
/** A simple context-1 model. */
var libs = [
require('./BitStream'),
require('./Huffman'),
require('./Util')
];
var body_fn = function (BitStream,Huffman,Util) {
var Context1Model = function(modelFactory, contextSize, alphabetSize) {
var i;
this.literalModel = [];
// even if there's an EOF symbol, we don't need a context for it!
for (i=0; i<contextSize; i++) {
this.literalModel[i] = modelFactory(alphabetSize);
}
};
Context1Model.prototype.encode = function(ch, context) {
this.literalModel[context].encode(ch);
};
Context1Model.prototype.decode = function(context) {
return this.literalModel[context].decode();
};
/** Simple self-test. */
Context1Model.MAGIC='ctx1';
Context1Model.compressFile = Util.compressFileHelper(Context1Model.MAGIC, function(inStream, outStream, fileSize, props) {
var bitstream = new BitStream(outStream);
var alphabetSize = 256;
if (fileSize < 0) { alphabetSize++; }
var coder = Huffman.factory(bitstream, 8191);
var model = new Context1Model(coder, 256, alphabetSize);
var lastchar = 0x20;
var modelp = {
encode: function(symbol) {
model.encode(symbol, lastchar);
lastchar = symbol;
}
};
Util.compressWithModel(inStream, fileSize, modelp);
bitstream.flush();
});
Context1Model.decompressFile = Util.decompressFileHelper(Context1Model.MAGIC, function(inStream, outStream, fileSize) {
var bitstream = new BitStream(inStream);
var alphabetSize = 256;
if (fileSize < 0) { alphabetSize++; }
var coder = Huffman.factory(bitstream, 8191);
var model = new Context1Model(coder, 256, alphabetSize);
var lastchar = 0x20;
var modelp = {
decode: function() {
var symbol = model.decode(lastchar);
lastchar = symbol;
return symbol;
}
};
Util.decompressWithModel(outStream, fileSize, modelp);
});
return Context1Model;
};
module.exports = body_fn.apply(null, libs);
},{"./BitStream":123,"./Huffman":132,"./Util":144}],127:[function(require,module,exports){
/** Deferred-sum model, suitable for small ( ~ 256 ) ranges. */
var libs = [
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (RangeCoder,Stream,Util){
var LOG_PROB_TOTAL = 8;
var PROB_TOTAL = 1 << LOG_PROB_TOTAL;
var MAX_ESCAPE_COUNT = 40;
var DefSumModel = function(coder, size, isDecoder) {
var i;
console.assert(size < 300); // not meant for sparse
var ESCAPE = this.numSyms = size;
this.coder = coder;
this.prob = Util.makeU16Buffer(size+2); /* size + ESC + 1 */
this.escape = Util.makeU16Buffer(size+1); /* size + 1*/
this.update = Util.makeU16Buffer(size+1); /* size + ESC */
this.prob[ESCAPE+1] = PROB_TOTAL;
for (i=0; i<=this.numSyms; i++) {
this.escape[i] = i;
}
this.updateCount = 0;
this.updateThresh = PROB_TOTAL - Math.floor(PROB_TOTAL / 2);
if (!isDecoder) { return; }
// extra tables for fast decoding
this.probToSym = Util.makeU16Buffer(PROB_TOTAL);
this.escProbToSym = Util.makeU16Buffer(this.numSyms);
for (i=0; i<PROB_TOTAL; i++) {
this.probToSym[i] = ESCAPE;
}
for (i=0; i<this.numSyms; i++) {
this.escProbToSym[i] = i;
}
};
DefSumModel.factory = function(coder, isDecoder) {
return function(size) { return new DefSumModel(coder, size, isDecoder); };
};
DefSumModel.prototype._update = function(symbol, isDecoder) {
if (symbol === this.numSyms) {
// some special cases for the escape character
if (this.update[symbol] >= MAX_ESCAPE_COUNT) { return; } // hard limit
// don't let an escape character trigger an update, because then the
// escaped character might find itself unescaped after the tables have
// been updated!
if (this.updateCount >= (this.updateThresh - 1)) { return; }
}
this.update[symbol]++;
this.updateCount++;
// is it time to transfer the updated probabilities?
if (this.updateCount < this.updateThresh) {
return; //defer update
}
var cumProb, cumEscProb, odd, i, j, k;
this.escape[0] = this.prob[0] = cumProb = cumEscProb = odd = 0;
for (i=0; i < this.numSyms+1; i++) {
var newProb = ((this.prob[i+1]-this.prob[i]) >>> 1) + this.update[i];
if (newProb) {
// live 'un
this.prob[i] = cumProb;
cumProb += newProb;
if (newProb & 1) { odd++; }
this.escape[i] = cumEscProb;
} else {
// this symbol will escape
this.prob[i] = cumProb;
this.escape[i] = cumEscProb;
cumEscProb++;
}
}
this.prob[i] = cumProb;
console.assert(cumProb === PROB_TOTAL);
/* how many updates will be required after current probs are halved? */
this.updateThresh = PROB_TOTAL - Math.floor((cumProb-odd) / 2);
/* reset the update table */
for (i=0; i < (this.numSyms + 1); i++) {
this.update[i] = 0;
}
this.update[this.numSyms] = 1; // ensure that escape never goes away
this.updateCount = 1;
/* compute decode table, if this is a decoder */
if (!isDecoder) { return; }
for (i=0, j=0, k=0; i<(this.numSyms+1); i++) {
var probLimit = this.prob[i+1];
for (; j<probLimit; j++) {
this.probToSym[j] = i;
}
var escProbLimit = this.escape[i+1];
for (; k<escProbLimit; k++) {
this.escProbToSym[k] = i;
}
}
};
DefSumModel.prototype.encode = function(symbol) {
var lt_f = this.prob[symbol];
var sy_f = this.prob[symbol+1] - lt_f;
console.assert(this.prob[this.numSyms+1] === PROB_TOTAL);
if (sy_f) {
this.coder.encodeShift(sy_f, lt_f, LOG_PROB_TOTAL);
return this._update(symbol);
}
// escape!
console.assert(symbol !== this.numSyms); // catch infinite recursion
this.encode(this.numSyms); // guaranteed non-zero probability
// code symbol as literal, taking advantage of reduced escape range.
lt_f = this.escape[symbol];
sy_f = this.escape[symbol+1] - lt_f;
var tot_f = this.escape[this.numSyms];
this.coder.encodeFreq(sy_f, lt_f, tot_f);
return this._update(symbol);
};
DefSumModel.prototype.decode = function() {
var prob = this.coder.decodeCulShift(LOG_PROB_TOTAL);
var symbol = this.probToSym[prob];
var lt_f = this.prob[symbol];
var sy_f = this.prob[symbol+1] - lt_f;
this.coder.decodeUpdate(sy_f, lt_f, PROB_TOTAL);
this._update(symbol, true);
if (symbol !== this.numSyms) {
return symbol;
}
// escape!
var tot_f = this.escape[this.numSyms];
prob = this.coder.decodeCulFreq(tot_f);
symbol = this.escProbToSym[prob];
lt_f = this.escape[symbol];
sy_f = this.escape[symbol+1] - lt_f;
this.coder.decodeUpdate(sy_f, lt_f, tot_f);
this._update(symbol, true);
return symbol;
};
DefSumModel.MAGIC='dfsm';
/** Simple order-0 compressor, as self-test. */
DefSumModel.compressFile = Util.compressFileHelper(DefSumModel.MAGIC, function(inStream, outStream, fileSize, props, finalByte) {
var range = new RangeCoder(outStream);
range.encodeStart(finalByte, 1);
var model = new DefSumModel(range, (fileSize<0) ? 257 : 256);
Util.compressWithModel(inStream, fileSize, model);
range.encodeFinish();
},true);
/** Simple order-0 decompresser, as self-test. */
DefSumModel.decompressFile = Util.decompressFileHelper(DefSumModel.MAGIC, function(inStream, outStream, fileSize) {
var range = new RangeCoder(inStream);
range.decodeStart(true/*already read the final byte*/);
var model = new DefSumModel(range, (fileSize<0) ? 257 : 256, true);
Util.decompressWithModel(outStream, fileSize, model);
range.decodeFinish();
});
return DefSumModel;
};
module.exports = body_fn.apply(null, libs);
},{"./RangeCoder":141,"./Stream":143,"./Util":144}],128:[function(require,module,exports){
/** Distance model used by gzip/deflate.
* Encodes distances starting at 0 (for deflate compatibility, subtract
* one from distance to encode).
* Uses ~32-entry model to predict ln2(distance) (more-or-less) and then
* encodes a few more bits for the actual distance. */
var libs = [
require('./Util')
];
var body_fn = function (Util){
// lengthBitsModelFactory will be called with arguments 2, 4, 8, 16, etc
// and must return an appropriate model or coder.
var DeflateDistanceModel = function(size, extraStates,
lgDistanceModelFactory,
lengthBitsModelFactory) {
var i;
var bits = Util.fls(size-1);
this.extraStates = +extraStates || 0;
this.lgDistanceModel = lgDistanceModelFactory(2*bits + extraStates);
// this.distanceModel[n] used for distances which are n-bits long,
// but only n-2 bits are encoded: the top bit is known to be one,
// and the next bit is encoded by the lgDistanceModel.
this.distanceModel = [];
for (i=3 ; i <= bits; i++) {
var numBits = i - 2;
this.distanceModel[i] = lengthBitsModelFactory(1<<numBits);
}
};
/* you can give this model arguments between 0 and (size-1), or else
a negative argument which is one of the 'extra states'. */
DeflateDistanceModel.prototype.encode = function(distance) {
if (distance < 4) { // small distance or an 'extra state'
this.lgDistanceModel.encode(distance + this.extraStates);
return;
}
var lgDistance = Util.fls(distance);
console.assert(distance & (1<<(lgDistance-1))); // top bit is set
console.assert(lgDistance >= 3);
var nextBit = (distance & (1 << (lgDistance-2))) ? 1 : 0;
var l = 4 + ((lgDistance-3)*2) + nextBit;
this.lgDistanceModel.encode(l + this.extraStates);
// now encode the rest of the bits.
var rest = distance & ((1 << (lgDistance-2)) - 1);
this.distanceModel[lgDistance].encode(rest);
};
DeflateDistanceModel.prototype.decode = function() {
var l = this.lgDistanceModel.decode() - this.extraStates;
if (l < 4) {
return l; // this is a small distance or an 'extra state'
}
var nextBit = (l&1);
var lgDistance = ((l-4) >>> 1) + 3;
var rest = this.distanceModel[lgDistance].decode();
return ((2+nextBit) << (lgDistance-2)) + rest;
};
return DeflateDistanceModel;
};
module.exports = body_fn.apply(null, libs);
},{"./Util":144}],129:[function(require,module,exports){
/**
* Implementation of Dynamic Markov Compression, using byte-oriented
* nodes/transitions.
*
* Currently no model-shrinking is done, so be careful trying to use
* this on large inputs!
*
* Notes for the future / TO DO:
*
* Add node merging to Dmc:
* - once (total states traversed / total node count) exceeds a certain value
* - find the median node w/rt total visits
* - combine all nodes w/ less visits into a single node, with transitions
* to node[0] - node[255] (initial context-1 states)
* - initially transition counts are zero? or summed from components?
* needs to be summed so kirchoff principle holds
* - halve the edge counts of all nodes, to provide for adaptation
* - enforce property that all nodes point "higher" except for
* links to nodes 0-255. So we can resum all nodes in one pass,
* after resetting all node.sum to zero. X YES because we know
* what the total sum must be, so we can arrange to scale to maintain
* proper sum. XXX what about node 0-255? XXX maybe just clear all
* edge counts XXX
*
* Fix buglet: ensure that kirchoff principle *exactly* holds by
* paying attention to rounding when we distribute edge counts. track
* highest edge and give (desiredSum - newSum) extra counts to that
* outgoing edge? add one to each nonzero edge until all gone?
*
* Split 'to' nodes when to.sum grows too high -- only if we're
* highest incoming edge? Fix bug again here with saturating counts;
* we can't ignore counts w/o violating kirchoff principle, so we need
* to clone it. Maybe start trying to clone early (before our counter
* saturates) so we have a better chance of cloning on the high
* incoming edge? XXX we don't track incoming edges. XXX so just
* clone when we visit.
*/
var libs = [
require('./MTFModel'),
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (MTFModel, RangeCoder, Stream, Util){
// nm = no model cloning, MAX_TRANS_CNT=0xFF, MAX_MODEL_PROB=0xFFFF
// nm2 = " 0xFFFF 0xFFFF
// nm3 = " 0xFFF 0x0FFF
// nm4 = " 0xFFFF 0xFF
// cl1 = model cloning, MAX_TRANS_CNT=0xFFFF MAX_MODEL_PROB=0xFF
// cl2 = model cloning, MAX_TRANS_CNT= 0xFF MAX_MODEL_PROB=0xFF
// cl3 = model cloning, MAX_TRANS_CNT=0xFFFF MAX_MODEL_PROB=0xFFFF
var MAX_TRANS_CNT = 0xFFFF;
var DEFAULT_MIN_CNT1 = 8;
var DEFAULT_MIN_CNT2 = 128;
var MODEL_PROB_MAX = 0xFF00;
var MODEL_PROB_INCR= 0x0100;
var CLONE_MODELS=false;
var PRINT_STATS=false; // for quick benchmarking
// XXX need to limit growth of model (throw away and retrain if model
// gets too large)
var Dmc = Object.create(null);
Dmc.MAGIC = 'dmc!';
var MarkovNode = function(coder, size, optModel) {
this.out = [];
this.model = optModel ? optModel.clone() :
new MTFModel(coder, size, MODEL_PROB_MAX, MODEL_PROB_INCR);
this.count = Util.makeU16Buffer(size);
this.sum = 0;
};
MarkovNode.prototype.clone = function(coder, size) {
var i;
var newNode = new MarkovNode(coder, size, CLONE_MODELS ? this.model : null);
for (i=0; i<size; i++) {
newNode.out[i] = this.out[i];
}
return newNode;
};
var MarkovModel = function(coder, size, MIN_CNT1, MIN_CNT2) {
var i, j;
// initial model is 'size' states, completely linked.
this.coder = coder;
this.size = size;
this.MIN_CNT1 = MIN_CNT1 || DEFAULT_MIN_CNT1;
this.MIN_CNT2 = MIN_CNT2 || DEFAULT_MIN_CNT2;
this.nodes = [];
for (i=0; i<size; i++) {
this.nodes[i] = new MarkovNode(coder, size);
}
// now link nodes
for (i=0; i<size; i++) {
for (j=0; j<size; j++) {
this.nodes[i].out[j] = this.nodes[j];
}
}
// select an arbitrary node as the start state.
this.current = this.nodes[0];
};
MarkovModel.prototype.maybeSplit = function(from, symbol, to) {
var trans_cnt = from.count[symbol];
var next_cnt = to.sum;
var i;
if ( (trans_cnt <= this.MIN_CNT1) ||
(next_cnt - trans_cnt <= this.MIN_CNT2) ) {
return to; // no split
}
// split this guy!
var newNode = to.clone(this.coder, this.size);
this.nodes.push(newNode);
from.out[symbol] = newNode;
// distribute transition counts among new and cloned node
newNode.sum = to.sum = 0;
for (i=0; i<this.size; i++) {
newNode.count[i] = to.count[i] * trans_cnt / next_cnt;
newNode.sum += newNode.count[i];
to.count[i] -= newNode.count[i];
to.sum += to.count[i];
}
return newNode;
};
MarkovModel.prototype.encode = function(symbol) {
var from = this.current;
from.model.encode(symbol);
var to = from.out[symbol];
if (from.count[symbol] !== MAX_TRANS_CNT) {
from.count[symbol]++;
from.sum++;
}
this.current = this.maybeSplit(from, symbol, to);
};
MarkovModel.prototype.decode = function() {
var from = this.current;
var symbol = from.model.decode();
var to = from.out[symbol];
if (from.count[symbol] !== MAX_TRANS_CNT) {
from.count[symbol]++;
from.sum++;
}
this.current = this.maybeSplit(from, symbol, to);
return symbol;
};
Dmc.compressFile = Util.compressFileHelper(Dmc.MAGIC, function(inStream, outStream, fileSize, props) {
props = props || {};
var MIN_CNT1 = (+props.m) || DEFAULT_MIN_CNT1;
var MIN_CNT2 = (+props.n) || DEFAULT_MIN_CNT2;
Util.writeUnsignedNumber(outStream, MIN_CNT1);
Util.writeUnsignedNumber(outStream, MIN_CNT2);
var range = new RangeCoder(outStream);
range.encodeStart(0xCA, 0);
var mm = new MarkovModel(range, (fileSize<0) ? 257 : 256,
MIN_CNT1, MIN_CNT2);
var inSize = 0;
while (inSize !== fileSize) {
var ch = inStream.readByte();
if (ch===Stream.EOF) {
mm.encode(256); // end of stream
break;
}
mm.encode(ch);
inSize++;
}
var outSize = range.encodeFinish();
if (PRINT_STATS) {
console.log('M1', mm.MIN_CNT1, 'M2', mm.MIN_CNT2,
'states', mm.nodes.length, 'size', outSize);
}
});
Dmc.decompressFile = Util.decompressFileHelper(Dmc.MAGIC, function(inStream, outStream, fileSize) {
var MIN_CNT1 = Util.readUnsignedNumber(inStream);
var MIN_CNT2 = Util.readUnsignedNumber(inStream);
var range = new RangeCoder(inStream);
range.decodeStart();
var mm = new MarkovModel(range, (fileSize<0) ? 257 : 256,
MIN_CNT1, MIN_CNT2);
var outSize = 0;
while (outSize !== fileSize) {
var ch = mm.decode();
if (ch===256) {
break; // EOF
}
outStream.writeByte(ch);
outSize++;
}
range.decodeFinish();
});
return Dmc;
};
module.exports = body_fn.apply(null, libs);
},{"./MTFModel":138,"./RangeCoder":141,"./Stream":143,"./Util":144}],130:[function(require,module,exports){
/* Dummy Range Coder, for debugging.
* This has the same interface as RangeCoder, but just dumps the frequency
* parameters given to the file. This helps debug problems with the model
* driving the range coder.
*/
var libs = [
require('./RangeCoder'),
require('./Util')
];
var body_fn = function (RangeCoder,Util){
var Dummy = function(stream) {
RangeCoder.call(this, stream);
};
Dummy.prototype = Object.create(RangeCoder.prototype);
Dummy.prototype._write8 = function(b) {
Util.writeUnsignedNumber(this.stream, b);
this.stream.writeByte(b);
};
Dummy.prototype._write16 = function(s) {
this.stream.writeByte((s >>> 8) & 0xFF);
this.stream.writeByte(s & 0xFF);
};
Dummy.prototype._read8 = function() {
return this.stream.readByte();
};
Dummy.prototype._read16 = function() {
var hi = this.stream.readByte();
var lo = this.stream.readByte();
return (hi<<8) | lo;
};
Dummy.prototype.encodeStart = function(c, initlength) {
this.stream.writeByte(c);
};
Dummy.prototype.encodeFreq = function(sy_f, lt_f, tot_f) {
console.assert(sy_f > 0);
console.assert(tot_f > 0);
console.assert(tot_f <= (1<<23));
if ((sy_f + lt_f) > tot_f) {
console.error('dummy coder: lt_f + sy_f > tot_f',
sy_f, lt_f, tot_f);
}
Util.writeUnsignedNumber(this.stream, sy_f);
Util.writeUnsignedNumber(this.stream, lt_f);
Util.writeUnsignedNumber(this.stream, tot_f);
};
Dummy.prototype.encodeShift = function(sy_f, lt_f, shift) {
this.encodeFreq(sy_f, lt_f, 1 << shift);
};
Dummy.prototype.encodeFinish = function() {
return 0;
};
Dummy.prototype.decodeStart = function(skipInitialRead) {
return skipInitialRead ? 0 : this.stream.readByte();
};
Dummy.prototype.decodeCulFreq = function(tot_f) {
console.assert(tot_f > 0);
this.sy_f = Util.readUnsignedNumber(this.stream);
this.lt_f = Util.readUnsignedNumber(this.stream);
this.tot_f= Util.readUnsignedNumber(this.stream);
if (tot_f !== this.tot_f) {
console.error('decodeCul* wrong total: got', tot_f,
'expected', this.tot_f);
}
return (this.sy_f>>>1) + this.lt_f;
};
Dummy.prototype.decodeCulShift = function(shift) {
return this.decodeCulFreq(1<<shift);
};
Dummy.prototype.decodeUpdate = function(sy_f, lt_f, tot_f) {
console.assert(sy_f > 0);
console.assert(tot_f > 0);
if (sy_f !== this.sy_f ||
lt_f !== this.lt_f ||
tot_f!== this.tot_f) {
console.error('decodeUpdate wrong parameters; got',
sy_f, lt_f, tot_f, 'expected',
this.sy_f, this.lt_f, this.tot_f);
}
};
Dummy.prototype.decodeFinish = function() {
};
return Dummy;
};
module.exports = body_fn.apply(null, libs);
},{"./RangeCoder":141,"./Util":144}],131:[function(require,module,exports){
/** Range coding model based on Fenwick trees for O(ln N) query/update. */
var libs = [
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (RangeCoder,Stream,Util){
/** We store two probabilities in a U32, so max prob is going to be 0xFFFF */
var DEFAULT_MAX_PROB = 0xFF00;
var DEFAULT_INCREMENT= 0x0100;
var ESC_MASK = 0x0000FFFF, ESC_SHIFT = 0;
var SYM_MASK = 0xFFFF0000, SYM_SHIFT = 16;
var SCALE_MASK=0xFFFEFFFE;
var FenwickModel = function(coder, size, max_prob, increment) {
this.coder = coder;
this.numSyms = size + 1; // save space for an escape symbol
this.tree = Util.makeU32Buffer(this.numSyms*2);
this.increment = (+increment) || DEFAULT_INCREMENT;
this.max_prob = (+max_prob) || DEFAULT_MAX_PROB;
// sanity-check to prevent overflow.
console.assert((this.max_prob + (this.increment-1)) <= 0xFFFF);
console.assert(size <= 0xFFFF);
// record escape probability as 1.
var i;
for (i=0; i<size; i++) {
this.tree[this.numSyms + i] = // escape prob=1, sym prob = 0
(1 << ESC_SHIFT) | (0 << SYM_SHIFT);
}
this.tree[this.numSyms + i] = // escape prob = 0, sym prob = 1
(0 << ESC_SHIFT) | (this.increment << SYM_SHIFT);
this._sumTree();
// probability sums are in this.tree[1]. this.tree[0] is unused.
};
FenwickModel.factory = function(coder, max_prob, increment) {
return function(size) {
return new FenwickModel(coder, size, max_prob, increment);
};
};
FenwickModel.prototype.clone = function() {
var newModel = new FenwickModel(this.coder, this.size,
this.max_prob, this.increment);
var i;
for (i=1; i<this.tree.length; i++) {
newModel.tree[i] = this.tree[i];
}
return newModel;
};
FenwickModel.prototype.encode = function(symbol) {
var i = this.numSyms + symbol;
var sy_f = this.tree[i];
var mask = SYM_MASK, shift = SYM_SHIFT;
var update = (this.increment << SYM_SHIFT);
if ((sy_f & SYM_MASK) === 0) { // escape!
this.encode(this.numSyms-1);
mask = ESC_MASK;
update -= (1<<ESC_SHIFT); // not going to escape no mo'
shift = ESC_SHIFT;
} else if (symbol === (this.numSyms-1) &&
((this.tree[1] & ESC_MASK) >>> ESC_SHIFT) === 1) {
// this is the last escape, zero it out
update = -this.tree[i];
}
// sum up the proper lt_f
var lt_f = 0;
while (i > 1) {
var isRight = (i & 1);
var parent = (i >>> 1);
// if we're the right child, we need to
// add the prob from the left child
if (isRight) {
lt_f += this.tree[2*parent];
}
// update sums
this.tree[i] += update; // increase sym / decrease esc
i = parent;
}
var tot_f = this.tree[1];
this.tree[1] += update; // update prob in root
sy_f = (sy_f & mask) >>> shift;
lt_f = (lt_f & mask) >>> shift;
tot_f =(tot_f& mask) >>> shift;
this.coder.encodeFreq(sy_f, lt_f, tot_f);
// rescale?
if ((( this.tree[1] & SYM_MASK ) >>> SYM_SHIFT) >= this.max_prob) {
this._rescale();
}
};
FenwickModel.prototype._decode = function(isEscape) {
var mask = SYM_MASK, shift = SYM_SHIFT;
var update = (this.increment << SYM_SHIFT);
if (isEscape) {
mask = ESC_MASK;
update -= (1 << ESC_SHIFT);
shift = ESC_SHIFT;
}
var tot_f = (this.tree[1] & mask) >>> shift;
var prob = this.coder.decodeCulFreq(tot_f);
// travel down the tree looking for this
var i = 1, lt_f = 0;
while (i < this.numSyms) {
this.tree[i] += update;
// look at probability in left child.
var leftProb = (this.tree[2*i] & mask) >>> shift;
i *= 2;
if ((prob-lt_f) >= leftProb) {
lt_f += leftProb;
i++; // take the right child.
}
}
var symbol = i - this.numSyms;
var sy_f = (this.tree[i] & mask) >>> shift;
this.tree[i] += update;
this.coder.decodeUpdate(sy_f, lt_f, tot_f);
// was this the last escape?
if (symbol === (this.numSyms-1) &&
((this.tree[1] & ESC_MASK) >>> ESC_SHIFT) === 1) {
update = -this.tree[i]; // zero it out
while (i >= 1) {
this.tree[i] += update;
i = (i >>> 1); // parent
}
}
// rescale?
if ((( this.tree[1] & SYM_MASK ) >>> SYM_SHIFT) >= this.max_prob) {
this._rescale();
}
return symbol;
};
FenwickModel.prototype.decode = function() {
var symbol = this._decode(false); // not escape
if (symbol === (this.numSyms-1)) {
// this was an escape!
symbol = this._decode(true); // an escape!
}
return symbol;
};
FenwickModel.prototype._rescale = function() {
var i, prob, noEscape = true;
// scale symbols (possible causing them to escape)
for (i=0; i < this.numSyms-1; i++) {
prob = this.tree[this.numSyms + i];
if ((prob & ESC_MASK) !== 0) {
// this symbol escapes
noEscape = false;
continue;
}
prob = (prob & SCALE_MASK) >>> 1;
if (prob === 0) {
// this symbol newly escapes
prob = (1 << ESC_SHIFT);
noEscape = false;
}
this.tree[this.numSyms + i] = prob;
}
// scale the escape symbol
prob = this.tree[this.numSyms + i];
prob = (prob & SCALE_MASK) >>> 1;
// prob should be zero if there are no escaping symbols, otherwise
// it must be at least 1.
if (noEscape) { prob = 0; }
else if (prob === 0) { prob = (1 << SYM_SHIFT); }
this.tree[this.numSyms + i] = prob;
// sum it all up afresh
this._sumTree();
};
FenwickModel.prototype._sumTree = function() {
var i;
// sum it all. (we know we won't overflow)
for (i=this.numSyms - 1; i > 0; i--) {
this.tree[i] = this.tree[2*i] + this.tree[2*i + 1];
}
};
FenwickModel.MAGIC = 'fenw';
/** Simple order-0 compressor, as self-test. */
FenwickModel.compressFile = Util.compressFileHelper(FenwickModel.MAGIC, function(inStream, outStream, fileSize, props, finalByte) {
var range = new RangeCoder(outStream);
range.encodeStart(finalByte, 1);
var model = new FenwickModel(range, (fileSize<0) ? 257 : 256);
Util.compressWithModel(inStream, fileSize, model);
range.encodeFinish();
}, true);
/** Simple order-0 decompresser, as self-test. */
FenwickModel.decompressFile = Util.decompressFileHelper(FenwickModel.MAGIC, function(inStream, outStream, fileSize) {
var range = new RangeCoder(inStream);
range.decodeStart(true/*already read the final byte*/);
var model = new FenwickModel(range, (fileSize<0) ? 257 : 256);
Util.decompressWithModel(outStream, fileSize, model);
range.decodeFinish();
});
return FenwickModel;
};
module.exports = body_fn.apply(null, libs);
},{"./RangeCoder":141,"./Stream":143,"./Util":144}],132:[function(require,module,exports){
/* Adaptive Huffman code, using Vitter's algorithm ported from
* vitter.c at http://code.google.com/p/compression-code/downloads/list
* The original code was placed in the public domain, and so I
* also place this JavaScript port in the public domain.
* -- C. Scott Ananian <cscott@cscott.net>, 2013
* ps. some truly grotty C code in the originally, faithfully ported to
* evil comma-operator-using, assignment-in-if-condition JavaScript.
*/
var libs = [
require('./BitStream'),
require('./Util')
];
var body_fn = function (BitStream,Util) {
// This code is adapted from Professor Vitter's
// article, Design and Analysis of Dynamic Huffman Codes,
// which appeared in JACM October 1987
// A design trade-off has been made to simplify the
// code: a node's block is determined dynamically,
// and the implicit tree structure is maintained,
// e.g. explicit node numbers are also implicit.
// Dynamic Huffman table weight ranking
// is maintained per Professor Vitter's
// invariant (*) for algorithm FGK:
// leaves precede internal nodes of the
// same weight in a non-decreasing ranking
// of weights using implicit node numbers:
// 1) leaves slide over internal nodes, internal nodes
// swap over groups of leaves, leaves are swapped
// into group leader position, but two internal
// nodes never change positions relative
// to one another.
// 2) weights are incremented by 2:
// leaves always have even weight values;
// internal nodes always have odd values.
// 3) even node numbers are always right children;
// odd numbers are left children in the tree.
// node 2 * HuffSize - 1 is always the tree root;
// node HuffEsc is the escape node;
// the tree is initialized by creating an
// escape node as the root.
// each new leaf symbol is paired with a new escape
// node into the previous escape node in the tree,
// until the last symbol which takes over the
// tree position of the escape node, and
// HuffEsc is left at zero.
// overall table size: 2 * HuffSize
// huff_init(alphabet_size, potential symbols used)
// huff_encode(next_symbol)
// next_symbol = huff_decode()
// huff_scale(by_bits) -- scale weights and re-balance tree
var HTable = function(up, down, symbol, weight) {
this.up = up; // next node up the tree
this.down = down; // pair of down nodes
this.symbol = symbol; // node symbol value
this.weight = weight; // node weight
};
HTable.prototype.clone = function() {
return new HTable(this.up, this.down, this.symbol, this.weight);
};
HTable.prototype.set = function(htable) {
this.up = htable.up;
this.down = htable.down;
this.symbol = htable.symbol;
this.weight = htable.weight;
};
// initialize an adaptive coder
// for alphabet size, and count
// of nodes to be used
var Huffman = function(size, root, bitstream, max_weight) {
var i;
// default: all alphabet symbols are used
console.assert(size && typeof(size)==='number');
if( !root || root > size )
root = size;
// create the initial escape node
// at the tree root
if ( root <<= 1 ) {
root--;
}
// create root+1 htables (coding table)
// XXX this could be views on a backing Uint32 array?
this.table = [];
for (i=0; i<=root; i++) {
this.table[i] = new HTable(0,0,0,0);
}
// this.map => mapping for symbols to nodes
this.map = [];
// this.size => the alphabet size
if( this.size = size ) {
for (i=0; i<size; i++) {
this.map[i] = 0;
}
}
// this.esc => the current tree height
// this.root => the root of the tree
this.esc = this.root = root;
if (bitstream) {
this.readBit = bitstream.readBit.bind(bitstream);
this.writeBit = bitstream.writeBit.bind(bitstream);
}
this.max_weight = max_weight; // may be null or undefined
}
// factory interface
Huffman.factory = function(bitstream, max_weight) {
return function(size) {
return new Huffman(size, size, bitstream, max_weight);
};
};
// split escape node to incorporate new symbol
Huffman.prototype.split = function(symbol) {
var pair, node;
// is the tree already full???
if( pair = this.esc ) {
this.esc--;
} else {
console.assert(false);
return 0;
}
// if this is the last symbol, it moves into
// the escape node's old position, and
// this.esc is set to zero.
// otherwise, the escape node is promoted to
// parent a new escape node and the new symbol.
if( node = this.esc ) {
this.table[pair].down = node;
this.table[pair].weight = 1;
this.table[node].up = pair;
this.esc--;
} else {
pair = 0;
node = 1;
}
// initialize the new symbol node
this.table[node].symbol = symbol;
this.table[node].weight = 0;
this.table[node].down = 0;
this.map[symbol] = node;
// initialize a new escape node.
this.table[this.esc].weight = 0;
this.table[this.esc].down = 0;
this.table[this.esc].up = pair;
return node;
};
// swap leaf to group leader position
// return symbol's new node
Huffman.prototype.leader = function(node) {
var weight = this.table[node].weight;
var leader = node, prev, symbol;
while( weight === this.table[leader + 1].weight ) {
leader++;
}
if( leader === node ) {
return node;
}
// swap the leaf nodes
symbol = this.table[node].symbol;
prev = this.table[leader].symbol;
this.table[leader].symbol = symbol;
this.table[node].symbol = prev;
this.map[symbol] = leader;
this.map[prev] = node;
return leader;
};
// slide internal node up over all leaves of equal weight;
// or exchange leaf with next smaller weight internal node
// return node's new position
Huffman.prototype.slide = function(node) {
var next = node;
var swap;
swap = this.table[next++].clone();
// if we're sliding an internal node, find the
// highest possible leaf to exchange with
if( swap.weight & 1 ) {
while( swap.weight > this.table[next + 1].weight ) {
next++;
}
}
// swap the two nodes
this.table[node].set(this.table[next]);
this.table[next].set(swap);
this.table[next].up = this.table[node].up;
this.table[node].up = swap.up;
// repair the symbol map and tree structure
if( swap.weight & 1 ) {
this.table[swap.down].up = next;
this.table[swap.down - 1].up = next;
this.map[this.table[node].symbol] = node;
} else {
this.table[this.table[node].down - 1].up = node;
this.table[this.table[node].down].up = node;
this.map[swap.symbol] = next;
}
return next;
};
// increment symbol weight and re balance the tree.
Huffman.prototype.increment = function(node) {
var up;
// obviate swapping a parent with its child:
// increment the leaf and proceed
// directly to its parent.
// otherwise, promote leaf to group leader position in the tree
if( this.table[node].up === node + 1 ) {
this.table[node].weight += 2;
node++;
} else {
node = this.leader (node);
}
// increase the weight of each node and slide
// over any smaller weights ahead of it
// until reaching the root
// internal nodes work upwards from
// their initial positions; while
// symbol nodes slide over first,
// then work up from their final
// positions.
while( this.table[node].weight += 2, up = this.table[node].up ) {
while( this.table[node].weight > this.table[node + 1].weight ) {
node = this.slide (node);
}
if( this.table[node].weight & 1 ) {
node = up;
} else {
node = this.table[node].up;
}
}
/* Re-scale if necessary. */
if (this.max_weight) {
if (this.table[this.root].weight >= this.max_weight) {
this.scale(1);
}
}
};
// scale all weights and re-balance the tree
// zero weight nodes are removed from the tree
// by sliding them out the left of the rank list
Huffman.prototype.scale = function(bits) {
var node = this.esc, weight, prev;
// work up the tree from the escape node
// scaling weights by the value of bits
while( ++node <= this.root ) {
// recompute the weight of internal nodes;
// slide down and out any unused ones
if( this.table[node].weight & 1 ) {
if( weight = this.table[this.table[node].down].weight & ~1 ) {
weight += this.table[this.table[node].down - 1].weight | 1;
}
// remove zero weight leaves by incrementing HuffEsc
// and removing them from the symbol map. take care
} else if( !(weight = this.table[node].weight >> bits & ~1) ) {
if( this.map[this.table[node].symbol] = 0, this.esc++ ) {
this.esc++;
}
}
// slide the scaled node back down over any
// previous nodes with larger weights
this.table[node].weight = weight;
prev = node;
while( weight < this.table[--prev].weight ) {
this.slide(prev);
}
}
// prepare a new escape node
this.table[this.esc].down = 0;
};
// send the bits for an escaped symbol
Huffman.prototype.sendid = function(symbol) {
var empty = 0, max;
// count the number of empty symbols
// before the symbol in the table
while( symbol-- ) {
if( !this.map[symbol] ) {
empty++;
}
}
// send LSB of this count first, using
// as many bits as are required for
// the maximum possible count
if( max = this.size - Math.floor((this.root - this.esc) / 2) - 1 ) {
do {
this.writeBit(empty & 1);
empty >>= 1;
} while( max >>= 1 );
}
};
// encode the next symbol
Huffman.prototype.encode = function(symbol) {
var emit = 1, bit;
var up, idx, node;
if( symbol < this.size ) {
node = this.map[symbol];
} else {
console.assert(false);
return;
}
// for a new symbol, direct the receiver to the escape node
// but refuse input if table is already full.
if( !(idx = node) ) {
if( !(idx = this.esc) ) {
return;
}
}
// accumulate the code bits by
// working up the tree from
// the node to the root
while( up = this.table[idx].up ) {
emit <<= 1; emit |= idx & 1; idx = up;
}
// send the code, root selector bit first
while( bit = emit & 1, emit >>= 1 ) {
this.writeBit(bit);
}
// send identification and incorporate
// new symbols into the tree
if( !node ) {
this.sendid(symbol);
node = this.split(symbol);
}
// adjust and re-balance the tree
this.increment(node);
};
// read the identification bits
// for an escaped symbol
Huffman.prototype.readid = function() {
var empty = 0, bit = 1, max, symbol;
// receive the symbol, LSB first, reading
// only the number of bits necessary to
// transmit the maximum possible symbol value
if( max = this.size - Math.floor((this.root - this.esc) / 2) - 1 ) {
do {
empty |= this.readBit() ? bit : 0;
bit <<= 1;
} while( max >>= 1 );
}
// the count is of unmapped symbols
// in the table before the new one
for( symbol = 0; symbol < this.size; symbol++ ) {
if( !this.map[symbol] ) {
if( !empty-- ) {
return symbol;
}
}
}
// oops! our count is too big, either due
// to a bit error, or a short node count
// given to huff_init.
console.assert(false);
return 0;
};
// decode the next symbol
Huffman.prototype.decode = function() {
var node = this.root;
var symbol, down;
// work down the tree from the root
// until reaching either a leaf
// or the escape node. A one
// bit means go left, a zero
// means go right.
while( down = this.table[node].down ) {
if( this.readBit() ) {
node = down - 1; // the left child precedes the right child
} else {
node = down;
}
}
// sent to the escape node???
// refuse to add to a full tree
if( node === this.esc ) {
if( this.esc ) {
symbol = this.readid ();
node = this.split (symbol);
} else {
console.assert(false);
return 0;
}
} else {
symbol = this.table[node].symbol;
}
// increment weights and re-balance
// the coding tree
this.increment (node);
return symbol;
};
// stand alone compressor, mostly for testing
Huffman.MAGIC = 'huff';
Huffman.compressFile = Util.compressFileHelper(Huffman.MAGIC, function(input, output, size, props) {
var bitstream = new BitStream(output);
var alphabetSize = 256;
if (size < 0) { alphabetSize++; }
var huff = new Huffman(257, alphabetSize, bitstream, 8191);
Util.compressWithModel(input, size, huff);
bitstream.flush();
});
// stand alone decompresser, again for testing
Huffman.decompressFile = Util.decompressFileHelper(Huffman.MAGIC, function(input, output, size) {
var bitstream = new BitStream(input);
var alphabetSize = 256;
if (size < 0) { alphabetSize++; }
var huff = new Huffman(257, alphabetSize, bitstream, 8191);
Util.decompressWithModel(output, size, huff);
});
return Huffman;
};
module.exports = body_fn.apply(null, libs);
},{"./BitStream":123,"./Util":144}],133:[function(require,module,exports){
/**
* An in-place, length restricted Canonical Huffman code length allocator
*
* Based on the algorithm proposed by R. L. Milidiú, A. A. Pessoa and
* E. S. Laber in "In-place Length-Restricted Prefix Coding" (see:
* http://www-di.inf.puc-rio.br/~laber/public/spire98.ps) and
* incorporating additional ideas from the implementation of "shcodec"
* by Simakov Alexander (see: http://webcenter.ru/~xander/)
*
* This JavaScript implementation ported from HuffmanAllocator.java from
* https://code.google.com/p/jbzip2
* which is:
*
* Copyright (c) 2011 Matthew Francis
*
* 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.
*
* This JavaScript implementation is:
* Copyright (c) 2013 C. Scott Ananian
* with the same licensing terms as Matthew Francis' original implementation.
*/
var libs = [
require('./freeze'),
require('./Util')
];
var body_fn = function (freeze, Util) {
/**
* FIRST() function
* @param array The code length array
* @param i The input position
* @param nodesToMove The number of internal nodes to be relocated
* @return The smallest {@code k} such that {@code nodesToMove <= k <= i} and
* {@code i <= (array[k] % array.length)}
*/
var first = function(array, i, nodesToMove) {
var length = array.length;
var limit = i;
var k = array.length - 2;
while ((i >= nodesToMove) && ((array[i] % length) > limit)) {
k = i;
i -= (limit - i + 1);
}
i = Math.max (nodesToMove - 1, i);
while (k > (i + 1)) {
var temp = (i + k) >> 1;
if ((array[temp] % length) > limit) {
k = temp;
} else {
i = temp;
}
}
return k;
};
/**
* Fills the code array with extended parent pointers
* @param array The code length array
*/
var setExtendedParentPointers = function(array) {
var length = array.length;
array[0] += array[1];
var headNode, tailNode, topNode, temp;
for (headNode = 0, tailNode = 1, topNode = 2;
tailNode < (length - 1);
tailNode++) {
if ((topNode >= length) || (array[headNode] < array[topNode])) {
temp = array[headNode];
array[headNode++] = tailNode;
} else {
temp = array[topNode++];
}
if ((topNode >= length) ||
((headNode < tailNode) && (array[headNode] < array[topNode]))) {
temp += array[headNode];
array[headNode++] = tailNode + length;
} else {
temp += array[topNode++];
}
array[tailNode] = temp;
}
};
/**
* Finds the number of nodes to relocate in order to achieve a given code
* length limit
* @param array The code length array
* @param maximumLength The maximum bit length for the generated codes
* @return The number of nodes to relocate
*/
var findNodesToRelocate = function(array, maximumLength) {
var currentNode = array.length - 2;
var currentDepth;
for (currentDepth = 1;
(currentDepth < (maximumLength - 1)) && (currentNode > 1);
currentDepth++) {
currentNode = first (array, currentNode - 1, 0);
}
return currentNode;
};
/**
* A final allocation pass with no code length limit
* @param array The code length array
*/
var allocateNodeLengths = function(array) {
var firstNode = array.length - 2;
var nextNode = array.length - 1;
var currentDepth, availableNodes, lastNode, i;
for (currentDepth = 1, availableNodes = 2;
availableNodes > 0;
currentDepth++) {
lastNode = firstNode;
firstNode = first (array, lastNode - 1, 0);
for (i = availableNodes - (lastNode - firstNode); i > 0; i--) {
array[nextNode--] = currentDepth;
}
availableNodes = (lastNode - firstNode) << 1;
}
};
/**
* A final allocation pass that relocates nodes in order to achieve a
* maximum code length limit
* @param array The code length array
* @param nodesToMove The number of internal nodes to be relocated
* @param insertDepth The depth at which to insert relocated nodes
*/
var allocateNodeLengthsWithRelocation = function(array, nodesToMove,
insertDepth) {
var firstNode = array.length - 2;
var nextNode = array.length - 1;
var currentDepth = (insertDepth == 1) ? 2 : 1;
var nodesLeftToMove = (insertDepth == 1) ? nodesToMove - 2 : nodesToMove;
var availableNodes, lastNode, offset, i;
for (availableNodes = currentDepth << 1;
availableNodes > 0;
currentDepth++) {
lastNode = firstNode;
firstNode = (firstNode <= nodesToMove) ? firstNode : first (array, lastNode - 1, nodesToMove);
offset = 0;
if (currentDepth >= insertDepth) {
offset = Math.min (nodesLeftToMove, 1 << (currentDepth - insertDepth));
} else if (currentDepth == (insertDepth - 1)) {
offset = 1;
if ((array[firstNode]) == lastNode) {
firstNode++;
}
}
for (i = availableNodes - (lastNode - firstNode + offset); i > 0; i--) {
array[nextNode--] = currentDepth;
}
nodesLeftToMove -= offset;
availableNodes = (lastNode - firstNode + offset) << 1;
}
};
/**
* Allocates Canonical Huffman code lengths in place based on a sorted
* frequency array
* @param array On input, a sorted array of symbol frequencies; On output,
* an array of Canonical Huffman code lengths
* @param maximumLength The maximum code length. Must be at least
* {@code ceil(log2(array.length))}
*/
// public
var allocateHuffmanCodeLengths = function(array, maximumLength) {
switch (array.length) {
case 2:
array[1] = 1;
case 1:
array[0] = 1;
return;
}
/* Pass 1 : Set extended parent pointers */
setExtendedParentPointers (array);
/* Pass 2 : Find number of nodes to relocate in order to achieve
* maximum code length */
var nodesToRelocate = findNodesToRelocate (array, maximumLength);
/* Pass 3 : Generate code lengths */
if ((array[0] % array.length) >= nodesToRelocate) {
allocateNodeLengths (array);
} else {
var insertDepth = maximumLength - (Util.fls(nodesToRelocate - 1));
allocateNodeLengthsWithRelocation (array, nodesToRelocate, insertDepth);
}
};
return freeze({
allocateHuffmanCodeLengths: allocateHuffmanCodeLengths
});
};
module.exports = body_fn.apply(null, libs);
},{"./Util":144,"./freeze":145}],134:[function(require,module,exports){
/** Simple (log n)(n) distance model. */
var libs = [
require('./Util')
];
var body_fn = function (Util){
// lengthBitsModelFactory will be called with arguments 2, 4, 8, 16, etc
// and must return an appropriate model or coder.
var LogDistanceModel = function(size, extraStates,
lgDistanceModelFactory,
lengthBitsModelFactory) {
var i;
var bits = Util.fls(size-1);
this.extraStates = +extraStates || 0;
this.lgDistanceModel = lgDistanceModelFactory(1 + bits + extraStates);
// this.distanceModel[n] used for distances which are n-bits long,
// but only n-1 bits are encoded: the top bit is known to be one.
this.distanceModel = [];
for (i=2 ; i <= bits; i++) {
var numBits = i - 1;
this.distanceModel[i] = lengthBitsModelFactory(1<<numBits);
}
};
/* you can give this model arguments between 0 and (size-1), or else
a negative argument which is one of the 'extra states'. */
LogDistanceModel.prototype.encode = function(distance) {
if (distance < 2) { // small distance or an 'extra state'
this.lgDistanceModel.encode(distance + this.extraStates);
return;
}
var lgDistance = Util.fls(distance);
console.assert(distance & (1<<(lgDistance-1))); // top bit is set
console.assert(lgDistance >= 2);
this.lgDistanceModel.encode(lgDistance + this.extraStates);
// now encode the rest of the bits.
var rest = distance & ((1 << (lgDistance-1)) - 1);
this.distanceModel[lgDistance].encode(rest);
};
LogDistanceModel.prototype.decode = function() {
var lgDistance = this.lgDistanceModel.decode() - this.extraStates;
if (lgDistance < 2) {
return lgDistance; // this is a small distance or an 'extra state'
}
var rest = this.distanceModel[lgDistance].decode();
return (1 << (lgDistance-1)) + rest;
};
return LogDistanceModel;
};
module.exports = body_fn.apply(null, libs);
},{"./Util":144}],135:[function(require,module,exports){
/* LZJB compression: http://en.wikipedia.org/wiki/LZJB */
var libs = [
require('./Stream'),
require('./Util')
];
var body_fn = function (Stream,Util) {
/**
$Id: Iuppiter.js 3026 2010-06-23 10:03:13Z Bear $
Copyright (c) 2010 Nuwa Information Co., Ltd, and individual contributors.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. 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.
3. Neither the name of Nuwa Information nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
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 OWNER 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.
$Author: Bear $
$Date: 2010-06-23 18:03:13 +0800 (星期三, 23 六月 2010) $
$Revision: 3026 $
*/
var Lzjb = Object.create(null);
Lzjb.MAGIC = 'lzjb';
// Constants was used for compress/decompress function.
var NBBY = 8,
MATCH_BITS = 6,
MATCH_MIN = 3,
MATCH_MAX = ((1 << MATCH_BITS) + (MATCH_MIN - 1)),
OFFSET_MASK = ((1 << (16 - MATCH_BITS)) - 1),
LEMPEL_SIZE_BASE = 1024;
var EOF = Stream.EOF;
// set C_COMPAT to true if you need to decompress with the (untweaked) C lzjb
// implementation, which breaks if offset==0; the javascript
// implementation uses 0 to indicate an offset of OFFSET_MASK+1.
var C_COMPAT = true;
/**
* Compress string or byte array using fast and efficient algorithm.
*
* Because of weak of javascript's natural, many compression algorithm
* become useless in javascript implementation. The main problem is
* performance, even the simple Huffman, LZ77/78 algorithm will take many
* many time to operate. We use LZJB algorithm to do that, it suprisingly
* fulfills our requirement to compress string fastly and efficiently.
*
* Our implementation is based on
* http://src.opensolaris.org/source/raw/onnv/onnv-gate/usr/src/uts/common/fs/zfs/lzjb.c
* and
* http://src.opensolaris.org/source/raw/onnv/onnv-gate/usr/src/uts/common/os/compress.c
* It is licensed under CDDL.
*
* @param {Array|Uint8Array|Buffer|stream} input The stream or byte array
* that you want to compress.
* @param {stream} output Optional output stream.
* @return {Array|Uint8Array|Buffer} Compressed byte array, or 'output'
*/
Lzjb.compressFile = Util.compressFileHelper(Lzjb.MAGIC, function(inStream, outStream, fileSize, props) {
var sstart, dstart = [], slen,
src = 0, dst = 0,
cpy, copymap,
mlen, offset,
hash, hp,
lempel,
i, j;
var retval;
// in an improvement over the original C implementation, we expand
// the hash table to track a number of potential matches, not just the
// most recent. This doesn't require any changes to the decoder.
// Sample impact on compression size (on wikipedia data):
// EXPAND Time Size Option
// 1 0m20.321s 50185613 -1
// 2 0m22.437s 46503301 -2
// 3 0m23.773s 45744564 -3
// 4 0m25.666s 45199866 -4
// 5 0m35.810s 44821413 -5
// 6 0m40.947s 44666638 -6
// 8 0m49.639s 44413865 -7
// 12 0m49.927s 44124825 -8
// 16 1m01.180s 43972515 -9
// 32 1m30.530s 43554099
// 64 2m14.504s 43005530
// 128 3m43.570s 42361718
// 256 6m38.681s 41684853
var LEMPEL_SIZE = LEMPEL_SIZE_BASE;
var EXPAND = 1; // default to original C impl
if (typeof(props)==='number') {
LEMPEL_SIZE *= 2;
props = Math.max(1, Math.min(9, props)) - 1;
EXPAND = 1<<Math.floor(props/2);
if (props&1) EXPAND = Math.round(EXPAND * 1.5);
if (props >=2 && props <= 4) EXPAND++;
}
// use Uint16Array if available (zero-filled)
lempel = Util.makeU16Buffer(LEMPEL_SIZE * EXPAND);
var window = Util.makeU8Buffer(OFFSET_MASK+1);
var windowpos = 0;
var winput = function(_byte) {
window[windowpos++] = _byte;
if (windowpos >= window.length) {
windowpos = 0;
}
return _byte;
};
var outwindow = Util.makeU8Buffer(17);
var outpos = 0;
var dumpout = function() {
var i;
for (i=0; i<outpos; i++) {
outStream.writeByte(outwindow[i]);
}
outpos = 0;
};
var unbuffer = [];
var get = function() {
if (unbuffer.length)
return unbuffer.pop();
return inStream.readByte();
};
var unget = function(_byte) {
unbuffer.push(_byte);
};
var copymask = 1 << (NBBY - 1);
var matchpossibility = [];
while (true) {
var c1 = get();
if (c1 === EOF) break;
if ((copymask <<= 1) == (1 << NBBY)) {
dumpout();
copymask = 1;
outwindow[0] = 0;
outpos = 1;
}
var c2 = get();
if (c2 === EOF) {
outwindow[outpos++] = winput(c1);
break;
}
var c3 = get();
if (c3 === EOF) {
outwindow[outpos++] = winput(c1);
unget(c2);
continue;
}
hash = (c1 << 16) + (c2 << 8) + c3;
hash ^= (hash >> 9);
hash += (hash >> 5);
hash ^= c1;
hp = (hash & (LEMPEL_SIZE - 1)) * EXPAND;
matchpossibility.length = 0;
for (j=0; j<EXPAND; j++) {
offset = (windowpos - lempel[hp+j]) & OFFSET_MASK;
cpy = window.length + windowpos - offset;
var w1 = window[cpy & OFFSET_MASK];
var w2 = window[(cpy+1) & OFFSET_MASK];
var w3 = window[(cpy+2) & OFFSET_MASK];
// if offset is small, we might not have copied the tentative
// bytes into the window yet. (Note that offset=0 really means
// offset=(OFFSET_MASK+1).)
if (C_COMPAT && offset===0) {
w1 = c1 ^ 1; // ensure match will fail
} else if (offset==1) { w2 = c1; w3 = c2; }
else if (offset==2) { w3 = c1; }
if (c1 === w1 && c2 === w2 && c3 === w3) {
matchpossibility.push(offset);
}
}
// store this location in the hash, move the others over to make room
// oldest match drops off
for (j=EXPAND-1; j>0; j--)
lempel[hp+j] = lempel[hp+j-1];
lempel[hp] = windowpos;
// did we find any matches?
if (matchpossibility.length === 0) {
outwindow[outpos++] = winput(c1);
unget(c3);
unget(c2);
} else {
// find the longest of the possible matches
outwindow[0] |= copymask;
winput(c1); winput(c2); winput(c3);
var c4 = get(), last = matchpossibility[0];
var base = window.length + windowpos;
for (mlen = MATCH_MIN; mlen < MATCH_MAX; mlen++, base++) {
if (c4 === EOF) break;
for (j=0; j < matchpossibility.length; ) {
var w4 = window[(base - matchpossibility[j]) & OFFSET_MASK];
if (c4 !== w4) {
last = matchpossibility[j];
matchpossibility.splice(j, 1);
} else {
j++;
}
}
if (matchpossibility.length===0) break; // no more matches
winput(c4);
c4 = get();
}
if (matchpossibility.length !== 0) {
// maximum length match, rock on!
last = matchpossibility[0];
}
unget(c4);
outwindow[outpos++] = ((mlen - MATCH_MIN) << (NBBY - MATCH_BITS)) |
(last >> NBBY);
outwindow[outpos++] = last & 0xFF;
}
}
dumpout();
});
/**
* Decompress string or byte array using fast and efficient algorithm.
*
* Our implementation is based on
* http://src.opensolaris.org/source/raw/onnv/onnv-gate/usr/src/uts/common/fs/zfs/lzjb.c
* and
* http://src.opensolaris.org/source/raw/onnv/onnv-gate/usr/src/uts/common/os/compress.c
* It is licensed under CDDL.
*
* @param {Array|Uint8Array|Buffer|stream} input The stream or byte array
* that you want to decompress.
* @param {stream} output Optional output stream.
* @return {Array|Uint8Array|Buffer} Decompressed byte array, or 'output'
*/
Lzjb.decompressFile = Util.decompressFileHelper(Lzjb.MAGIC, function(inStream, outStream, outSize) {
var sstart, dstart = [], slen,
src = 0, dst = 0,
cpy, copymap,
mlen, offset,
i, c;
var retval;
var window = Util.makeU8Buffer(OFFSET_MASK+1);
var windowpos = 0;
var copymask = 1 << (NBBY - 1);
while (outSize !== 0) {
c = inStream.readByte();
if (c === EOF) break;
if ((copymask <<= 1) == (1 << NBBY)) {
copymask = 1;
copymap = c;
c = inStream.readByte();
}
if (copymap & copymask) {
mlen = (c >> (NBBY - MATCH_BITS)) + MATCH_MIN;
offset = ((c << NBBY) | inStream.readByte()) & OFFSET_MASK;
cpy = windowpos - offset;
if (cpy < 0) cpy += window.length;
if (outSize >= 0) outSize -= mlen;
while (--mlen >= 0) {
c = window[windowpos++] = window[cpy++];
outStream.writeByte(c);
if (windowpos >= window.length) { windowpos=0; }
if (cpy >= window.length) { cpy = 0; }
}
} else {
outStream.writeByte(c);
window[windowpos++] = c;
if (windowpos >= window.length) { windowpos=0; }
if (outSize >= 0) outSize--;
}
}
});
return Lzjb;
};
module.exports = body_fn.apply(null, libs);
},{"./Stream":143,"./Util":144}],136:[function(require,module,exports){
/* Tweaked version of LZJB, using range coder. */
var libs = [
require('./Context1Model'),
require('./FenwickModel'),
require('./LogDistanceModel'),
require('./NoModel'),
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (Context1Model,FenwickModel,LogDistanceModel,NoModel,RangeCoder,Stream,Util){
var LzjbR = Object.create(null);
LzjbR.MAGIC = 'lzjR';
// Constants was used for compress/decompress function.
var NBBY = 8,
MATCH_BITS = 6,
MATCH_MIN = 3,
MATCH_MAX = ((1 << MATCH_BITS) + (MATCH_MIN - 1)),
OFFSET_MASK = ((1 << (16 - MATCH_BITS)) - 1),
LEMPEL_SIZE_BASE = 1024;
var LENGTH_MODEL_CUTOFF = 32;
/**
* Compress using modified LZJB algorithm. Instead of using the simple
* 9-bit literal / 17-bit match format of the original, use a range
* coder for the literal/match bit and for the offset and length.
*/
LzjbR.compressFile = Util.compressFileHelper(LzjbR.MAGIC, function(inStream, outStream, fileSize, props, finalByte) {
var sstart, dstart = [], slen,
src = 0, dst = 0,
cpy, copymap,
mlen, offset,
hash, hp,
lempel,
i, j;
// in an improvement over the original C implementation of LZJB, we expand
// the hash table to track a number of potential matches, not just the
// most recent. This doesn't require any changes to the decoder.
var LEMPEL_SIZE = LEMPEL_SIZE_BASE;
var EXPAND = 1; // default to original C impl
if (typeof(props)==='number') {
LEMPEL_SIZE *= 2;
props = Math.max(1, Math.min(9, props)) - 1;
EXPAND = 1<<Math.floor(props/2);
if (props&1) EXPAND = Math.round(EXPAND * 1.5);
if (props >=2 && props <= 4) EXPAND++;
}
var encoder = new RangeCoder(outStream);
encoder.encodeStart(finalByte, 1);
// use Uint16Array if available (zero-filled)
lempel = Util.makeU16Buffer(LEMPEL_SIZE * EXPAND);
var window = Util.makeU8Buffer(OFFSET_MASK+1);
var windowpos = 0;
var winput = function(_byte) {
window[windowpos++] = _byte;
if (windowpos >= window.length) {
windowpos = 0;
}
return _byte;
};
var unbuffer = [];
var get = function() {
if (unbuffer.length)
return unbuffer.pop();
return inStream.readByte();
};
var unget = function(_byte) {
unbuffer.push(_byte);
};
var matchpossibility = [];
var MATCH = 256;
var EOF_SYM = 257;
var noModelFactory = NoModel.factory(encoder);
var modelFactory = FenwickModel.factory(encoder, 0xFF00, 0x100);
var literalModel = new Context1Model(modelFactory, 256,
((fileSize<0) ? EOF_SYM : MATCH) + 1);
var sparseModelFactory = function(size) {
if (size <= LENGTH_MODEL_CUTOFF) { return modelFactory(size); }
return noModelFactory(size);
};
var lenModel = new LogDistanceModel((MATCH_MAX-MATCH_MIN)+1, 0,
modelFactory, sparseModelFactory);
var posModel = new LogDistanceModel(OFFSET_MASK+1, 1,
modelFactory, sparseModelFactory);
var lastChar = 0x20, lastOffset = 0;
while (true) {
var initialPos = windowpos;
var c1 = get();
if (c1 === Stream.EOF) break;
var c2 = get();
if (c2 === Stream.EOF) {
literalModel.encode(winput(c1), lastChar); // literal, not a match
break;
}
var c3 = get();
if (c3 === Stream.EOF) {
literalModel.encode(winput(c1), lastChar); // literal, not a match
unget(c2); lastChar = c1;
continue;
}
hash = (c1 << 16) + (c2 << 8) + c3;
hash ^= (hash >> 9);
hash += (hash >> 5);
hash ^= c1;
hp = (hash & (LEMPEL_SIZE - 1)) * EXPAND;
matchpossibility.length = 0;
for (j=0; j<EXPAND; j++) {
offset = (windowpos - lempel[hp+j]) & OFFSET_MASK;
cpy = window.length + windowpos - offset;
var w1 = window[cpy & OFFSET_MASK];
var w2 = window[(cpy+1) & OFFSET_MASK];
var w3 = window[(cpy+2) & OFFSET_MASK];
// if offset is small, we might not have copied the tentative
// bytes into the window yet. (Note that offset=0 really means
// offset=(OFFSET_MASK+1).)
if (offset==1) { w2 = c1; w3 = c2; }
else if (offset==2) { w3 = c1; }
if (c1 === w1 && c2 === w2 && c3 === w3) {
matchpossibility.push(offset);
}
}
// store this location in the hash, move the others over to make room
// oldest match drops off
for (j=EXPAND-1; j>0; j--)
lempel[hp+j] = lempel[hp+j-1];
lempel[hp] = windowpos;
// did we find any matches?
if (matchpossibility.length === 0) {
literalModel.encode(winput(c1), lastChar); // literal, not a match
unget(c3);
unget(c2);
lastChar = c1;
} else {
literalModel.encode(MATCH, lastChar); // a match!
// find the longest of the possible matches
winput(c1); winput(c2); winput(c3); lastChar = c3;
var c4 = get(), last = matchpossibility[0];
var base = window.length + windowpos;
for (mlen = MATCH_MIN; mlen < MATCH_MAX; mlen++, base++) {
if (c4 === Stream.EOF) break;
for (j=0; j < matchpossibility.length; ) {
var w4 = window[(base - matchpossibility[j]) & OFFSET_MASK];
if (c4 !== w4) {
last = matchpossibility[j];
matchpossibility.splice(j, 1);
} else {
j++;
}
}
if (matchpossibility.length===0) break; // no more matches
winput(c4); lastChar = c4;
c4 = get();
}
if (matchpossibility.length !== 0) {
// maximum length match, rock on!
last = matchpossibility[0];
}
unget(c4);
// encode match length
// XXX we could get a bit more compression if we allowed
// the length to predict the offset (or vice-versa)
lenModel.encode(mlen - MATCH_MIN);
offset = (initialPos - last) & OFFSET_MASK;
if (offset === lastOffset) {
posModel.encode(-1); // common case!
} else {
posModel.encode(offset);
lastOffset = offset;
}
}
}
if (fileSize < 0) {
literalModel.encode(EOF_SYM, lastChar); // end of file (streaming)
}
encoder.encodeFinish();
}, true);
/**
* Decompress using modified LZJB algorithm.
*/
LzjbR.decompressFile = Util.decompressFileHelper(LzjbR.MAGIC, function(inStream, outStream, outSize) {
var sstart, dstart = [], slen,
src = 0, dst = 0,
cpy, copymap,
mlen, offset,
i, c;
var window = Util.makeU8Buffer(OFFSET_MASK+1);
var windowpos = 0;
var decoder = new RangeCoder(inStream);
decoder.decodeStart(true/* we already read the 'free' byte*/);
var MATCH = 256;
var EOF_SYM = 257;
var noModelFactory = NoModel.factory(decoder);
var modelFactory = FenwickModel.factory(decoder, 0xFF00, 0x100);
var literalModel = new Context1Model(modelFactory, 256,
((outSize<0) ? EOF_SYM : MATCH) + 1);
var sparseModelFactory = function(size) {
if (size <= LENGTH_MODEL_CUTOFF) { return modelFactory(size); }
return noModelFactory(size);
};
var lenModel = new LogDistanceModel((MATCH_MAX-MATCH_MIN)+1, 0,
modelFactory, sparseModelFactory);
var posModel = new LogDistanceModel(OFFSET_MASK+1, 1,
modelFactory, sparseModelFactory);
var lastChar = 0x20, lastOffset = 0;
while (outSize !== 0) {
c = literalModel.decode(lastChar);
if (c === EOF_SYM) {
break;
} else if (c === MATCH) {
mlen = lenModel.decode() + MATCH_MIN;
cpy = posModel.decode();
if (cpy<0) { cpy = lastOffset; }
else { lastOffset = cpy; }
if (outSize >= 0) outSize -= mlen;
while (--mlen >= 0) {
c = lastChar = window[windowpos++] = window[cpy++];
outStream.writeByte(c);
if (windowpos >= window.length) { windowpos=0; }
if (cpy >= window.length) { cpy = 0; }
}
} else {
outStream.writeByte(c);
window[windowpos++] = lastChar = c;
if (windowpos >= window.length) { windowpos=0; }
if (outSize >= 0) outSize--;
}
}
decoder.decodeFinish();
});
return LzjbR;
};
module.exports = body_fn.apply(null, libs);
},{"./Context1Model":126,"./FenwickModel":131,"./LogDistanceModel":134,"./NoModel":139,"./RangeCoder":141,"./Stream":143,"./Util":144}],137:[function(require,module,exports){
/* Implementation of LZP3(ish), with an adaptive Huffman code or a range
* coder (instead of LZP3's original static Huffman code).
* See: http://www.cbloom.com/papers/lzp.pdf
*/
var libs = [
require('./BitStream'),
require('./Context1Model'),
require('./DefSumModel'),
require('./FenwickModel'),
require('./Huffman'),
require('./LogDistanceModel'),
require('./NoModel'),
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (BitStream, Context1Model, DefSumModel, FenwickModel, Huffman, LogDistanceModel, NoModel, RangeCoder, Stream, Util){
var Lzp3 = Object.create(null);
Lzp3.MAGIC = 'lzp3';
// use Huffman coder (fast) or else use range coder (slow)
var USE_HUFFMAN_CODE = false;
// use deferred-sum model, which is supposed to be faster (but compresses worse)
var USE_DEFSUM = false;
// when to give up attempting to model the length
var LENGTH_MODEL_CUTOFF = 256;
var MODEL_MAX_PROB = 0xFF00;
var MODEL_INCREMENT = 0x100;
// Constants was used for compress/decompress function.
var CTXT4_TABLE_SIZE = 1 << 16;
var CTXT3_TABLE_SIZE = 1 << 12;
var CTXT2_TABLE_SIZE = 1 << 16;
var CONTEXT_LEN = 4;
var LOG_WINDOW_SIZE = 20;
var WINDOW_SIZE = 1 << LOG_WINDOW_SIZE;
var MAX_MATCH_LEN = WINDOW_SIZE-1;
var MATCH_LEN_CONTEXTS = 16;
var MAX32 = 0xFFFFFFFF;
var MAX24 = 0x00FFFFFF;
var MAX16 = 0x0000FFFF;
var MAX8 = 0x000000FF;
var Window = function(maxSize) {
this.buffer = Util.makeU8Buffer(Math.min(maxSize+4, WINDOW_SIZE));
this.pos = 0;
// context-4 hash table.
this.ctxt4 = Util.makeU32Buffer(CTXT4_TABLE_SIZE);
// context-3 hash table
this.ctxt3 = Util.makeU32Buffer(CTXT3_TABLE_SIZE);
// context-2 table (not really a hash any more)
this.ctxt2 = Util.makeU32Buffer(CTXT2_TABLE_SIZE);
// initial context
this.put(0x63); this.put(0x53); this.put(0x61); this.put(0x20);
};
Window.prototype.put = function(_byte) {
this.buffer[this.pos++] = _byte;
if (this.pos >= WINDOW_SIZE) { this.pos = 0; }
return _byte;
};
Window.prototype.get = function(pos) {
return this.buffer[pos & (WINDOW_SIZE-1)];
};
Window.prototype.context = function(pos, n) {
var c = 0, i;
pos = (pos - n) & (WINDOW_SIZE-1);
for (i=0; i<n; i++) {
c = (c << 8) | this.buffer[pos++];
if (pos >= WINDOW_SIZE) { pos = 0; }
}
return c;
};
// if matchLen !== 0, update the index; otherwise get index value.
Window.prototype.getIndex = function(s, matchLen) {
var c = this.context(s, 4);
// compute context hashes
var h4 = ((c>>>15) ^ c) & (CTXT4_TABLE_SIZE-1);
var h3 = ((c>>>11) ^ c) & (CTXT3_TABLE_SIZE-1);
var h2 = c & MAX16;
// check order-4 context
var p = 0, checkc;
// only do context confirmation if matchLen==0 (that is, if we're not just
// doing an update)
if (matchLen===0) {
p = this.ctxt4[h4];
if (p !== 0 && c !== this.context(p-1, 4)) {
p = 0; // context confirmation failed
}
if (p === 0) {
// check order-3 context
p = this.ctxt3[h3];
if (p !== 0 && (c & MAX24) !== this.context(p-1, 3)) {
p = 0; // context confirmation failed
}
if (p === 0) {
// check order-2 context
p = this.ctxt2[h2];
if (p !== 0 && (c && MAX16) !== this.context(p-1, 2)) {
p = 0; // context confirmation failed
}
}
}
}
// update context index
if (matchLen) { matchLen--; }
this.ctxt4[h4] = this.ctxt3[h3] = this.ctxt2[h2] =
(s | (matchLen << LOG_WINDOW_SIZE)) + 1;
// return lookup result.
return p;
};
/**
* Compress using modified LZP3 algorithm. Instead of using static
* Huffman coding, we use an adaptive Huffman code or range encoding.
*/
Lzp3.compressFile = Util.compressFileHelper(Lzp3.MAGIC, function(inStream, outStream, fileSize, props) {
// sliding window & hash table
var window = new Window( (fileSize>=0) ? fileSize : WINDOW_SIZE );
var coderFactory, sparseCoderFactory, flush;
if (USE_HUFFMAN_CODE) {
// Huffman contexts
outStream.writeByte(0x80); // mark that this is Huffman coded.
var bitstream = new BitStream(outStream);
flush = bitstream.flush.bind(bitstream);
coderFactory = Huffman.factory(bitstream, MAX16);
sparseCoderFactory = NoModel.factory(bitstream);
} else { // range encoder
var range = new RangeCoder(outStream);
range.encodeStart(0x00, 0); // 0x00 == range encoded
coderFactory = FenwickModel.factory(range, MODEL_MAX_PROB, MODEL_INCREMENT);
if (USE_DEFSUM) {
coderFactory = DefSumModel.factory(range, false /* encoder */);
}
// switch sparseCoderFactory to a NoModel when size > cutoff
var noCoderFactory = NoModel.factory(range);
sparseCoderFactory = function(size) {
if (size > LENGTH_MODEL_CUTOFF) {
return noCoderFactory(size);
}
return coderFactory(size);
};
flush = function() { range.encodeFinish(); };
}
var huffLiteral= new Context1Model(coderFactory, 256,
(fileSize<0) ? 257 : 256);
var huffLen = [], i;
for (i=0; i<MATCH_LEN_CONTEXTS; i++) {
huffLen[i] = new LogDistanceModel(MAX_MATCH_LEN+1, 1,
coderFactory, sparseCoderFactory);
}
var inSize = 0, s, matchContext = 0;
while (inSize !== fileSize) {
var ch = inStream.readByte();
s = window.pos;
var p = window.getIndex(s, 0);
if (p !== 0) {
// great, a match! how long is it?
p--; // p=0 is used for 'not here'. p=1 really means WINDOW_SIZE
var prevMatchLen = (p >>> LOG_WINDOW_SIZE) + 1;
var matchLen = 0;
while (window.get(p + matchLen) === ch && matchLen < MAX_MATCH_LEN) {
matchLen++;
window.put(ch);
ch = inStream.readByte();
}
// code match length; match len = 0 means "literal"
// use "extra state" -1 to mean "same as previous match length"
if (prevMatchLen===matchLen) {
huffLen[matchContext&(MATCH_LEN_CONTEXTS-1)].encode(-1);
} else {
huffLen[matchContext&(MATCH_LEN_CONTEXTS-1)].encode(matchLen);
}
// update hash with this match
window.getIndex(s, matchLen);
inSize += matchLen;
matchContext <<= 1;
if (matchLen > 0) { matchContext |= 1; }
// XXX: LZMA uses a special "delta match" context here if matchLen==0
// XXX: it also uses the offset as context for the length (or vice-versa)
}
// always encode a literal after a match
var context1 = window.get(window.pos-1);
if (ch===Stream.EOF) {
if (fileSize < 0) {
huffLiteral.encode(256, context1);
}
break;
}
huffLiteral.encode(ch, context1);
window.put(ch);
inSize++;
}
if (flush) flush();
});
/**
* Decompress using modified LZP3 algorithm.
*/
Lzp3.decompressFile = Util.decompressFileHelper(Lzp3.MAGIC, function(inStream, outStream, fileSize) {
var flags = inStream.readByte();
var use_huffman_code = !!(flags & 0x80);
// sliding window & hash table
var window = new Window( (fileSize>=0) ? fileSize : WINDOW_SIZE );
var coderFactory, sparseCoderFactory, finish;
if (use_huffman_code) {
// Huffman contexts
var bitstream = new BitStream(inStream);
coderFactory = Huffman.factory(bitstream, MAX16);
sparseCoderFactory = NoModel.factory(bitstream);
} else { // range encoder
var range = new RangeCoder(inStream);
range.decodeStart(true/* skip initial read */);
coderFactory = FenwickModel.factory(range, MODEL_MAX_PROB, MODEL_INCREMENT);
if (USE_DEFSUM) {
coderFactory = DefSumModel.factory(range, true /* decoder */);
}
// switch sparseCoderFactory to a NoModel when size > cutoff
var noCoderFactory = NoModel.factory(range);
sparseCoderFactory = function(size) {
if (size > LENGTH_MODEL_CUTOFF) {
return noCoderFactory(size);
}
return coderFactory(size);
};
finish = function() { range.decodeFinish(); };
}
var huffLiteral= new Context1Model(coderFactory, 256,
(fileSize<0) ? 257 : 256);
var huffLen = [], i;
for (i=0; i<MATCH_LEN_CONTEXTS; i++) {
huffLen[i] = new LogDistanceModel(MAX_MATCH_LEN+1, 1,
coderFactory, sparseCoderFactory);
}
var s, ch, outSize = 0, matchContext = 0;
while (outSize !== fileSize) {
s = window.pos;
var p = window.getIndex(s, 0);
if (p !== 0) {
p--; // p=0 is used for 'not here'. p=1 really means WINDOW_SIZE
var prevMatchLen = (p >>> LOG_WINDOW_SIZE) + 1;
var matchLen = huffLen[matchContext&(MATCH_LEN_CONTEXTS-1)].decode();
if (matchLen < 0) { matchLen = prevMatchLen; }
// copy characters!
for (i=0; i<matchLen; i++) {
ch = window.get(p + i);
outStream.writeByte(window.put(ch));
}
window.getIndex(s, matchLen);
outSize += matchLen;
matchContext <<= 1;
if (matchLen > 0) matchContext |= 1;
}
// literal always follows match (or failed match)
if (outSize === fileSize) {
break; // EOF
}
var context1 = window.get(window.pos-1);
ch = huffLiteral.decode(context1);
if (ch === 256) {
break; // EOF
}
outStream.writeByte(window.put(ch));
outSize++;
}
if (finish) finish();
});
return Lzp3;
};
module.exports = body_fn.apply(null, libs);
},{"./BitStream":123,"./Context1Model":126,"./DefSumModel":127,"./FenwickModel":131,"./Huffman":132,"./LogDistanceModel":134,"./NoModel":139,"./RangeCoder":141,"./Stream":143,"./Util":144}],138:[function(require,module,exports){
/** Simple range coding model w/ escape, suitable for sparse symbol sets.
* Uses a move-to-front list, which is simple and relatively performant,
* but slows down a lot if you want to try to model escapes more precisely
* (which is why this feature is disabled by default).
*/
var libs = [
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (RangeCoder,Stream,Util){
var DEFAULT_MAX_PROB = 0xFF00;
var DEFAULT_INCREMENT= 0x0100;
var NUMERIC_SORT = function(a, b) { return a - b; };
var MTFModel = function(coder, size, max_prob, increment, betterEscape) {
this.coder = coder;
this.increment = (+increment) || DEFAULT_INCREMENT;
this.max_prob = (+max_prob) || DEFAULT_MAX_PROB;
console.assert((this.max_prob + (this.increment-1)) <= 0xFFFF);
this.sym = Util.makeU16Buffer(size+1);
this.prob= Util.makeU16Buffer(size+2);
this.sym[0] = size; // escape code
this.prob[0]= 0;
this.seenSyms = 1;
// total probability always found in this.prob[this.seenSyms]
this.prob[this.seenSyms] = this.increment;
this.numSyms = size;
if (betterEscape) {
this.sortedSeen = [size];
}
};
MTFModel.factory = function(coder, max_prob, increment, betterEscape) {
return function(size) {
return new MTFModel(coder, size, max_prob, increment, betterEscape);
};
};
MTFModel.prototype.clone = function() {
var newModel = new MTFModel(this.coder, this.numSyms, this.max_prob,
this.increment, !!this.sortedSeen);
var i;
for (i=0; i<this.seenSyms; i++) {
newModel.sym[i] = this.sym[i];
newModel.prob[i] = this.prob[i];
}
newModel.prob[i] = this.prob[i]; // total probability
newModel.seenSyms = this.seenSyms;
if (this.sortedSeen) {
newModel.sortedSeen = this.sortedSeen.slice(0);
}
return newModel;
};
MTFModel.prototype._update = function(symbol, index, sy_f) {
var j, tot_f;
// move this symbol to the end
for (j=index; j<this.seenSyms-1; j++) {
this.sym[j] = this.sym[j+1];
this.prob[j] = this.prob[j+1] - sy_f;
}
if (index < this.seenSyms) {
this.sym[j] = symbol;
this.prob[j] = this.prob[j+1] - sy_f;
// increase frequency for this symbol, and total freq at same time
this.prob[this.seenSyms] = tot_f =
this.prob[this.seenSyms] + this.increment;
if (symbol === this.numSyms && this.seenSyms >= this.numSyms) {
// this is the last time we'll see an escape! remove it.
tot_f = this.prob[--this.seenSyms];
if (this.sortedSeen) { this.sortedSeen.length--; }
}
} else { // add to the end
tot_f = this.prob[this.seenSyms];
this.sym[index] = symbol;
this.prob[index] = tot_f;
tot_f += this.increment;
this.prob[++this.seenSyms] = tot_f;
if (this.sortedSeen) {
this.sortedSeen.push(symbol);
// hopefully sort is very fast on a mostly-sorted array
this.sortedSeen.sort(NUMERIC_SORT);
}
}
if (tot_f >= this.max_prob) { this._rescale(); }
return;
};
MTFModel.prototype._rescale = function() {
var i, j, total=0;
var noEscape = true;
if (this.sortedSeen) { this.sortedSeen.length = 0; }
for(i=0, j=0; i<this.seenSyms; i++) {
var sym = this.sym[i];
var sy_f = this.prob[i+1] - this.prob[i];
sy_f >>>= 1;
if (sy_f > 0) {
if (sym === this.numSyms) {
noEscape = false;
}
this.sym[j] = sym;
this.prob[j++] = total;
total += sy_f;
if (this.sortedSeen) { this.sortedSeen.push(sym); }
}
}
this.prob[j] = total;
this.seenSyms = j;
if (this.sortedSeen) {
this.sortedSeen.sort(NUMERIC_SORT);
}
// don't allow escape to go to zero prob if we still need it
if (noEscape && this.seenSyms < this.numSyms) {
// NOTE this adds this.increment to escape freq; the FenwickModel
// just adds one.
this._update(this.numSyms/*escape*/, this.seenSyms/*at end*/);
}
};
MTFModel.prototype.decode = function() {
var tot_f = this.prob[this.seenSyms];
var prob = this.coder.decodeCulFreq(tot_f);
// we're expecting to find the probability near the "most recent" side
// of our array
var i;
for (i=this.seenSyms-1; i>=0; i--) {
if (this.prob[i] <= prob /*&& prob < this.prob[i+1]*/)
break;
}
console.assert(i>=0);
var symbol = this.sym[i];
var lt_f = this.prob[i];
var sy_f = this.prob[i + 1] - lt_f;
this.coder.decodeUpdate(sy_f, lt_f, tot_f);
this._update(symbol, i, sy_f);
if (symbol === this.numSyms) {
/* this is an escape */
/* decode the literal */
sy_f = 1;
tot_f = this.numSyms;
if (this.sortedSeen) {
// do a slower, but more precise decoding of the literal
// by excluding the already-seen symbols.
var seen = this.sortedSeen;
tot_f = this.numSyms - this.seenSyms;
if (seen[seen.length-1] === this.numSyms) { tot_f++; }
symbol = lt_f = this.coder.decodeCulFreq(tot_f);
for (i=0; i < seen.length && seen[i] <= symbol ; i++) {
symbol++;
}
} else {
symbol = lt_f = this.coder.decodeCulFreq(tot_f);
}
this.coder.decodeUpdate(sy_f, lt_f, tot_f);
this._update(symbol, this.seenSyms);
}
return symbol;
};
MTFModel.prototype.encode = function(symbol) {
// look for symbol, from most-recent to oldest
var i, sy_f, lt_f, tot_f;
for (i=this.seenSyms-1; i>=0; i--) {
if (symbol === this.sym[i]) {
// ok, found it.
lt_f = this.prob[i];
sy_f = this.prob[i + 1] - lt_f;
tot_f = this.prob[this.seenSyms];
this.coder.encodeFreq(sy_f, lt_f, tot_f);
return this._update(symbol, i, sy_f);
}
}
// couldn't find this symbol. encode as escape.
console.assert(symbol !== this.numSyms); // catch infinite recursion
this.encode(this.numSyms); // guaranteed to be found in the table.
// code symbol as literal
sy_f = 1;
lt_f = symbol;
tot_f = this.numSyms;
if (this.sortedSeen) {
// do a slower, but more precise encoding of the literal
// by excluding the already-seen symbols.
var seen = this.sortedSeen;
tot_f -= this.seenSyms;
if (seen[seen.length-1] === this.numSyms) { tot_f++; }
for (i=0; i < seen.length && seen[i] < symbol; i++) {
lt_f--;
}
}
this.coder.encodeFreq(sy_f, lt_f, tot_f);
// now add symbol to the end.
return this._update(symbol, this.seenSyms);
};
MTFModel.MAGIC = 'mtfm';
/** Simple order-0 compressor, as self-test. */
MTFModel.compressFile = Util.compressFileHelper(MTFModel.MAGIC, function(inStream, outStream, fileSize, props, finalByte) {
var range = new RangeCoder(outStream);
range.encodeStart(finalByte, 1);
var model = new MTFModel(range, (fileSize<0) ? 257 : 256);
Util.compressWithModel(inStream, fileSize, model);
range.encodeFinish();
}, true);
/** Simple order-0 decompresser, as self-test. */
MTFModel.decompressFile = Util.decompressFileHelper(MTFModel.MAGIC, function(inStream, outStream, fileSize) {
var range = new RangeCoder(inStream);
range.decodeStart(true/*we already read the 'free' byte*/);
var model = new MTFModel(range, (fileSize<0) ? 257 : 256);
Util.decompressWithModel(outStream, fileSize, model);
range.decodeFinish();
});
return MTFModel;
};
module.exports = body_fn.apply(null, libs);
},{"./RangeCoder":141,"./Stream":143,"./Util":144}],139:[function(require,module,exports){
/** Simple "lack of model" -- just encode the bits directly.
* Useful especially with sparse spaces or Huffman coders where there's
* no obvious prediction to be made that will pay for itself.
*/
var libs = [
require('./BitStream'),
require('./Util')
];
var body_fn = function (BitStream,Util) {
var NoModel = function(bitstream, size) {
this.bitstream = bitstream;
this.bits = Util.fls(size-1);
};
NoModel.factory = function(bitstream) {
return function(size) { return new NoModel(bitstream, size); };
};
NoModel.prototype.encode = function(symbol) {
var i;
for (i=this.bits-1; i>=0; i--) {
var b = (symbol >>> i) & 1;
this.bitstream.writeBit(b);
}
};
NoModel.prototype.decode = function() {
var i, r = 0;
for (i=this.bits-1; i>=0; i--) {
r <<= 1;
if (this.bitstream.readBit()) r++;
}
return r;
};
/** Brain-dead self-test. */
NoModel.MAGIC = 'nomo';
NoModel.compressFile = Util.compressFileHelper(NoModel.MAGIC, function(inStream, outStream, fileSize, props) {
var bitstream = new BitStream(outStream);
var model = new NoModel(bitstream, (fileSize<0) ? 257 : 256);
Util.compressWithModel(inStream, fileSize, model);
bitstream.flush();
});
NoModel.decompressFile = Util.decompressFileHelper(NoModel.MAGIC, function(inStream, outStream, fileSize) {
var bitstream = new BitStream(inStream);
var model = new NoModel(bitstream, (fileSize<0) ? 257 : 256);
Util.decompressWithModel(outStream, fileSize, model);
});
return NoModel;
};
module.exports = body_fn.apply(null, libs);
},{"./BitStream":123,"./Util":144}],140:[function(require,module,exports){
/** Particularly simple-minded implementation of PPM compression. */
var libs = [
require('./RangeCoder'),
require('./Util')
];
var body_fn = function (RangeCoder,Util) {
var MAX_CONTEXT = 5;
var LOG_WINDOW_SIZE = 18;
var WINDOW_SIZE = 1 << LOG_WINDOW_SIZE;
var Window = function() {
this.buffer = Util.makeU8Buffer(WINDOW_SIZE);
this.pos = 0;
this.firstPass = true;
for (var i=0; i<MAX_CONTEXT; i++) {
this.put('cSaCsA'.charCodeAt(i%6));
}
};
Window.prototype.put = function(_byte) {
this.buffer[this.pos++] = _byte;
if (this.pos >= WINDOW_SIZE) { this.pos = 0; this.firstPass = false; }
return _byte;
};
Window.prototype.get = function(pos) {
return this.buffer[pos & (WINDOW_SIZE-1)];
};
// the context ending just before 'pos'
Window.prototype.context = function(pos, n) {
var c = [], i;
pos = (pos - n) & (WINDOW_SIZE-1);
for (i=0; i<n; i++) {
c.push(this.buffer[pos++]);
if (pos >= WINDOW_SIZE) { pos = 0; }
}
return String.fromCharCode.apply(String, c);
};
var DMM_INCREMENT = 0x100, DMM_MAX_PROB = 0xFF00;
var PPM = function(coder, size) {
this.window = new Window();
this.contexts = Object.create(null);
// brain-dead '-1' context, using full exclusion
var Cm1Context = function() { };
Cm1Context.prototype.encode = function(symbol, exclude) {
var i, lt_f = 0;
for (i=0; i<symbol; i++) {
if (!exclude[i]) {
lt_f++;
}
}
var tot_f = size - exclude.total;
coder.encodeFreq(1, lt_f, tot_f);
};
Cm1Context.prototype.decode = function(exclude) {
var i, symbol, lt_f;
var tot_f = size - exclude.total;
symbol = lt_f = coder.decodeCulFreq(tot_f);
for (i=0; i<=symbol; i++) {
if (exclude[i]) {
symbol++;
}
}
coder.decodeUpdate(1, lt_f, tot_f);
return symbol;
};
this.cm1coder = new Cm1Context();
var DenseMTFModel = function() {
this.sym = [size];
this.prob= [0, DMM_INCREMENT];
this.refcount = 0;
};
DenseMTFModel.prototype._rescale = function() {
var seenSyms = this.sym.length;
var i, j, total=0;
var noEscape = true;
for(i=0, j=0; i<seenSyms; i++) {
var sym = this.sym[i];
var sy_f = this.prob[i+1] - this.prob[i];
sy_f >>>= 1;
if (sy_f > 0) {
if (sym === size) {
noEscape = false;
}
this.sym[j] = sym;
this.prob[j++] = total;
total += sy_f;
}
}
this.prob[j] = total;
seenSyms = this.sym.length = j;
this.prob.length = seenSyms + 1;
// don't allow escape to go to zero prob if we still need it
if (noEscape && seenSyms < size) {
total = this._update(size/*escape*/, seenSyms/*at end*/, 0, 1);
}
return total;
};
DenseMTFModel.prototype.update = function(symbol, incr) {
// find symbol
var i=0;
for (i=0; i<this.sym.length; i++) {
if (this.sym[i] === symbol) {
return this._update(symbol, i, this.prob[i+1] - this.prob[i], incr);
}
}
// symbol escaped
return this._update(symbol, i, 0, incr);
};
DenseMTFModel.prototype._update = function(symbol, index, sy_f, incr) {
var seenSyms = this.sym.length;
var i, j, tot_f;
// move this symbol to the end
for (j=index; j<seenSyms-1; j++) {
this.sym[j] = this.sym[j+1];
this.prob[j] = this.prob[j+1] - sy_f;
}
// "method D" -- if we add a new escaped symbol, escape & the symbol
// both increase by 1/2.
if (index < seenSyms) {
this.sym[j] = symbol;
this.prob[j] = this.prob[j+1] - sy_f;
// increase frequency for this symbol, and total freq at same time
this.prob[seenSyms] = tot_f =
this.prob[seenSyms] + incr;
} else { // add to the end
tot_f = this.prob[seenSyms];
this.sym[index] = symbol;
this.prob[index] = tot_f;
tot_f += incr;
this.prob[++seenSyms] = tot_f;
// remove probability of escape if table just filled up
if (this.sym.length > size) {
for (i=0; i<seenSyms; i++) {
if (size === this.sym[i]) {
// found it.
this._update(size, i, this.prob[i+1] - this.prob[i], -1);
this.sym.length--;
this.prob.length--;
tot_f = this.prob[this.prob.length-1];
}
}
}
}
if (tot_f >= DMM_MAX_PROB) { tot_f = this._rescale(); }
return tot_f;
};
DenseMTFModel.prototype.encode = function(symbol, exclude) {
// look for symbol, from most-recent to oldest
var i, j, sy_f, lt_f, tot_f, seenSyms = this.sym.length;
var ex_seen = 0, ex_lt_f = 0, ex_tot_f = 0, ex_sy_f;
for (i=seenSyms-1; i>=0; i--) {
lt_f = this.prob[i];
sy_f = this.prob[i + 1] - lt_f;
if (symbol === this.sym[i]) {
// ok, found it.
// count up the rest of the probabilities
for (j=i-1; j>=0 && ex_seen < exclude.total; j--) {
if (exclude[this.sym[j]]) {
ex_seen += 1;
ex_sy_f = this.prob[j+1] - this.prob[j];
ex_lt_f += ex_sy_f;
ex_tot_f += ex_sy_f;
}
}
tot_f = this.prob[seenSyms];
// adjust by excluded symbols
lt_f -= ex_lt_f;
tot_f -= ex_tot_f;
coder.encodeFreq(sy_f, lt_f, tot_f);
if (symbol === size) { // only update table for escapes
this._update(symbol, i, sy_f, DMM_INCREMENT/2);
return false; // escape.
} // otherwise we'll do update later
return true; // encoded character!
} else if (exclude[this.sym[i]]) {
ex_seen += 1;
ex_tot_f += sy_f;
}
}
// couldn't find this symbol. encode as escape.
this.encode(size, exclude);
// add symbols to exclusion table
console.assert(this.sym[this.sym.length-1] === size);//escape
for (i=0; i<this.sym.length-1; i++) {
if (!exclude[this.sym[i]]) {
exclude[this.sym[i]] = true;
exclude.total++;
}
}
};
DenseMTFModel.prototype.decode = function(exclude) {
var seenSyms = this.sym.length;
var tot_f = this.prob[seenSyms];
var ex_seen = 0, ex_lt_f = 0, ex_tot_f = 0, ex_sy_f;
var i;
for (i=seenSyms-1; i>=0 && ex_seen < exclude.total; i--) {
if (exclude[this.sym[i]]) {
ex_seen += 1;
ex_tot_f += this.prob[i+1] - this.prob[i];
}
}
var prob = coder.decodeCulFreq(tot_f - ex_tot_f) + ex_tot_f;
// we're expecting to find the probability near the "most recent" side
// of our array
ex_lt_f = ex_tot_f;
for (i=seenSyms-1; i>=0; i--) {
if (exclude[this.sym[i]]) {
ex_sy_f = this.prob[i+1] - this.prob[i];
ex_lt_f -= ex_sy_f;
prob -= ex_sy_f;
} else if (this.prob[i] <= prob /*&& prob < this.prob[i+1]*/)
break;
}
console.assert(i>=0);
var symbol = this.sym[i];
var lt_f = this.prob[i];
var sy_f = this.prob[i + 1] - lt_f;
coder.decodeUpdate(sy_f, lt_f - ex_lt_f, tot_f - ex_tot_f);
// defer update
if (symbol < size) { return symbol; }
// an escape
this._update(symbol, i, sy_f, DMM_INCREMENT/2);
// add symbols to exclusion table
console.assert(this.sym[this.sym.length-1] === size);//escape
for (i=0; i<this.sym.length-1; i++) {
if (!exclude[this.sym[i]]) {
exclude[this.sym[i]] = true;
exclude.total++;
}
}
return -1;
};
this.newContext = function(initialSymbol) {
return new DenseMTFModel();
};
this.newExclude = function() {
var result = Object.create(null);
result.total = 0; // no excluded symbols (yet)
return result;
};
// set up some initial contexts
(function() {
var i, j;
for (i=0; i<MAX_CONTEXT; i++) {
for (j=0; j<=i; j++) {
var cc = this.window.context(j+((MAX_CONTEXT-1)-i), j);
if (!this.contexts[cc]) { this.contexts[cc] = this.newContext(); }
this.contexts[cc].refcount++;
}
}
}).call(this);
};
PPM.prototype.update = function(symbol, contextString, matchLevel) {
// slide up the contexts, updating them
var model, c, cc;
for (c=0; c <= MAX_CONTEXT; c++) {
cc = contextString.slice(MAX_CONTEXT - c);
model = this.contexts[cc];
if (!model) {
model = this.contexts[cc] = this.newContext();
}
if (c >= matchLevel) {
// only update useful contexts
model.update(symbol, DMM_INCREMENT / 2);
}
// refcount all contexts, whether used/updated or not
model.refcount++;
}
// now garbage-collect old contexts
contextString = this.window.context(this.window.pos + MAX_CONTEXT,
MAX_CONTEXT);
var firstPass = this.window.firstPass;
for (c=MAX_CONTEXT; c>=0 && !firstPass; c--) {
cc = contextString.slice(0, c);
model = this.contexts[cc];
console.assert(model);
if ((--model.refcount) <= 0) {
console.assert(cc !== ''); // don't allow context-0 to be gc'ed!
delete this.contexts[cc];
}
}
// ok, advance window.
this.window.put(symbol);
};
PPM.prototype.decode = function() {
var contextString = this.window.context(this.window.pos, MAX_CONTEXT);
var exclude = this.newExclude();
var model, c, cc, symbol;
for (c=MAX_CONTEXT; c>=0; c--) {
cc = contextString.slice(MAX_CONTEXT - c);
model = this.contexts[cc];
if (model) {
symbol = model.decode(exclude);
if (symbol >= 0) {
this.update(symbol, contextString, c);
return symbol;
}
}
}
// still no match, fall back to context -1
symbol = this.cm1coder.decode(exclude);
this.update(symbol, contextString, c);
return symbol;
};
PPM.prototype.encode = function(symbol) {
var contextString = this.window.context(this.window.pos, MAX_CONTEXT);
var exclude = this.newExclude();
var c;
for (c=MAX_CONTEXT; c>=0; c--) {
var cc = contextString.slice(MAX_CONTEXT - c);
var model = this.contexts[cc];
if (model) {
var success = model.encode(symbol, exclude);
if (success) {
this.update(symbol, contextString, c);
return;
}
}
}
// fall back to context -1 (but still use exclusion table)
this.cm1coder.encode(symbol, exclude);
this.update(symbol, contextString, c);
return;
};
PPM.MAGIC = 'ppm2';
PPM.compressFile = Util.compressFileHelper(PPM.MAGIC, function(inStream, outStream, fileSize, props, finalByte) {
var range = new RangeCoder(outStream);
range.encodeStart(finalByte, 1);
var model = new PPM(range, (fileSize<0) ? 257 : 256);
Util.compressWithModel(inStream, fileSize, model);
range.encodeFinish();
}, true);
PPM.decompressFile = Util.decompressFileHelper(PPM.MAGIC, function(inStream, outStream, fileSize) {
var range = new RangeCoder(inStream);
range.decodeStart(true/*we already read the 'free' byte*/);
var model = new PPM(range, (fileSize<0) ? 257 : 256);
Util.decompressWithModel(outStream, fileSize, model);
range.decodeFinish();
});
return PPM;
};
module.exports = body_fn.apply(null, libs);
},{"./RangeCoder":141,"./Util":144}],141:[function(require,module,exports){
/* Range Coder. Inspired by rangecod.c from rngcod13.zip from
* http://www.compressconsult.com/rangecoder/
* This JavaScript version is:
* Copyright (c) 2013 C. Scott Ananian.
*/
var libs = [
];
var body_fn = function (){
// Uses 32-bit integer math. Hopefully the JavaScript runtime figures
// that out. ;)
// see https://github.com/kripken/emscripten/wiki/LLVM-Types-in-JavaScript
// for some hints on doing 32-bit unsigned match in JavaScript.
// One key is the use of ">>>0" to change a signed result to unsigned.
var CODE_BITS = 32;
var Top_value = Math.pow(2, CODE_BITS-1);
var SHIFT_BITS = (CODE_BITS - 9);
var EXTRA_BITS = ((CODE_BITS-2) % 8 + 1);
var Bottom_value = (Top_value >>> 8);
var MAX_INT = Math.pow(2, CODE_BITS) - 1;
/* it is highly recommended that the total frequency count is less */
/* than 1 << 19 to minimize rounding effects. */
/* the total frequency count MUST be less than 1<<23 */
var RangeCoder = function(stream) {
this.low = 0; /* low end of interval */
this.range = Top_value; /* length of interval */
this.buffer = 0; /* buffer for input/output */
this.help = 0; /* bytes_to_follow / intermediate value */
this.bytecount = 0; /* counter for output bytes */
this.stream = stream;
};
/* Do the normalization before we need a defined state, instead of
* after messing it up. This simplifies starting and ending. */
var enc_normalize = function(rc, outputStream) {
while (rc.range <= Bottom_value) { /* do we need renormalization? */
if (rc.low < (0xFF << SHIFT_BITS)) {//no carry possible, so output
outputStream.writeByte(rc.buffer);
for (; rc.help; rc.help--)
outputStream.writeByte(0xFF);
rc.buffer = (rc.low >>> SHIFT_BITS) & 0xFF;
} else if (rc.low & Top_value) { /* carry now, no future carry */
outputStream.writeByte(rc.buffer+1);
for (; rc.help; rc.help--)
outputStream.writeByte(0x00);
rc.buffer = (rc.low >>> SHIFT_BITS) & 0xFF;
} else {
rc.help++;
if (rc.help > MAX_INT)
throw new Error("Too many bytes outstanding, "+
"file too large!");
}
rc.range = (rc.range << 8) >>> 0;/*ensure result remains positive*/
rc.low = ((rc.low << 8) & (Top_value - 1)) >>> 0; /* unsigned */
rc.bytecount++;
}
};
/* Start the encoder */
/* c is written as the first byte in the datastream.
* one could do w/o, but then you have an additional if per output byte */
RangeCoder.prototype.encodeStart = function(c, initlength) {
this.low = 0;
this.range = Top_value;
this.buffer = c;
this.help = 0;
this.bytecount = initlength;
};
/* Encode a symbol using frequencies */
/* rc is the range coder to be used */
/* sy_f is the interval length (frequency of the symbol) */
/* lt_f is the lower end (frequency sum of < symbols) */
/* tot_f is the total interval length (total frequency sum) */
/* or (faster): tot_f = (code_value)1<<shift */
RangeCoder.prototype.encodeFreq = function(sy_f, lt_f, tot_f) {
enc_normalize(this, this.stream);
var r = (this.range / tot_f) >>> 0; // note coercion to integer
var tmp = r * lt_f;
this.low += tmp;
if ((lt_f + sy_f) < tot_f) {
this.range = r * sy_f;
} else {
this.range -= tmp;
}
};
RangeCoder.prototype.encodeShift = function(sy_f, lt_f, shift) {
enc_normalize(this, this.stream);
var r = this.range >>> shift;
var tmp = r * lt_f;
this.low += tmp;
if ((lt_f + sy_f) >>> shift) {
this.range -= tmp;
} else {
this.range = r * sy_f;
}
};
/* Encode a bit w/o modelling. */
RangeCoder.prototype.encodeBit = function(b) {
this.encodeShift(1, b?1:0, 1);
};
/* Encode a byte w/o modelling. */
RangeCoder.prototype.encodeByte = function(b) {
this.encodeShift(1, b, 8);
};
/* Encode a short w/o modelling. */
RangeCoder.prototype.encodeShort = function(s) {
this.encodeShift(1, s, 16);
};
/* Finish encoding */
/* returns number of bytes written */
RangeCoder.prototype.encodeFinish = function() {
var outputStream = this.stream;
enc_normalize(this, outputStream);
this.bytecount += 5;
var tmp = this.low >>> SHIFT_BITS;
if ((this.low & (Bottom_value-1)) >= ((this.bytecount&0xFFFFFF)>>>1)) {
tmp++;
}
if (tmp > 0xFF) { /* we have a carry */
outputStream.writeByte(this.buffer + 1);
for (; this.help; this.help--)
outputStream.writeByte(0x00);
} else { /* no carry */
outputStream.writeByte(this.buffer);
for (; this.help; this.help--)
outputStream.writeByte(0xFF);
}
outputStream.writeByte(tmp & 0xFF);
// XXX: i'm pretty sure these could be three arbitrary bytes
// they are consumed by the decoder at the end
outputStream.writeByte((this.bytecount >>> 16) & 0xFF);
outputStream.writeByte((this.bytecount >>> 8) & 0xFF);
outputStream.writeByte((this.bytecount ) & 0xFF);
return this.bytecount;
};
/* Start the decoder; you need to provide the *second* byte from the
* datastream. (The first byte was provided to startEncoding and is
* ignored by the decoder.)
*/
RangeCoder.prototype.decodeStart = function(skipInitialRead) {
var c = skipInitialRead ? 0 : this.stream.readByte();
if (typeof(c) !== 'number' || c < 0) {
return c; // EOF
}
this.buffer = this.stream.readByte();
this.low = this.buffer >>> (8 - EXTRA_BITS);
this.range = 1 << EXTRA_BITS;
return c;
};
var dec_normalize = function(rc, inputStream) {
while (rc.range <= Bottom_value) {
rc.low = (rc.low << 8) | ((rc.buffer << EXTRA_BITS) & 0xFF);
/* rc.low could be negative here; don't fix it quite yet */
rc.buffer = inputStream.readByte();
rc.low |= rc.buffer >>> (8-EXTRA_BITS);
rc.low = rc.low >>> 0; /* fix it now */
rc.range = (rc.range << 8) >>> 0; /* ensure stays positive */
}
};
/* Calculate cumulative frequency for next symbol. Does NO update!*/
/* rc is the range coder to be used */
/* tot_f is the total frequency */
/* or: totf is (code_value)1<<shift */
/* returns the <= cumulative frequency */
RangeCoder.prototype.decodeCulFreq = function(tot_f) {
dec_normalize(this, this.stream);
this.help = (this.range / tot_f) >>> 0; // note coercion to integer
var tmp = (this.low / this.help) >>> 0; // again
return (tmp >= tot_f ? tot_f-1 : tmp);
};
RangeCoder.prototype.decodeCulShift = function(shift) {
dec_normalize(this, this.stream);
this.help = this.range >>> shift;
var tmp = (this.low / this.help) >>> 0; // coercion to unsigned
// shift is less than 31, so shift below will remain positive
return ((tmp>>>shift) ? (1<<shift)-1 : tmp);
};
/* Update decoding state */
/* rc is the range coder to be used */
/* sy_f is the interval length (frequency of the symbol) */
/* lt_f is the lower end (frequency sum of < symbols) */
/* tot_f is the total interval length (total frequency sum) */
RangeCoder.prototype.decodeUpdate = function(sy_f, lt_f, tot_f) {
var tmp = this.help * lt_f; // should not overflow!
this.low -= tmp;
if (lt_f + sy_f < tot_f) {
this.range = (this.help * sy_f);
} else {
this.range -= tmp;
}
};
/* Decode a bit w/o modelling. */
RangeCoder.prototype.decodeBit = function() {
var tmp = this.decodeCulShift(1);
this.decodeUpdate(1, tmp, 1<<1);
return tmp;
};
/* decode a byte w/o modelling */
RangeCoder.prototype.decodeByte = function() {
var tmp = this.decodeCulShift(8);
this.decodeUpdate(1, tmp, 1<<8);
return tmp;
};
/* decode a short w/o modelling */
RangeCoder.prototype.decodeShort = function() {
var tmp = this.decodeCulShift(16);
this.decodeUpdate(1, tmp, 1<<16);
return tmp;
};
/* Finish decoding */
RangeCoder.prototype.decodeFinish = function() {
/* normalize to use up all bytes */
dec_normalize(this, this.stream);
};
/** Utility functions */
// bitstream interface
RangeCoder.prototype.writeBit = RangeCoder.prototype.encodeBit;
RangeCoder.prototype.readBit = RangeCoder.prototype.decodeBit;
// stream interface
RangeCoder.prototype.writeByte = RangeCoder.prototype.encodeByte;
RangeCoder.prototype.readByte = RangeCoder.prototype.decodeByte;
return RangeCoder;
};
module.exports = body_fn.apply(null, libs);
},{}],142:[function(require,module,exports){
/* *Very* simple de/compression utility, based on simple_c and simple_d from
* rngcod13.zip at http://www.compressconsult.com/rangecoder/
* Really just a demonstration/test of the rangecoder.
*/
var libs = [
require('./RangeCoder'),
require('./Stream'),
require('./Util')
];
var body_fn = function (RangeCoder,Stream,Util){
var MAX_BLOCK_SIZE = 1<<17;
var Simple = Object.create(null);
Simple.MAGIC = 'smpl';
Simple.compressFile = Util.compressFileHelper(Simple.MAGIC, function(input, output, size, props, finalByte) {
var encoder = new RangeCoder(output);
encoder.encodeStart(finalByte, 1);
// read a block
var block = Util.makeU8Buffer(MAX_BLOCK_SIZE);
var counts = [];
var blockLength = 0, sawEOF = false;
var readBlock = function() {
var pos = 0;
// initialize counts
for (pos=0; pos < 256; pos++) {
counts[pos] = 0;
}
if (sawEOF) {
blockLength = 0;
return;
}
for (pos=0; pos < MAX_BLOCK_SIZE; ) {
var c = input.readByte();
if (c===Stream.EOF) {
sawEOF = true;
break;
}
block[pos++] = c;
counts[c]++;
// bail if some count reaches maximum
if (counts[c]===0xFFFF) {
break;
}
}
blockLength = pos;
};
while (true) {
var i;
readBlock();
if (sawEOF && blockLength===0) {
break;
}
// indicate that there's another block comin'
encoder.encodeBit(true);
// write all the statistics
for (i=0; i<256; i++) {
encoder.encodeShort(counts[i]);
}
// convert counts to cumulative counts
counts[256] = blockLength;
for (i=256; i; i--) {
counts[i-1] = counts[i] - counts[i-1];
}
// encode the symbols using the probability table.
for (i=0; i<blockLength; i++) {
var ch = block[i];
encoder.encodeFreq(counts[ch+1]-counts[ch], counts[ch],
counts[256]);
}
}
// write a stop bit
encoder.encodeBit(false);
// done!
encoder.encodeFinish();
}, true);
Simple.decompressFile = Util.decompressFileHelper(Simple.MAGIC, function(input, output, size) {
var decoder = new RangeCoder(input);
decoder.decodeStart(true/*we already read the 'free' byte*/);
while (decoder.decodeBit()) {
var i, counts = [];
// read all the statistics
for (i=0; i<256; i++) {
counts[i] = decoder.decodeShort();
}
// compute cumulative stats & total block size
var blocksize = 0;
for (i=0; i<256; i++) {
var tmp = counts[i];
counts[i] = blocksize;
blocksize += tmp;
}
counts[256] = blocksize;
for (i=0; i<blocksize; i++) {
var cf = decoder.decodeCulFreq(blocksize);
// inefficient way to look up the symbol.
var symbol;
for (symbol=0; symbol<256; symbol++)
// careful, there are length-0 ranges
// (where counts[symbol]===counts[symbol+1])
if (counts[symbol]<=cf && cf < counts[symbol+1])
break;
var ch = symbol;
decoder.decodeUpdate(counts[symbol+1] - counts[symbol],
counts[symbol], blocksize);
output.writeByte(symbol);
}
}
decoder.decodeFinish();
});
return Simple;
};
module.exports = body_fn.apply(null, libs);
},{"./RangeCoder":141,"./Stream":143,"./Util":144}],143:[function(require,module,exports){
/** Abstract Stream interface, for byte-oriented i/o. */
var libs = [
require('./freeze')
];
var body_fn = function (freeze) {
var EOF = -1;
var Stream = function() {
/* ABSTRACT */
};
// you must define one of read / readByte for a readable stream
Stream.prototype.readByte = function() {
var buf = [ 0 ];
var len = this.read(buf, 0, 1);
if (len===0) { this._eof = true; return EOF; }
return buf[0];
};
Stream.prototype.read = function(buf, bufOffset, length) {
var ch, bytesRead = 0;
while (bytesRead < length) {
ch = this.readByte();
if (ch === EOF) { this._eof = true; break; }
buf[bufOffset+(bytesRead++)] = ch;
}
return bytesRead;
};
// reasonable default implementation of 'eof'
Stream.prototype.eof = function() { return !!this._eof; };
// not all readable streams are seekable
Stream.prototype.seek = function(pos) {
throw new Error('Stream is not seekable.');
};
Stream.prototype.tell = function() {
throw new Error('Stream is not seekable.');
};
// you must define one of write / writeByte for a writable stream
Stream.prototype.writeByte = function(_byte) {
var buf = [ _byte ];
this.write(buf, 0, 1);
};
Stream.prototype.write = function(buf, bufOffset, length) {
var i;
for (i=0; i<length; i++) {
this.writeByte(buf[bufOffset + i]);
}
return length;
};
// flush will happily do nothing if you don't override it.
Stream.prototype.flush = function() { };
// export EOF as a constant.
Stream.EOF = EOF;
return freeze(Stream);
};
module.exports = body_fn.apply(null, libs);
},{"./freeze":145}],144:[function(require,module,exports){
(function (process,Buffer){
/* Some basic utilities, used in a number of places. */
var libs = [
require('./freeze'),
require('./Stream')
];
var body_fn = function (freeze, Stream) {
var Util = Object.create(null);
var EOF = Stream.EOF;
/* Take a buffer, array, or stream, and return an input stream. */
Util.coerceInputStream = function(input, forceRead) {
if (!('readByte' in input)) {
var buffer = input;
input = new Stream();
input.size = buffer.length;
input.pos = 0;
input.readByte = function() {
if (this.pos >= this.size) { return EOF; }
return buffer[this.pos++];
};
input.read = function(buf, bufOffset, length) {
var bytesRead = 0;
while (bytesRead < length && this.pos < buffer.length) {
buf[bufOffset++] = buffer[this.pos++];
bytesRead++;
}
return bytesRead;
};
input.seek = function(pos) { this.pos = pos; };
input.tell = function() { return this.pos; };
input.eof = function() { return this.pos >= buffer.length; };
} else if (forceRead && !('read' in input)) {
// wrap input if it doesn't implement read
var s = input;
input = new Stream();
input.readByte = function() {
var ch = s.readByte();
if (ch === EOF) { this._eof = true; }
return ch;
};
if ('size' in s) { input.size = s.size; }
if ('seek' in s) {
input.seek = function(pos) {
s.seek(pos); // may throw if s doesn't implement seek
this._eof = false;
};
}
if ('tell' in s) {
input.tell = s.tell.bind(s);
}
}
return input;
};
var BufferStream = function(buffer, resizeOk) {
this.buffer = buffer;
this.resizeOk = resizeOk;
this.pos = 0;
};
BufferStream.prototype = Object.create(Stream.prototype);
BufferStream.prototype.writeByte = function(_byte) {
if (this.resizeOk && this.pos >= this.buffer.length) {
var newBuffer = Util.makeU8Buffer(this.buffer.length * 2);
newBuffer.set(this.buffer);
this.buffer = newBuffer;
}
this.buffer[this.pos++] = _byte;
};
BufferStream.prototype.getBuffer = function() {
// trim buffer if needed
if (this.pos !== this.buffer.length) {
if (!this.resizeOk)
throw new TypeError('outputsize does not match decoded input');
var newBuffer = Util.makeU8Buffer(this.pos);
newBuffer.set(this.buffer.subarray(0, this.pos));
this.buffer = newBuffer;
}
return this.buffer;
};
/* Take a stream (or not) and an (optional) size, and return an
* output stream. Return an object with a 'retval' field equal to
* the output stream (if that was given) or else a pointer at the
* internal Uint8Array/buffer/array; and a 'stream' field equal to
* an output stream to use.
*/
Util.coerceOutputStream = function(output, size) {
var r = { stream: output, retval: output };
if (output) {
if (typeof(output)==='object' && 'writeByte' in output) {
return r; /* leave output alone */
} else if (typeof(size) === 'number') {
console.assert(size >= 0);
r.stream = new BufferStream(Util.makeU8Buffer(size), false);
} else { // output is a buffer
r.stream = new BufferStream(output, false);
}
} else {
r.stream = new BufferStream(Util.makeU8Buffer(16384), true);
}
Object.defineProperty(r, 'retval', {
get: r.stream.getBuffer.bind(r.stream)
});
return r;
};
Util.compressFileHelper = function(magic, guts, suppressFinalByte) {
return function(inStream, outStream, props) {
inStream = Util.coerceInputStream(inStream);
var o = Util.coerceOutputStream(outStream, outStream);
outStream = o.stream;
// write the magic number to identify this file type
// (it better be ASCII, we're not doing utf-8 conversion)
var i;
for (i=0; i<magic.length; i++) {
outStream.writeByte(magic.charCodeAt(i));
}
// if we know the size, write it
var fileSize;
if ('size' in inStream && inStream.size >= 0) {
fileSize = inStream.size;
} else {
fileSize = -1; // size unknown
}
if (suppressFinalByte) {
var tmpOutput = Util.coerceOutputStream([]);
Util.writeUnsignedNumber(tmpOutput.stream, fileSize + 1);
tmpOutput = tmpOutput.retval;
for (i=0; i<tmpOutput.length-1; i++) {
outStream.writeByte(tmpOutput[i]);
}
suppressFinalByte = tmpOutput[tmpOutput.length-1];
} else {
Util.writeUnsignedNumber(outStream, fileSize + 1);
}
// call the guts to do the real compression
guts(inStream, outStream, fileSize, props, suppressFinalByte);
return o.retval;
};
};
Util.decompressFileHelper = function(magic, guts) {
return function(inStream, outStream) {
inStream = Util.coerceInputStream(inStream);
// read the magic number to confirm this file type
// (it better be ASCII, we're not doing utf-8 conversion)
var i;
for (i=0; i<magic.length; i++) {
if (magic.charCodeAt(i) !== inStream.readByte()) {
throw new Error("Bad magic");
}
}
// read the file size & create an appropriate output stream/buffer
var fileSize = Util.readUnsignedNumber(inStream) - 1;
var o = Util.coerceOutputStream(outStream, fileSize);
outStream = o.stream;
// call the guts to do the real decompression
guts(inStream, outStream, fileSize);
return o.retval;
};
};
// a helper for simple self-test of model encode
Util.compressWithModel = function(inStream, fileSize, model) {
var inSize = 0;
while (inSize !== fileSize) {
var ch = inStream.readByte();
if (ch === EOF) {
model.encode(256); // end of stream;
break;
}
model.encode(ch);
inSize++;
}
};
// a helper for simple self-test of model decode
Util.decompressWithModel = function(outStream, fileSize, model) {
var outSize = 0;
while (outSize !== fileSize) {
var ch = model.decode();
if (ch === 256) {
break; // end of stream;
}
outStream.writeByte(ch);
outSize++;
}
};
/** Write a number using a self-delimiting big-endian encoding. */
Util.writeUnsignedNumber = function(output, n) {
console.assert(n >= 0);
var bytes = [], i;
do {
bytes.push(n & 0x7F);
// use division instead of shift to allow encoding numbers up to
// 2^53
n = Math.floor( n / 128 );
} while (n !== 0);
bytes[0] |= 0x80; // mark end of encoding.
for (i=bytes.length-1; i>=0; i--) {
output.writeByte(bytes[i]); // write in big-endian order
}
return output;
};
/** Read a number using a self-delimiting big-endian encoding. */
Util.readUnsignedNumber = function(input) {
var n = 0, c;
while (true) {
c = input.readByte();
if (c&0x80) { n += (c&0x7F); break; }
// using + and * instead of << allows decoding numbers up to 2^53
n = (n + c) * 128;
}
return n;
};
// Compatibility thunks for Buffer/TypedArray constructors.
var zerofill = function(a) {
for (var i = 0, len = a.length; i < len; i++) {
a[i] = 0;
}
return a;
};
var fallbackarray = function(size) {
return zerofill(new Array(size));
};
// Node 0.11.6 - 0.11.10ish don't properly zero fill typed arrays.
// See https://github.com/joyent/node/issues/6664
// Try to detect and workaround the bug.
var ensureZeroed = function id(a) { return a; };
if ((typeof(process) !== 'undefined') &&
Array.prototype.some.call(new Uint32Array(128), function(x) {
return x !== 0;
})) {
//console.warn('Working around broken TypedArray');
ensureZeroed = zerofill;
}
/** Portable 8-bit unsigned buffer. */
Util.makeU8Buffer = (typeof(Uint8Array) !== 'undefined') ? function(size) {
// Uint8Array ought to be automatically zero-filled
return ensureZeroed(new Uint8Array(size));
} : (typeof(Buffer) !== 'undefined') ? function(size) {
var b = new Buffer(size);
b.fill(0);
return b;
} : fallbackarray;
/** Portable 16-bit unsigned buffer. */
Util.makeU16Buffer = (typeof(Uint16Array) !== 'undefined') ? function(size) {
// Uint16Array ought to be automatically zero-filled
return ensureZeroed(new Uint16Array(size));
} : fallbackarray;
/** Portable 32-bit unsigned buffer. */
Util.makeU32Buffer = (typeof(Uint32Array) !== 'undefined') ? function(size) {
// Uint32Array ought to be automatically zero-filled
return ensureZeroed(new Uint32Array(size));
} : fallbackarray;
/** Portable 32-bit signed buffer. */
Util.makeS32Buffer = (typeof(Int32Array) !== 'undefined') ? function(size) {
// Int32Array ought to be automatically zero-filled
return ensureZeroed(new Int32Array(size));
} : fallbackarray;
Util.arraycopy = function(dst, src) {
console.assert(dst.length >= src.length);
for (var i = 0, len = src.length; i < len ; i++) {
dst[i] = src[i];
}
return dst;
};
/** Highest bit set in a byte. */
var bytemsb = [
0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 /* 256 */
];
console.assert(bytemsb.length===0x100);
/** Find last set (most significant bit).
* @return the last bit set in the argument.
* <code>fls(0)==0</code> and <code>fls(1)==1</code>. */
var fls = Util.fls = function(v) {
console.assert(v>=0);
if (v > 0xFFFFFFFF) { // use floating-point mojo
return 32 + fls(Math.floor(v / 0x100000000));
}
if ( (v & 0xFFFF0000) !== 0) {
if ( (v & 0xFF000000) !== 0) {
return 24 + bytemsb[(v>>>24) & 0xFF];
} else {
return 16 + bytemsb[v>>>16];
}
} else if ( (v & 0x0000FF00) !== 0) {
return 8 + bytemsb[v>>>8];
} else {
return bytemsb[v];
}
};
/** Returns ceil(log2(n)) */
Util.log2c = function(v) {
return (v===0)?-1:fls(v-1);
};
return freeze(Util); // ensure constants are recognized as such.
};
module.exports = body_fn.apply(null, libs);
}).call(this,require('_process'),require("buffer").Buffer)
},{"./Stream":143,"./freeze":145,"_process":99,"buffer":80}],145:[function(require,module,exports){
var libs = [
];
var body_fn = function (){
'use strict';
// Object.freeze(), or a thunk if that method is not present in this
// JavaScript environment.
if (Object.freeze) {
return Object.freeze;
} else {
return function(o) { return o; };
}
};
module.exports = body_fn.apply(null, libs);
},{}],146:[function(require,module,exports){
var assert = require('assert')
var BigInteger = require('bn').BigInteger
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)
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":150,"assert":75,"bn":71}],147:[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"
}
}
},{}],148:[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":146,"./names":149,"./point":150}],149:[function(require,module,exports){
var BigInteger = require('bn').BigInteger
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":146,"./curves":147,"bn":71}],150:[function(require,module,exports){
(function (Buffer){
var assert = require('assert')
var BigInteger = require('bn').BigInteger
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 x = BigInteger.fromBuffer(buffer.slice(1, 33))
var byteLength = Math.floor((curve.p.bitLength() + 7) / 8)
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":75,"bn":71,"buffer":80}],151:[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);
},{}],152:[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;
},{}],153:[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
};
},{}],154:[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;
},{}],155:[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":151,"./adler32":152,"./crc32":154,"./messages":159,"./trees":160}],156:[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;
};
},{}],157:[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":151,"./adler32":152,"./crc32":154,"./inffast":156,"./inftrees":158}],158:[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":151}],159:[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) */
};
},{}],160:[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":151}],161:[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;
},{}],162:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-e
(function() {
var Encoder, Message, Parser, bufeq_fast, clearsign, compute_crc24, crc24_to_base64, crc_table, decode, encode, formatCheckSum, getCheckSum, katch, make_line, strip, trim, uint_to_buffer, verifyCheckSum, _ref;
_ref = require('./util'), trim = _ref.trim, strip = _ref.strip, katch = _ref.katch, bufeq_fast = _ref.bufeq_fast, uint_to_buffer = _ref.uint_to_buffer;
make_line = function(x) {
if (x == null) {
x = "";
}
return "" + x + "\n";
};
exports.Encoder = Encoder = (function() {
function Encoder(C) {
this.C = C;
}
Encoder.prototype.frame = function(t) {
var dash, i;
dash = ((function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 5; i = ++_i) {
_results.push("-");
}
return _results;
})()).join('');
return {
begin: make_line(dash + ("BEGIN PGP " + t) + dash),
end: make_line(dash + ("END PGP " + t) + dash)
};
};
Encoder.prototype.b64e = function(d) {
var end, i, parts, raw, w;
raw = d.toString('base64');
w = 64;
parts = (function() {
var _i, _ref1, _results;
_results = [];
for (i = _i = 0, _ref1 = raw.length; w > 0 ? _i < _ref1 : _i > _ref1; i = _i += w) {
end = Math.min(i + w, raw.length);
_results.push(raw.slice(i, end));
}
return _results;
})();
return make_line(parts.join("\n"));
};
Encoder.prototype.header = function() {
var x;
return ((function() {
var _i, _len, _ref1, _results;
_ref1 = ["Version: " + this.C.header.version, "Comment: " + this.C.header.comment];
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
x = _ref1[_i];
_results.push(make_line(x));
}
return _results;
}).call(this)).join('');
};
Encoder.prototype.encode = function(type, data) {
var f;
f = this.frame(type);
return f.begin.concat(this.header(), make_line(), this.b64e(data), formatCheckSum(data), f.end);
};
return Encoder;
})();
exports.clearsign_header = clearsign = function(C, data, hasher_name) {
var enc, f;
enc = new Encoder(C);
f = enc.frame("SIGNED MESSAGE").begin;
return f.concat(make_line("Hash: " + hasher_name), make_line(), data);
};
exports.encode = encode = function(C, type, data) {
return (new Encoder(C)).encode(type, data);
};
crc_table = [0x00000000, 0x00864cfb, 0x018ad50d, 0x010c99f6, 0x0393e6e1, 0x0315aa1a, 0x021933ec, 0x029f7f17, 0x07a18139, 0x0727cdc2, 0x062b5434, 0x06ad18cf, 0x043267d8, 0x04b42b23, 0x05b8b2d5, 0x053efe2e, 0x0fc54e89, 0x0f430272, 0x0e4f9b84, 0x0ec9d77f, 0x0c56a868, 0x0cd0e493, 0x0ddc7d65, 0x0d5a319e, 0x0864cfb0, 0x08e2834b, 0x09ee1abd, 0x09685646, 0x0bf72951, 0x0b7165aa, 0x0a7dfc5c, 0x0afbb0a7, 0x1f0cd1e9, 0x1f8a9d12, 0x1e8604e4, 0x1e00481f, 0x1c9f3708, 0x1c197bf3, 0x1d15e205, 0x1d93aefe, 0x18ad50d0, 0x182b1c2b, 0x192785dd, 0x19a1c926, 0x1b3eb631, 0x1bb8faca, 0x1ab4633c, 0x1a322fc7, 0x10c99f60, 0x104fd39b, 0x11434a6d, 0x11c50696, 0x135a7981, 0x13dc357a, 0x12d0ac8c, 0x1256e077, 0x17681e59, 0x17ee52a2, 0x16e2cb54, 0x166487af, 0x14fbf8b8, 0x147db443, 0x15712db5, 0x15f7614e, 0x3e19a3d2, 0x3e9fef29, 0x3f9376df, 0x3f153a24, 0x3d8a4533, 0x3d0c09c8, 0x3c00903e, 0x3c86dcc5, 0x39b822eb, 0x393e6e10, 0x3832f7e6, 0x38b4bb1d, 0x3a2bc40a, 0x3aad88f1, 0x3ba11107, 0x3b275dfc, 0x31dced5b, 0x315aa1a0, 0x30563856, 0x30d074ad, 0x324f0bba, 0x32c94741, 0x33c5deb7, 0x3343924c, 0x367d6c62, 0x36fb2099, 0x37f7b96f, 0x3771f594, 0x35ee8a83, 0x3568c678, 0x34645f8e, 0x34e21375, 0x2115723b, 0x21933ec0, 0x209fa736, 0x2019ebcd, 0x228694da, 0x2200d821, 0x230c41d7, 0x238a0d2c, 0x26b4f302, 0x2632bff9, 0x273e260f, 0x27b86af4, 0x252715e3, 0x25a15918, 0x24adc0ee, 0x242b8c15, 0x2ed03cb2, 0x2e567049, 0x2f5ae9bf, 0x2fdca544, 0x2d43da53, 0x2dc596a8, 0x2cc90f5e, 0x2c4f43a5, 0x2971bd8b, 0x29f7f170, 0x28fb6886, 0x287d247d, 0x2ae25b6a, 0x2a641791, 0x2b688e67, 0x2beec29c, 0x7c3347a4, 0x7cb50b5f, 0x7db992a9, 0x7d3fde52, 0x7fa0a145, 0x7f26edbe, 0x7e2a7448, 0x7eac38b3, 0x7b92c69d, 0x7b148a66, 0x7a181390, 0x7a9e5f6b, 0x7801207c, 0x78876c87, 0x798bf571, 0x790db98a, 0x73f6092d, 0x737045d6, 0x727cdc20, 0x72fa90db, 0x7065efcc, 0x70e3a337, 0x71ef3ac1, 0x7169763a, 0x74578814, 0x74d1c4ef, 0x75dd5d19, 0x755b11e2, 0x77c46ef5, 0x7742220e, 0x764ebbf8, 0x76c8f703, 0x633f964d, 0x63b9dab6, 0x62b54340, 0x62330fbb, 0x60ac70ac, 0x602a3c57, 0x6126a5a1, 0x61a0e95a, 0x649e1774, 0x64185b8f, 0x6514c279, 0x65928e82, 0x670df195, 0x678bbd6e, 0x66872498, 0x66016863, 0x6cfad8c4, 0x6c7c943f, 0x6d700dc9, 0x6df64132, 0x6f693e25, 0x6fef72de, 0x6ee3eb28, 0x6e65a7d3, 0x6b5b59fd, 0x6bdd1506, 0x6ad18cf0, 0x6a57c00b, 0x68c8bf1c, 0x684ef3e7, 0x69426a11, 0x69c426ea, 0x422ae476, 0x42aca88d, 0x43a0317b, 0x43267d80, 0x41b90297, 0x413f4e6c, 0x4033d79a, 0x40b59b61, 0x458b654f, 0x450d29b4, 0x4401b042, 0x4487fcb9, 0x461883ae, 0x469ecf55, 0x479256a3, 0x47141a58, 0x4defaaff, 0x4d69e604, 0x4c657ff2, 0x4ce33309, 0x4e7c4c1e, 0x4efa00e5, 0x4ff69913, 0x4f70d5e8, 0x4a4e2bc6, 0x4ac8673d, 0x4bc4fecb, 0x4b42b230, 0x49ddcd27, 0x495b81dc, 0x4857182a, 0x48d154d1, 0x5d26359f, 0x5da07964, 0x5cace092, 0x5c2aac69, 0x5eb5d37e, 0x5e339f85, 0x5f3f0673, 0x5fb94a88, 0x5a87b4a6, 0x5a01f85d, 0x5b0d61ab, 0x5b8b2d50, 0x59145247, 0x59921ebc, 0x589e874a, 0x5818cbb1, 0x52e37b16, 0x526537ed, 0x5369ae1b, 0x53efe2e0, 0x51709df7, 0x51f6d10c, 0x50fa48fa, 0x507c0401, 0x5542fa2f, 0x55c4b6d4, 0x54c82f22, 0x544e63d9, 0x56d11cce, 0x56575035, 0x575bc9c3, 0x57dd8538];
compute_crc24 = function(input, initval) {
var crc, index, j, _i, _ref1;
if (initval == null) {
initval = 0xB704CE;
}
crc = initval;
index = 0;
while ((input.length - index) > 16) {
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 0)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 1)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 2)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 3)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 4)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 5)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 6)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 7)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 8)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 9)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 10)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 11)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 12)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 13)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 14)) & 0xff];
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index + 15)) & 0xff];
index += 16;
}
for (j = _i = index, _ref1 = input.length; index <= _ref1 ? _i < _ref1 : _i > _ref1; j = index <= _ref1 ? ++_i : --_i) {
crc = (crc << 8) ^ crc_table[((crc >> 16) ^ input.readUInt8(index++)) & 0xff];
}
return crc & 0xffffff;
};
getCheckSum = function(data, pad) {
var ret;
ret = crc24_to_base64(compute_crc24(data), pad);
return ret;
};
exports.crc24_to_base64 = crc24_to_base64 = function(c, pad) {
if (pad == null) {
pad = true;
}
return (pad ? "=" : '') + uint_to_buffer(32, c).slice(1, 4).toString('base64');
};
formatCheckSum = function(data) {
return make_line(getCheckSum(data, true));
};
verifyCheckSum = function(data, checksum) {
return getCheckSum(data, false) === checksum;
};
exports.Message = Message = (function() {
function Message(_arg) {
this.body = _arg.body, this.type = _arg.type, this.comment = _arg.comment, this.version = _arg.version, this.pre = _arg.pre, this.post = _arg.post;
this.lines = [];
this.fields = {};
this.payload = null;
}
Message.prototype.unsplit = function(lines) {
return lines.join("\n");
};
Message.prototype.raw = function() {
return this.unsplit(this.lines);
};
Message.prototype.finish_unframe = function(_arg) {
var post, pre;
pre = _arg.pre, post = _arg.post;
this.pre = this.unsplit(pre);
this.post = this.unsplit(post);
if (this.clearsign != null) {
return this.clearsign.body = this.unsplit(this.clearsign.lines);
}
};
Message.prototype.make_clearsign = function() {
return this.clearsign = {
headers: {},
lines: [],
body: null
};
};
return Message;
})();
exports.Parser = Parser = (function() {
function Parser(data) {
this.init(data);
}
Parser.prototype.init = function(data) {
this.data = Buffer.isBuffer(data) ? data.toString('utf8') : data;
this.lines = this.data.split(/\r?\n/);
this.checksum = null;
this.body = null;
this.type = null;
this.ret = null;
return this.last_type = null;
};
Parser.prototype.parse = function() {
this.ret = new Message({});
this.unframe();
this.pop_headers();
this.parse_type();
this.strip_empties_in_footer();
this.trim_lines();
this.find_checksum();
this.read_body();
this.check_checksum();
return this.ret;
};
Parser.prototype.parse_type = function() {
return this.ret.type = this.ret.fields.type = this.type;
};
Parser.prototype.last_line = function() {
return this.payload.slice(-1)[0];
};
Parser.prototype.mparse = function() {
var go, obj, out;
out = [];
go = true;
while (go) {
this.skip();
if (this.lines.length) {
obj = this.parse();
out.push(obj);
this.init(obj.post);
} else {
go = false;
}
}
return out;
};
Parser.prototype.skip = function() {
var _results;
_results = [];
while (this.lines.length) {
if (this.lines[0].match(/\S+/)) {
break;
}
_results.push(this.lines.shift());
}
return _results;
};
Parser.prototype.read_body = function() {
var dat;
this.ret.payload = this.payload.join("\n");
dat = this.payload.join('');
return this.ret.body = new Buffer(dat, 'base64');
};
Parser.prototype.check_checksum = function() {
this.ret.fields.checksum = this.checksum;
if ((this.checksum != null) && !verifyCheckSum(this.ret.body, this.checksum)) {
throw new Error("checksum mismatch");
}
};
Parser.prototype.pop_headers = function() {
var l, m, _results;
_results = [];
while (this.payload.length) {
l = this.payload.shift();
if ((m = l.match(/Version: (.*)/))) {
_results.push(this.ret.version = m[1]);
} else if ((m = l.match(/Comment: (.*)/)) != null) {
_results.push(this.ret.comment = m[1]);
} else if ((l == null) || (l.length === 0) || (l.match(/^\s+$/))) {
break;
} else {
_results.push(void 0);
}
}
return _results;
};
Parser.prototype.strip_empties_in_footer = function() {
var _ref1, _results;
_results = [];
while ((_ref1 = this.last_line()) != null ? _ref1.match(/^\s*$/) : void 0) {
_results.push(this.payload.pop());
}
return _results;
};
Parser.prototype.trim_lines = function() {
var p;
return this.payload = (function() {
var _i, _len, _ref1, _results;
_ref1 = this.payload;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
p = _ref1[_i];
_results.push(trim(p));
}
return _results;
}).call(this);
};
Parser.prototype.find_checksum = function() {
var l;
if (((l = this.last_line()) != null) && l[0] === '=') {
return this.checksum = this.payload.pop().slice(1);
}
};
Parser.prototype.v_unframe = function(pre) {
return true;
};
Parser.prototype.unframe = function() {
var found_pre, found_pre_clearsign, found_pre_std, go, line, m, payload, post, pre, ret, rxx, rxx_b, rxx_e, stage, type;
rxx_b = /^(-{5}BEGIN PGP (.*?)-{5}.*$)/;
rxx_e = /^(-{5}END PGP (.*?)-{5})(.*)$/m;
rxx = rxx_b;
payload = [];
stage = 0;
type = null;
ret = null;
go = true;
pre = [];
post = [];
found_pre_std = function(l, is_last) {
return pre.push(l);
};
found_pre_clearsign = (function(_this) {
return function(l, is_last) {
return _this.ret.clearsign.lines.push(l);
};
})(this);
found_pre = found_pre_std;
while (this.lines.length && go) {
line = this.lines.shift();
switch (stage) {
case -1:
if ((m = line.match(/^([^:]+): (.*)$/))) {
this.ret.clearsign.headers[m[1].toLowerCase()] = m[2];
} else if (line.match(/^\s*$/)) {
stage++;
found_pre = found_pre_clearsign;
} else {
throw new Error("Bad line in clearsign header");
}
this.ret.lines.push(line);
break;
case 0:
if ((m = line.match(rxx_b)) != null) {
found_pre('', true);
this.ret.lines.push((this.ret.clearsign ? line : m[1]));
if (this.type == null) {
this.type = m[2];
}
this.last_type = m[2];
if (m[2] === "SIGNED MESSAGE") {
stage--;
this.ret.make_clearsign();
} else {
stage++;
}
} else {
if (this.ret.clearsign) {
this.ret.lines.push(line);
}
found_pre(line, false);
}
break;
case 1:
if ((m = line.match(rxx_e))) {
this.ret.lines.push(m[1]);
if (m[2] !== this.last_type) {
throw new Error("type mismatch -- begin " + this.last_type + " w/ end " + m[1]);
}
stage++;
post = [m[3]].concat(this.lines);
this.lines = [];
go = false;
} else {
this.ret.lines.push(line);
payload.push(line);
}
}
}
if (stage === 0) {
throw new Error("no header found");
} else if (stage === 1) {
throw new Error("no tailer found");
} else {
this.payload = payload;
return this.ret.finish_unframe({
pre: pre,
post: post
});
}
};
return Parser;
})();
exports.decode = decode = function(data) {
return katch(function() {
return (new Parser(data)).parse();
});
};
exports.mdecode = decode = function(data) {
return katch(function() {
return (new Parser(data)).mparse();
});
};
exports.compute_crc24 = compute_crc24;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./util":165,"buffer":80}],163:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-e
(function() {
exports.armor = require('./armor');
exports.util = require('./util');
exports.userid = require('./userid');
}).call(this);
},{"./armor":162,"./userid":164,"./util":165}],164:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-e
(function() {
exports.parse = function(input) {
var components, m, x;
components = null;
x = /^([^(<]*?)(?:\s*\((.*?)\))?(?:\s*<(.*?)>)?$/;
if ((m = input.match(x)) != null) {
components = {
username: m[1],
comment: m[2],
email: m[3]
};
}
return components;
};
exports.format = function(d) {
var parts, _ref, _ref1, _ref2;
parts = [];
if ((_ref = d.username) != null ? _ref.length : void 0) {
parts.push(d.username);
}
if ((_ref1 = d.comment) != null ? _ref1.length : void 0) {
parts.push("(" + d.comment + ")");
}
if ((_ref2 = d.email) != null ? _ref2.length : void 0) {
parts.push("<" + d.email + ">");
}
return parts.join(' ');
};
}).call(this);
},{}],165:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var ASP, Canceler, Warnings, assert, assert_no_nulls, asyncify, bufeq_secure, buffer_to_ui8a, bufferify, iced, katch, obj_extract, strip, trim, ui32a_to_ui8a, ui8Ga_to_ui32a, xxd, __iced_k, __iced_k_noop,
__slice = [].slice;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
Canceler = require('iced-error').Canceler;
assert = require('assert');
exports.uint_to_buffer = function(nbits, i) {
var ret;
ret = null;
switch (nbits) {
case 16:
ret = new Buffer(2);
ret.writeUInt16BE(i, 0);
break;
case 32:
ret = new Buffer(4);
ret.writeUInt32BE(i, 0);
break;
case 8:
ret = new Buffer(1);
ret.writeUInt8(i, 0);
break;
default:
throw new Error("Bit types not found: " + nbit);
}
return ret;
};
exports.ASP = ASP = (function() {
function ASP(_arg) {
var canceler, delay, progress_hook;
progress_hook = _arg.progress_hook, delay = _arg.delay, canceler = _arg.canceler;
this._delay = delay != null ? delay : 2;
this._canceler = canceler || (new Canceler());
this._progress_hook = progress_hook || (function(obj) {});
this._section = null;
}
ASP.prototype.section = function(s) {
this._section = s;
return this;
};
ASP.prototype.progress = function(o, cb) {
var err, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
if (this._section) {
o.section = this._section;
}
this._progress_hook(o);
if (cb != null) {
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/pgp-utils/src/util.iced",
funcname: "ASP.progress"
});
_this.delay(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return err = arguments[0];
};
})(),
lineno: 43
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return __iced_k(cb(err));
};
})(this));
} else {
return __iced_k();
}
};
ASP.prototype.delay = function(cb) {
var ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/max/src/keybase/pgp-utils/src/util.iced",
funcname: "ASP.delay"
});
setTimeout(__iced_deferrals.defer({
lineno: 47
}), _this.delay);
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(_this._canceler.err());
};
})(this));
};
ASP.prototype.canceler = function() {
return this._canceler;
};
ASP.prototype.progress_hook = function() {
return this._progress_hook;
};
ASP.make = function(asp) {
return asp || (new ASP({}));
};
return ASP;
})();
exports.Warnings = Warnings = (function() {
function Warnings() {
this._w = [];
}
Warnings.prototype.push = function() {
var args, _ref;
args = 1 <= arguments.length ? __slice.call(arguments, 0) : [];
return (_ref = this._w).push.apply(_ref, args);
};
Warnings.prototype.warnings = function() {
return this._w;
};
return Warnings;
})();
exports.bufeq_fast = function(x, y) {
var i, _i, _ref;
if ((x == null) && (y == null)) {
return true;
}
if ((x == null) || (y == null)) {
return false;
}
if (x.length !== y.length) {
return false;
}
for (i = _i = 0, _ref = x.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
if (x.readUInt8(i) !== y.readUInt8(i)) {
return false;
}
}
return true;
};
exports.bufeq_secure = bufeq_secure = function(x, y) {
var check, i, ret;
ret = (function() {
var _i, _ref;
if ((x == null) && (y == null)) {
return true;
} else if ((x == null) || (y == null)) {
return false;
} else if (x.length !== y.length) {
return false;
} else {
check = 0;
for (i = _i = 0, _ref = x.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
check |= x.readUInt8(i) ^ y.readUInt8(i);
}
return check === 0;
}
})();
return ret;
};
exports.streq_secure = function(x, y) {
var B;
B = function(x) {
if (x != null) {
return bufferify(x);
} else {
return null;
}
};
return bufeq_secure(B(x), B(y));
};
exports.bufferify = bufferify = function(s) {
if (Buffer.isBuffer(s)) {
return s;
} else if (typeof s === 'string') {
return new Buffer(s, 'utf8');
} else {
throw new Error("Cannot convert to buffer: " + s);
}
};
exports.katch = katch = function(fn) {
var e, err, ret;
ret = err = null;
try {
ret = fn();
} catch (_error) {
e = _error;
err = e;
}
return [err, ret];
};
exports.akatch = function(fn, cb) {
return asyncify(katch(fn), cb);
};
exports.buffer_to_ui8a = buffer_to_ui8a = function(b) {
var i, l, ret, _i;
l = b.length;
ret = new Uint8Array(l);
for (i = _i = 0; 0 <= l ? _i < l : _i > l; i = 0 <= l ? ++_i : --_i) {
ret[i] = b.readUInt8(i);
}
return ret;
};
exports.ui32a_to_ui8a = ui32a_to_ui8a = function(v, out) {
var k, w, _i, _len;
if (out == null) {
out = null;
}
out || (out = new Uint8Array(v.length * 4));
k = 0;
for (_i = 0, _len = v.length; _i < _len; _i++) {
w = v[_i];
out[k++] = (w >> 24) & 0xff;
out[k++] = (w >> 16) & 0xff;
out[k++] = (w >> 8) & 0xff;
out[k++] = w & 0xff;
}
return out;
};
exports.ui8a_to_ui32a = ui8Ga_to_ui32a = function(v, out) {
var b, i, k, tmp, _i, _len;
if (out == null) {
out = null;
}
out || (out = new Uint32Array(v.length >> 2));
k = 0;
for (i = _i = 0, _len = v.length; _i < _len; i = _i += 4) {
b = v[i];
tmp = (b << 24) + (v[i + 1] << 16) + (v[i + 2] << 8) + v[i + 3];
out[k++] = tmp;
}
return out;
};
exports.unix_time = function() {
return Math.floor(Date.now() / 1000);
};
exports.json_stringify_sorted = function(o, opts) {
var i, json_safe, lb, o2, sort_fn, space_it, spaces, str;
opts = opts || {};
sort_fn = opts.sort_fn || null;
spaces = opts.spaces || null;
lb = opts.spaces != null ? "\n" : "";
if ((typeof spaces) === "number") {
spaces = ((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= spaces ? _i < spaces : _i > spaces; i = 0 <= spaces ? ++_i : --_i) {
_results.push(" ");
}
return _results;
})()).join("");
}
space_it = function(depth) {
if (spaces == null) {
return "";
}
return "\n" + ((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= depth ? _i < depth : _i > depth; i = 0 <= depth ? ++_i : --_i) {
_results.push(spaces);
}
return _results;
})()).join("");
};
json_safe = function(os, depth) {
var k, keys, s, sp, spp, v;
if (Array.isArray(os)) {
s = "[" + ((function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = os.length; _i < _len; _i++) {
v = os[_i];
_results.push(json_safe(v, depth + 1));
}
return _results;
})()).join(',') + "]";
} else if ((typeof os) === "object") {
if (!os) {
s = JSON.stringify(os);
} else {
sp = space_it(depth);
spp = space_it(depth + 1);
keys = (function() {
var _results;
_results = [];
for (k in os) {
_results.push(k);
}
return _results;
})();
if (sort_fn) {
keys.sort(sort_fn);
} else {
keys.sort();
}
s = "{" + ((function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = keys.length; _i < _len; _i++) {
k = keys[_i];
_results.push(spp + JSON.stringify(k) + ":" + json_safe(os[k], depth + 1));
}
return _results;
})()).join(',') + sp + "}";
}
} else {
s = JSON.stringify(os);
}
return s;
};
str = JSON.stringify(o);
if (str === void 0) {
return str;
} else {
o2 = JSON.parse(str);
return json_safe(o2, 0);
}
};
exports.obj_extract = obj_extract = function(o, keys) {
var k, ret, _i, _len;
ret = {};
for (_i = 0, _len = keys.length; _i < _len; _i++) {
k = keys[_i];
ret[k] = o[k];
}
return ret;
};
exports.base64u = {
encode: function(b) {
return b.toString('base64').replace(/\+/g, '-').replace(/\//g, '_').replace(/=+$/, '');
},
decode: function(b) {
b = (b + Array(5 - b.length % 4).join('=')).replace(/\-/g, '+').replace(/\_/g, '/');
return new Buffer(b, 'base64');
},
verify: function(b) {
return /^[A-Za-z0-9\-_]+$/.test(b);
}
};
exports.assert_no_nulls = assert_no_nulls = function(v) {
var e, ok, _i, _len;
ok = true;
for (_i = 0, _len = v.length; _i < _len; _i++) {
e = v[_i];
if (e == null) {
ok = false;
}
}
if (!ok) {
console.error("Found 1 or more nulls in vector: ");
console.error(v);
return assert(false);
}
};
exports.athrow = function(err, cb) {
return cb(err);
};
exports.asyncify = asyncify = function(args, cb) {
return cb.apply(null, args);
};
exports.format_fingerprint = function(raw) {
var hex, i, parts;
hex = raw.toString('hex').toUpperCase();
parts = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = hex.length; _i < _ref; i = _i += 4) {
_results.push(hex.slice(i, i + 4));
}
return _results;
})();
return parts.join(' ');
};
exports.format_pgp_fingerprint_2 = function(buf, opts) {
var hex, i, length, parts, spc;
if (opts == null) {
opts = {};
}
hex = buf.toString('hex');
length = (opts != null ? opts.length : void 0) || 40;
spc = (opts != null ? opts.space : void 0) || ' ';
hex = hex.toUpperCase().slice(-length);
if (hex.length === 40) {
parts = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = hex.length; _i < _ref; i = _i += 4) {
_results.push(hex.slice(i, i + 4));
}
return _results;
})();
parts = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = parts.length; _i < _ref; i = _i += 5) {
_results.push(parts.slice(i, i + 5).join(spc));
}
return _results;
})();
return parts.join(spc + spc);
} else if (hex.length > 8) {
parts = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = hex.length; _i < _ref; i = _i += 4) {
_results.push(hex.slice(i, i + 4));
}
return _results;
})();
return parts.join(spc);
} else {
return hex;
}
};
exports.fingerprint_to_key_id_64 = function(fp) {
return fp.slice(-16);
};
exports.strip = strip = function(x) {
return x.split(/\s+/).join('');
};
exports.trim = trim = function(x) {
var m;
if ((m = x != null ? x.match(/^\s+(.*?)$/) : void 0)) {
x = m[1];
}
if ((m = x != null ? x.match(/^(.*?)\s+$/) : void 0)) {
x = m[1];
}
return x;
};
exports.fpeq = function(fp1, fp2) {
return strip(fp1).toLowerCase() === strip(fp2).toLowerCase();
};
exports.xxd = xxd = function(buf, opts) {
var i, line, lines, p, pad, q, quartets, v;
if (opts == null) {
opts = {};
}
q = opts.q || 8;
p = opts.p || 7;
buf = buf.toString('hex');
quartets = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = buf.length; _i < _ref; i = _i += 4) {
_results.push(buf.slice(i, i + 4));
}
return _results;
})();
lines = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = quartets.length; q > 0 ? _i < _ref : _i > _ref; i = _i += q) {
_results.push(quartets.slice(i, i + q).join(' '));
}
return _results;
})();
pad = function(s, n) {
return ((function() {
var _i, _ref, _results;
_results = [];
for (_i = 0, _ref = n - s.length; 0 <= _ref ? _i < _ref : _i > _ref; 0 <= _ref ? _i++ : _i--) {
_results.push('0');
}
return _results;
})()).join('') + s;
};
v = (function() {
var _i, _len, _results;
_results = [];
for (i = _i = 0, _len = lines.length; _i < _len; i = ++_i) {
line = lines[i];
_results.push(pad((i * 2 * q).toString(16), p) + ": " + line);
}
return _results;
})();
return v.join("\n");
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"assert":75,"buffer":80,"iced-error":115,"iced-runtime":118}],166:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var NativeBuffer, PpBuffer, twos_compl_inv;
twos_compl_inv = require('./util').twos_compl_inv;
NativeBuffer = Buffer;
exports.PpBuffer = PpBuffer = (function() {
function PpBuffer(buf) {
if (buf == null) {
this._frozen_buf = null;
this._sub_buffers = [];
this._limits = [];
this._sz = 0x400;
this._small_buf_sz = 0x100;
this._logsz = 10;
this._i = 0;
this._tot = 0;
} else {
this._freeze_to(buf);
}
}
PpBuffer.prototype._nb = function() {
return this._sub_buffers.length;
};
PpBuffer.prototype._ab = function() {
return this._sub_buffers[this._nb() - 1];
};
PpBuffer.prototype._lib = function() {
return 0;
};
PpBuffer.prototype._finish_sub_buffer = function() {
this._limits.push(this._i);
return this._i = 0;
};
PpBuffer.prototype._push_sub_buffer = function(b) {
if (this._sub_buffers.length) {
this._finish_sub_buffer();
}
this._lib = function() {
return b.length - this._i;
};
this._sub_buffers.push(b);
return b;
};
PpBuffer.prototype._make_room = function() {
return this._push_sub_buffer(new NativeBuffer(this._sz));
};
PpBuffer.prototype._make_room_for_n_bytes = function(n) {
if (this._lib() < n) {
return this._make_room();
}
};
PpBuffer.prototype.push_uint8 = function(b) {
var n;
n = 1;
this._make_room_for_n_bytes(n);
this._ab().writeUInt8(b, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_int8 = function(b) {
var n;
n = 1;
this._make_room_for_n_bytes(n);
this._ab().writeInt8(b, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_uint16 = function(s) {
var n;
n = 2;
this._make_room_for_n_bytes(n);
this._ab().writeUInt16BE(s, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_uint32 = function(w) {
var n;
n = 4;
this._make_room_for_n_bytes(n);
this._ab().writeUInt32BE(w, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_int16 = function(s) {
var n;
n = 2;
this._make_room_for_n_bytes(n);
this._ab().writeInt16BE(s, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_int32 = function(w) {
var n;
n = 4;
this._make_room_for_n_bytes(n);
this._ab().writeInt32BE(w, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_float64 = function(f) {
var n;
n = 8;
this._make_room_for_n_bytes(n);
this._ab().writeDoubleBE(f, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_float32 = function(f) {
var n;
n = 4;
this._make_room_for_n_bytes(n);
this._ab().writeFloatBE(f, this._i);
this._i += n;
return this._tot += n;
};
PpBuffer.prototype.push_raw_bytes = function(s) {
return this.push_buffer(new NativeBuffer(s, 'binary'));
};
PpBuffer.prototype.prepare_utf8 = function(s) {
return new NativeBuffer(s, 'utf8');
};
PpBuffer.prototype.push_buffer = function(b) {
var diff, n;
if (b.length > this._small_buf_sz) {
this._push_sub_buffer(b);
this._i = b.length;
this._tot += b.length;
} else {
n = Math.min(b.length, this._lib());
if (n > 0) {
b.copy(this._ab(), this._i, 0, n);
this._i += n;
this._tot += n;
}
if (n < b.length) {
this._make_room();
b.copy(this._ab(), this._i, n, b.length);
diff = b.length - n;
this._i += diff;
this._tot += diff;
}
}
return this;
};
PpBuffer.prototype.freeze = function() {
var b, i, l, lst, _i, _len, _ref;
if (this._frozen_buf == null) {
this._finish_sub_buffer();
lst = [];
_ref = this._sub_buffers;
for (i = _i = 0, _len = _ref.length; _i < _len; i = ++_i) {
b = _ref[i];
if ((l = this._limits[i]) === b.length) {
lst.push(b);
} else if (l > 0) {
lst.push(b.slice(0, l));
}
}
this._sub_buffers = [];
this._frozen_buf = NativeBuffer.concat(lst, this._tot);
}
return this._frozen_buf;
};
PpBuffer.prototype._freeze_to = function(b) {
this._frozen_buf = b;
this._tot = b.length;
this._sub_buffers = [];
this._cp = 0;
return this;
};
PpBuffer.prototype.bytes_left = function() {
return this._tot - this._cp;
};
PpBuffer.prototype._get = function(i) {
if (i < this._tot) {
return this._frozen_buf.readUInt8(i);
} else {
return 0;
}
};
PpBuffer.prototype.read_uint8 = function() {
return this._get(this._cp++);
};
PpBuffer.prototype.read_int8 = function() {
return twos_compl_inv(this.read_uint8(), 8);
};
PpBuffer.prototype.read_uint16 = function() {
var ret;
ret = this._frozen_buf.readUInt16BE(this._cp);
this._cp += 2;
return ret;
};
PpBuffer.prototype.read_uint32 = function() {
var ret;
ret = this._frozen_buf.readUInt32BE(this._cp);
this._cp += 4;
return ret;
};
PpBuffer.prototype.read_int16 = function() {
var ret;
ret = this._frozen_buf.readInt16BE(this._cp);
this._cp += 2;
return ret;
};
PpBuffer.prototype.read_int32 = function() {
var ret;
ret = this._frozen_buf.readInt32BE(this._cp);
this._cp += 4;
return ret;
};
PpBuffer.prototype.read_float64 = function() {
var ret;
ret = this._frozen_buf.readDoubleBE(this._cp);
this._cp += 8;
return ret;
};
PpBuffer.prototype.read_float32 = function() {
var ret;
ret = this._frozen_buf.readFloatBE(this._cp);
this._cp += 4;
return ret;
};
PpBuffer.prototype.read_buffer = function(n) {
var bl, e, ret;
bl = this.bytes_left();
if (n > bl) {
throw new Error("Corruption: asked for " + n + " bytes, but only " + bl + " available");
}
e = this._cp + n;
ret = this._frozen_buf.slice(this._cp, e);
this._cp = e;
return ret;
};
PpBuffer.isBuffer = function(b) {
return NativeBuffer.isBuffer(b);
};
return PpBuffer;
})();
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./util":172,"buffer":80}],167:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
exports.C = {
"null": 0xc0,
"false": 0xc2,
"true": 0xc3,
bin8: 0xc4,
bin16: 0xc5,
bin32: 0xc6,
ext8: 0xc7,
ext16: 0xc8,
ext32: 0xc9,
float: 0xca,
double: 0xcb,
uint8: 0xcc,
uint16: 0xcd,
uint32: 0xce,
uint64: 0xcf,
int8: 0xd0,
int16: 0xd1,
int32: 0xd2,
int64: 0xd3,
fix_ext1: 0xd4,
fix_ext2: 0xd5,
fix_ext4: 0xd6,
fix_ext8: 0xd7,
fix_ext16: 0xd8,
str8: 0xd9,
str16: 0xda,
str32: 0xdb,
array16: 0xdc,
array32: 0xdd,
map16: 0xde,
map32: 0xdf,
fix_str_min: 0xa0,
fix_str_max: 0xbf,
fix_array_min: 0x90,
fix_array_max: 0x9f,
fix_map_min: 0x80,
fix_map_max: 0x8f,
fix_array_count_mask: 0xf,
fix_map_count_mask: 0xf,
fix_str_count_mask: 0x1f,
negative_fix_min: 0xe0,
negative_fix_max: 0xff,
negative_fix_mask: 0x1f,
negative_fix_offset: 0x20,
positive_fix_max: 0x7f,
rpc_request: 0x00,
rpc_response: 0x01,
rpc_notify: 0x02
};
}).call(this);
},{}],168:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var C, frame_len, pack, unpack;
pack = require('./pack').pack;
unpack = require('./unpack').unpack;
C = require('./const').C;
exports.pack = function(x, opts) {
var b1, b2;
if (opts == null) {
opts = {};
}
b2 = pack(x, opts);
b1 = pack(b2.length);
return Buffer.concat([b1, b2]);
};
exports.frame_len = frame_len = function(c) {
if (c <= C.positive_fix_max) {
return 1;
} else if (c === C.uint8) {
return 2;
} else if (c === C.uint16) {
return 3;
} else if (c === C.uint32) {
return 5;
} else {
return 0;
}
};
exports.unpack = function(x, opts) {
var buf, c, flen, plen, rem, ret;
if (opts == null) {
opts = {};
}
if (x.length < 1) {
throw new Error("need a buffer > 1 bytes");
}
c = x.readUInt8(0);
flen = frame_len(c);
if (flen === 0) {
throw new Error("no data frame found");
}
if (x.length < flen) {
throw new Error("not enough bytes to read frame: " + x.length + " < " + flen);
}
buf = x.slice(0, flen);
plen = unpack(buf);
x = x.slice(flen);
if (x.length < plen) {
throw new Error("not enough bytes to unframe: " + x.length + " < " + plen);
}
rem = x.slice(plen);
x = x.slice(0, plen);
ret = unpack(x);
return [ret, rem];
};
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./const":167,"./pack":170,"./unpack":171,"buffer":80}],169:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
exports.pack = require('./pack').pack;
exports.unpack = require('./unpack').unpack;
exports.Buffer = require('./buffer').PpBuffer;
exports.frame = require('./frame');
}).call(this);
},{"./buffer":166,"./frame":168,"./pack":170,"./unpack":171}],170:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var C, Packer, PpBuffer, U32MAX, is_array, is_int, u64max_minus_i;
C = require('./const').C;
PpBuffer = require('./buffer').PpBuffer;
U32MAX = require('./util').U32MAX;
is_array = function(x) {
return Object.prototype.toString.call(x) === '[object Array]';
};
is_int = function(f) {
return Math.floor(f) === f;
};
u64max_minus_i = function(i) {
var a, b, x, y;
x = Math.floor(i / U32MAX);
y = i % U32MAX;
a = U32MAX - x - (y > 0 ? 1 : 0);
b = y === 0 ? 0 : U32MAX - y;
return [a, b];
};
exports.Packer = Packer = (function() {
function Packer(_opts) {
this._opts = _opts != null ? _opts : {};
this._buffer = new PpBuffer();
}
Packer.prototype.output = function() {
return this._buffer.freeze();
};
Packer.prototype.p = function(o) {
switch (typeof o) {
case 'number':
return this.p_number(o);
case 'string':
return this.p_str(o);
case 'boolean':
return this.p_boolean(o);
case 'undefined':
return this.p_null();
case 'object':
if (o == null) {
return this.p_null();
} else if (is_array(o)) {
return this.p_array(o);
} else if (PpBuffer.isBuffer(o)) {
return this.p_bin(o);
} else if (!this.p_ext(o)) {
return this.p_obj(o);
}
}
};
Packer.prototype.p_number = function(n) {
if (!is_int(n)) {
return this.p_pack_double(n);
} else if (n >= 0) {
return this.p_positive_int(n);
} else {
return this.p_negative_int(n);
}
};
Packer.prototype.p_pack_double = function(d) {
if (this._opts.floats != null) {
this.p_uint8(C.float);
return this._buffer.push_float32(d);
} else {
this.p_uint8(C.double);
return this._buffer.push_float64(d);
}
};
Packer.prototype.p_uint8 = function(b) {
return this._buffer.push_uint8(b);
};
Packer.prototype.p_uint16 = function(s) {
return this._buffer.push_uint16(s);
};
Packer.prototype.p_uint32 = function(w) {
return this._buffer.push_uint32(w);
};
Packer.prototype.p_int8 = function(b) {
return this._buffer.push_int8(b);
};
Packer.prototype.p_int16 = function(s) {
return this._buffer.push_int16(s);
};
Packer.prototype.p_int32 = function(w) {
return this._buffer.push_int32(w);
};
Packer.prototype.p_neg_int64 = function(i) {
var a, abs_i, b, _ref;
abs_i = 0 - i;
_ref = u64max_minus_i(abs_i), a = _ref[0], b = _ref[1];
this.p_uint32(a);
return this.p_uint32(b);
};
Packer.prototype.p_boolean = function(b) {
return this.p_uint8(b ? C["true"] : C["false"]);
};
Packer.prototype.p_null = function() {
return this.p_uint8(C["null"]);
};
Packer.prototype.p_array = function(a) {
var e, _i, _len, _results;
this.p_len(a.length, C.fix_array_min, C.fix_array_max, C.array16, C.array32);
_results = [];
for (_i = 0, _len = a.length; _i < _len; _i++) {
e = a[_i];
_results.push(this.p(e));
}
return _results;
};
Packer.prototype.p_obj = function(o) {
var k, keys, n, _i, _len, _results;
keys = Object.keys(o);
n = keys.length;
this.p_len(n, C.fix_map_min, C.fix_map_max, C.map16, C.map32);
if (this._opts.sort_keys) {
keys.sort();
}
_results = [];
for (_i = 0, _len = keys.length; _i < _len; _i++) {
k = keys[_i];
this.p(k);
_results.push(this.p(o[k]));
}
return _results;
};
Packer.prototype.p_positive_int = function(i) {
if (i <= 0x7f) {
return this.p_uint8(i);
} else if (i <= 0xff) {
this.p_uint8(C.uint8);
return this.p_uint8(i);
} else if (i <= 0xffff) {
this.p_uint8(C.uint16);
return this.p_uint16(i);
} else if (i < U32MAX) {
this.p_uint8(C.uint32);
return this.p_uint32(i);
} else {
this.p_uint8(C.uint64);
this.p_uint32(Math.floor(i / U32MAX));
return this.p_uint32(i % U32MAX);
}
};
Packer.prototype.p_negative_int = function(i) {
if (i >= -32) {
return this.p_int8(i);
} else if (i >= -128) {
this.p_uint8(C.int8);
return this.p_int8(i);
} else if (i >= -32768) {
this.p_uint8(C.int16);
return this.p_int16(i);
} else if (i >= -2147483648) {
this.p_uint8(C.int32);
return this.p_int32(i);
} else {
this.p_uint8(C.int64);
return this.p_neg_int64(i);
}
};
Packer.prototype.p_buffer = function(b) {
return this._buffer.push_buffer(b);
};
Packer.prototype.p_bin = function(r) {
this.p_len(r.length, null, null, C.bin16, C.bin32, C.bin8);
return this.p_buffer(r);
};
Packer.prototype.p_str = function(s) {
var b, str8;
b = this._buffer.prepare_utf8(s);
str8 = this._opts.no_str8 ? null : C.str8;
this.p_len(b.length, C.fix_str_min, C.fix_str_max, C.str16, C.str32, str8);
return this.p_buffer(b);
};
Packer.prototype.p_len = function(l, fixmin, fixmax, m, b, s) {
if (s == null) {
s = null;
}
if ((fixmin != null) && (fixmax != null) && l <= (fixmax - fixmin)) {
return this.p_uint8(l | fixmin);
} else if ((s != null) && l <= 0xff) {
this.p_uint8(s);
return this.p_uint8(l);
} else if (l <= 0xffff) {
this.p_uint8(m);
return this.p_uint16(l);
} else {
this.p_uint8(b);
return this.p_uint32(l);
}
};
Packer.prototype.p_ext = function(o) {
var buf, l, ret, type;
if (this._opts.ext == null) {
return false;
} else if (!(ret = this._opts.ext(o))) {
return false;
} else {
type = ret[0], buf = ret[1];
switch ((l = buf.length)) {
case 1:
this.p_uint8(C.fix_ext1);
break;
case 2:
this.p_uint8(C.fix_ext2);
break;
case 4:
this.p_uint8(C.fix_ext4);
break;
case 8:
this.p_uint8(C.fix_ext8);
break;
case 16:
this.p_uint8(C.fix_ext16);
break;
default:
if (l <= 0xff) {
this.p_uint8(C.ext8);
this.p_uint8(l);
} else if (l <= 0xffff) {
this.p_uint8(C.ext16);
this.p_uint16(l);
} else {
this.p_uint8(C.ext32);
this.p_uint32(l);
}
}
this.p_uint8(type);
this.p_buffer(buf);
return true;
}
};
return Packer;
})();
exports.pack = function(x, opts) {
var packer;
if (opts == null) {
opts = {};
}
packer = new Packer(opts);
packer.p(x);
return packer.output();
};
}).call(this);
},{"./buffer":166,"./const":167,"./util":172}],171:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var C, PpBuffer, U32MAX, Unpacker, default_ext, modes, pow2, twos_compl_inv, _ref;
C = require('./const').C;
PpBuffer = require('./buffer').PpBuffer;
_ref = require('./util'), pow2 = _ref.pow2, twos_compl_inv = _ref.twos_compl_inv, U32MAX = _ref.U32MAX;
modes = {
NONE: 0,
BINARY: 1,
START: 2
};
default_ext = function(type, raw) {
return {
type: type,
raw: raw
};
};
exports.Unpacker = Unpacker = (function() {
function Unpacker(b, _opts) {
this._opts = _opts != null ? _opts : {};
this._buffer = new PpBuffer(b);
this._ext = this._opts.ext || (this._opts.no_ext ? null : default_ext);
}
Unpacker.prototype.u_buf = function(n) {
return this._buffer.read_buffer(n);
};
Unpacker.prototype.u_str = function(n) {
return this.u_buf(n).toString('utf8');
};
Unpacker.prototype.u_bin = function(n) {
return this.u_buf(n);
};
Unpacker.prototype.u_ext = function(n) {
var buf, typ;
typ = this.u_uint8();
buf = this.u_buf(n);
if (this._opts.ext != null) {
return this._opts.ext(typ, buf);
} else {
throw new Error("No ext hook but got message type: " + typ);
}
};
Unpacker.prototype.u_array = function(n) {
var i, _i, _results;
_results = [];
for (i = _i = 0; 0 <= n ? _i < n : _i > n; i = 0 <= n ? ++_i : --_i) {
_results.push(this.u());
}
return _results;
};
Unpacker.prototype.u_map = function(n) {
var i, ret, _i;
ret = {};
for (i = _i = 0; 0 <= n ? _i < n : _i > n; i = 0 <= n ? ++_i : --_i) {
ret[this.u()] = this.u();
}
return ret;
};
Unpacker.prototype.u_uint8 = function() {
return this._buffer.read_uint8();
};
Unpacker.prototype.u_uint16 = function() {
return this._buffer.read_uint16();
};
Unpacker.prototype.u_uint32 = function() {
return this._buffer.read_uint32();
};
Unpacker.prototype.u_int8 = function() {
return this._buffer.read_int8();
};
Unpacker.prototype.u_int16 = function() {
return this._buffer.read_int16();
};
Unpacker.prototype.u_int32 = function() {
return this._buffer.read_int32();
};
Unpacker.prototype.u_uint64 = function() {
return (this.u_uint32() * U32MAX) + this.u_uint32();
};
Unpacker.prototype.u_double = function() {
return this._buffer.read_float64();
};
Unpacker.prototype.u_float = function() {
return this._buffer.read_float32();
};
Unpacker.prototype.u_int64 = function() {
var a, b, i, _ref1;
_ref1 = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 2; i = ++_i) {
_results.push(this.u_uint32());
}
return _results;
}).call(this), a = _ref1[0], b = _ref1[1];
return U32MAX * (a - U32MAX) + b;
};
Unpacker.prototype.u = function() {
var b, l;
if ((b = this.u_uint8()) <= C.positive_fix_max) {
return b;
} else if (b >= C.negative_fix_min && b <= C.negative_fix_max) {
return twos_compl_inv(b, 8);
} else if (b >= C.fix_str_min && b <= C.fix_str_max) {
l = b & C.fix_str_count_mask;
return this.u_str(l);
} else if (b >= C.fix_array_min && b <= C.fix_array_max) {
l = b & C.fix_array_count_mask;
return this.u_array(l);
} else if (b >= C.fix_map_min && b <= C.fix_map_max) {
l = b & C.fix_map_count_mask;
return this.u_map(l);
} else {
switch (b) {
case C["null"]:
return null;
case C["true"]:
return true;
case C["false"]:
return false;
case C.uint8:
return this.u_uint8();
case C.uint16:
return this.u_uint16();
case C.uint32:
return this.u_uint32();
case C.uint64:
return this.u_uint64();
case C.int8:
return this.u_int8();
case C.int16:
return this.u_int16();
case C.int32:
return this.u_int32();
case C.int64:
return this.u_int64();
case C.double:
return this.u_double();
case C.float:
return this.u_float();
case C.str8:
return this.u_str(this.u_uint8());
case C.str16:
return this.u_str(this.u_uint16());
case C.str32:
return this.u_str(this.u_uint32());
case C.bin8:
return this.u_bin(this.u_uint8());
case C.bin16:
return this.u_bin(this.u_uint16());
case C.bin32:
return this.u_bin(this.u_uint32());
case C.array16:
return this.u_array(this.u_uint16());
case C.array32:
return this.u_array(this.u_uint32());
case C.map16:
return this.u_map(this.u_uint16());
case C.map32:
return this.u_map(this.u_uint32());
case C.fix_ext1:
return this.u_ext(1);
case C.fix_ext2:
return this.u_ext(2);
case C.fix_ext4:
return this.u_ext(4);
case C.fix_ext8:
return this.u_ext(8);
case C.fix_ext16:
return this.u_ext(16);
case C.ext8:
return this.u_ext(this.u_uint8());
case C.ext16:
return this.u_ext(this.u_uint16());
case C.ext32:
return this.u_ext(this.u_uint32());
default:
throw new Error("unhandled type " + b);
}
}
};
return Unpacker;
})();
exports.unpack = function(x, opts) {
var unpacker;
if (opts == null) {
opts = {};
}
unpacker = new Unpacker(x, opts);
return unpacker.u();
};
}).call(this);
},{"./buffer":166,"./const":167,"./util":172}],172:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-b
(function() {
var U32MAX, pow2;
exports.pow2 = pow2 = function(n) {
if (n < 31) {
return 1 << n;
} else {
return Math.pow(2, n);
}
};
exports.U32MAX = U32MAX = pow2(32);
exports.rshift = function(b, n) {
if (n < 31) {
return b >> n;
} else {
return Math.floor(b / Math.pow(2, n));
}
};
exports.twos_compl = function(x, n) {
if (x < 0) {
return pow2(n) - Math.abs(x);
} else {
return x;
}
};
exports.twos_compl_inv = function(x, n) {
return x - pow2(n);
};
}).call(this);
},{}],173:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var AES, BlockCipher, G, Global, scrub_vec,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
BlockCipher = require('./algbase').BlockCipher;
scrub_vec = require('./util').scrub_vec;
Global = (function() {
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;
};
return Global;
})();
G = new Global();
AES = (function(_super) {
__extends(AES, _super);
AES.blockSize = 4 * 4;
AES.prototype.blockSize = AES.blockSize;
AES.keySize = 256 / 8;
AES.prototype.keySize = AES.keySize;
AES.ivSize = AES.blockSize;
AES.prototype.ivSize = AES.ivSize;
function AES(key) {
this._key = key.clone();
this._doReset();
}
AES.prototype._doReset = function() {
var invKsRow, keySize, keyWords, ksRow, ksRows, t, _i, _j;
keyWords = this._key.words;
keySize = this._key.sigBytes / 4;
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, offset) {
if (offset == null) {
offset = 0;
}
return this._doCryptBlock(M, offset, this._keySchedule, G.SUB_MIX, G.SBOX);
};
AES.prototype.decryptBlock = function(M, offset) {
var _ref, _ref1;
if (offset == null) {
offset = 0;
}
_ref = [M[offset + 3], M[offset + 1]], M[offset + 1] = _ref[0], M[offset + 3] = _ref[1];
this._doCryptBlock(M, offset, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX);
return _ref1 = [M[offset + 3], M[offset + 1]], M[offset + 1] = _ref1[0], M[offset + 3] = _ref1[1], _ref1;
};
AES.prototype.scrub = function() {
scrub_vec(this._keySchedule);
scrub_vec(this._invKeySchedule);
return this._key.scrub();
};
AES.prototype._doCryptBlock = function(M, offset, keySchedule, SUB_MIX, SBOX) {
var ksRow, round, s0, s1, s2, s3, t0, t1, t2, t3, _i, _ref;
s0 = M[offset] ^ keySchedule[0];
s1 = M[offset + 1] ^ keySchedule[1];
s2 = M[offset + 2] ^ keySchedule[2];
s3 = M[offset + 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++];
M[offset] = t0;
M[offset + 1] = t1;
M[offset + 2] = t2;
return M[offset + 3] = t3;
};
return AES;
})(BlockCipher);
exports.AES = AES;
}).call(this);
},{"./algbase":174,"./util":195}],174:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var BlockCipher, BufferedBlockAlgorithm, Hasher, StreamCipher, WordArray, util,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
WordArray = require('./wordarray').WordArray;
util = require('./util');
BufferedBlockAlgorithm = (function() {
BufferedBlockAlgorithm.prototype._minBufferSize = 0;
function BufferedBlockAlgorithm() {
this.reset();
}
BufferedBlockAlgorithm.prototype.reset = function() {
this._data = new WordArray();
return this._nDataBytes = 0;
};
BufferedBlockAlgorithm.prototype._append = function(data) {
this._data.concat(data);
return this._nDataBytes += data.sigBytes;
};
BufferedBlockAlgorithm.prototype._process = function(doFlush) {
var blockSizeBytes, data, dataSigBytes, dataWords, nBlocksReady, nBytesReady, nWordsReady, offset, processedWords, _i, _ref;
data = this._data;
dataWords = data.words;
dataSigBytes = data.sigBytes;
blockSizeBytes = this.blockSize * 4;
nBlocksReady = dataSigBytes / blockSizeBytes;
if (doFlush) {
nBlocksReady = Math.ceil(nBlocksReady);
} else {
nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);
}
nWordsReady = nBlocksReady * this.blockSize;
nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);
if (nWordsReady) {
for (offset = _i = 0, _ref = this.blockSize; _ref > 0 ? _i < nWordsReady : _i > nWordsReady; offset = _i += _ref) {
this._doProcessBlock(dataWords, offset);
}
processedWords = dataWords.splice(0, nWordsReady);
data.sigBytes -= nBytesReady;
}
return new WordArray(processedWords, nBytesReady);
};
BufferedBlockAlgorithm.prototype.copy_to = function(out) {
out._data = this._data.clone();
return out._nDataBytes = this._nDataBytes;
};
BufferedBlockAlgorithm.prototype.clone = function() {
var obj;
obj = new BufferedBlockAlgorithm();
this.copy_to(obj);
return obj;
};
return BufferedBlockAlgorithm;
})();
Hasher = (function(_super) {
__extends(Hasher, _super);
function Hasher() {
Hasher.__super__.constructor.call(this);
}
Hasher.prototype.reset = function() {
Hasher.__super__.reset.call(this);
this._doReset();
return this;
};
Hasher.prototype.update = function(messageUpdate) {
this._append(messageUpdate);
this._process();
return this;
};
Hasher.prototype.finalize = function(messageUpdate) {
if (messageUpdate) {
this._append(messageUpdate);
}
return this._doFinalize();
};
Hasher.prototype.bufhash = function(input) {
var out, wa_in, wa_out;
wa_in = WordArray.from_buffer(input);
wa_out = this.finalize(wa_in);
out = wa_out.to_buffer();
wa_in.scrub();
wa_out.scrub();
return out;
};
return Hasher;
})(BufferedBlockAlgorithm);
exports.BlockCipher = BlockCipher = (function() {
function BlockCipher(key) {}
BlockCipher.prototype.encryptBlock = function(M, offset) {};
return BlockCipher;
})();
StreamCipher = (function() {
function StreamCipher() {}
StreamCipher.prototype.encryptBlock = function(word_array, dst_offset) {
var n_words, pad;
if (dst_offset == null) {
dst_offset = 0;
}
pad = this.get_pad();
n_words = Math.min(word_array.words.length - dst_offset, this.bsiw);
word_array.xor(pad, {
dst_offset: dst_offset,
n_words: n_words
});
pad.scrub();
return this.bsiw;
};
StreamCipher.prototype.encrypt = function(word_array) {
var i, _i, _ref, _ref1;
for (i = _i = 0, _ref = word_array.words.length, _ref1 = this.bsiw; _ref1 > 0 ? _i < _ref : _i > _ref; i = _i += _ref1) {
this.encryptBlock(word_array, i);
}
return word_array;
};
StreamCipher.prototype.bulk_encrypt = function(_arg, cb) {
var async_args, input, progress_hook, slice_args, what;
input = _arg.input, progress_hook = _arg.progress_hook, what = _arg.what;
slice_args = {
update: (function(_this) {
return function(lo, hi) {
var i, _i, _ref, _results;
_results = [];
for (i = _i = lo, _ref = _this.bsiw; _ref > 0 ? _i < hi : _i > hi; i = _i += _ref) {
_results.push(_this.encryptBlock(input, i));
}
return _results;
};
})(this),
finalize: function() {
return input;
},
default_n: this.bsiw * 1024
};
async_args = {
progress_hook: progress_hook,
cb: cb,
what: what
};
return util.bulk(input.sigBytes, slice_args, async_args);
};
return StreamCipher;
})();
exports.BlockCipher = BlockCipher;
exports.Hasher = Hasher;
exports.BufferedBlockAlgorithm = BufferedBlockAlgorithm;
exports.StreamCipher = StreamCipher;
}).call(this);
},{"./util":195,"./wordarray":196}],175:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var CombineBase, Concat, HMAC, SHA3, SHA512, WordArray, XOR, bulk_sign, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
_ref = require('./hmac'), HMAC = _ref.HMAC, bulk_sign = _ref.bulk_sign;
SHA512 = require('./sha512').SHA512;
SHA3 = require('./sha3').SHA3;
WordArray = require('./wordarray').WordArray;
CombineBase = (function() {
function CombineBase() {
this.hasherBlockSize = this.hashers[0].hasherBlockSize;
this.hasherBlockSizeBytes = this.hasherBlockSize * 4;
this.reset();
}
CombineBase.prototype.reset = function() {
var h, _i, _len, _ref1;
_ref1 = this.hashers;
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
h.reset();
}
return this;
};
CombineBase.prototype.update = function(w) {
var h, _i, _len, _ref1;
_ref1 = this.hashers;
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
h.update(w);
}
return this;
};
CombineBase.prototype.scrub = function() {
var h, _i, _len, _ref1;
_ref1 = this.hashers;
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
h.scrub();
}
return this;
};
CombineBase.prototype.finalize = function(w) {
var h, hashes, out, _i, _len, _ref1;
hashes = (function() {
var _i, _len, _ref1, _results;
_ref1 = this.hashers;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
_results.push(h.finalize(w));
}
return _results;
}).call(this);
out = hashes[0];
_ref1 = hashes.slice(1);
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
this._coalesce(out, h);
h.scrub();
}
return out;
};
return CombineBase;
})();
Concat = (function(_super) {
__extends(Concat, _super);
function Concat(key, klasses) {
var hm, i, klass, subkey, subkeys;
if (klasses == null) {
klasses = [SHA512, SHA3];
}
subkeys = key.split(klasses.length);
this.hashers = (function() {
var _i, _len, _results;
_results = [];
for (i = _i = 0, _len = klasses.length; _i < _len; i = ++_i) {
klass = klasses[i];
subkey = subkeys[i];
hm = new HMAC(subkey, klass);
subkey.scrub();
_results.push(hm);
}
return _results;
})();
Concat.__super__.constructor.call(this);
}
Concat.get_output_size = function() {
return SHA512.output_size + SHA3.output_size;
};
Concat.prototype._coalesce = function(out, h) {
return out.concat(h);
};
Concat.prototype.get_output_size = function() {
var h, tot, _i, _len, _ref1;
tot = 0;
_ref1 = this.hashers;
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
tot += h.get_output_size();
}
return tot;
};
Concat.sign = function(_arg) {
var input, key;
key = _arg.key, input = _arg.input;
return (new Concat(key)).finalize(input);
};
Concat.bulk_sign = function(args, cb) {
args.klass = Concat;
args.what = "HMAC-SHA512-SHA3";
return bulk_sign(args, cb);
};
return Concat;
})(CombineBase);
XOR = (function(_super) {
__extends(XOR, _super);
function XOR(key, klasses) {
var klass;
if (klasses == null) {
klasses = [SHA512, SHA3];
}
this.hashers = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = klasses.length; _i < _len; _i++) {
klass = klasses[_i];
_results.push(new HMAC(key, klass));
}
return _results;
})();
XOR.__super__.constructor.call(this);
}
XOR.prototype.reset = function() {
var h, i, _i, _len, _ref1;
XOR.__super__.reset.call(this);
_ref1 = this.hashers;
for (i = _i = 0, _len = _ref1.length; _i < _len; i = ++_i) {
h = _ref1[i];
h.update(new WordArray([i]));
}
return this;
};
XOR.get_output_size = function() {
return Math.max(SHA512.output_size, SHA3.output_size);
};
XOR.prototype._coalesce = function(out, h) {
return out.xor(h, {});
};
XOR.prototype.get_output_size = function() {
var h;
return Math.max.apply(Math, (function() {
var _i, _len, _ref1, _results;
_ref1 = this.hashers;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
h = _ref1[_i];
_results.push(h.get_output_size());
}
return _results;
}).call(this));
};
XOR.sign = function(_arg) {
var input, key;
key = _arg.key, input = _arg.input;
return (new XOR(key)).finalize(input);
};
XOR.bulk_sign = function(arg, cb) {
arg.klass = XOR;
arg.what = "HMAC-SHA512-XOR-SHA3";
return bulk_sign(arg, cb);
};
return XOR;
})(CombineBase);
exports.Concat = Concat;
exports.XOR = XOR;
}).call(this);
},{"./hmac":180,"./sha3":191,"./sha512":193,"./wordarray":196}],176:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Cipher, Counter, StreamCipher, WordArray, bulk_encrypt, encrypt, iced, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
WordArray = require('./wordarray').WordArray;
StreamCipher = require('./algbase').StreamCipher;
Counter = (function() {
Counter.prototype.WORD_MAX = 0xffffffff;
function Counter(_arg) {
var i, len, value;
value = _arg.value, len = _arg.len;
this._value = value != null ? value.clone() : (len == null ? len = 2 : void 0, new WordArray((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= len ? _i < len : _i > len; i = 0 <= len ? ++_i : --_i) {
_results.push(0);
}
return _results;
})()));
}
Counter.prototype.inc = function() {
var go, i;
go = true;
i = this._value.words.length - 1;
while (go && i >= 0) {
if ((++this._value.words[i]) > Counter.WORD_MAX) {
this._value.words[i] = 0;
} else {
go = false;
}
i--;
}
return this;
};
Counter.prototype.inc_le = function() {
var go, i;
go = true;
i = 0;
while (go && i < this._value.words.length) {
if ((++this._value.words[i]) > Counter.WORD_MAX) {
this._value.words[i] = 0;
} else {
go = false;
}
i++;
}
return this;
};
Counter.prototype.get = function() {
return this._value;
};
Counter.prototype.copy = function() {
return this._value.clone();
};
return Counter;
})();
Cipher = (function(_super) {
__extends(Cipher, _super);
function Cipher(_arg) {
this.block_cipher = _arg.block_cipher, this.iv = _arg.iv;
Cipher.__super__.constructor.call(this);
this.bsiw = this.block_cipher.blockSize / 4;
if (!(this.iv.sigBytes === this.block_cipher.blockSize)) {
throw new Error("IV is wrong length (" + this.iv.sigBytes + ")");
}
this.ctr = new Counter({
value: this.iv
});
}
Cipher.prototype.scrub = function() {
return this.block_cipher.scrub();
};
Cipher.prototype.get_pad = function() {
var pad;
pad = this.ctr.copy();
this.ctr.inc();
this.block_cipher.encryptBlock(pad.words);
return pad;
};
return Cipher;
})(StreamCipher);
encrypt = function(_arg) {
var block_cipher, cipher, input, iv, ret;
block_cipher = _arg.block_cipher, iv = _arg.iv, input = _arg.input;
cipher = new Cipher({
block_cipher: block_cipher,
iv: iv
});
ret = cipher.encrypt(input);
cipher.scrub();
return ret;
};
bulk_encrypt = function(_arg, cb) {
var block_cipher, cipher, input, iv, progress_hook, ret, what, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
block_cipher = _arg.block_cipher, iv = _arg.iv, input = _arg.input, progress_hook = _arg.progress_hook, what = _arg.what;
cipher = new Cipher({
block_cipher: block_cipher,
iv: iv
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/ctr.iced"
});
cipher.bulk_encrypt({
input: input,
progress_hook: progress_hook,
what: what
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ret = arguments[0];
};
})(),
lineno: 121
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(ret);
};
})(this));
};
exports.Counter = Counter;
exports.Cipher = Cipher;
exports.encrypt = encrypt;
exports.bulk_encrypt = bulk_encrypt;
}).call(this);
},{"./algbase":174,"./wordarray":196,"iced-runtime":118}],177:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var AES, Base, Concat, Decryptor, SHA512, Salsa20, TwoFish, V, WordArray, ctr, decrypt, iced, make_esc, salsa20, __iced_k, __iced_k_noop, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
WordArray = require('./wordarray').WordArray;
salsa20 = require('./salsa20');
AES = require('./aes').AES;
TwoFish = require('./twofish').TwoFish;
ctr = require('./ctr');
Concat = require('./combine').Concat;
SHA512 = require('./sha512').SHA512;
Salsa20 = require('./salsa20').Salsa20;
_ref = require('./enc'), Base = _ref.Base, V = _ref.V;
make_esc = require('iced-error').make_esc;
Decryptor = (function(_super) {
__extends(Decryptor, _super);
function Decryptor(_arg) {
var enc, key;
key = _arg.key, enc = _arg.enc;
Decryptor.__super__.constructor.call(this, {
key: key
});
if (enc != null) {
this.key = enc.key;
this.derived_keys = enc.derived_keys;
}
}
Decryptor.prototype.read_header = function(cb) {
var err, wa;
err = (wa = this.ct.unshift(2)) == null ? new Error("Ciphertext underrun in header") : (this.version = V[wa.words[1]]) == null ? new Error("bad header; couldn't find a good version (got " + wa.words[1] + ")") : wa.words[0] !== this.version.header[0] ? new Error("Bad header: unrecognized magic value") : null;
return cb(err);
};
Decryptor.prototype.verify_sig = function(key, cb) {
var computed, err, received, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
if ((received = _this.ct.unshift(Concat.get_output_size() / 4)) == null) {
return __iced_k(err = new Error("Ciphertext underrun in signature"));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.verify_sig"
});
_this.sign({
input: _this.ct,
key: key,
salt: _this.salt
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return computed = arguments[1];
};
})(),
lineno: 63
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(err = err != null ? err : received.equal(computed) ? null : new Error('Signature mismatch or bad decryption key'));
});
}
});
})(this)((function(_this) {
return function() {
return cb(err);
};
})(this));
};
Decryptor.prototype.unshift_iv = function(n_bytes, which, cb) {
var err, iv;
err = (iv = this.ct.unshift(n_bytes / 4)) != null ? null : new Error("Ciphertext underrun in " + which);
return cb(err, iv);
};
Decryptor.prototype.read_salt = function(cb) {
var err;
err = (this.salt = this.ct.unshift(this.version.salt_size / 4)) == null ? new Error("Ciphertext underrrun in read_salt") : null;
return cb(err);
};
Decryptor.prototype.generate_keys = function(_arg, cb) {
var err, keys, progress_hook, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
progress_hook = _arg.progress_hook;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.generate_keys"
});
_this.kdf({
salt: _this.salt,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return keys = arguments[1];
};
})(),
lineno: 114
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(err, keys);
};
})(this));
};
Decryptor.prototype.run = function(_arg, cb) {
var ct1, ct2, data, esc, iv, progress_hook, pt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
data = _arg.data, progress_hook = _arg.progress_hook;
esc = make_esc(cb, "Decryptor::run");
this.ct = WordArray.from_buffer(data);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.read_header(esc(__iced_deferrals.defer({
lineno: 141
})));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.read_salt(esc(__iced_deferrals.defer({
lineno: 142
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.generate_keys({
progress_hook: progress_hook
}, esc(__iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
return __slot_1.keys = arguments[0];
};
})(_this),
lineno: 143
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.verify_sig(_this.keys.hmac, esc(__iced_deferrals.defer({
lineno: 144
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.unshift_iv(AES.ivSize, "AES", esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return iv = arguments[0];
};
})(),
lineno: 145
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.run_aes({
iv: iv,
input: _this.ct,
key: _this.keys.aes,
progress_hook: progress_hook
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct2 = arguments[0];
};
})(),
lineno: 146
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.unshift_iv(TwoFish.ivSize, "2fish", esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return iv = arguments[0];
};
})(),
lineno: 147
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.run_twofish({
iv: iv,
input: _this.ct,
key: _this.keys.twofish,
progress_hook: progress_hook
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct1 = arguments[0];
};
})(),
lineno: 148
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.unshift_iv(Salsa20.ivSize, "Salsa", esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return iv = arguments[0];
};
})(),
lineno: 149
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced",
funcname: "Decryptor.run"
});
_this.run_salsa20({
iv: iv,
input: _this.ct,
key: _this.keys.salsa20,
output_iv: false,
progress_hook: progress_hook
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return pt = arguments[0];
};
})(),
lineno: 150
})));
__iced_deferrals._fulfill();
})(function() {
return cb(null, pt.to_buffer());
});
});
});
});
});
});
});
});
});
};
})(this));
};
return Decryptor;
})(Base);
decrypt = function(_arg, cb) {
var data, dec, err, key, progress_hook, pt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, data = _arg.data, progress_hook = _arg.progress_hook;
dec = new Decryptor({
key: key
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/dec.iced"
});
dec.run({
data: data,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return pt = arguments[1];
};
})(),
lineno: 168
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
dec.scrub();
return cb(err, pt);
};
})(this));
};
exports.Decryptor = Decryptor;
exports.decrypt = decrypt;
}).call(this);
},{"./aes":173,"./combine":175,"./ctr":176,"./enc":179,"./salsa20":186,"./sha512":193,"./twofish":194,"./wordarray":196,"iced-error":115,"iced-runtime":118}],178:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var ADRBG, DRBG, Lock, WordArray, XOR, hmac, iced, sha3, sha512, __iced_k, __iced_k_noop;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
hmac = require('./hmac');
XOR = require('./combine').XOR;
sha512 = require('./sha512');
sha3 = require('./sha3');
WordArray = require('./wordarray').WordArray;
Lock = require('iced-lock').Lock;
DRBG = (function() {
function DRBG(entropy, personalization_string, hmac_func) {
this.hmac = hmac_func || hmac.sign;
this.security_strength = 256;
entropy = this.check_entropy(entropy);
personalization_string || (personalization_string = new WordArray([]));
this._instantiate(entropy, personalization_string);
}
DRBG.prototype.check_entropy = function(entropy, reseed) {
if (reseed == null) {
reseed = false;
}
if ((entropy.sigBytes * 8 * 2) < ((reseed ? 2 : 3) * this.security_strength)) {
throw new Error("entropy must be at least " + (1.5 * this.security_strength) + " bits.");
}
return entropy;
};
DRBG.prototype._hmac = function(key, input) {
return this.hmac({
key: key,
input: input
});
};
DRBG.prototype._update = function(provided_data) {
var V, V_in;
V = new WordArray([0], 1);
if (provided_data != null) {
V = V.concat(provided_data);
}
V_in = this.V.clone().concat(V);
this.K = this._hmac(this.K, V_in);
V_in.scrub();
V.scrub();
this.V = this._hmac(this.K, this.V);
if (provided_data != null) {
V_in = this.V.clone().concat(new WordArray([1 << 24], 1)).concat(provided_data);
this.K = this._hmac(this.K, V_in);
V_in.scrub();
this.V = this._hmac(this.K, this.V);
}
return provided_data != null ? provided_data.scrub() : void 0;
};
DRBG.prototype._instantiate = function(entropy, personalization_string) {
var i, n, seed_material;
seed_material = entropy.concat(personalization_string);
n = 64;
this.K = WordArray.from_buffer(new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= n ? _i < n : _i > n; i = 0 <= n ? ++_i : --_i) {
_results.push(0);
}
return _results;
})()));
this.V = WordArray.from_buffer(new Buffer((function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= n ? _i < n : _i > n; i = 0 <= n ? ++_i : --_i) {
_results.push(1);
}
return _results;
})()));
this._update(seed_material);
entropy.scrub();
return this.reseed_counter = 1;
};
DRBG.prototype.reseed = function(entropy) {
this._update(this.check_entropy(entropy, true));
return this.reseed_counter = 1;
};
DRBG.prototype.generate = function(num_bytes) {
var i, tmp, _ref;
if ((num_bytes * 8) > 7500) {
throw new Error("generate cannot generate > 7500 bits in 1 call.");
}
if (this.reseed_counter >= 10000) {
throw new Error("Need a reseed!");
}
tmp = [];
i = 0;
while ((tmp.length === 0) || (tmp.length * tmp[0].length * 4) < num_bytes) {
this.V = this._hmac(this.K, this.V);
tmp.push(this.V.words);
}
this._update();
this.reseed_counter += 1;
return (new WordArray((_ref = []).concat.apply(_ref, tmp))).truncate(num_bytes);
};
return DRBG;
})();
ADRBG = (function() {
function ADRBG(gen_seed, hmac) {
this.gen_seed = gen_seed;
this.hmac = hmac;
this.drbg = null;
this.lock = new Lock();
}
ADRBG.prototype.generate = function(n, cb) {
var ret, seed, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/drbg.iced",
funcname: "ADRBG.generate"
});
_this.lock.acquire(__iced_deferrals.defer({
lineno: 148
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (_this.drbg == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/drbg.iced",
funcname: "ADRBG.generate"
});
_this.gen_seed(256, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return seed = arguments[0];
};
})(),
lineno: 150
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(_this.drbg = new DRBG(seed, null, _this.hmac));
});
} else {
return __iced_k();
}
})(function() {
(function(__iced_k) {
if (_this.drbg.reseed_counter > 100) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/drbg.iced",
funcname: "ADRBG.generate"
});
_this.gen_seed(256, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return seed = arguments[0];
};
})(),
lineno: 153
}));
__iced_deferrals._fulfill();
})(function() {
return __iced_k(_this.drbg.reseed(seed));
});
} else {
return __iced_k();
}
})(function() {
ret = _this.drbg.generate(n);
_this.lock.release();
return cb(ret);
});
});
};
})(this));
};
return ADRBG;
})();
exports.DRBG = DRBG;
exports.ADRBG = ADRBG;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./combine":175,"./hmac":180,"./sha3":191,"./sha512":193,"./wordarray":196,"buffer":80,"iced-lock":197,"iced-runtime":118}],179:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var AES, Base, CURRENT_VERSION, Concat, Encryptor, HMAC_SHA256, PBKDF2, SHA512, Scrypt, TwoFish, V, WordArray, XOR, ctr, encrypt, iced, make_esc, prng, salsa20, util, __iced_k, __iced_k_noop, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
WordArray = require('./wordarray').WordArray;
salsa20 = require('./salsa20');
AES = require('./aes').AES;
TwoFish = require('./twofish').TwoFish;
ctr = require('./ctr');
_ref = require('./combine'), XOR = _ref.XOR, Concat = _ref.Concat;
SHA512 = require('./sha512').SHA512;
PBKDF2 = require('./pbkdf2').PBKDF2;
Scrypt = require('./scrypt').Scrypt;
util = require('./util');
prng = require('./prng');
make_esc = require('iced-error').make_esc;
HMAC_SHA256 = require('./hmac').HMAC_SHA256;
V = {
"1": {
header: [0x1c94d7de, 1],
salt_size: 8,
xsalsa20_rev: true,
kdf: {
klass: PBKDF2,
opts: {
c: 1024,
klass: XOR
}
},
hmac_key_size: 768 / 8
},
"2": {
header: [0x1c94d7de, 2],
salt_size: 16,
xsalsa20_rev: true,
kdf: {
klass: Scrypt,
opts: {
c: 64,
klass: XOR,
N: 12,
r: 8,
p: 1
}
},
hmac_key_size: 768 / 8
},
"3": {
header: [0x1c94d7de, 3],
salt_size: 16,
xsalsa20_rev: false,
kdf: {
klass: Scrypt,
opts: {
c: 1,
klass: HMAC_SHA256,
N: 15,
r: 8,
p: 1
}
},
hmac_key_size: 768 / 8
}
};
exports.CURRENT_VERSION = CURRENT_VERSION = 3;
Base = (function() {
function Base(_arg) {
var key, version;
key = _arg.key, version = _arg.version;
this.version = V[version != null ? version : CURRENT_VERSION];
if (this.version == null) {
throw new Error("unknown version: " + version);
}
this.set_key(key);
this.derived_keys = {};
}
Base.prototype.kdf = function(_arg, cb) {
var args, dkLen, end, extra_keymaterial, i, k, key, keys, len, lens, order, progress_hook, raw, salt, salt_hex, v, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
salt = _arg.salt, extra_keymaterial = _arg.extra_keymaterial, progress_hook = _arg.progress_hook;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.kdf"
});
_this._check_scrubbed(_this.key, "in KDF", cb, __iced_deferrals.defer({
lineno: 94
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
salt_hex = salt.to_hex();
key = _this.key.clone();
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.kdf"
});
_this._check_scrubbed(key, "KDF", cb, __iced_deferrals.defer({
lineno: 102
}));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
if ((keys = _this.derived_keys[salt_hex]) == null) {
_this._kdf = new _this.version.kdf.klass(_this.version.kdf.opts);
lens = {
hmac: _this.version.hmac_key_size,
aes: AES.keySize,
twofish: TwoFish.keySize,
salsa20: salsa20.Salsa20.keySize
};
order = ['hmac', 'aes', 'twofish', 'salsa20'];
dkLen = extra_keymaterial || 0;
for (k in lens) {
v = lens[k];
dkLen += v;
}
args = {
dkLen: dkLen,
key: key,
progress_hook: progress_hook,
salt: salt
};
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.kdf"
});
_this._kdf.run(args, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return raw = arguments[0];
};
})(),
lineno: 121
}));
__iced_deferrals._fulfill();
})(function() {
var _i, _len;
keys = {};
i = 0;
for (_i = 0, _len = order.length; _i < _len; _i++) {
k = order[_i];
v = lens[k];
len = v / 4;
end = i + len;
keys[k] = new WordArray(raw.words.slice(i, end));
i = end;
}
keys.extra = (new WordArray(raw.words.slice(end))).to_buffer();
return __iced_k(_this.derived_keys[salt_hex] = keys);
});
} else {
return __iced_k();
}
})(function() {
return cb(null, keys);
});
});
};
})(this));
};
Base.prototype.set_key = function(key) {
var wakey;
if (key != null) {
wakey = WordArray.from_buffer(key);
if (!this.key || !this.key.equal(wakey)) {
this.scrub();
return this.key = wakey;
}
} else {
return this.scrub();
}
};
Base.prototype._check_scrubbed = function(key, where, ecb, okcb) {
if ((key != null) && !key.is_scrubbed()) {
return okcb();
} else {
return ecb(new Error("" + where + ": Failed due to scrubbed key!"), null);
}
};
Base.prototype.sign = function(_arg, cb) {
var input, key, out, progress_hook, salt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
input = _arg.input, key = _arg.key, salt = _arg.salt, progress_hook = _arg.progress_hook;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.sign"
});
_this._check_scrubbed(key, "HMAC", cb, __iced_deferrals.defer({
lineno: 179
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
input = (new WordArray(_this.version.header)).concat(salt).concat(input);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.sign"
});
Concat.bulk_sign({
key: key,
input: input,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return out = arguments[0];
};
})(),
lineno: 181
}));
__iced_deferrals._fulfill();
})(function() {
input.scrub();
return cb(null, out);
});
};
})(this));
};
Base.prototype.run_salsa20 = function(_arg, cb) {
var args, ct, input, iv, key, output_iv, progress_hook, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
input = _arg.input, key = _arg.key, iv = _arg.iv, output_iv = _arg.output_iv, progress_hook = _arg.progress_hook;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.run_salsa20"
});
_this._check_scrubbed(key, "Salsa20", cb, __iced_deferrals.defer({
lineno: 197
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
args = {
input: input,
progress_hook: progress_hook,
key: key,
iv: iv
};
if (_this.version.xsalsa20_rev) {
args.key = key.clone().endian_reverse();
args.iv = iv.clone().endian_reverse();
}
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.run_salsa20"
});
salsa20.bulk_encrypt(args, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct = arguments[0];
};
})(),
lineno: 209
}));
__iced_deferrals._fulfill();
})(function() {
if (output_iv) {
ct = iv.clone().concat(ct);
}
if (_this.version.xsalsa20_rev) {
args.key.scrub();
args.iv.scrub();
}
return cb(null, ct);
});
};
})(this));
};
Base.prototype.run_twofish = function(_arg, cb) {
var block_cipher, ct, input, iv, key, progress_hook, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
input = _arg.input, key = _arg.key, iv = _arg.iv, progress_hook = _arg.progress_hook;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.run_twofish"
});
_this._check_scrubbed(key, "TwoFish", cb, __iced_deferrals.defer({
lineno: 232
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
block_cipher = new TwoFish(key);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.run_twofish"
});
ctr.bulk_encrypt({
block_cipher: block_cipher,
iv: iv,
input: input,
progress_hook: progress_hook,
what: "twofish"
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct = arguments[0];
};
})(),
lineno: 234
}));
__iced_deferrals._fulfill();
})(function() {
block_cipher.scrub();
return cb(null, iv.clone().concat(ct));
});
};
})(this));
};
Base.prototype.run_aes = function(_arg, cb) {
var block_cipher, ct, input, iv, key, progress_hook, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
input = _arg.input, key = _arg.key, iv = _arg.iv, progress_hook = _arg.progress_hook;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.run_aes"
});
_this._check_scrubbed(key, "AES", cb, __iced_deferrals.defer({
lineno: 249
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
block_cipher = new AES(key);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Base.run_aes"
});
ctr.bulk_encrypt({
block_cipher: block_cipher,
iv: iv,
input: input,
progress_hook: progress_hook,
what: "aes"
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct = arguments[0];
};
})(),
lineno: 251
}));
__iced_deferrals._fulfill();
})(function() {
block_cipher.scrub();
return cb(null, iv.clone().concat(ct));
});
};
})(this));
};
Base.prototype.scrub = function() {
var key, key_ring, salt, _i, _len, _ref1;
if (this.key != null) {
this.key.scrub();
}
if (this.derived_keys != null) {
_ref1 = this.derived_keys;
for (salt in _ref1) {
key_ring = _ref1[salt];
for (_i = 0, _len = key_ring.length; _i < _len; _i++) {
key = key_ring[_i];
key.scrub();
}
}
}
this.derived_keys = {};
if (this.salt != null) {
this.salt.scrub();
}
this.salt = null;
return this.key = null;
};
return Base;
})();
Encryptor = (function(_super) {
__extends(Encryptor, _super);
function Encryptor(_arg) {
var key, rng, version;
key = _arg.key, rng = _arg.rng, version = _arg.version;
Encryptor.__super__.constructor.call(this, {
key: key,
version: version
});
this.rng = rng || prng.generate;
}
Encryptor.prototype.pick_random_ivs = function(_arg, cb) {
var iv_lens, ivs, k, progress_hook, v, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
progress_hook = _arg.progress_hook;
iv_lens = {
aes: AES.ivSize,
twofish: TwoFish.ivSize,
salsa20: salsa20.Salsa20.ivSize
};
ivs = {};
(function(_this) {
return (function(__iced_k) {
var _i, _k, _keys, _ref1, _results, _while;
_ref1 = iv_lens;
_keys = (function() {
var _results1;
_results1 = [];
for (_k in _ref1) {
_results1.push(_k);
}
return _results1;
})();
_i = 0;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
++_i;
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(_i < _keys.length)) {
return _break();
} else {
k = _keys[_i];
v = _ref1[k];
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.pick_random_ivs"
});
_this.rng(v, __iced_deferrals.defer({
assign_fn: (function(__slot_1, __slot_2) {
return function() {
return __slot_1[__slot_2] = arguments[0];
};
})(ivs, k),
lineno: 353
}));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
return cb(ivs);
};
})(this));
};
Encryptor.prototype.resalt = function(_arg, cb) {
var err, extra_keymaterial, progress_hook, salt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
salt = _arg.salt, extra_keymaterial = _arg.extra_keymaterial, progress_hook = _arg.progress_hook;
err = null;
(function(_this) {
return (function(__iced_k) {
if (salt == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.resalt"
});
_this.rng(_this.version.salt_size, __iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
return __slot_1.salt = arguments[0];
};
})(_this),
lineno: 369
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(salt.length !== _this.version.salt_size ? err = new Error("Need a salt of exactly " + _this.version.salt_size + " bytes (got " + salt.length + ")") : _this.salt = WordArray.alloc(salt));
}
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
if (err == null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.resalt"
});
_this.kdf({
extra_keymaterial: extra_keymaterial,
progress_hook: progress_hook,
salt: _this.salt
}, __iced_deferrals.defer({
assign_fn: (function(__slot_1) {
return function() {
err = arguments[0];
return __slot_1.keys = arguments[1];
};
})(_this),
lineno: 375
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
})(function() {
return cb(err, _this.keys);
});
};
})(this));
};
Encryptor.prototype.run = function(_arg, cb) {
var ct1, ct2, ct3, data, esc, extra_keymaterial, ivs, progress_hook, pt, ret, salt, sig, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
data = _arg.data, salt = _arg.salt, extra_keymaterial = _arg.extra_keymaterial, progress_hook = _arg.progress_hook;
esc = make_esc(cb, "Encryptor::run");
(function(_this) {
return (function(__iced_k) {
if ((salt != null) || (_this.salt == null)) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.run"
});
_this.resalt({
salt: salt,
extra_keymaterial: extra_keymaterial,
progress_hook: progress_hook
}, esc(__iced_deferrals.defer({
lineno: 406
})));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k();
}
});
})(this)((function(_this) {
return function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.run"
});
_this.pick_random_ivs({
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ivs = arguments[0];
};
})(),
lineno: 407
}));
__iced_deferrals._fulfill();
})(function() {
pt = WordArray.from_buffer(data);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.run"
});
_this.run_salsa20({
input: pt,
key: _this.keys.salsa20,
progress_hook: progress_hook,
iv: ivs.salsa20,
output_iv: true
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct1 = arguments[0];
};
})(),
lineno: 409
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.run"
});
_this.run_twofish({
input: ct1,
key: _this.keys.twofish,
progress_hook: progress_hook,
iv: ivs.twofish
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct2 = arguments[0];
};
})(),
lineno: 410
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.run"
});
_this.run_aes({
input: ct2,
key: _this.keys.aes,
progress_hook: progress_hook,
iv: ivs.aes
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ct3 = arguments[0];
};
})(),
lineno: 411
})));
__iced_deferrals._fulfill();
})(function() {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced",
funcname: "Encryptor.run"
});
_this.sign({
input: ct3,
key: _this.keys.hmac,
progress_hook: progress_hook,
salt: _this.salt
}, esc(__iced_deferrals.defer({
assign_fn: (function() {
return function() {
return sig = arguments[0];
};
})(),
lineno: 412
})));
__iced_deferrals._fulfill();
})(function() {
ret = (new WordArray(_this.version.header)).concat(_this.salt).concat(sig).concat(ct3).to_buffer();
util.scrub_buffer(data);
return cb(null, ret);
});
});
});
});
});
};
})(this));
};
return Encryptor;
})(Base);
encrypt = function(_arg, cb) {
var data, enc, err, key, progress_hook, ret, rng, version, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, data = _arg.data, rng = _arg.rng, progress_hook = _arg.progress_hook, version = _arg.version;
enc = new Encryptor({
key: key,
rng: rng,
version: version
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/enc.iced"
});
enc.run({
data: data,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
err = arguments[0];
return ret = arguments[1];
};
})(),
lineno: 440
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
enc.scrub();
return cb(err, ret);
};
})(this));
};
exports.V = V;
exports.encrypt = encrypt;
exports.Base = Base;
exports.Encryptor = Encryptor;
}).call(this);
},{"./aes":173,"./combine":175,"./ctr":176,"./hmac":180,"./pbkdf2":183,"./prng":184,"./salsa20":186,"./scrypt":187,"./sha512":193,"./twofish":194,"./util":195,"./wordarray":196,"iced-error":115,"iced-runtime":118}],180:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var HMAC, HMAC_SHA256, SHA256, SHA512, bulk_sign, iced, sign, util, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
SHA512 = require('./sha512').SHA512;
SHA256 = require('./sha256').SHA256;
util = require('./util');
HMAC = (function() {
HMAC.outputSize = 512 / 8;
HMAC.prototype.outputSize = HMAC.outputSize;
function HMAC(key, klass) {
var i, _i, _ref;
if (klass == null) {
klass = SHA512;
}
this.key = key.clone();
this.hasher = new klass();
this.hasherBlockSize = this.hasher.blockSize;
this.hasherBlockSizeBytes = this.hasherBlockSize * 4;
if (this.key.sigBytes > this.hasherBlockSizeBytes) {
this.key = this.hasher.finalize(this.key);
}
this.key.clamp();
this._oKey = this.key.clone();
this._iKey = this.key.clone();
for (i = _i = 0, _ref = this.hasherBlockSize; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
this._oKey.words[i] ^= 0x5c5c5c5c;
this._iKey.words[i] ^= 0x36363636;
}
this._oKey.sigBytes = this._iKey.sigBytes = this.hasherBlockSizeBytes;
this.reset();
}
HMAC.prototype.get_output_size = function() {
return this.hasher.output_size;
};
HMAC.prototype.reset = function() {
return this.hasher.reset().update(this._iKey);
};
HMAC.prototype.update = function(wa) {
this.hasher.update(wa);
return this;
};
HMAC.prototype.finalize = function(wa) {
var innerHash, innerHash2, out;
innerHash = this.hasher.finalize(wa);
this.hasher.reset();
innerHash2 = this._oKey.clone().concat(innerHash);
out = this.hasher.finalize(innerHash2);
innerHash.scrub();
innerHash2.scrub();
return out;
};
HMAC.prototype.scrub = function() {
this.key.scrub();
this._iKey.scrub();
return this._oKey.scrub();
};
return HMAC;
})();
sign = function(_arg) {
var eng, hash_class, input, key, out;
key = _arg.key, input = _arg.input, hash_class = _arg.hash_class;
eng = new HMAC(key, hash_class);
out = eng.finalize(input.clamp());
eng.scrub();
return out;
};
bulk_sign = function(_arg, cb) {
var eng, input, key, klass, progress_hook, res, slice_args, what, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, input = _arg.input, progress_hook = _arg.progress_hook, klass = _arg.klass, what = _arg.what;
klass || (klass = HMAC);
what || (what = "hmac_sha512");
eng = new klass(key);
input.clamp();
slice_args = {
update: function(lo, hi) {
return eng.update(input.slice(lo, hi));
},
finalize: function() {
return eng.finalize();
},
default_n: eng.hasherBlockSize * 1000
};
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/hmac.iced"
});
util.bulk(input.sigBytes, slice_args, {
what: what,
progress_hook: progress_hook,
cb: __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return res = arguments[0];
};
})(),
lineno: 137
})
});
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
eng.scrub();
return cb(res);
};
})(this));
};
exports.HMAC_SHA256 = HMAC_SHA256 = (function(_super) {
__extends(HMAC_SHA256, _super);
function HMAC_SHA256(key) {
HMAC_SHA256.__super__.constructor.call(this, key, SHA256);
}
return HMAC_SHA256;
})(HMAC);
exports.HMAC = HMAC;
exports.sign = sign;
exports.bulk_sign = bulk_sign;
}).call(this);
},{"./sha256":190,"./sha512":193,"./util":195,"iced-runtime":118}],181:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var hmac, k, v, _ref, _ref1;
_ref = require('./enc');
for (k in _ref) {
v = _ref[k];
exports[k] = v;
}
_ref1 = require('./dec');
for (k in _ref1) {
v = _ref1[k];
exports[k] = v;
}
exports.prng = require('./prng');
exports.Buffer = Buffer;
exports.WordArray = require('./wordarray').WordArray;
exports.util = require('./util');
exports.ciphers = {
AES: require('./aes').AES,
TwoFish: require('./twofish').TwoFish,
Salsa20: require('./salsa20').Salsa20
};
exports.hash = {
SHA1: require('./sha1').SHA1,
SHA224: require('./sha224').SHA224,
SHA256: require('./sha256').SHA256,
SHA384: require('./sha384').SHA384,
SHA512: require('./sha512').SHA512,
SHA3: require('./sha3').SHA3,
MD5: require('./md5').MD5,
RIPEMD160: require('./ripemd160').RIPEMD160
};
exports.modes = {
CTR: require('./ctr')
};
exports.scrypt = require('./scrypt').scrypt;
exports.pbkdf2 = require('./pbkdf2').pbkdf2;
exports.hmac = hmac = require('./hmac');
exports.HMAC_SHA256 = hmac.HMAC_SHA256;
exports.HMAC = hmac.HMAC;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./aes":173,"./ctr":176,"./dec":177,"./enc":179,"./hmac":180,"./md5":182,"./pbkdf2":183,"./prng":184,"./ripemd160":185,"./salsa20":186,"./scrypt":187,"./sha1":188,"./sha224":189,"./sha256":190,"./sha3":191,"./sha384":192,"./sha512":193,"./twofish":194,"./util":195,"./wordarray":196,"buffer":80}],182:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var FF, GG, Global, HH, Hasher, II, MD5, WordArray, glbl,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
WordArray = require('./wordarray').WordArray;
Hasher = require('./algbase').Hasher;
Global = (function() {
function Global() {
var i;
this.T = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 64; i = ++_i) {
_results.push((Math.abs(Math.sin(i + 1)) * 0x100000000) | 0);
}
return _results;
})();
}
return Global;
})();
glbl = new Global();
exports.MD5 = MD5 = (function(_super) {
__extends(MD5, _super);
function MD5() {
return MD5.__super__.constructor.apply(this, arguments);
}
MD5.blockSize = 512 / 32;
MD5.prototype.blockSize = MD5.blockSize;
MD5.output_size = 16;
MD5.prototype.output_size = MD5.output_size;
MD5.prototype._doReset = function() {
return this._hash = new WordArray([0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]);
};
MD5.prototype._doProcessBlock = function(M, offset) {
var H, M_offset_0, M_offset_1, M_offset_10, M_offset_11, M_offset_12, M_offset_13, M_offset_14, M_offset_15, M_offset_2, M_offset_3, M_offset_4, M_offset_5, M_offset_6, M_offset_7, M_offset_8, M_offset_9, M_offset_i, a, b, c, d, i, offset_i, _i;
for (i = _i = 0; _i < 16; i = ++_i) {
offset_i = offset + i;
M_offset_i = M[offset_i];
M[offset_i] = (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) | (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00);
}
H = this._hash.words;
M_offset_0 = M[offset + 0];
M_offset_1 = M[offset + 1];
M_offset_2 = M[offset + 2];
M_offset_3 = M[offset + 3];
M_offset_4 = M[offset + 4];
M_offset_5 = M[offset + 5];
M_offset_6 = M[offset + 6];
M_offset_7 = M[offset + 7];
M_offset_8 = M[offset + 8];
M_offset_9 = M[offset + 9];
M_offset_10 = M[offset + 10];
M_offset_11 = M[offset + 11];
M_offset_12 = M[offset + 12];
M_offset_13 = M[offset + 13];
M_offset_14 = M[offset + 14];
M_offset_15 = M[offset + 15];
a = H[0];
b = H[1];
c = H[2];
d = H[3];
a = FF(a, b, c, d, M_offset_0, 7, glbl.T[0]);
d = FF(d, a, b, c, M_offset_1, 12, glbl.T[1]);
c = FF(c, d, a, b, M_offset_2, 17, glbl.T[2]);
b = FF(b, c, d, a, M_offset_3, 22, glbl.T[3]);
a = FF(a, b, c, d, M_offset_4, 7, glbl.T[4]);
d = FF(d, a, b, c, M_offset_5, 12, glbl.T[5]);
c = FF(c, d, a, b, M_offset_6, 17, glbl.T[6]);
b = FF(b, c, d, a, M_offset_7, 22, glbl.T[7]);
a = FF(a, b, c, d, M_offset_8, 7, glbl.T[8]);
d = FF(d, a, b, c, M_offset_9, 12, glbl.T[9]);
c = FF(c, d, a, b, M_offset_10, 17, glbl.T[10]);
b = FF(b, c, d, a, M_offset_11, 22, glbl.T[11]);
a = FF(a, b, c, d, M_offset_12, 7, glbl.T[12]);
d = FF(d, a, b, c, M_offset_13, 12, glbl.T[13]);
c = FF(c, d, a, b, M_offset_14, 17, glbl.T[14]);
b = FF(b, c, d, a, M_offset_15, 22, glbl.T[15]);
a = GG(a, b, c, d, M_offset_1, 5, glbl.T[16]);
d = GG(d, a, b, c, M_offset_6, 9, glbl.T[17]);
c = GG(c, d, a, b, M_offset_11, 14, glbl.T[18]);
b = GG(b, c, d, a, M_offset_0, 20, glbl.T[19]);
a = GG(a, b, c, d, M_offset_5, 5, glbl.T[20]);
d = GG(d, a, b, c, M_offset_10, 9, glbl.T[21]);
c = GG(c, d, a, b, M_offset_15, 14, glbl.T[22]);
b = GG(b, c, d, a, M_offset_4, 20, glbl.T[23]);
a = GG(a, b, c, d, M_offset_9, 5, glbl.T[24]);
d = GG(d, a, b, c, M_offset_14, 9, glbl.T[25]);
c = GG(c, d, a, b, M_offset_3, 14, glbl.T[26]);
b = GG(b, c, d, a, M_offset_8, 20, glbl.T[27]);
a = GG(a, b, c, d, M_offset_13, 5, glbl.T[28]);
d = GG(d, a, b, c, M_offset_2, 9, glbl.T[29]);
c = GG(c, d, a, b, M_offset_7, 14, glbl.T[30]);
b = GG(b, c, d, a, M_offset_12, 20, glbl.T[31]);
a = HH(a, b, c, d, M_offset_5, 4, glbl.T[32]);
d = HH(d, a, b, c, M_offset_8, 11, glbl.T[33]);
c = HH(c, d, a, b, M_offset_11, 16, glbl.T[34]);
b = HH(b, c, d, a, M_offset_14, 23, glbl.T[35]);
a = HH(a, b, c, d, M_offset_1, 4, glbl.T[36]);
d = HH(d, a, b, c, M_offset_4, 11, glbl.T[37]);
c = HH(c, d, a, b, M_offset_7, 16, glbl.T[38]);
b = HH(b, c, d, a, M_offset_10, 23, glbl.T[39]);
a = HH(a, b, c, d, M_offset_13, 4, glbl.T[40]);
d = HH(d, a, b, c, M_offset_0, 11, glbl.T[41]);
c = HH(c, d, a, b, M_offset_3, 16, glbl.T[42]);
b = HH(b, c, d, a, M_offset_6, 23, glbl.T[43]);
a = HH(a, b, c, d, M_offset_9, 4, glbl.T[44]);
d = HH(d, a, b, c, M_offset_12, 11, glbl.T[45]);
c = HH(c, d, a, b, M_offset_15, 16, glbl.T[46]);
b = HH(b, c, d, a, M_offset_2, 23, glbl.T[47]);
a = II(a, b, c, d, M_offset_0, 6, glbl.T[48]);
d = II(d, a, b, c, M_offset_7, 10, glbl.T[49]);
c = II(c, d, a, b, M_offset_14, 15, glbl.T[50]);
b = II(b, c, d, a, M_offset_5, 21, glbl.T[51]);
a = II(a, b, c, d, M_offset_12, 6, glbl.T[52]);
d = II(d, a, b, c, M_offset_3, 10, glbl.T[53]);
c = II(c, d, a, b, M_offset_10, 15, glbl.T[54]);
b = II(b, c, d, a, M_offset_1, 21, glbl.T[55]);
a = II(a, b, c, d, M_offset_8, 6, glbl.T[56]);
d = II(d, a, b, c, M_offset_15, 10, glbl.T[57]);
c = II(c, d, a, b, M_offset_6, 15, glbl.T[58]);
b = II(b, c, d, a, M_offset_13, 21, glbl.T[59]);
a = II(a, b, c, d, M_offset_4, 6, glbl.T[60]);
d = II(d, a, b, c, M_offset_11, 10, glbl.T[61]);
c = II(c, d, a, b, M_offset_2, 15, glbl.T[62]);
b = II(b, c, d, a, M_offset_9, 21, glbl.T[63]);
H[0] = (H[0] + a) | 0;
H[1] = (H[1] + b) | 0;
H[2] = (H[2] + c) | 0;
return H[3] = (H[3] + d) | 0;
};
MD5.prototype._doFinalize = function() {
var H, H_i, data, dataWords, hash, i, nBitsLeft, nBitsTotal, nBitsTotalH, nBitsTotalL, _i;
data = this._data;
dataWords = data.words;
nBitsTotal = this._nDataBytes * 8;
nBitsLeft = data.sigBytes * 8;
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
nBitsTotalH = Math.floor(nBitsTotal / 0x100000000);
nBitsTotalL = nBitsTotal;
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) | (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) | (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00);
data.sigBytes = (dataWords.length + 1) * 4;
this._process();
hash = this._hash;
H = hash.words;
for (i = _i = 0; _i < 4; i = ++_i) {
H_i = H[i];
H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) | (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
}
return hash;
};
MD5.prototype.copy_to = function(obj) {
MD5.__super__.copy_to.call(this, obj);
return obj._hash = this._hash.clone();
};
MD5.prototype.clone = function() {
var out;
out = new MD5();
this.copy_to(out);
return out;
};
return MD5;
})(Hasher);
FF = function(a, b, c, d, x, s, t) {
var n;
n = a + ((b & c) | (~b & d)) + x + t;
return ((n << s) | (n >>> (32 - s))) + b;
};
GG = function(a, b, c, d, x, s, t) {
var n;
n = a + ((b & d) | (c & ~d)) + x + t;
return ((n << s) | (n >>> (32 - s))) + b;
};
HH = function(a, b, c, d, x, s, t) {
var n;
n = a + (b ^ c ^ d) + x + t;
return ((n << s) | (n >>> (32 - s))) + b;
};
II = function(a, b, c, d, x, s, t) {
var n;
n = a + (c ^ (b | ~d)) + x + t;
return ((n << s) | (n >>> (32 - s))) + b;
};
exports.transform = function(x) {
var out;
out = (new MD5).finalize(x);
x.scrub();
return out;
};
}).call(this);
},{"./algbase":174,"./wordarray":196}],183:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var HMAC, PBKDF2, WordArray, iced, pbkdf2, util, __iced_k, __iced_k_noop;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
HMAC = require('./hmac').HMAC;
WordArray = require('./wordarray').WordArray;
util = require('./util');
PBKDF2 = (function() {
function PBKDF2(_arg) {
this.klass = _arg.klass, this.c = _arg.c;
this.c || (this.c = 1024);
this.klass || (this.klass = HMAC);
}
PBKDF2.prototype._PRF = function(input) {
this.prf.reset();
return this.prf.finalize(input);
};
PBKDF2.prototype._gen_T_i = function(_arg, cb) {
var U, i, progress_hook, ret, salt, seed, stop, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
salt = _arg.salt, i = _arg.i, progress_hook = _arg.progress_hook;
progress_hook(0);
seed = salt.clone().concat(new WordArray([i]));
U = this._PRF(seed);
ret = U.clone();
i = 1;
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(i < _this.c)) {
return _break();
} else {
stop = Math.min(_this.c, i + 128);
while (i < stop) {
U = _this._PRF(U);
ret.xor(U, {});
i++;
}
progress_hook(i);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/pbkdf2.iced",
funcname: "PBKDF2._gen_T_i"
});
util.default_delay(0, 0, __iced_deferrals.defer({
lineno: 57
}));
__iced_deferrals._fulfill();
})(function() {
return _next(null);
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
progress_hook(i);
return cb(ret);
};
})(this));
};
PBKDF2.prototype.run = function(_arg, cb) {
var bs, dkLen, flat, i, key, n, ph, progress_hook, salt, tmp, tph, words, ___iced_passed_deferral, __iced_deferrals, __iced_k, _begin, _end, _positive;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, salt = _arg.salt, dkLen = _arg.dkLen, progress_hook = _arg.progress_hook;
this.prf = new this.klass(key);
bs = this.prf.get_output_size();
n = Math.ceil(dkLen / bs);
words = [];
tph = null;
ph = (function(_this) {
return function(block) {
return function(iter) {
return typeof progress_hook === "function" ? progress_hook({
what: "pbkdf2",
total: n * _this.c,
i: block * _this.c + iter
}) : void 0;
};
};
})(this);
ph(0)(0);
(function(_this) {
return (function(__iced_k) {
var _i, _results, _while;
i = 1;
_begin = 1;
_end = n;
_positive = _end > _begin;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
if (_positive) {
i += 1;
} else {
i -= 1;
}
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!!((_positive === true && i > n) || (_positive === false && i < n))) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/pbkdf2.iced",
funcname: "PBKDF2.run"
});
_this._gen_T_i({
salt: salt,
i: i,
progress_hook: ph(i - 1)
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return tmp = arguments[0];
};
})(),
lineno: 80
}));
__iced_deferrals._fulfill();
})(function() {
return _next(words.push(tmp.words));
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
var _ref;
ph(n)(0);
flat = (_ref = []).concat.apply(_ref, words);
key.scrub();
_this.prf.scrub();
_this.prf = null;
return cb(new WordArray(flat, dkLen));
};
})(this));
};
return PBKDF2;
})();
pbkdf2 = function(_arg, cb) {
var c, dkLen, eng, key, klass, out, progress_hook, salt, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, salt = _arg.salt, klass = _arg.klass, c = _arg.c, dkLen = _arg.dkLen, progress_hook = _arg.progress_hook;
eng = new PBKDF2({
klass: klass,
c: c
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/pbkdf2.iced"
});
eng.run({
key: key,
salt: salt,
dkLen: dkLen,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return out = arguments[0];
};
})(),
lineno: 106
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(out);
};
})(this));
};
exports.pbkdf2 = pbkdf2;
exports.PBKDF2 = PBKDF2;
}).call(this);
},{"./hmac":180,"./util":195,"./wordarray":196,"iced-runtime":118}],184:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var ADRBG, PRNG, WordArray, XOR, browser_rng, e, generate, iced, m, more_entropy, native_rng, rng, util, __iced_k, __iced_k_noop, _browser_rng_primitive, _native_rng, _prng, _ref, _ref1;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
more_entropy = require('more-entropy');
ADRBG = require('./drbg').ADRBG;
WordArray = require('./wordarray').WordArray;
XOR = require('./combine').XOR;
util = require('./util');
_browser_rng_primitive = null;
browser_rng = function(n) {
var v;
v = new Uint8Array(n);
_browser_rng_primitive(v);
return new Buffer(v);
};
_browser_rng_primitive = (m = typeof window !== "undefined" && window !== null ? (_ref = window.crypto) != null ? _ref.getRandomValues : void 0 : void 0) != null ? m.bind(window.crypto) : (m = typeof window !== "undefined" && window !== null ? (_ref1 = window.msCrypto) != null ? _ref1.getRandomValues : void 0 : void 0) != null ? m.bind(window.msCrypto) : null;
if (_browser_rng_primitive != null) {
_native_rng = browser_rng;
} else {
try {
rng = require('cry' + 'pto').rng;
if (rng != null) {
_native_rng = rng;
}
} catch (_error) {
e = _error;
}
}
native_rng = function(x) {
if (_native_rng == null) {
throw new Error('No rng found; tried requiring "crypto" and window.crypto');
}
return _native_rng(x);
};
PRNG = (function() {
function PRNG() {
this.meg = new more_entropy.Generator();
this.adrbg = new ADRBG(((function(_this) {
return function(n, cb) {
return _this.gen_seed(n, cb);
};
})(this)), XOR.sign);
}
PRNG.prototype.now_to_buffer = function() {
var buf, d, ms, s;
d = Date.now();
ms = d % 1000;
s = Math.floor(d / 1000);
buf = new Buffer(8);
buf.writeUInt32BE(s, 0);
buf.writeUInt32BE(ms, 4);
return buf;
};
PRNG.prototype.gen_seed = function(nbits, cb) {
var b, bufs, cat, nbytes, wa, words, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
nbytes = nbits / 8;
bufs = [];
bufs.push(this.now_to_buffer());
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/chris/git/keybase/triplesec/src/prng.iced",
funcname: "PRNG.gen_seed"
});
_this.meg.generate(nbits, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return words = arguments[0];
};
})(),
lineno: 83
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
var _i, _len;
bufs.push(_this.now_to_buffer());
bufs.push(new Buffer(words));
bufs.push(native_rng(nbytes));
bufs.push(_this.now_to_buffer());
cat = Buffer.concat(bufs);
wa = WordArray.from_buffer(cat);
util.scrub_buffer(cat);
for (_i = 0, _len = bufs.length; _i < _len; _i++) {
b = bufs[_i];
util.scrub_buffer(b);
}
return cb(wa);
};
})(this));
};
PRNG.prototype.generate = function(n, cb) {
return this.adrbg.generate(n, cb);
};
return PRNG;
})();
_prng = null;
generate = function(n, cb) {
if (_prng == null) {
_prng = new PRNG();
}
return _prng.generate(n, cb);
};
exports.PRNG = PRNG;
exports.generate = generate;
exports.native_rng = native_rng;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./combine":175,"./drbg":178,"./util":195,"./wordarray":196,"buffer":80,"iced-runtime":118,"more-entropy":199}],185:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var G, Global, Hasher, RIPEMD160, WordArray, X64Word, X64WordArray, f1, f2, f3, f4, f5, rotl, transform, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
_ref = require('./wordarray'), WordArray = _ref.WordArray, X64Word = _ref.X64Word, X64WordArray = _ref.X64WordArray;
Hasher = require('./algbase').Hasher;
Global = (function() {
function Global() {
this._zl = new WordArray([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]);
this._zr = new WordArray([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]);
this._sl = new WordArray([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]);
this._sr = new WordArray([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]);
this._hl = new WordArray([0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);
this._hr = new WordArray([0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);
}
return Global;
})();
G = new Global();
RIPEMD160 = (function(_super) {
__extends(RIPEMD160, _super);
function RIPEMD160() {
return RIPEMD160.__super__.constructor.apply(this, arguments);
}
RIPEMD160.blockSize = 512 / 32;
RIPEMD160.prototype.blockSize = RIPEMD160.blockSize;
RIPEMD160.output_size = 160 / 8;
RIPEMD160.prototype.output_size = RIPEMD160.output_size;
RIPEMD160.prototype._doReset = function() {
return this._hash = new WordArray([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);
};
RIPEMD160.prototype.get_output_size = function() {
return this.output_size;
};
RIPEMD160.prototype._doProcessBlock = function(M, offset) {
var H, M_offset_i, al, ar, bl, br, cl, cr, dl, dr, el, er, hl, hr, i, offset_i, sl, sr, t, zl, zr, _i, _j;
for (i = _i = 0; _i < 16; i = ++_i) {
offset_i = offset + i;
M_offset_i = M[offset_i];
M[offset_i] = (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) | (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00);
}
H = this._hash.words;
hl = G._hl.words;
hr = G._hr.words;
zl = G._zl.words;
zr = G._zr.words;
sl = G._sl.words;
sr = G._sr.words;
ar = al = H[0];
br = bl = H[1];
cr = cl = H[2];
dr = dl = H[3];
er = el = H[4];
for (i = _j = 0; _j < 80; i = ++_j) {
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 {
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 {
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;
}
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;
return H[0] = t;
};
RIPEMD160.prototype._doFinalize = function() {
var H, H_i, data, dataWords, hash, i, nBitsLeft, nBitsTotal, _i;
data = this._data;
dataWords = data.words;
nBitsTotal = this._nDataBytes * 8;
nBitsLeft = data.sigBytes * 8;
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) | (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00);
data.sigBytes = (dataWords.length + 1) * 4;
this._process();
hash = this._hash;
H = hash.words;
for (i = _i = 0; _i < 5; i = ++_i) {
H_i = H[i];
H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) | (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
}
return hash;
};
RIPEMD160.prototype.scrub = function() {
return this._hash.scrub();
};
RIPEMD160.prototype.copy_to = function(obj) {
RIPEMD160.__super__.copy_to.call(this, obj);
return obj._hash = this._hash.clone();
};
RIPEMD160.prototype.clone = function() {
var out;
out = new RIPEMD160();
this.copy_to(out);
return out;
};
return RIPEMD160;
})(Hasher);
f1 = function(x, y, z) {
return x ^ y ^ z;
};
f2 = function(x, y, z) {
return (x & y) | ((~x) & z);
};
f3 = function(x, y, z) {
return (x | (~y)) ^ z;
};
f4 = function(x, y, z) {
return (x & z) | (y & (~z));
};
f5 = function(x, y, z) {
return x ^ (y | (~z));
};
rotl = function(x, n) {
return (x << n) | (x >>> (32 - n));
};
transform = function(x) {
var out;
out = (new RIPEMD160).finalize(x);
x.scrub();
return out;
};
exports.RIPEMD160 = RIPEMD160;
exports.transform = transform;
}).call(this);
},{"./algbase":174,"./wordarray":196}],186:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Cipher, Counter, Salsa20, Salsa20Core, Salsa20InnerCore, Salsa20WordStream, StreamCipher, WordArray, asum, bulk_encrypt, encrypt, endian_reverse, fixup_uint32, iced, util, __iced_k, __iced_k_noop, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
_ref = require('./wordarray'), endian_reverse = _ref.endian_reverse, WordArray = _ref.WordArray;
Counter = require('./ctr').Counter;
fixup_uint32 = require('./util').fixup_uint32;
StreamCipher = require('./algbase').StreamCipher;
util = require('./util');
asum = function(out, v) {
var e, i, _i, _len;
for (i = _i = 0, _len = v.length; _i < _len; i = ++_i) {
e = v[i];
out[i] += e;
}
return false;
};
Salsa20InnerCore = (function() {
function Salsa20InnerCore(rounds) {
this.rounds = rounds;
}
Salsa20InnerCore.prototype._core = function(v) {
"use asm";
var i, u, x0, x1, x10, x11, x12, x13, x14, x15, x2, x3, x4, x5, x6, x7, x8, x9, _i, _ref1;
x0 = v[0], x1 = v[1], x2 = v[2], x3 = v[3], x4 = v[4], x5 = v[5], x6 = v[6], x7 = v[7], x8 = v[8], x9 = v[9], x10 = v[10], x11 = v[11], x12 = v[12], x13 = v[13], x14 = v[14], x15 = v[15];
for (i = _i = 0, _ref1 = this.rounds; _i < _ref1; i = _i += 2) {
u = (x0 + x12) | 0;
x4 ^= (u << 7) | (u >>> 25);
u = (x4 + x0) | 0;
x8 ^= (u << 9) | (u >>> 23);
u = (x8 + x4) | 0;
x12 ^= (u << 13) | (u >>> 19);
u = (x12 + x8) | 0;
x0 ^= (u << 18) | (u >>> 14);
u = (x5 + x1) | 0;
x9 ^= (u << 7) | (u >>> 25);
u = (x9 + x5) | 0;
x13 ^= (u << 9) | (u >>> 23);
u = (x13 + x9) | 0;
x1 ^= (u << 13) | (u >>> 19);
u = (x1 + x13) | 0;
x5 ^= (u << 18) | (u >>> 14);
u = (x10 + x6) | 0;
x14 ^= (u << 7) | (u >>> 25);
u = (x14 + x10) | 0;
x2 ^= (u << 9) | (u >>> 23);
u = (x2 + x14) | 0;
x6 ^= (u << 13) | (u >>> 19);
u = (x6 + x2) | 0;
x10 ^= (u << 18) | (u >>> 14);
u = (x15 + x11) | 0;
x3 ^= (u << 7) | (u >>> 25);
u = (x3 + x15) | 0;
x7 ^= (u << 9) | (u >>> 23);
u = (x7 + x3) | 0;
x11 ^= (u << 13) | (u >>> 19);
u = (x11 + x7) | 0;
x15 ^= (u << 18) | (u >>> 14);
u = (x0 + x3) | 0;
x1 ^= (u << 7) | (u >>> 25);
u = (x1 + x0) | 0;
x2 ^= (u << 9) | (u >>> 23);
u = (x2 + x1) | 0;
x3 ^= (u << 13) | (u >>> 19);
u = (x3 + x2) | 0;
x0 ^= (u << 18) | (u >>> 14);
u = (x5 + x4) | 0;
x6 ^= (u << 7) | (u >>> 25);
u = (x6 + x5) | 0;
x7 ^= (u << 9) | (u >>> 23);
u = (x7 + x6) | 0;
x4 ^= (u << 13) | (u >>> 19);
u = (x4 + x7) | 0;
x5 ^= (u << 18) | (u >>> 14);
u = (x10 + x9) | 0;
x11 ^= (u << 7) | (u >>> 25);
u = (x11 + x10) | 0;
x8 ^= (u << 9) | (u >>> 23);
u = (x8 + x11) | 0;
x9 ^= (u << 13) | (u >>> 19);
u = (x9 + x8) | 0;
x10 ^= (u << 18) | (u >>> 14);
u = (x15 + x14) | 0;
x12 ^= (u << 7) | (u >>> 25);
u = (x12 + x15) | 0;
x13 ^= (u << 9) | (u >>> 23);
u = (x13 + x12) | 0;
x14 ^= (u << 13) | (u >>> 19);
u = (x14 + x13) | 0;
x15 ^= (u << 18) | (u >>> 14);
}
return [x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15];
};
return Salsa20InnerCore;
})();
Salsa20Core = (function(_super) {
__extends(Salsa20Core, _super);
Salsa20Core.prototype.sigma = WordArray.from_buffer_le(new Buffer("expand 32-byte k"));
Salsa20Core.prototype.tau = WordArray.from_buffer_le(new Buffer("expand 16-byte k"));
Salsa20Core.blockSize = 64;
Salsa20Core.prototype.blockSize = Salsa20Core.blockSize;
Salsa20Core.keySize = 32;
Salsa20Core.prototype.keySize = Salsa20Core.keySize;
Salsa20Core.ivSize = 192 / 8;
Salsa20Core.prototype.ivSize = Salsa20Core.ivSize;
function Salsa20Core(key, nonce) {
var _ref1;
Salsa20Core.__super__.constructor.call(this, 20);
this.key = key.clone().endian_reverse();
this.nonce = nonce.clone().endian_reverse();
if (!(((this.key.sigBytes === 16) && (this.nonce.sigBytes === 8)) || ((this.key.sigBytes === 32) && ((_ref1 = this.nonce.sigBytes) === 8 || _ref1 === 24)))) {
throw new Error("Bad key/nonce lengths");
}
if (this.nonce.sigBytes === 24) {
this.xsalsa_setup();
}
this.input = this.key_iv_setup(this.nonce, this.key);
this._reset();
}
Salsa20Core.prototype.scrub = function() {
this.key.scrub();
this.nonce.scrub();
return util.scrub_vec(this.input);
};
Salsa20Core.prototype.xsalsa_setup = function() {
var n0, n1;
n0 = new WordArray(this.nonce.words.slice(0, 4));
this.nonce = n1 = new WordArray(this.nonce.words.slice(4));
return this.key = this.hsalsa20(n0, this.key);
};
Salsa20Core.prototype.hsalsa20 = function(nonce, key) {
var i, indexes, input, v;
input = this.key_iv_setup(nonce, key);
input[8] = nonce.words[2];
input[9] = nonce.words[3];
v = this._core(input);
indexes = [0, 5, 10, 15, 6, 7, 8, 9];
v = (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = indexes.length; _i < _len; _i++) {
i = indexes[_i];
_results.push(fixup_uint32(v[i]));
}
return _results;
})();
util.scrub_vec(input);
return new WordArray(v);
};
Salsa20Core.prototype.key_iv_setup = function(nonce, key) {
var A, C, i, out, _i, _j, _k, _ref1;
out = [];
for (i = _i = 0; _i < 4; i = ++_i) {
out[i + 1] = key.words[i];
}
_ref1 = key.sigBytes === 32 ? [this.sigma, key.words.slice(4)] : [this.tau, key.words], C = _ref1[0], A = _ref1[1];
for (i = _j = 0; _j < 4; i = ++_j) {
out[i + 11] = A[i];
}
for (i = _k = 0; _k < 4; i = ++_k) {
out[i * 5] = C.words[i];
}
out[6] = nonce.words[0];
out[7] = nonce.words[1];
return out;
};
Salsa20Core.prototype.counter_setup = function() {
this.input[8] = this.counter.get().words[0];
return this.input[9] = this.counter.get().words[1];
};
Salsa20Core.prototype._reset = function() {
return this.counter = new Counter({
len: 2
});
};
Salsa20Core.prototype._generateBlock = function() {
var v;
this.counter_setup();
v = this._core(this.input);
asum(v, this.input);
this.counter.inc_le();
return v;
};
return Salsa20Core;
})(Salsa20InnerCore);
exports.Salsa20WordStream = Salsa20WordStream = (function(_super) {
__extends(Salsa20WordStream, _super);
function Salsa20WordStream() {
return Salsa20WordStream.__super__.constructor.apply(this, arguments);
}
Salsa20WordStream.prototype._reset = function() {
return Salsa20WordStream.__super__._reset.call(this);
};
Salsa20WordStream.prototype.getWordArray = function(nbytes) {
var blocks, i, nblocks, w, words, _i, _len, _ref1;
if ((nbytes == null) || nbytes === this.blockSize) {
words = this._generateBlock();
} else {
nblocks = Math.ceil(nbytes / this.blockSize);
blocks = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; 0 <= nblocks ? _i < nblocks : _i > nblocks; i = 0 <= nblocks ? ++_i : --_i) {
_results.push(this._generateBlock());
}
return _results;
}).call(this);
words = (_ref1 = []).concat.apply(_ref1, blocks);
}
for (i = _i = 0, _len = words.length; _i < _len; i = ++_i) {
w = words[i];
words[i] = endian_reverse(w);
}
return new WordArray(words, nbytes);
};
return Salsa20WordStream;
})(Salsa20Core);
exports.Salsa20 = Salsa20 = (function(_super) {
__extends(Salsa20, _super);
function Salsa20() {
return Salsa20.__super__.constructor.apply(this, arguments);
}
Salsa20.prototype._reset = function() {
Salsa20.__super__._reset.call(this);
return this._i = this.blockSize;
};
Salsa20.prototype.getBytes = function(needed) {
var bsz, n, v;
if (needed == null) {
needed = this.blockSize;
}
v = [];
bsz = this.blockSize;
if ((this._i === bsz) && (needed === bsz)) {
return this._generateBlockBuffer();
} else {
while (needed > 0) {
if (this._i === bsz) {
this._generateBlockBuffer();
this._i = 0;
}
n = Math.min(needed, bsz - this._i);
v.push((n === bsz ? this._buf : this._buf.slice(this._i, this._i + n)));
this._i += n;
needed -= n;
}
return Buffer.concat(v);
}
};
Salsa20.prototype._generateBlockBuffer = function() {
var e, i, v, _i, _len;
this._buf = new Buffer(this.blockSize);
v = this._generateBlock();
for (i = _i = 0, _len = v.length; _i < _len; i = ++_i) {
e = v[i];
this._buf.writeUInt32LE(fixup_uint32(e), i * 4);
}
return this._buf;
};
return Salsa20;
})(Salsa20Core);
exports.Cipher = Cipher = (function(_super) {
__extends(Cipher, _super);
function Cipher(_arg) {
var iv, key;
key = _arg.key, iv = _arg.iv;
Cipher.__super__.constructor.call(this);
this.salsa = new Salsa20WordStream(key, iv);
this.bsiw = this.salsa.blockSize / 4;
}
Cipher.prototype.scrub = function() {
return this.salsa.scrub();
};
Cipher.prototype.get_pad = function() {
var pad;
pad = this.salsa.getWordArray();
return pad;
};
return Cipher;
})(StreamCipher);
exports.encrypt = encrypt = function(_arg) {
var cipher, input, iv, key, ret;
key = _arg.key, iv = _arg.iv, input = _arg.input;
cipher = new Cipher({
key: key,
iv: iv
});
ret = cipher.encrypt(input);
cipher.scrub();
return ret;
};
exports.bulk_encrypt = bulk_encrypt = function(_arg, cb) {
var cipher, input, iv, key, progress_hook, ret, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, iv = _arg.iv, input = _arg.input, progress_hook = _arg.progress_hook;
cipher = new Cipher({
key: key,
iv: iv
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/salsa20.iced"
});
cipher.bulk_encrypt({
input: input,
progress_hook: progress_hook,
what: "salsa20"
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return ret = arguments[0];
};
})(),
lineno: 257
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
cipher.scrub();
return cb(ret);
};
})(this));
};
exports.Salsa20InnerCore = Salsa20InnerCore;
exports.endian_reverse = endian_reverse;
exports.asum = asum;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./algbase":174,"./ctr":176,"./util":195,"./wordarray":196,"buffer":80,"iced-runtime":118}],187:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var HMAC_SHA256, Salsa20InnerCore, Scrypt, Timer, WordArray, blkcpy, blkxor, default_delay, endian_reverse, fixup_uint32, iced, pbkdf2, scrub_vec, scrypt, timer, ui8a_to_buffer, v_endian_reverse, __iced_k, __iced_k_noop, _ref, _ref1, _ref2;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
HMAC_SHA256 = require('./hmac').HMAC_SHA256;
pbkdf2 = require('./pbkdf2').pbkdf2;
_ref = require('./salsa20'), endian_reverse = _ref.endian_reverse, Salsa20InnerCore = _ref.Salsa20InnerCore;
_ref1 = require('./wordarray'), ui8a_to_buffer = _ref1.ui8a_to_buffer, WordArray = _ref1.WordArray;
_ref2 = require('./util'), fixup_uint32 = _ref2.fixup_uint32, default_delay = _ref2.default_delay, scrub_vec = _ref2.scrub_vec;
Timer = (function() {
function Timer() {
this.tot = 0;
}
Timer.prototype.start = function() {
return this._t = Date.now();
};
Timer.prototype.stop = function() {
return this.tot += Date.now() - this._t;
};
return Timer;
})();
timer = new Timer();
blkcpy = function(D, S, d_offset, s_offset, len) {
"use asm";
var end, i, j;
j = (d_offset << 4) | 0;
i = (s_offset << 4) | 0;
end = (i + (len << 4)) | 0;
while (i < end) {
D[j] = S[i];
D[j + 1] = S[i + 1];
D[j + 2] = S[i + 2];
D[j + 3] = S[i + 3];
D[j + 4] = S[i + 4];
D[j + 5] = S[i + 5];
D[j + 6] = S[i + 6];
D[j + 7] = S[i + 7];
D[j + 8] = S[i + 8];
D[j + 9] = S[i + 9];
D[j + 10] = S[i + 10];
D[j + 11] = S[i + 11];
D[j + 12] = S[i + 12];
D[j + 13] = S[i + 13];
D[j + 14] = S[i + 14];
D[j + 15] = S[i + 15];
i += 16;
j += 16;
}
return true;
};
blkxor = function(D, S, s_offset, len) {
"use asm";
var i, j;
len = (len << 4) | 0;
i = 0;
j = (s_offset << 4) | 0;
while (i < len) {
D[i] ^= S[j];
D[i + 1] ^= S[j + 1];
D[i + 2] ^= S[j + 2];
D[i + 3] ^= S[j + 3];
D[i + 4] ^= S[j + 4];
D[i + 5] ^= S[j + 5];
D[i + 6] ^= S[j + 6];
D[i + 7] ^= S[j + 7];
D[i + 8] ^= S[j + 8];
D[i + 9] ^= S[j + 9];
D[i + 10] ^= S[j + 10];
D[i + 11] ^= S[j + 11];
D[i + 12] ^= S[j + 12];
D[i + 13] ^= S[j + 13];
D[i + 14] ^= S[j + 14];
D[i + 15] ^= S[j + 15];
i += 16;
j += 16;
}
return true;
};
v_endian_reverse = function(v) {
var e, i, _i, _len;
for (i = _i = 0, _len = v.length; _i < _len; i = ++_i) {
e = v[i];
v[i] = endian_reverse(e);
}
return true;
};
Scrypt = (function() {
function Scrypt(_arg) {
var N, c, c0, c1;
N = _arg.N, this.r = _arg.r, this.p = _arg.p, c = _arg.c, c0 = _arg.c0, c1 = _arg.c1, this.klass = _arg.klass;
this.N || (this.N = 1 << (N || 15));
this.r || (this.r = 8);
this.p || (this.p = 1);
this.c0 = c0 || c || 1;
this.c1 = c1 || c || 1;
this.klass || (this.klass = HMAC_SHA256);
this.X16_tmp = new Int32Array(0x10);
this.s20ic = new Salsa20InnerCore(8);
}
Scrypt.prototype.salsa20_8 = function(B) {
var X, i, x, _i, _len;
X = this.s20ic._core(B);
for (i = _i = 0, _len = X.length; _i < _len; i = ++_i) {
x = X[i];
B[i] += x;
}
return true;
};
Scrypt.prototype.pbkdf2 = function(_arg, cb) {
var c, dkLen, key, progress_hook, salt, wa, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, salt = _arg.salt, dkLen = _arg.dkLen, progress_hook = _arg.progress_hook, c = _arg.c;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced",
funcname: "Scrypt.pbkdf2"
});
pbkdf2({
key: key,
salt: salt,
c: c,
dkLen: dkLen,
klass: _this.klass,
progress_hook: progress_hook
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return wa = arguments[0];
};
})(),
lineno: 113
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(wa);
};
})(this));
};
Scrypt.prototype.blockmix_salsa8 = function(B, Y) {
var X, i, _i, _ref3;
X = this.X16_tmp;
blkcpy(X, B, 0, 2 * this.r - 1, 1);
for (i = _i = 0, _ref3 = 2 * this.r; 0 <= _ref3 ? _i < _ref3 : _i > _ref3; i = 0 <= _ref3 ? ++_i : --_i) {
blkxor(X, B, i, 1);
this.salsa20_8(X);
blkcpy(Y, X, i, 0, 1);
}
i = 0;
while (i < this.r) {
blkcpy(B, Y, i, i * 2, 1);
i++;
}
i = 0;
while (i < this.r) {
blkcpy(B, Y, i + this.r, i * 2 + 1, 1);
i++;
}
return true;
};
Scrypt.prototype.smix = function(_arg, cb) {
var B, V, X, XY, Y, i, j, lim, progress_hook, stop, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
B = _arg.B, V = _arg.V, XY = _arg.XY, progress_hook = _arg.progress_hook;
X = XY;
lim = 2 * this.r;
Y = XY.subarray(0x10 * lim);
blkcpy(X, B, 0, 0, lim);
i = 0;
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(i < _this.N)) {
return _break();
} else {
stop = Math.min(_this.N, i + 2048);
while (i < stop) {
blkcpy(V, X, lim * i, 0, lim);
_this.blockmix_salsa8(X, Y);
i++;
}
if (typeof progress_hook === "function") {
progress_hook(i);
}
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced",
funcname: "Scrypt.smix"
});
default_delay(0, 0, __iced_deferrals.defer({
lineno: 170
}));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
i = 0;
(function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(i < _this.N)) {
return _break();
} else {
stop = Math.min(_this.N, i + 256);
while (i < stop) {
j = fixup_uint32(X[0x10 * (lim - 1)]) & (_this.N - 1);
blkxor(X, V, j * lim, lim);
_this.blockmix_salsa8(X, Y);
i++;
}
if (typeof progress_hook === "function") {
progress_hook(i + _this.N);
}
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced",
funcname: "Scrypt.smix"
});
default_delay(0, 0, __iced_deferrals.defer({
lineno: 187
}));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
})(function() {
blkcpy(B, X, 0, 0, lim);
return cb();
});
};
})(this));
};
Scrypt.prototype.run = function(_arg, cb) {
var B, MAX, V, XY, dkLen, err, j, key, lph, out, progress_hook, ret, salt, ___iced_passed_deferral, __iced_deferrals, __iced_k, _begin, _end, _positive;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, salt = _arg.salt, dkLen = _arg.dkLen, progress_hook = _arg.progress_hook;
MAX = 0xffffffff;
err = ret = null;
err = dkLen > MAX ? err = new Error("asked for too much data") : this.r * this.p >= (1 << 30) ? new Error("r & p are too big") : (this.r > MAX / 128 / this.p) || (this.r > MAX / 256) || (this.N > MAX / 128 / this.r) ? new Error("N is too big") : null;
XY = new Int32Array(64 * this.r);
V = new Int32Array(32 * this.r * this.N);
lph = function(o) {
o.what += " (pass 1)";
return typeof progress_hook === "function" ? progress_hook(o) : void 0;
};
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced",
funcname: "Scrypt.run"
});
_this.pbkdf2({
key: key.clone(),
salt: salt,
dkLen: 128 * _this.r * _this.p,
c: _this.c0,
progress_hook: lph
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return B = arguments[0];
};
})(),
lineno: 218
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
B = new Int32Array(B.words);
v_endian_reverse(B);
lph = function(j) {
return function(i) {
return typeof progress_hook === "function" ? progress_hook({
i: i + j * _this.N * 2,
what: "scrypt",
total: _this.p * _this.N * 2
}) : void 0;
};
};
(function(__iced_k) {
var _i, _results, _while;
j = 0;
_begin = 0;
_end = _this.p;
_positive = _end > _begin;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
if (_positive) {
j += 1;
} else {
j -= 1;
}
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!!((_positive === true && j >= _this.p) || (_positive === false && j <= _this.p))) {
return _break();
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced",
funcname: "Scrypt.run"
});
_this.smix({
B: B.subarray(32 * _this.r * j),
V: V,
XY: XY,
progress_hook: lph(j)
}, __iced_deferrals.defer({
lineno: 225
}));
__iced_deferrals._fulfill();
})(_next);
}
};
_while(__iced_k);
})(function() {
v_endian_reverse(B);
lph = function(o) {
o.what += " (pass 2)";
return typeof progress_hook === "function" ? progress_hook(o) : void 0;
};
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced",
funcname: "Scrypt.run"
});
_this.pbkdf2({
key: key,
salt: WordArray.from_i32a(B),
dkLen: dkLen,
c: _this.c1,
progress_hook: lph
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return out = arguments[0];
};
})(),
lineno: 233
}));
__iced_deferrals._fulfill();
})(function() {
scrub_vec(XY);
scrub_vec(V);
scrub_vec(B);
key.scrub();
return cb(out);
});
});
};
})(this));
};
return Scrypt;
})();
scrypt = function(_arg, cb) {
var N, c, c0, c1, dkLen, eng, key, klass, p, progress_hook, r, salt, wa, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
key = _arg.key, salt = _arg.salt, r = _arg.r, N = _arg.N, p = _arg.p, c0 = _arg.c0, c1 = _arg.c1, c = _arg.c, klass = _arg.klass, progress_hook = _arg.progress_hook, dkLen = _arg.dkLen;
eng = new Scrypt({
r: r,
N: N,
p: p,
c: c,
c0: c0,
c1: c1,
klass: klass
});
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/scrypt.iced"
});
eng.run({
key: key,
salt: salt,
progress_hook: progress_hook,
dkLen: dkLen
}, __iced_deferrals.defer({
assign_fn: (function() {
return function() {
return wa = arguments[0];
};
})(),
lineno: 263
}));
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb(wa);
};
})(this));
};
exports.Scrypt = Scrypt;
exports.scrypt = scrypt;
exports.v_endian_reverse = v_endian_reverse;
}).call(this);
},{"./hmac":180,"./pbkdf2":183,"./salsa20":186,"./util":195,"./wordarray":196,"iced-runtime":118}],188:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Hasher, SHA1, W, WordArray, transform,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
WordArray = require('./wordarray').WordArray;
Hasher = require('./algbase').Hasher;
W = [];
SHA1 = (function(_super) {
__extends(SHA1, _super);
function SHA1() {
return SHA1.__super__.constructor.apply(this, arguments);
}
SHA1.blockSize = 512 / 32;
SHA1.prototype.blockSize = SHA1.blockSize;
SHA1.output_size = 20;
SHA1.prototype.output_size = SHA1.output_size;
SHA1.prototype._doReset = function() {
return this._hash = new WordArray([0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0]);
};
SHA1.prototype._doProcessBlock = function(M, offset) {
var H, a, b, c, d, e, i, n, t, _i;
H = this._hash.words;
a = H[0];
b = H[1];
c = H[2];
d = H[3];
e = H[4];
for (i = _i = 0; _i < 80; i = ++_i) {
if (i < 16) {
W[i] = M[offset + i] | 0;
} else {
n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];
W[i] = (n << 1) | (n >>> 31);
}
t = ((a << 5) | (a >>> 27)) + e + W[i];
if (i < 20) {
t += ((b & c) | (~b & d)) + 0x5a827999;
} else if (i < 40) {
t += (b ^ c ^ d) + 0x6ed9eba1;
} else if (i < 60) {
t += ((b & c) | (b & d) | (c & d)) - 0x70e44324;
} else {
t += (b ^ c ^ d) - 0x359d3e2a;
}
e = d;
d = c;
c = (b << 30) | (b >>> 2);
b = a;
a = t;
}
H[0] = (H[0] + a) | 0;
H[1] = (H[1] + b) | 0;
H[2] = (H[2] + c) | 0;
H[3] = (H[3] + d) | 0;
return H[4] = (H[4] + e) | 0;
};
SHA1.prototype._doFinalize = function() {
var data, dataWords, nBitsLeft, nBitsTotal;
data = this._data;
dataWords = data.words;
nBitsTotal = this._nDataBytes * 8;
nBitsLeft = data.sigBytes * 8;
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;
data.sigBytes = dataWords.length * 4;
this._process();
return this._hash;
};
SHA1.prototype.copy_to = function(obj) {
SHA1.__super__.copy_to.call(this, obj);
return obj._hash = this._hash.clone();
};
SHA1.prototype.clone = function() {
var out;
out = new SHA1();
this.copy_to(out);
return out;
};
return SHA1;
})(Hasher);
transform = transform = function(x) {
var out;
out = (new SHA1).finalize(x);
x.scrub();
return out;
};
exports.SHA1 = SHA1;
exports.transform = transform;
}).call(this);
},{"./algbase":174,"./wordarray":196}],189:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var SHA224, SHA256, WordArray, transform,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
WordArray = require('./wordarray').WordArray;
SHA256 = require('./sha256').SHA256;
SHA224 = (function(_super) {
__extends(SHA224, _super);
function SHA224() {
return SHA224.__super__.constructor.apply(this, arguments);
}
SHA224.output_size = 224 / 8;
SHA224.prototype.output_size = SHA224.output_size;
SHA224.prototype._doReset = function() {
return this._hash = new WordArray([0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4]);
};
SHA224.prototype._doFinalize = function() {
var hash;
hash = SHA224.__super__._doFinalize.call(this);
hash.sigBytes -= 4;
return hash;
};
SHA224.prototype.clone = function() {
var out;
out = new SHA224();
this.copy_to(out);
return out;
};
return SHA224;
})(SHA256);
transform = function(x) {
var out;
out = (new SHA224).finalize(x);
x.scrub();
return out;
};
exports.SHA224 = SHA224;
exports.transform = transform;
}).call(this);
},{"./sha256":190,"./wordarray":196}],190:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Global, Hasher, SHA256, WordArray, glbl, transform,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
WordArray = require('./wordarray').WordArray;
Hasher = require('./algbase').Hasher;
Global = (function() {
function Global() {
this.H = [];
this.K = [];
this.W = [];
this.init();
}
Global.prototype.isPrime = function(n) {
var f, sqn, _i;
if (n === 2 || n === 3 || n === 5 || n === 7) {
return true;
}
if (n === 1 || n === 4 || n === 6 || n === 8 || n === 9) {
return false;
}
sqn = Math.ceil(Math.sqrt(n));
for (f = _i = 2; 2 <= sqn ? _i <= sqn : _i >= sqn; f = 2 <= sqn ? ++_i : --_i) {
if ((n % f) === 0) {
return false;
}
}
return true;
};
Global.prototype.getFractionalBits = function(n) {
return ((n - (n | 0)) * 0x100000000) | 0;
};
Global.prototype.init = function() {
var n, nPrime, _results;
n = 2;
nPrime = 0;
_results = [];
while (nPrime < 64) {
if (this.isPrime(n)) {
if (nPrime < 8) {
this.H[nPrime] = this.getFractionalBits(Math.pow(n, 1 / 2));
}
this.K[nPrime] = this.getFractionalBits(Math.pow(n, 1 / 3));
nPrime++;
}
_results.push(n++);
}
return _results;
};
return Global;
})();
glbl = new Global();
SHA256 = (function(_super) {
__extends(SHA256, _super);
function SHA256() {
return SHA256.__super__.constructor.apply(this, arguments);
}
SHA256.blockSize = 512 / 32;
SHA256.prototype.blockSize = SHA256.blockSize;
SHA256.output_size = 256 / 8;
SHA256.prototype.output_size = SHA256.output_size;
SHA256.prototype._doReset = function() {
return this._hash = new WordArray(glbl.H.slice(0));
};
SHA256.prototype.get_output_size = function() {
return this.output_size;
};
SHA256.prototype._doProcessBlock = function(M, offset) {
var H, K, W, a, b, c, ch, d, e, f, g, gamma0, gamma0x, gamma1, gamma1x, h, i, maj, sigma0, sigma1, t1, t2, _i;
H = this._hash.words;
W = glbl.W;
K = glbl.K;
a = H[0];
b = H[1];
c = H[2];
d = H[3];
e = H[4];
f = H[5];
g = H[6];
h = H[7];
for (i = _i = 0; _i < 64; i = ++_i) {
if (i < 16) {
W[i] = M[offset + i] | 0;
} else {
gamma0x = W[i - 15];
gamma0 = ((gamma0x << 25) | (gamma0x >>> 7)) ^ ((gamma0x << 14) | (gamma0x >>> 18)) ^ (gamma0x >>> 3);
gamma1x = W[i - 2];
gamma1 = ((gamma1x << 15) | (gamma1x >>> 17)) ^ ((gamma1x << 13) | (gamma1x >>> 19)) ^ (gamma1x >>> 10);
W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16];
}
ch = (e & f) ^ (~e & g);
maj = (a & b) ^ (a & c) ^ (b & c);
sigma0 = ((a << 30) | (a >>> 2)) ^ ((a << 19) | (a >>> 13)) ^ ((a << 10) | (a >>> 22));
sigma1 = ((e << 26) | (e >>> 6)) ^ ((e << 21) | (e >>> 11)) ^ ((e << 7) | (e >>> 25));
t1 = h + sigma1 + ch + K[i] + W[i];
t2 = sigma0 + maj;
h = g;
g = f;
f = e;
e = (d + t1) | 0;
d = c;
c = b;
b = a;
a = (t1 + t2) | 0;
}
H[0] = (H[0] + a) | 0;
H[1] = (H[1] + b) | 0;
H[2] = (H[2] + c) | 0;
H[3] = (H[3] + d) | 0;
H[4] = (H[4] + e) | 0;
H[5] = (H[5] + f) | 0;
H[6] = (H[6] + g) | 0;
return H[7] = (H[7] + h) | 0;
};
SHA256.prototype._doFinalize = function() {
var data, dataWords, nBitsLeft, nBitsTotal;
data = this._data;
dataWords = data.words;
nBitsTotal = this._nDataBytes * 8;
nBitsLeft = data.sigBytes * 8;
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;
data.sigBytes = dataWords.length * 4;
this._process();
return this._hash;
};
SHA256.prototype.scrub = function() {
return this._hash.scrub();
};
SHA256.prototype.copy_to = function(obj) {
SHA256.__super__.copy_to.call(this, obj);
return obj._hash = this._hash.clone();
};
SHA256.prototype.clone = function() {
var out;
out = new SHA256();
this.copy_to(out);
return out;
};
return SHA256;
})(Hasher);
transform = function(x) {
var out;
out = (new SHA256).finalize(x);
x.scrub();
return out;
};
exports.SHA256 = SHA256;
exports.transform = transform;
}).call(this);
},{"./algbase":174,"./wordarray":196}],191:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Global, Hasher, SHA3, WordArray, X64Word, X64WordArray, glbl, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
_ref = require('./wordarray'), WordArray = _ref.WordArray, X64Word = _ref.X64Word, X64WordArray = _ref.X64WordArray;
Hasher = require('./algbase').Hasher;
Global = (function() {
function Global() {
this.RHO_OFFSETS = [];
this.PI_INDEXES = [];
this.ROUND_CONSTANTS = [];
this.T = [];
this.compute_rho_offsets();
this.compute_pi_indexes();
this.compute_round_constants();
this.make_reusables();
}
Global.prototype.compute_rho_offsets = function() {
var newX, newY, t, x, y, _i, _results;
x = 1;
y = 0;
_results = [];
for (t = _i = 0; _i < 24; t = ++_i) {
this.RHO_OFFSETS[x + 5 * y] = ((t + 1) * (t + 2) / 2) % 64;
newX = y % 5;
newY = (2 * x + 3 * y) % 5;
x = newX;
_results.push(y = newY);
}
return _results;
};
Global.prototype.compute_pi_indexes = function() {
var x, y, _i, _results;
_results = [];
for (x = _i = 0; _i < 5; x = ++_i) {
_results.push((function() {
var _j, _results1;
_results1 = [];
for (y = _j = 0; _j < 5; y = ++_j) {
_results1.push(this.PI_INDEXES[x + 5 * y] = y + ((2 * x + 3 * y) % 5) * 5);
}
return _results1;
}).call(this));
}
return _results;
};
Global.prototype.compute_round_constants = function() {
var LFSR, bitPosition, i, j, roundConstantLsw, roundConstantMsw, _i, _j, _results;
LFSR = 0x01;
_results = [];
for (i = _i = 0; _i < 24; i = ++_i) {
roundConstantMsw = 0;
roundConstantLsw = 0;
for (j = _j = 0; _j < 7; j = ++_j) {
if (LFSR & 0x01) {
bitPosition = (1 << j) - 1;
if (bitPosition < 32) {
roundConstantLsw ^= 1 << bitPosition;
} else {
roundConstantMsw ^= 1 << (bitPosition - 32);
}
}
if (LFSR & 0x80) {
LFSR = (LFSR << 1) ^ 0x71;
} else {
LFSR <<= 1;
}
}
_results.push(this.ROUND_CONSTANTS[i] = new X64Word(roundConstantMsw, roundConstantLsw));
}
return _results;
};
Global.prototype.make_reusables = function() {
var i;
return this.T = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 25; i = ++_i) {
_results.push(new X64Word(0, 0));
}
return _results;
})();
};
return Global;
})();
glbl = new Global();
exports.SHA3 = SHA3 = (function(_super) {
__extends(SHA3, _super);
function SHA3() {
return SHA3.__super__.constructor.apply(this, arguments);
}
SHA3.outputLength = 512;
SHA3.prototype.outputLength = SHA3.outputLength;
SHA3.blockSize = (1600 - 2 * SHA3.outputLength) / 32;
SHA3.prototype.blockSize = SHA3.blockSize;
SHA3.output_size = SHA3.outputLength / 8;
SHA3.prototype.output_size = SHA3.output_size;
SHA3.prototype._doReset = function() {
var i;
return this._state = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 25; i = ++_i) {
_results.push(new X64Word(0, 0));
}
return _results;
})();
};
SHA3.prototype._doProcessBlock = function(M, offset) {
var G, M2i, M2i1, T0, TLane, TPiLane, Tx, Tx1, Tx1Lane, Tx1Lsw, Tx1Msw, Tx2Lane, Tx4, i, lane, laneIndex, laneLsw, laneMsw, nBlockSizeLanes, rhoOffset, round, roundConstant, state, state0, tLsw, tMsw, x, y, _i, _j, _k, _l, _m, _n, _o, _p, _q, _results;
G = glbl;
state = this._state;
nBlockSizeLanes = this.blockSize / 2;
for (i = _i = 0; 0 <= nBlockSizeLanes ? _i < nBlockSizeLanes : _i > nBlockSizeLanes; i = 0 <= nBlockSizeLanes ? ++_i : --_i) {
M2i = M[offset + 2 * i];
M2i1 = M[offset + 2 * i + 1];
M2i = (((M2i << 8) | (M2i >>> 24)) & 0x00ff00ff) | (((M2i << 24) | (M2i >>> 8)) & 0xff00ff00);
M2i1 = (((M2i1 << 8) | (M2i1 >>> 24)) & 0x00ff00ff) | (((M2i1 << 24) | (M2i1 >>> 8)) & 0xff00ff00);
lane = state[i];
lane.high ^= M2i1;
lane.low ^= M2i;
}
_results = [];
for (round = _j = 0; _j < 24; round = ++_j) {
for (x = _k = 0; _k < 5; x = ++_k) {
tMsw = tLsw = 0;
for (y = _l = 0; _l < 5; y = ++_l) {
lane = state[x + 5 * y];
tMsw ^= lane.high;
tLsw ^= lane.low;
}
Tx = G.T[x];
Tx.high = tMsw;
Tx.low = tLsw;
}
for (x = _m = 0; _m < 5; x = ++_m) {
Tx4 = G.T[(x + 4) % 5];
Tx1 = G.T[(x + 1) % 5];
Tx1Msw = Tx1.high;
Tx1Lsw = Tx1.low;
tMsw = Tx4.high ^ ((Tx1Msw << 1) | (Tx1Lsw >>> 31));
tLsw = Tx4.low ^ ((Tx1Lsw << 1) | (Tx1Msw >>> 31));
for (y = _n = 0; _n < 5; y = ++_n) {
lane = state[x + 5 * y];
lane.high ^= tMsw;
lane.low ^= tLsw;
}
}
for (laneIndex = _o = 1; _o < 25; laneIndex = ++_o) {
lane = state[laneIndex];
laneMsw = lane.high;
laneLsw = lane.low;
rhoOffset = G.RHO_OFFSETS[laneIndex];
if (rhoOffset < 32) {
tMsw = (laneMsw << rhoOffset) | (laneLsw >>> (32 - rhoOffset));
tLsw = (laneLsw << rhoOffset) | (laneMsw >>> (32 - rhoOffset));
} else {
tMsw = (laneLsw << (rhoOffset - 32)) | (laneMsw >>> (64 - rhoOffset));
tLsw = (laneMsw << (rhoOffset - 32)) | (laneLsw >>> (64 - rhoOffset));
}
TPiLane = G.T[G.PI_INDEXES[laneIndex]];
TPiLane.high = tMsw;
TPiLane.low = tLsw;
}
T0 = G.T[0];
state0 = state[0];
T0.high = state0.high;
T0.low = state0.low;
for (x = _p = 0; _p < 5; x = ++_p) {
for (y = _q = 0; _q < 5; y = ++_q) {
laneIndex = x + 5 * y;
lane = state[laneIndex];
TLane = G.T[laneIndex];
Tx1Lane = G.T[((x + 1) % 5) + 5 * y];
Tx2Lane = G.T[((x + 2) % 5) + 5 * y];
lane.high = TLane.high ^ (~Tx1Lane.high & Tx2Lane.high);
lane.low = TLane.low ^ (~Tx1Lane.low & Tx2Lane.low);
}
}
lane = state[0];
roundConstant = G.ROUND_CONSTANTS[round];
lane.high ^= roundConstant.high;
_results.push(lane.low ^= roundConstant.low);
}
return _results;
};
SHA3.prototype._doFinalize = function() {
var blockSizeBits, data, dataWords, hashWords, i, lane, laneLsw, laneMsw, nBitsLeft, nBitsTotal, outputLengthBytes, outputLengthLanes, state, _i;
data = this._data;
dataWords = data.words;
nBitsTotal = this._nDataBytes * 8;
nBitsLeft = data.sigBytes * 8;
blockSizeBits = this.blockSize * 32;
dataWords[nBitsLeft >>> 5] |= 0x1 << (24 - nBitsLeft % 32);
dataWords[((Math.ceil((nBitsLeft + 1) / blockSizeBits) * blockSizeBits) >>> 5) - 1] |= 0x80;
data.sigBytes = dataWords.length * 4;
this._process();
state = this._state;
outputLengthBytes = this.outputLength / 8;
outputLengthLanes = outputLengthBytes / 8;
hashWords = [];
for (i = _i = 0; 0 <= outputLengthLanes ? _i < outputLengthLanes : _i > outputLengthLanes; i = 0 <= outputLengthLanes ? ++_i : --_i) {
lane = state[i];
laneMsw = lane.high;
laneLsw = lane.low;
laneMsw = (((laneMsw << 8) | (laneMsw >>> 24)) & 0x00ff00ff) | (((laneMsw << 24) | (laneMsw >>> 8)) & 0xff00ff00);
laneLsw = (((laneLsw << 8) | (laneLsw >>> 24)) & 0x00ff00ff) | (((laneLsw << 24) | (laneLsw >>> 8)) & 0xff00ff00);
hashWords.push(laneLsw);
hashWords.push(laneMsw);
}
return new WordArray(hashWords, outputLengthBytes);
};
SHA3.prototype.copy_to = function(obj) {
var s;
SHA3.__super__.copy_to.call(this, obj);
return obj._state = (function() {
var _i, _len, _ref1, _results;
_ref1 = this._state;
_results = [];
for (_i = 0, _len = _ref1.length; _i < _len; _i++) {
s = _ref1[_i];
_results.push(s.clone());
}
return _results;
}).call(this);
};
SHA3.prototype.scrub = function() {};
SHA3.prototype.clone = function() {
var out;
out = new SHA3();
this.copy_to(out);
return out;
};
return SHA3;
})(Hasher);
exports.transform = function(x) {
var out;
out = (new SHA3).finalize(x);
x.scrub();
return out;
};
}).call(this);
},{"./algbase":174,"./wordarray":196}],192:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Global, SHA384, SHA512, WordArray, X64WordArray, transform, _ref, _ref1,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
_ref = require('./wordarray'), X64WordArray = _ref.X64WordArray, WordArray = _ref.WordArray;
_ref1 = require('./sha512'), SHA512 = _ref1.SHA512, Global = _ref1.Global;
SHA384 = (function(_super) {
__extends(SHA384, _super);
function SHA384() {
return SHA384.__super__.constructor.apply(this, arguments);
}
SHA384.output_size = 384 / 8;
SHA384.prototype.output_size = SHA384.output_size;
SHA384.prototype._doReset = function() {
return this._hash = new X64WordArray(Global.convert([0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939, 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4]));
};
SHA384.prototype._doFinalize = function() {
var hash;
hash = SHA384.__super__._doFinalize.call(this);
hash.sigBytes -= 16;
return hash;
};
SHA384.prototype.clone = function() {
var out;
out = new SHA384();
this.copy_to(out);
return out;
};
return SHA384;
})(SHA512);
transform = function(x) {
var out;
out = (new SHA384).finalize(x);
x.scrub();
return out;
};
exports.SHA384 = SHA384;
exports.transform = transform;
}).call(this);
},{"./sha512":193,"./wordarray":196}],193:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Global, Hasher, SHA512, X64Word, X64WordArray, glbl, _ref,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
_ref = require('./wordarray'), X64Word = _ref.X64Word, X64WordArray = _ref.X64WordArray;
Hasher = require('./algbase').Hasher;
Global = (function() {
Global.convert = function(raw) {
var i, _i, _ref1, _results;
_results = [];
for (i = _i = 0, _ref1 = raw.length; _i < _ref1; i = _i += 2) {
_results.push(new X64Word(raw[i], raw[i + 1]));
}
return _results;
};
Global.prototype.convert = function(raw) {
return Global.convert(raw);
};
function Global() {
var i;
this.K = this.convert([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]);
this.I = new X64WordArray(this.convert([0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1, 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179]));
this.W = (function() {
var _i, _results;
_results = [];
for (i = _i = 0; _i < 80; i = ++_i) {
_results.push(new X64Word(0, 0));
}
return _results;
})();
}
return Global;
})();
exports.Global = Global;
glbl = new Global();
exports.SHA512 = SHA512 = (function(_super) {
__extends(SHA512, _super);
function SHA512() {
return SHA512.__super__.constructor.apply(this, arguments);
}
SHA512.blockSize = 1024 / 32;
SHA512.prototype.blockSize = SHA512.blockSize;
SHA512.output_size = 512 / 8;
SHA512.prototype.output_size = SHA512.output_size;
SHA512.prototype._doReset = function() {
return this._hash = glbl.I.clone();
};
SHA512.prototype._doProcessBlock = function(M, offset) {
var H, H0, H0h, H0l, H1, H1h, H1l, H2, H2h, H2l, H3, H3h, H3l, H4, H4h, H4l, H5, H5h, H5l, H6, H6h, H6l, H7, H7h, H7l, Ki, Kih, Kil, W, Wi, Wi16, Wi16h, Wi16l, Wi7, Wi7h, Wi7l, Wih, Wil, ah, al, bh, bl, ch, chh, chl, cl, dh, dl, eh, el, fh, fl, gamma0h, gamma0l, gamma0x, gamma0xh, gamma0xl, gamma1h, gamma1l, gamma1x, gamma1xh, gamma1xl, gh, gl, hh, hl, i, majh, majl, sigma0h, sigma0l, sigma1h, sigma1l, t1h, t1l, t2h, t2l, _i;
H = this._hash.words;
W = glbl.W;
H0 = H[0];
H1 = H[1];
H2 = H[2];
H3 = H[3];
H4 = H[4];
H5 = H[5];
H6 = H[6];
H7 = H[7];
H0h = H0.high;
H0l = H0.low;
H1h = H1.high;
H1l = H1.low;
H2h = H2.high;
H2l = H2.low;
H3h = H3.high;
H3l = H3.low;
H4h = H4.high;
H4l = H4.low;
H5h = H5.high;
H5l = H5.low;
H6h = H6.high;
H6l = H6.low;
H7h = H7.high;
H7l = H7.low;
ah = H0h;
al = H0l;
bh = H1h;
bl = H1l;
ch = H2h;
cl = H2l;
dh = H3h;
dl = H3l;
eh = H4h;
el = H4l;
fh = H5h;
fl = H5l;
gh = H6h;
gl = H6l;
hh = H7h;
hl = H7l;
for (i = _i = 0; _i < 80; i = ++_i) {
Wi = W[i];
if (i < 16) {
Wih = Wi.high = M[offset + i * 2] | 0;
Wil = Wi.low = M[offset + i * 2 + 1] | 0;
} else {
gamma0x = W[i - 15];
gamma0xh = gamma0x.high;
gamma0xl = gamma0x.low;
gamma0h = ((gamma0xh >>> 1) | (gamma0xl << 31)) ^ ((gamma0xh >>> 8) | (gamma0xl << 24)) ^ (gamma0xh >>> 7);
gamma0l = ((gamma0xl >>> 1) | (gamma0xh << 31)) ^ ((gamma0xl >>> 8) | (gamma0xh << 24)) ^ ((gamma0xl >>> 7) | (gamma0xh << 25));
gamma1x = W[i - 2];
gamma1xh = gamma1x.high;
gamma1xl = gamma1x.low;
gamma1h = ((gamma1xh >>> 19) | (gamma1xl << 13)) ^ ((gamma1xh << 3) | (gamma1xl >>> 29)) ^ (gamma1xh >>> 6);
gamma1l = ((gamma1xl >>> 19) | (gamma1xh << 13)) ^ ((gamma1xl << 3) | (gamma1xh >>> 29)) ^ ((gamma1xl >>> 6) | (gamma1xh << 26));
Wi7 = W[i - 7];
Wi7h = Wi7.high;
Wi7l = Wi7.low;
Wi16 = W[i - 16];
Wi16h = Wi16.high;
Wi16l = Wi16.low;
Wil = gamma0l + Wi7l;
Wih = gamma0h + Wi7h + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0);
Wil = Wil + gamma1l;
Wih = Wih + gamma1h + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0);
Wil = Wil + Wi16l;
Wih = Wih + Wi16h + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0);
Wi.high = Wih;
Wi.low = Wil;
}
chh = (eh & fh) ^ (~eh & gh);
chl = (el & fl) ^ (~el & gl);
majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);
majl = (al & bl) ^ (al & cl) ^ (bl & cl);
sigma0h = ((ah >>> 28) | (al << 4)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));
sigma0l = ((al >>> 28) | (ah << 4)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));
sigma1h = ((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9));
sigma1l = ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9));
Ki = glbl.K[i];
Kih = Ki.high;
Kil = Ki.low;
t1l = hl + sigma1l;
t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);
t1l = t1l + chl;
t1h = t1h + chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);
t1l = t1l + Kil;
t1h = t1h + Kih + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0);
t1l = t1l + Wil;
t1h = t1h + Wih + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0);
t2l = sigma0l + majl;
t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);
hh = gh;
hl = gl;
gh = fh;
gl = fl;
fh = eh;
fl = el;
el = (dl + t1l) | 0;
eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
dh = ch;
dl = cl;
ch = bh;
cl = bl;
bh = ah;
bl = al;
al = (t1l + t2l) | 0;
ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;
}
H0l = H0.low = H0l + al;
H0.high = H0h + ah + ((H0l >>> 0) < (al >>> 0) ? 1 : 0);
H1l = H1.low = H1l + bl;
H1.high = H1h + bh + ((H1l >>> 0) < (bl >>> 0) ? 1 : 0);
H2l = H2.low = H2l + cl;
H2.high = H2h + ch + ((H2l >>> 0) < (cl >>> 0) ? 1 : 0);
H3l = H3.low = H3l + dl;
H3.high = H3h + dh + ((H3l >>> 0) < (dl >>> 0) ? 1 : 0);
H4l = H4.low = H4l + el;
H4.high = H4h + eh + ((H4l >>> 0) < (el >>> 0) ? 1 : 0);
H5l = H5.low = H5l + fl;
H5.high = H5h + fh + ((H5l >>> 0) < (fl >>> 0) ? 1 : 0);
H6l = H6.low = H6l + gl;
H6.high = H6h + gh + ((H6l >>> 0) < (gl >>> 0) ? 1 : 0);
H7l = H7.low = H7l + hl;
return H7.high = H7h + hh + ((H7l >>> 0) < (hl >>> 0) ? 1 : 0);
};
SHA512.prototype._doFinalize = function() {
var dataWords, nBitsLeft, nBitsTotal;
dataWords = this._data.words;
nBitsTotal = this._nDataBytes * 8;
nBitsLeft = this._data.sigBytes * 8;
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 30] = Math.floor(nBitsTotal / 0x100000000);
dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 31] = nBitsTotal;
this._data.sigBytes = dataWords.length * 4;
this._process();
return this._hash.toX32();
};
SHA512.prototype.copy_to = function(obj) {
SHA512.__super__.copy_to.call(this, obj);
return obj._hash = this._hash.clone();
};
SHA512.prototype.clone = function() {
var out;
out = new SHA512();
this.copy_to(out);
return out;
};
return SHA512;
})(Hasher);
exports.transform = function(x) {
var out;
out = (new SHA512).finalize(x);
x.scrub();
return out;
};
}).call(this);
},{"./algbase":174,"./wordarray":196}],194:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var BlockCipher, G, Global, TwoFish, scrub_vec,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
BlockCipher = require('./algbase').BlockCipher;
scrub_vec = require('./util').scrub_vec;
Global = (function() {
function Global() {
this.P = [[0xA9, 0x67, 0xB3, 0xE8, 0x04, 0xFD, 0xA3, 0x76, 0x9A, 0x92, 0x80, 0x78, 0xE4, 0xDD, 0xD1, 0x38, 0x0D, 0xC6, 0x35, 0x98, 0x18, 0xF7, 0xEC, 0x6C, 0x43, 0x75, 0x37, 0x26, 0xFA, 0x13, 0x94, 0x48, 0xF2, 0xD0, 0x8B, 0x30, 0x84, 0x54, 0xDF, 0x23, 0x19, 0x5B, 0x3D, 0x59, 0xF3, 0xAE, 0xA2, 0x82, 0x63, 0x01, 0x83, 0x2E, 0xD9, 0x51, 0x9B, 0x7C, 0xA6, 0xEB, 0xA5, 0xBE, 0x16, 0x0C, 0xE3, 0x61, 0xC0, 0x8C, 0x3A, 0xF5, 0x73, 0x2C, 0x25, 0x0B, 0xBB, 0x4E, 0x89, 0x6B, 0x53, 0x6A, 0xB4, 0xF1, 0xE1, 0xE6, 0xBD, 0x45, 0xE2, 0xF4, 0xB6, 0x66, 0xCC, 0x95, 0x03, 0x56, 0xD4, 0x1C, 0x1E, 0xD7, 0xFB, 0xC3, 0x8E, 0xB5, 0xE9, 0xCF, 0xBF, 0xBA, 0xEA, 0x77, 0x39, 0xAF, 0x33, 0xC9, 0x62, 0x71, 0x81, 0x79, 0x09, 0xAD, 0x24, 0xCD, 0xF9, 0xD8, 0xE5, 0xC5, 0xB9, 0x4D, 0x44, 0x08, 0x86, 0xE7, 0xA1, 0x1D, 0xAA, 0xED, 0x06, 0x70, 0xB2, 0xD2, 0x41, 0x7B, 0xA0, 0x11, 0x31, 0xC2, 0x27, 0x90, 0x20, 0xF6, 0x60, 0xFF, 0x96, 0x5C, 0xB1, 0xAB, 0x9E, 0x9C, 0x52, 0x1B, 0x5F, 0x93, 0x0A, 0xEF, 0x91, 0x85, 0x49, 0xEE, 0x2D, 0x4F, 0x8F, 0x3B, 0x47, 0x87, 0x6D, 0x46, 0xD6, 0x3E, 0x69, 0x64, 0x2A, 0xCE, 0xCB, 0x2F, 0xFC, 0x97, 0x05, 0x7A, 0xAC, 0x7F, 0xD5, 0x1A, 0x4B, 0x0E, 0xA7, 0x5A, 0x28, 0x14, 0x3F, 0x29, 0x88, 0x3C, 0x4C, 0x02, 0xB8, 0xDA, 0xB0, 0x17, 0x55, 0x1F, 0x8A, 0x7D, 0x57, 0xC7, 0x8D, 0x74, 0xB7, 0xC4, 0x9F, 0x72, 0x7E, 0x15, 0x22, 0x12, 0x58, 0x07, 0x99, 0x34, 0x6E, 0x50, 0xDE, 0x68, 0x65, 0xBC, 0xDB, 0xF8, 0xC8, 0xA8, 0x2B, 0x40, 0xDC, 0xFE, 0x32, 0xA4, 0xCA, 0x10, 0x21, 0xF0, 0xD3, 0x5D, 0x0F, 0x00, 0x6F, 0x9D, 0x36, 0x42, 0x4A, 0x5E, 0xC1, 0xE0], [0x75, 0xF3, 0xC6, 0xF4, 0xDB, 0x7B, 0xFB, 0xC8, 0x4A, 0xD3, 0xE6, 0x6B, 0x45, 0x7D, 0xE8, 0x4B, 0xD6, 0x32, 0xD8, 0xFD, 0x37, 0x71, 0xF1, 0xE1, 0x30, 0x0F, 0xF8, 0x1B, 0x87, 0xFA, 0x06, 0x3F, 0x5E, 0xBA, 0xAE, 0x5B, 0x8A, 0x00, 0xBC, 0x9D, 0x6D, 0xC1, 0xB1, 0x0E, 0x80, 0x5D, 0xD2, 0xD5, 0xA0, 0x84, 0x07, 0x14, 0xB5, 0x90, 0x2C, 0xA3, 0xB2, 0x73, 0x4C, 0x54, 0x92, 0x74, 0x36, 0x51, 0x38, 0xB0, 0xBD, 0x5A, 0xFC, 0x60, 0x62, 0x96, 0x6C, 0x42, 0xF7, 0x10, 0x7C, 0x28, 0x27, 0x8C, 0x13, 0x95, 0x9C, 0xC7, 0x24, 0x46, 0x3B, 0x70, 0xCA, 0xE3, 0x85, 0xCB, 0x11, 0xD0, 0x93, 0xB8, 0xA6, 0x83, 0x20, 0xFF, 0x9F, 0x77, 0xC3, 0xCC, 0x03, 0x6F, 0x08, 0xBF, 0x40, 0xE7, 0x2B, 0xE2, 0x79, 0x0C, 0xAA, 0x82, 0x41, 0x3A, 0xEA, 0xB9, 0xE4, 0x9A, 0xA4, 0x97, 0x7E, 0xDA, 0x7A, 0x17, 0x66, 0x94, 0xA1, 0x1D, 0x3D, 0xF0, 0xDE, 0xB3, 0x0B, 0x72, 0xA7, 0x1C, 0xEF, 0xD1, 0x53, 0x3E, 0x8F, 0x33, 0x26, 0x5F, 0xEC, 0x76, 0x2A, 0x49, 0x81, 0x88, 0xEE, 0x21, 0xC4, 0x1A, 0xEB, 0xD9, 0xC5, 0x39, 0x99, 0xCD, 0xAD, 0x31, 0x8B, 0x01, 0x18, 0x23, 0xDD, 0x1F, 0x4E, 0x2D, 0xF9, 0x48, 0x4F, 0xF2, 0x65, 0x8E, 0x78, 0x5C, 0x58, 0x19, 0x8D, 0xE5, 0x98, 0x57, 0x67, 0x7F, 0x05, 0x64, 0xAF, 0x63, 0xB6, 0xFE, 0xF5, 0xB7, 0x3C, 0xA5, 0xCE, 0xE9, 0x68, 0x44, 0xE0, 0x4D, 0x43, 0x69, 0x29, 0x2E, 0xAC, 0x15, 0x59, 0xA8, 0x0A, 0x9E, 0x6E, 0x47, 0xDF, 0x34, 0x35, 0x6A, 0xCF, 0xDC, 0x22, 0xC9, 0xC0, 0x9B, 0x89, 0xD4, 0xED, 0xAB, 0x12, 0xA2, 0x0D, 0x52, 0xBB, 0x02, 0x2F, 0xA9, 0xD7, 0x61, 0x1E, 0xB4, 0x50, 0x04, 0xF6, 0xC2, 0x16, 0x25, 0x86, 0x56, 0x55, 0x09, 0xBE, 0x91]];
this.P_00 = 1;
this.P_01 = 0;
this.P_02 = 0;
this.P_03 = 1;
this.P_04 = 1;
this.P_10 = 0;
this.P_11 = 0;
this.P_12 = 1;
this.P_13 = 1;
this.P_14 = 0;
this.P_20 = 1;
this.P_21 = 1;
this.P_22 = 0;
this.P_23 = 0;
this.P_24 = 0;
this.P_30 = 0;
this.P_31 = 1;
this.P_32 = 1;
this.P_33 = 0;
this.P_34 = 1;
this.GF256_FDBK = 0x169;
this.GF256_FDBK_2 = this.GF256_FDBK / 2;
this.GF256_FDBK_4 = this.GF256_FDBK / 4;
this.RS_GF_FDBK = 0x14D;
this.SK_STEP = 0x02020202;
this.SK_BUMP = 0x01010101;
this.SK_ROTL = 9;
}
return Global;
})();
G = new Global();
exports.TwoFish = TwoFish = (function(_super) {
__extends(TwoFish, _super);
TwoFish.blockSize = 4 * 4;
TwoFish.prototype.blockSize = TwoFish.blockSize;
TwoFish.keySize = 256 / 8;
TwoFish.prototype.keySize = TwoFish.keySize;
TwoFish.ivSize = TwoFish.blockSize;
TwoFish.prototype.ivSize = TwoFish.ivSize;
function TwoFish(key) {
this._key = key.clone();
this.gMDS0 = [];
this.gMDS1 = [];
this.gMDS2 = [];
this.gMDS3 = [];
this.gSubKeys = [];
this.gSBox = [];
this.k64Cnt = 0;
this._doReset();
}
TwoFish.prototype.getByte = function(x, n) {
return (x >>> (n * 8)) & 0xFF;
};
TwoFish.prototype.switchEndianness = function(word) {
return ((word & 0xff) << 24) | (((word >> 8) & 0xff) << 16) | (((word >> 16) & 0xff) << 8) | ((word >> 24) & 0xff);
};
TwoFish.prototype.LFSR1 = function(x) {
return (x >> 1) ^ ((x & 0x01) !== 0 ? G.GF256_FDBK_2 : 0);
};
TwoFish.prototype.LFSR2 = function(x) {
return (x >> 2) ^ ((x & 0x02) !== 0 ? G.GF256_FDBK_2 : 0) ^ ((x & 0x01) !== 0 ? G.GF256_FDBK_4 : 0);
};
TwoFish.prototype.Mx_X = function(x) {
return x ^ this.LFSR2(x);
};
TwoFish.prototype.Mx_Y = function(x) {
return x ^ this.LFSR1(x) ^ this.LFSR2(x);
};
TwoFish.prototype.RS_rem = function(x) {
var b, g2, g3;
b = (x >>> 24) & 0xff;
g2 = ((b << 1) ^ ((b & 0x80) !== 0 ? G.RS_GF_FDBK : 0)) & 0xff;
g3 = ((b >>> 1) ^ ((b & 0x01) !== 0 ? G.RS_GF_FDBK >>> 1 : 0)) ^ g2;
return (x << 8) ^ (g3 << 24) ^ (g2 << 16) ^ (g3 << 8) ^ b;
};
TwoFish.prototype.RS_MDS_Encode = function(k0, k1) {
var i, r, _i, _j;
r = k1;
for (i = _i = 0; _i < 4; i = ++_i) {
r = this.RS_rem(r);
}
r ^= k0;
for (i = _j = 0; _j < 4; i = ++_j) {
r = this.RS_rem(r);
}
return r;
};
TwoFish.prototype.F32 = function(x, k32) {
var b0, b1, b2, b3, k0, k1, k2, k3, m, res;
b0 = this.getByte(x, 0);
b1 = this.getByte(x, 1);
b2 = this.getByte(x, 2);
b3 = this.getByte(x, 3);
k0 = k32[0];
k1 = k32[1];
k2 = k32[2];
k3 = k32[3];
m = this.k64Cnt & 3;
res = m === 1 ? this.gMDS0[(G.P[G.P_01][b0] & 0xff) ^ this.getByte(k0, 0)] ^ this.gMDS1[(G.P[G.P_11][b1] & 0xff) ^ this.getByte(k0, 1)] ^ this.gMDS2[(G.P[G.P_21][b2] & 0xff) ^ this.getByte(k0, 2)] ^ this.gMDS3[(G.P[G.P_31][b3] & 0xff) ^ this.getByte(k0, 3)] : (m === 0 ? (b0 = (G.P[G.P_04][b0] & 0xff) ^ this.getByte(k3, 0), b1 = (G.P[G.P_14][b1] & 0xff) ^ this.getByte(k3, 1), b2 = (G.P[G.P_24][b2] & 0xff) ^ this.getByte(k3, 2), b3 = (G.P[G.P_34][b3] & 0xff) ^ this.getByte(k3, 3)) : void 0, m === 0 || m === 3 ? (b0 = (G.P[G.P_03][b0] & 0xff) ^ this.getByte(k2, 0), b1 = (G.P[G.P_13][b1] & 0xff) ^ this.getByte(k2, 1), b2 = (G.P[G.P_23][b2] & 0xff) ^ this.getByte(k2, 2), b3 = (G.P[G.P_33][b3] & 0xff) ^ this.getByte(k2, 3)) : void 0, this.gMDS0[(G.P[G.P_01][(G.P[G.P_02][b0] & 0xff) ^ this.getByte(k1, 0)] & 0xff) ^ this.getByte(k0, 0)] ^ this.gMDS1[(G.P[G.P_11][(G.P[G.P_12][b1] & 0xff) ^ this.getByte(k1, 1)] & 0xff) ^ this.getByte(k0, 1)] ^ this.gMDS2[(G.P[G.P_21][(G.P[G.P_22][b2] & 0xff) ^ this.getByte(k1, 2)] & 0xff) ^ this.getByte(k0, 2)] ^ this.gMDS3[(G.P[G.P_31][(G.P[G.P_32][b3] & 0xff) ^ this.getByte(k1, 3)] & 0xff) ^ this.getByte(k0, 3)]);
return res;
};
TwoFish.prototype.Fe32_0 = function(x) {
return this.gSBox[0x000 + 2 * (x & 0xff)] ^ this.gSBox[0x001 + 2 * ((x >>> 8) & 0xff)] ^ this.gSBox[0x200 + 2 * ((x >>> 16) & 0xff)] ^ this.gSBox[0x201 + 2 * ((x >>> 24) & 0xff)];
};
TwoFish.prototype.Fe32_3 = function(x) {
return this.gSBox[0x000 + 2 * ((x >>> 24) & 0xff)] ^ this.gSBox[0x001 + 2 * (x & 0xff)] ^ this.gSBox[0x200 + 2 * ((x >>> 8) & 0xff)] ^ this.gSBox[0x201 + 2 * ((x >>> 16) & 0xff)];
};
TwoFish.prototype._doReset = function() {
var A, B, b0, b1, b2, b3, i, j, k0, k1, k2, k3, k32e, k32o, m, m1, mX, mY, p, q, sBoxKeys, _i, _j, _k, _l, _ref, _ref1, _results;
k32e = [];
k32o = [];
sBoxKeys = [];
m1 = [];
mX = [];
mY = [];
this.k64Cnt = this._key.words.length / 2;
if (this.k64Cnt < 1) {
throw "Key size less than 64 bits";
}
if (this.k64Cnt > 4) {
throw "Key size larger than 256 bits";
}
for (i = _i = 0; _i < 256; i = ++_i) {
j = G.P[0][i] & 0xff;
m1[0] = j;
mX[0] = this.Mx_X(j) & 0xff;
mY[0] = this.Mx_Y(j) & 0xff;
j = G.P[1][i] & 0xff;
m1[1] = j;
mX[1] = this.Mx_X(j) & 0xff;
mY[1] = this.Mx_Y(j) & 0xff;
this.gMDS0[i] = m1[G.P_00] | mX[G.P_00] << 8 | mY[G.P_00] << 16 | mY[G.P_00] << 24;
this.gMDS1[i] = mY[G.P_10] | mY[G.P_10] << 8 | mX[G.P_10] << 16 | m1[G.P_10] << 24;
this.gMDS2[i] = mX[G.P_20] | mY[G.P_20] << 8 | m1[G.P_20] << 16 | mY[G.P_20] << 24;
this.gMDS3[i] = mX[G.P_30] | m1[G.P_30] << 8 | mY[G.P_30] << 16 | mX[G.P_30] << 24;
}
for (i = _j = 0, _ref = this.k64Cnt; 0 <= _ref ? _j < _ref : _j > _ref; i = 0 <= _ref ? ++_j : --_j) {
p = i * 2;
k32e[i] = this.switchEndianness(this._key.words[p]);
k32o[i] = this.switchEndianness(this._key.words[p + 1]);
sBoxKeys[this.k64Cnt - 1 - i] = this.RS_MDS_Encode(k32e[i], k32o[i]);
}
for (i = _k = 0, _ref1 = 40 / 2; 0 <= _ref1 ? _k < _ref1 : _k > _ref1; i = 0 <= _ref1 ? ++_k : --_k) {
q = i * G.SK_STEP;
A = this.F32(q, k32e);
B = this.F32(q + G.SK_BUMP, k32o);
B = B << 8 | B >>> 24;
A += B;
this.gSubKeys[i * 2] = A;
A += B;
this.gSubKeys[i * 2 + 1] = A << G.SK_ROTL | A >>> (32 - G.SK_ROTL);
}
k0 = sBoxKeys[0];
k1 = sBoxKeys[1];
k2 = sBoxKeys[2];
k3 = sBoxKeys[3];
this.gSBox = [];
_results = [];
for (i = _l = 0; _l < 256; i = ++_l) {
b0 = b1 = b2 = b3 = i;
m = this.k64Cnt & 3;
if (m === 1) {
this.gSBox[i * 2] = this.gMDS0[(G.P[G.P_01][b0] & 0xff) ^ this.getByte(k0, 0)];
this.gSBox[i * 2 + 1] = this.gMDS1[(G.P[G.P_11][b1] & 0xff) ^ this.getByte(k0, 1)];
this.gSBox[i * 2 + 0x200] = this.gMDS2[(G.P[G.P_21][b2] & 0xff) ^ this.getByte(k0, 2)];
_results.push(this.gSBox[i * 2 + 0x201] = this.gMDS3[(G.P[G.P_31][b3] & 0xff) ^ this.getByte(k0, 3)]);
} else {
if (m === 0) {
b0 = (G.P[G.P_04][b0] & 0xff) ^ this.getByte(k3, 0);
b1 = (G.P[G.P_14][b1] & 0xff) ^ this.getByte(k3, 1);
b2 = (G.P[G.P_24][b2] & 0xff) ^ this.getByte(k3, 2);
b3 = (G.P[G.P_34][b3] & 0xff) ^ this.getByte(k3, 3);
}
if (m === 0 || m === 3) {
b0 = (G.P[G.P_03][b0] & 0xff) ^ this.getByte(k2, 0);
b1 = (G.P[G.P_13][b1] & 0xff) ^ this.getByte(k2, 1);
b2 = (G.P[G.P_23][b2] & 0xff) ^ this.getByte(k2, 2);
b3 = (G.P[G.P_33][b3] & 0xff) ^ this.getByte(k2, 3);
}
this.gSBox[i * 2] = this.gMDS0[(G.P[G.P_01][(G.P[G.P_02][b0] & 0xff) ^ this.getByte(k1, 0)] & 0xff) ^ this.getByte(k0, 0)];
this.gSBox[i * 2 + 1] = this.gMDS1[(G.P[G.P_11][(G.P[G.P_12][b1] & 0xff) ^ this.getByte(k1, 1)] & 0xff) ^ this.getByte(k0, 1)];
this.gSBox[i * 2 + 0x200] = this.gMDS2[(G.P[G.P_21][(G.P[G.P_22][b2] & 0xff) ^ this.getByte(k1, 2)] & 0xff) ^ this.getByte(k0, 2)];
_results.push(this.gSBox[i * 2 + 0x201] = this.gMDS3[(G.P[G.P_31][(G.P[G.P_32][b3] & 0xff) ^ this.getByte(k1, 3)] & 0xff) ^ this.getByte(k0, 3)]);
}
}
return _results;
};
TwoFish.prototype.scrub = function() {
scrub_vec(this.gSubKeys);
scrub_vec(this.gSBox);
return this._key.scrub();
};
TwoFish.prototype.decryptBlock = function(M, offset) {
var k, r, t0, t1, x0, x1, x2, x3, _i;
if (offset == null) {
offset = 0;
}
x2 = this.switchEndianness(M[offset]) ^ this.gSubKeys[4];
x3 = this.switchEndianness(M[offset + 1]) ^ this.gSubKeys[5];
x0 = this.switchEndianness(M[offset + 2]) ^ this.gSubKeys[6];
x1 = this.switchEndianness(M[offset + 3]) ^ this.gSubKeys[7];
k = 8 + 2 * 16 - 1;
for (r = _i = 0; _i < 16; r = _i += 2) {
t0 = this.Fe32_0(x2);
t1 = this.Fe32_3(x3);
x1 ^= t0 + 2 * t1 + this.gSubKeys[k--];
x0 = (x0 << 1 | x0 >>> 31) ^ (t0 + t1 + this.gSubKeys[k--]);
x1 = x1 >>> 1 | x1 << 31;
t0 = this.Fe32_0(x0);
t1 = this.Fe32_3(x1);
x3 ^= t0 + 2 * t1 + this.gSubKeys[k--];
x2 = (x2 << 1 | x2 >>> 31) ^ (t0 + t1 + this.gSubKeys[k--]);
x3 = x3 >>> 1 | x3 << 31;
}
M[offset] = this.switchEndianness(x0 ^ this.gSubKeys[0]);
M[offset + 1] = this.switchEndianness(x1 ^ this.gSubKeys[1]);
M[offset + 2] = this.switchEndianness(x2 ^ this.gSubKeys[2]);
return M[offset + 3] = this.switchEndianness(x3 ^ this.gSubKeys[3]);
};
TwoFish.prototype.encryptBlock = function(M, offset) {
var k, r, t0, t1, x0, x1, x2, x3, _i;
if (offset == null) {
offset = 0;
}
x0 = this.switchEndianness(M[offset]) ^ this.gSubKeys[0];
x1 = this.switchEndianness(M[offset + 1]) ^ this.gSubKeys[1];
x2 = this.switchEndianness(M[offset + 2]) ^ this.gSubKeys[2];
x3 = this.switchEndianness(M[offset + 3]) ^ this.gSubKeys[3];
k = 8;
for (r = _i = 0; _i < 16; r = _i += 2) {
t0 = this.Fe32_0(x0);
t1 = this.Fe32_3(x1);
x2 ^= t0 + t1 + this.gSubKeys[k++];
x2 = x2 >>> 1 | x2 << 31;
x3 = (x3 << 1 | x3 >>> 31) ^ (t0 + 2 * t1 + this.gSubKeys[k++]);
t0 = this.Fe32_0(x2);
t1 = this.Fe32_3(x3);
x0 ^= t0 + t1 + this.gSubKeys[k++];
x0 = x0 >>> 1 | x0 << 31;
x1 = (x1 << 1 | x1 >>> 31) ^ (t0 + 2 * t1 + this.gSubKeys[k++]);
}
M[offset] = this.switchEndianness(x2 ^ this.gSubKeys[4]);
M[offset + 1] = this.switchEndianness(x3 ^ this.gSubKeys[5]);
M[offset + 2] = this.switchEndianness(x0 ^ this.gSubKeys[6]);
return M[offset + 3] = this.switchEndianness(x1 ^ this.gSubKeys[7]);
};
return TwoFish;
})(BlockCipher);
}).call(this);
},{"./algbase":174,"./util":195}],195:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var default_delay, iced, uint_max, __iced_k, __iced_k_noop;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
uint_max = Math.pow(2, 32);
exports.fixup_uint32 = function(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;
};
exports.scrub_buffer = function(b) {
var i, n_full_words;
n_full_words = b.length >> 2;
i = 0;
while (i < n_full_words) {
b.writeUInt32LE(0, i);
i += 4;
}
while (i < b.length) {
b.writeUInt8(0, i);
i++;
}
return false;
};
exports.scrub_vec = function(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;
};
exports.default_delay = default_delay = function(i, n, cb) {
var ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
(function(_this) {
return (function(__iced_k) {
if (typeof setImmediate !== "undefined" && setImmediate !== null) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/util.iced"
});
setImmediate(__iced_deferrals.defer({
lineno: 37
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/util.iced"
});
setTimeout(__iced_deferrals.defer({
lineno: 39
}), 1);
__iced_deferrals._fulfill();
})(__iced_k);
}
});
})(this)((function(_this) {
return function() {
return cb();
};
})(this));
};
exports.buffer_cmp_ule = function(b1, b2) {
var I, J, i, j, x, y;
i = j = 0;
I = b1.length;
J = b2.length;
while (i < I && b1.readUInt8(i) === 0) {
i++;
}
while (j < J && b2.readUInt8(j) === 0) {
j++;
}
if ((I - i) > (J - j)) {
return 1;
} else if ((J - j) > (I - i)) {
return -1;
}
while (i < I) {
if ((x = b1.readUInt8(i)) < (y = b2.readUInt8(j))) {
return -1;
} else if (y < x) {
return 1;
}
i++;
j++;
}
return 0;
};
exports.bulk = function(n_input_bytes, _arg, _arg1) {
var call_ph, cb, default_n, delay, finalize, i, left, n, n_words, progress_hook, ret, total_words, update, what, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
update = _arg.update, finalize = _arg.finalize, default_n = _arg.default_n;
delay = _arg1.delay, n = _arg1.n, cb = _arg1.cb, what = _arg1.what, progress_hook = _arg1.progress_hook;
i = 0;
left = 0;
total_words = Math.ceil(n_input_bytes / 4);
delay || (delay = default_delay);
n || (n = default_n);
call_ph = function(i) {
return typeof progress_hook === "function" ? progress_hook({
what: what,
i: i,
total: total_words
}) : void 0;
};
call_ph(0);
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!((left = total_words - i) > 0)) {
return _break();
} else {
n_words = Math.min(n, left);
update(i, i + n_words);
call_ph(i);
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/keybase/triplesec/src/util.iced",
funcname: "bulk"
});
delay(i, total_words, __iced_deferrals.defer({
lineno: 97
}));
__iced_deferrals._fulfill();
})(function() {
return _next(i += n_words);
});
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
call_ph(total_words);
ret = finalize();
return cb(ret);
};
})(this));
};
}).call(this);
},{"iced-runtime":118}],196:[function(require,module,exports){
(function (Buffer){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var WordArray, X64Word, X64WordArray, buffer_to_ui8a, endian_reverse, ui8a_to_buffer, util;
util = require('./util');
buffer_to_ui8a = function(b) {
var i, ret, _i, _ref;
ret = new Uint8Array(b.length);
for (i = _i = 0, _ref = b.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
ret[i] = b.readUInt8(i);
}
return ret;
};
ui8a_to_buffer = function(v) {
var i, ret, _i, _ref;
ret = new Buffer(v.length);
for (i = _i = 0, _ref = v.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
ret.writeUInt8(v[i], i);
}
return ret;
};
endian_reverse = function(x) {
return ((x >>> 24) & 0xff) | (((x >>> 16) & 0xff) << 8) | (((x >>> 8) & 0xff) << 16) | ((x & 0xff) << 24);
};
exports.WordArray = WordArray = (function() {
function WordArray(words, sigBytes) {
this.words = words || [];
this.sigBytes = sigBytes != null ? sigBytes : this.words.length * 4;
}
WordArray.prototype.concat = function(wordArray) {
var i, thatByte, thatSigBytes, thatWords, _i;
thatWords = wordArray.words;
thatSigBytes = wordArray.sigBytes;
this.clamp();
if (this.sigBytes % 4) {
for (i = _i = 0; 0 <= thatSigBytes ? _i < thatSigBytes : _i > thatSigBytes; i = 0 <= thatSigBytes ? ++_i : --_i) {
thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
this.words[(this.sigBytes + i) >>> 2] |= thatByte << (24 - ((this.sigBytes + i) % 4) * 8);
}
} else {
this.words = this.words.concat(thatWords);
}
this.sigBytes += thatSigBytes;
return this;
};
WordArray.prototype.clamp = function() {
this.words[this.sigBytes >>> 2] &= 0xffffffff << (32 - (this.sigBytes % 4) * 8);
this.words.length = Math.ceil(this.sigBytes / 4);
return this;
};
WordArray.prototype.clone = function() {
return new WordArray(this.words.slice(0), this.sigBytes);
};
WordArray.prototype.to_buffer = function() {
var ch, out, p, w, _i, _len, _ref;
out = new Buffer(this.sigBytes);
p = 0;
_ref = this.words;
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
w = _ref[_i];
if (!((this.sigBytes - p) >= 4)) {
continue;
}
w = util.fixup_uint32(w);
out.writeUInt32BE(w, p);
p += 4;
}
while (p < this.sigBytes) {
ch = (this.words[p >>> 2] >>> (24 - (p % 4) * 8)) & 0xff;
out.writeUInt8(ch, p);
p++;
}
return out;
};
WordArray.prototype.endian_reverse = function() {
var i, w, _i, _len, _ref;
_ref = this.words;
for (i = _i = 0, _len = _ref.length; _i < _len; i = ++_i) {
w = _ref[i];
this.words[i] = endian_reverse(w);
}
return this;
};
WordArray.prototype.split = function(n) {
var i, out, sz;
if (!(((this.sigBytes % 4) === 0) && ((this.words.length % n) === 0))) {
throw new Error("bad key alignment");
}
sz = this.words.length / n;
out = (function() {
var _i, _ref, _results;
_results = [];
for (i = _i = 0, _ref = this.words.length; sz > 0 ? _i < _ref : _i > _ref; i = _i += sz) {
_results.push(new WordArray(this.words.slice(i, i + sz)));
}
return _results;
}).call(this);
return out;
};
WordArray.prototype.to_utf8 = function() {
return this.to_buffer().toString('utf8');
};
WordArray.prototype.to_hex = function() {
return this.to_buffer().toString('hex');
};
WordArray.prototype.to_ui8a = function() {
return buffer_to_ui8a(this.to_buffer());
};
WordArray.alloc = function(b) {
if (Buffer.isBuffer(b)) {
return WordArray.from_buffer(b);
} else if ((typeof b === 'object') && (b instanceof WordArray)) {
return b;
} else if (typeof b === 'string') {
return WordArray.from_hex(b);
} else {
return null;
}
};
WordArray.from_buffer = function(b) {
var ch, last, p, words;
words = [];
p = 0;
while ((b.length - p) >= 4) {
words.push(b.readUInt32BE(p));
p += 4;
}
if (p < b.length) {
last = 0;
while (p < b.length) {
ch = b.readUInt8(p);
last |= ch << (24 - (p % 4) * 8);
p++;
}
last = util.fixup_uint32(last);
words.push(last);
}
return new WordArray(words, b.length);
};
WordArray.from_buffer_le = function(b) {
var ch, last, p, words;
words = [];
p = 0;
while ((b.length - p) >= 4) {
words.push(b.readUInt32LE(p));
p += 4;
}
if (p < b.length) {
last = 0;
while (p < b.length) {
ch = b.readUInt8(p);
last |= ch << ((p % 4) * 8);
p++;
}
last = util.fixup_uint32(last);
words.push(last);
}
return new WordArray(words, b.length);
};
WordArray.from_utf8 = function(s) {
return WordArray.from_buffer(new Buffer(s, 'utf8'));
};
WordArray.from_utf8_le = function(s) {
return WordArray.from_buffer_le(new Buffer(s, 'utf8'));
};
WordArray.from_hex = function(s) {
return WordArray.from_buffer(new Buffer(s, 'hex'));
};
WordArray.from_hex_le = function(s) {
return WordArray.from_buffer_le(new Buffer(s, 'hex'));
};
WordArray.from_ui8a = function(v) {
return WordArray.from_buffer(ui8a_to_buffer(v));
};
WordArray.from_i32a = function(v) {
return new WordArray(Array.apply([], v));
};
WordArray.prototype.equal = function(wa) {
var i, ret, w, _i, _len, _ref;
ret = true;
if (wa.sigBytes !== this.sigBytes) {
ret = false;
} else {
_ref = this.words;
for (i = _i = 0, _len = _ref.length; _i < _len; i = ++_i) {
w = _ref[i];
if (util.fixup_uint32(w) !== util.fixup_uint32(wa.words[i])) {
ret = false;
}
}
}
return ret;
};
WordArray.prototype.xor = function(wa2, _arg) {
var dst_offset, i, n_words, src_offset, tmp, _i;
dst_offset = _arg.dst_offset, src_offset = _arg.src_offset, n_words = _arg.n_words;
if (!dst_offset) {
dst_offset = 0;
}
if (!src_offset) {
src_offset = 0;
}
if (n_words == null) {
n_words = wa2.words.length - src_offset;
}
if (this.words.length < dst_offset + n_words) {
throw new Error("dest range exceeded (" + this.words.length + " < " + (dst_offset + n_words) + ")");
}
if (wa2.words.length < src_offset + n_words) {
throw new Error("source range exceeded");
}
for (i = _i = 0; 0 <= n_words ? _i < n_words : _i > n_words; i = 0 <= n_words ? ++_i : --_i) {
tmp = this.words[dst_offset + i] ^ wa2.words[src_offset + i];
this.words[dst_offset + i] = util.fixup_uint32(tmp);
}
return this;
};
WordArray.prototype.truncate = function(n_bytes) {
var n_words;
if (!(n_bytes <= this.sigBytes)) {
throw new Error("Cannot truncate: " + n_bytes + " > " + this.sigBytes);
}
n_words = Math.ceil(n_bytes / 4);
return new WordArray(this.words.slice(0, n_words), n_bytes);
};
WordArray.prototype.unshift = function(n_words) {
var ret;
if (this.words.length >= n_words) {
ret = this.words.splice(0, n_words);
this.sigBytes -= n_words * 4;
return new WordArray(ret);
} else {
return null;
}
};
WordArray.prototype.is_scrubbed = function() {
var w, _i, _len, _ref;
_ref = this.words;
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
w = _ref[_i];
if (w !== 0) {
return false;
}
}
return true;
};
WordArray.prototype.scrub = function() {
return util.scrub_vec(this.words);
};
WordArray.prototype.cmp_ule = function(wa2) {
return util.buffer_cmp_ule(this.to_buffer(), wa2.to_buffer());
};
WordArray.prototype.slice = function(low, hi) {
var n, sb;
n = this.words.length;
if (!((low < hi) && (hi <= n))) {
throw new Error("Bad WordArray slice [" + low + "," + hi + ")] when only " + n + " avail");
}
sb = (hi - low) * 4;
if (hi === n) {
sb -= n * 4 - this.sigBytes;
}
return new WordArray(this.words.slice(low, hi), sb);
};
return WordArray;
})();
exports.X64Word = X64Word = (function() {
function X64Word(high, low) {
this.high = high;
this.low = low;
}
X64Word.prototype.clone = function() {
return new X64Word(this.high, this.low);
};
return X64Word;
})();
exports.X64WordArray = X64WordArray = (function() {
function X64WordArray(words, sigBytes) {
this.sigBytes = sigBytes;
this.words = words || [];
if (!this.sigBytes) {
this.sigBytes = this.words.length * 8;
}
}
X64WordArray.prototype.toX32 = function() {
var v, w, _i, _len, _ref;
v = [];
_ref = this.words;
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
w = _ref[_i];
v.push(w.high);
v.push(w.low);
}
return new WordArray(v, this.sigBytes);
};
X64WordArray.prototype.clone = function() {
var w;
return new X64WordArray((function() {
var _i, _len, _ref, _results;
_ref = this.words;
_results = [];
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
w = _ref[_i];
_results.push(w.clone());
}
return _results;
}).call(this), this.sigBytes);
};
return X64WordArray;
})();
exports.buffer_to_ui8a = buffer_to_ui8a;
exports.ui8a_to_buffer = ui8a_to_buffer;
exports.endian_reverse = endian_reverse;
}).call(this);
}).call(this,require("buffer").Buffer)
},{"./util":195,"buffer":80}],197:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Lock, NamedLock, Table, iced, __iced_k, __iced_k_noop,
__hasProp = {}.hasOwnProperty,
__extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; };
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
exports.Lock = Lock = (function() {
function Lock() {
this._open = true;
this._waiters = [];
}
Lock.prototype.acquire = function(cb) {
if (this._open) {
this._open = false;
return cb();
} else {
return this._waiters.push(cb);
}
};
Lock.prototype.release = function() {
var w;
if (this._waiters.length) {
w = this._waiters.shift();
return w();
} else {
return this._open = true;
}
};
Lock.prototype.open = function() {
return this._open;
};
return Lock;
})();
NamedLock = (function(_super) {
__extends(NamedLock, _super);
function NamedLock(tab, name) {
this.tab = tab;
this.name = name;
NamedLock.__super__.constructor.call(this);
this.refs = 0;
}
NamedLock.prototype.incref = function() {
return ++this.refs;
};
NamedLock.prototype.decref = function() {
return --this.refs;
};
NamedLock.prototype.release = function() {
NamedLock.__super__.release.call(this);
if (this.decref() === 0) {
return delete this.tab.locks[this.name];
}
};
return NamedLock;
})(Lock);
exports.Table = Table = (function() {
function Table() {
this.locks = {};
}
Table.prototype.create = function(name) {
var l;
l = new NamedLock(this, name);
return this.locks[name] = l;
};
Table.prototype.acquire = function(name, cb, wait) {
var l, was_open, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
l = this.locks[name] || this.create(name);
was_open = l._open;
l.incref();
(function(_this) {
return (function(__iced_k) {
if (wait || l._open) {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/home/max/src/iced/iced-lock/index.iced",
funcname: "Table.acquire"
});
l.acquire(__iced_deferrals.defer({
lineno: 47
}));
__iced_deferrals._fulfill();
})(__iced_k);
} else {
return __iced_k(l = null);
}
});
})(this)((function(_this) {
return function() {
return cb(l, was_open);
};
})(this));
};
Table.prototype.lookup = function(name) {
return this.locks[name];
};
return Table;
})();
}).call(this);
},{"iced-runtime":118}],198:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-f
(function() {
var Generator, iced, __iced_k, __iced_k_noop;
iced = require('iced-runtime');
__iced_k = __iced_k_noop = function() {};
Generator = Generator = (function() {
function Generator(opts) {
opts = opts || {};
this.lazy_loop_delay = opts.lazy_loop_delay || 30;
this.loop_delay = opts.loop_delay || 5;
this.work_min = opts.work_min || 1;
this.auto_stop_bits = opts.auto_stop_bits || 4096;
this.max_bits_per_delta = opts.max_bits_per_delta || 4;
this.auto_stop = opts.auto_stop ? opts.auto_stop : true;
this.entropies = [];
this.running = true;
this.is_generating = false;
this.timer_race_loop();
}
Generator.prototype.generate = function(bits_wanted, cb) {
var e, harvested_bits, res, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
this.is_generating = true;
if (!this.running) {
this.resume();
}
harvested_bits = 0;
res = [];
(function(_this) {
return (function(__iced_k) {
var _results, _while;
_results = [];
_while = function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!(harvested_bits < bits_wanted)) {
return _break();
} else {
(function(__iced_k) {
if (_this.entropies.length) {
e = _this.entropies.splice(0, 1)[0];
harvested_bits += e[1];
return __iced_k(res.push(e[0]));
} else {
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/chris/git/more-entropy/src/generator.iced",
funcname: "Generator.generate"
});
_this.delay(__iced_deferrals.defer({
lineno: 28
}));
__iced_deferrals._fulfill();
})(__iced_k);
}
})(_next);
}
};
_while(__iced_k);
});
})(this)((function(_this) {
return function() {
if (_this.auto_stop) {
_this.stop();
}
_this.is_generating = false;
return cb(res);
};
})(this));
};
Generator.prototype.stop = function() {
return this.running = false;
};
Generator.prototype.resume = function() {
this.running = true;
return this.timer_race_loop();
};
Generator.prototype.reset = function() {
this.entropies = [];
return this.total_bits = 0;
};
Generator.prototype.count_unused_bits = function() {
var bits, e, _i, _len, _ref;
bits = 0;
_ref = this.entropies;
for (_i = 0, _len = _ref.length; _i < _len; _i++) {
e = _ref[_i];
bits += e[1];
}
return bits;
};
Generator.prototype.delay = function(cb) {
var delay, ___iced_passed_deferral, __iced_deferrals, __iced_k;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
delay = this.is_generating ? this.loop_delay : this.lazy_loop_delay;
(function(_this) {
return (function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/chris/git/more-entropy/src/generator.iced",
funcname: "Generator.delay"
});
setTimeout(__iced_deferrals.defer({
lineno: 50
}), delay);
__iced_deferrals._fulfill();
});
})(this)((function(_this) {
return function() {
return cb();
};
})(this));
};
Generator.prototype.timer_race_loop = function() {
var ___iced_passed_deferral, __iced_k, _results, _while;
__iced_k = __iced_k_noop;
___iced_passed_deferral = iced.findDeferral(arguments);
this._last_count = null;
_results = [];
_while = (function(_this) {
var count, delta, entropy, v, __iced_deferrals;
return function(__iced_k) {
var _break, _continue, _next;
_break = function() {
return __iced_k(_results);
};
_continue = function() {
return iced.trampoline(function() {
return _while(__iced_k);
});
};
_next = function(__iced_next_arg) {
_results.push(__iced_next_arg);
return _continue();
};
if (!_this.running) {
return _break();
} else {
if (_this.count_unused_bits() < _this.auto_stop_bits) {
count = _this.millisecond_count();
if ((_this._last_count != null) && (delta = count - _this._last_count)) {
entropy = Math.floor(_this.log_2(Math.abs(delta)));
entropy = Math.min(_this.max_bits_per_delta, entropy);
v = [delta, entropy];
_this.entropies.push(v);
}
_this._last_count = count;
}
(function(__iced_k) {
__iced_deferrals = new iced.Deferrals(__iced_k, {
parent: ___iced_passed_deferral,
filename: "/Users/chris/git/more-entropy/src/generator.iced",
funcname: "Generator.timer_race_loop"
});
_this.delay(__iced_deferrals.defer({
lineno: 64
}));
__iced_deferrals._fulfill();
})(_next);
}
};
})(this);
_while(__iced_k);
};
Generator.prototype.log_2 = function(x) {
return Math.log(x) / Math.LN2;
};
Generator.prototype.millisecond_count = function() {
var d, i, x;
d = Date.now();
i = x = 0;
while (Date.now() < d + this.work_min + 1) {
i++;
x = Math.sin(Math.sqrt(Math.log(i + x)));
}
return i;
};
return Generator;
})();
if (typeof window !== "undefined" && window !== null) {
window.Generator = Generator;
}
if (typeof exports !== "undefined" && exports !== null) {
exports.Generator = Generator;
}
}).call(this);
},{"iced-runtime":118}],199:[function(require,module,exports){
// Generated by IcedCoffeeScript 1.7.1-c
(function() {
exports.Generator = require('../lib/generator').Generator;
}).call(this);
},{"../lib/generator":198}],200:[function(require,module,exports){
(function (Buffer){
(function(nacl) {
'use strict';
// Ported in 2014 by Dmitry Chestnykh and Devi Mandiri.
// Public domain.
//
// Implementation derived from TweetNaCl version 20140427.
// See for details: http://tweetnacl.cr.yp.to/
/* jshint newcap: false */
var gf = function(init) {
var i, r = new Float64Array(16);
if (init) for (i = 0; i < init.length; i++) r[i] = init[i];
return r;
};
// Pluggable, initialized in high-level API below.
var randombytes = function(/* x, n */) { throw new Error('no PRNG'); };
var _0 = new Uint8Array(16);
var _9 = new Uint8Array(32); _9[0] = 9;
var gf0 = gf(),
gf1 = gf([1]),
_121665 = gf([0xdb41, 1]),
D = gf([0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070, 0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]),
D2 = gf([0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0, 0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]),
X = gf([0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c, 0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]),
Y = gf([0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]),
I = gf([0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43, 0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);
function ts64(x, i, h, l) {
x[i] = (h >> 24) & 0xff;
x[i+1] = (h >> 16) & 0xff;
x[i+2] = (h >> 8) & 0xff;
x[i+3] = h & 0xff;
x[i+4] = (l >> 24) & 0xff;
x[i+5] = (l >> 16) & 0xff;
x[i+6] = (l >> 8) & 0xff;
x[i+7] = l & 0xff;
}
function vn(x, xi, y, yi, n) {
var i,d = 0;
for (i = 0; i < n; i++) d |= x[xi+i]^y[yi+i];
return (1 & ((d - 1) >>> 8)) - 1;
}
function crypto_verify_16(x, xi, y, yi) {
return vn(x,xi,y,yi,16);
}
function crypto_verify_32(x, xi, y, yi) {
return vn(x,xi,y,yi,32);
}
function core_salsa20(o, p, k, c) {
var j0 = c[ 0] & 0xff | (c[ 1] & 0xff)<<8 | (c[ 2] & 0xff)<<16 | (c[ 3] & 0xff)<<24,
j1 = k[ 0] & 0xff | (k[ 1] & 0xff)<<8 | (k[ 2] & 0xff)<<16 | (k[ 3] & 0xff)<<24,
j2 = k[ 4] & 0xff | (k[ 5] & 0xff)<<8 | (k[ 6] & 0xff)<<16 | (k[ 7] & 0xff)<<24,
j3 = k[ 8] & 0xff | (k[ 9] & 0xff)<<8 | (k[10] & 0xff)<<16 | (k[11] & 0xff)<<24,
j4 = k[12] & 0xff | (k[13] & 0xff)<<8 | (k[14] & 0xff)<<16 | (k[15] & 0xff)<<24,
j5 = c[ 4] & 0xff | (c[ 5] & 0xff)<<8 | (c[ 6] & 0xff)<<16 | (c[ 7] & 0xff)<<24,
j6 = p[ 0] & 0xff | (p[ 1] & 0xff)<<8 | (p[ 2] & 0xff)<<16 | (p[ 3] & 0xff)<<24,
j7 = p[ 4] & 0xff | (p[ 5] & 0xff)<<8 | (p[ 6] & 0xff)<<16 | (p[ 7] & 0xff)<<24,
j8 = p[ 8] & 0xff | (p[ 9] & 0xff)<<8 | (p[10] & 0xff)<<16 | (p[11] & 0xff)<<24,
j9 = p[12] & 0xff | (p[13] & 0xff)<<8 | (p[14] & 0xff)<<16 | (p[15] & 0xff)<<24,
j10 = c[ 8] & 0xff | (c[ 9] & 0xff)<<8 | (c[10] & 0xff)<<16 | (c[11] & 0xff)<<24,
j11 = k[16] & 0xff | (k[17] & 0xff)<<8 | (k[18] & 0xff)<<16 | (k[19] & 0xff)<<24,
j12 = k[20] & 0xff | (k[21] & 0xff)<<8 | (k[22] & 0xff)<<16 | (k[23] & 0xff)<<24,
j13 = k[24] & 0xff | (k[25] & 0xff)<<8 | (k[26] & 0xff)<<16 | (k[27] & 0xff)<<24,
j14 = k[28] & 0xff | (k[29] & 0xff)<<8 | (k[30] & 0xff)<<16 | (k[31] & 0xff)<<24,
j15 = c[12] & 0xff | (c[13] & 0xff)<<8 | (c[14] & 0xff)<<16 | (c[15] & 0xff)<<24;
var x0 = j0, x1 = j1, x2 = j2, x3 = j3, x4 = j4, x5 = j5, x6 = j6, x7 = j7,
x8 = j8, x9 = j9, x10 = j10, x11 = j11, x12 = j12, x13 = j13, x14 = j14,
x15 = j15, u;
for (var i = 0; i < 20; i += 2) {
u = x0 + x12 | 0;
x4 ^= u<<7 | u>>>(32-7);
u = x4 + x0 | 0;
x8 ^= u<<9 | u>>>(32-9);
u = x8 + x4 | 0;
x12 ^= u<<13 | u>>>(32-13);
u = x12 + x8 | 0;
x0 ^= u<<18 | u>>>(32-18);
u = x5 + x1 | 0;
x9 ^= u<<7 | u>>>(32-7);
u = x9 + x5 | 0;
x13 ^= u<<9 | u>>>(32-9);
u = x13 + x9 | 0;
x1 ^= u<<13 | u>>>(32-13);
u = x1 + x13 | 0;
x5 ^= u<<18 | u>>>(32-18);
u = x10 + x6 | 0;
x14 ^= u<<7 | u>>>(32-7);
u = x14 + x10 | 0;
x2 ^= u<<9 | u>>>(32-9);
u = x2 + x14 | 0;
x6 ^= u<<13 | u>>>(32-13);
u = x6 + x2 | 0;
x10 ^= u<<18 | u>>>(32-18);
u = x15 + x11 | 0;
x3 ^= u<<7 | u>>>(32-7);
u = x3 + x15 | 0;
x7 ^= u<<9 | u>>>(32-9);
u = x7 + x3 | 0;
x11 ^= u<<13 | u>>>(32-13);
u = x11 + x7 | 0;
x15 ^= u<<18 | u>>>(32-18);
u = x0 + x3 | 0;
x1 ^= u<<7 | u>>>(32-7);
u = x1 + x0 | 0;
x2 ^= u<<9 | u>>>(32-9);
u = x2 + x1 | 0;
x3 ^= u<<13 | u>>>(32-13);
u = x3 + x2 | 0;
x0 ^= u<<18 | u>>>(32-18);
u = x5 + x4 | 0;
x6 ^= u<<7 | u>>>(32-7);
u = x6 + x5 | 0;
x7 ^= u<<9 | u>>>(32-9);
u = x7 + x6 | 0;
x4 ^= u<<13 | u>>>(32-13);
u = x4 + x7 | 0;
x5 ^= u<<18 | u>>>(32-18);
u = x10 + x9 | 0;
x11 ^= u<<7 | u>>>(32-7);
u = x11 + x10 | 0;
x8 ^= u<<9 | u>>>(32-9);
u = x8 + x11 | 0;
x9 ^= u<<13 | u>>>(32-13);
u = x9 + x8 | 0;
x10 ^= u<<18 | u>>>(32-18);
u = x15 + x14 | 0;
x12 ^= u<<7 | u>>>(32-7);
u = x12 + x15 | 0;
x13 ^= u<<9 | u>>>(32-9);
u = x13 + x12 | 0;
x14 ^= u<<13 | u>>>(32-13);
u = x14 + x13 | 0;
x15 ^= u<<18 | u>>>(32-18);
}
x0 = x0 + j0 | 0;
x1 = x1 + j1 | 0;
x2 = x2 + j2 | 0;
x3 = x3 + j3 | 0;
x4 = x4 + j4 | 0;
x5 = x5 + j5 | 0;
x6 = x6 + j6 | 0;
x7 = x7 + j7 | 0;
x8 = x8 + j8 | 0;
x9 = x9 + j9 | 0;
x10 = x10 + j10 | 0;
x11 = x11 + j11 | 0;
x12 = x12 + j12 | 0;
x13 = x13 + j13 | 0;
x14 = x14 + j14 | 0;
x15 = x15 + j15 | 0;
o[ 0] = x0 >>> 0 & 0xff;
o[ 1] = x0 >>> 8 & 0xff;
o[ 2] = x0 >>> 16 & 0xff;
o[ 3] = x0 >>> 24 & 0xff;
o[ 4] = x1 >>> 0 & 0xff;
o[ 5] = x1 >>> 8 & 0xff;
o[ 6] = x1 >>> 16 & 0xff;
o[ 7] = x1 >>> 24 & 0xff;
o[ 8] = x2 >>> 0 & 0xff;
o[ 9] = x2 >>> 8 & 0xff;
o[10] = x2 >>> 16 & 0xff;
o[11] = x2 >>> 24 & 0xff;
o[12] = x3 >>> 0 & 0xff;
o[13] = x3 >>> 8 & 0xff;
o[14] = x3 >>> 16 & 0xff;
o[15] = x3 >>> 24 & 0xff;
o[16] = x4 >>> 0 & 0xff;
o[17] = x4 >>> 8 & 0xff;
o[18] = x4 >>> 16 & 0xff;
o[19] = x4 >>> 24 & 0xff;
o[20] = x5 >>> 0 & 0xff;
o[21] = x5 >>> 8 & 0xff;
o[22] = x5 >>> 16 & 0xff;
o[23] = x5 >>> 24 & 0xff;
o[24] = x6 >>> 0 & 0xff;
o[25] = x6 >>> 8 & 0xff;
o[26] = x6 >>> 16 & 0xff;
o[27] = x6 >>> 24 & 0xff;
o[28] = x7 >>> 0 & 0xff;
o[29] = x7 >>> 8 & 0xff;
o[30] = x7 >>> 16 & 0xff;
o[31] = x7 >>> 24 & 0xff;
o[32] = x8 >>> 0 & 0xff;
o[33] = x8 >>> 8 & 0xff;
o[34] = x8 >>> 16 & 0xff;
o[35] = x8 >>> 24 & 0xff;
o[36] = x9 >>> 0 & 0xff;
o[37] = x9 >>> 8 & 0xff;
o[38] = x9 >>> 16 & 0xff;
o[39] = x9 >>> 24 & 0xff;
o[40] = x10 >>> 0 & 0xff;
o[41] = x10 >>> 8 & 0xff;
o[42] = x10 >>> 16 & 0xff;
o[43] = x10 >>> 24 & 0xff;
o[44] = x11 >>> 0 & 0xff;
o[45] = x11 >>> 8 & 0xff;
o[46] = x11 >>> 16 & 0xff;
o[47] = x11 >>> 24 & 0xff;
o[48] = x12 >>> 0 & 0xff;
o[49] = x12 >>> 8 & 0xff;
o[50] = x12 >>> 16 & 0xff;
o[51] = x12 >>> 24 & 0xff;
o[52] = x13 >>> 0 & 0xff;
o[53] = x13 >>> 8 & 0xff;
o[54] = x13 >>> 16 & 0xff;
o[55] = x13 >>> 24 & 0xff;
o[56] = x14 >>> 0 & 0xff;
o[57] = x14 >>> 8 & 0xff;
o[58] = x14 >>> 16 & 0xff;
o[59] = x14 >>> 24 & 0xff;
o[60] = x15 >>> 0 & 0xff;
o[61] = x15 >>> 8 & 0xff;
o[62] = x15 >>> 16 & 0xff;
o[63] = x15 >>> 24 & 0xff;
}
function core_hsalsa20(o,p,k,c) {
var j0 = c[ 0] & 0xff | (c[ 1] & 0xff)<<8 | (c[ 2] & 0xff)<<16 | (c[ 3] & 0xff)<<24,
j1 = k[ 0] & 0xff | (k[ 1] & 0xff)<<8 | (k[ 2] & 0xff)<<16 | (k[ 3] & 0xff)<<24,
j2 = k[ 4] & 0xff | (k[ 5] & 0xff)<<8 | (k[ 6] & 0xff)<<16 | (k[ 7] & 0xff)<<24,
j3 = k[ 8] & 0xff | (k[ 9] & 0xff)<<8 | (k[10] & 0xff)<<16 | (k[11] & 0xff)<<24,
j4 = k[12] & 0xff | (k[13] & 0xff)<<8 | (k[14] & 0xff)<<16 | (k[15] & 0xff)<<24,
j5 = c[ 4] & 0xff | (c[ 5] & 0xff)<<8 | (c[ 6] & 0xff)<<16 | (c[ 7] & 0xff)<<24,
j6 = p[ 0] & 0xff | (p[ 1] & 0xff)<<8 | (p[ 2] & 0xff)<<16 | (p[ 3] & 0xff)<<24,
j7 = p[ 4] & 0xff | (p[ 5] & 0xff)<<8 | (p[ 6] & 0xff)<<16 | (p[ 7] & 0xff)<<24,
j8 = p[ 8] & 0xff | (p[ 9] & 0xff)<<8 | (p[10] & 0xff)<<16 | (p[11] & 0xff)<<24,
j9 = p[12] & 0xff | (p[13] & 0xff)<<8 | (p[14] & 0xff)<<16 | (p[15] & 0xff)<<24,
j10 = c[ 8] & 0xff | (c[ 9] & 0xff)<<8 | (c[10] & 0xff)<<16 | (c[11] & 0xff)<<24,
j11 = k[16] & 0xff | (k[17] & 0xff)<<8 | (k[18] & 0xff)<<16 | (k[19] & 0xff)<<24,
j12 = k[20] & 0xff | (k[21] & 0xff)<<8 | (k[22] & 0xff)<<16 | (k[23] & 0xff)<<24,
j13 = k[24] & 0xff | (k[25] & 0xff)<<8 | (k[26] & 0xff)<<16 | (k[27] & 0xff)<<24,
j14 = k[28] & 0xff | (k[29] & 0xff)<<8 | (k[30] & 0xff)<<16 | (k[31] & 0xff)<<24,
j15 = c[12] & 0xff | (c[13] & 0xff)<<8 | (c[14] & 0xff)<<16 | (c[15] & 0xff)<<24;
var x0 = j0, x1 = j1, x2 = j2, x3 = j3, x4 = j4, x5 = j5, x6 = j6, x7 = j7,
x8 = j8, x9 = j9, x10 = j10, x11 = j11, x12 = j12, x13 = j13, x14 = j14,
x15 = j15, u;
for (var i = 0; i < 20; i += 2) {
u = x0 + x12 | 0;
x4 ^= u<<7 | u>>>(32-7);
u = x4 + x0 | 0;
x8 ^= u<<9 | u>>>(32-9);
u = x8 + x4 | 0;
x12 ^= u<<13 | u>>>(32-13);
u = x12 + x8 | 0;
x0 ^= u<<18 | u>>>(32-18);
u = x5 + x1 | 0;
x9 ^= u<<7 | u>>>(32-7);
u = x9 + x5 | 0;
x13 ^= u<<9 | u>>>(32-9);
u = x13 + x9 | 0;
x1 ^= u<<13 | u>>>(32-13);
u = x1 + x13 | 0;
x5 ^= u<<18 | u>>>(32-18);
u = x10 + x6 | 0;
x14 ^= u<<7 | u>>>(32-7);
u = x14 + x10 | 0;
x2 ^= u<<9 | u>>>(32-9);
u = x2 + x14 | 0;
x6 ^= u<<13 | u>>>(32-13);
u = x6 + x2 | 0;
x10 ^= u<<18 | u>>>(32-18);
u = x15 + x11 | 0;
x3 ^= u<<7 | u>>>(32-7);
u = x3 + x15 | 0;
x7 ^= u<<9 | u>>>(32-9);
u = x7 + x3 | 0;
x11 ^= u<<13 | u>>>(32-13);
u = x11 + x7 | 0;
x15 ^= u<<18 | u>>>(32-18);
u = x0 + x3 | 0;
x1 ^= u<<7 | u>>>(32-7);
u = x1 + x0 | 0;
x2 ^= u<<9 | u>>>(32-9);
u = x2 + x1 | 0;
x3 ^= u<<13 | u>>>(32-13);
u = x3 + x2 | 0;
x0 ^= u<<18 | u>>>(32-18);
u = x5 + x4 | 0;
x6 ^= u<<7 | u>>>(32-7);
u = x6 + x5 | 0;
x7 ^= u<<9 | u>>>(32-9);
u = x7 + x6 | 0;
x4 ^= u<<13 | u>>>(32-13);
u = x4 + x7 | 0;
x5 ^= u<<18 | u>>>(32-18);
u = x10 + x9 | 0;
x11 ^= u<<7 | u>>>(32-7);
u = x11 + x10 | 0;
x8 ^= u<<9 | u>>>(32-9);
u = x8 + x11 | 0;
x9 ^= u<<13 | u>>>(32-13);
u = x9 + x8 | 0;
x10 ^= u<<18 | u>>>(32-18);
u = x15 + x14 | 0;
x12 ^= u<<7 | u>>>(32-7);
u = x12 + x15 | 0;
x13 ^= u<<9 | u>>>(32-9);
u = x13 + x12 | 0;
x14 ^= u<<13 | u>>>(32-13);
u = x14 + x13 | 0;
x15 ^= u<<18 | u>>>(32-18);
}
o[ 0] = x0 >>> 0 & 0xff;
o[ 1] = x0 >>> 8 & 0xff;
o[ 2] = x0 >>> 16 & 0xff;
o[ 3] = x0 >>> 24 & 0xff;
o[ 4] = x5 >>> 0 & 0xff;
o[ 5] = x5 >>> 8 & 0xff;
o[ 6] = x5 >>> 16 & 0xff;
o[ 7] = x5 >>> 24 & 0xff;
o[ 8] = x10 >>> 0 & 0xff;
o[ 9] = x10 >>> 8 & 0xff;
o[10] = x10 >>> 16 & 0xff;
o[11] = x10 >>> 24 & 0xff;
o[12] = x15 >>> 0 & 0xff;
o[13] = x15 >>> 8 & 0xff;
o[14] = x15 >>> 16 & 0xff;
o[15] = x15 >>> 24 & 0xff;
o[16] = x6 >>> 0 & 0xff;
o[17] = x6 >>> 8 & 0xff;
o[18] = x6 >>> 16 & 0xff;
o[19] = x6 >>> 24 & 0xff;
o[20] = x7 >>> 0 & 0xff;
o[21] = x7 >>> 8 & 0xff;
o[22] = x7 >>> 16 & 0xff;
o[23] = x7 >>> 24 & 0xff;
o[24] = x8 >>> 0 & 0xff;
o[25] = x8 >>> 8 & 0xff;
o[26] = x8 >>> 16 & 0xff;
o[27] = x8 >>> 24 & 0xff;
o[28] = x9 >>> 0 & 0xff;
o[29] = x9 >>> 8 & 0xff;
o[30] = x9 >>> 16 & 0xff;
o[31] = x9 >>> 24 & 0xff;
}
function crypto_core_salsa20(out,inp,k,c) {
core_salsa20(out,inp,k,c);
}
function crypto_core_hsalsa20(out,inp,k,c) {
core_hsalsa20(out,inp,k,c);
}
var sigma = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
// "expand 32-byte k"
function crypto_stream_salsa20_xor(c,cpos,m,mpos,b,n,k) {
var z = new Uint8Array(16), x = new Uint8Array(64);
var u, i;
for (i = 0; i < 16; i++) z[i] = 0;
for (i = 0; i < 8; i++) z[i] = n[i];
while (b >= 64) {
crypto_core_salsa20(x,z,k,sigma);
for (i = 0; i < 64; i++) c[cpos+i] = m[mpos+i] ^ x[i];
u = 1;
for (i = 8; i < 16; i++) {
u = u + (z[i] & 0xff) | 0;
z[i] = u & 0xff;
u >>>= 8;
}
b -= 64;
cpos += 64;
mpos += 64;
}
if (b > 0) {
crypto_core_salsa20(x,z,k,sigma);
for (i = 0; i < b; i++) c[cpos+i] = m[mpos+i] ^ x[i];
}
return 0;
}
function crypto_stream_salsa20(c,cpos,b,n,k) {
var z = new Uint8Array(16), x = new Uint8Array(64);
var u, i;
for (i = 0; i < 16; i++) z[i] = 0;
for (i = 0; i < 8; i++) z[i] = n[i];
while (b >= 64) {
crypto_core_salsa20(x,z,k,sigma);
for (i = 0; i < 64; i++) c[cpos+i] = x[i];
u = 1;
for (i = 8; i < 16; i++) {
u = u + (z[i] & 0xff) | 0;
z[i] = u & 0xff;
u >>>= 8;
}
b -= 64;
cpos += 64;
}
if (b > 0) {
crypto_core_salsa20(x,z,k,sigma);
for (i = 0; i < b; i++) c[cpos+i] = x[i];
}
return 0;
}
function crypto_stream(c,cpos,d,n,k) {
var s = new Uint8Array(32);
crypto_core_hsalsa20(s,n,k,sigma);
var sn = new Uint8Array(8);
for (var i = 0; i < 8; i++) sn[i] = n[i+16];
return crypto_stream_salsa20(c,cpos,d,sn,s);
}
function crypto_stream_xor(c,cpos,m,mpos,d,n,k) {
var s = new Uint8Array(32);
crypto_core_hsalsa20(s,n,k,sigma);
var sn = new Uint8Array(8);
for (var i = 0; i < 8; i++) sn[i] = n[i+16];
return crypto_stream_salsa20_xor(c,cpos,m,mpos,d,sn,s);
}
/*
* Port of Andrew Moon's Poly1305-donna-16. Public domain.
* https://github.com/floodyberry/poly1305-donna
*/
var poly1305 = function(key) {
this.buffer = new Uint8Array(16);
this.r = new Uint16Array(10);
this.h = new Uint16Array(10);
this.pad = new Uint16Array(8);
this.leftover = 0;
this.fin = 0;
var t0, t1, t2, t3, t4, t5, t6, t7;
t0 = key[ 0] & 0xff | (key[ 1] & 0xff) << 8; this.r[0] = ( t0 ) & 0x1fff;
t1 = key[ 2] & 0xff | (key[ 3] & 0xff) << 8; this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;
t2 = key[ 4] & 0xff | (key[ 5] & 0xff) << 8; this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;
t3 = key[ 6] & 0xff | (key[ 7] & 0xff) << 8; this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;
t4 = key[ 8] & 0xff | (key[ 9] & 0xff) << 8; this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;
this.r[5] = ((t4 >>> 1)) & 0x1ffe;
t5 = key[10] & 0xff | (key[11] & 0xff) << 8; this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;
t6 = key[12] & 0xff | (key[13] & 0xff) << 8; this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;
t7 = key[14] & 0xff | (key[15] & 0xff) << 8; this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;
this.r[9] = ((t7 >>> 5)) & 0x007f;
this.pad[0] = key[16] & 0xff | (key[17] & 0xff) << 8;
this.pad[1] = key[18] & 0xff | (key[19] & 0xff) << 8;
this.pad[2] = key[20] & 0xff | (key[21] & 0xff) << 8;
this.pad[3] = key[22] & 0xff | (key[23] & 0xff) << 8;
this.pad[4] = key[24] & 0xff | (key[25] & 0xff) << 8;
this.pad[5] = key[26] & 0xff | (key[27] & 0xff) << 8;
this.pad[6] = key[28] & 0xff | (key[29] & 0xff) << 8;
this.pad[7] = key[30] & 0xff | (key[31] & 0xff) << 8;
};
poly1305.prototype.blocks = function(m, mpos, bytes) {
var hibit = this.fin ? 0 : (1 << 11);
var t0, t1, t2, t3, t4, t5, t6, t7, c;
var d0, d1, d2, d3, d4, d5, d6, d7, d8, d9;
var h0 = this.h[0],
h1 = this.h[1],
h2 = this.h[2],
h3 = this.h[3],
h4 = this.h[4],
h5 = this.h[5],
h6 = this.h[6],
h7 = this.h[7],
h8 = this.h[8],
h9 = this.h[9];
var r0 = this.r[0],
r1 = this.r[1],
r2 = this.r[2],
r3 = this.r[3],
r4 = this.r[4],
r5 = this.r[5],
r6 = this.r[6],
r7 = this.r[7],
r8 = this.r[8],
r9 = this.r[9];
while (bytes >= 16) {
t0 = m[mpos+ 0] & 0xff | (m[mpos+ 1] & 0xff) << 8; h0 += ( t0 ) & 0x1fff;
t1 = m[mpos+ 2] & 0xff | (m[mpos+ 3] & 0xff) << 8; h1 += ((t0 >>> 13) | (t1 << 3)) & 0x1fff;
t2 = m[mpos+ 4] & 0xff | (m[mpos+ 5] & 0xff) << 8; h2 += ((t1 >>> 10) | (t2 << 6)) & 0x1fff;
t3 = m[mpos+ 6] & 0xff | (m[mpos+ 7] & 0xff) << 8; h3 += ((t2 >>> 7) | (t3 << 9)) & 0x1fff;
t4 = m[mpos+ 8] & 0xff | (m[mpos+ 9] & 0xff) << 8; h4 += ((t3 >>> 4) | (t4 << 12)) & 0x1fff;
h5 += ((t4 >>> 1)) & 0x1fff;
t5 = m[mpos+10] & 0xff | (m[mpos+11] & 0xff) << 8; h6 += ((t4 >>> 14) | (t5 << 2)) & 0x1fff;
t6 = m[mpos+12] & 0xff | (m[mpos+13] & 0xff) << 8; h7 += ((t5 >>> 11) | (t6 << 5)) & 0x1fff;
t7 = m[mpos+14] & 0xff | (m[mpos+15] & 0xff) << 8; h8 += ((t6 >>> 8) | (t7 << 8)) & 0x1fff;
h9 += ((t7 >>> 5)) | hibit;
c = 0;
d0 = c;
d0 += h0 * r0;
d0 += h1 * (5 * r9);
d0 += h2 * (5 * r8);
d0 += h3 * (5 * r7);
d0 += h4 * (5 * r6);
c = (d0 >>> 13); d0 &= 0x1fff;
d0 += h5 * (5 * r5);
d0 += h6 * (5 * r4);
d0 += h7 * (5 * r3);
d0 += h8 * (5 * r2);
d0 += h9 * (5 * r1);
c += (d0 >>> 13); d0 &= 0x1fff;
d1 = c;
d1 += h0 * r1;
d1 += h1 * r0;
d1 += h2 * (5 * r9);
d1 += h3 * (5 * r8);
d1 += h4 * (5 * r7);
c = (d1 >>> 13); d1 &= 0x1fff;
d1 += h5 * (5 * r6);
d1 += h6 * (5 * r5);
d1 += h7 * (5 * r4);
d1 += h8 * (5 * r3);
d1 += h9 * (5 * r2);
c += (d1 >>> 13); d1 &= 0x1fff;
d2 = c;
d2 += h0 * r2;
d2 += h1 * r1;
d2 += h2 * r0;
d2 += h3 * (5 * r9);
d2 += h4 * (5 * r8);
c = (d2 >>> 13); d2 &= 0x1fff;
d2 += h5 * (5 * r7);
d2 += h6 * (5 * r6);
d2 += h7 * (5 * r5);
d2 += h8 * (5 * r4);
d2 += h9 * (5 * r3);
c += (d2 >>> 13); d2 &= 0x1fff;
d3 = c;
d3 += h0 * r3;
d3 += h1 * r2;
d3 += h2 * r1;
d3 += h3 * r0;
d3 += h4 * (5 * r9);
c = (d3 >>> 13); d3 &= 0x1fff;
d3 += h5 * (5 * r8);
d3 += h6 * (5 * r7);
d3 += h7 * (5 * r6);
d3 += h8 * (5 * r5);
d3 += h9 * (5 * r4);
c += (d3 >>> 13); d3 &= 0x1fff;
d4 = c;
d4 += h0 * r4;
d4 += h1 * r3;
d4 += h2 * r2;
d4 += h3 * r1;
d4 += h4 * r0;
c = (d4 >>> 13); d4 &= 0x1fff;
d4 += h5 * (5 * r9);
d4 += h6 * (5 * r8);
d4 += h7 * (5 * r7);
d4 += h8 * (5 * r6);
d4 += h9 * (5 * r5);
c += (d4 >>> 13); d4 &= 0x1fff;
d5 = c;
d5 += h0 * r5;
d5 += h1 * r4;
d5 += h2 * r3;
d5 += h3 * r2;
d5 += h4 * r1;
c = (d5 >>> 13); d5 &= 0x1fff;
d5 += h5 * r0;
d5 += h6 * (5 * r9);
d5 += h7 * (5 * r8);
d5 += h8 * (5 * r7);
d5 += h9 * (5 * r6);
c += (d5 >>> 13); d5 &= 0x1fff;
d6 = c;
d6 += h0 * r6;
d6 += h1 * r5;
d6 += h2 * r4;
d6 += h3 * r3;
d6 += h4 * r2;
c = (d6 >>> 13); d6 &= 0x1fff;
d6 += h5 * r1;
d6 += h6 * r0;
d6 += h7 * (5 * r9);
d6 += h8 * (5 * r8);
d6 += h9 * (5 * r7);
c += (d6 >>> 13); d6 &= 0x1fff;
d7 = c;
d7 += h0 * r7;
d7 += h1 * r6;
d7 += h2 * r5;
d7 += h3 * r4;
d7 += h4 * r3;
c = (d7 >>> 13); d7 &= 0x1fff;
d7 += h5 * r2;
d7 += h6 * r1;
d7 += h7 * r0;
d7 += h8 * (5 * r9);
d7 += h9 * (5 * r8);
c += (d7 >>> 13); d7 &= 0x1fff;
d8 = c;
d8 += h0 * r8;
d8 += h1 * r7;
d8 += h2 * r6;
d8 += h3 * r5;
d8 += h4 * r4;
c = (d8 >>> 13); d8 &= 0x1fff;
d8 += h5 * r3;
d8 += h6 * r2;
d8 += h7 * r1;
d8 += h8 * r0;
d8 += h9 * (5 * r9);
c += (d8 >>> 13); d8 &= 0x1fff;
d9 = c;
d9 += h0 * r9;
d9 += h1 * r8;
d9 += h2 * r7;
d9 += h3 * r6;
d9 += h4 * r5;
c = (d9 >>> 13); d9 &= 0x1fff;
d9 += h5 * r4;
d9 += h6 * r3;
d9 += h7 * r2;
d9 += h8 * r1;
d9 += h9 * r0;
c += (d9 >>> 13); d9 &= 0x1fff;
c = (((c << 2) + c)) | 0;
c = (c + d0) | 0;
d0 = c & 0x1fff;
c = (c >>> 13);
d1 += c;
h0 = d0;
h1 = d1;
h2 = d2;
h3 = d3;
h4 = d4;
h5 = d5;
h6 = d6;
h7 = d7;
h8 = d8;
h9 = d9;
mpos += 16;
bytes -= 16;
}
this.h[0] = h0;
this.h[1] = h1;
this.h[2] = h2;
this.h[3] = h3;
this.h[4] = h4;
this.h[5] = h5;
this.h[6] = h6;
this.h[7] = h7;
this.h[8] = h8;
this.h[9] = h9;
};
poly1305.prototype.finish = function(mac, macpos) {
var g = new Uint16Array(10);
var c, mask, f, i;
if (this.leftover) {
i = this.leftover;
this.buffer[i++] = 1;
for (; i < 16; i++) this.buffer[i] = 0;
this.fin = 1;
this.blocks(this.buffer, 0, 16);
}
c = this.h[1] >>> 13;
this.h[1] &= 0x1fff;
for (i = 2; i < 10; i++) {
this.h[i] += c;
c = this.h[i] >>> 13;
this.h[i] &= 0x1fff;
}
this.h[0] += (c * 5);
c = this.h[0] >>> 13;
this.h[0] &= 0x1fff;
this.h[1] += c;
c = this.h[1] >>> 13;
this.h[1] &= 0x1fff;
this.h[2] += c;
g[0] = this.h[0] + 5;
c = g[0] >>> 13;
g[0] &= 0x1fff;
for (i = 1; i < 10; i++) {
g[i] = this.h[i] + c;
c = g[i] >>> 13;
g[i] &= 0x1fff;
}
g[9] -= (1 << 13);
mask = (g[9] >>> ((2 * 8) - 1)) - 1;
for (i = 0; i < 10; i++) g[i] &= mask;
mask = ~mask;
for (i = 0; i < 10; i++) this.h[i] = (this.h[i] & mask) | g[i];
this.h[0] = ((this.h[0] ) | (this.h[1] << 13) ) & 0xffff;
this.h[1] = ((this.h[1] >>> 3) | (this.h[2] << 10) ) & 0xffff;
this.h[2] = ((this.h[2] >>> 6) | (this.h[3] << 7) ) & 0xffff;
this.h[3] = ((this.h[3] >>> 9) | (this.h[4] << 4) ) & 0xffff;
this.h[4] = ((this.h[4] >>> 12) | (this.h[5] << 1) | (this.h[6] << 14)) & 0xffff;
this.h[5] = ((this.h[6] >>> 2) | (this.h[7] << 11) ) & 0xffff;
this.h[6] = ((this.h[7] >>> 5) | (this.h[8] << 8) ) & 0xffff;
this.h[7] = ((this.h[8] >>> 8) | (this.h[9] << 5) ) & 0xffff;
f = this.h[0] + this.pad[0];
this.h[0] = f & 0xffff;
for (i = 1; i < 8; i++) {
f = (((this.h[i] + this.pad[i]) | 0) + (f >>> 16)) | 0;
this.h[i] = f & 0xffff;
}
mac[macpos+ 0] = (this.h[0] >>> 0) & 0xff;
mac[macpos+ 1] = (this.h[0] >>> 8) & 0xff;
mac[macpos+ 2] = (this.h[1] >>> 0) & 0xff;
mac[macpos+ 3] = (this.h[1] >>> 8) & 0xff;
mac[macpos+ 4] = (this.h[2] >>> 0) & 0xff;
mac[macpos+ 5] = (this.h[2] >>> 8) & 0xff;
mac[macpos+ 6] = (this.h[3] >>> 0) & 0xff;
mac[macpos+ 7] = (this.h[3] >>> 8) & 0xff;
mac[macpos+ 8] = (this.h[4] >>> 0) & 0xff;
mac[macpos+ 9] = (this.h[4] >>> 8) & 0xff;
mac[macpos+10] = (this.h[5] >>> 0) & 0xff;
mac[macpos+11] = (this.h[5] >>> 8) & 0xff;
mac[macpos+12] = (this.h[6] >>> 0) & 0xff;
mac[macpos+13] = (this.h[6] >>> 8) & 0xff;
mac[macpos+14] = (this.h[7] >>> 0) & 0xff;
mac[macpos+15] = (this.h[7] >>> 8) & 0xff;
};
poly1305.prototype.update = function(m, mpos, bytes) {
var i, want;
if (this.leftover) {
want = (16 - this.leftover);
if (want > bytes)
want = bytes;
for (i = 0; i < want; i++)
this.buffer[this.leftover + i] = m[mpos+i];
bytes -= want;
mpos += want;
this.leftover += want;
if (this.leftover < 16)
return;
this.blocks(buffer, 0, 16);
this.leftover = 0;
}
if (bytes >= 16) {
want = bytes - (bytes % 16);
this.blocks(m, mpos, want);
mpos += want;
bytes -= want;
}
if (bytes) {
for (i = 0; i < bytes; i++)
this.buffer[this.leftover + i] = m[mpos+i];
this.leftover += bytes;
}
};
function crypto_onetimeauth(out, outpos, m, mpos, n, k) {
var s = new poly1305(k);
s.update(m, mpos, n);
s.finish(out, outpos);
return 0;
}
function crypto_onetimeauth_verify(h, hpos, m, mpos, n, k) {
var x = new Uint8Array(16);
crypto_onetimeauth(x,0,m,mpos,n,k);
return crypto_verify_16(h,hpos,x,0);
}
function crypto_secretbox(c,m,d,n,k) {
var i;
if (d < 32) return -1;
crypto_stream_xor(c,0,m,0,d,n,k);
crypto_onetimeauth(c, 16, c, 32, d - 32, c);
for (i = 0; i < 16; i++) c[i] = 0;
return 0;
}
function crypto_secretbox_open(m,c,d,n,k) {
var i;
var x = new Uint8Array(32);
if (d < 32) return -1;
crypto_stream(x,0,32,n,k);
if (crypto_onetimeauth_verify(c, 16,c, 32,d - 32,x) !== 0) return -1;
crypto_stream_xor(m,0,c,0,d,n,k);
for (i = 0; i < 32; i++) m[i] = 0;
return 0;
}
function set25519(r, a) {
var i;
for (i = 0; i < 16; i++) r[i] = a[i]|0;
}
function car25519(o) {
var i, v, c = 1;
for (i = 0; i < 16; i++) {
v = o[i] + c + 65535;
c = Math.floor(v / 65536);
o[i] = v - c * 65536;
}
o[0] += c-1 + 37 * (c-1);
}
function sel25519(p, q, b) {
var t, c = ~(b-1);
for (var i = 0; i < 16; i++) {
t = c & (p[i] ^ q[i]);
p[i] ^= t;
q[i] ^= t;
}
}
function pack25519(o, n) {
var i, j, b;
var m = gf(), t = gf();
for (i = 0; i < 16; i++) t[i] = n[i];
car25519(t);
car25519(t);
car25519(t);
for (j = 0; j < 2; j++) {
m[0] = t[0] - 0xffed;
for (i = 1; i < 15; i++) {
m[i] = t[i] - 0xffff - ((m[i-1]>>16) & 1);
m[i-1] &= 0xffff;
}
m[15] = t[15] - 0x7fff - ((m[14]>>16) & 1);
b = (m[15]>>16) & 1;
m[14] &= 0xffff;
sel25519(t, m, 1-b);
}
for (i = 0; i < 16; i++) {
o[2*i] = t[i] & 0xff;
o[2*i+1] = t[i]>>8;
}
}
function neq25519(a, b) {
var c = new Uint8Array(32), d = new Uint8Array(32);
pack25519(c, a);
pack25519(d, b);
return crypto_verify_32(c, 0, d, 0);
}
function par25519(a) {
var d = new Uint8Array(32);
pack25519(d, a);
return d[0] & 1;
}
function unpack25519(o, n) {
var i;
for (i = 0; i < 16; i++) o[i] = n[2*i] + (n[2*i+1] << 8);
o[15] &= 0x7fff;
}
function A(o, a, b) {
for (var i = 0; i < 16; i++) o[i] = a[i] + b[i];
}
function Z(o, a, b) {
for (var i = 0; i < 16; i++) o[i] = a[i] - b[i];
}
function M(o, a, b) {
var v, c,
t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0,
t8 = 0, t9 = 0, t10 = 0, t11 = 0, t12 = 0, t13 = 0, t14 = 0, t15 = 0,
t16 = 0, t17 = 0, t18 = 0, t19 = 0, t20 = 0, t21 = 0, t22 = 0, t23 = 0,
t24 = 0, t25 = 0, t26 = 0, t27 = 0, t28 = 0, t29 = 0, t30 = 0,
b0 = b[0],
b1 = b[1],
b2 = b[2],
b3 = b[3],
b4 = b[4],
b5 = b[5],
b6 = b[6],
b7 = b[7],
b8 = b[8],
b9 = b[9],
b10 = b[10],
b11 = b[11],
b12 = b[12],
b13 = b[13],
b14 = b[14],
b15 = b[15];
v = a[0];
t0 += v * b0;
t1 += v * b1;
t2 += v * b2;
t3 += v * b3;
t4 += v * b4;
t5 += v * b5;
t6 += v * b6;
t7 += v * b7;
t8 += v * b8;
t9 += v * b9;
t10 += v * b10;
t11 += v * b11;
t12 += v * b12;
t13 += v * b13;
t14 += v * b14;
t15 += v * b15;
v = a[1];
t1 += v * b0;
t2 += v * b1;
t3 += v * b2;
t4 += v * b3;
t5 += v * b4;
t6 += v * b5;
t7 += v * b6;
t8 += v * b7;
t9 += v * b8;
t10 += v * b9;
t11 += v * b10;
t12 += v * b11;
t13 += v * b12;
t14 += v * b13;
t15 += v * b14;
t16 += v * b15;
v = a[2];
t2 += v * b0;
t3 += v * b1;
t4 += v * b2;
t5 += v * b3;
t6 += v * b4;
t7 += v * b5;
t8 += v * b6;
t9 += v * b7;
t10 += v * b8;
t11 += v * b9;
t12 += v * b10;
t13 += v * b11;
t14 += v * b12;
t15 += v * b13;
t16 += v * b14;
t17 += v * b15;
v = a[3];
t3 += v * b0;
t4 += v * b1;
t5 += v * b2;
t6 += v * b3;
t7 += v * b4;
t8 += v * b5;
t9 += v * b6;
t10 += v * b7;
t11 += v * b8;
t12 += v * b9;
t13 += v * b10;
t14 += v * b11;
t15 += v * b12;
t16 += v * b13;
t17 += v * b14;
t18 += v * b15;
v = a[4];
t4 += v * b0;
t5 += v * b1;
t6 += v * b2;
t7 += v * b3;
t8 += v * b4;
t9 += v * b5;
t10 += v * b6;
t11 += v * b7;
t12 += v * b8;
t13 += v * b9;
t14 += v * b10;
t15 += v * b11;
t16 += v * b12;
t17 += v * b13;
t18 += v * b14;
t19 += v * b15;
v = a[5];
t5 += v * b0;
t6 += v * b1;
t7 += v * b2;
t8 += v * b3;
t9 += v * b4;
t10 += v * b5;
t11 += v * b6;
t12 += v * b7;
t13 += v * b8;
t14 += v * b9;
t15 += v * b10;
t16 += v * b11;
t17 += v * b12;
t18 += v * b13;
t19 += v * b14;
t20 += v * b15;
v = a[6];
t6 += v * b0;
t7 += v * b1;
t8 += v * b2;
t9 += v * b3;
t10 += v * b4;
t11 += v * b5;
t12 += v * b6;
t13 += v * b7;
t14 += v * b8;
t15 += v * b9;
t16 += v * b10;
t17 += v * b11;
t18 += v * b12;
t19 += v * b13;
t20 += v * b14;
t21 += v * b15;
v = a[7];
t7 += v * b0;
t8 += v * b1;
t9 += v * b2;
t10 += v * b3;
t11 += v * b4;
t12 += v * b5;
t13 += v * b6;
t14 += v * b7;
t15 += v * b8;
t16 += v * b9;
t17 += v * b10;
t18 += v * b11;
t19 += v * b12;
t20 += v * b13;
t21 += v * b14;
t22 += v * b15;
v = a[8];
t8 += v * b0;
t9 += v * b1;
t10 += v * b2;
t11 += v * b3;
t12 += v * b4;
t13 += v * b5;
t14 += v * b6;
t15 += v * b7;
t16 += v * b8;
t17 += v * b9;
t18 += v * b10;
t19 += v * b11;
t20 += v * b12;
t21 += v * b13;
t22 += v * b14;
t23 += v * b15;
v = a[9];
t9 += v * b0;
t10 += v * b1;
t11 += v * b2;
t12 += v * b3;
t13 += v * b4;
t14 += v * b5;
t15 += v * b6;
t16 += v * b7;
t17 += v * b8;
t18 += v * b9;
t19 += v * b10;
t20 += v * b11;
t21 += v * b12;
t22 += v * b13;
t23 += v * b14;
t24 += v * b15;
v = a[10];
t10 += v * b0;
t11 += v * b1;
t12 += v * b2;
t13 += v * b3;
t14 += v * b4;
t15 += v * b5;
t16 += v * b6;
t17 += v * b7;
t18 += v * b8;
t19 += v * b9;
t20 += v * b10;
t21 += v * b11;
t22 += v * b12;
t23 += v * b13;
t24 += v * b14;
t25 += v * b15;
v = a[11];
t11 += v * b0;
t12 += v * b1;
t13 += v * b2;
t14 += v * b3;
t15 += v * b4;
t16 += v * b5;
t17 += v * b6;
t18 += v * b7;
t19 += v * b8;
t20 += v * b9;
t21 += v * b10;
t22 += v * b11;
t23 += v * b12;
t24 += v * b13;
t25 += v * b14;
t26 += v * b15;
v = a[12];
t12 += v * b0;
t13 += v * b1;
t14 += v * b2;
t15 += v * b3;
t16 += v * b4;
t17 += v * b5;
t18 += v * b6;
t19 += v * b7;
t20 += v * b8;
t21 += v * b9;
t22 += v * b10;
t23 += v * b11;
t24 += v * b12;
t25 += v * b13;
t26 += v * b14;
t27 += v * b15;
v = a[13];
t13 += v * b0;
t14 += v * b1;
t15 += v * b2;
t16 += v * b3;
t17 += v * b4;
t18 += v * b5;
t19 += v * b6;
t20 += v * b7;
t21 += v * b8;
t22 += v * b9;
t23 += v * b10;
t24 += v * b11;
t25 += v * b12;
t26 += v * b13;
t27 += v * b14;
t28 += v * b15;
v = a[14];
t14 += v * b0;
t15 += v * b1;
t16 += v * b2;
t17 += v * b3;
t18 += v * b4;
t19 += v * b5;
t20 += v * b6;
t21 += v * b7;
t22 += v * b8;
t23 += v * b9;
t24 += v * b10;
t25 += v * b11;
t26 += v * b12;
t27 += v * b13;
t28 += v * b14;
t29 += v * b15;
v = a[15];
t15 += v * b0;
t16 += v * b1;
t17 += v * b2;
t18 += v * b3;
t19 += v * b4;
t20 += v * b5;
t21 += v * b6;
t22 += v * b7;
t23 += v * b8;
t24 += v * b9;
t25 += v * b10;
t26 += v * b11;
t27 += v * b12;
t28 += v * b13;
t29 += v * b14;
t30 += v * b15;
t0 += 38 * t16;
t1 += 38 * t17;
t2 += 38 * t18;
t3 += 38 * t19;
t4 += 38 * t20;
t5 += 38 * t21;
t6 += 38 * t22;
t7 += 38 * t23;
t8 += 38 * t24;
t9 += 38 * t25;
t10 += 38 * t26;
t11 += 38 * t27;
t12 += 38 * t28;
t13 += 38 * t29;
t14 += 38 * t30;
// t15 left as is
// first car
c = 1;
v = t0 + c + 65535; c = Math.floor(v / 65536); t0 = v - c * 65536;
v = t1 + c + 65535; c = Math.floor(v / 65536); t1 = v - c * 65536;
v = t2 + c + 65535; c = Math.floor(v / 65536); t2 = v - c * 65536;
v = t3 + c + 65535; c = Math.floor(v / 65536); t3 = v - c * 65536;
v = t4 + c + 65535; c = Math.floor(v / 65536); t4 = v - c * 65536;
v = t5 + c + 65535; c = Math.floor(v / 65536); t5 = v - c * 65536;
v = t6 + c + 65535; c = Math.floor(v / 65536); t6 = v - c * 65536;
v = t7 + c + 65535; c = Math.floor(v / 65536); t7 = v - c * 65536;
v = t8 + c + 65535; c = Math.floor(v / 65536); t8 = v - c * 65536;
v = t9 + c + 65535; c = Math.floor(v / 65536); t9 = v - c * 65536;
v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;
v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;
v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;
v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;
v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;
v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;
t0 += c-1 + 37 * (c-1);
// second car
c = 1;
v = t0 + c + 65535; c = Math.floor(v / 65536); t0 = v - c * 65536;
v = t1 + c + 65535; c = Math.floor(v / 65536); t1 = v - c * 65536;
v = t2 + c + 65535; c = Math.floor(v / 65536); t2 = v - c * 65536;
v = t3 + c + 65535; c = Math.floor(v / 65536); t3 = v - c * 65536;
v = t4 + c + 65535; c = Math.floor(v / 65536); t4 = v - c * 65536;
v = t5 + c + 65535; c = Math.floor(v / 65536); t5 = v - c * 65536;
v = t6 + c + 65535; c = Math.floor(v / 65536); t6 = v - c * 65536;
v = t7 + c + 65535; c = Math.floor(v / 65536); t7 = v - c * 65536;
v = t8 + c + 65535; c = Math.floor(v / 65536); t8 = v - c * 65536;
v = t9 + c + 65535; c = Math.floor(v / 65536); t9 = v - c * 65536;
v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;
v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;
v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;
v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;
v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;
v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;
t0 += c-1 + 37 * (c-1);
o[ 0] = t0;
o[ 1] = t1;
o[ 2] = t2;
o[ 3] = t3;
o[ 4] = t4;
o[ 5] = t5;
o[ 6] = t6;
o[ 7] = t7;
o[ 8] = t8;
o[ 9] = t9;
o[10] = t10;
o[11] = t11;
o[12] = t12;
o[13] = t13;
o[14] = t14;
o[15] = t15;
}
function S(o, a) {
M(o, a, a);
}
function inv25519(o, i) {
var c = gf();
var a;
for (a = 0; a < 16; a++) c[a] = i[a];
for (a = 253; a >= 0; a--) {
S(c, c);
if(a !== 2 && a !== 4) M(c, c, i);
}
for (a = 0; a < 16; a++) o[a] = c[a];
}
function pow2523(o, i) {
var c = gf();
var a;
for (a = 0; a < 16; a++) c[a] = i[a];
for (a = 250; a >= 0; a--) {
S(c, c);
if(a !== 1) M(c, c, i);
}
for (a = 0; a < 16; a++) o[a] = c[a];
}
function crypto_scalarmult(q, n, p) {
var z = new Uint8Array(32);
var x = new Float64Array(80), r, i;
var a = gf(), b = gf(), c = gf(),
d = gf(), e = gf(), f = gf();
for (i = 0; i < 31; i++) z[i] = n[i];
z[31]=(n[31]&127)|64;
z[0]&=248;
unpack25519(x,p);
for (i = 0; i < 16; i++) {
b[i]=x[i];
d[i]=a[i]=c[i]=0;
}
a[0]=d[0]=1;
for (i=254;i>=0;--i) {
r=(z[i>>>3]>>>(i&7))&1;
sel25519(a,b,r);
sel25519(c,d,r);
A(e,a,c);
Z(a,a,c);
A(c,b,d);
Z(b,b,d);
S(d,e);
S(f,a);
M(a,c,a);
M(c,b,e);
A(e,a,c);
Z(a,a,c);
S(b,a);
Z(c,d,f);
M(a,c,_121665);
A(a,a,d);
M(c,c,a);
M(a,d,f);
M(d,b,x);
S(b,e);
sel25519(a,b,r);
sel25519(c,d,r);
}
for (i = 0; i < 16; i++) {
x[i+16]=a[i];
x[i+32]=c[i];
x[i+48]=b[i];
x[i+64]=d[i];
}
var x32 = x.subarray(32);
var x16 = x.subarray(16);
inv25519(x32,x32);
M(x16,x16,x32);
pack25519(q,x16);
return 0;
}
function crypto_scalarmult_base(q, n) {
return crypto_scalarmult(q, n, _9);
}
function crypto_box_keypair(y, x) {
randombytes(x, 32);
return crypto_scalarmult_base(y, x);
}
function crypto_box_beforenm(k, y, x) {
var s = new Uint8Array(32);
crypto_scalarmult(s, x, y);
return crypto_core_hsalsa20(k, _0, s, sigma);
}
var crypto_box_afternm = crypto_secretbox;
var crypto_box_open_afternm = crypto_secretbox_open;
function crypto_box(c, m, d, n, y, x) {
var k = new Uint8Array(32);
crypto_box_beforenm(k, y, x);
return crypto_box_afternm(c, m, d, n, k);
}
function crypto_box_open(m, c, d, n, y, x) {
var k = new Uint8Array(32);
crypto_box_beforenm(k, y, x);
return crypto_box_open_afternm(m, c, d, n, k);
}
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
];
function crypto_hashblocks_hl(hh, hl, m, n) {
var wh = new Int32Array(16), wl = new Int32Array(16),
bh0, bh1, bh2, bh3, bh4, bh5, bh6, bh7,
bl0, bl1, bl2, bl3, bl4, bl5, bl6, bl7,
th, tl, i, j, h, l, a, b, c, d;
var ah0 = hh[0],
ah1 = hh[1],
ah2 = hh[2],
ah3 = hh[3],
ah4 = hh[4],
ah5 = hh[5],
ah6 = hh[6],
ah7 = hh[7],
al0 = hl[0],
al1 = hl[1],
al2 = hl[2],
al3 = hl[3],
al4 = hl[4],
al5 = hl[5],
al6 = hl[6],
al7 = hl[7];
var pos = 0;
while (n >= 128) {
for (i = 0; i < 16; i++) {
j = 8 * i + pos;
wh[i] = (m[j+0] << 24) | (m[j+1] << 16) | (m[j+2] << 8) | m[j+3];
wl[i] = (m[j+4] << 24) | (m[j+5] << 16) | (m[j+6] << 8) | m[j+7];
}
for (i = 0; i < 80; i++) {
bh0 = ah0;
bh1 = ah1;
bh2 = ah2;
bh3 = ah3;
bh4 = ah4;
bh5 = ah5;
bh6 = ah6;
bh7 = ah7;
bl0 = al0;
bl1 = al1;
bl2 = al2;
bl3 = al3;
bl4 = al4;
bl5 = al5;
bl6 = al6;
bl7 = al7;
// add
h = ah7;
l = al7;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
// Sigma1
h = ((ah4 >>> 14) | (al4 << (32-14))) ^ ((ah4 >>> 18) | (al4 << (32-18))) ^ ((al4 >>> (41-32)) | (ah4 << (32-(41-32))));
l = ((al4 >>> 14) | (ah4 << (32-14))) ^ ((al4 >>> 18) | (ah4 << (32-18))) ^ ((ah4 >>> (41-32)) | (al4 << (32-(41-32))));
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
// Ch
h = (ah4 & ah5) ^ (~ah4 & ah6);
l = (al4 & al5) ^ (~al4 & al6);
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
// K
h = K[i*2];
l = K[i*2+1];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
// w
h = wh[i%16];
l = wl[i%16];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
th = c & 0xffff | d << 16;
tl = a & 0xffff | b << 16;
// add
h = th;
l = tl;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
// Sigma0
h = ((ah0 >>> 28) | (al0 << (32-28))) ^ ((al0 >>> (34-32)) | (ah0 << (32-(34-32)))) ^ ((al0 >>> (39-32)) | (ah0 << (32-(39-32))));
l = ((al0 >>> 28) | (ah0 << (32-28))) ^ ((ah0 >>> (34-32)) | (al0 << (32-(34-32)))) ^ ((ah0 >>> (39-32)) | (al0 << (32-(39-32))));
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
// Maj
h = (ah0 & ah1) ^ (ah0 & ah2) ^ (ah1 & ah2);
l = (al0 & al1) ^ (al0 & al2) ^ (al1 & al2);
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
bh7 = (c & 0xffff) | (d << 16);
bl7 = (a & 0xffff) | (b << 16);
// add
h = bh3;
l = bl3;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = th;
l = tl;
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
bh3 = (c & 0xffff) | (d << 16);
bl3 = (a & 0xffff) | (b << 16);
ah1 = bh0;
ah2 = bh1;
ah3 = bh2;
ah4 = bh3;
ah5 = bh4;
ah6 = bh5;
ah7 = bh6;
ah0 = bh7;
al1 = bl0;
al2 = bl1;
al3 = bl2;
al4 = bl3;
al5 = bl4;
al6 = bl5;
al7 = bl6;
al0 = bl7;
if (i%16 === 15) {
for (j = 0; j < 16; j++) {
// add
h = wh[j];
l = wl[j];
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = wh[(j+9)%16];
l = wl[(j+9)%16];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
// sigma0
th = wh[(j+1)%16];
tl = wl[(j+1)%16];
h = ((th >>> 1) | (tl << (32-1))) ^ ((th >>> 8) | (tl << (32-8))) ^ (th >>> 7);
l = ((tl >>> 1) | (th << (32-1))) ^ ((tl >>> 8) | (th << (32-8))) ^ ((tl >>> 7) | (th << (32-7)));
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
// sigma1
th = wh[(j+14)%16];
tl = wl[(j+14)%16];
h = ((th >>> 19) | (tl << (32-19))) ^ ((tl >>> (61-32)) | (th << (32-(61-32)))) ^ (th >>> 6);
l = ((tl >>> 19) | (th << (32-19))) ^ ((th >>> (61-32)) | (tl << (32-(61-32)))) ^ ((tl >>> 6) | (th << (32-6)));
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
wh[j] = (c & 0xffff) | (d << 16);
wl[j] = (a & 0xffff) | (b << 16);
}
}
}
// add
h = ah0;
l = al0;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[0];
l = hl[0];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[0] = ah0 = (c & 0xffff) | (d << 16);
hl[0] = al0 = (a & 0xffff) | (b << 16);
h = ah1;
l = al1;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[1];
l = hl[1];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[1] = ah1 = (c & 0xffff) | (d << 16);
hl[1] = al1 = (a & 0xffff) | (b << 16);
h = ah2;
l = al2;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[2];
l = hl[2];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[2] = ah2 = (c & 0xffff) | (d << 16);
hl[2] = al2 = (a & 0xffff) | (b << 16);
h = ah3;
l = al3;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[3];
l = hl[3];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[3] = ah3 = (c & 0xffff) | (d << 16);
hl[3] = al3 = (a & 0xffff) | (b << 16);
h = ah4;
l = al4;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[4];
l = hl[4];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[4] = ah4 = (c & 0xffff) | (d << 16);
hl[4] = al4 = (a & 0xffff) | (b << 16);
h = ah5;
l = al5;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[5];
l = hl[5];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[5] = ah5 = (c & 0xffff) | (d << 16);
hl[5] = al5 = (a & 0xffff) | (b << 16);
h = ah6;
l = al6;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[6];
l = hl[6];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[6] = ah6 = (c & 0xffff) | (d << 16);
hl[6] = al6 = (a & 0xffff) | (b << 16);
h = ah7;
l = al7;
a = l & 0xffff; b = l >>> 16;
c = h & 0xffff; d = h >>> 16;
h = hh[7];
l = hl[7];
a += l & 0xffff; b += l >>> 16;
c += h & 0xffff; d += h >>> 16;
b += a >>> 16;
c += b >>> 16;
d += c >>> 16;
hh[7] = ah7 = (c & 0xffff) | (d << 16);
hl[7] = al7 = (a & 0xffff) | (b << 16);
pos += 128;
n -= 128;
}
return n;
}
function crypto_hash(out, m, n) {
var hh = new Int32Array(8),
hl = new Int32Array(8),
x = new Uint8Array(256),
i, b = n;
hh[0] = 0x6a09e667;
hh[1] = 0xbb67ae85;
hh[2] = 0x3c6ef372;
hh[3] = 0xa54ff53a;
hh[4] = 0x510e527f;
hh[5] = 0x9b05688c;
hh[6] = 0x1f83d9ab;
hh[7] = 0x5be0cd19;
hl[0] = 0xf3bcc908;
hl[1] = 0x84caa73b;
hl[2] = 0xfe94f82b;
hl[3] = 0x5f1d36f1;
hl[4] = 0xade682d1;
hl[5] = 0x2b3e6c1f;
hl[6] = 0xfb41bd6b;
hl[7] = 0x137e2179;
crypto_hashblocks_hl(hh, hl, m, n);
n %= 128;
for (i = 0; i < n; i++) x[i] = m[b-n+i];
x[n] = 128;
n = 256-128*(n<112?1:0);
x[n-9] = 0;
ts64(x, n-8, (b / 0x20000000) | 0, b << 3);
crypto_hashblocks_hl(hh, hl, x, n);
for (i = 0; i < 8; i++) ts64(out, 8*i, hh[i], hl[i]);
return 0;
}
function add(p, q) {
var a = gf(), b = gf(), c = gf(),
d = gf(), e = gf(), f = gf(),
g = gf(), h = gf(), t = gf();
Z(a, p[1], p[0]);
Z(t, q[1], q[0]);
M(a, a, t);
A(b, p[0], p[1]);
A(t, q[0], q[1]);
M(b, b, t);
M(c, p[3], q[3]);
M(c, c, D2);
M(d, p[2], q[2]);
A(d, d, d);
Z(e, b, a);
Z(f, d, c);
A(g, d, c);
A(h, b, a);
M(p[0], e, f);
M(p[1], h, g);
M(p[2], g, f);
M(p[3], e, h);
}
function cswap(p, q, b) {
var i;
for (i = 0; i < 4; i++) {
sel25519(p[i], q[i], b);
}
}
function pack(r, p) {
var tx = gf(), ty = gf(), zi = gf();
inv25519(zi, p[2]);
M(tx, p[0], zi);
M(ty, p[1], zi);
pack25519(r, ty);
r[31] ^= par25519(tx) << 7;
}
function scalarmult(p, q, s) {
var b, i;
set25519(p[0], gf0);
set25519(p[1], gf1);
set25519(p[2], gf1);
set25519(p[3], gf0);
for (i = 255; i >= 0; --i) {
b = (s[(i/8)|0] >> (i&7)) & 1;
cswap(p, q, b);
add(q, p);
add(p, p);
cswap(p, q, b);
}
}
function scalarbase(p, s) {
var q = [gf(), gf(), gf(), gf()];
set25519(q[0], X);
set25519(q[1], Y);
set25519(q[2], gf1);
M(q[3], X, Y);
scalarmult(p, q, s);
}
function crypto_sign_keypair(pk, sk, seeded) {
var d = new Uint8Array(64);
var p = [gf(), gf(), gf(), gf()];
var i;
if (!seeded) randombytes(sk, 32);
crypto_hash(d, sk, 32);
d[0] &= 248;
d[31] &= 127;
d[31] |= 64;
scalarbase(p, d);
pack(pk, p);
for (i = 0; i < 32; i++) sk[i+32] = pk[i];
return 0;
}
var L = new Float64Array([0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58, 0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x10]);
function modL(r, x) {
var carry, i, j, k;
for (i = 63; i >= 32; --i) {
carry = 0;
for (j = i - 32, k = i - 12; j < k; ++j) {
x[j] += carry - 16 * x[i] * L[j - (i - 32)];
carry = (x[j] + 128) >> 8;
x[j] -= carry * 256;
}
x[j] += carry;
x[i] = 0;
}
carry = 0;
for (j = 0; j < 32; j++) {
x[j] += carry - (x[31] >> 4) * L[j];
carry = x[j] >> 8;
x[j] &= 255;
}
for (j = 0; j < 32; j++) x[j] -= carry * L[j];
for (i = 0; i < 32; i++) {
x[i+1] += x[i] >> 8;
r[i] = x[i] & 255;
}
}
function reduce(r) {
var x = new Float64Array(64), i;
for (i = 0; i < 64; i++) x[i] = r[i];
for (i = 0; i < 64; i++) r[i] = 0;
modL(r, x);
}
// Note: difference from C - smlen returned, not passed as argument.
function crypto_sign(sm, m, n, sk) {
var d = new Uint8Array(64), h = new Uint8Array(64), r = new Uint8Array(64);
var i, j, x = new Float64Array(64);
var p = [gf(), gf(), gf(), gf()];
crypto_hash(d, sk, 32);
d[0] &= 248;
d[31] &= 127;
d[31] |= 64;
var smlen = n + 64;
for (i = 0; i < n; i++) sm[64 + i] = m[i];
for (i = 0; i < 32; i++) sm[32 + i] = d[32 + i];
crypto_hash(r, sm.subarray(32), n+32);
reduce(r);
scalarbase(p, r);
pack(sm, p);
for (i = 32; i < 64; i++) sm[i] = sk[i];
crypto_hash(h, sm, n + 64);
reduce(h);
for (i = 0; i < 64; i++) x[i] = 0;
for (i = 0; i < 32; i++) x[i] = r[i];
for (i = 0; i < 32; i++) {
for (j = 0; j < 32; j++) {
x[i+j] += h[i] * d[j];
}
}
modL(sm.subarray(32), x);
return smlen;
}
function unpackneg(r, p) {
var t = gf(), chk = gf(), num = gf(),
den = gf(), den2 = gf(), den4 = gf(),
den6 = gf();
set25519(r[2], gf1);
unpack25519(r[1], p);
S(num, r[1]);
M(den, num, D);
Z(num, num, r[2]);
A(den, r[2], den);
S(den2, den);
S(den4, den2);
M(den6, den4, den2);
M(t, den6, num);
M(t, t, den);
pow2523(t, t);
M(t, t, num);
M(t, t, den);
M(t, t, den);
M(r[0], t, den);
S(chk, r[0]);
M(chk, chk, den);
if (neq25519(chk, num)) M(r[0], r[0], I);
S(chk, r[0]);
M(chk, chk, den);
if (neq25519(chk, num)) return -1;
if (par25519(r[0]) === (p[31]>>7)) Z(r[0], gf0, r[0]);
M(r[3], r[0], r[1]);
return 0;
}
function crypto_sign_open(m, sm, n, pk) {
var i, mlen;
var t = new Uint8Array(32), h = new Uint8Array(64);
var p = [gf(), gf(), gf(), gf()],
q = [gf(), gf(), gf(), gf()];
mlen = -1;
if (n < 64) return -1;
if (unpackneg(q, pk)) return -1;
for (i = 0; i < n; i++) m[i] = sm[i];
for (i = 0; i < 32; i++) m[i+32] = pk[i];
crypto_hash(h, m, n);
reduce(h);
scalarmult(p, q, h);
scalarbase(q, sm.subarray(32));
add(p, q);
pack(t, p);
n -= 64;
if (crypto_verify_32(sm, 0, t, 0)) {
for (i = 0; i < n; i++) m[i] = 0;
return -1;
}
for (i = 0; i < n; i++) m[i] = sm[i + 64];
mlen = n;
return mlen;
}
var crypto_secretbox_KEYBYTES = 32,
crypto_secretbox_NONCEBYTES = 24,
crypto_secretbox_ZEROBYTES = 32,
crypto_secretbox_BOXZEROBYTES = 16,
crypto_scalarmult_BYTES = 32,
crypto_scalarmult_SCALARBYTES = 32,
crypto_box_PUBLICKEYBYTES = 32,
crypto_box_SECRETKEYBYTES = 32,
crypto_box_BEFORENMBYTES = 32,
crypto_box_NONCEBYTES = crypto_secretbox_NONCEBYTES,
crypto_box_ZEROBYTES = crypto_secretbox_ZEROBYTES,
crypto_box_BOXZEROBYTES = crypto_secretbox_BOXZEROBYTES,
crypto_sign_BYTES = 64,
crypto_sign_PUBLICKEYBYTES = 32,
crypto_sign_SECRETKEYBYTES = 64,
crypto_sign_SEEDBYTES = 32,
crypto_hash_BYTES = 64;
nacl.lowlevel = {
crypto_core_hsalsa20: crypto_core_hsalsa20,
crypto_stream_xor : crypto_stream_xor,
crypto_stream : crypto_stream,
crypto_stream_salsa20_xor : crypto_stream_salsa20_xor,
crypto_stream_salsa20 : crypto_stream_salsa20,
crypto_onetimeauth : crypto_onetimeauth,
crypto_onetimeauth_verify : crypto_onetimeauth_verify,
crypto_verify_16 : crypto_verify_16,
crypto_verify_32 : crypto_verify_32,
crypto_secretbox : crypto_secretbox,
crypto_secretbox_open : crypto_secretbox_open,
crypto_scalarmult : crypto_scalarmult,
crypto_scalarmult_base : crypto_scalarmult_base,
crypto_box_beforenm : crypto_box_beforenm,
crypto_box_afternm : crypto_box_afternm,
crypto_box : crypto_box,
crypto_box_open : crypto_box_open,
crypto_box_keypair : crypto_box_keypair,
crypto_hash : crypto_hash,
crypto_sign : crypto_sign,
crypto_sign_keypair : crypto_sign_keypair,
crypto_sign_open : crypto_sign_open,
crypto_secretbox_KEYBYTES : crypto_secretbox_KEYBYTES,
crypto_secretbox_NONCEBYTES : crypto_secretbox_NONCEBYTES,
crypto_secretbox_ZEROBYTES : crypto_secretbox_ZEROBYTES,
crypto_secretbox_BOXZEROBYTES : crypto_secretbox_BOXZEROBYTES,
crypto_scalarmult_BYTES : crypto_scalarmult_BYTES,
crypto_scalarmult_SCALARBYTES : crypto_scalarmult_SCALARBYTES,
crypto_box_PUBLICKEYBYTES : crypto_box_PUBLICKEYBYTES,
crypto_box_SECRETKEYBYTES : crypto_box_SECRETKEYBYTES,
crypto_box_BEFORENMBYTES : crypto_box_BEFORENMBYTES,
crypto_box_NONCEBYTES : crypto_box_NONCEBYTES,
crypto_box_ZEROBYTES : crypto_box_ZEROBYTES,
crypto_box_BOXZEROBYTES : crypto_box_BOXZEROBYTES,
crypto_sign_BYTES : crypto_sign_BYTES,
crypto_sign_PUBLICKEYBYTES : crypto_sign_PUBLICKEYBYTES,
crypto_sign_SECRETKEYBYTES : crypto_sign_SECRETKEYBYTES,
crypto_sign_SEEDBYTES: crypto_sign_SEEDBYTES,
crypto_hash_BYTES : crypto_hash_BYTES
};
/* High-level API */
function checkLengths(k, n) {
if (k.length !== crypto_secretbox_KEYBYTES) throw new Error('bad key size');
if (n.length !== crypto_secretbox_NONCEBYTES) throw new Error('bad nonce size');
}
function checkBoxLengths(pk, sk) {
if (pk.length !== crypto_box_PUBLICKEYBYTES) throw new Error('bad public key size');
if (sk.length !== crypto_box_SECRETKEYBYTES) throw new Error('bad secret key size');
}
function checkArrayTypes() {
var type = {}.toString, t;
for (var i = 0; i < arguments.length; i++) {
if ((t = type.call(arguments[i])) !== '[object Uint8Array]')
throw new TypeError('unexpected type ' + t + ', use Uint8Array');
}
}
nacl.util = {};
nacl.util.decodeUTF8 = function(s) {
var i, d = unescape(encodeURIComponent(s)), b = new Uint8Array(d.length);
for (i = 0; i < d.length; i++) b[i] = d.charCodeAt(i);
return b;
};
nacl.util.encodeUTF8 = function(arr) {
var i, s = [];
for (i = 0; i < arr.length; i++) s.push(String.fromCharCode(arr[i]));
return decodeURIComponent(escape(s.join('')));
};
nacl.util.encodeBase64 = function(arr) {
if (typeof btoa === 'undefined') {
return (new Buffer(arr)).toString('base64');
} else {
var i, s = [], len = arr.length;
for (i = 0; i < len; i++) s.push(String.fromCharCode(arr[i]));
return btoa(s.join(''));
}
};
nacl.util.decodeBase64 = function(s) {
if (typeof atob === 'undefined') {
return new Uint8Array(Array.prototype.slice.call(new Buffer(s, 'base64'), 0));
} else {
var i, d = atob(s), b = new Uint8Array(d.length);
for (i = 0; i < d.length; i++) b[i] = d.charCodeAt(i);
return b;
}
};
nacl.randomBytes = function(n) {
var b = new Uint8Array(n);
randombytes(b, n);
return b;
};
nacl.secretbox = function(msg, nonce, key) {
checkArrayTypes(msg, nonce, key);
checkLengths(key, nonce);
var m = new Uint8Array(crypto_secretbox_ZEROBYTES + msg.length);
var c = new Uint8Array(m.length);
for (var i = 0; i < msg.length; i++) m[i+crypto_secretbox_ZEROBYTES] = msg[i];
crypto_secretbox(c, m, m.length, nonce, key);
return c.subarray(crypto_secretbox_BOXZEROBYTES);
};
nacl.secretbox.open = function(box, nonce, key) {
checkArrayTypes(box, nonce, key);
checkLengths(key, nonce);
var c = new Uint8Array(crypto_secretbox_BOXZEROBYTES + box.length);
var m = new Uint8Array(c.length);
for (var i = 0; i < box.length; i++) c[i+crypto_secretbox_BOXZEROBYTES] = box[i];
if (c.length < 32) return false;
if (crypto_secretbox_open(m, c, c.length, nonce, key) !== 0) return false;
return m.subarray(crypto_secretbox_ZEROBYTES);
};
nacl.secretbox.keyLength = crypto_secretbox_KEYBYTES;
nacl.secretbox.nonceLength = crypto_secretbox_NONCEBYTES;
nacl.secretbox.overheadLength = crypto_secretbox_BOXZEROBYTES;
nacl.scalarMult = function(n, p) {
checkArrayTypes(n, p);
if (n.length !== crypto_scalarmult_SCALARBYTES) throw new Error('bad n size');
if (p.length !== crypto_scalarmult_BYTES) throw new Error('bad p size');
var q = new Uint8Array(crypto_scalarmult_BYTES);
crypto_scalarmult(q, n, p);
return q;
};
nacl.scalarMult.base = function(n) {
checkArrayTypes(n);
if (n.length !== crypto_scalarmult_SCALARBYTES) throw new Error('bad n size');
var q = new Uint8Array(crypto_scalarmult_BYTES);
crypto_scalarmult_base(q, n);
return q;
};
nacl.scalarMult.scalarLength = crypto_scalarmult_SCALARBYTES;
nacl.scalarMult.groupElementLength = crypto_scalarmult_BYTES;
nacl.box = function(msg, nonce, publicKey, secretKey) {
var k = nacl.box.before(publicKey, secretKey);
return nacl.secretbox(msg, nonce, k);
};
nacl.box.before = function(publicKey, secretKey) {
checkArrayTypes(publicKey, secretKey);
checkBoxLengths(publicKey, secretKey);
var k = new Uint8Array(crypto_box_BEFORENMBYTES);
crypto_box_beforenm(k, publicKey, secretKey);
return k;
};
nacl.box.after = nacl.secretbox;
nacl.box.open = function(msg, nonce, publicKey, secretKey) {
var k = nacl.box.before(publicKey, secretKey);
return nacl.secretbox.open(msg, nonce, k);
};
nacl.box.open.after = nacl.secretbox.open;
nacl.box.keyPair = function() {
var pk = new Uint8Array(crypto_box_PUBLICKEYBYTES);
var sk = new Uint8Array(crypto_box_SECRETKEYBYTES);
crypto_box_keypair(pk, sk);
return {publicKey: pk, secretKey: sk};
};
nacl.box.keyPair.fromSecretKey = function(secretKey) {
checkArrayTypes(secretKey);
if (secretKey.length !== crypto_box_SECRETKEYBYTES)
throw new Error('bad secret key size');
var pk = new Uint8Array(crypto_box_PUBLICKEYBYTES);
crypto_scalarmult_base(pk, secretKey);
return {publicKey: pk, secretKey: new Uint8Array(secretKey)};
};
nacl.box.publicKeyLength = crypto_box_PUBLICKEYBYTES;
nacl.box.secretKeyLength = crypto_box_SECRETKEYBYTES;
nacl.box.sharedKeyLength = crypto_box_BEFORENMBYTES;
nacl.box.nonceLength = crypto_box_NONCEBYTES;
nacl.box.overheadLength = nacl.secretbox.overheadLength;
nacl.sign = function(msg, secretKey) {
checkArrayTypes(msg, secretKey);
if (secretKey.length !== crypto_sign_SECRETKEYBYTES)
throw new Error('bad secret key size');
var signedMsg = new Uint8Array(crypto_sign_BYTES+msg.length);
crypto_sign(signedMsg, msg, msg.length, secretKey);
return signedMsg;
};
nacl.sign.open = function(signedMsg, publicKey) {
if (arguments.length !== 2)
throw new Error('nacl.sign.open accepts 2 arguments; did you mean to use nacl.sign.detached.verify?');
checkArrayTypes(signedMsg, publicKey);
if (publicKey.length !== crypto_sign_PUBLICKEYBYTES)
throw new Error('bad public key size');
var tmp = new Uint8Array(signedMsg.length);
var mlen = crypto_sign_open(tmp, signedMsg, signedMsg.length, publicKey);
if (mlen < 0) return null;
var m = new Uint8Array(mlen);
for (var i = 0; i < m.length; i++) m[i] = tmp[i];
return m;
};
nacl.sign.detached = function(msg, secretKey) {
var signedMsg = nacl.sign(msg, secretKey);
var sig = new Uint8Array(crypto_sign_BYTES);
for (var i = 0; i < sig.length; i++) sig[i] = signedMsg[i];
return sig;
};
nacl.sign.detached.verify = function(msg, sig, publicKey) {
checkArrayTypes(msg, sig, publicKey);
if (sig.length !== crypto_sign_BYTES)
throw new Error('bad signature size');
if (publicKey.length !== crypto_sign_PUBLICKEYBYTES)
throw new Error('bad public key size');
var sm = new Uint8Array(crypto_sign_BYTES + msg.length);
var m = new Uint8Array(crypto_sign_BYTES + msg.length);
var i;
for (i = 0; i < crypto_sign_BYTES; i++) sm[i] = sig[i];
for (i = 0; i < msg.length; i++) sm[i+crypto_sign_BYTES] = msg[i];
return (crypto_sign_open(m, sm, sm.length, publicKey) >= 0);
};
nacl.sign.keyPair = function() {
var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);
var sk = new Uint8Array(crypto_sign_SECRETKEYBYTES);
crypto_sign_keypair(pk, sk);
return {publicKey: pk, secretKey: sk};
};
nacl.sign.keyPair.fromSecretKey = function(secretKey) {
checkArrayTypes(secretKey);
if (secretKey.length !== crypto_sign_SECRETKEYBYTES)
throw new Error('bad secret key size');
var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);
for (var i = 0; i < pk.length; i++) pk[i] = secretKey[32+i];
return {publicKey: pk, secretKey: new Uint8Array(secretKey)};
};
nacl.sign.keyPair.fromSeed = function(seed) {
checkArrayTypes(seed);
if (seed.length !== crypto_sign_SEEDBYTES)
throw new Error('bad seed size');
var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);
var sk = new Uint8Array(crypto_sign_SECRETKEYBYTES);
for (var i = 0; i < 32; i++) sk[i] = seed[i];
crypto_sign_keypair(pk, sk, true);
return {publicKey: pk, secretKey: sk};
};
nacl.sign.publicKeyLength = crypto_sign_PUBLICKEYBYTES;
nacl.sign.secretKeyLength = crypto_sign_SECRETKEYBYTES;
nacl.sign.seedLength = crypto_sign_SEEDBYTES;
nacl.sign.signatureLength = crypto_sign_BYTES;
nacl.hash = function(msg) {
checkArrayTypes(msg);
var h = new Uint8Array(crypto_hash_BYTES);
crypto_hash(h, msg, msg.length);
return h;
};
nacl.hash.hashLength = crypto_hash_BYTES;
nacl.verify = function(x, y) {
checkArrayTypes(x, y);
// Zero length arguments are considered not equal.
if (x.length === 0 || y.length === 0) return false;
if (x.length !== y.length) return false;
return (vn(x, 0, y, 0, x.length) === 0) ? true : false;
};
nacl.setPRNG = function(fn) {
randombytes = fn;
};
(function() {
// Initialize PRNG if environment provides CSPRNG.
// If not, methods calling randombytes will throw.
var crypto;
if (typeof window !== 'undefined') {
// Browser.
if (window.crypto && window.crypto.getRandomValues) {
crypto = window.crypto; // Standard
} else if (window.msCrypto && window.msCrypto.getRandomValues) {
crypto = window.msCrypto; // Internet Explorer 11+
}
if (crypto) {
nacl.setPRNG(function(x, n) {
var i, v = new Uint8Array(n);
crypto.getRandomValues(v);
for (i = 0; i < n; i++) x[i] = v[i];
});
}
} else if (typeof require !== 'undefined') {
// Node.js.
crypto = require('crypto');
if (crypto) {
nacl.setPRNG(function(x, n) {
var i, v = crypto.randomBytes(n);
for (i = 0; i < n; i++) x[i] = v[i];
});
}
}
})();
})(typeof module !== 'undefined' && module.exports ? module.exports : (window.nacl = window.nacl || {}));
}).call(this,require("buffer").Buffer)
},{"buffer":80,"crypto":86}],201:[function(require,module,exports){
(function (Buffer){
(function(nacl) {
'use strict';
// Ported in 2014 by Dmitry Chestnykh and Devi Mandiri.
// Public domain.
//
// Implementation derived from TweetNaCl version 20140427.
// See for details: http://tweetnacl.cr.yp.to/
/* jshint newcap: false */
var u64 = function (h, l) { this.hi = h|0 >>> 0; this.lo = l|0 >>> 0; };
var gf = function(init) {
var i, r = new Float64Array(16);
if (init) for (i = 0; i < init.length; i++) r[i] = init[i];
return r;
};
// Pluggable, initialized in high-level API below.
var randombytes = function(/* x, n */) { throw new Error('no PRNG'); };
var _0 = new Uint8Array(16);
var _9 = new Uint8Array(32); _9[0] = 9;
var gf0 = gf(),
gf1 = gf([1]),
_121665 = gf([0xdb41, 1]),
D = gf([0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070, 0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]),
D2 = gf([0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0, 0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]),
X = gf([0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c, 0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]),
Y = gf([0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]),
I = gf([0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43, 0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);
function L32(x, c) { return (x << c) | (x >>> (32 - c)); }
function ld32(x, i) {
var u = x[i+3] & 0xff;
u = (u<<8)|(x[i+2] & 0xff);
u = (u<<8)|(x[i+1] & 0xff);
return (u<<8)|(x[i+0] & 0xff);
}
function dl64(x, i) {
var h = (x[i] << 24) | (x[i+1] << 16) | (x[i+2] << 8) | x[i+3];
var l = (x[i+4] << 24) | (x[i+5] << 16) | (x[i+6] << 8) | x[i+7];
return new u64(h, l);
}
function st32(x, j, u) {
var i;
for (i = 0; i < 4; i++) { x[j+i] = u & 255; u >>>= 8; }
}
function ts64(x, i, u) {
x[i] = (u.hi >> 24) & 0xff;
x[i+1] = (u.hi >> 16) & 0xff;
x[i+2] = (u.hi >> 8) & 0xff;
x[i+3] = u.hi & 0xff;
x[i+4] = (u.lo >> 24) & 0xff;
x[i+5] = (u.lo >> 16) & 0xff;
x[i+6] = (u.lo >> 8) & 0xff;
x[i+7] = u.lo & 0xff;
}
function vn(x, xi, y, yi, n) {
var i,d = 0;
for (i = 0; i < n; i++) d |= x[xi+i]^y[yi+i];
return (1 & ((d - 1) >>> 8)) - 1;
}
function crypto_verify_16(x, xi, y, yi) {
return vn(x,xi,y,yi,16);
}
function crypto_verify_32(x, xi, y, yi) {
return vn(x,xi,y,yi,32);
}
function core(out,inp,k,c,h) {
var w = new Uint32Array(16), x = new Uint32Array(16),
y = new Uint32Array(16), t = new Uint32Array(4);
var i, j, m;
for (i = 0; i < 4; i++) {
x[5*i] = ld32(c, 4*i);
x[1+i] = ld32(k, 4*i);
x[6+i] = ld32(inp, 4*i);
x[11+i] = ld32(k, 16+4*i);
}
for (i = 0; i < 16; i++) y[i] = x[i];
for (i = 0; i < 20; i++) {
for (j = 0; j < 4; j++) {
for (m = 0; m < 4; m++) t[m] = x[(5*j+4*m)%16];
t[1] ^= L32((t[0]+t[3])|0, 7);
t[2] ^= L32((t[1]+t[0])|0, 9);
t[3] ^= L32((t[2]+t[1])|0,13);
t[0] ^= L32((t[3]+t[2])|0,18);
for (m = 0; m < 4; m++) w[4*j+(j+m)%4] = t[m];
}
for (m = 0; m < 16; m++) x[m] = w[m];
}
if (h) {
for (i = 0; i < 16; i++) x[i] = (x[i] + y[i]) | 0;
for (i = 0; i < 4; i++) {
x[5*i] = (x[5*i] - ld32(c, 4*i)) | 0;
x[6+i] = (x[6+i] - ld32(inp, 4*i)) | 0;
}
for (i = 0; i < 4; i++) {
st32(out,4*i,x[5*i]);
st32(out,16+4*i,x[6+i]);
}
} else {
for (i = 0; i < 16; i++) st32(out, 4 * i, (x[i] + y[i]) | 0);
}
}
function crypto_core_salsa20(out,inp,k,c) {
core(out,inp,k,c,false);
return 0;
}
function crypto_core_hsalsa20(out,inp,k,c) {
core(out,inp,k,c,true);
return 0;
}
var sigma = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
// "expand 32-byte k"
function crypto_stream_salsa20_xor(c,cpos,m,mpos,b,n,k) {
var z = new Uint8Array(16), x = new Uint8Array(64);
var u, i;
if (!b) return 0;
for (i = 0; i < 16; i++) z[i] = 0;
for (i = 0; i < 8; i++) z[i] = n[i];
while (b >= 64) {
crypto_core_salsa20(x,z,k,sigma);
for (i = 0; i < 64; i++) c[cpos+i] = (m?m[mpos+i]:0) ^ x[i];
u = 1;
for (i = 8; i < 16; i++) {
u = u + (z[i] & 0xff) | 0;
z[i] = u & 0xff;
u >>>= 8;
}
b -= 64;
cpos += 64;
if (m) mpos += 64;
}
if (b > 0) {
crypto_core_salsa20(x,z,k,sigma);
for (i = 0; i < b; i++) c[cpos+i] = (m?m[mpos+i]:0) ^ x[i];
}
return 0;
}
function crypto_stream_salsa20(c,cpos,d,n,k) {
return crypto_stream_salsa20_xor(c,cpos,null,0,d,n,k);
}
function crypto_stream(c,cpos,d,n,k) {
var s = new Uint8Array(32);
crypto_core_hsalsa20(s,n,k,sigma);
return crypto_stream_salsa20(c,cpos,d,n.subarray(16),s);
}
function crypto_stream_xor(c,cpos,m,mpos,d,n,k) {
var s = new Uint8Array(32);
crypto_core_hsalsa20(s,n,k,sigma);
return crypto_stream_salsa20_xor(c,cpos,m,mpos,d,n.subarray(16),s);
}
function add1305(h, c) {
var j, u = 0;
for (j = 0; j < 17; j++) {
u = (u + ((h[j] + c[j]) | 0)) | 0;
h[j] = u & 255;
u >>>= 8;
}
}
var minusp = new Uint32Array([
5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 252
]);
function crypto_onetimeauth(out, outpos, m, mpos, n, k) {
var s, i, j, u;
var x = new Uint32Array(17), r = new Uint32Array(17),
h = new Uint32Array(17), c = new Uint32Array(17),
g = new Uint32Array(17);
for (j = 0; j < 17; j++) r[j]=h[j]=0;
for (j = 0; j < 16; j++) r[j]=k[j];
r[3]&=15;
r[4]&=252;
r[7]&=15;
r[8]&=252;
r[11]&=15;
r[12]&=252;
r[15]&=15;
while (n > 0) {
for (j = 0; j < 17; j++) c[j] = 0;
for (j = 0;(j < 16) && (j < n);++j) c[j] = m[mpos+j];
c[j] = 1;
mpos += j; n -= j;
add1305(h,c);
for (i = 0; i < 17; i++) {
x[i] = 0;
for (j = 0; j < 17; j++) x[i] = (x[i] + (h[j] * ((j <= i) ? r[i - j] : ((320 * r[i + 17 - j])|0))) | 0) | 0;
}
for (i = 0; i < 17; i++) h[i] = x[i];
u = 0;
for (j = 0; j < 16; j++) {
u = (u + h[j]) | 0;
h[j] = u & 255;
u >>>= 8;
}
u = (u + h[16]) | 0; h[16] = u & 3;
u = (5 * (u >>> 2)) | 0;
for (j = 0; j < 16; j++) {
u = (u + h[j]) | 0;
h[j] = u & 255;
u >>>= 8;
}
u = (u + h[16]) | 0; h[16] = u;
}
for (j = 0; j < 17; j++) g[j] = h[j];
add1305(h,minusp);
s = (-(h[16] >>> 7) | 0);
for (j = 0; j < 17; j++) h[j] ^= s & (g[j] ^ h[j]);
for (j = 0; j < 16; j++) c[j] = k[j + 16];
c[16] = 0;
add1305(h,c);
for (j = 0; j < 16; j++) out[outpos+j] = h[j];
return 0;
}
function crypto_onetimeauth_verify(h, hpos, m, mpos, n, k) {
var x = new Uint8Array(16);
crypto_onetimeauth(x,0,m,mpos,n,k);
return crypto_verify_16(h,hpos,x,0);
}
function crypto_secretbox(c,m,d,n,k) {
var i;
if (d < 32) return -1;
crypto_stream_xor(c,0,m,0,d,n,k);
crypto_onetimeauth(c, 16, c, 32, d - 32, c);
for (i = 0; i < 16; i++) c[i] = 0;
return 0;
}
function crypto_secretbox_open(m,c,d,n,k) {
var i;
var x = new Uint8Array(32);
if (d < 32) return -1;
crypto_stream(x,0,32,n,k);
if (crypto_onetimeauth_verify(c, 16,c, 32,d - 32,x) !== 0) return -1;
crypto_stream_xor(m,0,c,0,d,n,k);
for (i = 0; i < 32; i++) m[i] = 0;
return 0;
}
function set25519(r, a) {
var i;
for (i = 0; i < 16; i++) r[i] = a[i]|0;
}
function car25519(o) {
var c;
var i;
for (i = 0; i < 16; i++) {
o[i] += 65536;
c = Math.floor(o[i] / 65536);
o[(i+1)*(i<15?1:0)] += c - 1 + 37 * (c-1) * (i===15?1:0);
o[i] -= (c * 65536);
}
}
function sel25519(p, q, b) {
var t, c = ~(b-1);
for (var i = 0; i < 16; i++) {
t = c & (p[i] ^ q[i]);
p[i] ^= t;
q[i] ^= t;
}
}
function pack25519(o, n) {
var i, j, b;
var m = gf(), t = gf();
for (i = 0; i < 16; i++) t[i] = n[i];
car25519(t);
car25519(t);
car25519(t);
for (j = 0; j < 2; j++) {
m[0] = t[0] - 0xffed;
for (i = 1; i < 15; i++) {
m[i] = t[i] - 0xffff - ((m[i-1]>>16) & 1);
m[i-1] &= 0xffff;
}
m[15] = t[15] - 0x7fff - ((m[14]>>16) & 1);
b = (m[15]>>16) & 1;
m[14] &= 0xffff;
sel25519(t, m, 1-b);
}
for (i = 0; i < 16; i++) {
o[2*i] = t[i] & 0xff;
o[2*i+1] = t[i]>>8;
}
}
function neq25519(a, b) {
var c = new Uint8Array(32), d = new Uint8Array(32);
pack25519(c, a);
pack25519(d, b);
return crypto_verify_32(c, 0, d, 0);
}
function par25519(a) {
var d = new Uint8Array(32);
pack25519(d, a);
return d[0] & 1;
}
function unpack25519(o, n) {
var i;
for (i = 0; i < 16; i++) o[i] = n[2*i] + (n[2*i+1] << 8);
o[15] &= 0x7fff;
}
function A(o, a, b) {
var i;
for (i = 0; i < 16; i++) o[i] = (a[i] + b[i])|0;
}
function Z(o, a, b) {
var i;
for (i = 0; i < 16; i++) o[i] = (a[i] - b[i])|0;
}
function M(o, a, b) {
var i, j, t = new Float64Array(31);
for (i = 0; i < 31; i++) t[i] = 0;
for (i = 0; i < 16; i++) {
for (j = 0; j < 16; j++) {
t[i+j] += a[i] * b[j];
}
}
for (i = 0; i < 15; i++) {
t[i] += 38 * t[i+16];
}
for (i = 0; i < 16; i++) o[i] = t[i];
car25519(o);
car25519(o);
}
function S(o, a) {
M(o, a, a);
}
function inv25519(o, i) {
var c = gf();
var a;
for (a = 0; a < 16; a++) c[a] = i[a];
for (a = 253; a >= 0; a--) {
S(c, c);
if(a !== 2 && a !== 4) M(c, c, i);
}
for (a = 0; a < 16; a++) o[a] = c[a];
}
function pow2523(o, i) {
var c = gf();
var a;
for (a = 0; a < 16; a++) c[a] = i[a];
for (a = 250; a >= 0; a--) {
S(c, c);
if(a !== 1) M(c, c, i);
}
for (a = 0; a < 16; a++) o[a] = c[a];
}
function crypto_scalarmult(q, n, p) {
var z = new Uint8Array(32);
var x = new Float64Array(80), r, i;
var a = gf(), b = gf(), c = gf(),
d = gf(), e = gf(), f = gf();
for (i = 0; i < 31; i++) z[i] = n[i];
z[31]=(n[31]&127)|64;
z[0]&=248;
unpack25519(x,p);
for (i = 0; i < 16; i++) {
b[i]=x[i];
d[i]=a[i]=c[i]=0;
}
a[0]=d[0]=1;
for (i=254;i>=0;--i) {
r=(z[i>>>3]>>>(i&7))&1;
sel25519(a,b,r);
sel25519(c,d,r);
A(e,a,c);
Z(a,a,c);
A(c,b,d);
Z(b,b,d);
S(d,e);
S(f,a);
M(a,c,a);
M(c,b,e);
A(e,a,c);
Z(a,a,c);
S(b,a);
Z(c,d,f);
M(a,c,_121665);
A(a,a,d);
M(c,c,a);
M(a,d,f);
M(d,b,x);
S(b,e);
sel25519(a,b,r);
sel25519(c,d,r);
}
for (i = 0; i < 16; i++) {
x[i+16]=a[i];
x[i+32]=c[i];
x[i+48]=b[i];
x[i+64]=d[i];
}
var x32 = x.subarray(32);
var x16 = x.subarray(16);
inv25519(x32,x32);
M(x16,x16,x32);
pack25519(q,x16);
return 0;
}
function crypto_scalarmult_base(q, n) {
return crypto_scalarmult(q, n, _9);
}
function crypto_box_keypair(y, x) {
randombytes(x, 32);
return crypto_scalarmult_base(y, x);
}
function crypto_box_beforenm(k, y, x) {
var s = new Uint8Array(32);
crypto_scalarmult(s, x, y);
return crypto_core_hsalsa20(k, _0, s, sigma);
}
var crypto_box_afternm = crypto_secretbox;
var crypto_box_open_afternm = crypto_secretbox_open;
function crypto_box(c, m, d, n, y, x) {
var k = new Uint8Array(32);
crypto_box_beforenm(k, y, x);
return crypto_box_afternm(c, m, d, n, k);
}
function crypto_box_open(m, c, d, n, y, x) {
var k = new Uint8Array(32);
crypto_box_beforenm(k, y, x);
return crypto_box_open_afternm(m, c, d, n, k);
}
function add64() {
var a = 0, b = 0, c = 0, d = 0, m16 = 65535, l, h, i;
for (i = 0; i < arguments.length; i++) {
l = arguments[i].lo;
h = arguments[i].hi;
a += (l & m16); b += (l >>> 16);
c += (h & m16); d += (h >>> 16);
}
b += (a >>> 16);
c += (b >>> 16);
d += (c >>> 16);
return new u64((c & m16) | (d << 16), (a & m16) | (b << 16));
}
function shr64(x, c) {
return new u64((x.hi >>> c), (x.lo >>> c) | (x.hi << (32 - c)));
}
function xor64() {
var l = 0, h = 0, i;
for (i = 0; i < arguments.length; i++) {
l ^= arguments[i].lo;
h ^= arguments[i].hi;
}
return new u64(h, l);
}
function R(x, c) {
var h, l, c1 = 32 - c;
if (c < 32) {
h = (x.hi >>> c) | (x.lo << c1);
l = (x.lo >>> c) | (x.hi << c1);
} else if (c < 64) {
h = (x.lo >>> c) | (x.hi << c1);
l = (x.hi >>> c) | (x.lo << c1);
}
return new u64(h, l);
}
function Ch(x, y, z) {
var h = (x.hi & y.hi) ^ (~x.hi & z.hi),
l = (x.lo & y.lo) ^ (~x.lo & z.lo);
return new u64(h, l);
}
function Maj(x, y, z) {
var h = (x.hi & y.hi) ^ (x.hi & z.hi) ^ (y.hi & z.hi),
l = (x.lo & y.lo) ^ (x.lo & z.lo) ^ (y.lo & z.lo);
return new u64(h, l);
}
function Sigma0(x) { return xor64(R(x,28), R(x,34), R(x,39)); }
function Sigma1(x) { return xor64(R(x,14), R(x,18), R(x,41)); }
function sigma0(x) { return xor64(R(x, 1), R(x, 8), shr64(x,7)); }
function sigma1(x) { return xor64(R(x,19), R(x,61), shr64(x,6)); }
var K = [
new u64(0x428a2f98, 0xd728ae22), new u64(0x71374491, 0x23ef65cd),
new u64(0xb5c0fbcf, 0xec4d3b2f), new u64(0xe9b5dba5, 0x8189dbbc),
new u64(0x3956c25b, 0xf348b538), new u64(0x59f111f1, 0xb605d019),
new u64(0x923f82a4, 0xaf194f9b), new u64(0xab1c5ed5, 0xda6d8118),
new u64(0xd807aa98, 0xa3030242), new u64(0x12835b01, 0x45706fbe),
new u64(0x243185be, 0x4ee4b28c), new u64(0x550c7dc3, 0xd5ffb4e2),
new u64(0x72be5d74, 0xf27b896f), new u64(0x80deb1fe, 0x3b1696b1),
new u64(0x9bdc06a7, 0x25c71235), new u64(0xc19bf174, 0xcf692694),
new u64(0xe49b69c1, 0x9ef14ad2), new u64(0xefbe4786, 0x384f25e3),
new u64(0x0fc19dc6, 0x8b8cd5b5), new u64(0x240ca1cc, 0x77ac9c65),
new u64(0x2de92c6f, 0x592b0275), new u64(0x4a7484aa, 0x6ea6e483),
new u64(0x5cb0a9dc, 0xbd41fbd4), new u64(0x76f988da, 0x831153b5),
new u64(0x983e5152, 0xee66dfab), new u64(0xa831c66d, 0x2db43210),
new u64(0xb00327c8, 0x98fb213f), new u64(0xbf597fc7, 0xbeef0ee4),
new u64(0xc6e00bf3, 0x3da88fc2), new u64(0xd5a79147, 0x930aa725),
new u64(0x06ca6351, 0xe003826f), new u64(0x14292967, 0x0a0e6e70),
new u64(0x27b70a85, 0x46d22ffc), new u64(0x2e1b2138, 0x5c26c926),
new u64(0x4d2c6dfc, 0x5ac42aed), new u64(0x53380d13, 0x9d95b3df),
new u64(0x650a7354, 0x8baf63de), new u64(0x766a0abb, 0x3c77b2a8),
new u64(0x81c2c92e, 0x47edaee6), new u64(0x92722c85, 0x1482353b),
new u64(0xa2bfe8a1, 0x4cf10364), new u64(0xa81a664b, 0xbc423001),
new u64(0xc24b8b70, 0xd0f89791), new u64(0xc76c51a3, 0x0654be30),
new u64(0xd192e819, 0xd6ef5218), new u64(0xd6990624, 0x5565a910),
new u64(0xf40e3585, 0x5771202a), new u64(0x106aa070, 0x32bbd1b8),
new u64(0x19a4c116, 0xb8d2d0c8), new u64(0x1e376c08, 0x5141ab53),
new u64(0x2748774c, 0xdf8eeb99), new u64(0x34b0bcb5, 0xe19b48a8),
new u64(0x391c0cb3, 0xc5c95a63), new u64(0x4ed8aa4a, 0xe3418acb),
new u64(0x5b9cca4f, 0x7763e373), new u64(0x682e6ff3, 0xd6b2b8a3),
new u64(0x748f82ee, 0x5defb2fc), new u64(0x78a5636f, 0x43172f60),
new u64(0x84c87814, 0xa1f0ab72), new u64(0x8cc70208, 0x1a6439ec),
new u64(0x90befffa, 0x23631e28), new u64(0xa4506ceb, 0xde82bde9),
new u64(0xbef9a3f7, 0xb2c67915), new u64(0xc67178f2, 0xe372532b),
new u64(0xca273ece, 0xea26619c), new u64(0xd186b8c7, 0x21c0c207),
new u64(0xeada7dd6, 0xcde0eb1e), new u64(0xf57d4f7f, 0xee6ed178),
new u64(0x06f067aa, 0x72176fba), new u64(0x0a637dc5, 0xa2c898a6),
new u64(0x113f9804, 0xbef90dae), new u64(0x1b710b35, 0x131c471b),
new u64(0x28db77f5, 0x23047d84), new u64(0x32caab7b, 0x40c72493),
new u64(0x3c9ebe0a, 0x15c9bebc), new u64(0x431d67c4, 0x9c100d4c),
new u64(0x4cc5d4be, 0xcb3e42b6), new u64(0x597f299c, 0xfc657e2a),
new u64(0x5fcb6fab, 0x3ad6faec), new u64(0x6c44198c, 0x4a475817)
];
function crypto_hashblocks(x, m, n) {
var z = [], b = [], a = [], w = [], t, i, j;
for (i = 0; i < 8; i++) z[i] = a[i] = dl64(x, 8*i);
var pos = 0;
while (n >= 128) {
for (i = 0; i < 16; i++) w[i] = dl64(m, 8*i+pos);
for (i = 0; i < 80; i++) {
for (j = 0; j < 8; j++) b[j] = a[j];
t = add64(a[7], Sigma1(a[4]), Ch(a[4], a[5], a[6]), K[i], w[i%16]);
b[7] = add64(t, Sigma0(a[0]), Maj(a[0], a[1], a[2]));
b[3] = add64(b[3], t);
for (j = 0; j < 8; j++) a[(j+1)%8] = b[j];
if (i%16 === 15) {
for (j = 0; j < 16; j++) {
w[j] = add64(w[j], w[(j+9)%16], sigma0(w[(j+1)%16]), sigma1(w[(j+14)%16]));
}
}
}
for (i = 0; i < 8; i++) {
a[i] = add64(a[i], z[i]);
z[i] = a[i];
}
pos += 128;
n -= 128;
}
for (i = 0; i < 8; i++) ts64(x, 8*i, z[i]);
return n;
}
var iv = new Uint8Array([
0x6a,0x09,0xe6,0x67,0xf3,0xbc,0xc9,0x08,
0xbb,0x67,0xae,0x85,0x84,0xca,0xa7,0x3b,
0x3c,0x6e,0xf3,0x72,0xfe,0x94,0xf8,0x2b,
0xa5,0x4f,0xf5,0x3a,0x5f,0x1d,0x36,0xf1,
0x51,0x0e,0x52,0x7f,0xad,0xe6,0x82,0xd1,
0x9b,0x05,0x68,0x8c,0x2b,0x3e,0x6c,0x1f,
0x1f,0x83,0xd9,0xab,0xfb,0x41,0xbd,0x6b,
0x5b,0xe0,0xcd,0x19,0x13,0x7e,0x21,0x79
]);
function crypto_hash(out, m, n) {
var h = new Uint8Array(64), x = new Uint8Array(256);
var i, b = n;
for (i = 0; i < 64; i++) h[i] = iv[i];
crypto_hashblocks(h, m, n);
n %= 128;
for (i = 0; i < 256; i++) x[i] = 0;
for (i = 0; i < n; i++) x[i] = m[b-n+i];
x[n] = 128;
n = 256-128*(n<112?1:0);
x[n-9] = 0;
ts64(x, n-8, new u64((b / 0x20000000) | 0, b << 3));
crypto_hashblocks(h, x, n);
for (i = 0; i < 64; i++) out[i] = h[i];
return 0;
}
function add(p, q) {
var a = gf(), b = gf(), c = gf(),
d = gf(), e = gf(), f = gf(),
g = gf(), h = gf(), t = gf();
Z(a, p[1], p[0]);
Z(t, q[1], q[0]);
M(a, a, t);
A(b, p[0], p[1]);
A(t, q[0], q[1]);
M(b, b, t);
M(c, p[3], q[3]);
M(c, c, D2);
M(d, p[2], q[2]);
A(d, d, d);
Z(e, b, a);
Z(f, d, c);
A(g, d, c);
A(h, b, a);
M(p[0], e, f);
M(p[1], h, g);
M(p[2], g, f);
M(p[3], e, h);
}
function cswap(p, q, b) {
var i;
for (i = 0; i < 4; i++) {
sel25519(p[i], q[i], b);
}
}
function pack(r, p) {
var tx = gf(), ty = gf(), zi = gf();
inv25519(zi, p[2]);
M(tx, p[0], zi);
M(ty, p[1], zi);
pack25519(r, ty);
r[31] ^= par25519(tx) << 7;
}
function scalarmult(p, q, s) {
var b, i;
set25519(p[0], gf0);
set25519(p[1], gf1);
set25519(p[2], gf1);
set25519(p[3], gf0);
for (i = 255; i >= 0; --i) {
b = (s[(i/8)|0] >> (i&7)) & 1;
cswap(p, q, b);
add(q, p);
add(p, p);
cswap(p, q, b);
}
}
function scalarbase(p, s) {
var q = [gf(), gf(), gf(), gf()];
set25519(q[0], X);
set25519(q[1], Y);
set25519(q[2], gf1);
M(q[3], X, Y);
scalarmult(p, q, s);
}
function crypto_sign_keypair(pk, sk, seeded) {
var d = new Uint8Array(64);
var p = [gf(), gf(), gf(), gf()];
var i;
if (!seeded) randombytes(sk, 32);
crypto_hash(d, sk, 32);
d[0] &= 248;
d[31] &= 127;
d[31] |= 64;
scalarbase(p, d);
pack(pk, p);
for (i = 0; i < 32; i++) sk[i+32] = pk[i];
return 0;
}
var L = new Float64Array([0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58, 0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x10]);
function modL(r, x) {
var carry, i, j, k;
for (i = 63; i >= 32; --i) {
carry = 0;
for (j = i - 32, k = i - 12; j < k; ++j) {
x[j] += carry - 16 * x[i] * L[j - (i - 32)];
carry = (x[j] + 128) >> 8;
x[j] -= carry * 256;
}
x[j] += carry;
x[i] = 0;
}
carry = 0;
for (j = 0; j < 32; j++) {
x[j] += carry - (x[31] >> 4) * L[j];
carry = x[j] >> 8;
x[j] &= 255;
}
for (j = 0; j < 32; j++) x[j] -= carry * L[j];
for (i = 0; i < 32; i++) {
x[i+1] += x[i] >> 8;
r[i] = x[i] & 255;
}
}
function reduce(r) {
var x = new Float64Array(64), i;
for (i = 0; i < 64; i++) x[i] = r[i];
for (i = 0; i < 64; i++) r[i] = 0;
modL(r, x);
}
// Note: difference from C - smlen returned, not passed as argument.
function crypto_sign(sm, m, n, sk) {
var d = new Uint8Array(64), h = new Uint8Array(64), r = new Uint8Array(64);
var i, j, x = new Float64Array(64);
var p = [gf(), gf(), gf(), gf()];
crypto_hash(d, sk, 32);
d[0] &= 248;
d[31] &= 127;
d[31] |= 64;
var smlen = n + 64;
for (i = 0; i < n; i++) sm[64 + i] = m[i];
for (i = 0; i < 32; i++) sm[32 + i] = d[32 + i];
crypto_hash(r, sm.subarray(32), n+32);
reduce(r);
scalarbase(p, r);
pack(sm, p);
for (i = 32; i < 64; i++) sm[i] = sk[i];
crypto_hash(h, sm, n + 64);
reduce(h);
for (i = 0; i < 64; i++) x[i] = 0;
for (i = 0; i < 32; i++) x[i] = r[i];
for (i = 0; i < 32; i++) {
for (j = 0; j < 32; j++) {
x[i+j] += h[i] * d[j];
}
}
modL(sm.subarray(32), x);
return smlen;
}
function unpackneg(r, p) {
var t = gf(), chk = gf(), num = gf(),
den = gf(), den2 = gf(), den4 = gf(),
den6 = gf();
set25519(r[2], gf1);
unpack25519(r[1], p);
S(num, r[1]);
M(den, num, D);
Z(num, num, r[2]);
A(den, r[2], den);
S(den2, den);
S(den4, den2);
M(den6, den4, den2);
M(t, den6, num);
M(t, t, den);
pow2523(t, t);
M(t, t, num);
M(t, t, den);
M(t, t, den);
M(r[0], t, den);
S(chk, r[0]);
M(chk, chk, den);
if (neq25519(chk, num)) M(r[0], r[0], I);
S(chk, r[0]);
M(chk, chk, den);
if (neq25519(chk, num)) return -1;
if (par25519(r[0]) === (p[31]>>7)) Z(r[0], gf0, r[0]);
M(r[3], r[0], r[1]);
return 0;
}
function crypto_sign_open(m, sm, n, pk) {
var i, mlen;
var t = new Uint8Array(32), h = new Uint8Array(64);
var p = [gf(), gf(), gf(), gf()],
q = [gf(), gf(), gf(), gf()];
mlen = -1;
if (n < 64) return -1;
if (unpackneg(q, pk)) return -1;
for (i = 0; i < n; i++) m[i] = sm[i];
for (i = 0; i < 32; i++) m[i+32] = pk[i];
crypto_hash(h, m, n);
reduce(h);
scalarmult(p, q, h);
scalarbase(q, sm.subarray(32));
add(p, q);
pack(t, p);
n -= 64;
if (crypto_verify_32(sm, 0, t, 0)) {
for (i = 0; i < n; i++) m[i] = 0;
return -1;
}
for (i = 0; i < n; i++) m[i] = sm[i + 64];
mlen = n;
return mlen;
}
var crypto_secretbox_KEYBYTES = 32,
crypto_secretbox_NONCEBYTES = 24,
crypto_secretbox_ZEROBYTES = 32,
crypto_secretbox_BOXZEROBYTES = 16,
crypto_scalarmult_BYTES = 32,
crypto_scalarmult_SCALARBYTES = 32,
crypto_box_PUBLICKEYBYTES = 32,
crypto_box_SECRETKEYBYTES = 32,
crypto_box_BEFORENMBYTES = 32,
crypto_box_NONCEBYTES = crypto_secretbox_NONCEBYTES,
crypto_box_ZEROBYTES = crypto_secretbox_ZEROBYTES,
crypto_box_BOXZEROBYTES = crypto_secretbox_BOXZEROBYTES,
crypto_sign_BYTES = 64,
crypto_sign_PUBLICKEYBYTES = 32,
crypto_sign_SECRETKEYBYTES = 64,
crypto_sign_SEEDBYTES = 32,
crypto_hash_BYTES = 64;
nacl.lowlevel = {
crypto_core_hsalsa20: crypto_core_hsalsa20,
crypto_stream_xor : crypto_stream_xor,
crypto_stream : crypto_stream,
crypto_stream_salsa20_xor : crypto_stream_salsa20_xor,
crypto_stream_salsa20 : crypto_stream_salsa20,
crypto_onetimeauth : crypto_onetimeauth,
crypto_onetimeauth_verify : crypto_onetimeauth_verify,
crypto_verify_16 : crypto_verify_16,
crypto_verify_32 : crypto_verify_32,
crypto_secretbox : crypto_secretbox,
crypto_secretbox_open : crypto_secretbox_open,
crypto_scalarmult : crypto_scalarmult,
crypto_scalarmult_base : crypto_scalarmult_base,
crypto_box_beforenm : crypto_box_beforenm,
crypto_box_afternm : crypto_box_afternm,
crypto_box : crypto_box,
crypto_box_open : crypto_box_open,
crypto_box_keypair : crypto_box_keypair,
crypto_hash : crypto_hash,
crypto_sign : crypto_sign,
crypto_sign_keypair : crypto_sign_keypair,
crypto_sign_open : crypto_sign_open,
crypto_secretbox_KEYBYTES : crypto_secretbox_KEYBYTES,
crypto_secretbox_NONCEBYTES : crypto_secretbox_NONCEBYTES,
crypto_secretbox_ZEROBYTES : crypto_secretbox_ZEROBYTES,
crypto_secretbox_BOXZEROBYTES : crypto_secretbox_BOXZEROBYTES,
crypto_scalarmult_BYTES : crypto_scalarmult_BYTES,
crypto_scalarmult_SCALARBYTES : crypto_scalarmult_SCALARBYTES,
crypto_box_PUBLICKEYBYTES : crypto_box_PUBLICKEYBYTES,
crypto_box_SECRETKEYBYTES : crypto_box_SECRETKEYBYTES,
crypto_box_BEFORENMBYTES : crypto_box_BEFORENMBYTES,
crypto_box_NONCEBYTES : crypto_box_NONCEBYTES,
crypto_box_ZEROBYTES : crypto_box_ZEROBYTES,
crypto_box_BOXZEROBYTES : crypto_box_BOXZEROBYTES,
crypto_sign_BYTES : crypto_sign_BYTES,
crypto_sign_PUBLICKEYBYTES : crypto_sign_PUBLICKEYBYTES,
crypto_sign_SECRETKEYBYTES : crypto_sign_SECRETKEYBYTES,
crypto_sign_SEEDBYTES: crypto_sign_SEEDBYTES,
crypto_hash_BYTES : crypto_hash_BYTES
};
/* High-level API */
function checkLengths(k, n) {
if (k.length !== crypto_secretbox_KEYBYTES) throw new Error('bad key size');
if (n.length !== crypto_secretbox_NONCEBYTES) throw new Error('bad nonce size');
}
function checkBoxLengths(pk, sk) {
if (pk.length !== crypto_box_PUBLICKEYBYTES) throw new Error('bad public key size');
if (sk.length !== crypto_box_SECRETKEYBYTES) throw new Error('bad secret key size');
}
function checkArrayTypes() {
var type = {}.toString, t;
for (var i = 0; i < arguments.length; i++) {
if ((t = type.call(arguments[i])) !== '[object Uint8Array]')
throw new TypeError('unexpected type ' + t + ', use Uint8Array');
}
}
nacl.util = {};
nacl.util.decodeUTF8 = function(s) {
var i, d = unescape(encodeURIComponent(s)), b = new Uint8Array(d.length);
for (i = 0; i < d.length; i++) b[i] = d.charCodeAt(i);
return b;
};
nacl.util.encodeUTF8 = function(arr) {
var i, s = [];
for (i = 0; i < arr.length; i++) s.push(String.fromCharCode(arr[i]));
return decodeURIComponent(escape(s.join('')));
};
nacl.util.encodeBase64 = function(arr) {
if (typeof btoa === 'undefined') {
return (new Buffer(arr)).toString('base64');
} else {
var i, s = [], len = arr.length;
for (i = 0; i < len; i++) s.push(String.fromCharCode(arr[i]));
return btoa(s.join(''));
}
};
nacl.util.decodeBase64 = function(s) {
if (typeof atob === 'undefined') {
return new Uint8Array(Array.prototype.slice.call(new Buffer(s, 'base64'), 0));
} else {
var i, d = atob(s), b = new Uint8Array(d.length);
for (i = 0; i < d.length; i++) b[i] = d.charCodeAt(i);
return b;
}
};
nacl.randomBytes = function(n) {
var b = new Uint8Array(n);
randombytes(b, n);
return b;
};
nacl.secretbox = function(msg, nonce, key) {
checkArrayTypes(msg, nonce, key);
checkLengths(key, nonce);
var m = new Uint8Array(crypto_secretbox_ZEROBYTES + msg.length);
var c = new Uint8Array(m.length);
for (var i = 0; i < msg.length; i++) m[i+crypto_secretbox_ZEROBYTES] = msg[i];
crypto_secretbox(c, m, m.length, nonce, key);
return c.subarray(crypto_secretbox_BOXZEROBYTES);
};
nacl.secretbox.open = function(box, nonce, key) {
checkArrayTypes(box, nonce, key);
checkLengths(key, nonce);
var c = new Uint8Array(crypto_secretbox_BOXZEROBYTES + box.length);
var m = new Uint8Array(c.length);
for (var i = 0; i < box.length; i++) c[i+crypto_secretbox_BOXZEROBYTES] = box[i];
if (c.length < 32) return false;
if (crypto_secretbox_open(m, c, c.length, nonce, key) !== 0) return false;
return m.subarray(crypto_secretbox_ZEROBYTES);
};
nacl.secretbox.keyLength = crypto_secretbox_KEYBYTES;
nacl.secretbox.nonceLength = crypto_secretbox_NONCEBYTES;
nacl.secretbox.overheadLength = crypto_secretbox_BOXZEROBYTES;
nacl.scalarMult = function(n, p) {
checkArrayTypes(n, p);
if (n.length !== crypto_scalarmult_SCALARBYTES) throw new Error('bad n size');
if (p.length !== crypto_scalarmult_BYTES) throw new Error('bad p size');
var q = new Uint8Array(crypto_scalarmult_BYTES);
crypto_scalarmult(q, n, p);
return q;
};
nacl.scalarMult.base = function(n) {
checkArrayTypes(n);
if (n.length !== crypto_scalarmult_SCALARBYTES) throw new Error('bad n size');
var q = new Uint8Array(crypto_scalarmult_BYTES);
crypto_scalarmult_base(q, n);
return q;
};
nacl.scalarMult.scalarLength = crypto_scalarmult_SCALARBYTES;
nacl.scalarMult.groupElementLength = crypto_scalarmult_BYTES;
nacl.box = function(msg, nonce, publicKey, secretKey) {
var k = nacl.box.before(publicKey, secretKey);
return nacl.secretbox(msg, nonce, k);
};
nacl.box.before = function(publicKey, secretKey) {
checkArrayTypes(publicKey, secretKey);
checkBoxLengths(publicKey, secretKey);
var k = new Uint8Array(crypto_box_BEFORENMBYTES);
crypto_box_beforenm(k, publicKey, secretKey);
return k;
};
nacl.box.after = nacl.secretbox;
nacl.box.open = function(msg, nonce, publicKey, secretKey) {
var k = nacl.box.before(publicKey, secretKey);
return nacl.secretbox.open(msg, nonce, k);
};
nacl.box.open.after = nacl.secretbox.open;
nacl.box.keyPair = function() {
var pk = new Uint8Array(crypto_box_PUBLICKEYBYTES);
var sk = new Uint8Array(crypto_box_SECRETKEYBYTES);
crypto_box_keypair(pk, sk);
return {publicKey: pk, secretKey: sk};
};
nacl.box.keyPair.fromSecretKey = function(secretKey) {
checkArrayTypes(secretKey);
if (secretKey.length !== crypto_box_SECRETKEYBYTES)
throw new Error('bad secret key size');
var pk = new Uint8Array(crypto_box_PUBLICKEYBYTES);
crypto_scalarmult_base(pk, secretKey);
return {publicKey: pk, secretKey: new Uint8Array(secretKey)};
};
nacl.box.publicKeyLength = crypto_box_PUBLICKEYBYTES;
nacl.box.secretKeyLength = crypto_box_SECRETKEYBYTES;
nacl.box.sharedKeyLength = crypto_box_BEFORENMBYTES;
nacl.box.nonceLength = crypto_box_NONCEBYTES;
nacl.box.overheadLength = nacl.secretbox.overheadLength;
nacl.sign = function(msg, secretKey) {
checkArrayTypes(msg, secretKey);
if (secretKey.length !== crypto_sign_SECRETKEYBYTES)
throw new Error('bad secret key size');
var signedMsg = new Uint8Array(crypto_sign_BYTES+msg.length);
crypto_sign(signedMsg, msg, msg.length, secretKey);
return signedMsg;
};
nacl.sign.open = function(signedMsg, publicKey) {
if (arguments.length !== 2)
throw new Error('nacl.sign.open accepts 2 arguments; did you mean to use nacl.sign.detached.verify?');
checkArrayTypes(signedMsg, publicKey);
if (publicKey.length !== crypto_sign_PUBLICKEYBYTES)
throw new Error('bad public key size');
var tmp = new Uint8Array(signedMsg.length);
var mlen = crypto_sign_open(tmp, signedMsg, signedMsg.length, publicKey);
if (mlen < 0) return null;
var m = new Uint8Array(mlen);
for (var i = 0; i < m.length; i++) m[i] = tmp[i];
return m;
};
nacl.sign.detached = function(msg, secretKey) {
var signedMsg = nacl.sign(msg, secretKey);
var sig = new Uint8Array(crypto_sign_BYTES);
for (var i = 0; i < sig.length; i++) sig[i] = signedMsg[i];
return sig;
};
nacl.sign.detached.verify = function(msg, sig, publicKey) {
checkArrayTypes(msg, sig, publicKey);
if (sig.length !== crypto_sign_BYTES)
throw new Error('bad signature size');
if (publicKey.length !== crypto_sign_PUBLICKEYBYTES)
throw new Error('bad public key size');
var sm = new Uint8Array(crypto_sign_BYTES + msg.length);
var m = new Uint8Array(crypto_sign_BYTES + msg.length);
var i;
for (i = 0; i < crypto_sign_BYTES; i++) sm[i] = sig[i];
for (i = 0; i < msg.length; i++) sm[i+crypto_sign_BYTES] = msg[i];
return (crypto_sign_open(m, sm, sm.length, publicKey) >= 0);
};
nacl.sign.keyPair = function() {
var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);
var sk = new Uint8Array(crypto_sign_SECRETKEYBYTES);
crypto_sign_keypair(pk, sk);
return {publicKey: pk, secretKey: sk};
};
nacl.sign.keyPair.fromSecretKey = function(secretKey) {
checkArrayTypes(secretKey);
if (secretKey.length !== crypto_sign_SECRETKEYBYTES)
throw new Error('bad secret key size');
var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);
for (var i = 0; i < pk.length; i++) pk[i] = secretKey[32+i];
return {publicKey: pk, secretKey: new Uint8Array(secretKey)};
};
nacl.sign.keyPair.fromSeed = function(seed) {
checkArrayTypes(seed);
if (seed.length !== crypto_sign_SEEDBYTES)
throw new Error('bad seed size');
var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);
var sk = new Uint8Array(crypto_sign_SECRETKEYBYTES);
for (var i = 0; i < 32; i++) sk[i] = seed[i];
crypto_sign_keypair(pk, sk, true);
return {publicKey: pk, secretKey: sk};
};
nacl.sign.publicKeyLength = crypto_sign_PUBLICKEYBYTES;
nacl.sign.secretKeyLength = crypto_sign_SECRETKEYBYTES;
nacl.sign.seedLength = crypto_sign_SEEDBYTES;
nacl.sign.signatureLength = crypto_sign_BYTES;
nacl.hash = function(msg) {
checkArrayTypes(msg);
var h = new Uint8Array(crypto_hash_BYTES);
crypto_hash(h, msg, msg.length);
return h;
};
nacl.hash.hashLength = crypto_hash_BYTES;
nacl.verify = function(x, y) {
checkArrayTypes(x, y);
// Zero length arguments are considered not equal.
if (x.length === 0 || y.length === 0) return false;
if (x.length !== y.length) return false;
return (vn(x, 0, y, 0, x.length) === 0) ? true : false;
};
nacl.setPRNG = function(fn) {
randombytes = fn;
};
(function() {
// Initialize PRNG if environment provides CSPRNG.
// If not, methods calling randombytes will throw.
var crypto;
if (typeof window !== 'undefined') {
// Browser.
if (window.crypto && window.crypto.getRandomValues) {
crypto = window.crypto; // Standard
} else if (window.msCrypto && window.msCrypto.getRandomValues) {
crypto = window.msCrypto; // Internet Explorer 11+
}
if (crypto) {
nacl.setPRNG(function(x, n) {
var i, v = new Uint8Array(n);
crypto.getRandomValues(v);
for (i = 0; i < n; i++) x[i] = v[i];
});
}
} else if (typeof require !== 'undefined') {
// Node.js.
crypto = require('crypto');
if (crypto) {
nacl.setPRNG(function(x, n) {
var i, v = crypto.randomBytes(n);
for (i = 0; i < n; i++) x[i] = v[i];
});
}
}
})();
})(typeof module !== 'undefined' && module.exports ? module.exports : (window.nacl = window.nacl || {}));
}).call(this,require("buffer").Buffer)
},{"buffer":80,"crypto":86}],202:[function(require,module,exports){
module.exports={
"name": "kbpgp",
"description": "Keybase's PGP Implementation",
"keywords": [
"crypto",
"pgp",
"keybase"
],
"author": "Maxwell Krohn",
"version": "2.0.8",
"license": "BSD-3-Clause",
"main": "./lib/main.js",
"directories": {
"lib": "lib/"
},
"homepage": "http://github.com/keybase/kbpgp",
"bugs": "https://github.com/keybase/kbpgp/issues",
"repository": {
"type": "git",
"url": "git://github.com/keybase/kbpgp.git"
},
"dependencies": {
"bn": "^1.0.0",
"deep-equal": ">=0.2.1",
"iced-error": ">=0.0.9",
"iced-runtime": ">=0.0.1",
"keybase-compressjs": "^1.0.1-c",
"keybase-ecurve": "^1.0.0",
"pgp-utils": ">=0.0.28",
"purepack": ">=1.0.1",
"triplesec": ">=3.0.19",
"tweetnacl": "^0.12.2"
},
"devDependencies": {
"browserify": "^5.9.1",
"colors": "0.6.2",
"iced-coffee-script": "1.7.1-c",
"iced-test": ">=0.0.21",
"icsify": "0.6.0",
"minimist": "0.0.8",
"optimist": "0.6.1",
"uglify-js": "^2.4.13"
}
}
},{}]},{},[29])(29)
});