1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/js/src/jit-test/tests/asm.js/testFastHeapAccess.js Wed Dec 31 06:09:35 2014 +0100 1.3 @@ -0,0 +1,68 @@ 1.4 +load(libdir + "asm.js"); 1.5 + 1.6 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j) {i=i|0;j=j|0; u32[((i<<2)+32 & 0xffff)>>2] = j } return f'); 1.7 +var f = asmLink(code, this, null, BUF_64KB); 1.8 +for (var i = 0; i < 100; i++) 1.9 + f(i, i); 1.10 +var u32 = new Uint32Array(BUF_64KB); 1.11 +for (var i = 0; i < 100; i++) 1.12 + assertEq(u32[8+i], i); 1.13 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i) {i=i|0; return u32[((i<<2)+32 & 0xffff)>>2]|0 } return f'); 1.14 +var f = asmLink(code, this, null, BUF_64KB); 1.15 +for (var i = 0; i < 100; i++) 1.16 + assertEq(f(i), i); 1.17 + 1.18 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j) {i=i|0;j=j|0; u32[(i<<2 & 0xffff)>>2] = j } return f'); 1.19 +var f = asmLink(code, this, null, BUF_64KB); 1.20 +for (var i = 0; i < 100; i++) 1.21 + f(i, i); 1.22 +var u32 = new Uint32Array(BUF_64KB); 1.23 +for (var i = 0; i < 100; i++) 1.24 + assertEq(u32[i], i); 1.25 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i) {i=i|0; return u32[(i<<2 & 0xffff)>>2]|0 } return f'); 1.26 +var f = asmLink(code, this, null, BUF_64KB); 1.27 +for (var i = 0; i < 100; i++) 1.28 + assertEq(f(i), i); 1.29 + 1.30 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j) {i=i|0;j=j|0; u8[i+20 & 0xffff] = j } return f'); 1.31 +var f = asmLink(code, this, null, BUF_64KB); 1.32 +for (var i = 0; i < 100; i++) 1.33 + f(i, i); 1.34 +var u8 = new Uint8Array(BUF_64KB); 1.35 +for (var i = 0; i < 100; i++) 1.36 + assertEq(u8[i+20], i); 1.37 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i) {i=i|0; return u8[i+20 & 0xffff]|0 } return f'); 1.38 +var f = asmLink(code, this, null, BUF_64KB); 1.39 +for (var i = 0; i < 100; i++) 1.40 + assertEq(f(i), i); 1.41 + 1.42 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j,k) {i=i|0;j=j|0;k=k|0; i32[(i + (j<<2) & 0xffff) >> 2] = k } return f'); 1.43 +var f = asmLink(code, this, null, BUF_64KB); 1.44 +for (var i = 0; i < 100; i++) 1.45 + f(32, i, i); 1.46 +var u32 = new Uint32Array(BUF_64KB); 1.47 +for (var i = 0; i < 100; i++) 1.48 + assertEq(u32[8+i], i); 1.49 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j) {i=i|0;j=j|0; return i32[(i + (j<<2) & 0xffff) >> 2]|0 } return f'); 1.50 +var f = asmLink(code, this, null, BUF_64KB); 1.51 +for (var i = 0; i < 100; i++) 1.52 + assertEq(f(32, i), i); 1.53 + 1.54 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j,k) {i=i|0;j=j|0;k=k|0; i32[(((i + (j<<2))|0) + 16 & 0xffff) >> 2] = k } return f'); 1.55 +var f = asmLink(code, this, null, BUF_64KB); 1.56 +for (var i = 0; i < 100; i++) 1.57 + f(32, i, i); 1.58 +var u32 = new Uint32Array(BUF_64KB); 1.59 +for (var i = 0; i < 100; i++) 1.60 + assertEq(u32[8+i+4], i); 1.61 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j) {i=i|0;j=j|0; return i32[(((i + (j<<2))|0) + 16 & 0xffff) >> 2]|0 } return f'); 1.62 +var f = asmLink(code, this, null, BUF_64KB); 1.63 +for (var i = 0; i < 100; i++) 1.64 + assertEq(f(32, i), i); 1.65 + 1.66 +var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i,j) {i=i|0;j=j|0; return ((i32[(i+(j<<2)&0xffff)>>2]|0) + (i32[(((i+(j<<2))|0)+4&0xffff)>>2]|0))|0 } return f'); 1.67 +var f = asmLink(code, this, null, BUF_64KB); 1.68 +var i32 = new Uint32Array(BUF_64KB); 1.69 +i32[11] = 3; 1.70 +i32[12] = 97; 1.71 +assertEq(f(12,8), 100);