js/src/jit-test/tests/asm.js/testFastHeapAccess.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.

     1 load(libdir + "asm.js");
     3 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');
     4 var f = asmLink(code, this, null, BUF_64KB);
     5 for (var i = 0; i < 100; i++)
     6     f(i, i);
     7 var u32 = new Uint32Array(BUF_64KB);
     8 for (var i = 0; i < 100; i++)
     9     assertEq(u32[8+i], i);
    10 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');
    11 var f = asmLink(code, this, null, BUF_64KB);
    12 for (var i = 0; i < 100; i++)
    13     assertEq(f(i), i);
    15 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');
    16 var f = asmLink(code, this, null, BUF_64KB);
    17 for (var i = 0; i < 100; i++)
    18     f(i, i);
    19 var u32 = new Uint32Array(BUF_64KB);
    20 for (var i = 0; i < 100; i++)
    21     assertEq(u32[i], i);
    22 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');
    23 var f = asmLink(code, this, null, BUF_64KB);
    24 for (var i = 0; i < 100; i++)
    25     assertEq(f(i), i);
    27 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');
    28 var f = asmLink(code, this, null, BUF_64KB);
    29 for (var i = 0; i < 100; i++)
    30     f(i, i);
    31 var u8 = new Uint8Array(BUF_64KB);
    32 for (var i = 0; i < 100; i++)
    33     assertEq(u8[i+20], i);
    34 var code = asmCompile('glob', 'imp', 'b', USE_ASM + HEAP_IMPORTS + 'function f(i) {i=i|0; return u8[i+20 & 0xffff]|0 } return f');
    35 var f = asmLink(code, this, null, BUF_64KB);
    36 for (var i = 0; i < 100; i++)
    37     assertEq(f(i), i);
    39 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');
    40 var f = asmLink(code, this, null, BUF_64KB);
    41 for (var i = 0; i < 100; i++)
    42     f(32, i, i);
    43 var u32 = new Uint32Array(BUF_64KB);
    44 for (var i = 0; i < 100; i++)
    45     assertEq(u32[8+i], i);
    46 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');
    47 var f = asmLink(code, this, null, BUF_64KB);
    48 for (var i = 0; i < 100; i++)
    49     assertEq(f(32, i), i);
    51 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');
    52 var f = asmLink(code, this, null, BUF_64KB);
    53 for (var i = 0; i < 100; i++)
    54     f(32, i, i);
    55 var u32 = new Uint32Array(BUF_64KB);
    56 for (var i = 0; i < 100; i++)
    57     assertEq(u32[8+i+4], i);
    58 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');
    59 var f = asmLink(code, this, null, BUF_64KB);
    60 for (var i = 0; i < 100; i++)
    61     assertEq(f(32, i), i);
    63 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');
    64 var f = asmLink(code, this, null, BUF_64KB);
    65 var i32 = new Uint32Array(BUF_64KB);
    66 i32[11] = 3;
    67 i32[12] = 97;
    68 assertEq(f(12,8), 100);

mercurial