@intlayer/backend 7.0.9-canary.0 → 7.0.9-canary.3

package/dist/cjs/node_modules/node-forge/lib/cipherModes.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"cipherModes.cjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/cipherModes.js"],"sourcesContent":["/**\n * Supported cipher modes.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nforge.cipher = forge.cipher || {};\n\n// supported cipher modes\nvar modes = module.exports = forge.cipher.modes = forge.cipher.modes || {};\n\n/** Electronic codebook (ECB) (Don't use this; it's not secure) **/\n\nmodes.ecb = function(options) {\n  options = options || {};\n  this.name = 'ECB';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = new Array(this._ints);\n  this._outBlock = new Array(this._ints);\n};\n\nmodes.ecb.prototype.start = function(options) {};\n\nmodes.ecb.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = input.getInt32();\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // write output\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i]);\n  }\n};\n\nmodes.ecb.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = input.getInt32();\n  }\n\n  // decrypt block\n  this.cipher.decrypt(this._inBlock, this._outBlock);\n\n  // write output\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i]);\n  }\n};\n\nmodes.ecb.prototype.pad = function(input, options) {\n  // add PKCS#7 padding to block (each pad byte is the\n  // value of the number of pad bytes)\n  var padding = (input.length() === this.blockSize ?\n    this.blockSize : (this.blockSize - input.length()));\n  input.fillWithByte(padding, padding);\n  return true;\n};\n\nmodes.ecb.prototype.unpad = function(output, options) {\n  // check for error: input data not a multiple of blockSize\n  if(options.overflow > 0) {\n    return false;\n  }\n\n  // ensure padding byte count is valid\n  var len = output.length();\n  var count = output.at(len - 1);\n  if(count > (this.blockSize << 2)) {\n    return false;\n  }\n\n  // trim off padding bytes\n  output.truncate(count);\n  return true;\n};\n\n/** Cipher-block Chaining (CBC) **/\n\nmodes.cbc = function(options) {\n  options = options || {};\n  this.name = 'CBC';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = new Array(this._ints);\n  this._outBlock = new Array(this._ints);\n};\n\nmodes.cbc.prototype.start = function(options) {\n  // Note: legacy support for using IV residue (has security flaws)\n  // if IV is null, reuse block from previous processing\n  if(options.iv === null) {\n    // must have a previous block\n    if(!this._prev) {\n      throw new Error('Invalid IV parameter.');\n    }\n    this._iv = this._prev.slice(0);\n  } else if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  } else {\n    // save IV as \"previous\" block\n    this._iv = transformIV(options.iv, this.blockSize);\n    this._prev = this._iv.slice(0);\n  }\n};\n\nmodes.cbc.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  // CBC XOR's IV (or previous block) with plaintext\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = this._prev[i] ^ input.getInt32();\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // write output, save previous block\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i]);\n  }\n  this._prev = this._outBlock;\n};\n\nmodes.cbc.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = input.getInt32();\n  }\n\n  // decrypt block\n  this.cipher.decrypt(this._inBlock, this._outBlock);\n\n  // write output, save previous ciphered block\n  // CBC XOR's IV (or previous block) with ciphertext\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._prev[i] ^ this._outBlock[i]);\n  }\n  this._prev = this._inBlock.slice(0);\n};\n\nmodes.cbc.prototype.pad = function(input, options) {\n  // add PKCS#7 padding to block (each pad byte is the\n  // value of the number of pad bytes)\n  var padding = (input.length() === this.blockSize ?\n    this.blockSize : (this.blockSize - input.length()));\n  input.fillWithByte(padding, padding);\n  return true;\n};\n\nmodes.cbc.prototype.unpad = function(output, options) {\n  // check for error: input data not a multiple of blockSize\n  if(options.overflow > 0) {\n    return false;\n  }\n\n  // ensure padding byte count is valid\n  var len = output.length();\n  var count = output.at(len - 1);\n  if(count > (this.blockSize << 2)) {\n    return false;\n  }\n\n  // trim off padding bytes\n  output.truncate(count);\n  return true;\n};\n\n/** Cipher feedback (CFB) **/\n\nmodes.cfb = function(options) {\n  options = options || {};\n  this.name = 'CFB';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = null;\n  this._outBlock = new Array(this._ints);\n  this._partialBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // use IV as first input\n  this._iv = transformIV(options.iv, this.blockSize);\n  this._inBlock = this._iv.slice(0);\n  this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output, write input as output\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = input.getInt32() ^ this._outBlock[i];\n      output.putInt32(this._inBlock[i]);\n    }\n    return;\n  }\n\n  // handle partial block\n  var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n  if(partialBytes > 0) {\n    partialBytes = this.blockSize - partialBytes;\n  }\n\n  // XOR input with output, write input as partial output\n  this._partialOutput.clear();\n  for(var i = 0; i < this._ints; ++i) {\n    this._partialBlock[i] = input.getInt32() ^ this._outBlock[i];\n    this._partialOutput.putInt32(this._partialBlock[i]);\n  }\n\n  if(partialBytes > 0) {\n    // block still incomplete, restore input buffer\n    input.read -= this.blockSize;\n  } else {\n    // block complete, update input block\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = this._partialBlock[i];\n    }\n  }\n\n  // skip any previous partial bytes\n  if(this._partialBytes > 0) {\n    this._partialOutput.getBytes(this._partialBytes);\n  }\n\n  if(partialBytes > 0 && !finish) {\n    output.putBytes(this._partialOutput.getBytes(\n      partialBytes - this._partialBytes));\n    this._partialBytes = partialBytes;\n    return true;\n  }\n\n  output.putBytes(this._partialOutput.getBytes(\n    inputLength - this._partialBytes));\n  this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block (CFB always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output, write input as output\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = input.getInt32();\n      output.putInt32(this._inBlock[i] ^ this._outBlock[i]);\n    }\n    return;\n  }\n\n  // handle partial block\n  var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n  if(partialBytes > 0) {\n    partialBytes = this.blockSize - partialBytes;\n  }\n\n  // XOR input with output, write input as partial output\n  this._partialOutput.clear();\n  for(var i = 0; i < this._ints; ++i) {\n    this._partialBlock[i] = input.getInt32();\n    this._partialOutput.putInt32(this._partialBlock[i] ^ this._outBlock[i]);\n  }\n\n  if(partialBytes > 0) {\n    // block still incomplete, restore input buffer\n    input.read -= this.blockSize;\n  } else {\n    // block complete, update input block\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = this._partialBlock[i];\n    }\n  }\n\n  // skip any previous partial bytes\n  if(this._partialBytes > 0) {\n    this._partialOutput.getBytes(this._partialBytes);\n  }\n\n  if(partialBytes > 0 && !finish) {\n    output.putBytes(this._partialOutput.getBytes(\n      partialBytes - this._partialBytes));\n    this._partialBytes = partialBytes;\n    return true;\n  }\n\n  output.putBytes(this._partialOutput.getBytes(\n    inputLength - this._partialBytes));\n  this._partialBytes = 0;\n};\n\n/** Output feedback (OFB) **/\n\nmodes.ofb = function(options) {\n  options = options || {};\n  this.name = 'OFB';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = null;\n  this._outBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // use IV as first input\n  this._iv = transformIV(options.iv, this.blockSize);\n  this._inBlock = this._iv.slice(0);\n  this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(input.length() === 0) {\n    return true;\n  }\n\n  // encrypt block (OFB always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output and update next input\n    for(var i = 0; i < this._ints; ++i) {\n      output.putInt32(input.getInt32() ^ this._outBlock[i]);\n      this._inBlock[i] = this._outBlock[i];\n    }\n    return;\n  }\n\n  // handle partial block\n  var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n  if(partialBytes > 0) {\n    partialBytes = this.blockSize - partialBytes;\n  }\n\n  // XOR input with output\n  this._partialOutput.clear();\n  for(var i = 0; i < this._ints; ++i) {\n    this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n  }\n\n  if(partialBytes > 0) {\n    // block still incomplete, restore input buffer\n    input.read -= this.blockSize;\n  } else {\n    // block complete, update input block\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = this._outBlock[i];\n    }\n  }\n\n  // skip any previous partial bytes\n  if(this._partialBytes > 0) {\n    this._partialOutput.getBytes(this._partialBytes);\n  }\n\n  if(partialBytes > 0 && !finish) {\n    output.putBytes(this._partialOutput.getBytes(\n      partialBytes - this._partialBytes));\n    this._partialBytes = partialBytes;\n    return true;\n  }\n\n  output.putBytes(this._partialOutput.getBytes(\n    inputLength - this._partialBytes));\n  this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.decrypt = modes.ofb.prototype.encrypt;\n\n/** Counter (CTR) **/\n\nmodes.ctr = function(options) {\n  options = options || {};\n  this.name = 'CTR';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = null;\n  this._outBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n};\n\nmodes.ctr.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // use IV as first input\n  this._iv = transformIV(options.iv, this.blockSize);\n  this._inBlock = this._iv.slice(0);\n  this._partialBytes = 0;\n};\n\nmodes.ctr.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block (CTR always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output\n    for(var i = 0; i < this._ints; ++i) {\n      output.putInt32(input.getInt32() ^ this._outBlock[i]);\n    }\n  } else {\n    // handle partial block\n    var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n    if(partialBytes > 0) {\n      partialBytes = this.blockSize - partialBytes;\n    }\n\n    // XOR input with output\n    this._partialOutput.clear();\n    for(var i = 0; i < this._ints; ++i) {\n      this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n    }\n\n    if(partialBytes > 0) {\n      // block still incomplete, restore input buffer\n      input.read -= this.blockSize;\n    }\n\n    // skip any previous partial bytes\n    if(this._partialBytes > 0) {\n      this._partialOutput.getBytes(this._partialBytes);\n    }\n\n    if(partialBytes > 0 && !finish) {\n      output.putBytes(this._partialOutput.getBytes(\n        partialBytes - this._partialBytes));\n      this._partialBytes = partialBytes;\n      return true;\n    }\n\n    output.putBytes(this._partialOutput.getBytes(\n      inputLength - this._partialBytes));\n    this._partialBytes = 0;\n  }\n\n  // block complete, increment counter (input block)\n  inc32(this._inBlock);\n};\n\nmodes.ctr.prototype.decrypt = modes.ctr.prototype.encrypt;\n\n/** Galois/Counter Mode (GCM) **/\n\nmodes.gcm = function(options) {\n  options = options || {};\n  this.name = 'GCM';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = new Array(this._ints);\n  this._outBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n\n  // R is actually this value concatenated with 120 more zero bits, but\n  // we only XOR against R so the other zeros have no effect -- we just\n  // apply this value to the first integer in a block\n  this._R = 0xE1000000;\n};\n\nmodes.gcm.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // ensure IV is a byte buffer\n  var iv = forge.util.createBuffer(options.iv);\n\n  // no ciphered data processed yet\n  this._cipherLength = 0;\n\n  // default additional data is none\n  var additionalData;\n  if('additionalData' in options) {\n    additionalData = forge.util.createBuffer(options.additionalData);\n  } else {\n    additionalData = forge.util.createBuffer();\n  }\n\n  // default tag length is 128 bits\n  if('tagLength' in options) {\n    this._tagLength = options.tagLength;\n  } else {\n    this._tagLength = 128;\n  }\n\n  // if tag is given, ensure tag matches tag length\n  this._tag = null;\n  if(options.decrypt) {\n    // save tag to check later\n    this._tag = forge.util.createBuffer(options.tag).getBytes();\n    if(this._tag.length !== (this._tagLength / 8)) {\n      throw new Error('Authentication tag does not match tag length.');\n    }\n  }\n\n  // create tmp storage for hash calculation\n  this._hashBlock = new Array(this._ints);\n\n  // no tag generated yet\n  this.tag = null;\n\n  // generate hash subkey\n  // (apply block cipher to \"zero\" block)\n  this._hashSubkey = new Array(this._ints);\n  this.cipher.encrypt([0, 0, 0, 0], this._hashSubkey);\n\n  // generate table M\n  // use 4-bit tables (32 component decomposition of a 16 byte value)\n  // 8-bit tables take more space and are known to have security\n  // vulnerabilities (in native implementations)\n  this.componentBits = 4;\n  this._m = this.generateHashTable(this._hashSubkey, this.componentBits);\n\n  // Note: support IV length different from 96 bits? (only supporting\n  // 96 bits is recommended by NIST SP-800-38D)\n  // generate J_0\n  var ivLength = iv.length();\n  if(ivLength === 12) {\n    // 96-bit IV\n    this._j0 = [iv.getInt32(), iv.getInt32(), iv.getInt32(), 1];\n  } else {\n    // IV is NOT 96-bits\n    this._j0 = [0, 0, 0, 0];\n    while(iv.length() > 0) {\n      this._j0 = this.ghash(\n        this._hashSubkey, this._j0,\n        [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]);\n    }\n    this._j0 = this.ghash(\n      this._hashSubkey, this._j0, [0, 0].concat(from64To32(ivLength * 8)));\n  }\n\n  // generate ICB (initial counter block)\n  this._inBlock = this._j0.slice(0);\n  inc32(this._inBlock);\n  this._partialBytes = 0;\n\n  // consume authentication data\n  additionalData = forge.util.createBuffer(additionalData);\n  // save additional data length as a BE 64-bit number\n  this._aDataLength = from64To32(additionalData.length() * 8);\n  // pad additional data to 128 bit (16 byte) block size\n  var overflow = additionalData.length() % this.blockSize;\n  if(overflow) {\n    additionalData.fillWithByte(0, this.blockSize - overflow);\n  }\n  this._s = [0, 0, 0, 0];\n  while(additionalData.length() > 0) {\n    this._s = this.ghash(this._hashSubkey, this._s, [\n      additionalData.getInt32(),\n      additionalData.getInt32(),\n      additionalData.getInt32(),\n      additionalData.getInt32()\n    ]);\n  }\n};\n\nmodes.gcm.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output\n    for(var i = 0; i < this._ints; ++i) {\n      output.putInt32(this._outBlock[i] ^= input.getInt32());\n    }\n    this._cipherLength += this.blockSize;\n  } else {\n    // handle partial block\n    var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n    if(partialBytes > 0) {\n      partialBytes = this.blockSize - partialBytes;\n    }\n\n    // XOR input with output\n    this._partialOutput.clear();\n    for(var i = 0; i < this._ints; ++i) {\n      this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n    }\n\n    if(partialBytes <= 0 || finish) {\n      // handle overflow prior to hashing\n      if(finish) {\n        // get block overflow\n        var overflow = inputLength % this.blockSize;\n        this._cipherLength += overflow;\n        // truncate for hash function\n        this._partialOutput.truncate(this.blockSize - overflow);\n      } else {\n        this._cipherLength += this.blockSize;\n      }\n\n      // get output block for hashing\n      for(var i = 0; i < this._ints; ++i) {\n        this._outBlock[i] = this._partialOutput.getInt32();\n      }\n      this._partialOutput.read -= this.blockSize;\n    }\n\n    // skip any previous partial bytes\n    if(this._partialBytes > 0) {\n      this._partialOutput.getBytes(this._partialBytes);\n    }\n\n    if(partialBytes > 0 && !finish) {\n      // block still incomplete, restore input buffer, get partial output,\n      // and return early\n      input.read -= this.blockSize;\n      output.putBytes(this._partialOutput.getBytes(\n        partialBytes - this._partialBytes));\n      this._partialBytes = partialBytes;\n      return true;\n    }\n\n    output.putBytes(this._partialOutput.getBytes(\n      inputLength - this._partialBytes));\n    this._partialBytes = 0;\n  }\n\n  // update hash block S\n  this._s = this.ghash(this._hashSubkey, this._s, this._outBlock);\n\n  // increment counter (input block)\n  inc32(this._inBlock);\n};\n\nmodes.gcm.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  var inputLength = input.length();\n  if(inputLength < this.blockSize && !(finish && inputLength > 0)) {\n    return true;\n  }\n\n  // encrypt block (GCM always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // increment counter (input block)\n  inc32(this._inBlock);\n\n  // update hash block S\n  this._hashBlock[0] = input.getInt32();\n  this._hashBlock[1] = input.getInt32();\n  this._hashBlock[2] = input.getInt32();\n  this._hashBlock[3] = input.getInt32();\n  this._s = this.ghash(this._hashSubkey, this._s, this._hashBlock);\n\n  // XOR hash input with output\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i] ^ this._hashBlock[i]);\n  }\n\n  // increment cipher data length\n  if(inputLength < this.blockSize) {\n    this._cipherLength += inputLength % this.blockSize;\n  } else {\n    this._cipherLength += this.blockSize;\n  }\n};\n\nmodes.gcm.prototype.afterFinish = function(output, options) {\n  var rval = true;\n\n  // handle overflow\n  if(options.decrypt && options.overflow) {\n    output.truncate(this.blockSize - options.overflow);\n  }\n\n  // handle authentication tag\n  this.tag = forge.util.createBuffer();\n\n  // concatenate additional data length with cipher length\n  var lengths = this._aDataLength.concat(from64To32(this._cipherLength * 8));\n\n  // include lengths in hash\n  this._s = this.ghash(this._hashSubkey, this._s, lengths);\n\n  // do GCTR(J_0, S)\n  var tag = [];\n  this.cipher.encrypt(this._j0, tag);\n  for(var i = 0; i < this._ints; ++i) {\n    this.tag.putInt32(this._s[i] ^ tag[i]);\n  }\n\n  // trim tag to length\n  this.tag.truncate(this.tag.length() % (this._tagLength / 8));\n\n  // check authentication tag\n  if(options.decrypt && this.tag.bytes() !== this._tag) {\n    rval = false;\n  }\n\n  return rval;\n};\n\n/**\n * See NIST SP-800-38D 6.3 (Algorithm 1). This function performs Galois\n * field multiplication. The field, GF(2^128), is defined by the polynomial:\n *\n * x^128 + x^7 + x^2 + x + 1\n *\n * Which is represented in little-endian binary form as: 11100001 (0xe1). When\n * the value of a coefficient is 1, a bit is set. The value R, is the\n * concatenation of this value and 120 zero bits, yielding a 128-bit value\n * which matches the block size.\n *\n * This function will multiply two elements (vectors of bytes), X and Y, in\n * the field GF(2^128). The result is initialized to zero. For each bit of\n * X (out of 128), x_i, if x_i is set, then the result is multiplied (XOR'd)\n * by the current value of Y. For each bit, the value of Y will be raised by\n * a power of x (multiplied by the polynomial x). This can be achieved by\n * shifting Y once to the right. If the current value of Y, prior to being\n * multiplied by x, has 0 as its LSB, then it is a 127th degree polynomial.\n * Otherwise, we must divide by R after shifting to find the remainder.\n *\n * @param x the first block to multiply by the second.\n * @param y the second block to multiply by the first.\n *\n * @return the block result of the multiplication.\n */\nmodes.gcm.prototype.multiply = function(x, y) {\n  var z_i = [0, 0, 0, 0];\n  var v_i = y.slice(0);\n\n  // calculate Z_128 (block has 128 bits)\n  for(var i = 0; i < 128; ++i) {\n    // if x_i is 0, Z_{i+1} = Z_i (unchanged)\n    // else Z_{i+1} = Z_i ^ V_i\n    // get x_i by finding 32-bit int position, then left shift 1 by remainder\n    var x_i = x[(i / 32) | 0] & (1 << (31 - i % 32));\n    if(x_i) {\n      z_i[0] ^= v_i[0];\n      z_i[1] ^= v_i[1];\n      z_i[2] ^= v_i[2];\n      z_i[3] ^= v_i[3];\n    }\n\n    // if LSB(V_i) is 1, V_i = V_i >> 1\n    // else V_i = (V_i >> 1) ^ R\n    this.pow(v_i, v_i);\n  }\n\n  return z_i;\n};\n\nmodes.gcm.prototype.pow = function(x, out) {\n  // if LSB(x) is 1, x = x >>> 1\n  // else x = (x >>> 1) ^ R\n  var lsb = x[3] & 1;\n\n  // always do x >>> 1:\n  // starting with the rightmost integer, shift each integer to the right\n  // one bit, pulling in the bit from the integer to the left as its top\n  // most bit (do this for the last 3 integers)\n  for(var i = 3; i > 0; --i) {\n    out[i] = (x[i] >>> 1) | ((x[i - 1] & 1) << 31);\n  }\n  // shift the first integer normally\n  out[0] = x[0] >>> 1;\n\n  // if lsb was not set, then polynomial had a degree of 127 and doesn't\n  // need to divided; otherwise, XOR with R to find the remainder; we only\n  // need to XOR the first integer since R technically ends w/120 zero bits\n  if(lsb) {\n    out[0] ^= this._R;\n  }\n};\n\nmodes.gcm.prototype.tableMultiply = function(x) {\n  // assumes 4-bit tables are used\n  var z = [0, 0, 0, 0];\n  for(var i = 0; i < 32; ++i) {\n    var idx = (i / 8) | 0;\n    var x_i = (x[idx] >>> ((7 - (i % 8)) * 4)) & 0xF;\n    var ah = this._m[i][x_i];\n    z[0] ^= ah[0];\n    z[1] ^= ah[1];\n    z[2] ^= ah[2];\n    z[3] ^= ah[3];\n  }\n  return z;\n};\n\n/**\n * A continuing version of the GHASH algorithm that operates on a single\n * block. The hash block, last hash value (Ym) and the new block to hash\n * are given.\n *\n * @param h the hash block.\n * @param y the previous value for Ym, use [0, 0, 0, 0] for a new hash.\n * @param x the block to hash.\n *\n * @return the hashed value (Ym).\n */\nmodes.gcm.prototype.ghash = function(h, y, x) {\n  y[0] ^= x[0];\n  y[1] ^= x[1];\n  y[2] ^= x[2];\n  y[3] ^= x[3];\n  return this.tableMultiply(y);\n  //return this.multiply(y, h);\n};\n\n/**\n * Precomputes a table for multiplying against the hash subkey. This\n * mechanism provides a substantial speed increase over multiplication\n * performed without a table. The table-based multiplication this table is\n * for solves X * H by multiplying each component of X by H and then\n * composing the results together using XOR.\n *\n * This function can be used to generate tables with different bit sizes\n * for the components, however, this implementation assumes there are\n * 32 components of X (which is a 16 byte vector), therefore each component\n * takes 4-bits (so the table is constructed with bits=4).\n *\n * @param h the hash subkey.\n * @param bits the bit size for a component.\n */\nmodes.gcm.prototype.generateHashTable = function(h, bits) {\n  // TODO: There are further optimizations that would use only the\n  // first table M_0 (or some variant) along with a remainder table;\n  // this can be explored in the future\n  var multiplier = 8 / bits;\n  var perInt = 4 * multiplier;\n  var size = 16 * multiplier;\n  var m = new Array(size);\n  for(var i = 0; i < size; ++i) {\n    var tmp = [0, 0, 0, 0];\n    var idx = (i / perInt) | 0;\n    var shft = ((perInt - 1 - (i % perInt)) * bits);\n    tmp[idx] = (1 << (bits - 1)) << shft;\n    m[i] = this.generateSubHashTable(this.multiply(tmp, h), bits);\n  }\n  return m;\n};\n\n/**\n * Generates a table for multiplying against the hash subkey for one\n * particular component (out of all possible component values).\n *\n * @param mid the pre-multiplied value for the middle key of the table.\n * @param bits the bit size for a component.\n */\nmodes.gcm.prototype.generateSubHashTable = function(mid, bits) {\n  // compute the table quickly by minimizing the number of\n  // POW operations -- they only need to be performed for powers of 2,\n  // all other entries can be composed from those powers using XOR\n  var size = 1 << bits;\n  var half = size >>> 1;\n  var m = new Array(size);\n  m[half] = mid.slice(0);\n  var i = half >>> 1;\n  while(i > 0) {\n    // raise m0[2 * i] and store in m0[i]\n    this.pow(m[2 * i], m[i] = []);\n    i >>= 1;\n  }\n  i = 2;\n  while(i < half) {\n    for(var j = 1; j < i; ++j) {\n      var m_i = m[i];\n      var m_j = m[j];\n      m[i + j] = [\n        m_i[0] ^ m_j[0],\n        m_i[1] ^ m_j[1],\n        m_i[2] ^ m_j[2],\n        m_i[3] ^ m_j[3]\n      ];\n    }\n    i *= 2;\n  }\n  m[0] = [0, 0, 0, 0];\n  /* Note: We could avoid storing these by doing composition during multiply\n  calculate top half using composition by speed is preferred. */\n  for(i = half + 1; i < size; ++i) {\n    var c = m[i ^ half];\n    m[i] = [mid[0] ^ c[0], mid[1] ^ c[1], mid[2] ^ c[2], mid[3] ^ c[3]];\n  }\n  return m;\n};\n\n/** Utility functions */\n\nfunction transformIV(iv, blockSize) {\n  if(typeof iv === 'string') {\n    // convert iv string into byte buffer\n    iv = forge.util.createBuffer(iv);\n  }\n\n  if(forge.util.isArray(iv) && iv.length > 4) {\n    // convert iv byte array into byte buffer\n    var tmp = iv;\n    iv = forge.util.createBuffer();\n    for(var i = 0; i < tmp.length; ++i) {\n      iv.putByte(tmp[i]);\n    }\n  }\n\n  if(iv.length() < blockSize) {\n    throw new Error(\n      'Invalid IV length; got ' + iv.length() +\n      ' bytes and expected ' + blockSize + ' bytes.');\n  }\n\n  if(!forge.util.isArray(iv)) {\n    // convert iv byte buffer into 32-bit integer array\n    var ints = [];\n    var blocks = blockSize / 4;\n    for(var i = 0; i < blocks; ++i) {\n      ints.push(iv.getInt32());\n    }\n    iv = ints;\n  }\n\n  return iv;\n}\n\nfunction inc32(block) {\n  // increment last 32 bits of block only\n  block[block.length - 1] = (block[block.length - 1] + 1) & 0xFFFFFFFF;\n}\n\nfunction from64To32(num) {\n  // convert 64-bit number to two BE Int32s\n  return [(num / 0x100000000) | 0, num & 0xFFFFFFFF];\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;CAOA,IAAI;AACJ;AAEA,OAAM,SAAS,MAAM,UAAU,EAAE;CAGjC,IAAI,QAAQ,OAAO,UAAU,MAAM,OAAO,QAAQ,MAAM,OAAO,SAAS,EAAE;;AAI1E,OAAM,MAAM,SAAS,SAAS;AAC5B,YAAU,WAAW,EAAE;AACvB,OAAK,OAAO;AACZ,OAAK,SAAS,QAAQ;AACtB,OAAK,YAAY,QAAQ,aAAa;AACtC,OAAK,QAAQ,KAAK,YAAY;AAC9B,OAAK,WAAW,IAAI,MAAM,KAAK,MAAM;AACrC,OAAK,YAAY,IAAI,MAAM,KAAK,MAAM;;AAGxC,OAAM,IAAI,UAAU,QAAQ,SAAS,SAAS;AAE9C,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;AAE5D,MAAG,MAAM,QAAQ,GAAG,KAAK,aAAa,EAAE,UAAU,MAAM,QAAQ,GAAG,GACjE,QAAO;AAIT,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,MAAM,UAAU;AAIrC,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,KAAK,UAAU,GAAG;;AAItC,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;AAE5D,MAAG,MAAM,QAAQ,GAAG,KAAK,aAAa,EAAE,UAAU,MAAM,QAAQ,GAAG,GACjE,QAAO;AAIT,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,MAAM,UAAU;AAIrC,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,KAAK,UAAU,GAAG;;AAItC,OAAM,IAAI,UAAU,MAAM,SAAS,OAAO,SAAS;EAGjD,IAAI,UAAW,MAAM,QAAQ,KAAK,KAAK,YACrC,KAAK,YAAa,KAAK,YAAY,MAAM,QAAQ;AACnD,QAAM,aAAa,SAAS,QAAQ;AACpC,SAAO;;AAGT,OAAM,IAAI,UAAU,QAAQ,SAAS,QAAQ,SAAS;AAEpD,MAAG,QAAQ,WAAW,EACpB,QAAO;EAIT,IAAI,MAAM,OAAO,QAAQ;EACzB,IAAI,QAAQ,OAAO,GAAG,MAAM,EAAE;AAC9B,MAAG,QAAS,KAAK,aAAa,EAC5B,QAAO;AAIT,SAAO,SAAS,MAAM;AACtB,SAAO;;;AAKT,OAAM,MAAM,SAAS,SAAS;AAC5B,YAAU,WAAW,EAAE;AACvB,OAAK,OAAO;AACZ,OAAK,SAAS,QAAQ;AACtB,OAAK,YAAY,QAAQ,aAAa;AACtC,OAAK,QAAQ,KAAK,YAAY;AAC9B,OAAK,WAAW,IAAI,MAAM,KAAK,MAAM;AACrC,OAAK,YAAY,IAAI,MAAM,KAAK,MAAM;;AAGxC,OAAM,IAAI,UAAU,QAAQ,SAAS,SAAS;AAG5C,MAAG,QAAQ,OAAO,MAAM;AAEtB,OAAG,CAAC,KAAK,MACP,OAAM,IAAI,MAAM,wBAAwB;AAE1C,QAAK,MAAM,KAAK,MAAM,MAAM,EAAE;aACtB,EAAE,QAAQ,SAClB,OAAM,IAAI,MAAM,wBAAwB;OACnC;AAEL,QAAK,MAAM,YAAY,QAAQ,IAAI,KAAK,UAAU;AAClD,QAAK,QAAQ,KAAK,IAAI,MAAM,EAAE;;;AAIlC,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;AAE5D,MAAG,MAAM,QAAQ,GAAG,KAAK,aAAa,EAAE,UAAU,MAAM,QAAQ,GAAG,GACjE,QAAO;AAKT,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,KAAK,MAAM,KAAK,MAAM,UAAU;AAIrD,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,KAAK,UAAU,GAAG;AAEpC,OAAK,QAAQ,KAAK;;AAGpB,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;AAE5D,MAAG,MAAM,QAAQ,GAAG,KAAK,aAAa,EAAE,UAAU,MAAM,QAAQ,GAAG,GACjE,QAAO;AAIT,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,MAAM,UAAU;AAIrC,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAIlD,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,KAAK,MAAM,KAAK,KAAK,UAAU,GAAG;AAEpD,OAAK,QAAQ,KAAK,SAAS,MAAM,EAAE;;AAGrC,OAAM,IAAI,UAAU,MAAM,SAAS,OAAO,SAAS;EAGjD,IAAI,UAAW,MAAM,QAAQ,KAAK,KAAK,YACrC,KAAK,YAAa,KAAK,YAAY,MAAM,QAAQ;AACnD,QAAM,aAAa,SAAS,QAAQ;AACpC,SAAO;;AAGT,OAAM,IAAI,UAAU,QAAQ,SAAS,QAAQ,SAAS;AAEpD,MAAG,QAAQ,WAAW,EACpB,QAAO;EAIT,IAAI,MAAM,OAAO,QAAQ;EACzB,IAAI,QAAQ,OAAO,GAAG,MAAM,EAAE;AAC9B,MAAG,QAAS,KAAK,aAAa,EAC5B,QAAO;AAIT,SAAO,SAAS,MAAM;AACtB,SAAO;;;AAKT,OAAM,MAAM,SAAS,SAAS;AAC5B,YAAU,WAAW,EAAE;AACvB,OAAK,OAAO;AACZ,OAAK,SAAS,QAAQ;AACtB,OAAK,YAAY,QAAQ,aAAa;AACtC,OAAK,QAAQ,KAAK,YAAY;AAC9B,OAAK,WAAW;AAChB,OAAK,YAAY,IAAI,MAAM,KAAK,MAAM;AACtC,OAAK,gBAAgB,IAAI,MAAM,KAAK,MAAM;AAC1C,OAAK,iBAAiB,MAAM,KAAK,cAAc;AAC/C,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,QAAQ,SAAS,SAAS;AAC5C,MAAG,EAAE,QAAQ,SACX,OAAM,IAAI,MAAM,wBAAwB;AAG1C,OAAK,MAAM,YAAY,QAAQ,IAAI,KAAK,UAAU;AAClD,OAAK,WAAW,KAAK,IAAI,MAAM,EAAE;AACjC,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;EAE5D,IAAI,cAAc,MAAM,QAAQ;AAChC,MAAG,gBAAgB,EACjB,QAAO;AAIT,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,MAAG,KAAK,kBAAkB,KAAK,eAAe,KAAK,WAAW;AAE5D,QAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,GAAG;AAClC,SAAK,SAAS,KAAK,MAAM,UAAU,GAAG,KAAK,UAAU;AACrD,WAAO,SAAS,KAAK,SAAS,GAAG;;AAEnC;;EAIF,IAAI,gBAAgB,KAAK,YAAY,eAAe,KAAK;AACzD,MAAG,eAAe,EAChB,gBAAe,KAAK,YAAY;AAIlC,OAAK,eAAe,OAAO;AAC3B,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,GAAG;AAClC,QAAK,cAAc,KAAK,MAAM,UAAU,GAAG,KAAK,UAAU;AAC1D,QAAK,eAAe,SAAS,KAAK,cAAc,GAAG;;AAGrD,MAAG,eAAe,EAEhB,OAAM,QAAQ,KAAK;MAGnB,MAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,KAAK,cAAc;AAK1C,MAAG,KAAK,gBAAgB,EACtB,MAAK,eAAe,SAAS,KAAK,cAAc;AAGlD,MAAG,eAAe,KAAK,CAAC,QAAQ;AAC9B,UAAO,SAAS,KAAK,eAAe,SAClC,eAAe,KAAK,cAAc,CAAC;AACrC,QAAK,gBAAgB;AACrB,UAAO;;AAGT,SAAO,SAAS,KAAK,eAAe,SAClC,cAAc,KAAK,cAAc,CAAC;AACpC,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;EAE5D,IAAI,cAAc,MAAM,QAAQ;AAChC,MAAG,gBAAgB,EACjB,QAAO;AAIT,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,MAAG,KAAK,kBAAkB,KAAK,eAAe,KAAK,WAAW;AAE5D,QAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,GAAG;AAClC,SAAK,SAAS,KAAK,MAAM,UAAU;AACnC,WAAO,SAAS,KAAK,SAAS,KAAK,KAAK,UAAU,GAAG;;AAEvD;;EAIF,IAAI,gBAAgB,KAAK,YAAY,eAAe,KAAK;AACzD,MAAG,eAAe,EAChB,gBAAe,KAAK,YAAY;AAIlC,OAAK,eAAe,OAAO;AAC3B,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,GAAG;AAClC,QAAK,cAAc,KAAK,MAAM,UAAU;AACxC,QAAK,eAAe,SAAS,KAAK,cAAc,KAAK,KAAK,UAAU,GAAG;;AAGzE,MAAG,eAAe,EAEhB,OAAM,QAAQ,KAAK;MAGnB,MAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,KAAK,cAAc;AAK1C,MAAG,KAAK,gBAAgB,EACtB,MAAK,eAAe,SAAS,KAAK,cAAc;AAGlD,MAAG,eAAe,KAAK,CAAC,QAAQ;AAC9B,UAAO,SAAS,KAAK,eAAe,SAClC,eAAe,KAAK,cAAc,CAAC;AACrC,QAAK,gBAAgB;AACrB,UAAO;;AAGT,SAAO,SAAS,KAAK,eAAe,SAClC,cAAc,KAAK,cAAc,CAAC;AACpC,OAAK,gBAAgB;;;AAKvB,OAAM,MAAM,SAAS,SAAS;AAC5B,YAAU,WAAW,EAAE;AACvB,OAAK,OAAO;AACZ,OAAK,SAAS,QAAQ;AACtB,OAAK,YAAY,QAAQ,aAAa;AACtC,OAAK,QAAQ,KAAK,YAAY;AAC9B,OAAK,WAAW;AAChB,OAAK,YAAY,IAAI,MAAM,KAAK,MAAM;AACtC,OAAK,iBAAiB,MAAM,KAAK,cAAc;AAC/C,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,QAAQ,SAAS,SAAS;AAC5C,MAAG,EAAE,QAAQ,SACX,OAAM,IAAI,MAAM,wBAAwB;AAG1C,OAAK,MAAM,YAAY,QAAQ,IAAI,KAAK,UAAU;AAClD,OAAK,WAAW,KAAK,IAAI,MAAM,EAAE;AACjC,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;EAE5D,IAAI,cAAc,MAAM,QAAQ;AAChC,MAAG,MAAM,QAAQ,KAAK,EACpB,QAAO;AAIT,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,MAAG,KAAK,kBAAkB,KAAK,eAAe,KAAK,WAAW;AAE5D,QAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,GAAG;AAClC,WAAO,SAAS,MAAM,UAAU,GAAG,KAAK,UAAU,GAAG;AACrD,SAAK,SAAS,KAAK,KAAK,UAAU;;AAEpC;;EAIF,IAAI,gBAAgB,KAAK,YAAY,eAAe,KAAK;AACzD,MAAG,eAAe,EAChB,gBAAe,KAAK,YAAY;AAIlC,OAAK,eAAe,OAAO;AAC3B,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,eAAe,SAAS,MAAM,UAAU,GAAG,KAAK,UAAU,GAAG;AAGpE,MAAG,eAAe,EAEhB,OAAM,QAAQ,KAAK;MAGnB,MAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,SAAS,KAAK,KAAK,UAAU;AAKtC,MAAG,KAAK,gBAAgB,EACtB,MAAK,eAAe,SAAS,KAAK,cAAc;AAGlD,MAAG,eAAe,KAAK,CAAC,QAAQ;AAC9B,UAAO,SAAS,KAAK,eAAe,SAClC,eAAe,KAAK,cAAc,CAAC;AACrC,QAAK,gBAAgB;AACrB,UAAO;;AAGT,SAAO,SAAS,KAAK,eAAe,SAClC,cAAc,KAAK,cAAc,CAAC;AACpC,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,UAAU,MAAM,IAAI,UAAU;;AAIlD,OAAM,MAAM,SAAS,SAAS;AAC5B,YAAU,WAAW,EAAE;AACvB,OAAK,OAAO;AACZ,OAAK,SAAS,QAAQ;AACtB,OAAK,YAAY,QAAQ,aAAa;AACtC,OAAK,QAAQ,KAAK,YAAY;AAC9B,OAAK,WAAW;AAChB,OAAK,YAAY,IAAI,MAAM,KAAK,MAAM;AACtC,OAAK,iBAAiB,MAAM,KAAK,cAAc;AAC/C,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,QAAQ,SAAS,SAAS;AAC5C,MAAG,EAAE,QAAQ,SACX,OAAM,IAAI,MAAM,wBAAwB;AAG1C,OAAK,MAAM,YAAY,QAAQ,IAAI,KAAK,UAAU;AAClD,OAAK,WAAW,KAAK,IAAI,MAAM,EAAE;AACjC,OAAK,gBAAgB;;AAGvB,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;EAE5D,IAAI,cAAc,MAAM,QAAQ;AAChC,MAAG,gBAAgB,EACjB,QAAO;AAIT,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,MAAG,KAAK,kBAAkB,KAAK,eAAe,KAAK,UAEjD,MAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,MAAM,UAAU,GAAG,KAAK,UAAU,GAAG;OAElD;GAEL,IAAI,gBAAgB,KAAK,YAAY,eAAe,KAAK;AACzD,OAAG,eAAe,EAChB,gBAAe,KAAK,YAAY;AAIlC,QAAK,eAAe,OAAO;AAC3B,QAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,eAAe,SAAS,MAAM,UAAU,GAAG,KAAK,UAAU,GAAG;AAGpE,OAAG,eAAe,EAEhB,OAAM,QAAQ,KAAK;AAIrB,OAAG,KAAK,gBAAgB,EACtB,MAAK,eAAe,SAAS,KAAK,cAAc;AAGlD,OAAG,eAAe,KAAK,CAAC,QAAQ;AAC9B,WAAO,SAAS,KAAK,eAAe,SAClC,eAAe,KAAK,cAAc,CAAC;AACrC,SAAK,gBAAgB;AACrB,WAAO;;AAGT,UAAO,SAAS,KAAK,eAAe,SAClC,cAAc,KAAK,cAAc,CAAC;AACpC,QAAK,gBAAgB;;AAIvB,QAAM,KAAK,SAAS;;AAGtB,OAAM,IAAI,UAAU,UAAU,MAAM,IAAI,UAAU;;AAIlD,OAAM,MAAM,SAAS,SAAS;AAC5B,YAAU,WAAW,EAAE;AACvB,OAAK,OAAO;AACZ,OAAK,SAAS,QAAQ;AACtB,OAAK,YAAY,QAAQ,aAAa;AACtC,OAAK,QAAQ,KAAK,YAAY;AAC9B,OAAK,WAAW,IAAI,MAAM,KAAK,MAAM;AACrC,OAAK,YAAY,IAAI,MAAM,KAAK,MAAM;AACtC,OAAK,iBAAiB,MAAM,KAAK,cAAc;AAC/C,OAAK,gBAAgB;AAKrB,OAAK,KAAK;;AAGZ,OAAM,IAAI,UAAU,QAAQ,SAAS,SAAS;AAC5C,MAAG,EAAE,QAAQ,SACX,OAAM,IAAI,MAAM,wBAAwB;EAG1C,IAAI,KAAK,MAAM,KAAK,aAAa,QAAQ,GAAG;AAG5C,OAAK,gBAAgB;EAGrB,IAAI;AACJ,MAAG,oBAAoB,QACrB,kBAAiB,MAAM,KAAK,aAAa,QAAQ,eAAe;MAEhE,kBAAiB,MAAM,KAAK,cAAc;AAI5C,MAAG,eAAe,QAChB,MAAK,aAAa,QAAQ;MAE1B,MAAK,aAAa;AAIpB,OAAK,OAAO;AACZ,MAAG,QAAQ,SAAS;AAElB,QAAK,OAAO,MAAM,KAAK,aAAa,QAAQ,IAAI,CAAC,UAAU;AAC3D,OAAG,KAAK,KAAK,WAAY,KAAK,aAAa,EACzC,OAAM,IAAI,MAAM,gDAAgD;;AAKpE,OAAK,aAAa,IAAI,MAAM,KAAK,MAAM;AAGvC,OAAK,MAAM;AAIX,OAAK,cAAc,IAAI,MAAM,KAAK,MAAM;AACxC,OAAK,OAAO,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAE,EAAE,KAAK,YAAY;AAMnD,OAAK,gBAAgB;AACrB,OAAK,KAAK,KAAK,kBAAkB,KAAK,aAAa,KAAK,cAAc;EAKtE,IAAI,WAAW,GAAG,QAAQ;AAC1B,MAAG,aAAa,GAEd,MAAK,MAAM;GAAC,GAAG,UAAU;GAAE,GAAG,UAAU;GAAE,GAAG,UAAU;GAAE;GAAE;OACtD;AAEL,QAAK,MAAM;IAAC;IAAG;IAAG;IAAG;IAAE;AACvB,UAAM,GAAG,QAAQ,GAAG,EAClB,MAAK,MAAM,KAAK,MACd,KAAK,aAAa,KAAK,KACvB;IAAC,GAAG,UAAU;IAAE,GAAG,UAAU;IAAE,GAAG,UAAU;IAAE,GAAG,UAAU;IAAC,CAAC;AAEjE,QAAK,MAAM,KAAK,MACd,KAAK,aAAa,KAAK,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,WAAW,WAAW,EAAE,CAAC,CAAC;;AAIxE,OAAK,WAAW,KAAK,IAAI,MAAM,EAAE;AACjC,QAAM,KAAK,SAAS;AACpB,OAAK,gBAAgB;AAGrB,mBAAiB,MAAM,KAAK,aAAa,eAAe;AAExD,OAAK,eAAe,WAAW,eAAe,QAAQ,GAAG,EAAE;EAE3D,IAAI,WAAW,eAAe,QAAQ,GAAG,KAAK;AAC9C,MAAG,SACD,gBAAe,aAAa,GAAG,KAAK,YAAY,SAAS;AAE3D,OAAK,KAAK;GAAC;GAAG;GAAG;GAAG;GAAE;AACtB,SAAM,eAAe,QAAQ,GAAG,EAC9B,MAAK,KAAK,KAAK,MAAM,KAAK,aAAa,KAAK,IAAI;GAC9C,eAAe,UAAU;GACzB,eAAe,UAAU;GACzB,eAAe,UAAU;GACzB,eAAe,UAAU;GAC1B,CAAC;;AAIN,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;EAE5D,IAAI,cAAc,MAAM,QAAQ;AAChC,MAAG,gBAAgB,EACjB,QAAO;AAIT,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,MAAG,KAAK,kBAAkB,KAAK,eAAe,KAAK,WAAW;AAE5D,QAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,KAAK,UAAU,MAAM,MAAM,UAAU,CAAC;AAExD,QAAK,iBAAiB,KAAK;SACtB;GAEL,IAAI,gBAAgB,KAAK,YAAY,eAAe,KAAK;AACzD,OAAG,eAAe,EAChB,gBAAe,KAAK,YAAY;AAIlC,QAAK,eAAe,OAAO;AAC3B,QAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,eAAe,SAAS,MAAM,UAAU,GAAG,KAAK,UAAU,GAAG;AAGpE,OAAG,gBAAgB,KAAK,QAAQ;AAE9B,QAAG,QAAQ;KAET,IAAI,WAAW,cAAc,KAAK;AAClC,UAAK,iBAAiB;AAEtB,UAAK,eAAe,SAAS,KAAK,YAAY,SAAS;UAEvD,MAAK,iBAAiB,KAAK;AAI7B,SAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,UAAU,KAAK,KAAK,eAAe,UAAU;AAEpD,SAAK,eAAe,QAAQ,KAAK;;AAInC,OAAG,KAAK,gBAAgB,EACtB,MAAK,eAAe,SAAS,KAAK,cAAc;AAGlD,OAAG,eAAe,KAAK,CAAC,QAAQ;AAG9B,UAAM,QAAQ,KAAK;AACnB,WAAO,SAAS,KAAK,eAAe,SAClC,eAAe,KAAK,cAAc,CAAC;AACrC,SAAK,gBAAgB;AACrB,WAAO;;AAGT,UAAO,SAAS,KAAK,eAAe,SAClC,cAAc,KAAK,cAAc,CAAC;AACpC,QAAK,gBAAgB;;AAIvB,OAAK,KAAK,KAAK,MAAM,KAAK,aAAa,KAAK,IAAI,KAAK,UAAU;AAG/D,QAAM,KAAK,SAAS;;AAGtB,OAAM,IAAI,UAAU,UAAU,SAAS,OAAO,QAAQ,QAAQ;EAE5D,IAAI,cAAc,MAAM,QAAQ;AAChC,MAAG,cAAc,KAAK,aAAa,EAAE,UAAU,cAAc,GAC3D,QAAO;AAIT,OAAK,OAAO,QAAQ,KAAK,UAAU,KAAK,UAAU;AAGlD,QAAM,KAAK,SAAS;AAGpB,OAAK,WAAW,KAAK,MAAM,UAAU;AACrC,OAAK,WAAW,KAAK,MAAM,UAAU;AACrC,OAAK,WAAW,KAAK,MAAM,UAAU;AACrC,OAAK,WAAW,KAAK,MAAM,UAAU;AACrC,OAAK,KAAK,KAAK,MAAM,KAAK,aAAa,KAAK,IAAI,KAAK,WAAW;AAGhE,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,QAAO,SAAS,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;AAIzD,MAAG,cAAc,KAAK,UACpB,MAAK,iBAAiB,cAAc,KAAK;MAEzC,MAAK,iBAAiB,KAAK;;AAI/B,OAAM,IAAI,UAAU,cAAc,SAAS,QAAQ,SAAS;EAC1D,IAAI,OAAO;AAGX,MAAG,QAAQ,WAAW,QAAQ,SAC5B,QAAO,SAAS,KAAK,YAAY,QAAQ,SAAS;AAIpD,OAAK,MAAM,MAAM,KAAK,cAAc;EAGpC,IAAI,UAAU,KAAK,aAAa,OAAO,WAAW,KAAK,gBAAgB,EAAE,CAAC;AAG1E,OAAK,KAAK,KAAK,MAAM,KAAK,aAAa,KAAK,IAAI,QAAQ;EAGxD,IAAI,MAAM,EAAE;AACZ,OAAK,OAAO,QAAQ,KAAK,KAAK,IAAI;AAClC,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,EAC/B,MAAK,IAAI,SAAS,KAAK,GAAG,KAAK,IAAI,GAAG;AAIxC,OAAK,IAAI,SAAS,KAAK,IAAI,QAAQ,IAAI,KAAK,aAAa,GAAG;AAG5D,MAAG,QAAQ,WAAW,KAAK,IAAI,OAAO,KAAK,KAAK,KAC9C,QAAO;AAGT,SAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BT,OAAM,IAAI,UAAU,WAAW,SAAS,GAAG,GAAG;EAC5C,IAAI,MAAM;GAAC;GAAG;GAAG;GAAG;GAAE;EACtB,IAAI,MAAM,EAAE,MAAM,EAAE;AAGpB,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAK3B,OADU,EAAG,IAAI,KAAM,KAAM,KAAM,KAAK,IAAI,IACpC;AACN,QAAI,MAAM,IAAI;AACd,QAAI,MAAM,IAAI;AACd,QAAI,MAAM,IAAI;AACd,QAAI,MAAM,IAAI;;AAKhB,QAAK,IAAI,KAAK,IAAI;;AAGpB,SAAO;;AAGT,OAAM,IAAI,UAAU,MAAM,SAAS,GAAG,KAAK;EAGzC,IAAI,MAAM,EAAE,KAAK;AAMjB,OAAI,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACtB,KAAI,KAAM,EAAE,OAAO,KAAO,EAAE,IAAI,KAAK,MAAM;AAG7C,MAAI,KAAK,EAAE,OAAO;AAKlB,MAAG,IACD,KAAI,MAAM,KAAK;;AAInB,OAAM,IAAI,UAAU,gBAAgB,SAAS,GAAG;EAE9C,IAAI,IAAI;GAAC;GAAG;GAAG;GAAG;GAAE;AACpB,OAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;GAE1B,IAAI,MAAO,EADA,IAAI,IAAK,QACI,IAAK,IAAI,KAAM,IAAM;GAC7C,IAAI,KAAK,KAAK,GAAG,GAAG;AACpB,KAAE,MAAM,GAAG;AACX,KAAE,MAAM,GAAG;AACX,KAAE,MAAM,GAAG;AACX,KAAE,MAAM,GAAG;;AAEb,SAAO;;;;;;;;;;;;;AAcT,OAAM,IAAI,UAAU,QAAQ,SAAS,GAAG,GAAG,GAAG;AAC5C,IAAE,MAAM,EAAE;AACV,IAAE,MAAM,EAAE;AACV,IAAE,MAAM,EAAE;AACV,IAAE,MAAM,EAAE;AACV,SAAO,KAAK,cAAc,EAAE;;;;;;;;;;;;;;;;;AAmB9B,OAAM,IAAI,UAAU,oBAAoB,SAAS,GAAG,MAAM;EAIxD,IAAI,aAAa,IAAI;EACrB,IAAI,SAAS,IAAI;EACjB,IAAI,OAAO,KAAK;EAChB,IAAI,IAAI,IAAI,MAAM,KAAK;AACvB,OAAI,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,GAAG;GAC5B,IAAI,MAAM;IAAC;IAAG;IAAG;IAAG;IAAE;GACtB,IAAI,MAAO,IAAI,SAAU;GACzB,IAAI,QAAS,SAAS,IAAK,IAAI,UAAW;AAC1C,OAAI,OAAQ,KAAM,OAAO,KAAO;AAChC,KAAE,KAAK,KAAK,qBAAqB,KAAK,SAAS,KAAK,EAAE,EAAE,KAAK;;AAE/D,SAAO;;;;;;;;;AAUT,OAAM,IAAI,UAAU,uBAAuB,SAAS,KAAK,MAAM;EAI7D,IAAI,OAAO,KAAK;EAChB,IAAI,OAAO,SAAS;EACpB,IAAI,IAAI,IAAI,MAAM,KAAK;AACvB,IAAE,QAAQ,IAAI,MAAM,EAAE;EACtB,IAAI,IAAI,SAAS;AACjB,SAAM,IAAI,GAAG;AAEX,QAAK,IAAI,EAAE,IAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAC7B,SAAM;;AAER,MAAI;AACJ,SAAM,IAAI,MAAM;AACd,QAAI,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;IACzB,IAAI,MAAM,EAAE;IACZ,IAAI,MAAM,EAAE;AACZ,MAAE,IAAI,KAAK;KACT,IAAI,KAAK,IAAI;KACb,IAAI,KAAK,IAAI;KACb,IAAI,KAAK,IAAI;KACb,IAAI,KAAK,IAAI;KACd;;AAEH,QAAK;;AAEP,IAAE,KAAK;GAAC;GAAG;GAAG;GAAG;GAAE;AAGnB,OAAI,IAAI,OAAO,GAAG,IAAI,MAAM,EAAE,GAAG;GAC/B,IAAI,IAAI,EAAE,IAAI;AACd,KAAE,KAAK;IAAC,IAAI,KAAK,EAAE;IAAI,IAAI,KAAK,EAAE;IAAI,IAAI,KAAK,EAAE;IAAI,IAAI,KAAK,EAAE;IAAG;;AAErE,SAAO;;;CAKT,SAAS,YAAY,IAAI,WAAW;AAClC,MAAG,OAAO,OAAO,SAEf,MAAK,MAAM,KAAK,aAAa,GAAG;AAGlC,MAAG,MAAM,KAAK,QAAQ,GAAG,IAAI,GAAG,SAAS,GAAG;GAE1C,IAAI,MAAM;AACV,QAAK,MAAM,KAAK,cAAc;AAC9B,QAAI,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,EAC/B,IAAG,QAAQ,IAAI,GAAG;;AAItB,MAAG,GAAG,QAAQ,GAAG,UACf,OAAM,IAAI,MACR,4BAA4B,GAAG,QAAQ,GACvC,yBAAyB,YAAY,UAAU;AAGnD,MAAG,CAAC,MAAM,KAAK,QAAQ,GAAG,EAAE;GAE1B,IAAI,OAAO,EAAE;GACb,IAAI,SAAS,YAAY;AACzB,QAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,EAAE,EAC3B,MAAK,KAAK,GAAG,UAAU,CAAC;AAE1B,QAAK;;AAGP,SAAO;;CAGT,SAAS,MAAM,OAAO;AAEpB,QAAM,MAAM,SAAS,KAAM,MAAM,MAAM,SAAS,KAAK,IAAK;;CAG5D,SAAS,WAAW,KAAK;AAEvB,SAAO,CAAE,MAAM,aAAe,GAAG,MAAM,WAAW"}