| 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 // Test function.arguments. |  28 // Flags: --allow-natives-syntax | 
|  29  |  29  | 
|  30 function A() {} |  30 // Test inlining at call sites with mismatched arity. | 
|  31 function B() {} |  | 
|  32  |  31  | 
|  33 function fee(x, y) { |  32 function f(a) { | 
|  34   if (x == 1) return fee["arg" + "uments"]; |  33   return a.x; | 
|  35   if (x == 2) return gee["arg" + "uments"]; |  | 
|  36   return 42; |  | 
|  37 } |  34 } | 
|  38  |  35  | 
|  39 function gee(x) { return this.f(2 - x, "f"); } |  36 function g(a, b) { | 
|  40  |  37   return a.x; | 
|  41 function foo(x, y) { |  | 
|  42   if (x == 0) return foo["arg" + "uments"]; |  | 
|  43   if (x == 1) return goo["arg" + "uments"]; |  | 
|  44   return 42; |  | 
|  45 } |  38 } | 
|  46  |  39  | 
|  47 function goo(x) { return this.f(x, "f"); } |  40 function h1(a, b) { | 
|  48  |  41   return f(a, a) * g(b); | 
|  49 A.prototype.f = fee; |  | 
|  50 A.prototype.g = gee; |  | 
|  51  |  | 
|  52 B.prototype.f = foo; |  | 
|  53 B.prototype.g = goo; |  | 
|  54  |  | 
|  55 var o = new A(); |  | 
|  56  |  | 
|  57 function hej(x) { |  | 
|  58   if (x == 0) return o.g(x, "h"); |  | 
|  59   if (x == 1) return o.g(x, "h"); |  | 
|  60   return o.g(x, "z"); |  | 
|  61 } |  42 } | 
|  62  |  43  | 
|  63 function stress() { |  44 function h2(a, b) { | 
|  64   for (var i=0; i<5000000; i++) o.g(i, "g"); |  45   return f(a, a) * g(b); | 
|  65   for (var j=0; j<5000000; j++) hej(j); |  | 
|  66 } |  46 } | 
|  67  |  47  | 
|  68 stress(); |  | 
|  69  |  48  | 
|  70 assertArrayEquals([0, "g"], o.g(0, "g")); |  49 var o = {x: 2}; | 
|  71 assertArrayEquals([1, "f"], o.g(1, "g")); |  | 
|  72 assertArrayEquals([0, "h"], hej(0)); |  | 
|  73 assertArrayEquals([1, "f"], hej(1)); |  | 
|  74  |  50  | 
|  75 o = new B(); |  51 assertEquals(4, h1(o, o)); | 
 |  52 assertEquals(4, h1(o, o)); | 
 |  53 assertEquals(4, h2(o, o)); | 
 |  54 assertEquals(4, h2(o, o)); | 
 |  55 %OptimizeFunctionOnNextCall(h1); | 
 |  56 %OptimizeFunctionOnNextCall(h2); | 
 |  57 assertEquals(4, h1(o, o)); | 
 |  58 assertEquals(4, h2(o, o)); | 
|  76  |  59  | 
|  77 stress(); |  60 var u = {y:0, x:1}; | 
|  78  |  61 assertEquals(2, h1(u, o)); | 
|  79 assertArrayEquals([0, "f"], o.g(0, "g")); |  62 assertEquals(2, h2(o, u)); | 
|  80 assertArrayEquals([1, "g"], o.g(1, "g")); |  | 
|  81 assertArrayEquals([0, "f"], hej(0)); |  | 
|  82 assertArrayEquals([1, "h"], hej(1)); |  | 
| OLD | NEW |