Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 | // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
| 3 | // |
| 4 | // Redistribution and use in source and binary forms, with or without |
| 5 | // modification, are permitted provided that the following conditions |
| 6 | // are met: |
| 7 | // 1. Redistributions of source code must retain the above copyright |
| 8 | // notice, this list of conditions and the following disclaimer. |
| 9 | // 2. Redistributions in binary form must reproduce the above copyright |
| 10 | // notice, this list of conditions and the following disclaimer in the |
| 11 | // documentation and/or other materials provided with the distribution. |
| 12 | // |
| 13 | // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY |
| 14 | // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| 15 | // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 16 | // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY |
| 17 | // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 18 | // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 19 | // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON |
| 20 | // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 21 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 22 | // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 23 | |
| 24 | description( |
| 25 | "This tests that integer addition optimizations in the DFG are not performed too overzealously." |
| 26 | ); |
| 27 | |
| 28 | function doAdd(a,b) { |
| 29 | // The point of this test is to see if the DFG CSE's the second (a + b) against the first, after |
| 30 | // optimizing the first to be an integer addition. The first one certainly is an integer addition, |
| 31 | // but the second one isn't - it must either be an integer addition with overflow checking, or a |
| 32 | // double addition. |
| 33 | return {a:((a + b) | 0), b:(a + b)}; |
| 34 | } |
| 35 | |
| 36 | for (var i = 0; i < 1000; ++i) { |
| 37 | // Create numbers big enough that we'll start seeing doubles only after about 200 invocations. |
| 38 | var a = i * 1000 * 1000 * 10; |
| 39 | var b = i * 1000 * 1000 * 10 + 1; |
| 40 | var result = doAdd(a, b); |
| 41 | |
| 42 | // Use eval() for computing the correct result, to force execution to happen outside the DFG. |
| 43 | shouldBe("result.a", "" + eval("((" + a + " + " + b + ") | 0)")) |
| 44 | shouldBe("result.b", "" + eval(a + " + " + b)) |
| 45 | } |