sproutit-narwhal 0.1.106

data/lib/sha.js

@@ -0,0 +1,112 @@
+/*
+
+    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.
+
+*/
+var util = require('./util');
+var struct = require('./struct');
+
+/*** hash
+*/
+exports.hash = function (s, _characterSize) {
+    if (util.no(_characterSize)) _characterSize = struct.characterSize;
+    return struct.binb2bin(core_sha(struct.str2binb(s), s.length * _characterSize));
+};
+
+exports.hmac_sha = function (key, data, _characterSize) {
+    return struct.binb2bin(core_hmac_sha(key, data, _characterSize));
+};
+
+/* Perform a simple self-test to see if the VM is working */
+exports.test = function () {
+    assert.eq("a9993e364706816aba3e25717850c26c9cd0d89d", exports.hash("abc").toString(16));
+};
+
+/* Calculate the SHA-1 of an array of big-endian words, and a bit length */
+var core_sha = function (x, len) {
+    /* append padding */
+    x[len >> 5] |= 0x80 << (24 - len % 32);
+    x[((len + 64 >> 9) << 4) + 15] = len;
+
+    var w = [];
+    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] = struct.rolU32(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
+            var t = struct.addU32(struct.rolU32(a, 5), sha_ft(j, b, c, d), e, w[j], sha_kt(j));
+            e = d;
+            d = c;
+            c = struct.rolU32(b, 30);
+            b = a;
+            a = t;
+        }
+
+        a = struct.addU32(a, olda);
+        b = struct.addU32(b, oldb);
+        c = struct.addU32(c, oldc);
+        d = struct.addU32(d, oldd);
+        e = struct.addU32(e, olde);
+    }
+    return [a, b, c, d, e];
+
+};
+
+/*
+ * Perform the appropriate triplet combination function for the current
+ * iteration
+ */
+var sha_ft = 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
+ */
+var sha_kt = function (t) {
+    return (t < 20) ?    1518500249 : (t < 40) ?    1859775393 :
+                 (t < 60) ? -1894007588 : -899497514;
+};
+
+/*
+ * Calculate the HMAC-SHA1 of a key and some data
+ */
+var core_hmac_sha = function (key, data, _characterSize) {
+    if (util.no(_characterSize)) _characterSize = struct.characterSize;
+    var bkey = struct.str2binb(key);
+    if(bkey.length > 16) bkey = core_sha(bkey, key.length * _characterSize);
+
+    var ipad = [], opad = [];
+    for(var i = 0; i < 16; i++) {
+        ipad[i] = bkey[i] ^ 0x36363636;
+        opad[i] = bkey[i] ^ 0x5C5C5C5C;
+    }
+
+    var hash = core_sha(ipad.concat(struct.str2binb(data)), 512 + data.length * _characterSize);
+    return core_sha(opad.concat(hash), 512 + 160);
+};
+
+if (module.id == require.main) {
+    var assert = require("./test/assert");
+    require("os").exit(require("test/runner").run(exports));
+}
+    

data/lib/sha256.js

