Asm.js - Revision history

Adamcolton at 05:20, 9 August 2015

2015-08-09T05:20:17Z

← Older revision		Revision as of 05:20, 9 August 2015
Line 42:		Line 42:
	* int: x\|0		* int: x\|0
	* double: +x		* double: +x

			=== GC Notes ===
			I think I'm going to use a copy garbage collector with two level pointers. So there will be a block of pointers that don't move and all pointer go through that block. I can form a single linked list of the unused pointers, a stack; as I deallocate pointers, push them on the pointer stack, as I need them, pop them off.

Adamcolton at 21:12, 8 August 2015

2015-08-08T21:12:26Z

← Older revision		Revision as of 21:12, 8 August 2015
Line 1:		Line 1:
			http://anvaka.github.io/asmalidator/

	Uses a prologue directive		Uses a prologue directive
	function MyAsmModule() {		function MyAsmModule() {

Adamcolton at 18:06, 8 August 2015

2015-08-08T18:06:11Z

← Older revision		Revision as of 18:06, 8 August 2015
Line 30:		Line 30:
	start = start\|0;		start = start\|0;
	end = end\|0;		end = end\|0;

	return +exp(+logSum(start, end) / +((end - start)\|0));		return +exp(+logSum(start, end) / +((end - start)\|0));
	}		}
Line 36:		Line 36:
	return { geometricMean: geometricMean };		return { geometricMean: geometricMean };
	}		}

			=== Types ===
			* int: x\|0
			* double: +x

Adamcolton at 17:55, 8 August 2015

2015-08-08T17:55:28Z

← Older revision		Revision as of 17:55, 8 August 2015
Line 8:		Line 8:
	function GeometricMean(stdlib, foreign, buffer) {		function GeometricMean(stdlib, foreign, buffer) {
	"use asm";		"use asm";

	var exp = stdlib.Math.exp;		var exp = stdlib.Math.exp;
	var log = stdlib.Math.log;		var log = stdlib.Math.log;
	var values = new stdlib.Float64Array(buffer);		var values = new stdlib.Float64Array(buffer);

	function logSum(start, end) {		function logSum(start, end) {
	start = start\|0;		start = start\|0;
	end = end\|0;		end = end\|0;

	var sum = 0.0, p = 0, q = 0;		var sum = 0.0, p = 0, q = 0;

	// asm.js forces byte addressing of the heap by requiring shifting by 3		// asm.js forces byte addressing of the heap by requiring shifting by 3
	for (p = start << 3, q = end << 3; (p\|0) < (q\|0); p = (p + 8)\|0) {		for (p = start << 3, q = end << 3; (p\|0) < (q\|0); p = (p + 8)\|0) {
	sum = sum + +log(values[p>>3]);		sum = sum + +log(values[p>>3]);
	}		}

	return +sum;		return +sum;
	}		}

	function geometricMean(start, end) {		function geometricMean(start, end) {
	start = start\|0;		start = start\|0;
Line 33:		Line 33:
	return +exp(+logSum(start, end) / +((end - start)\|0));		return +exp(+logSum(start, end) / +((end - start)\|0));
	}		}

	return { geometricMean: geometricMean };		return { geometricMean: geometricMean };
	}		}

Adamcolton: Created page with "Uses a prologue directive function MyAsmModule() { "use asm"; // module body } Example function GeometricMean(stdlib, foreign, buffer) { "use asm"; var..."

2015-08-08T17:54:45Z

Created page with "Uses a prologue directive function MyAsmModule() { "use asm"; // module body } Example function GeometricMean(stdlib, foreign, buffer) { "use asm"; var..."

New page

Uses a prologue directive
function MyAsmModule() {
"use asm";
// module body
}

Example
function GeometricMean(stdlib, foreign, buffer) {
"use asm";

var exp = stdlib.Math.exp;
var log = stdlib.Math.log;
var values = new stdlib.Float64Array(buffer);

function logSum(start, end) {
start = start|0;
end = end|0;

var sum = 0.0, p = 0, q = 0;

// asm.js forces byte addressing of the heap by requiring shifting by 3
for (p = start << 3, q = end << 3; (p|0) < (q|0); p = (p + 8)|0) {
sum = sum + +log(values[p>>3]);
}

return +sum;
}

function geometricMean(start, end) {
start = start|0;
end = end|0;

return +exp(+logSum(start, end) / +((end - start)|0));
}

return { geometricMean: geometricMean };
}