1 // Copyright 2013 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 // Flags: --allow-natives-syntax --nouse-osr --expose-gc 29 30 // Test loop barrier when folding allocations. 31 32 function f() { 33 var elem1 = [1,2,3]; 34 for (var i=0; i < 100000; i++) { 35 var bar = [1]; 36 } 37 var elem2 = [1,2,3]; 38 return elem2; 39 } 40 41 f(); f(); f(); 42 %OptimizeFunctionOnNextCall(f); 43 var result = f(); 44 45 gc(); 46 47 assertEquals(result[2], 3); 48 49 // Test allocation folding of doubles. 50 51 function doubles() { 52 var elem1 = [1.1, 1.2]; 53 var elem2 = [2.1, 2.2]; 54 return elem2; 55 } 56 57 doubles(); doubles(); doubles(); 58 %OptimizeFunctionOnNextCall(doubles); 59 result = doubles(); 60 61 gc(); 62 63 assertEquals(result[1], 2.2); 64 65 // Test allocation folding of doubles into non-doubles. 66 67 function doubles_int() { 68 var elem1 = [2, 3]; 69 var elem2 = [2.1, 3.1]; 70 return elem2; 71 } 72 73 doubles_int(); doubles_int(); doubles_int(); 74 %OptimizeFunctionOnNextCall(doubles_int); 75 result = doubles_int(); 76 77 gc(); 78 79 assertEquals(result[1], 3.1); 80 81 // Test allocation folding over a branch. 82 83 function branch_int(left) { 84 var elem1 = [1, 2]; 85 var elem2; 86 if (left) { 87 elem2 = [3, 4]; 88 } else { 89 elem2 = [5, 6]; 90 } 91 return elem2; 92 } 93 94 branch_int(1); branch_int(1); branch_int(1); 95 %OptimizeFunctionOnNextCall(branch_int); 96 result = branch_int(1); 97 var result2 = branch_int(0); 98 99 gc(); 100 101 assertEquals(result[1], 4); 102 assertEquals(result2[1], 6); 103 104 // Test to almost exceed the Page::MaxRegularHeapObjectSize limit. 105 106 function boom() { 107 var a1 = new Array(84632); 108 var a2 = new Array(84632); 109 var a3 = new Array(84632); 110 return [ a1, a2, a3 ]; 111 } 112 113 boom(); boom(); boom(); 114 %OptimizeFunctionOnNextCall(boom); 115 boom(); 116
