npm - bfg-common - Versions diffs - 1.3.423 → 1.3.424 - Mend

bfg-common 1.3.423 → 1.3.424

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (866) hide show

package/public/spice-console/lib/rng.js CHANGED Viewed

@@ -1,87 +1,87 @@
-/*
-    Copyright (c) 2016 eyeOS
-    This file is part of Open365.
-    Open365 is free software: you can redistribute it and/or modify
-    it under the terms of the GNU Affero General Public License as
-    published by the Free Software Foundation, either version 3 of the
-    License, or (at your option) any later version.
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Affero General Public License for more details.
-    You should have received a copy of the GNU Affero General Public License
-    along with this program. If not, see <http://www.gnu.org/licenses/>.
-*/
-// Random number generator - requires a PRNG backend, e.g. prng4.js
-// For best results, put code like
-// <body onClick='rng_seed_time();' onKeyPress='rng_seed_time();'>
-// in your main HTML document.
-var rng_state;
-var rng_pool;
-var rng_pptr;
-// Mix in a 32-bit integer into the pool
-function rng_seed_int(x) {
-  rng_pool[rng_pptr++] ^= x & 255;
-  rng_pool[rng_pptr++] ^= (x >> 8) & 255;
-  rng_pool[rng_pptr++] ^= (x >> 16) & 255;
-  rng_pool[rng_pptr++] ^= (x >> 24) & 255;
-  if(rng_pptr >= rng_psize) rng_pptr -= rng_psize;
-}
-// Mix in the current time (w/milliseconds) into the pool
-function rng_seed_time() {
-  rng_seed_int(new Date().getTime());
-}
-// Initialize the pool with junk if needed.
-if(rng_pool == null) {
-  rng_pool = new Array();
-  rng_pptr = 0;
-  var t;
-  if(navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {
-    // Extract entropy (256 bits) from NS4 RNG if available
-    var z = window.crypto.random(32);
-    for(t = 0; t < z.length; ++t)
-      rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;
-  }
-  while(rng_pptr < rng_psize) {  // extract some randomness from Math.random()
-    t = Math.floor(65536 * Math.random());
-    rng_pool[rng_pptr++] = t >>> 8;
-    rng_pool[rng_pptr++] = t & 255;
-  }
-  rng_pptr = 0;
-  rng_seed_time();
-  //rng_seed_int(window.screenX);
-  //rng_seed_int(window.screenY);
-}
-function rng_get_byte() {
-  if(rng_state == null) {
-    rng_seed_time();
-    rng_state = prng_newstate();
-    rng_state.init(rng_pool);
-    for(rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)
-      rng_pool[rng_pptr] = 0;
-    rng_pptr = 0;
-    //rng_pool = null;
-  }
-  // TODO: allow reseeding after first request
-  return rng_state.next();
-}
-function rng_get_bytes(ba) {
-  var i;
-  for(i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();
-}
-function SecureRandom() {}
-SecureRandom.prototype.nextBytes = rng_get_bytes;
+/*
+    Copyright (c) 2016 eyeOS
+    This file is part of Open365.
+    Open365 is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as
+    published by the Free Software Foundation, either version 3 of the
+    License, or (at your option) any later version.
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+    You should have received a copy of the GNU Affero General Public License
+    along with this program. If not, see <http://www.gnu.org/licenses/>.
+*/
+// Random number generator - requires a PRNG backend, e.g. prng4.js
+// For best results, put code like
+// <body onClick='rng_seed_time();' onKeyPress='rng_seed_time();'>
+// in your main HTML document.
+var rng_state;
+var rng_pool;
+var rng_pptr;
+// Mix in a 32-bit integer into the pool
+function rng_seed_int(x) {
+  rng_pool[rng_pptr++] ^= x & 255;
+  rng_pool[rng_pptr++] ^= (x >> 8) & 255;
+  rng_pool[rng_pptr++] ^= (x >> 16) & 255;
+  rng_pool[rng_pptr++] ^= (x >> 24) & 255;
+  if(rng_pptr >= rng_psize) rng_pptr -= rng_psize;
+}
+// Mix in the current time (w/milliseconds) into the pool
+function rng_seed_time() {
+  rng_seed_int(new Date().getTime());
+}
+// Initialize the pool with junk if needed.
+if(rng_pool == null) {
+  rng_pool = new Array();
+  rng_pptr = 0;
+  var t;
+  if(navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {
+    // Extract entropy (256 bits) from NS4 RNG if available
+    var z = window.crypto.random(32);
+    for(t = 0; t < z.length; ++t)
+      rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;
+  }
+  while(rng_pptr < rng_psize) {  // extract some randomness from Math.random()
+    t = Math.floor(65536 * Math.random());
+    rng_pool[rng_pptr++] = t >>> 8;
+    rng_pool[rng_pptr++] = t & 255;
+  }
+  rng_pptr = 0;
+  rng_seed_time();
+  //rng_seed_int(window.screenX);
+  //rng_seed_int(window.screenY);
+}
+function rng_get_byte() {
+  if(rng_state == null) {
+    rng_seed_time();
+    rng_state = prng_newstate();
+    rng_state.init(rng_pool);
+    for(rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)
+      rng_pool[rng_pptr] = 0;
+    rng_pptr = 0;
+    //rng_pool = null;
+  }
+  // TODO: allow reseeding after first request
+  return rng_state.next();
+}
+function rng_get_bytes(ba) {
+  var i;
+  for(i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();
+}
+function SecureRandom() {}
+SecureRandom.prototype.nextBytes = rng_get_bytes;

package/public/spice-console/lib/runqueue.js CHANGED Viewed

@@ -1,103 +1,103 @@
-/*
-    Copyright (c) 2016 eyeOS
-    This file is part of Open365.
-    Open365 is free software: you can redistribute it and/or modify
-    it under the terms of the GNU Affero General Public License as
-    published by the Free Software Foundation, either version 3 of the
-    License, or (at your option) any later version.
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Affero General Public License for more details.
-    You should have received a copy of the GNU Affero General Public License
-    along with this program. If not, see <http://www.gnu.org/licenses/>.
-*/
-wdi.RunQueue = $.spcExtend(wdi.DomainObject, {
-	tasks: null,
-	isRunning: false,
-	init: function() {
-		this.tasks = [];
-	},
-	getTasksLength: function() {
-		return this.tasks.length;
-	},
-	add: function(fn, scope, endCallback, params) {
-		this.tasks.push({
-			fn: fn,
-			scope: scope,
-            fnFinish: endCallback,
-            params: params
-		});
-		return this;
-	},
-	clear: function() {
-		wdi.Debug.log('runqueue clear');
-		this.tasks = [];
-		return this;
-	},
-	_process: function() {
-		wdi.ExecutionControl.sync = true;
-		var proxy, self = this;
-		this.isRunning = true;
-		var task = this.tasks.shift();
-		if (!task) {
-			this.isRunning = false;
-			return;
-		}
-		proxy = {
-			end: function() {
-                if(task.fnFinish) {
-                    task.fnFinish.call(task.scope);
-                }
-				self._process();
-			}
-		};
-		try {
-			task.fn.call(task.scope, proxy, task.params);
-		} catch(e) {
-			wdi.Debug.error(e.message);
-			proxy.end();
-		}
-		return this;
-	},
-	process: function() {
-		if (!this.isRunning) {
-			this._process();
-		} else {
-			return;
-		}
-	}
-});
-//wdi.ExecutionControl = $.spcExtend(wdi.DomainObject, {
-//	currentProxy: null,
-//	sync: true,
-//	runQ: null,
-//	init: function(c) {
-//		this.runQ = c.runQ || new wdi.RunQueue();
-//	}
-//});
-//TODO: make an instance of it on each channel
-wdi.ExecutionControl = {
-	currentProxy: null,
-	sync: true,
-	runQ: new wdi.RunQueue()
-};
+/*
+    Copyright (c) 2016 eyeOS
+    This file is part of Open365.
+    Open365 is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as
+    published by the Free Software Foundation, either version 3 of the
+    License, or (at your option) any later version.
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+    You should have received a copy of the GNU Affero General Public License
+    along with this program. If not, see <http://www.gnu.org/licenses/>.
+*/
+wdi.RunQueue = $.spcExtend(wdi.DomainObject, {
+	tasks: null,
+	isRunning: false,
+	init: function() {
+		this.tasks = [];
+	},
+	getTasksLength: function() {
+		return this.tasks.length;
+	},
+	add: function(fn, scope, endCallback, params) {
+		this.tasks.push({
+			fn: fn,
+			scope: scope,
+            fnFinish: endCallback,
+            params: params
+		});
+		return this;
+	},
+	clear: function() {
+		wdi.Debug.log('runqueue clear');
+		this.tasks = [];
+		return this;
+	},
+	_process: function() {
+		wdi.ExecutionControl.sync = true;
+		var proxy, self = this;
+		this.isRunning = true;
+		var task = this.tasks.shift();
+		if (!task) {
+			this.isRunning = false;
+			return;
+		}
+		proxy = {
+			end: function() {
+                if(task.fnFinish) {
+                    task.fnFinish.call(task.scope);
+                }
+				self._process();
+			}
+		};
+		try {
+			task.fn.call(task.scope, proxy, task.params);
+		} catch(e) {
+			wdi.Debug.error(e.message);
+			proxy.end();
+		}
+		return this;
+	},
+	process: function() {
+		if (!this.isRunning) {
+			this._process();
+		} else {
+			return;
+		}
+	}
+});
+//wdi.ExecutionControl = $.spcExtend(wdi.DomainObject, {
+//	currentProxy: null,
+//	sync: true,
+//	runQ: null,
+//	init: function(c) {
+//		this.runQ = c.runQ || new wdi.RunQueue();
+//	}
+//});
+//TODO: make an instance of it on each channel
+wdi.ExecutionControl = {
+	currentProxy: null,
+	sync: true,
+	runQ: new wdi.RunQueue()
+};

package/public/spice-console/lib/sha1.js CHANGED Viewed

@@ -1,124 +1,124 @@
-/*
-    Copyright (c) 2016 eyeOS
-    This file is part of Open365.
-    Open365 is free software: you can redistribute it and/or modify
-    it under the terms of the GNU Affero General Public License as
-    published by the Free Software Foundation, either version 3 of the
-    License, or (at your option) any later version.
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Affero General Public License for more details.
-    You should have received a copy of the GNU Affero General Public License
-    along with this program. If not, see <http://www.gnu.org/licenses/>.
-*/
-/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */
-/*  SHA-1 implementation in JavaScript (c) Chris Veness 2002-2009                                 */
-/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */
-function sha1Hash(msg)
-{
-    // constants [�4.2.1]
-    var K = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];
-    // PREPROCESSING
-    msg += String.fromCharCode(0x80); // add trailing '1' bit (+ 0's padding) to string [�5.1.1]
-    // convert string msg into 512-bit/16-integer blocks arrays of ints [�5.2.1]
-    var l = msg.length/4 + 2;  // length (in 32-bit integers) of msg + �1� + appended length
-    var N = Math.ceil(l/16);   // number of 16-integer-blocks required to hold 'l' ints
-    var M = new Array(N);
-    for (var i=0; i<N; i++) {
-        M[i] = new Array(16);
-        for (var j=0; j<16; j++) {  // encode 4 chars per integer, big-endian encoding
-            M[i][j] = (msg.charCodeAt(i*64+j*4)<<24) | (msg.charCodeAt(i*64+j*4+1)<<16) |
-                      (msg.charCodeAt(i*64+j*4+2)<<8) | (msg.charCodeAt(i*64+j*4+3));
-        }
-    }
-    // add length (in bits) into final pair of 32-bit integers (big-endian) [5.1.1]
-    // note: most significant word would be (len-1)*8 >>> 32, but since JS converts
-    // bitwise-op args to 32 bits, we need to simulate this by arithmetic operators
-    M[N-1][14] = ((msg.length-1)*8) / Math.pow(2, 32); M[N-1][14] = Math.floor(M[N-1][14])
-    M[N-1][15] = ((msg.length-1)*8) & 0xffffffff;
-    // set initial hash value [�5.3.1]
-    var H0 = 0x67452301;
-    var H1 = 0xefcdab89;
-    var H2 = 0x98badcfe;
-    var H3 = 0x10325476;
-    var H4 = 0xc3d2e1f0;
-    // HASH COMPUTATION [�6.1.2]
-    var W = new Array(80); var a, b, c, d, e;
-    for (var i=0; i<N; i++) {
-        // 1 - prepare message schedule 'W'
-        for (var t=0;  t<16; t++) W[t] = M[i][t];
-        for (var t=16; t<80; t++) W[t] = ROTL(W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16], 1);
-        // 2 - initialise five working variables a, b, c, d, e with previous hash value
-        a = H0; b = H1; c = H2; d = H3; e = H4;
-        // 3 - main loop
-        for (var t=0; t<80; t++) {
-            var s = Math.floor(t/20); // seq for blocks of 'f' functions and 'K' constants
-            var T = (ROTL(a,5) + f(s,b,c,d) + e + K[s] + W[t]) & 0xffffffff;
-            e = d;
-            d = c;
-            c = ROTL(b, 30);
-            b = a;
-            a = T;
-        }
-        // 4 - compute the new intermediate hash value
-        H0 = (H0+a) & 0xffffffff;  // note 'addition modulo 2^32'
-        H1 = (H1+b) & 0xffffffff;
-        H2 = (H2+c) & 0xffffffff;
-        H3 = (H3+d) & 0xffffffff;
-        H4 = (H4+e) & 0xffffffff;
-    }
-    return H0.toHexStr() + H1.toHexStr() + H2.toHexStr() + H3.toHexStr() + H4.toHexStr();
-}
-//
-// function 'f' [�4.1.1]
-//
-function f(s, x, y, z)
-{
-    switch (s) {
-    case 0: return (x & y) ^ (~x & z);           // Ch()
-    case 1: return x ^ y ^ z;                    // Parity()
-    case 2: return (x & y) ^ (x & z) ^ (y & z);  // Maj()
-    case 3: return x ^ y ^ z;                    // Parity()
-    }
-}
-//
-// rotate left (circular left shift) value x by n positions [�3.2.5]
-//
-function ROTL(x, n)
-{
-    return (x<<n) | (x>>>(32-n));
-}
-//
-// extend Number class with a tailored hex-string method
-//   (note toString(16) is implementation-dependant, and
-//   in IE returns signed numbers when used on full words)
-//
-Number.prototype.toHexStr = function()
-{
-    var s="", v;
-    for (var i=7; i>=0; i--) { v = (this>>>(i*4)) & 0xf; s += v.toString(16); }
-    return s;
-}
-/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */
+/*
+    Copyright (c) 2016 eyeOS
+    This file is part of Open365.
+    Open365 is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as
+    published by the Free Software Foundation, either version 3 of the
+    License, or (at your option) any later version.
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+    You should have received a copy of the GNU Affero General Public License
+    along with this program. If not, see <http://www.gnu.org/licenses/>.
+*/
+/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */
+/*  SHA-1 implementation in JavaScript (c) Chris Veness 2002-2009                                 */
+/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */
+function sha1Hash(msg)
+{
+    // constants [�4.2.1]
+    var K = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];
+    // PREPROCESSING
+    msg += String.fromCharCode(0x80); // add trailing '1' bit (+ 0's padding) to string [�5.1.1]
+    // convert string msg into 512-bit/16-integer blocks arrays of ints [�5.2.1]
+    var l = msg.length/4 + 2;  // length (in 32-bit integers) of msg + �1� + appended length
+    var N = Math.ceil(l/16);   // number of 16-integer-blocks required to hold 'l' ints
+    var M = new Array(N);
+    for (var i=0; i<N; i++) {
+        M[i] = new Array(16);
+        for (var j=0; j<16; j++) {  // encode 4 chars per integer, big-endian encoding
+            M[i][j] = (msg.charCodeAt(i*64+j*4)<<24) | (msg.charCodeAt(i*64+j*4+1)<<16) |
+                      (msg.charCodeAt(i*64+j*4+2)<<8) | (msg.charCodeAt(i*64+j*4+3));
+        }
+    }
+    // add length (in bits) into final pair of 32-bit integers (big-endian) [5.1.1]
+    // note: most significant word would be (len-1)*8 >>> 32, but since JS converts
+    // bitwise-op args to 32 bits, we need to simulate this by arithmetic operators
+    M[N-1][14] = ((msg.length-1)*8) / Math.pow(2, 32); M[N-1][14] = Math.floor(M[N-1][14])
+    M[N-1][15] = ((msg.length-1)*8) & 0xffffffff;
+    // set initial hash value [�5.3.1]
+    var H0 = 0x67452301;
+    var H1 = 0xefcdab89;
+    var H2 = 0x98badcfe;
+    var H3 = 0x10325476;
+    var H4 = 0xc3d2e1f0;
+    // HASH COMPUTATION [�6.1.2]
+    var W = new Array(80); var a, b, c, d, e;
+    for (var i=0; i<N; i++) {
+        // 1 - prepare message schedule 'W'
+        for (var t=0;  t<16; t++) W[t] = M[i][t];
+        for (var t=16; t<80; t++) W[t] = ROTL(W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16], 1);
+        // 2 - initialise five working variables a, b, c, d, e with previous hash value
+        a = H0; b = H1; c = H2; d = H3; e = H4;
+        // 3 - main loop
+        for (var t=0; t<80; t++) {
+            var s = Math.floor(t/20); // seq for blocks of 'f' functions and 'K' constants
+            var T = (ROTL(a,5) + f(s,b,c,d) + e + K[s] + W[t]) & 0xffffffff;
+            e = d;
+            d = c;
+            c = ROTL(b, 30);
+            b = a;
+            a = T;
+        }
+        // 4 - compute the new intermediate hash value
+        H0 = (H0+a) & 0xffffffff;  // note 'addition modulo 2^32'
+        H1 = (H1+b) & 0xffffffff;
+        H2 = (H2+c) & 0xffffffff;
+        H3 = (H3+d) & 0xffffffff;
+        H4 = (H4+e) & 0xffffffff;
+    }
+    return H0.toHexStr() + H1.toHexStr() + H2.toHexStr() + H3.toHexStr() + H4.toHexStr();
+}
+//
+// function 'f' [�4.1.1]
+//
+function f(s, x, y, z)
+{
+    switch (s) {
+    case 0: return (x & y) ^ (~x & z);           // Ch()
+    case 1: return x ^ y ^ z;                    // Parity()
+    case 2: return (x & y) ^ (x & z) ^ (y & z);  // Maj()
+    case 3: return x ^ y ^ z;                    // Parity()
+    }
+}
+//
+// rotate left (circular left shift) value x by n positions [�3.2.5]
+//
+function ROTL(x, n)
+{
+    return (x<<n) | (x>>>(32-n));
+}
+//
+// extend Number class with a tailored hex-string method
+//   (note toString(16) is implementation-dependant, and
+//   in IE returns signed numbers when used on full words)
+//
+Number.prototype.toHexStr = function()
+{
+    var s="", v;
+    for (var i=7; i>=0; i--) { v = (this>>>(i*4)) & 0xf; s += v.toString(16); }
+    return s;
+}
+/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -  */