Andrew Top | ef837fa | 2017-10-04 22:44:25 -0700 | [diff] [blame] | 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 --opt |
| 29 | |
| 30 | function div(g) { |
| 31 | return (g/-1) ^ 1 |
| 32 | } |
Andrew Top | 63c7ad4 | 2019-11-25 16:10:13 -0800 | [diff] [blame] | 33 | %PrepareFunctionForOptimization(div); |
Andrew Top | ef837fa | 2017-10-04 22:44:25 -0700 | [diff] [blame] | 34 | var kMinInt = 1 << 31; |
| 35 | var expected_MinInt = div(kMinInt); |
| 36 | var expected_minus_zero = div(0); |
| 37 | %OptimizeFunctionOnNextCall(div); |
| 38 | assertEquals(expected_MinInt, div(kMinInt)); |
| 39 | assertEquals(expected_minus_zero , div(0)); |
| 40 | |
| 41 | function mul(g) { |
| 42 | return (g * -1) ^ 1 |
| 43 | } |
| 44 | |
Andrew Top | 63c7ad4 | 2019-11-25 16:10:13 -0800 | [diff] [blame] | 45 | %PrepareFunctionForOptimization(mul); |
Andrew Top | ef837fa | 2017-10-04 22:44:25 -0700 | [diff] [blame] | 46 | expected_MinInt = mul(kMinInt); |
| 47 | expected_minus_zero = mul(0); |
| 48 | %OptimizeFunctionOnNextCall(mul); |
| 49 | assertEquals(expected_MinInt, mul(kMinInt)); |
| 50 | assertOptimized(mul); |
| 51 | assertEquals(expected_minus_zero , mul(0)); |
| 52 | assertOptimized(mul); |