Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(9)

Side by Side Diff: test/mjsunit/math-floor-of-div.js

Issue 11316105: ARM: Use division instructions in lithium and stubs (Closed) Base URL: http://v8.googlecode.com/svn/branches/bleeding_edge/
Patch Set: Created 8 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright 2012 the V8 project authors. All rights reserved. 1 // Copyright 2012 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 --nouse_inlining 28 // Flags: --allow-natives-syntax --nouse_inlining --enable_sudiv
29 29
30 // Use this function as reference. Make sure it is not inlined. 30 // Use this function as reference. Make sure it is not inlined.
31 function div(a, b) { 31 function div(a, b) {
32 return a / b; 32 return a / b;
33 } 33 }
34 34
35 var limit = 0x1000000; 35 var limit = 0x1000000;
36 var exhaustive_limit = 100; 36 var exhaustive_limit = 100;
37 var step = 10; 37 var step = 10;
38 var values = [0x10000001, 38 var values = [0x10000001,
(...skipping 138 matching lines...) Expand 10 before | Expand all | Expand 10 after
177 assertEquals(Math.floor(div(-(values[i] | 0), -(values[j] | 0))), 177 assertEquals(Math.floor(div(-(values[i] | 0), -(values[j] | 0))),
178 Math.floor(-(values[i] | 0) / -(values[j] | 0))); 178 Math.floor(-(values[i] | 0) / -(values[j] | 0)));
179 } 179 }
180 } 180 }
181 } 181 }
182 182
183 test_div(); 183 test_div();
184 %OptimizeFunctionOnNextCall(test_div); 184 %OptimizeFunctionOnNextCall(test_div);
185 test_div(); 185 test_div();
186 186
187 // Test for negative zero and overflow. 187 // Test for negative zero, overflow and division by 0.
188 // Separate the tests to prevent deoptimizations from making the other optimized 188 // Separate the tests to prevent deoptimizations from making the other optimized
189 // test unreachable. 189 // test unreachable.
190 190
191 function IsNegativeZero(x) { 191 function IsNegativeZero(x) {
192 assertTrue(x == 0); // Is 0 or -0. 192 assertTrue(x == 0); // Is 0 or -0.
193 var y = 1 / x; 193 var y = 1 / x;
194 assertFalse(isFinite(y)); 194 assertFalse(isFinite(y));
195 return y < 0; 195 return y < 0;
196 } 196 }
197 197
198 function test_div_deopt_minus_zero() { 198 function test_div_deopt_minus_zero() {
199 var zero_in_array = [0]; 199 var zero_in_array = [0];
200 assertTrue(IsNegativeZero(Math.floor((zero_in_array[0] | 0) / -1))); 200 for (var i = 0; i < 2; ++i) {
201 assertTrue(IsNegativeZero(Math.floor((zero_in_array[0] | 0) / -1)));
202 }
201 } 203 }
202 204
203 function test_div_deopt_overflow() { 205 function test_div_deopt_overflow() {
204 // We box the value in an array to avoid constant propagation. 206 // We box the value in an array to avoid constant propagation.
205 var min_int_in_array = [-2147483648]; 207 var min_int_in_array = [-2147483648];
206 // We use '| 0' to force the representation to int32. 208 for (var i = 0; i < 2; ++i) {
207 assertEquals(-min_int_in_array[0], 209 // We use '| 0' to force the representation to int32.
208 Math.floor((min_int_in_array[0] | 0) / -1)); 210 assertEquals(-min_int_in_array[0],
211 Math.floor((min_int_in_array[0] | 0) / -1));
212 }
213 }
214
215 function test_div_deopt_div_by_zero() {
216 for (var i = 0; i < 2; ++i) {
217 assertEquals(div(i, 0),
218 Math.floor(i / 0));
219 }
209 } 220 }
210 221
211 test_div_deopt_minus_zero(); 222 test_div_deopt_minus_zero();
212 test_div_deopt_overflow(); 223 test_div_deopt_overflow();
224 test_div_deopt_div_by_zero();
213 %OptimizeFunctionOnNextCall(test_div_deopt_minus_zero); 225 %OptimizeFunctionOnNextCall(test_div_deopt_minus_zero);
214 %OptimizeFunctionOnNextCall(test_div_deopt_overflow); 226 %OptimizeFunctionOnNextCall(test_div_deopt_overflow);
227 %OptimizeFunctionOnNextCall(test_div_deopt_div_by_zero);
215 test_div_deopt_minus_zero(); 228 test_div_deopt_minus_zero();
216 test_div_deopt_overflow(); 229 test_div_deopt_overflow();
230 test_div_deopt_div_by_zero();
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698