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