pi-codex-auto-review 0.1.2 → 0.1.4

package/node_modules/node-forge/lib/md5.js

@@ -1,289 +0,0 @@
-/**
- * Message Digest Algorithm 5 with 128-bit digest (MD5) implementation.
- *
- * @author Dave Longley
- *
- * Copyright (c) 2010-2014 Digital Bazaar, Inc.
- */
-var forge = require('./forge');
-require('./md');
-require('./util');
-
-var md5 = module.exports = forge.md5 = forge.md5 || {};
-forge.md.md5 = forge.md.algorithms.md5 = md5;
-
-/**
- * Creates an MD5 message digest object.
- *
- * @return a message digest object.
- */
-md5.create = function() {
-  // do initialization as necessary
-  if(!_initialized) {
-    _init();
-  }
-
-  // MD5 state contains four 32-bit integers
-  var _state = null;
-
-  // input buffer
-  var _input = forge.util.createBuffer();
-
-  // used for word storage
-  var _w = new Array(16);
-
-  // message digest object
-  var md = {
-    algorithm: 'md5',
-    blockLength: 64,
-    digestLength: 16,
-    // 56-bit length of message so far (does not including padding)
-    messageLength: 0,
-    // true message length
-    fullMessageLength: null,
-    // size of message length in bytes
-    messageLengthSize: 8
-  };
-
-  /**
-   * Starts the digest.
-   *
-   * @return this digest object.
-   */
-  md.start = function() {
-    // up to 56-bit message length for convenience
-    md.messageLength = 0;
-
-    // full message length (set md.messageLength64 for backwards-compatibility)
-    md.fullMessageLength = md.messageLength64 = [];
-    var int32s = md.messageLengthSize / 4;
-    for(var i = 0; i < int32s; ++i) {
-      md.fullMessageLength.push(0);
-    }
-    _input = forge.util.createBuffer();
-    _state = {
-      h0: 0x67452301,
-      h1: 0xEFCDAB89,
-      h2: 0x98BADCFE,
-      h3: 0x10325476
-    };
-    return md;
-  };
-  // start digest automatically for first time
-  md.start();
-
-  /**
-   * Updates the digest with the given message input. The given input can
-   * treated as raw input (no encoding will be applied) or an encoding of
-   * 'utf8' maybe given to encode the input using UTF-8.
-   *
-   * @param msg the message input to update with.
-   * @param encoding the encoding to use (default: 'raw', other: 'utf8').
-   *
-   * @return this digest object.
-   */
-  md.update = function(msg, encoding) {
-    if(encoding === 'utf8') {
-      msg = forge.util.encodeUtf8(msg);
-    }
-
-    // update message length
-    var len = msg.length;
-    md.messageLength += len;
-    len = [(len / 0x100000000) >>> 0, len >>> 0];
-    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
-      md.fullMessageLength[i] += len[1];
-      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);
-      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
-      len[0] = (len[1] / 0x100000000) >>> 0;
-    }
-
-    // add bytes to input buffer
-    _input.putBytes(msg);
-
-    // process bytes
-    _update(_state, _w, _input);
-
-    // compact input buffer every 2K or if empty
-    if(_input.read > 2048 || _input.length() === 0) {
-      _input.compact();
-    }
-
-    return md;
-  };
-
-  /**
-   * Produces the digest.
-   *
-   * @return a byte buffer containing the digest value.
-   */
-  md.digest = function() {
-    /* Note: Here we copy the remaining bytes in the input buffer and
-    add the appropriate MD5 padding. Then we do the final update
-    on a copy of the state so that if the user wants to get
-    intermediate digests they can do so. */
-
-    /* Determine the number of bytes that must be added to the message
-    to ensure its length is congruent to 448 mod 512. In other words,
-    the data to be digested must be a multiple of 512 bits (or 128 bytes).
-    This data includes the message, some padding, and the length of the
-    message. Since the length of the message will be encoded as 8 bytes (64
-    bits), that means that the last segment of the data must have 56 bytes
-    (448 bits) of message and padding. Therefore, the length of the message
-    plus the padding must be congruent to 448 mod 512 because
-    512 - 128 = 448.
-
-    In order to fill up the message length it must be filled with
-    padding that begins with 1 bit followed by all 0 bits. Padding
-    must *always* be present, so if the message length is already
-    congruent to 448 mod 512, then 512 padding bits must be added. */
-
-    var finalBlock = forge.util.createBuffer();
-    finalBlock.putBytes(_input.bytes());
-
-    // compute remaining size to be digested (include message length size)
-    var remaining = (
-      md.fullMessageLength[md.fullMessageLength.length - 1] +
-      md.messageLengthSize);
-
-    // add padding for overflow blockSize - overflow
-    // _padding starts with 1 byte with first bit is set (byte value 128), then
-    // there may be up to (blockSize - 1) other pad bytes
-    var overflow = remaining & (md.blockLength - 1);
-    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));
-
-    // serialize message length in bits in little-endian order; since length
-    // is stored in bytes we multiply by 8 and add carry
-    var bits, carry = 0;
-    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {
-      bits = md.fullMessageLength[i] * 8 + carry;
-      carry = (bits / 0x100000000) >>> 0;
-      finalBlock.putInt32Le(bits >>> 0);
-    }
-
-    var s2 = {
-      h0: _state.h0,
-      h1: _state.h1,
-      h2: _state.h2,
-      h3: _state.h3
-    };
-    _update(s2, _w, finalBlock);
-    var rval = forge.util.createBuffer();
-    rval.putInt32Le(s2.h0);
-    rval.putInt32Le(s2.h1);
-    rval.putInt32Le(s2.h2);
-    rval.putInt32Le(s2.h3);
-    return rval;
-  };
-
-  return md;
-};
-
-// padding, constant tables for calculating md5
-var _padding = null;
-var _g = null;
-var _r = null;
-var _k = null;
-var _initialized = false;
-
-/**
- * Initializes the constant tables.
- */
-function _init() {
-  // create padding
-  _padding = String.fromCharCode(128);
-  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);
-
-  // g values
-  _g = [
-    0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
-    1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12,
-    5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2,
-    0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9];
-
-  // rounds table
-  _r = [
-    7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,
-    5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,
-    4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,
-    6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21];
-
-  // get the result of abs(sin(i + 1)) as a 32-bit integer
-  _k = new Array(64);
-  for(var i = 0; i < 64; ++i) {
-    _k[i] = Math.floor(Math.abs(Math.sin(i + 1)) * 0x100000000);
-  }
-
-  // now initialized
-  _initialized = true;
-}
-
-/**
- * Updates an MD5 state with the given byte buffer.
- *
- * @param s the MD5 state to update.
- * @param w the array to use to store words.
- * @param bytes the byte buffer to update with.
- */
-function _update(s, w, bytes) {
-  // consume 512 bit (64 byte) chunks
-  var t, a, b, c, d, f, r, i;
-  var len = bytes.length();
-  while(len >= 64) {
-    // initialize hash value for this chunk
-    a = s.h0;
-    b = s.h1;
-    c = s.h2;
-    d = s.h3;
-
-    // round 1
-    for(i = 0; i < 16; ++i) {
-      w[i] = bytes.getInt32Le();
-      f = d ^ (b & (c ^ d));
-      t = (a + f + _k[i] + w[i]);
-      r = _r[i];
-      a = d;
-      d = c;
-      c = b;
-      b += (t << r) | (t >>> (32 - r));
-    }
-    // round 2
-    for(; i < 32; ++i) {
-      f = c ^ (d & (b ^ c));
-      t = (a + f + _k[i] + w[_g[i]]);
-      r = _r[i];
-      a = d;
-      d = c;
-      c = b;
-      b += (t << r) | (t >>> (32 - r));
-    }
-    // round 3
-    for(; i < 48; ++i) {
-      f = b ^ c ^ d;
-      t = (a + f + _k[i] + w[_g[i]]);
-      r = _r[i];
-      a = d;
-      d = c;
-      c = b;
-      b += (t << r) | (t >>> (32 - r));
-    }
-    // round 4
-    for(; i < 64; ++i) {
-      f = c ^ (b | ~d);
-      t = (a + f + _k[i] + w[_g[i]]);
-      r = _r[i];
-      a = d;
-      d = c;
-      c = b;
-      b += (t << r) | (t >>> (32 - r));
-    }
-
-    // update hash state
-    s.h0 = (s.h0 + a) | 0;
-    s.h1 = (s.h1 + b) | 0;
-    s.h2 = (s.h2 + c) | 0;
-    s.h3 = (s.h3 + d) | 0;
-
-    len -= 64;
-  }
-}

