OLD | NEW |
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 |
(...skipping 166 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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 ia32/x64 flooring correctness. | 187 // Test for flooring correctness. |
188 var values2 = [1, 3, 10, 99, 100, 101, 0x7fffffff]; | 188 var values2 = [1, 3, 10, 99, 100, 101, 0x7fffffff]; |
189 function test_div2() { | 189 function test_div2() { |
190 for (var i = 0; i < values2.length; i++) { | 190 for (var i = 0; i < values2.length; i++) { |
191 for (var j = 0; j < values2.length; j++) { | 191 for (var j = 0; j < values2.length; j++) { |
192 assertEquals(Math.floor(div((values2[i] | 0), (values2[j] | 0))), | 192 assertEquals(Math.floor(div((values2[i] | 0), (values2[j] | 0))), |
193 Math.floor((values2[i] | 0) / (values2[j] | 0))); | 193 Math.floor((values2[i] | 0) / (values2[j] | 0))); |
194 assertEquals(Math.floor(div(-(values2[i] | 0), (values2[j] | 0))), | 194 assertEquals(Math.floor(div(-(values2[i] | 0), (values2[j] | 0))), |
195 Math.floor(-(values2[i] | 0) / (values2[j] | 0))); | 195 Math.floor(-(values2[i] | 0) / (values2[j] | 0))); |
196 assertEquals(Math.floor(div((values2[i] | 0), -(values2[j] | 0))), | 196 assertEquals(Math.floor(div((values2[i] | 0), -(values2[j] | 0))), |
197 Math.floor((values2[i] | 0) / -(values2[j] | 0))); | 197 Math.floor((values2[i] | 0) / -(values2[j] | 0))); |
(...skipping 81 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
279 | 279 |
280 test_div_deopt_minus_zero_v(); | 280 test_div_deopt_minus_zero_v(); |
281 test_div_deopt_overflow_v(); | 281 test_div_deopt_overflow_v(); |
282 test_div_deopt_div_by_zero_v(); | 282 test_div_deopt_div_by_zero_v(); |
283 %OptimizeFunctionOnNextCall(test_div_deopt_minus_zero_v); | 283 %OptimizeFunctionOnNextCall(test_div_deopt_minus_zero_v); |
284 %OptimizeFunctionOnNextCall(test_div_deopt_overflow_v); | 284 %OptimizeFunctionOnNextCall(test_div_deopt_overflow_v); |
285 %OptimizeFunctionOnNextCall(test_div_deopt_div_by_zero_v); | 285 %OptimizeFunctionOnNextCall(test_div_deopt_div_by_zero_v); |
286 test_div_deopt_minus_zero_v(); | 286 test_div_deopt_minus_zero_v(); |
287 test_div_deopt_overflow_v(); | 287 test_div_deopt_overflow_v(); |
288 test_div_deopt_div_by_zero_v(); | 288 test_div_deopt_div_by_zero_v(); |
OLD | NEW |