1 // Copyright 2010 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 // See: http://code.google.com/p/v8/issues/detail?id=1278 29 30 // Test that that handling of 0/-0 is correct for binary operations when the 31 // TypeRecordingBinaryOpStub transitions through different states. 32 33 function add(x, y) { 34 return x + y; 35 } 36 37 function sub(x, y) { 38 return x - y; 39 } 40 41 function mul(x, y) { 42 return x * y; 43 } 44 45 function div(x, y) { 46 return x / y; 47 } 48 49 for (var i = 0; i < 10; i++) { 50 assertEquals(0, add(0, 0)); 51 assertEquals(0, add(0, -0)); 52 assertEquals(0, add(-0, 0)); 53 assertEquals(-0, add(-0, -0)); 54 55 assertEquals(0, sub(0, 0)); 56 assertEquals(0, sub(0, -0)); 57 assertEquals(-0, sub(-0, 0)); 58 assertEquals(0, sub(-0, -0)); 59 60 assertEquals(0, mul(0, 0)); 61 assertEquals(-0, mul(0, -0)); 62 assertEquals(-0, mul(-0, 0)); 63 assertEquals(0, mul(-0, -0)); 64 65 assertEquals(0, div(0, 1)); 66 assertEquals(-0, div(0, -1)); 67 assertEquals(-0, div(-0, 1)); 68 assertEquals(0, div(-0, -1)); 69 } 70
