OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Test both the Harmony egal operator and it's function equivalent. | 28 // Flags: --allow-natives-syntax --cache-optimized-code |
29 | 29 |
30 function TestEgal(expected, x, y) { | 30 function bozo() {}; |
31 // TODO(mstarzinger): Once we have the egal operator, we can test it here. | 31 function MakeClosure() { |
32 assertSame(expected, Object.is(x, y)); | 32 return function f(use_literals) { |
33 } | 33 if (use_literals) { |
34 | 34 return [1,2,3,3,4,5,6,7,8,9,bozo]; |
35 var test_set = [ {}, [], 1/0, -1/0, "s", 0, 0/-1, null, undefined ]; | |
36 print(test_set); | |
37 for (var i = 0; i < test_set.length; i++) { | |
38 for (var j = 0; j < test_set.length; j++) { | |
39 if (i == j) { | |
40 assertSame(test_set[i], test_set[j]); | |
41 TestEgal(true, test_set[i], test_set[j]); | |
42 } else { | 35 } else { |
43 TestEgal(false, test_set[i], test_set[j]); | 36 return 0; |
44 TestEgal(false, test_set[j], test_set[i]); | |
45 } | 37 } |
46 } | 38 } |
47 } | 39 } |
| 40 |
| 41 // Create two closures that share the same literal boilerplates. |
| 42 var closure1 = MakeClosure(); |
| 43 var closure2 = MakeClosure(); |
| 44 var expected = [1,2,3,3,4,5,6,7,8,9,bozo]; |
| 45 |
| 46 // Make sure we generate optimized code for the first closure after |
| 47 // warming it up properly so that the literals boilerplate is generated |
| 48 // and the optimized code uses CreateArrayLiteralShallow runtime call. |
| 49 assertEquals(0, closure1(false)); |
| 50 assertEquals(expected, closure1(true)); |
| 51 %OptimizeFunctionOnNextCall(closure1); |
| 52 assertEquals(expected, closure1(true)); |
| 53 |
| 54 // Optimize the second closure, which should reuse the optimized code |
| 55 // from the first closure with the same literal boilerplates. |
| 56 assertEquals(0, closure2(false)); |
| 57 %OptimizeFunctionOnNextCall(closure2); |
| 58 assertEquals(expected, closure2(true)); |
OLD | NEW |