| OLD | NEW |
| 1 // Copyright 2010 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 // Flags: --allow-natives-syntax |
| 29 |
| 28 // Test function.arguments. | 30 // Test function.arguments. |
| 29 | 31 |
| 30 function A() {} | 32 function A() {} |
| 31 function B() {} | 33 function B() {} |
| 32 | 34 |
| 33 function fee(x, y) { | 35 function fee(x, y) { |
| 34 if (x == 1) return fee["arg" + "uments"]; | 36 if (x == 1) return fee["arg" + "uments"]; |
| 35 if (x == 2) return gee["arg" + "uments"]; | 37 if (x == 2) return gee["arg" + "uments"]; |
| 36 return 42; | 38 return 42; |
| 37 } | 39 } |
| (...skipping 15 matching lines...) Expand all Loading... |
| 53 B.prototype.g = goo; | 55 B.prototype.g = goo; |
| 54 | 56 |
| 55 var o = new A(); | 57 var o = new A(); |
| 56 | 58 |
| 57 function hej(x) { | 59 function hej(x) { |
| 58 if (x == 0) return o.g(x, "h"); | 60 if (x == 0) return o.g(x, "h"); |
| 59 if (x == 1) return o.g(x, "h"); | 61 if (x == 1) return o.g(x, "h"); |
| 60 return o.g(x, "z"); | 62 return o.g(x, "z"); |
| 61 } | 63 } |
| 62 | 64 |
| 63 function stress() { | 65 function opt() { |
| 64 for (var i=0; i<5000000; i++) o.g(i, "g"); | 66 for (var k=0; k<2; k++) { |
| 65 for (var j=0; j<5000000; j++) hej(j); | 67 for (var i=0; i<5; i++) o.g(i, "g"); |
| 68 for (var j=0; j<5; j++) hej(j); |
| 69 } |
| 70 %OptimizeFunctionOnNextCall(o.g); |
| 71 %OptimizeFunctionOnNextCall(hej); |
| 66 } | 72 } |
| 67 | 73 |
| 68 stress(); | 74 opt(); |
| 69 | |
| 70 assertArrayEquals([0, "g"], o.g(0, "g")); | 75 assertArrayEquals([0, "g"], o.g(0, "g")); |
| 71 assertArrayEquals([1, "f"], o.g(1, "g")); | 76 assertArrayEquals([1, "f"], o.g(1, "g")); |
| 72 assertArrayEquals([0, "h"], hej(0)); | 77 assertArrayEquals([0, "h"], hej(0)); |
| 73 assertArrayEquals([1, "f"], hej(1)); | 78 assertArrayEquals([1, "f"], hej(1)); |
| 74 | 79 |
| 75 o = new B(); | 80 o = new B(); |
| 76 | 81 |
| 77 stress(); | 82 opt(); |
| 78 | |
| 79 assertArrayEquals([0, "f"], o.g(0, "g")); | 83 assertArrayEquals([0, "f"], o.g(0, "g")); |
| 80 assertArrayEquals([1, "g"], o.g(1, "g")); | 84 assertArrayEquals([1, "g"], o.g(1, "g")); |
| 81 assertArrayEquals([0, "f"], hej(0)); | 85 assertArrayEquals([0, "f"], hej(0)); |
| 82 assertArrayEquals([1, "h"], hej(1)); | 86 assertArrayEquals([1, "h"], hej(1)); |
| OLD | NEW |