/*
 * 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.
 */

/*
 * Injection into He.Application
 * We only need HexSha1 so dump other code ...
*/
He.Bootstrap('Framework.Sha1');

/*
 * Configurable variables. You may need to tweak these to be compatible with
 * the server-side, but the defaults work in most cases.
 */
He.Framework.Sha1.hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
He.Framework.Sha1.chrsz   = 8;  /* bits per input character. 8 - ASCII; 16 - Unicode      */

/*
 * These are the functions you'll usually want to call
 * They take string arguments and return either hex or base-64 encoded strings
 */
He.Framework.Sha1.HexSha1 = function(s){return He.Framework.Sha1.Binb2Hex(He.Framework.Sha1.CoreSha1(He.Framework.Sha1.Str2Binb(s),s.length * He.Framework.Sha1.chrsz));}

/*
 * Perform a simple self-test to see if the VM is working
 */
He.Framework.Sha1.Sha1TmTest = function()
{
  return He.Framework.Sha1.HexSha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}

/*
 * Calculate the SHA-1 of an array of big-endian words, and a bit length
 */
He.Framework.Sha1.CoreSha1 = function(x, len)
{
  /* append padding */
  x[len >> 5] |= 0x80 << (24 - len % 32);
  x[((len + 64 >> 9) << 4) + 15] = len;

  var w = Array(80);
  var a =  1732584193;
  var b = -271733879;
  var c = -1732584194;
  var d =  271733878;
  var e = -1009589776;

  for(var i = 0; i < x.length; i += 16)
  {
    var olda = a;
    var oldb = b;
    var oldc = c;
    var oldd = d;
    var olde = e;

    for(var j = 0; j < 80; j++)
    {
      if(j < 16) w[j] = x[i + j];
      else w[j] = He.Framework.Sha1.Rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
      var t = He.Framework.Sha1.SafeAdd(He.Framework.Sha1.SafeAdd(He.Framework.Sha1.Rol(a, 5), He.Framework.Sha1.Sha1Ft(j, b, c, d)),
                       He.Framework.Sha1.SafeAdd(He.Framework.Sha1.SafeAdd(e, w[j]), He.Framework.Sha1.Sha1Kt(j)));
      e = d;
      d = c;
      c = He.Framework.Sha1.Rol(b, 30);
      b = a;
      a = t;
    }

    a = He.Framework.Sha1.SafeAdd(a, olda);
    b = He.Framework.Sha1.SafeAdd(b, oldb);
    c = He.Framework.Sha1.SafeAdd(c, oldc);
    d = He.Framework.Sha1.SafeAdd(d, oldd);
    e = He.Framework.Sha1.SafeAdd(e, olde);
  }
  return Array(a, b, c, d, e);

}

/*
 * Perform the appropriate triplet combination function for the current
 * iteration
 */
He.Framework.Sha1.Sha1Ft = function(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
 */
He.Framework.Sha1.Sha1Kt = function(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.
 */
He.Framework.Sha1.SafeAdd = function(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.
 */
He.Framework.Sha1.Rol = function(num, cnt)
{
  return (num << cnt) | (num >>> (32 - cnt));
}

/*
 * Convert an 8-bit or 16-bit string to an array of big-endian words
 * In 8-bit function, characters >255 have their hi-byte silently ignored.
 */
He.Framework.Sha1.Str2Binb = function(str)
{
  var bin = Array();
  var mask = (1 << He.Framework.Sha1.chrsz) - 1;
  for(var i = 0; i < str.length * He.Framework.Sha1.chrsz; i += He.Framework.Sha1.chrsz)
    bin[i>>5] |= (str.charCodeAt(i / He.Framework.Sha1.chrsz) & mask) << (32 - He.Framework.Sha1.chrsz - i%32);
  return bin;
}

/*
 * Convert an array of big-endian words to a hex string.
 */
He.Framework.Sha1.Binb2Hex = function(binarray)
{
  var hex_tab = He.Framework.Sha1.hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  var str = "";
  for(var i = 0; i < binarray.length * 4; i++)
  {
    str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
           hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8  )) & 0xF);
  }
  return str;
}