The Tor Browser / annotate

js/src/jit-test/tests/asm.js/testFloatingPoint.js@6474c204b198 (annotated)

js/src/jit-test/tests/asm.js/testFloatingPoint.js

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1 load(libdir + "asm.js");
michael@0 2
michael@0 3 assertEq(asmLink(asmCompile(USE_ASM + "function f() { return 1.1 } return f"))(), 1.1);
michael@0 4 assertEq(asmLink(asmCompile(USE_ASM + "function f(i) { i=i|0; return +(+(i|0) + .1) } return f"))(1), 1.1);
michael@0 5 assertEq(asmLink(asmCompile(USE_ASM + "function f(d) { d=+d; return +d } return f"))(1.1), 1.1);
michael@0 6 assertEq(asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return +(d+e) } return f"))(1.0, .1), 1.1);
michael@0 7 assertEq(asmLink(asmCompile(USE_ASM + "function f(i,e) { i=i|0;e=+e; return +(+~~i+e) } return f"))(1, .1), 1.1);
michael@0 8 assertEq(asmLink(asmCompile(USE_ASM + "function f(d,i) { d=+d;i=i|0; return +(d + +(i|0)) } return f"))(.1, 1), 1.1);
michael@0 9 assertEq(asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return +(d-e) } return f"))(1.1, .8), (1.1-.8));
michael@0 10 assertEq(asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return +(d*e) } return f"))(1.1, 2.2), (1.1*2.2));
michael@0 11 assertEq(asmLink(asmCompile(USE_ASM + "function g() { var i=2; return (~~(i=(i+1)|0))|0 } return g"))(), 3);
michael@0 12
michael@0 13 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return (d<e)|0 } return f"));
michael@0 14 assertEq(f(1.1, 2.2), 1);
michael@0 15 assertEq(f(1.1, 1.1), 0);
michael@0 16 assertEq(f(2.1, 1.1), 0);
michael@0 17
michael@0 18 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return (d<=e)|0 } return f"));
michael@0 19 assertEq(f(1.1, 2.2), 1);
michael@0 20 assertEq(f(1.1, 1.1), 1);
michael@0 21 assertEq(f(2.1, 1.1), 0);
michael@0 22 assertEq(f(NaN, 1.1), 0);
michael@0 23 assertEq(f(1.1, NaN), 0);
michael@0 24 assertEq(f(NaN, NaN), 0);
michael@0 25
michael@0 26 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return (d>e)|0 } return f"));
michael@0 27 assertEq(f(2.1, 1.1), 1);
michael@0 28 assertEq(f(1.1, 1.1), 0);
michael@0 29 assertEq(f(1.1, 2.1), 0);
michael@0 30 assertEq(f(NaN, 1.1), 0);
michael@0 31 assertEq(f(1.1, NaN), 0);
michael@0 32 assertEq(f(NaN, NaN), 0);
michael@0 33
michael@0 34 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return (d>=e)|0 } return f"));
michael@0 35 assertEq(f(2.1, 1.1), 1);
michael@0 36 assertEq(f(1.0, 1.1), 0);
michael@0 37 assertEq(f(1.1, 2.1), 0);
michael@0 38 assertEq(f(NaN, 1.1), 0);
michael@0 39 assertEq(f(1.1, NaN), 0);
michael@0 40 assertEq(f(NaN, NaN), 0);
michael@0 41
michael@0 42 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return (d==e)|0 } return f"));
michael@0 43 assertEq(f(2.1, 1.1), 0);
michael@0 44 assertEq(f(1.1, 1.1), 1);
michael@0 45 assertEq(f(1.1, 2.1), 0);
michael@0 46 assertEq(f(NaN, 1.1), 0);
michael@0 47 assertEq(f(1.1, NaN), 0);
michael@0 48 assertEq(f(NaN, NaN), 0);
michael@0 49
michael@0 50 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return (d!=e)|0 } return f"));
michael@0 51 assertEq(f(2.1, 1.1), 1);
michael@0 52 assertEq(f(1.1, 1.1), 0);
michael@0 53 assertEq(f(1.1, 2.1), 1);
michael@0 54 assertEq(f(NaN, 1.1), 1);
michael@0 55 assertEq(f(1.1, NaN), 1);
michael@0 56 assertEq(f(NaN, NaN), 1);
michael@0 57
michael@0 58 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return +(d/e) } return f"));
michael@0 59 assertEq(f(1.1, .1), (1.1/.1));
michael@0 60 assertEq(f(1.1, 0), (1.1/0));
michael@0 61 assertEq(f(1.1, -0), (1.1/-0));
michael@0 62
michael@0 63 var f = asmLink(asmCompile(USE_ASM + "function f(d,e) { d=+d;e=+e; return +(d%e) } return f"));
michael@0 64 assertEq(f(1.1, .1), (1.1%.1));
michael@0 65 assertEq(f(1.1, 0), (1.1%0));
michael@0 66 assertEq(f(1.1, -0), (1.1%-0));
michael@0 67
michael@0 68 var f = asmLink(asmCompile(USE_ASM + "function f(d) { d=+d; var i = 0; i = ~~d; return i|0 } return f"));
michael@0 69 assertEq(f(1.0), 1);
michael@0 70 assertEq(f(1.9), 1);
michael@0 71 assertEq(f(1.9999), 1);
michael@0 72 assertEq(f(2.0), 2);
michael@0 73 assertEq(f(Math.pow(2,40)), ~~Math.pow(2,40));
michael@0 74 assertEq(f(-Math.pow(2,40)), ~~-Math.pow(2,40));
michael@0 75 assertEq(f(4000000000), ~~4000000000);
michael@0 76 assertEq(f(-4000000000), ~~-4000000000);
michael@0 77 assertEq(f(NaN), 0);
michael@0 78 assertEq(f(Infinity), 0);
michael@0 79 assertEq(f(-Infinity), 0);
michael@0 80
michael@0 81 assertAsmTypeFail(USE_ASM + "function f(i,j) { i=i|0;j=j|0; return +((i|0)/(j|0)) } return f");
michael@0 82 assertAsmTypeFail(USE_ASM + "function f(i,j) { i=i|0;j=j|0; return +(i+j) } return f");
michael@0 83 assertAsmTypeFail(USE_ASM + "function f(i,j) { i=i|0;j=j|0; return +(i-j) } return f");
michael@0 84
michael@0 85 var f = asmLink(asmCompile(USE_ASM + "function f(i,j) { i=i|0;j=j|0; return +(((i|0)/(j|0))|0) } return f"));
michael@0 86 assertEq(f(1,0), 0);
michael@0 87 assertEq(f(-Math.pow(2,31),-1), -Math.pow(2,31));
michael@0 88
michael@0 89 var f = asmLink(asmCompile(USE_ASM + "function f(i,j) { i=i|0;j=j|0; return +(((i|0)%(j|0))|0) } return f"));
michael@0 90 assertEq(f(1,0), 0);
michael@0 91 assertEq(f(-Math.pow(2,31),-1), 0);
michael@0 92
michael@0 93 var {f,g} = asmLink(asmCompile(USE_ASM + "function f() { return 3.5 } function g(d) { d=+d; return +(d+3.5) } return {f:f,g:g}"));
michael@0 94 assertEq(f(), 3.5);
michael@0 95 assertEq(g(1), 1+3.5);
michael@0 96
michael@0 97 var buf = new ArrayBuffer(4096);
michael@0 98 var f64 = new Float64Array(buf);
michael@0 99 var i32 = new Int32Array(buf);
michael@0 100 var u32 = new Uint32Array(buf);
michael@0 101 var f = asmLink(asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f() { return +f64[0] } return f'), this, null, buf);
michael@0 102 f64[0] = 0;
michael@0 103 assertEq(f(), 0);
michael@0 104 f64[0] = -1;
michael@0 105 assertEq(f(), -1);
michael@0 106 f64[0] = 1;
michael@0 107 assertEq(f(), 1);
michael@0 108 f64[0] = Infinity;
michael@0 109 assertEq(f(), Infinity);
michael@0 110 f64[0] = -Infinity;
michael@0 111 assertEq(f(), -Infinity);
michael@0 112
michael@0 113 function ffi(d) { str = String(d) }
michael@0 114 var g = asmLink(asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'var ffi=imp.ffi; function g() { ffi(+f64[0]) } return g'), this, {ffi:ffi}, buf);
michael@0 115 var h = asmLink(asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function g() { return +(+f64[0] < 0.0 ? -+f64[0] : +f64[0]) } return g'), this, null, buf)
michael@0 116
michael@0 117 function ffi1() { return 2.6 }
michael@0 118 assertEq(asmLink(asmCompile('glob', 'imp', USE_ASM + "var ffi1=imp.ffi1; function g() { var i=0,j=0.0; i=ffi1()|0; j=+ffi1(); return +(+(i|0)+j) } return g"), null, {ffi1:ffi1})(), 2+2.6);
michael@0 119
michael@0 120 // that sounds dangerous!
michael@0 121 var a = [0,1,0xffff0000,0x7fff0000,0xfff80000,0x7ff80000,0xfffc0000,0x7ffc0000,0xffffffff,0x0000ffff,0x00008fff7];
michael@0 122 for (i of a) {
michael@0 123 for (j of a) {
michael@0 124 u32[0] = i;
michael@0 125 u32[1] = j;
michael@0 126
michael@0 127 assertEq(f(), f64[0]);
michael@0 128
michael@0 129 g();
michael@0 130 assertEq(str, String(f64[0]));
michael@0 131
michael@0 132 assertEq(h(), Math.abs(f64[0]));
michael@0 133 }
michael@0 134 }

Mercurial Repository: The Tor Browser

Europalab SCM Repository Server

mercurial