1// Copyright 2011 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 that we can handle function calls with up to 32766 arguments, and
29// that function calls with more arguments throw an exception.  Apply a
30// similar limit to the number of function parameters.
31
32// See http://code.google.com/p/v8/issues/detail?id=1122 and
33// http://code.google.com/p/v8/issues/detail?id=1413.
34
35function function_with_n_params_and_m_args(n, m) {
36  test_prefix = 'prefix ';
37  test_suffix = ' suffix';
38  var source = 'test_prefix + (function f(';
39  for (var arg = 0; arg < n ; arg++) {
40    if (arg != 0) source += ',';
41    source += 'arg' + arg;
42  }
43  source += ') { return arg' + (n - n % 2) / 2 + '; })(';
44  for (var arg = 0; arg < m ; arg++) {
45    if (arg != 0) source += ',';
46    source += arg;
47  }
48  source += ') + test_suffix';
49  return eval(source);
50}
51
52assertEquals('prefix 4000 suffix',
53             function_with_n_params_and_m_args(8000, 8000));
54assertEquals('prefix 3000 suffix',
55             function_with_n_params_and_m_args(6000, 8000));
56assertEquals('prefix 5000 suffix',
57             function_with_n_params_and_m_args(10000, 8000));
58assertEquals('prefix 9000 suffix',
59             function_with_n_params_and_m_args(18000, 18000));
60assertEquals('prefix 16000 suffix',
61             function_with_n_params_and_m_args(32000, 32000));
62assertEquals('prefix undefined suffix',
63             function_with_n_params_and_m_args(32000, 10000));
64
65assertThrows("function_with_n_params_and_m_args(66000, 30000)");
66assertThrows("function_with_n_params_and_m_args(30000, 66000)");
67