/*
 *  * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
 *   * in FIPS PUB 180-1
 *    * Version 2.1 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.
 *        */

/*
 *  * Configurable variables. You may need to tweak these to be compatible with
 *   * the server-side, but the defaults work in most cases.
 *    */
var hexcase = 0;   /* hex output format. 0 - lowercase; 1 - uppercase        */
var b64pad  = "="; /* base-64 pad character. "=" for strict RFC compliance   */
var 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
 *    */
function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}

/*
 *  * Perform a simple self-test to see if the VM is working
 *   */
function sha1_vm_test()
{
  return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}

/*
 *  * Calculate the SHA-1 of an array of big-endian words, and a bit length
 *   */
function core_sha1(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] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
      var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
                       safe_add(safe_add(e, w[j]), sha1_kt(j)));
      e = d;
      d = c;
      c = rol(b, 30);
      b = a;
      a = t;
    }

    a = safe_add(a, olda);
    b = safe_add(b, oldb);
    c = safe_add(c, oldc);
    d = safe_add(d, oldd);
    e = safe_add(e, olde);
  }
  return Array(a, b, c, d, e);

}

/*
 *  * 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;
}

/*
 *  * Calculate the HMAC-SHA1 of a key and some data
 *   */
function core_hmac_sha1(key, data)
{
  var bkey = str2binb(key);
  if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);

  var ipad = Array(16), opad = Array(16);
  for(var i = 0; i < 16; i++)
  {
    ipad[i] = bkey[i] ^ 0x36363636;
    opad[i] = bkey[i] ^ 0x5C5C5C5C;
  }

  var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
  return core_sha1(opad.concat(hash), 512 + 160);
}

/*
 *  * 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 rol(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.
 *    */
function str2binb(str)
{
  var bin = Array();
  var mask = (1 << chrsz) - 1;
  for(var i = 0; i < str.length * chrsz; i += chrsz)
    bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - i%32);
  return bin;
}

/*
 *  * Convert an array of big-endian words to a string
 *   */
function binb2str(bin)
{
  var str = "";
  var mask = (1 << chrsz) - 1;
  for(var i = 0; i < bin.length * 32; i += chrsz)
    str += String.fromCharCode((bin[i>>5] >>> (24 - i%32)) & mask);
  return str;
}

/*
 *  * Convert an array of big-endian words to a hex string.
 *   */
function binb2hex(binarray)
{
  var hex_tab = 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;
}

/*
 *  * Convert an array of big-endian words to a base-64 string
 *   */
function binb2b64(binarray)
{
  var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  var str = "";
  for(var i = 0; i < binarray.length * 4; i += 3)
  {
    var triplet = (((binarray[i   >> 2] >> 8 * (3 -  i   %4)) & 0xFF) << 16)
                | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
                |  ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
    for(var j = 0; j < 4; j++)
    {
      if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
      else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
    }
  }
  return str;
}

/* Copyright (C) 1999 Masanao Izumo <mo@goice.co.jp>
 *  * Version: 1.0
 *   * LastModified: Dec 25 1999
 *    * This library is free.  You can redistribute it and/or modify it.
 *     */

/*
 *  * Interfaces:
 *   * b64 = base64encode(data);
 *    * data = base64decode(b64);
 *     */

var Base64 = {
  EncodeChars: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",
  DecodeChars: new Array(
    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
    52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1,
    -1,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
    15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
    -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
    41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1
  ),

  encode: function(str) {
    var out, i, len;
    var c1, c2, c3;

    len = str.length;
    i = 0;
    out = "";
    while(i < len) {
    c1 = str.charCodeAt(i++) & 0xff;
    if(i == len)
    {
        out += Base64.EncodeChars.charAt(c1 >> 2);
        out += Base64.EncodeChars.charAt((c1 & 0x3) << 4);
        out += "==";
        break;
    }
    c2 = str.charCodeAt(i++);
    if(i == len)
    {
        out += Base64.EncodeChars.charAt(c1 >> 2);
        out += Base64.EncodeChars.charAt(((c1 & 0x3)<< 4) | ((c2 & 0xF0) >> 4));
        out += Base64.EncodeChars.charAt((c2 & 0xF) << 2);
        out += "=";
        break;
    }
    c3 = str.charCodeAt(i++);
    out += Base64.EncodeChars.charAt(c1 >> 2);
    out += Base64.EncodeChars.charAt(((c1 & 0x3)<< 4) | ((c2 & 0xF0) >> 4));
    out += Base64.EncodeChars.charAt(((c2 & 0xF) << 2) | ((c3 & 0xC0) >>6));
    out += Base64.EncodeChars.charAt(c3 & 0x3F);
    }
    return out;
  },

  decode: function(str) {
    var c1, c2, c3, c4;
    var i, len, out;

    len = str.length;
    i = 0;
    out = "";
    while(i < len) {
    /* c1 */
    do {
        c1 = Base64.DecodeChars[str.charCodeAt(i++) & 0xff];
    } while(i < len && c1 == -1);
    if(c1 == -1)
        break;

    /* c2 */
    do {
        c2 = Base64.DecodeChars[str.charCodeAt(i++) & 0xff];
    } while(i < len && c2 == -1);
    if(c2 == -1)
        break;

    out += String.fromCharCode((c1 << 2) | ((c2 & 0x30) >> 4));

    /* c3 */
    do {
        c3 = str.charCodeAt(i++) & 0xff;
        if(c3 == 61)
        return out;
        c3 = Base64.DecodeChars[c3];
    } while(i < len && c3 == -1);
    if(c3 == -1)
        break;

    out += String.fromCharCode(((c2 & 0XF) << 4) | ((c3 & 0x3C) >> 2));

    /* c4 */
    do {
        c4 = str.charCodeAt(i++) & 0xff;
        if(c4 == 61)
        return out;
        c4 = Base64.DecodeChars[c4];
    } while(i < len && c4 == -1);
    if(c4 == -1)
        break;
    out += String.fromCharCode(((c3 & 0x03) << 6) | c4);
    }
    return out;
  }
};