@@ -0,0 +1,102 @@
+/*file chiron src/crypt/sha256.js */
+
+var struct = require('./struct');
+var util = require('./util');
+
+/*** hash
+*/
+exports.hash = function (s, _characterSize) {
+    if (util.no(_characterSize)) _characterSize = struct.characterSize;
+    return struct.binb2bin(core(struct.str2binb(s, _characterSize), s.length * _characterSize));
+};
+
+var S  = function (X, n) { return ( X >>> n ) | (X << (32 - n)); }
+var R  = function (X, n) { return ( X >>> n ); }
+var Ch = function (x, y, z) { return ((x & y) ^ ((~x) & z)); }
+var Maj = function (x, y, z) { return ((x & y) ^ (x & z) ^ (y & z)); }
+var Sigma0256 = function (x) { return (S(x, 2) ^ S(x, 13) ^ S(x, 22)); }
+var Sigma1256 = function (x) { return (S(x, 6) ^ S(x, 11) ^ S(x, 25)); }
+var Gamma0256 = function (x) { return (S(x, 7) ^ S(x, 18) ^ R(x, 3)); }
+var Gamma1256 = function (x) { return (S(x, 17) ^ S(x, 19) ^ R(x, 10)); }
+
+var K = [
+    0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
+    0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
+    0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
+    0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
+    0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
+    0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
+    0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
+    0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
+    0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
+    0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
+    0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
+    0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
+    0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
+    0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
+    0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
+    0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2
+];
+
+var core  = function (m, l) {
+    var HASH = [
+        0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
+        0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19
+    ];
+
+    var W = [];
+    var a, b, c, d, e, f, g, h, i, j;
+    var T1, T2;
+
+    m[l >> 5] |= 0x80 << (24 - l % 32);
+    m[((l + 64 >> 9) << 4) + 15] = l;
+
+    for ( i = 0; i<m.length; i+=16 ) {
+        a = HASH[0];
+        b = HASH[1];
+        c = HASH[2];
+        d = HASH[3];
+        e = HASH[4];
+        f = HASH[5];
+        g = HASH[6];
+        h = HASH[7];
+
+        for ( j = 0; j<64; j++) {
+            if (j < 16) W[j] = m[j + i];
+            else W[j] = struct.addU32(Gamma1256(W[j - 2]), W[j - 7], Gamma0256(W[j - 15]), W[j - 16]);
+
+            T1 = struct.addU32(h, Sigma1256(e), Ch(e, f, g), K[j], W[j]);
+            T2 = struct.addU32(Sigma0256(a), Maj(a, b, c));
+
+            h = g;
+            g = f;
+            f = e;
+            e = struct.addU32(d, T1);
+            d = c;
+            c = b;
+            b = a;
+            a = struct.addU32(T1, T2);
+        }
+
+        HASH[0] = struct.addU32(a, HASH[0]);
+        HASH[1] = struct.addU32(b, HASH[1]);
+        HASH[2] = struct.addU32(c, HASH[2]);
+        HASH[3] = struct.addU32(d, HASH[3]);
+        HASH[4] = struct.addU32(e, HASH[4]);
+        HASH[5] = struct.addU32(f, HASH[5]);
+        HASH[6] = struct.addU32(g, HASH[6]);
+        HASH[7] = struct.addU32(h, HASH[7]);
+    }
+    return HASH;
+};
+
+/**
+
+    References
+    ==========
+
+    http://www.webtoolkit.info/
+    Secure Hash Algorithm (SHA256)
+
+*/
+

data/lib/struct.js

