xmppify 0.0.12

data/app/assets/javascripts/xmpp/strophejs-plugins/caps/README.markdown

@@ -0,0 +1,53 @@
+# Strophe.CAPS.js
+
+Strophe.caps.js is a plugin to provide XMPP Entity Capabilities
+( [ XEP-0115 ]( http://xmpp.org/extensions/xep-0115.html ) ).
+
+
+## Usage
+
+### Adding features
+
+    connection.caps.add( "myfeature" );
+
+### Removing features
+
+    connection.caps.remove( "myfeature" );
+
+### Sending presence
+
+    conncection.caps.pres( attrs );
+
+## Dependencies
+
+- strophe.disco.js (by François de Metz)
+- sha1.js
+
+## ToDo
+
+- write specs
+- support service discovery data forms
+
+## Authors
+
+- Markus Kohlhase
+
+# Strophe.caps.jsonly.js
+
+Strophe.caps.jsonly.js is a similar plugin as Strophe.CAPS.js but isn't developed in coffeescript. 
+In order to prevent naming conflicts, it has been renamed to this.
+
+It uses strophe.disco.js to add features etc.
+
+## Usage
+
+See [strophe.disco.js](https://github.com/metajack/strophejs-plugins/tree/master/disco) for more info.
+
+## Dependencies
+
+- strophe.disco.js (by François de Metz)
+- sha1.js
+
+## Authors
+
+- [Michael Weibel](http://github.com/mweibel)

data/app/assets/javascripts/xmpp/strophejs-plugins/caps/sha1.js

@@ -0,0 +1,202 @@
+/*
+ * 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.
+ */
+
+/*
+ * 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) << (32 - chrsz - 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] >>> (32 - chrsz - 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;
+}

data/app/assets/javascripts/xmpp/strophejs-plugins/caps/strophe.CAPS.coffee

@@ -0,0 +1,153 @@
+# This plugin is distributed under the terms of the MIT licence.
+# Please see the LICENCE file for details.
+#
+# Copyright (c) Markus Kohlhase, 2011
+
+# File: strophe.caps.js
+# A Strophe plugin for  ( http://xmpp.org/extensions/xep-0115.html )
+
+# NOTE: This plugin has following dependencies:
+#
+# - strophe.disco.js (by François de Metz)
+# - sha1.js
+
+Strophe.addConnectionPlugin 'caps', (->
+
+  conn = null
+
+  init = ( c ) ->
+    conn = c
+    Strophe.addNamespace 'CAPS', "http://jabber.org/protocol/caps"
+    if conn.disco is undefined
+      throw new Error "disco plugin required!"
+    if b64_sha1 is undefined
+      throw new Error "SHA-1 library required!"
+    conn.disco.addFeature Strophe.NS.CAPS
+    conn.disco.addFeature Strophe.NS.DISCO_INFO
+
+    # chek if there are identities
+    if conn.disco._identities.length is 0
+      conn.disco.addIdentity "client","pc", "strophejs", ""
+
+
+  addFeature = (feature) -> conn.disco.addFeature feature
+
+  removeFeature = (feature) -> conn.disco.removeFeature feature
+
+  sendPres = -> conn.send $pres().cnode( createCapsNode().tree() )
+
+  createCapsNode = ->
+
+    if conn.disco._identities.length > 0
+      node = conn.disco._identities[0].name || ""
+    else
+      node = dummyId.name
+
+    $build "c",
+      xmlns: Strophe.NS.CAPS
+      hash: "sha-1"
+      node: node
+      ver: generateVerificationString()
+
+  propertySort = (array, property) ->
+    array.sort (a,b) ->
+      if (a[property] > b[property]) then -1 else 1
+
+  generateVerificationString = ->
+
+    ## Prepare
+
+    # copy the original identities
+    ids = []
+    ids.push(i) for i in conn.disco._identities
+
+    # copy the original features
+    features = []
+    features.push(k) for k in conn.disco._features
+
+    ## Generate string
+
+    # 1. Initialize an empty string S.
+
+    S = ""
+
+    # 2. Sort the service discovery identities by category and then by type and
+    # then by xml:lang (if it exists), formatted as CATEGORY '/' [TYPE] '/' [LANG]
+    # '/' [NAME]. Note that each slash is included even if the LANG or NAME is not
+    # included (in accordance with XEP-0030, the category and type MUST be
+    # included.
+
+    propertySort( ids, "category" )
+    propertySort( ids, "type" )
+    propertySort( ids, "lang" )
+
+    # 3. For each identity, append the 'category/type/lang/name' to S, followed by
+    # the '<' character.
+
+    for key, id of ids
+      S += "#{id.category}/#{id.type}/#{id.lang}/#{id.name}<"
+
+    # 4. Sort the supported service discovery features.
+
+    features.sort()
+
+    # 5. For each feature, append the feature to S, followed by the '<' character.
+
+    for ns in features
+      S += "#{ns}<"
+
+    # 6. If the service discovery information response includes XEP-0128 data forms,
+    # sort the forms by the FORM_TYPE (i.e., by the XML character data of the
+    # <value/> element).
+
+    # not implemented yet
+
+    # 7. For each extended service discovery information form:
+
+    #  a) Append the XML character data of the FORM_TYPE field's <value/> element,
+    #     followed by the '<' character.
+
+    # not implemented yet
+
+    #  b) Sort the fields by the value of the "var" attribute.
+
+    # not implemented yet
+
+    #  c) For each field other than FORM_TYPE:
+
+    #     i.  Append the value of the "var" attribute, followed by the '<'
+    #         character.
+
+    # not implemented yet
+
+    #    ii.  Sort values by the XML character data of the <value/> element.
+
+    # not implemented yet
+
+    #   iii.  For each <value/> element, append the XML character data, followed by
+    #         the '<' character.
+
+    # not implemented yet
+
+    # 8. Ensure that S is encoded according to the UTF-8 encoding.
+
+    # not implemented yet
+
+    # 9. Compute the verification string by hashing S using the algorithm
+    # specified in the 'hash' attribute (e.g., SHA-1 as defined in RFC 3174 [19]).
+    # The hashed data MUST be generated with binary output and encoded using
+    # Base64 as specified in Section 4 of RFC 4648 [20] (note: the Base64 output
+    # MUST NOT include whitespace and MUST set padding bits to zero).
+
+    "#{b64_sha1 S}="
+
+  # Public API
+
+  init: init
+  removeFeature: removeFeature
+  addFeature: addFeature
+  sendPres: sendPres
+  generateVerificationString: generateVerificationString
+  createCapsNode: createCapsNode
+
+)()

data/app/assets/javascripts/xmpp/strophejs-plugins/caps/strophe.CAPS.js

@@ -0,0 +1,88 @@
+(function() {
+
+  Strophe.addConnectionPlugin('caps', (function() {
+    var addFeature, conn, createCapsNode, generateVerificationString, init, propertySort, removeFeature, sendPres;
+    conn = null;
+    init = function(c) {
+      conn = c;
+      Strophe.addNamespace('CAPS', "http://jabber.org/protocol/caps");
+      if (conn.disco === void 0) throw new Error("disco plugin required!");
+      if (b64_sha1 === void 0) throw new Error("SHA-1 library required!");
+      conn.disco.addFeature(Strophe.NS.CAPS);
+      conn.disco.addFeature(Strophe.NS.DISCO_INFO);
+      if (conn.disco._identities.length === 0) {
+        return conn.disco.addIdentity("client", "pc", "strophejs", "");
+      }
+    };
+    addFeature = function(feature) {
+      return conn.disco.addFeature(feature);
+    };
+    removeFeature = function(feature) {
+      return conn.disco.removeFeature(feature);
+    };
+    sendPres = function() {
+      return conn.send($pres().cnode(createCapsNode().tree()));
+    };
+    createCapsNode = function() {
+      var node;
+      if (conn.disco._identities.length > 0) {
+        node = conn.disco._identities[0].name || "";
+      } else {
+        node = dummyId.name;
+      }
+      return $build("c", {
+        xmlns: Strophe.NS.CAPS,
+        hash: "sha-1",
+        node: node,
+        ver: generateVerificationString()
+      });
+    };
+    propertySort = function(array, property) {
+      return array.sort(function(a, b) {
+        if (a[property] > b[property]) {
+          return -1;
+        } else {
+          return 1;
+        }
+      });
+    };
+    generateVerificationString = function() {
+      var S, features, i, id, ids, k, key, ns, _i, _j, _k, _len, _len2, _len3, _ref, _ref2;
+      ids = [];
+      _ref = conn.disco._identities;
+      for (_i = 0, _len = _ref.length; _i < _len; _i++) {
+        i = _ref[_i];
+        ids.push(i);
+      }
+      features = [];
+      _ref2 = conn.disco._features;
+      for (_j = 0, _len2 = _ref2.length; _j < _len2; _j++) {
+        k = _ref2[_j];
+        features.push(k);
+      }
+      S = "";
+      propertySort(ids, "category");
+      propertySort(ids, "type");
+      propertySort(ids, "lang");
+      for (key in ids) {
+        id = ids[key];
+        S += "" + id.category + "/" + id.type + "/" + id.lang + "/" + id.name + "<";
+      }
+      features.sort();
+      for (_k = 0, _len3 = features.length; _k < _len3; _k++) {
+        ns = features[_k];
+        S += "" + ns + "<";
+      }
+      return "" + (b64_sha1(S)) + "=";
+    };
+    return {
+      init: init,
+      removeFeature: removeFeature,
+      addFeature: addFeature,
+      sendPres: sendPres,
+      generateVerificationString: generateVerificationString,
+      createCapsNode: createCapsNode
+    };
+  })());
+
+}).call(this);