Ben Murdoch | 3fb3ca8 | 2011-12-02 17:19:32 +0000 | [diff] [blame] | 1 | // Copyright 2011 the V8 project authors. All rights reserved. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame^] | 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
Andrei Popescu | 402d937 | 2010-02-26 13:31:12 +0000 | [diff] [blame] | 4 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame^] | 5 | #include "include/v8stdint.h" |
| 6 | #include "src/base/logging.h" |
| 7 | #include "src/diy-fp.h" |
| 8 | #include "src/globals.h" |
Andrei Popescu | 402d937 | 2010-02-26 13:31:12 +0000 | [diff] [blame] | 9 | |
| 10 | namespace v8 { |
| 11 | namespace internal { |
| 12 | |
Steve Block | 6ded16b | 2010-05-10 14:33:55 +0100 | [diff] [blame] | 13 | void DiyFp::Multiply(const DiyFp& other) { |
| 14 | // Simply "emulates" a 128 bit multiplication. |
| 15 | // However: the resulting number only contains 64 bits. The least |
| 16 | // significant 64 bits are only used for rounding the most significant 64 |
| 17 | // bits. |
| 18 | const uint64_t kM32 = 0xFFFFFFFFu; |
| 19 | uint64_t a = f_ >> 32; |
| 20 | uint64_t b = f_ & kM32; |
| 21 | uint64_t c = other.f_ >> 32; |
| 22 | uint64_t d = other.f_ & kM32; |
| 23 | uint64_t ac = a * c; |
| 24 | uint64_t bc = b * c; |
| 25 | uint64_t ad = a * d; |
| 26 | uint64_t bd = b * d; |
| 27 | uint64_t tmp = (bd >> 32) + (ad & kM32) + (bc & kM32); |
| 28 | // By adding 1U << 31 to tmp we round the final result. |
| 29 | // Halfway cases will be round up. |
| 30 | tmp += 1U << 31; |
| 31 | uint64_t result_f = ac + (ad >> 32) + (bc >> 32) + (tmp >> 32); |
| 32 | e_ += other.e_ + 64; |
| 33 | f_ = result_f; |
| 34 | } |
Andrei Popescu | 402d937 | 2010-02-26 13:31:12 +0000 | [diff] [blame] | 35 | |
| 36 | } } // namespace v8::internal |