1 // Copyright 2006-2008 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 #include <stdlib.h> 29 30 #include "v8.h" 31 32 #include "platform.h" 33 #include "cctest.h" 34 #include "diy-fp.h" 35 36 37 using namespace v8::internal; 38 39 40 TEST(Subtract) { 41 DiyFp diy_fp1 = DiyFp(3, 0); 42 DiyFp diy_fp2 = DiyFp(1, 0); 43 DiyFp diff = DiyFp::Minus(diy_fp1, diy_fp2); 44 45 CHECK(2 == diff.f()); // NOLINT 46 CHECK_EQ(0, diff.e()); 47 diy_fp1.Subtract(diy_fp2); 48 CHECK(2 == diy_fp1.f()); // NOLINT 49 CHECK_EQ(0, diy_fp1.e()); 50 } 51 52 53 TEST(Multiply) { 54 DiyFp diy_fp1 = DiyFp(3, 0); 55 DiyFp diy_fp2 = DiyFp(2, 0); 56 DiyFp product = DiyFp::Times(diy_fp1, diy_fp2); 57 58 CHECK(0 == product.f()); // NOLINT 59 CHECK_EQ(64, product.e()); 60 diy_fp1.Multiply(diy_fp2); 61 CHECK(0 == diy_fp1.f()); // NOLINT 62 CHECK_EQ(64, diy_fp1.e()); 63 64 diy_fp1 = DiyFp(V8_2PART_UINT64_C(0x80000000, 00000000), 11); 65 diy_fp2 = DiyFp(2, 13); 66 product = DiyFp::Times(diy_fp1, diy_fp2); 67 CHECK(1 == product.f()); // NOLINT 68 CHECK_EQ(11 + 13 + 64, product.e()); 69 70 // Test rounding. 71 diy_fp1 = DiyFp(V8_2PART_UINT64_C(0x80000000, 00000001), 11); 72 diy_fp2 = DiyFp(1, 13); 73 product = DiyFp::Times(diy_fp1, diy_fp2); 74 CHECK(1 == product.f()); // NOLINT 75 CHECK_EQ(11 + 13 + 64, product.e()); 76 77 diy_fp1 = DiyFp(V8_2PART_UINT64_C(0x7fffffff, ffffffff), 11); 78 diy_fp2 = DiyFp(1, 13); 79 product = DiyFp::Times(diy_fp1, diy_fp2); 80 CHECK(0 == product.f()); // NOLINT 81 CHECK_EQ(11 + 13 + 64, product.e()); 82 83 // Halfway cases are allowed to round either way. So don't check for it. 84 85 // Big numbers. 86 diy_fp1 = DiyFp(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF), 11); 87 diy_fp2 = DiyFp(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF), 13); 88 // 128bit result: 0xfffffffffffffffe0000000000000001 89 product = DiyFp::Times(diy_fp1, diy_fp2); 90 CHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFe) == product.f()); 91 CHECK_EQ(11 + 13 + 64, product.e()); 92 } 93
