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