diy-fp.h 2.54 KB
Newer Older
1
// Copyright 2011 the V8 project authors. All rights reserved.
2 3
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
4

5 6
#ifndef V8_NUMBERS_DIY_FP_H_
#define V8_NUMBERS_DIY_FP_H_
7

8 9 10
#include <stdint.h>

#include "src/base/logging.h"
11
#include "src/base/macros.h"
12

13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
namespace v8 {
namespace internal {

// This "Do It Yourself Floating Point" class implements a floating-point number
// with a uint64 significand and an int exponent. Normalized DiyFp numbers will
// have the most significant bit of the significand set.
// Multiplication and Subtraction do not normalize their results.
// DiyFp are not designed to contain special doubles (NaN and Infinity).
class DiyFp {
 public:
  static const int kSignificandSize = 64;

  DiyFp() : f_(0), e_(0) {}
  DiyFp(uint64_t f, int e) : f_(f), e_(e) {}

  // this = this - other.
  // The exponents of both numbers must be the same and the significand of this
  // must be bigger than the significand of other.
  // The result will not be normalized.
  void Subtract(const DiyFp& other) {
33 34
    DCHECK(e_ == other.e_);
    DCHECK(f_ >= other.f_);
35 36 37 38 39 40 41 42 43 44 45 46 47
    f_ -= other.f_;
  }

  // Returns a - b.
  // The exponents of both numbers must be the same and this must be bigger
  // than other. The result will not be normalized.
  static DiyFp Minus(const DiyFp& a, const DiyFp& b) {
    DiyFp result = a;
    result.Subtract(b);
    return result;
  }

  // this = this * other.
48
  V8_EXPORT_PRIVATE void Multiply(const DiyFp& other);
49 50 51 52 53 54 55 56 57

  // returns a * b;
  static DiyFp Times(const DiyFp& a, const DiyFp& b) {
    DiyFp result = a;
    result.Multiply(b);
    return result;
  }

  void Normalize() {
58
    DCHECK_NE(f_, 0);
59 60 61 62 63
    uint64_t f = f_;
    int e = e_;

    // This method is mainly called for normalizing boundaries. In general
    // boundaries need to be shifted by 10 bits. We thus optimize for this case.
64
    const uint64_t k10MSBits = static_cast<uint64_t>(0x3FF) << 54;
65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
    while ((f & k10MSBits) == 0) {
      f <<= 10;
      e -= 10;
    }
    while ((f & kUint64MSB) == 0) {
      f <<= 1;
      e--;
    }
    f_ = f;
    e_ = e;
  }

  static DiyFp Normalize(const DiyFp& a) {
    DiyFp result = a;
    result.Normalize();
    return result;
  }

  uint64_t f() const { return f_; }
  int e() const { return e_; }

  void set_f(uint64_t new_value) { f_ = new_value; }
  void set_e(int new_value) { e_ = new_value; }

 private:
90
  static const uint64_t kUint64MSB = static_cast<uint64_t>(1) << 63;
91 92 93 94 95

  uint64_t f_;
  int e_;
};

96 97
}  // namespace internal
}  // namespace v8
98

99
#endif  // V8_NUMBERS_DIY_FP_H_