OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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 --noalways-opt | 28 // Flags: --allow-natives-syntax --noalways-opt |
29 | 29 |
30 function mul(a, b) { | 30 function check(func, input, expected) { |
31 return a * b; | 31 func(-1); |
| 32 func(-1); |
| 33 %OptimizeFunctionOnNextCall(func); |
| 34 assertEquals(expected, func(input)); |
| 35 assertOptimized(func); |
32 } | 36 } |
33 | 37 |
| 38 function mul_by_neg_1(a) { return a * -1; } |
| 39 function mul_by_0(a) { return a * 0; } |
| 40 function mul_by_1(a) { return a * 1; } |
| 41 function mul_by_2(a) { return a * 2; } |
34 | 42 |
35 mul(-1, 2); | 43 check(mul_by_neg_1, 2, -2); |
36 mul(-1, 2); | 44 check(mul_by_0, 2, 0); |
37 %OptimizeFunctionOnNextCall(mul); | 45 check(mul_by_1, 2, 2); |
38 assertEquals(-2, mul(-1, 2)); | 46 check(mul_by_2, 2, 4); |
39 assertOptimized(mul); | 47 |
| 48 function limit_range(a) { |
| 49 // Limit the range of 'a' to enable no-overflow optimizations. |
| 50 return Math.max(Math.min(a | 0, 10), -10); |
| 51 } |
| 52 |
| 53 function mul_by_neg_127(a) { return limit_range(a) * -127; } |
| 54 function mul_by_neg_128(a) { return limit_range(a) * -128; } |
| 55 function mul_by_neg_129(a) { return limit_range(a) * -129; } |
| 56 function mul_by_1023(a) { return limit_range(a) * 1023; } |
| 57 function mul_by_1024(a) { return limit_range(a) * 1024; } |
| 58 function mul_by_1025(a) { return limit_range(a) * 1025; } |
| 59 |
| 60 check(mul_by_neg_127, 2, -254); |
| 61 check(mul_by_neg_128, 2, -256); |
| 62 check(mul_by_neg_129, 2, -258); |
| 63 check(mul_by_1023, 2, 2046); |
| 64 check(mul_by_1024, 2, 2048); |
| 65 check(mul_by_1025, 2, 2050); |
40 | 66 |
41 // Deopt on minus zero. | 67 // Deopt on minus zero. |
42 assertEquals(-0, mul(-1, 0)); | 68 assertEquals(-0, mul_by_neg_128(0)); |
43 assertUnoptimized(mul); | 69 assertUnoptimized(mul_by_neg_128); |
| 70 assertEquals(-0, mul_by_2(-0)); |
| 71 assertUnoptimized(mul_by_2); |
44 | 72 |
45 | 73 // Deopt on overflow. |
46 function mul2(a, b) { | |
47 return a * b; | |
48 } | |
49 | |
50 mul2(-1, 2); | |
51 mul2(-1, 2); | |
52 %OptimizeFunctionOnNextCall(mul2); | |
53 | 74 |
54 // 2^30 is a smi boundary on arm and ia32. | 75 // 2^30 is a smi boundary on arm and ia32. |
55 var two_30 = 1 << 30; | 76 var two_30 = 1 << 30; |
56 // 2^31 is a smi boundary on x64. | 77 // 2^31 is a smi boundary on arm64 and x64. |
57 var two_31 = 2 * two_30; | 78 var two_31 = 2 * two_30; |
58 | 79 |
59 if (%IsValidSmi(two_31)) { | 80 // TODO(rmcilroy): replace after r16361 with: if (%IsValidSmi(two_31)) { |
60 // Deopt on two_31 on x64. | 81 if (true) { |
61 assertEquals(two_31, mul2(-two_31, -1)); | 82 assertEquals(two_31, mul_by_neg_1(-two_31)); |
62 assertUnoptimized(mul2); | 83 assertUnoptimized(mul_by_neg_1); |
63 } else { | 84 } else { |
64 // Deopt on two_30 on ia32. | 85 assertEquals(two_30, mul_by_neg_1(-two_30)); |
65 assertEquals(two_30, mul2(-two_30, -1)); | 86 assertUnoptimized(mul_by_neg_1); |
66 assertUnoptimized(mul2); | |
67 } | 87 } |
OLD | NEW |