| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 |
| (...skipping 11 matching lines...) Expand all Loading... |
| 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 // We change the stack size for the ARM64 simulator because at one point this | 28 // We change the stack size for the ARM64 simulator because at one point this |
| 29 // test enters an infinite recursion which goes through the runtime and we | 29 // test enters an infinite recursion which goes through the runtime and we |
| 30 // overflow the system stack before the simulator stack. | 30 // overflow the system stack before the simulator stack. |
| 31 | 31 |
| 32 // Flags: --harmony-proxies --sim-stack-size=500 --allow-natives-syntax | 32 // Flags: --sim-stack-size=500 --allow-natives-syntax |
| 33 | 33 |
| 34 | 34 |
| 35 // Helper. | 35 // Helper. |
| 36 | 36 |
| 37 function TestWithProxies(test, x, y, z) { | 37 function TestWithProxies(test, x, y, z) { |
| 38 // Separate function for nicer stack traces. | 38 // Separate function for nicer stack traces. |
| 39 TestWithObjectProxy(test, x, y, z); | 39 TestWithObjectProxy(test, x, y, z); |
| 40 TestWithFunctionProxy(test, x, y, z); | 40 TestWithFunctionProxy(test, x, y, z); |
| 41 } | 41 } |
| 42 | 42 |
| (...skipping 1454 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1497 var o = new C(); | 1497 var o = new C(); |
| 1498 | 1498 |
| 1499 function f() { | 1499 function f() { |
| 1500 return o.x; | 1500 return o.x; |
| 1501 } | 1501 } |
| 1502 assertEquals(10, f()); | 1502 assertEquals(10, f()); |
| 1503 assertEquals(10, f()); | 1503 assertEquals(10, f()); |
| 1504 %OptimizeFunctionOnNextCall(f); | 1504 %OptimizeFunctionOnNextCall(f); |
| 1505 assertEquals(10, f()); | 1505 assertEquals(10, f()); |
| 1506 })(); | 1506 })(); |
| OLD | NEW |