package/node_modules/node-forge/lib/mgf.js

@@ -1,12 +0,0 @@
-/**
- * Node.js module for Forge mask generation functions.
- *
- * @author Stefan Siegl
- *
- * Copyright 2012 Stefan Siegl <stesie@brokenpipe.de>
- */
-var forge = require('./forge');
-require('./mgf1');
-
-module.exports = forge.mgf = forge.mgf || {};
-forge.mgf.mgf1 = forge.mgf1;

package/node_modules/node-forge/lib/mgf1.js

@@ -1,57 +0,0 @@
-/**
- * Javascript implementation of mask generation function MGF1.
- *
- * @author Stefan Siegl
- * @author Dave Longley
- *
- * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
- * Copyright (c) 2014 Digital Bazaar, Inc.
- */
-var forge = require('./forge');
-require('./util');
-
-forge.mgf = forge.mgf || {};
-var mgf1 = module.exports = forge.mgf.mgf1 = forge.mgf1 = forge.mgf1 || {};
-
-/**
- * Creates a MGF1 mask generation function object.
- *
- * @param md the message digest API to use (eg: forge.md.sha1.create()).
- *
- * @return a mask generation function object.
- */
-mgf1.create = function(md) {
-  var mgf = {
-    /**
-     * Generate mask of specified length.
-     *
-     * @param {String} seed The seed for mask generation.
-     * @param maskLen Number of bytes to generate.
-     * @return {String} The generated mask.
-     */
-    generate: function(seed, maskLen) {
-      /* 2. Let T be the empty octet string. */
-      var t = new forge.util.ByteBuffer();
-
-      /* 3. For counter from 0 to ceil(maskLen / hLen), do the following: */
-      var len = Math.ceil(maskLen / md.digestLength);
-      for(var i = 0; i < len; i++) {
-        /* a. Convert counter to an octet string C of length 4 octets */
-        var c = new forge.util.ByteBuffer();
-        c.putInt32(i);
-
-        /* b. Concatenate the hash of the seed mgfSeed and C to the octet
-         * string T: */
-        md.start();
-        md.update(seed + c.getBytes());
-        t.putBuffer(md.digest());
-      }
-
-      /* Output the leading maskLen octets of T as the octet string mask. */
-      t.truncate(t.length() - maskLen);
-      return t.getBytes();
-    }
-  };
-
-  return mgf;
-};