@@ -0,0 +1,228 @@
+
+var util = require("util");
+var binary = require("binary");
+
+/*** alphabet16Upper
+*/
+exports.alphabet16Upper = "0123456789ABCDEF";
+
+/*** alphabet16Lower
+*/
+exports.alphabet16Lower = "0123456789abcdef";
+
+/*** alphabet16
+    ``alphabet16Lower`` is the default hexadecimal alphabet.
+    This value can be overridden on the module
+    and function level.
+*/
+
+exports.alphabet16 = exports.alphabet16Lower;
+
+/*** alphabet36
+*/
+exports.alphabet36 = "0123456789abcdefghijklmnopqrstuvwxyz";
+
+/*** alphabet64
+*/
+exports.alphabet64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+/*** padBase64 
+    base-64 pad character. "=" for strict RFC compliance, "" for brevity
+    "=" by default.
+    This value can be overridden on the module
+    and function level.
+*/
+exports.padBase64 = "=";
+
+/*** characterSize
+    bits per input character. 8 - ASCII; 16 - Unicode
+    This value can be overridden on the module
+    and function level.
+*/
+exports.characterSize = 8; 
+
+/*** ord
+    Returns the character code ordinal (offset in the ASCII or Unicode tables)
+    for a given single character. 
+
+     - inverse: `chr`
+
+*/
+exports.ord = function (chr) {
+    return chr.charCodeAt();
+};
+
+/*** chr
+    Returns the character for a given character code ordinal (offset in the
+    ASCII or Unicode tables).
+
+     - inverse: `ord`
+
+*/
+exports.chr = function (ord) {
+    return String.fromCharCode(ord);
+};
+
+/* undocumented addU32
+    Add integers, wrapping at 2**32. This uses 16-bit operations internally
+    to work around bugs in some JavaScript interpreters.
+
+    - `variadic`
+*/
+exports.addU32 = function (/* ... */) {
+    var acc = 0;
+    for (var i = 0; i < arguments.length; i++) {
+        var x = arguments[i];
+        var lsw = (acc & 0xFFFF) + (x & 0xFFFF);
+        var msw = (acc >> 16) + (x >> 16) + (lsw >> 16);
+        acc = (msw << 16) | (lsw & 0xFFFF);
+    }
+    return acc;
+};
+
+/* undocumented rolU32
+    Bitwise rotate a 32-bit number to the left.
+*/
+exports.rolU32 = function (num, cnt) {
+    return (num << cnt) | (num >>> (32 - cnt));
+};
+
+/* undocumented str2binl
+    Convert a string to an array of little-endian words
+    If characterSize is ASCII, characters >255 have their hi-byte silently ignored.
+*/
+exports.str2binl = function (str, _characterSize) {
+    if (util.no(_characterSize))
+        _characterSize = exports.characterSize;
+    var bin = [];
+    var mask = (1 << _characterSize) - 1;
+    for (var i = 0; i < str.length * _characterSize; i += _characterSize)
+        bin[i>>5] |= (str.charCodeAt(i / _characterSize) & mask) << (i % 32);
+    return bin;
+};
+
+/* undocumented str2binb
+    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.
+*/
+exports.str2binb = function (str, _characterSize) {
+    if (util.no(_characterSize))
+        _characterSize = exports.characterSize;
+    var bin = [];
+    var mask = (1 << _characterSize) - 1;
+    for (var i = 0; i < str.length * _characterSize; i += _characterSize)
+        bin[i>>5] |= (
+            (str.charCodeAt(i / _characterSize) & mask) <<
+            (32 - _characterSize - i % 32)
+        );
+    return bin;
+};
+
+/* undocumented binl2str
+    Convert an array of little-endian words to a string
+*/
+exports.binl2str = function (bin, _characterSize) {
+    return exports.binl2bin(bin, _characterSize).decodeToString('ascii');
+};
+
+/* undocumented binl2bin
+    Convert an array of little-endian words to a string
+*/
+exports.binl2bin = function (bin, _characterSize) {
+    if (util.no(_characterSize)) 
+        _characterSize = exports.characterSize;
+    var str = [];
+    var mask = (1 << _characterSize) - 1;
+    for (var i = 0; i < bin.length * 32; i += _characterSize)
+        str.push((bin[i>>5] >>> (i % 32)) & mask);
+    return binary.ByteString(str);
+};
+
+/* undocumented binb2str
+    Convert an array of big-endian words to a string
+*/
+exports.binb2str = function (bin, _characterSize) {
+    return exports.binb2bin(bin, _characterSize).decodeToString('ascii');
+};
+
+/* undocumented binb2bin
+    Convert an array of big-endian words to a string
+*/
+exports.binb2bin = function (bin, _characterSize) {
+    if (util.no(_characterSize)) 
+        _characterSize = exports.characterSize;
+    var str = [];
+    var mask = (1 << _characterSize) - 1;
+    for (var i = 0; i < bin.length * 32; i += _characterSize)
+        str.push((bin[i>>5] >>> (32 - _characterSize - i % 32)) & mask);
+    return binary.ByteString(str);
+};
+
+/* undocumented binl2hex
+    Convert an array of little-endian words to a hex string.
+*/
+exports.binl2hex = function (binarray, _alphabet16) {
+    if (util.no(_alphabet16))
+        _alphabet16 = exports.alphabet16;
+    var str = "";
+    for (var i = 0; i < binarray.length * 4; i++) {
+        str += _alphabet16.charAt((binarray[i>>2] >> ((i % 4) * 8 + 4)) & 0xF) +
+               _alphabet16.charAt((binarray[i>>2] >> ((i % 4) * 8)) & 0xF);
+    }
+    return str;
+};
+
+/* undocumented binb2hex
+    Convert an array of big-endian words to a hex string.
+*/
+exports.binb2hex = function (binarray, _alphabet16) {
+    if (util.no(_alphabet16))
+        _alphabet16 = exports.alphabet16;
+    var str = "";
+    for (var i = 0; i < binarray.length * 4; i++) {
+        str += _alphabet16.charAt((binarray[i>>2] >> ((3 - i % 4)*8+4)) & 0xF) +
+               _alphabet16.charAt((binarray[i>>2] >> ((3 - i % 4) * 8)) & 0xF);
+    }
+    return str;
+};
+
+/* undocumented binl2base64
+    Convert an array of little-endian words to a base-64 string
+*/
+exports.binl2base64 = function (binarray) {
+    var str = "";
+    for (var i = 0; i < binarray.length * 4; i += 3) {
+        var triplet = (
+            (((binarray[i >> 2] >> 8 * (i % 4)) & 0xFF) << 16) |
+            (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8) |
+            ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF)
+        );
+        for (var j = 0; j < 4; j++) {
+            if (i * 8 + j * 6 > binarray.length * 32)
+                str += exports.padBase64;
+            else str += exports.alphabet64.charAt((triplet >> 6*(3-j)) & 0x3F);
+        }
+    }
+    return str;
+};
+
+/* undocumented binb2base64
+    Convert an array of big-endian words to a base-64 string
+*/
+exports.binb2base64 = function (binarray) {
+    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 += exports.padBase64;
+            else str += exports.alphabet64.charAt((triplet >> 6*(3-j)) & 0x3F);
+        }
+    }
+    return str;
+};
+

data/lib/term.js

