1// Copyright 2008 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
28function f0() {
29  return this;
30}
31
32function f1(a) {
33  return a;
34}
35
36assertSame(this, f0.apply(), "1-0");
37
38assertSame(this, f0.apply(this), "2a");
39assertSame(this, f0.apply(this, new Array(1)), "2b");
40assertSame(this, f0.apply(this, new Array(2)), "2c");
41assertSame(this, f0.apply(this, new Array(4242)), "2d");
42
43assertSame(this, f0.apply(null), "3a");
44assertSame(this, f0.apply(null, new Array(1)), "3b");
45assertSame(this, f0.apply(null, new Array(2)), "3c");
46assertSame(this, f0.apply(this, new Array(4242)), "3d");
47
48assertSame(this, f0.apply(void 0), "4a");
49assertSame(this, f0.apply(void 0, new Array(1)), "4b");
50assertSame(this, f0.apply(void 0, new Array(2)), "4c");
51
52assertEquals(void 0, f1.apply(), "1-1");
53
54assertEquals(void 0, f1.apply(this), "5a");
55assertEquals(void 0, f1.apply(this, new Array(1)), "5b");
56assertEquals(void 0, f1.apply(this, new Array(2)), "5c");
57assertEquals(void 0, f1.apply(this, new Array(4242)), "5d");
58assertEquals(42, f1.apply(this, new Array(42, 43)), "5e");
59assertEquals("foo", f1.apply(this, new Array("foo", "bar", "baz", "bo")), "5f");
60
61assertEquals(void 0, f1.apply(null), "6a");
62assertEquals(void 0, f1.apply(null, new Array(1)), "6b");
63assertEquals(void 0, f1.apply(null, new Array(2)), "6c");
64assertEquals(void 0, f1.apply(null, new Array(4242)), "6d");
65assertEquals(42, f1.apply(null, new Array(42, 43)), "6e");
66assertEquals("foo", f1.apply(null, new Array("foo", "bar", "baz", "bo")), "6f");
67
68assertEquals(void 0, f1.apply(void 0), "7a");
69assertEquals(void 0, f1.apply(void 0, new Array(1)), "7b");
70assertEquals(void 0, f1.apply(void 0, new Array(2)), "7c");
71assertEquals(void 0, f1.apply(void 0, new Array(4242)), "7d");
72assertEquals(42, f1.apply(void 0, new Array(42, 43)), "7e");
73assertEquals("foo", f1.apply(void 0, new Array("foo", "bar", "ba", "b")), "7f");
74
75var arr = new Array(42, "foo", "fish", "horse");
76function j(a, b, c, d, e, f, g, h, i, j, k, l) {
77  return "" + a + b + c + d + e + f + g + h + i + j + k + l;
78}
79
80
81var expect = "42foofishhorse";
82for (var i = 0; i < 8; i++)
83  expect += "undefined";
84assertEquals(expect, j.apply(undefined, arr), "apply to undefined");
85
86assertThrows("f0.apply(this, 1);");
87assertThrows("f0.apply(this, 1, 2);");
88assertThrows("f0.apply(this, 1, new Array(2));");
89
90function f() {
91  var doo = "";
92  for (var i = 0; i < arguments.length; i++) {
93    doo += arguments[i];
94  }
95  return doo;
96}
97
98assertEquals("42foofishhorse", f.apply(this, arr), "apply to this");
99
100function s() {
101  var doo = this;
102  for (var i = 0; i < arguments.length; i++) {
103    doo += arguments[i];
104  }
105  return doo;
106}
107
108assertEquals("bar42foofishhorse", s.apply("bar", arr), "apply to string");
109
110function al() {
111  assertEquals(Object(345), this);
112  return arguments.length + arguments[arguments.length - 1];
113}
114
115for (var j = 1; j < 0x40000000; j <<= 1) {
116  try {
117    var a = new Array(j);
118    a[j - 1] = 42;
119    assertEquals(42 + j, al.apply(345, a));
120  } catch (e) {
121    assertTrue(e.toString().indexOf("Maximum call stack size exceeded") != -1);
122    for (; j < 0x40000000; j <<= 1) {
123      var caught = false;
124      try {
125        a = new Array(j);
126        a[j - 1] = 42;
127        al.apply(345, a);
128        assertUnreachable("Apply of array with length " + a.length +
129                          " should have thrown");
130      } catch (e) {
131        assertTrue(e.toString().indexOf("Maximum call stack size exceeded") != -1);
132        caught = true;
133      }
134      assertTrue(caught, "exception not caught");
135    }
136    break;
137  }
138}
139
140var primes = new Array(0);
141
142function isPrime(possible_prime) {
143  for (var d = 0; d < primes.length; d++) {
144    var p = primes[d];
145    if (possible_prime % p == 0)
146      return false;
147    if (p * p > possible_prime)
148      return true;
149  }
150  return true;
151}
152
153for (var i = 2; i < 10000; i++) {
154  if (isPrime(i)) {
155    primes.push(i);
156  }
157}
158
159assertEquals(1229, primes.length);
160
161var same_primes = Array.prototype.constructor.apply(Array, primes);
162
163for (var i = 0; i < primes.length; i++)
164  assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
165assertEquals(primes.length, same_primes.length, "prime-length");
166
167
168Array.prototype["1"] = "sep";
169
170var holey = new Array(3);
171holey[0] = "mor";
172holey[2] = "er";
173
174assertEquals("morseper", String.prototype.concat.apply("", holey),
175             "moreseper0");
176assertEquals("morseper", String.prototype.concat.apply("", holey, 1),
177             "moreseper1");
178assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2),
179             "moreseper2");
180assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2, 3),
181             "morseper3");
182assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2, 3, 4),
183             "morseper4");
184
185primes[0] = "";
186primes[1] = holey;
187assertThrows("String.prototype.concat.apply.apply('foo', primes)");
188assertEquals("morseper",
189    String.prototype.concat.apply.apply(String.prototype.concat, primes),
190    "moreseper-prime");
191
192delete(Array.prototype["1"]);
193
194// Check correct handling of non-array argument lists.
195assertSame(this, f0.apply(this, {}), "non-array-1");
196assertSame(this, f0.apply(this, { length:1 }), "non-array-2");
197assertEquals(void 0, f1.apply(this, { length:1 }), "non-array-3");
198assertEquals(void 0, f1.apply(this, { 0:"foo" }), "non-array-4");
199assertEquals("foo", f1.apply(this, { length:1, 0:"foo" }), "non-array-5");
200