OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 15 matching lines...) Expand all Loading... |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "config.h" | 28 #include "config.h" |
29 | 29 |
30 #include "diy-fp.h" | 30 #include "diy-fp.h" |
31 #include "utils.h" | 31 #include "utils.h" |
32 | 32 |
33 namespace WTF { | 33 namespace WTF { |
34 | 34 |
35 namespace double_conversion { | 35 namespace double_conversion { |
36 | 36 |
37 void DiyFp::Multiply(const DiyFp& other) { | 37 void DiyFp::Multiply(const DiyFp& other) { |
38 // Simply "emulates" a 128 bit multiplication. | 38 // Simply "emulates" a 128 bit multiplication. |
39 // However: the resulting number only contains 64 bits. The least | 39 // However: the resulting number only contains 64 bits. The least |
40 // significant 64 bits are only used for rounding the most significant 6
4 | 40 // significant 64 bits are only used for rounding the most significant 6
4 |
41 // bits. | 41 // bits. |
42 const uint64_t kM32 = 0xFFFFFFFFU; | 42 const uint64_t kM32 = 0xFFFFFFFFU; |
43 uint64_t a = f_ >> 32; | 43 uint64_t a = f_ >> 32; |
44 uint64_t b = f_ & kM32; | 44 uint64_t b = f_ & kM32; |
45 uint64_t c = other.f_ >> 32; | 45 uint64_t c = other.f_ >> 32; |
46 uint64_t d = other.f_ & kM32; | 46 uint64_t d = other.f_ & kM32; |
47 uint64_t ac = a * c; | 47 uint64_t ac = a * c; |
48 uint64_t bc = b * c; | 48 uint64_t bc = b * c; |
49 uint64_t ad = a * d; | 49 uint64_t ad = a * d; |
50 uint64_t bd = b * d; | 50 uint64_t bd = b * d; |
51 uint64_t tmp = (bd >> 32) + (ad & kM32) + (bc & kM32); | 51 uint64_t tmp = (bd >> 32) + (ad & kM32) + (bc & kM32); |
52 // By adding 1U << 31 to tmp we round the final result. | 52 // By adding 1U << 31 to tmp we round the final result. |
53 // Halfway cases will be round up. | 53 // Halfway cases will be round up. |
54 tmp += 1U << 31; | 54 tmp += 1U << 31; |
55 uint64_t result_f = ac + (ad >> 32) + (bc >> 32) + (tmp >> 32); | 55 uint64_t result_f = ac + (ad >> 32) + (bc >> 32) + (tmp >> 32); |
56 e_ += other.e_ + 64; | 56 e_ += other.e_ + 64; |
57 f_ = result_f; | 57 f_ = result_f; |
58 } | 58 } |
59 | 59 |
60 } // namespace double_conversion | 60 } // namespace double_conversion |
61 | 61 |
62 } // namespace WTF | 62 } // namespace WTF |
OLD | NEW |