@@ -0,0 +1,179 @@
+
+// reference: http://ascii-table.com/ansi-escape-sequences-vt-100.php
+
+var system = require('system');
+var util = require('util');
+
+var terms = [
+    'ansi',
+    'vt100',
+    'xterm',
+    'xtermc',
+    'xterm-color',
+    'gnome-terminal'
+];
+
+exports.Stream = function (system) {
+    var self = Object.create(system.stdout);
+    var output = system.stdout;
+    var errput = system.stderr;
+    var env = system.env || {};
+    var fore = "";
+    var back = "";
+    var bold = "0";
+    var stack = [];
+    var enabled = util.has(terms, env.TERM);
+
+    self.enable = function () {
+        enabled = true;
+    };
+
+    self.disable = function () {
+        enabled = false;
+    };
+
+    self.writeCode = function (code) {
+        if (enabled) {
+            output.flush();
+            errput.write(code).flush();
+        }
+        return self;
+    };
+
+    self.print = function () {
+        // todo recordSeparator, fieldSeparator
+        self.write(Array.prototype.join.call(arguments, " ") + "\n");
+        self.flush();
+        return self;
+    };
+
+    self.write = function (string) {
+        var at = 0;
+        self.update(bold, fore, back);
+        while (at < string.length) {
+            var pos = string.indexOf("\0", at);
+            if (pos == -1) {
+                // no additional marks, advanced to end
+                output.write(string.substring(at, string.length));
+                at = string.length;
+            } else {
+                output.write(string.substring(at, pos));
+                at = pos + 1;
+                if (string.charAt(at) == ")") {
+                    if (!stack.length)
+                        throw new Error("No colors on the stack at " + at);
+                    var pair = stack.pop();
+                    bold = pair[0];
+                    fore = pair[1];
+                    at = at + 1;
+                    self.update(bold, fore, back);
+                } else {
+                    var paren = string.indexOf("(", at);
+                    stack.push([bold, fore, back]);
+                    var command = string.substring(at, paren);
+                    if (command == "bold") {
+                        bold = "1";
+                    } else if (Object.prototype.hasOwnProperty.call(exports.colors, command)) {
+                        fore = exports.colors[command];
+                    } else if (
+                        /^:/.test(command) &&
+                        Object.prototype.hasOwnProperty.call(exports.colors, command.substring(1))
+                    ) {
+                        back = exports.colors[command.substring(1)];
+                    } else {
+                        throw new Error("No such command: " + command);
+                    }
+                    self.update(bold, fore, back);
+                    at = paren + 1;
+                }
+            }
+        }
+        self.update("0", "", "");
+        return self;
+    };
+
+    self.update = function (bold, fore, back) {
+        return self.writeCode(
+            "\033[" + [
+                bold,
+                (fore.length ? "3" + fore : ""),
+                (back.length ? "4" + back : ""),
+            ].filter(function (string) {
+                return string.length;
+            }).join(";") + "m"
+        );
+    };
+    
+    self.moveTo = function (y, x) {
+        return self.writeCode("\033[" + y + ";" + x + "H");
+    };
+
+    self.moveBy = function (y, x) {
+        if (y == 0) {
+        } else if (y < 0) {
+            self.writeCode("\033[" + (-y) + "A");
+        } else {
+            self.writeCode("\033[" + y + "B");
+        }
+        if (x == 0) {
+        } else if (x > 0) {
+            self.writeCode("\033[" + x + "C");
+        } else {
+            self.writeCode("\033[" + (-x) + "D");
+        }
+        errput.flush();
+        return self;
+    };
+
+    self.home = function () {
+        return self.writeCode("\033[H");
+    };
+
+    self.clear = function () {
+        return self.writeCode("\033[2J");
+    };
+    self.clearUp = function () {
+        return self.writeCode("\033[1J");
+    };
+    self.cearDown = function () {
+        return self.writeCode("\033[J");
+    };
+    self.clearLine = function () {
+        return self.writeCode("\033[2K");
+    };
+    self.clearLeft = function () {
+        return self.writeCode("\033[1K");
+    };
+    self.clearRight = function () {
+        return self.writeCode("\033[K");
+    };
+
+    self.update(bold, fore, back);
+
+    return self;
+};
+
+exports.colors = {
+    "black": "0",
+    "red": "1",
+    "green": "2",
+    "orange": "3",
+    "yellow": "3",
+    "blue": "4",
+    "violet": "5",
+    "magenta": "5",
+    "purple": "5",
+    "cyan": "6",
+    "white": "7"
+}
+
+exports.stream = new exports.Stream(system);
+
+if (module.id == require.main) {
+    exports.stream.print("white\0red(red\0blue(blue\0)red\0)white");
+    Object.keys(exports.colors).forEach(function (name) {
+        exports.stream.print("\0" + name + "(" + name + "\0)");
+        exports.stream.print("\0bold(\0" + name + "(" + name + "\0)\0)");
+    });
+}
+