Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame^] | 1 | // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 | |
| 28 | // Test function.arguments. |
| 29 | |
| 30 | function A() {} |
| 31 | function B() {} |
| 32 | |
| 33 | function fee(x, y) { |
| 34 | if (x == 1) return fee["arg" + "uments"]; |
| 35 | if (x == 2) return gee["arg" + "uments"]; |
| 36 | return 42; |
| 37 | } |
| 38 | |
| 39 | function gee(x) { return this.f(2 - x, "f"); } |
| 40 | |
| 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 | } |
| 46 | |
| 47 | function goo(x) { return this.f(x, "f"); } |
| 48 | |
| 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 | } |
| 62 | |
| 63 | function stress() { |
| 64 | for (var i=0; i<5000000; i++) o.g(i, "g"); |
| 65 | for (var j=0; j<5000000; j++) hej(j); |
| 66 | } |
| 67 | |
| 68 | stress(); |
| 69 | |
| 70 | assertArrayEquals([0, "g"], o.g(0, "g")); |
| 71 | assertArrayEquals([1, "f"], o.g(1, "g")); |
| 72 | assertArrayEquals([0, "h"], hej(0)); |
| 73 | assertArrayEquals([1, "f"], hej(1)); |
| 74 | |
| 75 | o = new B(); |
| 76 | |
| 77 | stress(); |
| 78 | |
| 79 | assertArrayEquals([0, "f"], o.g(0, "g")); |
| 80 | assertArrayEquals([1, "g"], o.g(1, "g")); |
| 81 | assertArrayEquals([0, "f"], hej(0)); |
| 82 | assertArrayEquals([1, "h"], hej(1)); |