constant-folding-1.js (1502B)
1 function bytecode(f) { 2 if (typeof disassemble !== "function") 3 return "unavailable"; 4 var d = disassemble(f); 5 // Remove line numbers. 6 d = d.replace(/(\n\d{5}:).*\d+/g, "$1"); 7 return d.slice(d.indexOf("main:"), d.indexOf("\n\n")); 8 } 9 assertEq(bytecode(() => "hello" + "world"), 10 bytecode(() => "helloworld")); 11 assertEq(bytecode(() => 2 + "2" + "2"), 12 bytecode(() => "222")); 13 assertEq(bytecode(() => "x" + "3"), 14 bytecode(() => "x3")); 15 16 var s = "hoge"; 17 assertEq(bytecode(() => "fo" + "o" + s + "ba" + "r"), 18 bytecode(() => "foo" + s + "bar")); 19 assertEq(bytecode(() => "fo" + "o" + 1 + s + 1 + "ba" + "r"), 20 bytecode(() => "foo1" + s + "1bar")); 21 assertEq(bytecode(() => 1 + (2 * 2) + "x"), 22 bytecode(() => 5 + "x")); 23 assertEq(s + 1 + 2, "hoge12"); 24 assertEq((() => s + 1 + 2)(), "hoge12"); 25 26 // SpiderMonkey knows that 1 + 1 == "11". 27 assertEq(bytecode(() => "x" + s + 1 + 1), 28 bytecode(() => "x" + s + "11")); 29 30 var n = 5; 31 assertEq(1 + n + 1 + "ba" + "r", "7bar"); 32 assertEq(1 + 2 + {valueOf: () => 3, toString: () => 'x'} + 4 + 5,15); 33 assertEq(1+2+n,8); 34 assertEq(bytecode(() => 1 + 2 + n + 1 + 2), 35 bytecode(() => 3 + n + 1 + 2)); 36 assertEq(1 + 2 + n + 1 + 2, 11); 37 assertEq(bytecode(() => 1 + 2 + s + 1 + 2), 38 bytecode(() => 3 + s + 1 + 2)); 39 assertEq(1 + 2 + s + 1 + 2, "3hoge12"); 40 41 assertEq(bytecode(() => ["a" + "b" + n]), 42 bytecode(() => ["ab" + n])); 43 var a = ["a" + "b" + n]; 44 assertEq(a[0], "ab5");