Index: test/mjsunit/field-type-tracking.js |
diff --git a/test/mjsunit/field-type-tracking.js b/test/mjsunit/field-type-tracking.js |
new file mode 100644 |
index 0000000000000000000000000000000000000000..15141e8c798561922bf33b00917107a47d1ae9ec |
--- /dev/null |
+++ b/test/mjsunit/field-type-tracking.js |
@@ -0,0 +1,117 @@ |
+// Copyright 2014 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. |
+ |
+// Flags: --allow-natives-syntax --nostress-opt --track-field-types |
+ |
+(function() { |
+ function A() { |
+ this.a = "A"; |
+ } |
+ function readA(x) { |
+ return x.a; |
+ } |
+ var a = new A(); |
+ assertUnoptimized(readA); |
+ readA(a); readA(a); readA(a); |
+ %OptimizeFunctionOnNextCall(readA); |
+ assertEquals(readA(a), "A"); |
+ assertOptimized(readA); |
+ |
+ var b = new A(); |
+ b.b = "B"; |
+ assertEquals(readA(b), "A"); |
+ assertUnoptimized(readA); |
+ %OptimizeFunctionOnNextCall(readA); |
+ assertEquals(readA(a), "A"); |
+ assertOptimized(readA); |
+ assertEquals(readA(a), "A"); |
+ assertEquals(readA(b), "A"); |
+ assertOptimized(readA); |
+ |
+ function readAFromB(x) { |
+ return x.a; |
+ } |
+ assertUnoptimized(readAFromB); |
+ readAFromB(b); readAFromB(b); readAFromB(b); |
+ %OptimizeFunctionOnNextCall(readAFromB); |
+ assertEquals(readAFromB(b), "A"); |
+ assertOptimized(readAFromB); |
+ |
+ var c = new A(); |
+ c.c = "C"; |
+ assertOptimized(readA); |
+ assertOptimized(readAFromB); |
+ c.a = [1]; |
+ assertUnoptimized(readA); |
+ assertUnoptimized(readAFromB); |
+ assertEquals(readA(a), "A"); |
+ assertEquals(readA(b), "A"); |
+ assertEquals(readA(c), [1]); |
+ assertEquals(readAFromB(b), "A"); |
+ |
+ %OptimizeFunctionOnNextCall(readA); |
+ assertEquals(readA(a), "A"); |
+ %OptimizeFunctionOnNextCall(readAFromB); |
+ assertEquals(readAFromB(b), "A"); |
+ assertOptimized(readA); |
+ a.a = [1]; |
+ assertEquals(readA(a), [1]); |
+ assertEquals(readA(b), "A"); |
+ assertEquals(readA(c), [1]); |
+ assertOptimized(readA); |
+ b.a = [1]; |
+ assertEquals(readA(a), [1]); |
+ assertEquals(readA(b), [1]); |
+ assertEquals(readA(c), [1]); |
+ assertOptimized(readA); |
+ assertOptimized(readAFromB); |
+})(); |
+ |
+(function() { |
+ function A() { this.x = 0; } |
+ A.prototype = {y: 20}; |
+ function B(o) { return o.a.y; } |
+ function C() { this.a = new A(); } |
+ |
+ B(new C()); |
+ B(new C()); |
+ %OptimizeFunctionOnNextCall(B); |
+ var c = new C(); |
+ assertEquals(20, B(c)); |
+ assertOptimized(B); |
+ c.a.y = 10; |
+ assertEquals(10, B(c)); |
+ assertUnoptimized(B); |
+ |
+ var c = new C(); |
+ %OptimizeFunctionOnNextCall(B); |
+ assertEquals(20, B(c)); |
+ assertOptimized(B); |
+ c.a.y = 30; |
+ assertEquals(30, B(c)); |
+ assertOptimized(B); |
+})(); |