Index: test/mjsunit/compiler/regress-serialized-slots.js |
diff --git a/test/mjsunit/compiler/regress-serialized-slots.js b/test/mjsunit/compiler/regress-serialized-slots.js |
new file mode 100644 |
index 0000000000000000000000000000000000000000..5eaa3a3151d0e994ae42e7a3c21b25c81448f430 |
--- /dev/null |
+++ b/test/mjsunit/compiler/regress-serialized-slots.js |
@@ -0,0 +1,60 @@ |
+// Copyright 2011 the V8 project authors. All rights reserved. |
+// Redistribution and use in source and binary forms, with or without |
+// modification, are permitted provided that the following conditions are |
+// met: |
+// |
+// * Redistributions of source code must retain the above copyright |
+// notice, this list of conditions and the following disclaimer. |
+// * Redistributions in binary form must reproduce the above |
+// copyright notice, this list of conditions and the following |
+// disclaimer in the documentation and/or other materials provided |
+// with the distribution. |
+// * Neither the name of Google Inc. nor the names of its |
+// contributors may be used to endorse or promote products derived |
+// from this software without specific prior written permission. |
+// |
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
+ |
+function runner(f, expected) { |
Kevin Millikin (Chromium)
2011/01/19 07:39:57
Test code is complicated enough that it needs a co
antonm
2011/01/19 08:18:19
Done.
|
+ for (var i = 0; i < 10000; i++) { |
+ assertEquals(expected, f.call(this, 10)); |
+ } |
+} |
+ |
+Function.prototype.bind = function(thisObject) |
+{ |
+ var func = this; |
+ var args = Array.prototype.slice.call(arguments, 1); |
+ function bound() |
+ { |
+ return func.apply( |
+ thisObject, |
+ args.concat(Array.prototype.slice.call(arguments, 0))); |
+ } |
+ bound.toString = function() { |
+ return "bound: " + func; |
+ }; |
+ return bound; |
+} |
+ |
+function sum(x, y) { |
+ return x + y; |
+} |
+ |
+function test(n) { |
+ runner(sum.bind(this, n), n + 10); |
+} |
+ |
+test(1); |
+test(42); |
+test(239); |