package/node_modules/node-forge/lib/oids.js

@@ -1,180 +0,0 @@
-/**
- * Object IDs for ASN.1.
- *
- * @author Dave Longley
- *
- * Copyright (c) 2010-2013 Digital Bazaar, Inc.
- */
-var forge = require('./forge');
-
-forge.pki = forge.pki || {};
-var oids = module.exports = forge.pki.oids = forge.oids = forge.oids || {};
-
-// set id to name mapping and name to id mapping
-function _IN(id, name) {
-  oids[id] = name;
-  oids[name] = id;
-}
-// set id to name mapping only
-function _I_(id, name) {
-  oids[id] = name;
-}
-
-// algorithm OIDs
-_IN('1.2.840.113549.1.1.1', 'rsaEncryption');
-// Note: md2 & md4 not implemented
-//_IN('1.2.840.113549.1.1.2', 'md2WithRSAEncryption');
-//_IN('1.2.840.113549.1.1.3', 'md4WithRSAEncryption');
-_IN('1.2.840.113549.1.1.4', 'md5WithRSAEncryption');
-_IN('1.2.840.113549.1.1.5', 'sha1WithRSAEncryption');
-_IN('1.2.840.113549.1.1.7', 'RSAES-OAEP');
-_IN('1.2.840.113549.1.1.8', 'mgf1');
-_IN('1.2.840.113549.1.1.9', 'pSpecified');
-_IN('1.2.840.113549.1.1.10', 'RSASSA-PSS');
-_IN('1.2.840.113549.1.1.11', 'sha256WithRSAEncryption');
-_IN('1.2.840.113549.1.1.12', 'sha384WithRSAEncryption');
-_IN('1.2.840.113549.1.1.13', 'sha512WithRSAEncryption');
-// Edwards-curve Digital Signature Algorithm (EdDSA) Ed25519
-_IN('1.3.101.112', 'EdDSA25519');
-
-_IN('1.2.840.10040.4.3', 'dsa-with-sha1');
-
-_IN('1.3.14.3.2.7', 'desCBC');
-
-_IN('1.3.14.3.2.26', 'sha1');
-// Deprecated equivalent of sha1WithRSAEncryption
-_IN('1.3.14.3.2.29', 'sha1WithRSASignature');
-_IN('2.16.840.1.101.3.4.2.1', 'sha256');
-_IN('2.16.840.1.101.3.4.2.2', 'sha384');
-_IN('2.16.840.1.101.3.4.2.3', 'sha512');
-_IN('2.16.840.1.101.3.4.2.4', 'sha224');
-_IN('2.16.840.1.101.3.4.2.5', 'sha512-224');
-_IN('2.16.840.1.101.3.4.2.6', 'sha512-256');
-_IN('1.2.840.113549.2.2', 'md2');
-_IN('1.2.840.113549.2.5', 'md5');
-
-// pkcs#7 content types
-_IN('1.2.840.113549.1.7.1', 'data');
-_IN('1.2.840.113549.1.7.2', 'signedData');
-_IN('1.2.840.113549.1.7.3', 'envelopedData');
-_IN('1.2.840.113549.1.7.4', 'signedAndEnvelopedData');
-_IN('1.2.840.113549.1.7.5', 'digestedData');
-_IN('1.2.840.113549.1.7.6', 'encryptedData');
-
-// pkcs#9 oids
-_IN('1.2.840.113549.1.9.1', 'emailAddress');
-_IN('1.2.840.113549.1.9.2', 'unstructuredName');
-_IN('1.2.840.113549.1.9.3', 'contentType');
-_IN('1.2.840.113549.1.9.4', 'messageDigest');
-_IN('1.2.840.113549.1.9.5', 'signingTime');
-_IN('1.2.840.113549.1.9.6', 'counterSignature');
-_IN('1.2.840.113549.1.9.7', 'challengePassword');
-_IN('1.2.840.113549.1.9.8', 'unstructuredAddress');
-_IN('1.2.840.113549.1.9.14', 'extensionRequest');
-
-_IN('1.2.840.113549.1.9.20', 'friendlyName');
-_IN('1.2.840.113549.1.9.21', 'localKeyId');
-_IN('1.2.840.113549.1.9.22.1', 'x509Certificate');
-
-// pkcs#12 safe bags
-_IN('1.2.840.113549.1.12.10.1.1', 'keyBag');
-_IN('1.2.840.113549.1.12.10.1.2', 'pkcs8ShroudedKeyBag');
-_IN('1.2.840.113549.1.12.10.1.3', 'certBag');
-_IN('1.2.840.113549.1.12.10.1.4', 'crlBag');
-_IN('1.2.840.113549.1.12.10.1.5', 'secretBag');
-_IN('1.2.840.113549.1.12.10.1.6', 'safeContentsBag');
-
-// password-based-encryption for pkcs#12
-_IN('1.2.840.113549.1.5.13', 'pkcs5PBES2');
-_IN('1.2.840.113549.1.5.12', 'pkcs5PBKDF2');
-
-_IN('1.2.840.113549.1.12.1.1', 'pbeWithSHAAnd128BitRC4');
-_IN('1.2.840.113549.1.12.1.2', 'pbeWithSHAAnd40BitRC4');
-_IN('1.2.840.113549.1.12.1.3', 'pbeWithSHAAnd3-KeyTripleDES-CBC');
-_IN('1.2.840.113549.1.12.1.4', 'pbeWithSHAAnd2-KeyTripleDES-CBC');
-_IN('1.2.840.113549.1.12.1.5', 'pbeWithSHAAnd128BitRC2-CBC');
-_IN('1.2.840.113549.1.12.1.6', 'pbewithSHAAnd40BitRC2-CBC');
-
-// hmac OIDs
-_IN('1.2.840.113549.2.7', 'hmacWithSHA1');
-_IN('1.2.840.113549.2.8', 'hmacWithSHA224');
-_IN('1.2.840.113549.2.9', 'hmacWithSHA256');
-_IN('1.2.840.113549.2.10', 'hmacWithSHA384');
-_IN('1.2.840.113549.2.11', 'hmacWithSHA512');
-
-// symmetric key algorithm oids
-_IN('1.2.840.113549.3.7', 'des-EDE3-CBC');
-_IN('2.16.840.1.101.3.4.1.2', 'aes128-CBC');
-_IN('2.16.840.1.101.3.4.1.22', 'aes192-CBC');
-_IN('2.16.840.1.101.3.4.1.42', 'aes256-CBC');
-
-// certificate issuer/subject OIDs
-_IN('2.5.4.3', 'commonName');
-_IN('2.5.4.4', 'surname');
-_IN('2.5.4.5', 'serialNumber');
-_IN('2.5.4.6', 'countryName');
-_IN('2.5.4.7', 'localityName');
-_IN('2.5.4.8', 'stateOrProvinceName');
-_IN('2.5.4.9', 'streetAddress');
-_IN('2.5.4.10', 'organizationName');
-_IN('2.5.4.11', 'organizationalUnitName');
-_IN('2.5.4.12', 'title');
-_IN('2.5.4.13', 'description');
-_IN('2.5.4.15', 'businessCategory');
-_IN('2.5.4.17', 'postalCode');
-_IN('2.5.4.42', 'givenName');
-_IN('2.5.4.65', 'pseudonym');
-_IN('1.3.6.1.4.1.311.60.2.1.2', 'jurisdictionOfIncorporationStateOrProvinceName');
-_IN('1.3.6.1.4.1.311.60.2.1.3', 'jurisdictionOfIncorporationCountryName');
-
-// X.509 extension OIDs
-_IN('2.16.840.1.113730.1.1', 'nsCertType');
-_IN('2.16.840.1.113730.1.13', 'nsComment'); // deprecated in theory; still widely used
-_I_('2.5.29.1', 'authorityKeyIdentifier'); // deprecated, use .35
-_I_('2.5.29.2', 'keyAttributes'); // obsolete use .37 or .15
-_I_('2.5.29.3', 'certificatePolicies'); // deprecated, use .32
-_I_('2.5.29.4', 'keyUsageRestriction'); // obsolete use .37 or .15
-_I_('2.5.29.5', 'policyMapping'); // deprecated use .33
-_I_('2.5.29.6', 'subtreesConstraint'); // obsolete use .30
-_I_('2.5.29.7', 'subjectAltName'); // deprecated use .17
-_I_('2.5.29.8', 'issuerAltName'); // deprecated use .18
-_I_('2.5.29.9', 'subjectDirectoryAttributes');
-_I_('2.5.29.10', 'basicConstraints'); // deprecated use .19
-_I_('2.5.29.11', 'nameConstraints'); // deprecated use .30
-_I_('2.5.29.12', 'policyConstraints'); // deprecated use .36
-_I_('2.5.29.13', 'basicConstraints'); // deprecated use .19
-_IN('2.5.29.14', 'subjectKeyIdentifier');
-_IN('2.5.29.15', 'keyUsage');
-_I_('2.5.29.16', 'privateKeyUsagePeriod');
-_IN('2.5.29.17', 'subjectAltName');
-_IN('2.5.29.18', 'issuerAltName');
-_IN('2.5.29.19', 'basicConstraints');
-_I_('2.5.29.20', 'cRLNumber');
-_I_('2.5.29.21', 'cRLReason');
-_I_('2.5.29.22', 'expirationDate');
-_I_('2.5.29.23', 'instructionCode');
-_I_('2.5.29.24', 'invalidityDate');
-_I_('2.5.29.25', 'cRLDistributionPoints'); // deprecated use .31
-_I_('2.5.29.26', 'issuingDistributionPoint'); // deprecated use .28
-_I_('2.5.29.27', 'deltaCRLIndicator');
-_I_('2.5.29.28', 'issuingDistributionPoint');
-_I_('2.5.29.29', 'certificateIssuer');
-_I_('2.5.29.30', 'nameConstraints');
-_IN('2.5.29.31', 'cRLDistributionPoints');
-_IN('2.5.29.32', 'certificatePolicies');
-_I_('2.5.29.33', 'policyMappings');
-_I_('2.5.29.34', 'policyConstraints'); // deprecated use .36
-_IN('2.5.29.35', 'authorityKeyIdentifier');
-_I_('2.5.29.36', 'policyConstraints');
-_IN('2.5.29.37', 'extKeyUsage');
-_I_('2.5.29.46', 'freshestCRL');
-_I_('2.5.29.54', 'inhibitAnyPolicy');
-
-// extKeyUsage purposes
-_IN('1.3.6.1.4.1.11129.2.4.2', 'timestampList');
-_IN('1.3.6.1.5.5.7.1.1', 'authorityInfoAccess');
-_IN('1.3.6.1.5.5.7.3.1', 'serverAuth');
-_IN('1.3.6.1.5.5.7.3.2', 'clientAuth');
-_IN('1.3.6.1.5.5.7.3.3', 'codeSigning');
-_IN('1.3.6.1.5.5.7.3.4', 'emailProtection');
-_IN('1.3.6.1.5.5.7.3.8', 'timeStamping');