ager@chromium.org | 9258b6b | 2008-09-11 09:11:10 +0000 | [diff] [blame] | 1 | // Copyright 2008 the V8 project authors. All rights reserved. |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 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 | function argc0() { |
| 29 | return arguments.length; |
| 30 | } |
| 31 | |
| 32 | function argc1(i) { |
| 33 | return arguments.length; |
| 34 | } |
| 35 | |
| 36 | function argc2(i, j) { |
| 37 | return arguments.length; |
| 38 | } |
| 39 | |
| 40 | assertEquals(0, argc0()); |
| 41 | assertEquals(1, argc0(1)); |
| 42 | assertEquals(2, argc0(1, 2)); |
| 43 | assertEquals(3, argc0(1, 2, 3)); |
| 44 | assertEquals(0, argc1()); |
| 45 | assertEquals(1, argc1(1)); |
| 46 | assertEquals(2, argc1(1, 2)); |
| 47 | assertEquals(3, argc1(1, 2, 3)); |
| 48 | assertEquals(0, argc2()); |
| 49 | assertEquals(1, argc2(1)); |
| 50 | assertEquals(2, argc2(1, 2)); |
| 51 | assertEquals(3, argc2(1, 2, 3)); |
| 52 | |
| 53 | |
| 54 | |
| 55 | var index; |
| 56 | |
| 57 | function argv0() { |
| 58 | return arguments[index]; |
| 59 | } |
| 60 | |
| 61 | function argv1(i) { |
| 62 | return arguments[index]; |
| 63 | } |
| 64 | |
| 65 | function argv2(i, j) { |
| 66 | return arguments[index]; |
| 67 | } |
| 68 | |
| 69 | index = 0; |
| 70 | assertEquals(7, argv0(7)); |
| 71 | assertEquals(7, argv0(7, 8)); |
| 72 | assertEquals(7, argv0(7, 8, 9)); |
| 73 | assertEquals(7, argv1(7)); |
| 74 | assertEquals(7, argv1(7, 8)); |
| 75 | assertEquals(7, argv1(7, 8, 9)); |
| 76 | assertEquals(7, argv2(7)); |
| 77 | assertEquals(7, argv2(7, 8)); |
| 78 | assertEquals(7, argv2(7, 8, 9)); |
| 79 | |
| 80 | index = 1; |
| 81 | assertEquals(8, argv0(7, 8)); |
| 82 | assertEquals(8, argv0(7, 8)); |
| 83 | assertEquals(8, argv1(7, 8, 9)); |
| 84 | assertEquals(8, argv1(7, 8, 9)); |
| 85 | assertEquals(8, argv2(7, 8, 9)); |
| 86 | assertEquals(8, argv2(7, 8, 9)); |
| 87 | |
| 88 | index = 2; |
| 89 | assertEquals(9, argv0(7, 8, 9)); |
| 90 | assertEquals(9, argv1(7, 8, 9)); |
| 91 | assertEquals(9, argv2(7, 8, 9)); |
| 92 | |
| 93 | |
| 94 | // Test that calling a lazily compiled function with |
| 95 | // an unexpected number of arguments works. |
| 96 | function f(a) { return arguments.length; }; |
| 97 | assertEquals(3, f(1, 2, 3)); |