function Wsse(u, s, n, c)
{
    this.set = function (u, s, n, c) {
        this.setUser(u);
        this.setSecret(s);
        this.setNonce(n);
        this.setCreated(c);
    };

    this.setUser = function (u) {
        this.u = u;
    };
    this.setSecret = function (s) {
        this.s = s;
    };
    this.setNonce = function (n) {
        this.n = n;
    };
    this.setCreated = function (c) {
        this.c = c;
    };

    this.generateNonce = function () {
        var len = 24, chars  = "0123456789abcdef", nonce  = "";
        for (var i = 0; i < len; i++) {
            nonce += chars.charAt(Math.floor(Math.random() * chars.length));
        }
        return nonce;
    };

    this.generateCreated = function () {
        var date = new Date(), y, m, d, h, i, s;
        y = date.getUTCFullYear();
        m = (date.getUTCMonth() + 1); if (m < 10) { m = "0" + m; }
        d = (date.getUTCDate());      if (d < 10) { d = "0" + d; }
        h = (date.getUTCHours());     if (h < 10) { h = "0" + h; }
        i = (date.getUTCMinutes());   if (i < 10) { i = "0" + i; }
        s = (date.getUTCSeconds());   if (s < 10) { s = "0" + s; }
        return y + "-" + m + "-" + d + "T" + h + ":" + i + ":" + s + "Z";
    };

    this.encode = function () {
        var p = {};
        if (!window.b64_sha1) {
            alert("b64_sha1() was not found");
            return p;
        }
        p.u = this.u;
        p.s = this.s;
        p.n = (this.n ? this.n : this.generateNonce());
        p.c = (this.c ? this.c : this.generateCreated());
        p.d = b64_sha1(p.n + p.c + p.s);
        p.n = Base64.encode(p.n);
        return p;
    };

    this.generateRESTHeaders = function () {
        rval = "";

        var p = this.encode();

        rval = "UsernameToken";
        rval += " Username=\"" + p.u + "\",";
        rval += " PasswordDigest=\"" + p.d + "\",";
        rval += " Nonce=\"" + p.n + "\",";
        rval += " Created=\"" + p.c + "\"";

        return { 'X-WSSE': rval };
    };

    this.generateRESTQS = function () {
        var p = this.encode(), rval = "";
        rval  = "auth_digest="    + escape(p.d);
        rval += "&auth_nonce="    + escape(p.n);
        rval += "&auth_created="  + escape(p.c);
        rval += "&auth_username=" + escape(p.u);
        return rval;
    };

    this.generateSOAPHeaders = function () {
        var p = this.encode(), rval = "";

        rval  = "<wsse:Security wsse:mustUnderstand=\"1\" xmlns:wsse=\"http://www.omniture.com\">\n";
        rval += "\t<wsse:UsernameToken wsse:Id=\"User\">\n";
        rval += "\t\t<wsse:Username>" + p.u + "</wsse:Username>\n";
        rval += "\t\t\t<wsse:Password Type=\"http://docs.oasis-open.org/wss/2004/01/oasis-200401-wss-username-token-profile-1.0#PasswordDigest\">" + p.d + "</wsse:Password>\n";
        rval += "\t\t<wsse:Nonce>" + p.n + "</wsse:Nonce>\n";
        rval += "\t\t<wsse:Created>" + p.c + "</wsse:Created>\n";
        rval += "\t</wsse:UsernameToken>\n";
        rval += "</wsse:Security>\n";

        return rval;
    };

    /** Generate the auth credentials */
    this.generateAuth = function (username, secret) {
        var nonce = this.generateNonce();
        var created = this.generateCreated();

        this.set(username, secret, nonce, created);

        var headers = this.generateRESTHeaders();
        return headers;
    };

    this.set(u, s, n, c);
}
