| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 // Flags: --allow-natives-syntax --load-elimination | 28 // Flags: --allow-natives-syntax --store-elimination |
| 29 | 29 |
| 30 // Test local load elimination of redundant loads and stores. | 30 // Test local elimination of unobservable stores. |
| 31 | 31 |
| 32 function B(x, y) { | 32 function B(x, y) { |
| 33 this.x = x; | 33 this.x = x; |
| 34 this.y = y; | 34 this.y = y; |
| 35 return this; | 35 return this; |
| 36 } | 36 } |
| 37 | 37 |
| 38 function test_params1(a, b) { | 38 function test_store_store() { |
| 39 var i = a.x; | 39 var a = new B(1, 2); |
| 40 var j = a.x; | 40 a.x = 3; // eliminatable. |
| 41 var k = b.x; | 41 a.x = 4; |
| 42 var l = b.x; | 42 return a.x; |
| 43 return i + j + k + l; | |
| 44 } | 43 } |
| 45 | 44 |
| 46 assertEquals(14, test_params1(new B(3, 4), new B(4, 5))); | 45 function test_store_load_store1() { |
| 47 assertEquals(110, test_params1(new B(11, 7), new B(44, 8))); | 46 var a = new B(6, 7); |
| 48 | 47 a.x = 3; // eliminatable. |
| 49 %OptimizeFunctionOnNextCall(test_params1); | 48 var r = a.y; |
| 50 | 49 a.x = 4; |
| 51 assertEquals(6, test_params1(new B(1, 7), new B(2, 8))); | 50 return r; |
| 52 | |
| 53 function test_params2(a, b) { | |
| 54 var o = new B(a + 1, b); | |
| 55 o.x = a; | |
| 56 var i = o.x; | |
| 57 o.x = a; | |
| 58 var j = o.x; | |
| 59 o.x = b; | |
| 60 var k = o.x; | |
| 61 o.x = b; | |
| 62 var l = o.x; | |
| 63 return i + j + k + l; | |
| 64 } | 51 } |
| 65 | 52 |
| 66 assertEquals(14, test_params2(3, 4)); | 53 function test_store_load_store2() { |
| 67 assertEquals(110, test_params2(11, 44)); | 54 var a = new B(6, 8); |
| 55 a.x = 3; // not eliminatable, unless next load is eliminated. |
| 56 var r = a.x; |
| 57 a.x = 4; |
| 58 return r; |
| 59 } |
| 68 | 60 |
| 69 %OptimizeFunctionOnNextCall(test_params2); | 61 function test_store_call_store() { |
| 62 var a = new B(2, 9); |
| 63 a.x = 3; // not eliminatable. |
| 64 killall(); |
| 65 a.x = 4; |
| 66 return a.y; |
| 67 } |
| 70 | 68 |
| 71 assertEquals(6, test_params2(1, 2)); | 69 function test_store_deopt_store() { |
| 70 var a = new B(2, 1); |
| 71 a.x = 3; // not eliminatable (implicit ValueOf following) |
| 72 var c = a + 2; |
| 73 a.x = 4; |
| 74 return a.y; |
| 75 } |
| 76 |
| 77 function killall() { |
| 78 try { } catch(e) { } |
| 79 } |
| 80 |
| 81 %NeverOptimizeFunction(killall); |
| 82 |
| 83 function test(x, f) { |
| 84 assertEquals(x, f()); |
| 85 assertEquals(x, f()); |
| 86 %OptimizeFunctionOnNextCall(f); |
| 87 assertEquals(x, f()); |
| 88 } |
| 89 |
| 90 test(4, test_store_store); |
| 91 test(7, test_store_load_store1); |
| 92 test(3, test_store_load_store2); |
| 93 test(9, test_store_call_store); |
| 94 test(1, test_store_deopt_store); |
| OLD | NEW |