OLD | NEW |
(Empty) | |
| 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 // Flags: --allow-natives-syntax |
| 29 function init_array(a) { |
| 30 for (var i = 0; i < 10; ++i ){ |
| 31 a[i] = i; |
| 32 } |
| 33 } |
| 34 |
| 35 function init_sparse_array(a) { |
| 36 for (var i = 0; i < 10; ++i ){ |
| 37 a[i] = i; |
| 38 } |
| 39 a[5000000] = 256; |
| 40 assertTrue(%HasDictionaryElements(a)); |
| 41 } |
| 42 |
| 43 function testPolymorphicLoads() { |
| 44 function make_polymorphic_load_function() { |
| 45 function load(a, i) { |
| 46 return a[i]; |
| 47 } |
| 48 |
| 49 var object_array = new Object; |
| 50 var sparse_object_array = new Object; |
| 51 var js_array = new Array(10); |
| 52 var sparse_js_array = new Array(5000001); |
| 53 |
| 54 init_array(object_array); |
| 55 init_array(js_array); |
| 56 init_sparse_array(sparse_object_array); |
| 57 init_sparse_array(sparse_js_array); |
| 58 |
| 59 return load; |
| 60 } |
| 61 |
| 62 var object_array = new Object; |
| 63 var sparse_object_array = new Object; |
| 64 var js_array = new Array(10); |
| 65 var sparse_js_array = new Array(5000001); |
| 66 |
| 67 init_array(object_array); |
| 68 init_array(js_array); |
| 69 init_sparse_array(sparse_object_array); |
| 70 init_sparse_array(sparse_js_array); |
| 71 |
| 72 // load() should now use polymorphic element loads. |
| 73 load = make_polymorphic_load_function(); |
| 74 assertEquals(1, load(object_array, 1)); |
| 75 load = make_polymorphic_load_function(); |
| 76 assertEquals(1, load(js_array, 1)); |
| 77 load = make_polymorphic_load_function(); |
| 78 assertEquals(1, load(sparse_object_array, 1)); |
| 79 load = make_polymorphic_load_function(); |
| 80 assertEquals(1, load(sparse_js_array, 1)); |
| 81 |
| 82 load = make_polymorphic_load_function(); |
| 83 assertEquals(undefined, load(js_array, new Object())); |
| 84 load = make_polymorphic_load_function(); |
| 85 assertEquals(undefined, load(object_array, new Object())); |
| 86 load = make_polymorphic_load_function(); |
| 87 assertEquals(undefined, load(sparse_js_array, new Object())); |
| 88 load = make_polymorphic_load_function(); |
| 89 assertEquals(undefined, load(sparse_object_array, new Object())); |
| 90 |
| 91 // Try with crankshaft. |
| 92 load = make_polymorphic_load_function(); |
| 93 %OptimizeFunctionOnNextCall(load); |
| 94 assertEquals(1, load(object_array, 1)); |
| 95 assertEquals(1, load(js_array, 1)); |
| 96 assertEquals(1, load(sparse_object_array, 1)); |
| 97 assertEquals(1, load(sparse_js_array, 1)); |
| 98 |
| 99 load = make_polymorphic_load_function(); |
| 100 %OptimizeFunctionOnNextCall(load); |
| 101 assertEquals(undefined, load(js_array, new Object())); |
| 102 load = make_polymorphic_load_function(); |
| 103 %OptimizeFunctionOnNextCall(load); |
| 104 assertEquals(undefined, load(object_array, new Object())); |
| 105 load = make_polymorphic_load_function(); |
| 106 %OptimizeFunctionOnNextCall(load); |
| 107 assertEquals(undefined, load(sparse_js_array, new Object())); |
| 108 load = make_polymorphic_load_function(); |
| 109 %OptimizeFunctionOnNextCall(load); |
| 110 assertEquals(undefined, load(sparse_object_array, new Object())); |
| 111 } |
| 112 |
| 113 function testPolymorphicStores() { |
| 114 function make_polymorphic_store_function() { |
| 115 function store(a, i, val) { |
| 116 a[i] = val; |
| 117 } |
| 118 |
| 119 var object_array = new Object; |
| 120 var sparse_object_array = new Object; |
| 121 var js_array = new Array(10); |
| 122 var sparse_js_array = new Array(5000001); |
| 123 |
| 124 init_array(object_array); |
| 125 init_array(js_array); |
| 126 init_sparse_array(sparse_object_array); |
| 127 init_sparse_array(sparse_js_array); |
| 128 |
| 129 store(object_array, 1, 256); |
| 130 store(js_array, 1, 256); |
| 131 store(sparse_object_array, 1, 256); |
| 132 store(sparse_js_array, 1, 256); |
| 133 |
| 134 return store; |
| 135 } |
| 136 |
| 137 var object_array = new Object; |
| 138 var sparse_object_array = new Object; |
| 139 var js_array = new Array(10); |
| 140 var sparse_js_array = new Array(5000001); |
| 141 |
| 142 init_array(object_array); |
| 143 init_array(js_array); |
| 144 init_sparse_array(sparse_object_array); |
| 145 init_sparse_array(sparse_js_array); |
| 146 |
| 147 store = make_polymorphic_store_function(); |
| 148 store(object_array, 2, 257); |
| 149 store = make_polymorphic_store_function(); |
| 150 store(js_array, 2, 257); |
| 151 store = make_polymorphic_store_function(); |
| 152 store(sparse_object_array, 2, 257); |
| 153 store = make_polymorphic_store_function(); |
| 154 store(sparse_js_array, 2, 257); |
| 155 |
| 156 assertEquals(257, object_array[2]); |
| 157 assertEquals(257, js_array[2]); |
| 158 assertEquals(257, sparse_js_array[2]); |
| 159 assertEquals(257, sparse_object_array[2]); |
| 160 |
| 161 // Now try Crankshaft optimized polymorphic stores |
| 162 store = make_polymorphic_store_function(); |
| 163 %OptimizeFunctionOnNextCall(store); |
| 164 store(object_array, 3, 258); |
| 165 store = make_polymorphic_store_function(); |
| 166 %OptimizeFunctionOnNextCall(store); |
| 167 store(js_array, 3, 258); |
| 168 store = make_polymorphic_store_function(); |
| 169 %OptimizeFunctionOnNextCall(store); |
| 170 store(sparse_object_array, 3, 258); |
| 171 store = make_polymorphic_store_function(); |
| 172 %OptimizeFunctionOnNextCall(store); |
| 173 store(sparse_js_array, 3, 258); |
| 174 |
| 175 assertEquals(258, object_array[3]); |
| 176 assertEquals(258, js_array[3]); |
| 177 assertEquals(258, sparse_js_array[3]); |
| 178 assertEquals(258, sparse_object_array[3]); |
| 179 } |
| 180 |
| 181 testPolymorphicLoads(); |
| 182 testPolymorphicStores(); |
OLD | NEW |