_ZN17double_conversion6Bignum8RawBigitEi:
   36|   973k|Bignum::Chunk& Bignum::RawBigit(const int index) {
   37|   973k|  DOUBLE_CONVERSION_ASSERT(static_cast<unsigned>(index) < kBigitCapacity);
  ------------------
  |  |   47|   973k|    assert(condition)
  ------------------
   38|      0|  return bigits_buffer_[index];
   39|   973k|}
_ZNK17double_conversion6Bignum8RawBigitEi:
   42|  17.9k|const Bignum::Chunk& Bignum::RawBigit(const int index) const {
   43|  17.9k|  DOUBLE_CONVERSION_ASSERT(static_cast<unsigned>(index) < kBigitCapacity);
  ------------------
  |  |   47|  17.9k|    assert(condition)
  ------------------
   44|      0|  return bigits_buffer_[index];
   45|  17.9k|}
_ZN17double_conversion6Bignum12AssignUInt64Em:
   65|  2.97k|void Bignum::AssignUInt64(uint64_t value) {
   66|  2.97k|  Zero();
   67|  9.64k|  for(int i = 0; value > 0; ++i) {
  ------------------
  |  Branch (67:18): [True: 6.66k, False: 2.97k]
  ------------------
   68|  6.66k|    RawBigit(i) = value & kBigitMask;
   69|  6.66k|    value >>= kBigitSize;
   70|  6.66k|    ++used_bigits_;
   71|  6.66k|  }
   72|  2.97k|}
_ZN17double_conversion6Bignum19AssignDecimalStringENS_6VectorIKcEE:
   97|    710|void Bignum::AssignDecimalString(const Vector<const char> value) {
   98|       |  // 2^64 = 18446744073709551616 > 10^19
   99|    710|  static const int kMaxUint64DecimalDigits = 19;
  100|    710|  Zero();
  101|    710|  int length = value.length();
  102|    710|  unsigned pos = 0;
  103|       |  // Let's just say that each digit needs 4 bits.
  104|  3.92k|  while (length >= kMaxUint64DecimalDigits) {
  ------------------
  |  Branch (104:10): [True: 3.21k, False: 710]
  ------------------
  105|  3.21k|    const uint64_t digits = ReadUInt64(value, pos, kMaxUint64DecimalDigits);
  106|  3.21k|    pos += kMaxUint64DecimalDigits;
  107|  3.21k|    length -= kMaxUint64DecimalDigits;
  108|  3.21k|    MultiplyByPowerOfTen(kMaxUint64DecimalDigits);
  109|  3.21k|    AddUInt64(digits);
  110|  3.21k|  }
  111|    710|  const uint64_t digits = ReadUInt64(value, pos, length);
  112|    710|  MultiplyByPowerOfTen(length);
  113|    710|  AddUInt64(digits);
  114|    710|  Clamp();
  115|    710|}
_ZN17double_conversion6Bignum9AddUInt64Em:
  156|  3.92k|void Bignum::AddUInt64(const uint64_t operand) {
  157|  3.92k|  if (operand == 0) {
  ------------------
  |  Branch (157:7): [True: 1.65k, False: 2.26k]
  ------------------
  158|  1.65k|    return;
  159|  1.65k|  }
  160|  2.26k|  Bignum other;
  161|  2.26k|  other.AssignUInt64(operand);
  162|  2.26k|  AddBignum(other);
  163|  2.26k|}
_ZN17double_conversion6Bignum9AddBignumERKS0_:
  166|  2.26k|void Bignum::AddBignum(const Bignum& other) {
  167|  2.26k|  DOUBLE_CONVERSION_ASSERT(IsClamped());
  ------------------
  |  |   47|  2.26k|    assert(condition)
  ------------------
  168|  2.26k|  DOUBLE_CONVERSION_ASSERT(other.IsClamped());
  ------------------
  |  |   47|  2.26k|    assert(condition)
  ------------------
  169|       |
  170|       |  // If this has a greater exponent than other append zero-bigits to this.
  171|       |  // After this call exponent_ <= other.exponent_.
  172|      0|  Align(other);
  173|       |
  174|       |  // There are two possibilities:
  175|       |  //   aaaaaaaaaaa 0000  (where the 0s represent a's exponent)
  176|       |  //     bbbbb 00000000
  177|       |  //   ----------------
  178|       |  //   ccccccccccc 0000
  179|       |  // or
  180|       |  //    aaaaaaaaaa 0000
  181|       |  //  bbbbbbbbb 0000000
  182|       |  //  -----------------
  183|       |  //  cccccccccccc 0000
  184|       |  // In both cases we might need a carry bigit.
  185|       |
  186|  2.26k|  EnsureCapacity(1 + (std::max)(BigitLength(), other.BigitLength()) - exponent_);
  187|  2.26k|  Chunk carry = 0;
  188|  2.26k|  int bigit_pos = other.exponent_ - exponent_;
  189|  2.26k|  DOUBLE_CONVERSION_ASSERT(bigit_pos >= 0);
  ------------------
  |  |   47|  2.26k|    assert(condition)
  ------------------
  190|  2.26k|  for (int i = used_bigits_; i < bigit_pos; ++i) {
  ------------------
  |  Branch (190:30): [True: 0, False: 2.26k]
  ------------------
  191|      0|    RawBigit(i) = 0;
  192|      0|  }
  193|  7.53k|  for (int i = 0; i < other.used_bigits_; ++i) {
  ------------------
  |  Branch (193:19): [True: 5.27k, False: 2.26k]
  ------------------
  194|  5.27k|    const Chunk my = (bigit_pos < used_bigits_) ? RawBigit(bigit_pos) : 0;
  ------------------
  |  Branch (194:22): [True: 3.71k, False: 1.55k]
  ------------------
  195|  5.27k|    const Chunk sum = my + other.RawBigit(i) + carry;
  196|  5.27k|    RawBigit(bigit_pos) = sum & kBigitMask;
  197|  5.27k|    carry = sum >> kBigitSize;
  198|  5.27k|    ++bigit_pos;
  199|  5.27k|  }
  200|  2.59k|  while (carry != 0) {
  ------------------
  |  Branch (200:10): [True: 328, False: 2.26k]
  ------------------
  201|    328|    const Chunk my = (bigit_pos < used_bigits_) ? RawBigit(bigit_pos) : 0;
  ------------------
  |  Branch (201:22): [True: 328, False: 0]
  ------------------
  202|    328|    const Chunk sum = my + carry;
  203|    328|    RawBigit(bigit_pos) = sum & kBigitMask;
  204|    328|    carry = sum >> kBigitSize;
  205|    328|    ++bigit_pos;
  206|    328|  }
  207|  2.26k|  used_bigits_ = static_cast<int16_t>(std::max(bigit_pos, static_cast<int>(used_bigits_)));
  208|  2.26k|  DOUBLE_CONVERSION_ASSERT(IsClamped());
  ------------------
  |  |   47|  2.26k|    assert(condition)
  ------------------
  209|  2.26k|}
_ZN17double_conversion6Bignum9ShiftLeftEi:
  239|  4.26k|void Bignum::ShiftLeft(const int shift_amount) {
  240|  4.26k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (240:7): [True: 0, False: 4.26k]
  ------------------
  241|      0|    return;
  242|      0|  }
  243|  4.26k|  exponent_ += static_cast<int16_t>(shift_amount / kBigitSize);
  244|  4.26k|  const int local_shift = shift_amount % kBigitSize;
  245|  4.26k|  EnsureCapacity(used_bigits_ + 1);
  246|  4.26k|  BigitsShiftLeft(local_shift);
  247|  4.26k|}
_ZN17double_conversion6Bignum16MultiplyByUInt32Ej:
  250|  6.67k|void Bignum::MultiplyByUInt32(const uint32_t factor) {
  251|  6.67k|  if (factor == 1) {
  ------------------
  |  Branch (251:7): [True: 0, False: 6.67k]
  ------------------
  252|      0|    return;
  253|      0|  }
  254|  6.67k|  if (factor == 0) {
  ------------------
  |  Branch (254:7): [True: 0, False: 6.67k]
  ------------------
  255|      0|    Zero();
  256|      0|    return;
  257|      0|  }
  258|  6.67k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (258:7): [True: 0, False: 6.67k]
  ------------------
  259|      0|    return;
  260|      0|  }
  261|       |  // The product of a bigit with the factor is of size kBigitSize + 32.
  262|       |  // Assert that this number + 1 (for the carry) fits into double chunk.
  263|  6.67k|  DOUBLE_CONVERSION_ASSERT(kDoubleChunkSize >= kBigitSize + 32 + 1);
  ------------------
  |  |   47|  6.67k|    assert(condition)
  ------------------
  264|      0|  DoubleChunk carry = 0;
  265|   199k|  for (int i = 0; i < used_bigits_; ++i) {
  ------------------
  |  Branch (265:19): [True: 192k, False: 6.67k]
  ------------------
  266|   192k|    const DoubleChunk product = static_cast<DoubleChunk>(factor) * RawBigit(i) + carry;
  267|   192k|    RawBigit(i) = static_cast<Chunk>(product & kBigitMask);
  268|   192k|    carry = (product >> kBigitSize);
  269|   192k|  }
  270|  11.8k|  while (carry != 0) {
  ------------------
  |  Branch (270:10): [True: 5.18k, False: 6.67k]
  ------------------
  271|  5.18k|    EnsureCapacity(used_bigits_ + 1);
  272|  5.18k|    RawBigit(used_bigits_) = carry & kBigitMask;
  273|  5.18k|    used_bigits_++;
  274|  5.18k|    carry >>= kBigitSize;
  275|  5.18k|  }
  276|  6.67k|}
_ZN17double_conversion6Bignum16MultiplyByUInt64Em:
  279|  3.75k|void Bignum::MultiplyByUInt64(const uint64_t factor) {
  280|  3.75k|  if (factor == 1) {
  ------------------
  |  Branch (280:7): [True: 0, False: 3.75k]
  ------------------
  281|      0|    return;
  282|      0|  }
  283|  3.75k|  if (factor == 0) {
  ------------------
  |  Branch (283:7): [True: 0, False: 3.75k]
  ------------------
  284|      0|    Zero();
  285|      0|    return;
  286|      0|  }
  287|  3.75k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (287:7): [True: 0, False: 3.75k]
  ------------------
  288|      0|    return;
  289|      0|  }
  290|  3.75k|  DOUBLE_CONVERSION_ASSERT(kBigitSize < 32);
  ------------------
  |  |   47|  3.75k|    assert(condition)
  ------------------
  291|      0|  uint64_t carry = 0;
  292|  3.75k|  const uint64_t low = factor & 0xFFFFFFFF;
  293|  3.75k|  const uint64_t high = factor >> 32;
  294|  77.4k|  for (int i = 0; i < used_bigits_; ++i) {
  ------------------
  |  Branch (294:19): [True: 73.6k, False: 3.75k]
  ------------------
  295|  73.6k|    const uint64_t product_low = low * RawBigit(i);
  296|  73.6k|    const uint64_t product_high = high * RawBigit(i);
  297|  73.6k|    const uint64_t tmp = (carry & kBigitMask) + product_low;
  298|  73.6k|    RawBigit(i) = tmp & kBigitMask;
  299|  73.6k|    carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
  300|  73.6k|        (product_high << (32 - kBigitSize));
  301|  73.6k|  }
  302|  12.1k|  while (carry != 0) {
  ------------------
  |  Branch (302:10): [True: 8.43k, False: 3.75k]
  ------------------
  303|  8.43k|    EnsureCapacity(used_bigits_ + 1);
  304|  8.43k|    RawBigit(used_bigits_) = carry & kBigitMask;
  305|  8.43k|    used_bigits_++;
  306|  8.43k|    carry >>= kBigitSize;
  307|  8.43k|  }
  308|  3.75k|}
_ZN17double_conversion6Bignum20MultiplyByPowerOfTenEi:
  311|  4.63k|void Bignum::MultiplyByPowerOfTen(const int exponent) {
  312|  4.63k|  static const uint64_t kFive27 = DOUBLE_CONVERSION_UINT64_2PART_C(0x6765c793, fa10079d);
  ------------------
  |  |  195|  4.63k|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  313|  4.63k|  static const uint16_t kFive1 = 5;
  314|  4.63k|  static const uint16_t kFive2 = kFive1 * 5;
  315|  4.63k|  static const uint16_t kFive3 = kFive2 * 5;
  316|  4.63k|  static const uint16_t kFive4 = kFive3 * 5;
  317|  4.63k|  static const uint16_t kFive5 = kFive4 * 5;
  318|  4.63k|  static const uint16_t kFive6 = kFive5 * 5;
  319|  4.63k|  static const uint32_t kFive7 = kFive6 * 5;
  320|  4.63k|  static const uint32_t kFive8 = kFive7 * 5;
  321|  4.63k|  static const uint32_t kFive9 = kFive8 * 5;
  322|  4.63k|  static const uint32_t kFive10 = kFive9 * 5;
  323|  4.63k|  static const uint32_t kFive11 = kFive10 * 5;
  324|  4.63k|  static const uint32_t kFive12 = kFive11 * 5;
  325|  4.63k|  static const uint32_t kFive13 = kFive12 * 5;
  326|  4.63k|  static const uint32_t kFive1_to_12[] =
  327|  4.63k|      { kFive1, kFive2, kFive3, kFive4, kFive5, kFive6,
  328|  4.63k|        kFive7, kFive8, kFive9, kFive10, kFive11, kFive12 };
  329|       |
  330|  4.63k|  DOUBLE_CONVERSION_ASSERT(exponent >= 0);
  ------------------
  |  |   47|  4.63k|    assert(condition)
  ------------------
  331|       |
  332|  4.63k|  if (exponent == 0) {
  ------------------
  |  Branch (332:7): [True: 365, False: 4.26k]
  ------------------
  333|    365|    return;
  334|    365|  }
  335|  4.26k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (335:7): [True: 710, False: 3.55k]
  ------------------
  336|    710|    return;
  337|    710|  }
  338|       |  // We shift by exponent at the end just before returning.
  339|  3.55k|  int remaining_exponent = exponent;
  340|  7.30k|  while (remaining_exponent >= 27) {
  ------------------
  |  Branch (340:10): [True: 3.75k, False: 3.55k]
  ------------------
  341|  3.75k|    MultiplyByUInt64(kFive27);
  342|  3.75k|    remaining_exponent -= 27;
  343|  3.75k|  }
  344|  6.78k|  while (remaining_exponent >= 13) {
  ------------------
  |  Branch (344:10): [True: 3.23k, False: 3.55k]
  ------------------
  345|  3.23k|    MultiplyByUInt32(kFive13);
  346|  3.23k|    remaining_exponent -= 13;
  347|  3.23k|  }
  348|  3.55k|  if (remaining_exponent > 0) {
  ------------------
  |  Branch (348:7): [True: 3.44k, False: 113]
  ------------------
  349|  3.44k|    MultiplyByUInt32(kFive1_to_12[remaining_exponent - 1]);
  350|  3.44k|  }
  351|  3.55k|  ShiftLeft(exponent);
  352|  3.55k|}
_ZNK17double_conversion6Bignum11BigitOrZeroEi:
  633|  5.44k|Bignum::Chunk Bignum::BigitOrZero(const int index) const {
  634|  5.44k|  if (index >= BigitLength()) {
  ------------------
  |  Branch (634:7): [True: 0, False: 5.44k]
  ------------------
  635|      0|    return 0;
  636|      0|  }
  637|  5.44k|  if (index < exponent_) {
  ------------------
  |  Branch (637:7): [True: 296, False: 5.15k]
  ------------------
  638|    296|    return 0;
  639|    296|  }
  640|  5.15k|  return RawBigit(index - exponent_);
  641|  5.44k|}
_ZN17double_conversion6Bignum7CompareERKS0_S2_:
  644|    710|int Bignum::Compare(const Bignum& a, const Bignum& b) {
  645|    710|  DOUBLE_CONVERSION_ASSERT(a.IsClamped());
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  646|    710|  DOUBLE_CONVERSION_ASSERT(b.IsClamped());
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  647|      0|  const int bigit_length_a = a.BigitLength();
  648|    710|  const int bigit_length_b = b.BigitLength();
  649|    710|  if (bigit_length_a < bigit_length_b) {
  ------------------
  |  Branch (649:7): [True: 5, False: 705]
  ------------------
  650|      5|    return -1;
  651|      5|  }
  652|    705|  if (bigit_length_a > bigit_length_b) {
  ------------------
  |  Branch (652:7): [True: 0, False: 705]
  ------------------
  653|      0|    return +1;
  654|      0|  }
  655|  2.85k|  for (int i = bigit_length_a - 1; i >= (std::min)(a.exponent_, b.exponent_); --i) {
  ------------------
  |  Branch (655:36): [True: 2.72k, False: 133]
  ------------------
  656|  2.72k|    const Chunk bigit_a = a.BigitOrZero(i);
  657|  2.72k|    const Chunk bigit_b = b.BigitOrZero(i);
  658|  2.72k|    if (bigit_a < bigit_b) {
  ------------------
  |  Branch (658:9): [True: 175, False: 2.54k]
  ------------------
  659|    175|      return -1;
  660|    175|    }
  661|  2.54k|    if (bigit_a > bigit_b) {
  ------------------
  |  Branch (661:9): [True: 397, False: 2.15k]
  ------------------
  662|    397|      return +1;
  663|    397|    }
  664|       |    // Otherwise they are equal up to this digit. Try the next digit.
  665|  2.54k|  }
  666|    133|  return 0;
  667|    705|}
_ZN17double_conversion6Bignum5ClampEv:
  715|    710|void Bignum::Clamp() {
  716|    710|  while (used_bigits_ > 0 && RawBigit(used_bigits_ - 1) == 0) {
  ------------------
  |  Branch (716:10): [True: 710, False: 0]
  |  Branch (716:30): [True: 0, False: 710]
  ------------------
  717|      0|    used_bigits_--;
  718|      0|  }
  719|    710|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (719:7): [True: 0, False: 710]
  ------------------
  720|       |    // Zero.
  721|      0|    exponent_ = 0;
  722|      0|  }
  723|    710|}
_ZN17double_conversion6Bignum5AlignERKS0_:
  726|  2.26k|void Bignum::Align(const Bignum& other) {
  727|  2.26k|  if (exponent_ > other.exponent_) {
  ------------------
  |  Branch (727:7): [True: 0, False: 2.26k]
  ------------------
  728|       |    // If "X" represents a "hidden" bigit (by the exponent) then we are in the
  729|       |    // following case (a == this, b == other):
  730|       |    // a:  aaaaaaXXXX   or a:   aaaaaXXX
  731|       |    // b:     bbbbbbX      b: bbbbbbbbXX
  732|       |    // We replace some of the hidden digits (X) of a with 0 digits.
  733|       |    // a:  aaaaaa000X   or a:   aaaaa0XX
  734|      0|    const int zero_bigits = exponent_ - other.exponent_;
  735|      0|    EnsureCapacity(used_bigits_ + zero_bigits);
  736|      0|    for (int i = used_bigits_ - 1; i >= 0; --i) {
  ------------------
  |  Branch (736:36): [True: 0, False: 0]
  ------------------
  737|      0|      RawBigit(i + zero_bigits) = RawBigit(i);
  738|      0|    }
  739|      0|    for (int i = 0; i < zero_bigits; ++i) {
  ------------------
  |  Branch (739:21): [True: 0, False: 0]
  ------------------
  740|      0|      RawBigit(i) = 0;
  741|      0|    }
  742|      0|    used_bigits_ += static_cast<int16_t>(zero_bigits);
  743|      0|    exponent_ -= static_cast<int16_t>(zero_bigits);
  744|       |
  745|      0|    DOUBLE_CONVERSION_ASSERT(used_bigits_ >= 0);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  746|      0|    DOUBLE_CONVERSION_ASSERT(exponent_ >= 0);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  747|      0|  }
  748|  2.26k|}
_ZN17double_conversion6Bignum15BigitsShiftLeftEi:
  751|  4.26k|void Bignum::BigitsShiftLeft(const int shift_amount) {
  752|  4.26k|  DOUBLE_CONVERSION_ASSERT(shift_amount < kBigitSize);
  ------------------
  |  |   47|  4.26k|    assert(condition)
  ------------------
  753|  4.26k|  DOUBLE_CONVERSION_ASSERT(shift_amount >= 0);
  ------------------
  |  |   47|  4.26k|    assert(condition)
  ------------------
  754|      0|  Chunk carry = 0;
  755|   115k|  for (int i = 0; i < used_bigits_; ++i) {
  ------------------
  |  Branch (755:19): [True: 111k, False: 4.26k]
  ------------------
  756|   111k|    const Chunk new_carry = RawBigit(i) >> (kBigitSize - shift_amount);
  757|   111k|    RawBigit(i) = ((RawBigit(i) << shift_amount) + carry) & kBigitMask;
  758|   111k|    carry = new_carry;
  759|   111k|  }
  760|  4.26k|  if (carry != 0) {
  ------------------
  |  Branch (760:7): [True: 2.64k, False: 1.62k]
  ------------------
  761|  2.64k|    RawBigit(used_bigits_) = carry;
  762|  2.64k|    used_bigits_++;
  763|  2.64k|  }
  764|  4.26k|}
bignum.cc:_ZN17double_conversionL10ReadUInt64ENS_6VectorIKcEEii:
   86|  3.92k|                           const int digits_to_read) {
   87|  3.92k|  uint64_t result = 0;
   88|  70.3k|  for (int i = from; i < from + digits_to_read; ++i) {
  ------------------
  |  Branch (88:22): [True: 66.4k, False: 3.92k]
  ------------------
   89|  66.4k|    const int digit = buffer[i] - '0';
   90|  66.4k|    DOUBLE_CONVERSION_ASSERT(0 <= digit && digit <= 9);
  ------------------
  |  |   47|  66.4k|    assert(condition)
  ------------------
   91|      0|    result = result * 10 + digit;
   92|  66.4k|  }
   93|  3.92k|  return result;
   94|  3.92k|}

_ZN17double_conversion6BignumC2Ev:
   42|  3.68k|  Bignum() : used_bigits_(0), exponent_(0) {}
_ZN17double_conversion6Bignum14EnsureCapacityEi:
  114|  20.1k|  static void EnsureCapacity(const int size) {
  115|  20.1k|    if (size > kBigitCapacity) {
  ------------------
  |  Branch (115:9): [True: 0, False: 20.1k]
  ------------------
  116|      0|      DOUBLE_CONVERSION_UNREACHABLE();
  ------------------
  |  |   77|      0|#define DOUBLE_CONVERSION_UNREACHABLE()   (abort())
  ------------------
  117|      0|    }
  118|  20.1k|  }
_ZNK17double_conversion6Bignum9IsClampedEv:
  121|  8.20k|  bool IsClamped() const {
  122|  8.20k|    return used_bigits_ == 0 || RawBigit(used_bigits_ - 1) != 0;
  ------------------
  |  Branch (122:12): [True: 710, False: 7.49k]
  |  Branch (122:33): [True: 7.49k, False: 0]
  ------------------
  123|  8.20k|  }
_ZN17double_conversion6Bignum4ZeroEv:
  124|  3.68k|  void Zero() {
  125|  3.68k|    used_bigits_ = 0;
  126|  3.68k|    exponent_ = 0;
  127|  3.68k|  }
_ZNK17double_conversion6Bignum11BigitLengthEv:
  133|  11.3k|  int BigitLength() const { return used_bigits_ + exponent_; }

_ZN17double_conversion16PowersOfTenCache32GetCachedPowerForDecimalExponentEiPNS_5DiyFpEPi:
  161|  1.35k|                                      int* found_exponent) {
  162|  1.35k|  DOUBLE_CONVERSION_ASSERT(kMinDecimalExponent <= requested_exponent);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  163|  1.35k|  DOUBLE_CONVERSION_ASSERT(requested_exponent < kMaxDecimalExponent + kDecimalExponentDistance);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  164|      0|  int index =
  165|  1.35k|      (requested_exponent + kCachedPowersOffset) / kDecimalExponentDistance;
  166|  1.35k|  CachedPower cached_power = kCachedPowers[index];
  167|  1.35k|  *power = DiyFp(cached_power.significand, cached_power.binary_exponent);
  168|  1.35k|  *found_exponent = cached_power.decimal_exponent;
  169|  1.35k|  DOUBLE_CONVERSION_ASSERT(*found_exponent <= requested_exponent);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  170|  1.35k|  DOUBLE_CONVERSION_ASSERT(requested_exponent < *found_exponent + kDecimalExponentDistance);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  171|  1.35k|}

_ZN17double_conversion5DiyFpC2Emi:
   46|  6.54k|  DiyFp(const uint64_t significand, const int32_t exponent) : f_(significand), e_(exponent) {}
_ZNK17double_conversion5DiyFp1fEv:
  122|  5.72k|  uint64_t f() const { return f_; }
_ZNK17double_conversion5DiyFp1eEv:
  123|  11.5k|  int32_t e() const { return e_; }
_ZN17double_conversion5DiyFpC2Ev:
   45|  2.71k|  DiyFp() : f_(0), e_(0) {}
_ZN17double_conversion5DiyFp8MultiplyERKS0_:
   68|  2.58k|  void Multiply(const DiyFp& other) {
   69|       |    // Simply "emulates" a 128 bit multiplication.
   70|       |    // However: the resulting number only contains 64 bits. The least
   71|       |    // significant 64 bits are only used for rounding the most significant 64
   72|       |    // bits.
   73|  2.58k|    const uint64_t kM32 = 0xFFFFFFFFU;
   74|  2.58k|    const uint64_t a = f_ >> 32;
   75|  2.58k|    const uint64_t b = f_ & kM32;
   76|  2.58k|    const uint64_t c = other.f_ >> 32;
   77|  2.58k|    const uint64_t d = other.f_ & kM32;
   78|  2.58k|    const uint64_t ac = a * c;
   79|  2.58k|    const uint64_t bc = b * c;
   80|  2.58k|    const uint64_t ad = a * d;
   81|  2.58k|    const uint64_t bd = b * d;
   82|       |    // By adding 1U << 31 to tmp we round the final result.
   83|       |    // Halfway cases will be rounded up.
   84|  2.58k|    const uint64_t tmp = (bd >> 32) + (ad & kM32) + (bc & kM32) + (1U << 31);
   85|  2.58k|    e_ += other.e_ + 64;
   86|  2.58k|    f_ = ac + (ad >> 32) + (bc >> 32) + (tmp >> 32);
   87|  2.58k|  }
_ZN17double_conversion5DiyFp9NormalizeEv:
   96|  2.71k|  void Normalize() {
   97|  2.71k|    DOUBLE_CONVERSION_ASSERT(f_ != 0);
  ------------------
  |  |   47|  2.71k|    assert(condition)
  ------------------
   98|      0|    uint64_t significand = f_;
   99|  2.71k|    int32_t exponent = e_;
  100|       |
  101|       |    // This method is mainly called for normalizing boundaries. In general,
  102|       |    // boundaries need to be shifted by 10 bits, and we optimize for this case.
  103|  2.71k|    const uint64_t k10MSBits = DOUBLE_CONVERSION_UINT64_2PART_C(0xFFC00000, 00000000);
  ------------------
  |  |  195|  2.71k|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  104|  6.14k|    while ((significand & k10MSBits) == 0) {
  ------------------
  |  Branch (104:12): [True: 3.42k, False: 2.71k]
  ------------------
  105|  3.42k|      significand <<= 10;
  106|  3.42k|      exponent -= 10;
  107|  3.42k|    }
  108|  7.12k|    while ((significand & kUint64MSB) == 0) {
  ------------------
  |  Branch (108:12): [True: 4.40k, False: 2.71k]
  ------------------
  109|  4.40k|      significand <<= 1;
  110|  4.40k|      exponent--;
  111|  4.40k|    }
  112|  2.71k|    f_ = significand;
  113|  2.71k|    e_ = exponent;
  114|  2.71k|  }
_ZN17double_conversion5DiyFp5set_fEm:
  125|    404|  void set_f(uint64_t new_value) { f_ = new_value; }
_ZN17double_conversion5DiyFp5set_eEi:
  126|     88|  void set_e(int32_t new_value) { e_ = new_value; }

_ZN17double_conversion6Double8InfinityEv:
  236|    816|  static double Infinity() {
  237|    816|    return Double(kInfinity).value();
  238|    816|  }
_ZN17double_conversion6DoubleC2Em:
   56|  1.31k|  explicit Double(uint64_t d64) : d64_(d64) {}
_ZNK17double_conversion6Double5valueEv:
  220|  3.20k|  double value() const { return uint64_to_double(d64_); }
string-to-double.cc:_ZN17double_conversionL16uint64_to_doubleEm:
   37|    535|static double uint64_to_double(uint64_t d64) { return BitCast<double>(d64); }
_ZN17double_conversion6Double3NaNEv:
  240|      2|  static double NaN() {
  241|      2|    return Double(kNaN).value();
  242|      2|  }
_ZN17double_conversion6DoubleC2ENS_5DiyFpE:
   58|  1.89k|    : d64_(DiyFpToUint64(diy_fp)) {}
_ZN17double_conversion6Double13DiyFpToUint64ENS_5DiyFpE:
  256|  1.89k|  static uint64_t DiyFpToUint64(DiyFp diy_fp) {
  257|  1.89k|    uint64_t significand = diy_fp.f();
  258|  1.89k|    int exponent = diy_fp.e();
  259|  1.90k|    while (significand > kHiddenBit + kSignificandMask) {
  ------------------
  |  Branch (259:12): [True: 17, False: 1.89k]
  ------------------
  260|     17|      significand >>= 1;
  261|     17|      exponent++;
  262|     17|    }
  263|  1.89k|    if (exponent >= kMaxExponent) {
  ------------------
  |  Branch (263:9): [True: 53, False: 1.83k]
  ------------------
  264|     53|      return kInfinity;
  265|     53|    }
  266|  1.83k|    if (exponent < kDenormalExponent) {
  ------------------
  |  Branch (266:9): [True: 77, False: 1.76k]
  ------------------
  267|     77|      return 0;
  268|     77|    }
  269|  7.48k|    while (exponent > kDenormalExponent && (significand & kHiddenBit) == 0) {
  ------------------
  |  Branch (269:12): [True: 7.29k, False: 187]
  |  Branch (269:44): [True: 5.72k, False: 1.57k]
  ------------------
  270|  5.72k|      significand <<= 1;
  271|  5.72k|      exponent--;
  272|  5.72k|    }
  273|  1.76k|    uint64_t biased_exponent;
  274|  1.76k|    if (exponent == kDenormalExponent && (significand & kHiddenBit) == 0) {
  ------------------
  |  Branch (274:9): [True: 187, False: 1.57k]
  |  Branch (274:42): [True: 182, False: 5]
  ------------------
  275|    182|      biased_exponent = 0;
  276|  1.57k|    } else {
  277|  1.57k|      biased_exponent = static_cast<uint64_t>(exponent + kExponentBias);
  278|  1.57k|    }
  279|  1.76k|    return (significand & kSignificandMask) |
  280|  1.76k|        (biased_exponent << kPhysicalSignificandSize);
  281|  1.83k|  }
_ZN17double_conversion6DoubleC2Ed:
   55|  1.34k|  explicit Double(double d) : d64_(double_to_uint64(d)) {}
_ZNK17double_conversion6Double8AsUint64Ev:
   86|  4.77k|  uint64_t AsUint64() const {
   87|  4.77k|    return d64_;
   88|  4.77k|  }
_ZNK17double_conversion6Double10NextDoubleEv:
   91|    499|  double NextDouble() const {
   92|    499|    if (d64_ == kInfinity) return Double(kInfinity).value();
  ------------------
  |  Branch (92:9): [True: 0, False: 499]
  ------------------
   93|    499|    if (Sign() < 0 && Significand() == 0) {
  ------------------
  |  Branch (93:9): [True: 0, False: 499]
  |  Branch (93:23): [True: 0, False: 0]
  ------------------
   94|       |      // -0.0
   95|      0|      return 0.0;
   96|      0|    }
   97|    499|    if (Sign() < 0) {
  ------------------
  |  Branch (97:9): [True: 0, False: 499]
  ------------------
   98|      0|      return Double(d64_ - 1).value();
   99|    499|    } else {
  100|    499|      return Double(d64_ + 1).value();
  101|    499|    }
  102|    499|  }
_ZNK17double_conversion6Double8ExponentEv:
  114|    710|  int Exponent() const {
  115|    710|    if (IsDenormal()) return kDenormalExponent;
  ------------------
  |  Branch (115:9): [True: 40, False: 670]
  ------------------
  116|       |
  117|    670|    uint64_t d64 = AsUint64();
  118|    670|    int biased_e =
  119|    670|        static_cast<int>((d64 & kExponentMask) >> kPhysicalSignificandSize);
  120|    670|    return biased_e - kExponentBias;
  121|    710|  }
_ZNK17double_conversion6Double11SignificandEv:
  123|    843|  uint64_t Significand() const {
  124|    843|    uint64_t d64 = AsUint64();
  125|    843|    uint64_t significand = d64 & kSignificandMask;
  126|    843|    if (!IsDenormal()) {
  ------------------
  |  Branch (126:9): [True: 803, False: 40]
  ------------------
  127|    803|      return significand + kHiddenBit;
  128|    803|    } else {
  129|     40|      return significand;
  130|     40|    }
  131|    843|  }
_ZNK17double_conversion6Double10IsDenormalEv:
  134|  1.55k|  bool IsDenormal() const {
  135|  1.55k|    uint64_t d64 = AsUint64();
  136|  1.55k|    return (d64 & kExponentMask) == 0;
  137|  1.55k|  }
_ZNK17double_conversion6Double4SignEv:
  175|  1.70k|  int Sign() const {
  176|  1.70k|    uint64_t d64 = AsUint64();
  177|  1.70k|    return (d64 & kSignMask) == 0? 1: -1;
  ------------------
  |  Branch (177:12): [True: 1.70k, False: 0]
  ------------------
  178|  1.70k|  }
_ZNK17double_conversion6Double13UpperBoundaryEv:
  182|    710|  DiyFp UpperBoundary() const {
  183|    710|    DOUBLE_CONVERSION_ASSERT(Sign() > 0);
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  184|      0|    return DiyFp(Significand() * 2 + 1, Exponent() - 1);
  185|    710|  }
_ZN17double_conversion6Double34SignificandSizeForOrderOfMagnitudeEi:
  228|  1.35k|  static int SignificandSizeForOrderOfMagnitude(int order) {
  229|  1.35k|    if (order >= (kDenormalExponent + kSignificandSize)) {
  ------------------
  |  Branch (229:9): [True: 1.15k, False: 209]
  ------------------
  230|  1.15k|      return kSignificandSize;
  231|  1.15k|    }
  232|    209|    if (order <= kDenormalExponent) return 0;
  ------------------
  |  Branch (232:9): [True: 47, False: 162]
  ------------------
  233|    162|    return order - kDenormalExponent;
  234|    209|  }
strtod.cc:_ZN17double_conversionL16uint64_to_doubleEm:
   37|  2.67k|static double uint64_to_double(uint64_t d64) { return BitCast<double>(d64); }
strtod.cc:_ZN17double_conversionL16double_to_uint64Ed:
   36|  1.34k|static uint64_t double_to_uint64(double d) { return BitCast<uint64_t>(d); }

_ZNK17double_conversion23StringToDoubleConverter14StringToDoubleEPKciPi:
  752|  3.00k|    int* processed_characters_count) const {
  753|  3.00k|  return StringToIeee(buffer, length, true, processed_characters_count);
  754|  3.00k|}
_ZNK17double_conversion23StringToDoubleConverter12StringToIeeeIPKcEEdT_ibPi:
  423|  3.00k|    int* processed_characters_count) const {
  424|  3.00k|  Iterator current = input;
  425|  3.00k|  Iterator end = input + length;
  426|       |
  427|  3.00k|  *processed_characters_count = 0;
  428|       |
  429|  3.00k|  const bool allow_trailing_junk = (flags_ & ALLOW_TRAILING_JUNK) != 0;
  430|  3.00k|  const bool allow_leading_spaces = (flags_ & ALLOW_LEADING_SPACES) != 0;
  431|  3.00k|  const bool allow_trailing_spaces = (flags_ & ALLOW_TRAILING_SPACES) != 0;
  432|  3.00k|  const bool allow_spaces_after_sign = (flags_ & ALLOW_SPACES_AFTER_SIGN) != 0;
  433|  3.00k|  const bool allow_case_insensitivity = (flags_ & ALLOW_CASE_INSENSITIVITY) != 0;
  434|       |
  435|       |  // To make sure that iterator dereferencing is valid the following
  436|       |  // convention is used:
  437|       |  // 1. Each '++current' statement is followed by check for equality to 'end'.
  438|       |  // 2. If AdvanceToNonspace returned false then current == end.
  439|       |  // 3. If 'current' becomes equal to 'end' the function returns or goes to
  440|       |  // 'parsing_done'.
  441|       |  // 4. 'current' is not dereferenced after the 'parsing_done' label.
  442|       |  // 5. Code before 'parsing_done' may rely on 'current != end'.
  443|  3.00k|  if (current == end) return empty_string_value_;
  ------------------
  |  Branch (443:7): [True: 0, False: 3.00k]
  ------------------
  444|       |
  445|  3.00k|  if (allow_leading_spaces || allow_trailing_spaces) {
  ------------------
  |  Branch (445:7): [True: 3.00k, False: 0]
  |  Branch (445:31): [True: 0, False: 0]
  ------------------
  446|  3.00k|    if (!AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (446:9): [True: 25, False: 2.97k]
  ------------------
  447|     25|      *processed_characters_count = static_cast<int>(current - input);
  448|     25|      return empty_string_value_;
  449|     25|    }
  450|  2.97k|    if (!allow_leading_spaces && (input != current)) {
  ------------------
  |  Branch (450:9): [True: 0, False: 2.97k]
  |  Branch (450:34): [True: 0, False: 0]
  ------------------
  451|       |      // No leading spaces allowed, but AdvanceToNonspace moved forward.
  452|      0|      return junk_string_value_;
  453|      0|    }
  454|  2.97k|  }
  455|       |
  456|       |  // Exponent will be adjusted if insignificant digits of the integer part
  457|       |  // or insignificant leading zeros of the fractional part are dropped.
  458|  2.97k|  int exponent = 0;
  459|  2.97k|  int significant_digits = 0;
  460|  2.97k|  int insignificant_digits = 0;
  461|  2.97k|  bool nonzero_digit_dropped = false;
  462|       |
  463|  2.97k|  bool sign = false;
  464|       |
  465|  2.97k|  if (*current == '+' || *current == '-') {
  ------------------
  |  Branch (465:7): [True: 15, False: 2.96k]
  |  Branch (465:26): [True: 104, False: 2.85k]
  ------------------
  466|    119|    sign = (*current == '-');
  467|    119|    ++current;
  468|    119|    Iterator next_non_space = current;
  469|       |    // Skip following spaces (if allowed).
  470|    119|    if (!AdvanceToNonspace(&next_non_space, end)) return junk_string_value_;
  ------------------
  |  Branch (470:9): [True: 26, False: 93]
  ------------------
  471|     93|    if (!allow_spaces_after_sign && (current != next_non_space)) {
  ------------------
  |  Branch (471:9): [True: 0, False: 93]
  |  Branch (471:37): [True: 0, False: 0]
  ------------------
  472|      0|      return junk_string_value_;
  473|      0|    }
  474|     93|    current = next_non_space;
  475|     93|  }
  476|       |
  477|  2.94k|  if (infinity_symbol_ != DOUBLE_CONVERSION_NULLPTR) {
  ------------------
  |  |   39|  2.94k|#define DOUBLE_CONVERSION_NULLPTR nullptr
  ------------------
  |  Branch (477:7): [True: 2.94k, False: 0]
  ------------------
  478|  2.94k|    if (ConsumeFirstCharacter(*current, infinity_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (478:9): [True: 4, False: 2.94k]
  ------------------
  479|      4|      if (!ConsumeSubString(&current, end, infinity_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (479:11): [True: 2, False: 2]
  ------------------
  480|      2|        return junk_string_value_;
  481|      2|      }
  482|       |
  483|      2|      if (!(allow_trailing_spaces || allow_trailing_junk) && (current != end)) {
  ------------------
  |  Branch (483:13): [True: 2, False: 0]
  |  Branch (483:38): [True: 0, False: 0]
  |  Branch (483:62): [True: 0, False: 0]
  ------------------
  484|      0|        return junk_string_value_;
  485|      0|      }
  486|      2|      if (!allow_trailing_junk && AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (486:11): [True: 0, False: 2]
  |  Branch (486:35): [True: 0, False: 0]
  ------------------
  487|      0|        return junk_string_value_;
  488|      0|      }
  489|       |
  490|      2|      *processed_characters_count = static_cast<int>(current - input);
  491|      2|      return sign ? -Double::Infinity() : Double::Infinity();
  ------------------
  |  Branch (491:14): [True: 1, False: 1]
  ------------------
  492|      2|    }
  493|  2.94k|  }
  494|       |
  495|  2.94k|  if (nan_symbol_ != DOUBLE_CONVERSION_NULLPTR) {
  ------------------
  |  |   39|  2.94k|#define DOUBLE_CONVERSION_NULLPTR nullptr
  ------------------
  |  Branch (495:7): [True: 2.94k, False: 0]
  ------------------
  496|  2.94k|    if (ConsumeFirstCharacter(*current, nan_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (496:9): [True: 4, False: 2.94k]
  ------------------
  497|      4|      if (!ConsumeSubString(&current, end, nan_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (497:11): [True: 2, False: 2]
  ------------------
  498|      2|        return junk_string_value_;
  499|      2|      }
  500|       |
  501|      2|      if (!(allow_trailing_spaces || allow_trailing_junk) && (current != end)) {
  ------------------
  |  Branch (501:13): [True: 2, False: 0]
  |  Branch (501:38): [True: 0, False: 0]
  |  Branch (501:62): [True: 0, False: 0]
  ------------------
  502|      0|        return junk_string_value_;
  503|      0|      }
  504|      2|      if (!allow_trailing_junk && AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (504:11): [True: 0, False: 2]
  |  Branch (504:35): [True: 0, False: 0]
  ------------------
  505|      0|        return junk_string_value_;
  506|      0|      }
  507|       |
  508|      2|      *processed_characters_count = static_cast<int>(current - input);
  509|      2|      return sign ? -Double::NaN() : Double::NaN();
  ------------------
  |  Branch (509:14): [True: 1, False: 1]
  ------------------
  510|      2|    }
  511|  2.94k|  }
  512|       |
  513|  2.94k|  bool leading_zero = false;
  514|  2.94k|  if (*current == '0') {
  ------------------
  |  Branch (514:7): [True: 1.02k, False: 1.91k]
  ------------------
  515|  1.02k|    if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (515:9): [True: 2, False: 1.02k]
  ------------------
  516|      2|      *processed_characters_count = static_cast<int>(current - input);
  517|      2|      return SignedZero(sign);
  518|      2|    }
  519|       |
  520|  1.02k|    leading_zero = true;
  521|       |
  522|       |    // It could be hexadecimal value.
  523|  1.02k|    if (((flags_ & ALLOW_HEX) || (flags_ & ALLOW_HEX_FLOATS)) &&
  ------------------
  |  Branch (523:10): [True: 1.02k, False: 0]
  |  Branch (523:34): [True: 0, False: 0]
  ------------------
  524|  1.02k|        (*current == 'x' || *current == 'X')) {
  ------------------
  |  Branch (524:10): [True: 297, False: 723]
  |  Branch (524:29): [True: 434, False: 289]
  ------------------
  525|    731|      ++current;
  526|       |
  527|    731|      if (current == end) return junk_string_value_;  // "0x"
  ------------------
  |  Branch (527:11): [True: 2, False: 729]
  ------------------
  528|       |
  529|    729|      bool parse_as_hex_float = (flags_ & ALLOW_HEX_FLOATS) &&
  ------------------
  |  Branch (529:33): [True: 729, False: 0]
  ------------------
  530|    729|                IsHexFloatString(current, end, separator_, allow_trailing_junk);
  ------------------
  |  Branch (530:17): [True: 292, False: 437]
  ------------------
  531|       |
  532|    729|      if (!parse_as_hex_float && !isDigit(*current, 16)) {
  ------------------
  |  Branch (532:11): [True: 437, False: 292]
  |  Branch (532:34): [True: 83, False: 354]
  ------------------
  533|     83|        return junk_string_value_;
  534|     83|      }
  535|       |
  536|    646|      bool result_is_junk;
  537|    646|      double result = RadixStringToIeee<4>(&current,
  538|    646|                                           end,
  539|    646|                                           sign,
  540|    646|                                           separator_,
  541|    646|                                           parse_as_hex_float,
  542|    646|                                           allow_trailing_junk,
  543|    646|                                           junk_string_value_,
  544|    646|                                           read_as_double,
  545|    646|                                           &result_is_junk);
  546|    646|      if (!result_is_junk) {
  ------------------
  |  Branch (546:11): [True: 646, False: 0]
  ------------------
  547|    646|        if (allow_trailing_spaces) AdvanceToNonspace(&current, end);
  ------------------
  |  Branch (547:13): [True: 646, False: 0]
  ------------------
  548|    646|        *processed_characters_count = static_cast<int>(current - input);
  549|    646|      }
  550|    646|      return result;
  551|    729|    }
  552|       |
  553|       |    // Ignore leading zeros in the integer part.
  554|    669|    while (*current == '0') {
  ------------------
  |  Branch (554:12): [True: 388, False: 281]
  ------------------
  555|    388|      if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (555:11): [True: 8, False: 380]
  ------------------
  556|      8|        *processed_characters_count = static_cast<int>(current - input);
  557|      8|        return SignedZero(sign);
  558|      8|      }
  559|    388|    }
  560|    289|  }
  561|       |
  562|  2.20k|  bool octal = leading_zero && (flags_ & ALLOW_OCTALS) != 0;
  ------------------
  |  Branch (562:16): [True: 281, False: 1.91k]
  |  Branch (562:32): [True: 281, False: 0]
  ------------------
  563|       |
  564|       |  // The longest form of simplified number is: "-<significant digits>.1eXXX\0".
  565|  2.20k|  const int kBufferSize = kMaxSignificantDigits + 10;
  566|  2.20k|  DOUBLE_CONVERSION_STACK_UNINITIALIZED char
  ------------------
  |  |  104|  2.20k|#define DOUBLE_CONVERSION_STACK_UNINITIALIZED __attribute__((uninitialized))
  ------------------
  567|  2.20k|      buffer[kBufferSize];  // NOLINT: size is known at compile time.
  568|  2.20k|  int buffer_pos = 0;
  569|       |
  570|       |  // Copy significant digits of the integer part (if any) to the buffer.
  571|  74.6k|  while (*current >= '0' && *current <= '9') {
  ------------------
  |  Branch (571:10): [True: 74.1k, False: 455]
  |  Branch (571:29): [True: 73.2k, False: 995]
  ------------------
  572|  73.2k|    if (significant_digits < kMaxSignificantDigits) {
  ------------------
  |  Branch (572:9): [True: 72.8k, False: 396]
  ------------------
  573|  72.8k|      DOUBLE_CONVERSION_ASSERT(buffer_pos < kBufferSize);
  ------------------
  |  |   47|  72.8k|    assert(condition)
  ------------------
  574|      0|      buffer[buffer_pos++] = static_cast<char>(*current);
  575|  72.8k|      significant_digits++;
  576|       |      // Will later check if it's an octal in the buffer.
  577|  72.8k|    } else {
  578|    396|      insignificant_digits++;  // Move the digit into the exponential part.
  579|    396|      nonzero_digit_dropped = nonzero_digit_dropped || *current != '0';
  ------------------
  |  Branch (579:31): [True: 194, False: 202]
  |  Branch (579:56): [True: 11, False: 191]
  ------------------
  580|    396|    }
  581|  73.2k|    octal = octal && *current < '8';
  ------------------
  |  Branch (581:13): [True: 8.91k, False: 64.2k]
  |  Branch (581:22): [True: 8.91k, False: 2]
  ------------------
  582|  73.2k|    if (Advance(&current, separator_, 10, end)) goto parsing_done;
  ------------------
  |  Branch (582:9): [True: 750, False: 72.4k]
  ------------------
  583|  73.2k|  }
  584|       |
  585|  1.45k|  if (significant_digits == 0) {
  ------------------
  |  Branch (585:7): [True: 278, False: 1.17k]
  ------------------
  586|    278|    octal = false;
  587|    278|  }
  588|       |
  589|  1.45k|  if (*current == '.') {
  ------------------
  |  Branch (589:7): [True: 344, False: 1.10k]
  ------------------
  590|    344|    if (octal && !allow_trailing_junk) return junk_string_value_;
  ------------------
  |  Branch (590:9): [True: 1, False: 343]
  |  Branch (590:18): [True: 0, False: 1]
  ------------------
  591|    344|    if (octal) goto parsing_done;
  ------------------
  |  Branch (591:9): [True: 1, False: 343]
  ------------------
  592|       |
  593|    343|    if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (593:9): [True: 3, False: 340]
  ------------------
  594|      3|      if (significant_digits == 0 && !leading_zero) {
  ------------------
  |  Branch (594:11): [True: 2, False: 1]
  |  Branch (594:38): [True: 1, False: 1]
  ------------------
  595|      1|        return junk_string_value_;
  596|      2|      } else {
  597|      2|        goto parsing_done;
  598|      2|      }
  599|      3|    }
  600|       |
  601|    340|    if (significant_digits == 0) {
  ------------------
  |  Branch (601:9): [True: 155, False: 185]
  ------------------
  602|       |      // octal = false;
  603|       |      // Integer part consists of 0 or is absent. Significant digits start after
  604|       |      // leading zeros (if any).
  605|  2.28M|      while (*current == '0') {
  ------------------
  |  Branch (605:14): [True: 2.28M, False: 141]
  ------------------
  606|  2.28M|        if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (606:13): [True: 14, False: 2.28M]
  ------------------
  607|     14|          *processed_characters_count = static_cast<int>(current - input);
  608|     14|          return SignedZero(sign);
  609|     14|        }
  610|  2.28M|        exponent--;  // Move this 0 into the exponent.
  611|  2.28M|      }
  612|    155|    }
  613|       |
  614|       |    // There is a fractional part.
  615|       |    // We don't emit a '.', but adjust the exponent instead.
  616|  59.7k|    while (*current >= '0' && *current <= '9') {
  ------------------
  |  Branch (616:12): [True: 59.7k, False: 35]
  |  Branch (616:31): [True: 59.6k, False: 72]
  ------------------
  617|  59.6k|      if (significant_digits < kMaxSignificantDigits) {
  ------------------
  |  Branch (617:11): [True: 58.6k, False: 1.00k]
  ------------------
  618|  58.6k|        DOUBLE_CONVERSION_ASSERT(buffer_pos < kBufferSize);
  ------------------
  |  |   47|  58.6k|    assert(condition)
  ------------------
  619|      0|        buffer[buffer_pos++] = static_cast<char>(*current);
  620|  58.6k|        significant_digits++;
  621|  58.6k|        exponent--;
  622|  58.6k|      } else {
  623|       |        // Ignore insignificant digits in the fractional part.
  624|  1.00k|        nonzero_digit_dropped = nonzero_digit_dropped || *current != '0';
  ------------------
  |  Branch (624:33): [True: 424, False: 578]
  |  Branch (624:58): [True: 13, False: 565]
  ------------------
  625|  1.00k|      }
  626|  59.6k|      if (Advance(&current, separator_, 10, end)) goto parsing_done;
  ------------------
  |  Branch (626:11): [True: 219, False: 59.4k]
  ------------------
  627|  59.6k|    }
  628|    326|  }
  629|       |
  630|  1.21k|  if (!leading_zero && exponent == 0 && significant_digits == 0) {
  ------------------
  |  Branch (630:7): [True: 1.15k, False: 63]
  |  Branch (630:24): [True: 1.06k, False: 85]
  |  Branch (630:41): [True: 80, False: 985]
  ------------------
  631|       |    // If leading_zeros is true then the string contains zeros.
  632|       |    // If exponent < 0 then string was [+-]\.0*...
  633|       |    // If significant_digits != 0 the string is not equal to 0.
  634|       |    // Otherwise there are no digits in the string.
  635|     80|    return junk_string_value_;
  636|     80|  }
  637|       |
  638|       |  // Parse exponential part.
  639|  1.13k|  if (*current == 'e' || *current == 'E') {
  ------------------
  |  Branch (639:7): [True: 514, False: 619]
  |  Branch (639:26): [True: 506, False: 113]
  ------------------
  640|  1.02k|    if (octal && !allow_trailing_junk) return junk_string_value_;
  ------------------
  |  Branch (640:9): [True: 1, False: 1.01k]
  |  Branch (640:18): [True: 0, False: 1]
  ------------------
  641|  1.02k|    if (octal) goto parsing_done;
  ------------------
  |  Branch (641:9): [True: 1, False: 1.01k]
  ------------------
  642|  1.01k|    Iterator junk_begin = current;
  643|  1.01k|    ++current;
  644|  1.01k|    if (current == end) {
  ------------------
  |  Branch (644:9): [True: 10, False: 1.00k]
  ------------------
  645|     10|      if (allow_trailing_junk) {
  ------------------
  |  Branch (645:11): [True: 10, False: 0]
  ------------------
  646|     10|        current = junk_begin;
  647|     10|        goto parsing_done;
  648|     10|      } else {
  649|      0|        return junk_string_value_;
  650|      0|      }
  651|     10|    }
  652|  1.00k|    char exponen_sign = '+';
  653|  1.00k|    if (*current == '+' || *current == '-') {
  ------------------
  |  Branch (653:9): [True: 1, False: 1.00k]
  |  Branch (653:28): [True: 393, False: 615]
  ------------------
  654|    394|      exponen_sign = static_cast<char>(*current);
  655|    394|      ++current;
  656|    394|      if (current == end) {
  ------------------
  |  Branch (656:11): [True: 2, False: 392]
  ------------------
  657|      2|        if (allow_trailing_junk) {
  ------------------
  |  Branch (657:13): [True: 2, False: 0]
  ------------------
  658|      2|          current = junk_begin;
  659|      2|          goto parsing_done;
  660|      2|        } else {
  661|      0|          return junk_string_value_;
  662|      0|        }
  663|      2|      }
  664|    394|    }
  665|       |
  666|  1.00k|    if (current == end || *current < '0' || *current > '9') {
  ------------------
  |  Branch (666:9): [True: 0, False: 1.00k]
  |  Branch (666:27): [True: 19, False: 988]
  |  Branch (666:45): [True: 4, False: 984]
  ------------------
  667|     23|      if (allow_trailing_junk) {
  ------------------
  |  Branch (667:11): [True: 23, False: 0]
  ------------------
  668|     23|        current = junk_begin;
  669|     23|        goto parsing_done;
  670|     23|      } else {
  671|      0|        return junk_string_value_;
  672|      0|      }
  673|     23|    }
  674|       |
  675|    984|    const int max_exponent = INT_MAX / 2;
  676|    984|    DOUBLE_CONVERSION_ASSERT(-max_exponent / 2 <= exponent && exponent <= max_exponent / 2);
  ------------------
  |  |   47|    984|    assert(condition)
  ------------------
  677|      0|    int num = 0;
  678|  3.42k|    do {
  679|       |      // Check overflow.
  680|  3.42k|      int digit = *current - '0';
  681|  3.42k|      if (num >= max_exponent / 10
  ------------------
  |  Branch (681:11): [True: 236, False: 3.18k]
  ------------------
  682|  3.42k|          && !(num == max_exponent / 10 && digit <= max_exponent % 10)) {
  ------------------
  |  Branch (682:16): [True: 5, False: 231]
  |  Branch (682:44): [True: 3, False: 2]
  ------------------
  683|    233|        num = max_exponent;
  684|  3.19k|      } else {
  685|  3.19k|        num = num * 10 + digit;
  686|  3.19k|      }
  687|  3.42k|      ++current;
  688|  3.42k|    } while (current != end && *current >= '0' && *current <= '9');
  ------------------
  |  Branch (688:14): [True: 2.45k, False: 970]
  |  Branch (688:32): [True: 2.44k, False: 8]
  |  Branch (688:51): [True: 2.43k, False: 6]
  ------------------
  689|       |
  690|    984|    exponent += (exponen_sign == '-' ? -num : num);
  ------------------
  |  Branch (690:18): [True: 392, False: 592]
  ------------------
  691|    984|  }
  692|       |
  693|  1.09k|  if (!(allow_trailing_spaces || allow_trailing_junk) && (current != end)) {
  ------------------
  |  Branch (693:9): [True: 1.09k, False: 0]
  |  Branch (693:34): [True: 0, False: 0]
  |  Branch (693:58): [True: 0, False: 0]
  ------------------
  694|      0|    return junk_string_value_;
  695|      0|  }
  696|  1.09k|  if (!allow_trailing_junk && AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (696:7): [True: 0, False: 1.09k]
  |  Branch (696:31): [True: 0, False: 0]
  ------------------
  697|      0|    return junk_string_value_;
  698|      0|  }
  699|  1.09k|  if (allow_trailing_spaces) {
  ------------------
  |  Branch (699:7): [True: 1.09k, False: 0]
  ------------------
  700|  1.09k|    AdvanceToNonspace(&current, end);
  701|  1.09k|  }
  702|       |
  703|  2.10k|  parsing_done:
  704|  2.10k|  exponent += insignificant_digits;
  705|       |
  706|  2.10k|  if (octal) {
  ------------------
  |  Branch (706:7): [True: 216, False: 1.88k]
  ------------------
  707|    216|    double result;
  708|    216|    bool result_is_junk;
  709|    216|    char* start = buffer;
  710|    216|    result = RadixStringToIeee<3>(&start,
  711|    216|                                  buffer + buffer_pos,
  712|    216|                                  sign,
  713|    216|                                  separator_,
  714|    216|                                  false, // Don't parse as hex_float.
  715|    216|                                  allow_trailing_junk,
  716|    216|                                  junk_string_value_,
  717|    216|                                  read_as_double,
  718|    216|                                  &result_is_junk);
  719|    216|    DOUBLE_CONVERSION_ASSERT(!result_is_junk);
  ------------------
  |  |   47|    216|    assert(condition)
  ------------------
  720|      0|    *processed_characters_count = static_cast<int>(current - input);
  721|    216|    return result;
  722|    216|  }
  723|       |
  724|  1.88k|  if (nonzero_digit_dropped) {
  ------------------
  |  Branch (724:7): [True: 24, False: 1.86k]
  ------------------
  725|     24|    buffer[buffer_pos++] = '1';
  726|     24|    exponent--;
  727|     24|  }
  728|       |
  729|  1.88k|  DOUBLE_CONVERSION_ASSERT(buffer_pos < kBufferSize);
  ------------------
  |  |   47|  1.88k|    assert(condition)
  ------------------
  730|      0|  buffer[buffer_pos] = '\0';
  731|       |
  732|       |  // Code above ensures there are no leading zeros and the buffer has fewer than
  733|       |  // kMaxSignificantDecimalDigits characters. Trim trailing zeros.
  734|  1.88k|  Vector<const char> chars(buffer, buffer_pos);
  735|  1.88k|  chars = TrimTrailingZeros(chars);
  736|  1.88k|  exponent += buffer_pos - chars.length();
  737|       |
  738|  1.88k|  double converted;
  739|  1.88k|  if (read_as_double) {
  ------------------
  |  Branch (739:7): [True: 1.88k, False: 0]
  ------------------
  740|  1.88k|    converted = StrtodTrimmed(chars, exponent);
  741|  1.88k|  } else {
  742|      0|    converted = StrtofTrimmed(chars, exponent);
  743|      0|  }
  744|  1.88k|  *processed_characters_count = static_cast<int>(current - input);
  745|  1.88k|  return sign? -converted: converted;
  ------------------
  |  Branch (745:10): [True: 2, False: 1.88k]
  ------------------
  746|  2.10k|}
string-to-double.cc:_ZN17double_conversionL17AdvanceToNonspaceIPKcEEbPT_S3_:
  139|  4.86k|static inline bool AdvanceToNonspace(Iterator* current, Iterator end) {
  140|  7.30k|  while (*current != end) {
  ------------------
  |  Branch (140:10): [True: 5.73k, False: 1.56k]
  ------------------
  141|  5.73k|    if (!isWhitespace(**current)) return true;
  ------------------
  |  Branch (141:9): [True: 3.29k, False: 2.44k]
  ------------------
  142|  2.44k|    ++*current;
  143|  2.44k|  }
  144|  1.56k|  return false;
  145|  4.86k|}
string-to-double.cc:_ZN17double_conversionL12isWhitespaceEi:
  123|  5.73k|static bool isWhitespace(int x) {
  124|  5.73k|  if (x < 128) {
  ------------------
  |  Branch (124:7): [True: 5.73k, False: 0]
  ------------------
  125|  30.2k|    for (int i = 0; i < kWhitespaceTable7Length; i++) {
  ------------------
  |  Branch (125:21): [True: 27.0k, False: 3.29k]
  ------------------
  126|  27.0k|      if (kWhitespaceTable7[i] == x) return true;
  ------------------
  |  Branch (126:11): [True: 2.44k, False: 24.5k]
  ------------------
  127|  27.0k|    }
  128|  5.73k|  } else {
  129|      0|    for (int i = 0; i < kWhitespaceTable16Length; i++) {
  ------------------
  |  Branch (129:21): [True: 0, False: 0]
  ------------------
  130|      0|      if (kWhitespaceTable16[i] == x) return true;
  ------------------
  |  Branch (130:11): [True: 0, False: 0]
  ------------------
  131|      0|    }
  132|      0|  }
  133|  3.29k|  return false;
  134|  5.73k|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_121ConsumeFirstCharacterEcPKcb:
   97|  5.89k|                                         bool case_insensitivity) {
   98|  5.89k|  return case_insensitivity ? ToLower(ch) == str[0] : ch == str[0];
  ------------------
  |  Branch (98:10): [True: 5.89k, False: 0]
  ------------------
   99|  5.89k|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_17ToLowerEc:
   54|  5.91k|inline char ToLower(char ch) {
   55|  5.91k|  static const std::ctype<char>& cType =
   56|  5.91k|      std::use_facet<std::ctype<char> >(std::locale::classic());
   57|  5.91k|  return cType.tolower(ch);
   58|  5.91k|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_116ConsumeSubStringIPKcEEbPT_S4_S3_b:
   86|      8|                             bool allow_case_insensitivity) {
   87|      8|  if (allow_case_insensitivity) {
  ------------------
  |  Branch (87:7): [True: 8, False: 0]
  ------------------
   88|      8|    return ConsumeSubStringImpl(current, end, substring, ToLower);
   89|      8|  } else {
   90|      0|    return ConsumeSubStringImpl(current, end, substring, Pass);
   91|      0|  }
   92|      8|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_120ConsumeSubStringImplIPKcPFccEEEbPT_S6_S3_T0_:
   68|      8|                                        Converter converter) {
   69|      8|  DOUBLE_CONVERSION_ASSERT(converter(**current) == *substring);
  ------------------
  |  |   47|      8|    assert(condition)
  ------------------
   70|     17|  for (substring++; *substring != '\0'; substring++) {
  ------------------
  |  Branch (70:21): [True: 13, False: 4]
  ------------------
   71|     13|    ++*current;
   72|     13|    if (*current == end || converter(**current) != *substring) {
  ------------------
  |  Branch (72:9): [True: 3, False: 10]
  |  Branch (72:28): [True: 1, False: 9]
  ------------------
   73|      4|      return false;
   74|      4|    }
   75|     13|  }
   76|      4|  ++*current;
   77|      4|  return true;
   78|      8|}
string-to-double.cc:_ZN17double_conversionL7AdvanceIPKcEEbPT_tiRS3_:
  190|  13.5M|static bool Advance (Iterator* it, uc16 separator, int base, Iterator& end) {
  191|  13.5M|  if (separator == StringToDoubleConverter::kNoSeparator) {
  ------------------
  |  Branch (191:7): [True: 13.5M, False: 0]
  ------------------
  192|  13.5M|    ++(*it);
  193|  13.5M|    return *it == end;
  194|  13.5M|  }
  195|      0|  if (!isDigit(**it, base)) {
  ------------------
  |  Branch (195:7): [True: 0, False: 0]
  ------------------
  196|      0|    ++(*it);
  197|      0|    return *it == end;
  198|      0|  }
  199|      0|  ++(*it);
  200|      0|  if (*it == end) return true;
  ------------------
  |  Branch (200:7): [True: 0, False: 0]
  ------------------
  201|      0|  if (*it + 1 == end) return false;
  ------------------
  |  Branch (201:7): [True: 0, False: 0]
  ------------------
  202|      0|  if (**it == separator && isDigit(*(*it + 1), base)) {
  ------------------
  |  Branch (202:7): [True: 0, False: 0]
  |  Branch (202:28): [True: 0, False: 0]
  ------------------
  203|      0|    ++(*it);
  204|      0|  }
  205|      0|  return *it == end;
  206|      0|}
string-to-double.cc:_ZN17double_conversionL10SignedZeroEb:
  155|     32|static double SignedZero(bool sign) {
  156|     32|  return sign ? -0.0 : 0.0;
  ------------------
  |  Branch (156:10): [True: 2, False: 30]
  ------------------
  157|     32|}
string-to-double.cc:_ZN17double_conversionL16IsHexFloatStringIPKcEEbT_S3_tb:
  219|  1.02k|                             bool allow_trailing_junk) {
  220|  1.02k|  DOUBLE_CONVERSION_ASSERT(start != end);
  ------------------
  |  |   47|  1.02k|    assert(condition)
  ------------------
  221|       |
  222|      0|  Iterator current = start;
  223|       |
  224|  1.02k|  bool saw_digit = false;
  225|  6.88k|  while (isDigit(*current, 16)) {
  ------------------
  |  Branch (225:10): [True: 6.10k, False: 786]
  ------------------
  226|  6.10k|    saw_digit = true;
  227|  6.10k|    if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (227:9): [True: 235, False: 5.86k]
  ------------------
  228|  6.10k|  }
  229|    786|  if (*current == '.') {
  ------------------
  |  Branch (229:7): [True: 142, False: 644]
  ------------------
  230|    142|    if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (230:9): [True: 2, False: 140]
  ------------------
  231|  7.48M|    while (isDigit(*current, 16)) {
  ------------------
  |  Branch (231:12): [True: 7.48M, False: 125]
  ------------------
  232|  7.48M|      saw_digit = true;
  233|  7.48M|      if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (233:11): [True: 15, False: 7.48M]
  ------------------
  234|  7.48M|    }
  235|    140|  }
  236|    769|  if (!saw_digit) return false;
  ------------------
  |  Branch (236:7): [True: 60, False: 709]
  ------------------
  237|    709|  if (*current != 'p' && *current != 'P') return false;
  ------------------
  |  Branch (237:7): [True: 344, False: 365]
  |  Branch (237:26): [True: 100, False: 244]
  ------------------
  238|    609|  if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (238:7): [True: 3, False: 606]
  ------------------
  239|    606|  if (*current == '+' || *current == '-') {
  ------------------
  |  Branch (239:7): [True: 4, False: 602]
  |  Branch (239:26): [True: 157, False: 445]
  ------------------
  240|    161|    if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (240:9): [True: 2, False: 159]
  ------------------
  241|    161|  }
  242|    604|  if (!isDigit(*current, 10)) return false;
  ------------------
  |  Branch (242:7): [True: 20, False: 584]
  ------------------
  243|    584|  if (Advance(&current, separator, 16, end)) return true;
  ------------------
  |  Branch (243:7): [True: 230, False: 354]
  ------------------
  244|  2.45k|  while (isDigit(*current, 10)) {
  ------------------
  |  Branch (244:10): [True: 2.40k, False: 56]
  ------------------
  245|  2.40k|    if (Advance(&current, separator, 16, end)) return true;
  ------------------
  |  Branch (245:9): [True: 298, False: 2.10k]
  ------------------
  246|  2.40k|  }
  247|     56|  return allow_trailing_junk || !AdvanceToNonspace(&current, end);
  ------------------
  |  Branch (247:10): [True: 56, False: 0]
  |  Branch (247:33): [True: 0, False: 0]
  ------------------
  248|    354|}
string-to-double.cc:_ZN17double_conversionL7isDigitEii:
  148|  7.50M|static bool isDigit(int x, int radix) {
  149|  7.50M|  return (x >= '0' && x <= '9' && x < '0' + radix)
  ------------------
  |  Branch (149:11): [True: 7.50M, False: 362]
  |  Branch (149:23): [True: 7.49M, False: 6.01k]
  |  Branch (149:35): [True: 7.49M, False: 0]
  ------------------
  150|  7.50M|      || (radix > 10 && x >= 'a' && x < 'a' + radix - 10)
  ------------------
  |  Branch (150:11): [True: 6.30k, False: 76]
  |  Branch (150:25): [True: 2.86k, False: 3.43k]
  |  Branch (150:37): [True: 2.45k, False: 412]
  ------------------
  151|  7.50M|      || (radix > 10 && x >= 'A' && x < 'A' + radix - 10);
  ------------------
  |  Branch (151:11): [True: 3.84k, False: 76]
  |  Branch (151:25): [True: 3.51k, False: 330]
  |  Branch (151:37): [True: 2.80k, False: 717]
  ------------------
  152|  7.50M|}
string-to-double.cc:_ZN17double_conversionL17RadixStringToIeeeILi4EPKcEEdPT0_S3_btbbdbPb:
  264|    646|                                bool* result_is_junk) {
  265|    646|  DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|    646|    assert(condition)
  ------------------
  266|    646|  DOUBLE_CONVERSION_ASSERT(!parse_as_hex_float ||
  ------------------
  |  |   47|    646|    assert(condition)
  ------------------
  267|      0|      IsHexFloatString(*current, end, separator, allow_trailing_junk));
  268|       |
  269|      0|  const int kDoubleSize = Double::kSignificandSize;
  270|    646|  const int kSingleSize = Single::kSignificandSize;
  271|    646|  const int kSignificandSize = read_as_double? kDoubleSize: kSingleSize;
  ------------------
  |  Branch (271:32): [True: 646, False: 0]
  ------------------
  272|       |
  273|    646|  *result_is_junk = true;
  274|       |
  275|    646|  int64_t number = 0;
  276|    646|  int exponent = 0;
  277|    646|  const int radix = (1 << radix_log_2);
  278|       |  // Whether we have encountered a '.' and are parsing the decimal digits.
  279|       |  // Only relevant if parse_as_hex_float is true.
  280|    646|  bool post_decimal = false;
  281|       |
  282|       |  // Skip leading 0s.
  283|  1.12k|  while (**current == '0') {
  ------------------
  |  Branch (283:10): [True: 486, False: 638]
  ------------------
  284|    486|    if (Advance(current, separator, radix, end)) {
  ------------------
  |  Branch (284:9): [True: 8, False: 478]
  ------------------
  285|      8|      *result_is_junk = false;
  286|      8|      return SignedZero(sign);
  287|      8|    }
  288|    486|  }
  289|       |
  290|  3.62M|  while (true) {
  ------------------
  |  Branch (290:10): [Folded - Ignored]
  ------------------
  291|  3.62M|    int digit;
  292|  3.62M|    if (IsDecimalDigitForRadix(**current, radix)) {
  ------------------
  |  Branch (292:9): [True: 3.61M, False: 2.75k]
  ------------------
  293|  3.61M|      digit = static_cast<char>(**current) - '0';
  294|  3.61M|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (294:11): [True: 3.61M, False: 1.09k]
  ------------------
  295|  3.61M|    } else if (IsCharacterDigitForRadix(**current, radix, 'a')) {
  ------------------
  |  Branch (295:16): [True: 1.08k, False: 1.67k]
  ------------------
  296|  1.08k|      digit = static_cast<char>(**current) - 'a' + 10;
  297|  1.08k|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (297:11): [True: 74, False: 1.00k]
  ------------------
  298|  1.67k|    } else if (IsCharacterDigitForRadix(**current, radix, 'A')) {
  ------------------
  |  Branch (298:16): [True: 1.27k, False: 402]
  ------------------
  299|  1.27k|      digit = static_cast<char>(**current) - 'A' + 10;
  300|  1.27k|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (300:11): [True: 77, False: 1.19k]
  ------------------
  301|  1.27k|    } else if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (301:16): [True: 306, False: 96]
  |  Branch (301:38): [True: 44, False: 262]
  ------------------
  302|     44|      post_decimal = true;
  303|     44|      Advance(current, separator, radix, end);
  304|     44|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|     44|    assert(condition)
  ------------------
  305|      0|      continue;
  306|    358|    } else if (parse_as_hex_float && (**current == 'p' || **current == 'P')) {
  ------------------
  |  Branch (306:16): [True: 262, False: 96]
  |  Branch (306:39): [True: 164, False: 98]
  |  Branch (306:59): [True: 98, False: 0]
  ------------------
  307|    262|      break;
  308|    262|    } else {
  309|     96|      if (allow_trailing_junk || !AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (309:11): [True: 96, False: 0]
  |  Branch (309:34): [True: 0, False: 0]
  ------------------
  310|     96|        break;
  311|     96|      } else {
  312|      0|        return junk_string_value;
  313|      0|      }
  314|     96|    }
  315|       |
  316|  3.62M|    number = number * radix + digit;
  317|  3.62M|    int overflow = static_cast<int>(number >> kSignificandSize);
  318|  3.62M|    if (overflow != 0) {
  ------------------
  |  Branch (318:9): [True: 154, False: 3.62M]
  ------------------
  319|       |      // Overflow occurred. Need to determine which direction to round the
  320|       |      // result.
  321|    154|      int overflow_bits_count = 1;
  322|    409|      while (overflow > 1) {
  ------------------
  |  Branch (322:14): [True: 255, False: 154]
  ------------------
  323|    255|        overflow_bits_count++;
  324|    255|        overflow >>= 1;
  325|    255|      }
  326|       |
  327|    154|      int dropped_bits_mask = ((1 << overflow_bits_count) - 1);
  328|    154|      int dropped_bits = static_cast<int>(number) & dropped_bits_mask;
  329|    154|      number >>= overflow_bits_count;
  330|    154|      exponent += overflow_bits_count;
  331|       |
  332|    154|      bool zero_tail = true;
  333|  1.77k|      for (;;) {
  334|  1.77k|        if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (334:13): [True: 101, False: 1.67k]
  ------------------
  335|  1.67k|        if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (335:13): [True: 688, False: 987]
  |  Branch (335:35): [True: 2, False: 686]
  ------------------
  336|       |          // Just run over the '.'. We are just trying to see whether there is
  337|       |          // a non-zero digit somewhere.
  338|      2|          Advance(current, separator, radix, end);
  339|      2|          DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      2|    assert(condition)
  ------------------
  340|      0|          post_decimal = true;
  341|      2|        }
  342|  1.67k|        if (!isDigit(**current, radix)) break;
  ------------------
  |  Branch (342:13): [True: 53, False: 1.62k]
  ------------------
  343|  1.62k|        zero_tail = zero_tail && **current == '0';
  ------------------
  |  Branch (343:21): [True: 281, False: 1.34k]
  |  Branch (343:34): [True: 220, False: 61]
  ------------------
  344|  1.62k|        if (!post_decimal) exponent += radix_log_2;
  ------------------
  |  Branch (344:13): [True: 1.25k, False: 368]
  ------------------
  345|  1.62k|      }
  346|       |
  347|    154|      if (!parse_as_hex_float &&
  ------------------
  |  Branch (347:11): [True: 124, False: 30]
  ------------------
  348|    154|          !allow_trailing_junk &&
  ------------------
  |  Branch (348:11): [True: 0, False: 124]
  ------------------
  349|    154|          AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (349:11): [True: 0, False: 0]
  ------------------
  350|      0|        return junk_string_value;
  351|      0|      }
  352|       |
  353|    154|      int middle_value = (1 << (overflow_bits_count - 1));
  354|    154|      if (dropped_bits > middle_value) {
  ------------------
  |  Branch (354:11): [True: 62, False: 92]
  ------------------
  355|     62|        number++;  // Rounding up.
  356|     92|      } else if (dropped_bits == middle_value) {
  ------------------
  |  Branch (356:18): [True: 23, False: 69]
  ------------------
  357|       |        // Rounding to even to consistency with decimals: half-way case rounds
  358|       |        // up if significant part is odd and down otherwise.
  359|     23|        if ((number & 1) != 0 || !zero_tail) {
  ------------------
  |  Branch (359:13): [True: 10, False: 13]
  |  Branch (359:34): [True: 8, False: 5]
  ------------------
  360|     18|          number++;  // Rounding up.
  361|     18|        }
  362|     23|      }
  363|       |
  364|       |      // Rounding up may cause overflow.
  365|    154|      if ((number & ((int64_t)1 << kSignificandSize)) != 0) {
  ------------------
  |  Branch (365:11): [True: 6, False: 148]
  ------------------
  366|      6|        exponent++;
  367|      6|        number >>= 1;
  368|      6|      }
  369|    154|      break;
  370|    154|    }
  371|  3.62M|    if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (371:9): [True: 126, False: 3.62M]
  ------------------
  372|  3.62M|  }
  373|       |
  374|    638|  DOUBLE_CONVERSION_ASSERT(number < ((int64_t)1 << kSignificandSize));
  ------------------
  |  |   47|    638|    assert(condition)
  ------------------
  375|    638|  DOUBLE_CONVERSION_ASSERT(static_cast<int64_t>(static_cast<double>(number)) == number);
  ------------------
  |  |   47|    638|    assert(condition)
  ------------------
  376|       |
  377|      0|  *result_is_junk = false;
  378|       |
  379|    638|  if (parse_as_hex_float) {
  ------------------
  |  Branch (379:7): [True: 292, False: 346]
  ------------------
  380|    292|    DOUBLE_CONVERSION_ASSERT(**current == 'p' || **current == 'P');
  ------------------
  |  |   47|    292|    assert(condition)
  ------------------
  381|      0|    Advance(current, separator, radix, end);
  382|    292|    DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|    292|    assert(condition)
  ------------------
  383|      0|    bool is_negative = false;
  384|    292|    if (**current == '+') {
  ------------------
  |  Branch (384:9): [True: 1, False: 291]
  ------------------
  385|      1|      Advance(current, separator, radix, end);
  386|      1|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      1|    assert(condition)
  ------------------
  387|    291|    } else if (**current == '-') {
  ------------------
  |  Branch (387:16): [True: 78, False: 213]
  ------------------
  388|     78|      is_negative = true;
  389|     78|      Advance(current, separator, radix, end);
  390|     78|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|     78|    assert(condition)
  ------------------
  391|     78|    }
  392|      0|    int written_exponent = 0;
  393|  1.52k|    while (IsDecimalDigitForRadix(**current, 10)) {
  ------------------
  |  Branch (393:12): [True: 1.49k, False: 28]
  ------------------
  394|       |      // No need to read exponents if they are too big. That could potentially overflow
  395|       |      // the `written_exponent` variable.
  396|  1.49k|      if (abs(written_exponent) <= 100 * Double::kMaxExponent) {
  ------------------
  |  Branch (396:11): [True: 1.04k, False: 446]
  ------------------
  397|  1.04k|        written_exponent = 10 * written_exponent + **current - '0';
  398|  1.04k|      }
  399|  1.49k|      if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (399:11): [True: 264, False: 1.22k]
  ------------------
  400|  1.49k|    }
  401|    292|    if (is_negative) written_exponent = -written_exponent;
  ------------------
  |  Branch (401:9): [True: 78, False: 214]
  ------------------
  402|    292|    exponent += written_exponent;
  403|    292|  }
  404|       |
  405|    638|  if (exponent == 0 || number == 0) {
  ------------------
  |  Branch (405:7): [True: 236, False: 402]
  |  Branch (405:24): [True: 15, False: 387]
  ------------------
  406|    251|    if (sign) {
  ------------------
  |  Branch (406:9): [True: 54, False: 197]
  ------------------
  407|     54|      if (number == 0) return -0.0;
  ------------------
  |  Branch (407:11): [True: 1, False: 53]
  ------------------
  408|     53|      number = -number;
  409|     53|    }
  410|    250|    return static_cast<double>(number);
  411|    251|  }
  412|       |
  413|    387|  DOUBLE_CONVERSION_ASSERT(number != 0);
  ------------------
  |  |   47|    387|    assert(condition)
  ------------------
  414|      0|  double result = Double(DiyFp(number, exponent)).value();
  415|    387|  return sign ? -result : result;
  ------------------
  |  Branch (415:10): [True: 1, False: 386]
  ------------------
  416|    638|}
string-to-double.cc:_ZN17double_conversionL22IsDecimalDigitForRadixEii:
  173|  3.62M|static bool inline IsDecimalDigitForRadix(int c, int radix) {
  174|  3.62M|  return '0' <= c && c <= '9' && (c - '0') < radix;
  ------------------
  |  Branch (174:10): [True: 3.62M, False: 118]
  |  Branch (174:22): [True: 3.62M, False: 2.66k]
  |  Branch (174:34): [True: 3.62M, False: 0]
  ------------------
  175|  3.62M|}
string-to-double.cc:_ZN17double_conversionL24IsCharacterDigitForRadixEiic:
  184|  4.43k|static bool IsCharacterDigitForRadix(int c, int radix, char a_character) {
  185|  4.43k|  return radix > 10 && c >= a_character && c < a_character + radix - 10;
  ------------------
  |  Branch (185:10): [True: 4.43k, False: 0]
  |  Branch (185:24): [True: 2.84k, False: 1.59k]
  |  Branch (185:44): [True: 2.35k, False: 487]
  ------------------
  186|  4.43k|}
string-to-double.cc:_ZN17double_conversionL17RadixStringToIeeeILi3EPcEEdPT0_S2_btbbdbPb:
  264|    216|                                bool* result_is_junk) {
  265|    216|  DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|    216|    assert(condition)
  ------------------
  266|    216|  DOUBLE_CONVERSION_ASSERT(!parse_as_hex_float ||
  ------------------
  |  |   47|    216|    assert(condition)
  ------------------
  267|      0|      IsHexFloatString(*current, end, separator, allow_trailing_junk));
  268|       |
  269|      0|  const int kDoubleSize = Double::kSignificandSize;
  270|    216|  const int kSingleSize = Single::kSignificandSize;
  271|    216|  const int kSignificandSize = read_as_double? kDoubleSize: kSingleSize;
  ------------------
  |  Branch (271:32): [True: 216, False: 0]
  ------------------
  272|       |
  273|    216|  *result_is_junk = true;
  274|       |
  275|    216|  int64_t number = 0;
  276|    216|  int exponent = 0;
  277|    216|  const int radix = (1 << radix_log_2);
  278|       |  // Whether we have encountered a '.' and are parsing the decimal digits.
  279|       |  // Only relevant if parse_as_hex_float is true.
  280|    216|  bool post_decimal = false;
  281|       |
  282|       |  // Skip leading 0s.
  283|    216|  while (**current == '0') {
  ------------------
  |  Branch (283:10): [True: 0, False: 216]
  ------------------
  284|      0|    if (Advance(current, separator, radix, end)) {
  ------------------
  |  Branch (284:9): [True: 0, False: 0]
  ------------------
  285|      0|      *result_is_junk = false;
  286|      0|      return SignedZero(sign);
  287|      0|    }
  288|      0|  }
  289|       |
  290|  3.09k|  while (true) {
  ------------------
  |  Branch (290:10): [Folded - Ignored]
  ------------------
  291|  3.09k|    int digit;
  292|  3.09k|    if (IsDecimalDigitForRadix(**current, radix)) {
  ------------------
  |  Branch (292:9): [True: 3.09k, False: 0]
  ------------------
  293|  3.09k|      digit = static_cast<char>(**current) - '0';
  294|  3.09k|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (294:11): [True: 0, False: 3.09k]
  ------------------
  295|  3.09k|    } else if (IsCharacterDigitForRadix(**current, radix, 'a')) {
  ------------------
  |  Branch (295:16): [True: 0, False: 0]
  ------------------
  296|      0|      digit = static_cast<char>(**current) - 'a' + 10;
  297|      0|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (297:11): [True: 0, False: 0]
  ------------------
  298|      0|    } else if (IsCharacterDigitForRadix(**current, radix, 'A')) {
  ------------------
  |  Branch (298:16): [True: 0, False: 0]
  ------------------
  299|      0|      digit = static_cast<char>(**current) - 'A' + 10;
  300|      0|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (300:11): [True: 0, False: 0]
  ------------------
  301|      0|    } else if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (301:16): [True: 0, False: 0]
  |  Branch (301:38): [True: 0, False: 0]
  ------------------
  302|      0|      post_decimal = true;
  303|      0|      Advance(current, separator, radix, end);
  304|      0|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  305|      0|      continue;
  306|      0|    } else if (parse_as_hex_float && (**current == 'p' || **current == 'P')) {
  ------------------
  |  Branch (306:16): [True: 0, False: 0]
  |  Branch (306:39): [True: 0, False: 0]
  |  Branch (306:59): [True: 0, False: 0]
  ------------------
  307|      0|      break;
  308|      0|    } else {
  309|      0|      if (allow_trailing_junk || !AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (309:11): [True: 0, False: 0]
  |  Branch (309:34): [True: 0, False: 0]
  ------------------
  310|      0|        break;
  311|      0|      } else {
  312|      0|        return junk_string_value;
  313|      0|      }
  314|      0|    }
  315|       |
  316|  3.09k|    number = number * radix + digit;
  317|  3.09k|    int overflow = static_cast<int>(number >> kSignificandSize);
  318|  3.09k|    if (overflow != 0) {
  ------------------
  |  Branch (318:9): [True: 144, False: 2.95k]
  ------------------
  319|       |      // Overflow occurred. Need to determine which direction to round the
  320|       |      // result.
  321|    144|      int overflow_bits_count = 1;
  322|    169|      while (overflow > 1) {
  ------------------
  |  Branch (322:14): [True: 25, False: 144]
  ------------------
  323|     25|        overflow_bits_count++;
  324|     25|        overflow >>= 1;
  325|     25|      }
  326|       |
  327|    144|      int dropped_bits_mask = ((1 << overflow_bits_count) - 1);
  328|    144|      int dropped_bits = static_cast<int>(number) & dropped_bits_mask;
  329|    144|      number >>= overflow_bits_count;
  330|    144|      exponent += overflow_bits_count;
  331|       |
  332|    144|      bool zero_tail = true;
  333|  5.96k|      for (;;) {
  334|  5.96k|        if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (334:13): [True: 144, False: 5.82k]
  ------------------
  335|  5.82k|        if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (335:13): [True: 0, False: 5.82k]
  |  Branch (335:35): [True: 0, False: 0]
  ------------------
  336|       |          // Just run over the '.'. We are just trying to see whether there is
  337|       |          // a non-zero digit somewhere.
  338|      0|          Advance(current, separator, radix, end);
  339|      0|          DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  340|      0|          post_decimal = true;
  341|      0|        }
  342|  5.82k|        if (!isDigit(**current, radix)) break;
  ------------------
  |  Branch (342:13): [True: 0, False: 5.82k]
  ------------------
  343|  5.82k|        zero_tail = zero_tail && **current == '0';
  ------------------
  |  Branch (343:21): [True: 1.43k, False: 4.38k]
  |  Branch (343:34): [True: 1.39k, False: 42]
  ------------------
  344|  5.82k|        if (!post_decimal) exponent += radix_log_2;
  ------------------
  |  Branch (344:13): [True: 5.82k, False: 0]
  ------------------
  345|  5.82k|      }
  346|       |
  347|    144|      if (!parse_as_hex_float &&
  ------------------
  |  Branch (347:11): [True: 144, False: 0]
  ------------------
  348|    144|          !allow_trailing_junk &&
  ------------------
  |  Branch (348:11): [True: 0, False: 144]
  ------------------
  349|    144|          AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (349:11): [True: 0, False: 0]
  ------------------
  350|      0|        return junk_string_value;
  351|      0|      }
  352|       |
  353|    144|      int middle_value = (1 << (overflow_bits_count - 1));
  354|    144|      if (dropped_bits > middle_value) {
  ------------------
  |  Branch (354:11): [True: 2, False: 142]
  ------------------
  355|      2|        number++;  // Rounding up.
  356|    142|      } else if (dropped_bits == middle_value) {
  ------------------
  |  Branch (356:18): [True: 60, False: 82]
  ------------------
  357|       |        // Rounding to even to consistency with decimals: half-way case rounds
  358|       |        // up if significant part is odd and down otherwise.
  359|     60|        if ((number & 1) != 0 || !zero_tail) {
  ------------------
  |  Branch (359:13): [True: 42, False: 18]
  |  Branch (359:34): [True: 3, False: 15]
  ------------------
  360|     45|          number++;  // Rounding up.
  361|     45|        }
  362|     60|      }
  363|       |
  364|       |      // Rounding up may cause overflow.
  365|    144|      if ((number & ((int64_t)1 << kSignificandSize)) != 0) {
  ------------------
  |  Branch (365:11): [True: 16, False: 128]
  ------------------
  366|     16|        exponent++;
  367|     16|        number >>= 1;
  368|     16|      }
  369|    144|      break;
  370|    144|    }
  371|  2.95k|    if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (371:9): [True: 72, False: 2.87k]
  ------------------
  372|  2.95k|  }
  373|       |
  374|    216|  DOUBLE_CONVERSION_ASSERT(number < ((int64_t)1 << kSignificandSize));
  ------------------
  |  |   47|    216|    assert(condition)
  ------------------
  375|    216|  DOUBLE_CONVERSION_ASSERT(static_cast<int64_t>(static_cast<double>(number)) == number);
  ------------------
  |  |   47|    216|    assert(condition)
  ------------------
  376|       |
  377|      0|  *result_is_junk = false;
  378|       |
  379|    216|  if (parse_as_hex_float) {
  ------------------
  |  Branch (379:7): [True: 0, False: 216]
  ------------------
  380|      0|    DOUBLE_CONVERSION_ASSERT(**current == 'p' || **current == 'P');
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  381|      0|    Advance(current, separator, radix, end);
  382|      0|    DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  383|      0|    bool is_negative = false;
  384|      0|    if (**current == '+') {
  ------------------
  |  Branch (384:9): [True: 0, False: 0]
  ------------------
  385|      0|      Advance(current, separator, radix, end);
  386|      0|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  387|      0|    } else if (**current == '-') {
  ------------------
  |  Branch (387:16): [True: 0, False: 0]
  ------------------
  388|      0|      is_negative = true;
  389|      0|      Advance(current, separator, radix, end);
  390|      0|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  391|      0|    }
  392|      0|    int written_exponent = 0;
  393|      0|    while (IsDecimalDigitForRadix(**current, 10)) {
  ------------------
  |  Branch (393:12): [True: 0, False: 0]
  ------------------
  394|       |      // No need to read exponents if they are too big. That could potentially overflow
  395|       |      // the `written_exponent` variable.
  396|      0|      if (abs(written_exponent) <= 100 * Double::kMaxExponent) {
  ------------------
  |  Branch (396:11): [True: 0, False: 0]
  ------------------
  397|      0|        written_exponent = 10 * written_exponent + **current - '0';
  398|      0|      }
  399|      0|      if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (399:11): [True: 0, False: 0]
  ------------------
  400|      0|    }
  401|      0|    if (is_negative) written_exponent = -written_exponent;
  ------------------
  |  Branch (401:9): [True: 0, False: 0]
  ------------------
  402|      0|    exponent += written_exponent;
  403|      0|  }
  404|       |
  405|    216|  if (exponent == 0 || number == 0) {
  ------------------
  |  Branch (405:7): [True: 72, False: 144]
  |  Branch (405:24): [True: 0, False: 144]
  ------------------
  406|     72|    if (sign) {
  ------------------
  |  Branch (406:9): [True: 20, False: 52]
  ------------------
  407|     20|      if (number == 0) return -0.0;
  ------------------
  |  Branch (407:11): [True: 0, False: 20]
  ------------------
  408|     20|      number = -number;
  409|     20|    }
  410|     72|    return static_cast<double>(number);
  411|     72|  }
  412|       |
  413|    144|  DOUBLE_CONVERSION_ASSERT(number != 0);
  ------------------
  |  |   47|    144|    assert(condition)
  ------------------
  414|      0|  double result = Double(DiyFp(number, exponent)).value();
  415|    144|  return sign ? -result : result;
  ------------------
  |  Branch (415:10): [True: 1, False: 143]
  ------------------
  416|    216|}
string-to-double.cc:_ZN17double_conversionL7AdvanceIPcEEbPT_tiRS2_:
  190|  8.91k|static bool Advance (Iterator* it, uc16 separator, int base, Iterator& end) {
  191|  8.91k|  if (separator == StringToDoubleConverter::kNoSeparator) {
  ------------------
  |  Branch (191:7): [True: 8.91k, False: 0]
  ------------------
  192|  8.91k|    ++(*it);
  193|  8.91k|    return *it == end;
  194|  8.91k|  }
  195|      0|  if (!isDigit(**it, base)) {
  ------------------
  |  Branch (195:7): [True: 0, False: 0]
  ------------------
  196|      0|    ++(*it);
  197|      0|    return *it == end;
  198|      0|  }
  199|      0|  ++(*it);
  200|      0|  if (*it == end) return true;
  ------------------
  |  Branch (200:7): [True: 0, False: 0]
  ------------------
  201|      0|  if (*it + 1 == end) return false;
  ------------------
  |  Branch (201:7): [True: 0, False: 0]
  ------------------
  202|      0|  if (**it == separator && isDigit(*(*it + 1), base)) {
  ------------------
  |  Branch (202:7): [True: 0, False: 0]
  |  Branch (202:28): [True: 0, False: 0]
  ------------------
  203|      0|    ++(*it);
  204|      0|  }
  205|      0|  return *it == end;
  206|      0|}

_ZN17double_conversion23StringToDoubleConverterC2EiddPKcS2_t:
  178|  3.00k|        separator_(separator) {
  179|  3.00k|  }

_ZN17double_conversion13StrtodTrimmedENS_6VectorIKcEEi:
  466|  1.88k|double StrtodTrimmed(Vector<const char> trimmed, int exponent) {
  467|  1.88k|  DOUBLE_CONVERSION_ASSERT(trimmed.length() <= kMaxSignificantDecimalDigits);
  ------------------
  |  |   47|  1.88k|    assert(condition)
  ------------------
  468|  1.88k|  DOUBLE_CONVERSION_ASSERT(AssertTrimmedDigits(trimmed));
  ------------------
  |  |   47|  1.88k|    assert(condition)
  ------------------
  469|      0|  double guess;
  470|  1.88k|  const bool is_correct = ComputeGuess(trimmed, exponent, &guess);
  471|  1.88k|  if (is_correct) {
  ------------------
  |  Branch (471:7): [True: 1.17k, False: 710]
  ------------------
  472|  1.17k|    return guess;
  473|  1.17k|  }
  474|    710|  DiyFp upper_boundary = Double(guess).UpperBoundary();
  475|    710|  int comparison = CompareBufferWithDiyFp(trimmed, exponent, upper_boundary);
  476|    710|  if (comparison < 0) {
  ------------------
  |  Branch (476:7): [True: 180, False: 530]
  ------------------
  477|    180|    return guess;
  478|    530|  } else if (comparison > 0) {
  ------------------
  |  Branch (478:14): [True: 397, False: 133]
  ------------------
  479|    397|    return Double(guess).NextDouble();
  480|    397|  } else if ((Double(guess).Significand() & 1) == 0) {
  ------------------
  |  Branch (480:14): [True: 31, False: 102]
  ------------------
  481|       |    // Round towards even.
  482|     31|    return guess;
  483|    102|  } else {
  484|    102|    return Double(guess).NextDouble();
  485|    102|  }
  486|    710|}
strtod.cc:_ZN17double_conversionL19AssertTrimmedDigitsERKNS_6VectorIKcEE:
  457|  1.88k|static bool AssertTrimmedDigits(const Vector<const char>& buffer) {
  458|   116k|  for(int i = 0; i < buffer.length(); ++i) {
  ------------------
  |  Branch (458:18): [True: 114k, False: 1.88k]
  ------------------
  459|   114k|    if(!IsDigit(buffer[i])) {
  ------------------
  |  Branch (459:8): [True: 0, False: 114k]
  ------------------
  460|      0|      return false;
  461|      0|    }
  462|   114k|  }
  463|  1.88k|  return (buffer.length() == 0) || (IsNonZeroDigit(buffer[0]) && IsNonZeroDigit(buffer[buffer.length()-1]));
  ------------------
  |  Branch (463:10): [True: 71, False: 1.81k]
  |  Branch (463:37): [True: 1.81k, False: 0]
  |  Branch (463:66): [True: 1.81k, False: 0]
  ------------------
  464|  1.88k|}
strtod.cc:_ZN17double_conversionL7IsDigitEc:
  444|   114k|static bool IsDigit(const char d) {
  445|   114k|  return ('0' <= d) && (d <= '9');
  ------------------
  |  Branch (445:10): [True: 114k, False: 0]
  |  Branch (445:24): [True: 114k, False: 0]
  ------------------
  446|   114k|}
strtod.cc:_ZN17double_conversionL14IsNonZeroDigitEc:
  448|  3.63k|static bool IsNonZeroDigit(const char d) {
  449|  3.63k|  return ('1' <= d) && (d <= '9');
  ------------------
  |  Branch (449:10): [True: 3.63k, False: 0]
  |  Branch (449:24): [True: 3.63k, False: 0]
  ------------------
  450|  3.63k|}
strtod.cc:_ZN17double_conversionL12ComputeGuessENS_6VectorIKcEEiPd:
  420|  1.88k|                         double* guess) {
  421|  1.88k|  if (trimmed.length() == 0) {
  ------------------
  |  Branch (421:7): [True: 71, False: 1.81k]
  ------------------
  422|     71|    *guess = 0.0;
  423|     71|    return true;
  424|     71|  }
  425|  1.81k|  if (exponent + trimmed.length() - 1 >= kMaxDecimalPower) {
  ------------------
  |  Branch (425:7): [True: 103, False: 1.71k]
  ------------------
  426|    103|    *guess = Double::Infinity();
  427|    103|    return true;
  428|    103|  }
  429|  1.71k|  if (exponent + trimmed.length() <= kMinDecimalPower) {
  ------------------
  |  Branch (429:7): [True: 61, False: 1.65k]
  ------------------
  430|     61|    *guess = 0.0;
  431|     61|    return true;
  432|     61|  }
  433|       |
  434|  1.65k|  if (DoubleStrtod(trimmed, exponent, guess) ||
  ------------------
  |  Branch (434:7): [True: 295, False: 1.35k]
  ------------------
  435|  1.65k|      DiyFpStrtod(trimmed, exponent, guess)) {
  ------------------
  |  Branch (435:7): [True: 648, False: 711]
  ------------------
  436|    943|    return true;
  437|    943|  }
  438|    711|  if (*guess == Double::Infinity()) {
  ------------------
  |  Branch (438:7): [True: 1, False: 710]
  ------------------
  439|      1|    return true;
  440|      1|  }
  441|    710|  return false;
  442|    711|}
strtod.cc:_ZN17double_conversionL12DoubleStrtodENS_6VectorIKcEEiPd:
  192|  1.65k|                         double* result) {
  193|       |#if !defined(DOUBLE_CONVERSION_CORRECT_DOUBLE_OPERATIONS)
  194|       |  // Avoid "unused parameter" warnings
  195|       |  (void) trimmed;
  196|       |  (void) exponent;
  197|       |  (void) result;
  198|       |  // On x86 the floating-point stack can be 64 or 80 bits wide. If it is
  199|       |  // 80 bits wide (as is the case on Linux) then double-rounding occurs and the
  200|       |  // result is not accurate.
  201|       |  // We know that Windows32 uses 64 bits and is therefore accurate.
  202|       |  return false;
  203|       |#else
  204|  1.65k|  if (trimmed.length() <= kMaxExactDoubleIntegerDecimalDigits) {
  ------------------
  |  Branch (204:7): [True: 988, False: 666]
  ------------------
  205|    988|    int read_digits;
  206|       |    // The trimmed input fits into a double.
  207|       |    // If the 10^exponent (resp. 10^-exponent) fits into a double too then we
  208|       |    // can compute the result-double simply by multiplying (resp. dividing) the
  209|       |    // two numbers.
  210|       |    // This is possible because IEEE guarantees that floating-point operations
  211|       |    // return the best possible approximation.
  212|    988|    if (exponent < 0 && -exponent < kExactPowersOfTenSize) {
  ------------------
  |  Branch (212:9): [True: 369, False: 619]
  |  Branch (212:25): [True: 73, False: 296]
  ------------------
  213|       |      // 10^-exponent fits into a double.
  214|     73|      *result = static_cast<double>(ReadUint64(trimmed, &read_digits));
  215|     73|      DOUBLE_CONVERSION_ASSERT(read_digits == trimmed.length());
  ------------------
  |  |   47|     73|    assert(condition)
  ------------------
  216|      0|      *result /= exact_powers_of_ten[-exponent];
  217|     73|      return true;
  218|     73|    }
  219|    915|    if (0 <= exponent && exponent < kExactPowersOfTenSize) {
  ------------------
  |  Branch (219:9): [True: 619, False: 296]
  |  Branch (219:26): [True: 167, False: 452]
  ------------------
  220|       |      // 10^exponent fits into a double.
  221|    167|      *result = static_cast<double>(ReadUint64(trimmed, &read_digits));
  222|    167|      DOUBLE_CONVERSION_ASSERT(read_digits == trimmed.length());
  ------------------
  |  |   47|    167|    assert(condition)
  ------------------
  223|      0|      *result *= exact_powers_of_ten[exponent];
  224|    167|      return true;
  225|    167|    }
  226|    748|    int remaining_digits =
  227|    748|        kMaxExactDoubleIntegerDecimalDigits - trimmed.length();
  228|    748|    if ((0 <= exponent) &&
  ------------------
  |  Branch (228:9): [True: 452, False: 296]
  ------------------
  229|    748|        (exponent - remaining_digits < kExactPowersOfTenSize)) {
  ------------------
  |  Branch (229:9): [True: 55, False: 397]
  ------------------
  230|       |      // The trimmed string was short and we can multiply it with
  231|       |      // 10^remaining_digits. As a result the remaining exponent now fits
  232|       |      // into a double too.
  233|     55|      *result = static_cast<double>(ReadUint64(trimmed, &read_digits));
  234|     55|      DOUBLE_CONVERSION_ASSERT(read_digits == trimmed.length());
  ------------------
  |  |   47|     55|    assert(condition)
  ------------------
  235|      0|      *result *= exact_powers_of_ten[remaining_digits];
  236|     55|      *result *= exact_powers_of_ten[exponent - remaining_digits];
  237|     55|      return true;
  238|     55|    }
  239|    748|  }
  240|  1.35k|  return false;
  241|  1.65k|#endif
  242|  1.65k|}
strtod.cc:_ZN17double_conversionL10ReadUint64ENS_6VectorIKcEEPi:
  152|  1.65k|                           int* number_of_read_digits) {
  153|  1.65k|  uint64_t result = 0;
  154|  1.65k|  int i = 0;
  155|  18.4k|  while (i < buffer.length() && result <= (kMaxUint64 / 10 - 1)) {
  ------------------
  |  Branch (155:10): [True: 17.0k, False: 1.35k]
  |  Branch (155:33): [True: 16.7k, False: 303]
  ------------------
  156|  16.7k|    int digit = buffer[i++] - '0';
  157|  16.7k|    DOUBLE_CONVERSION_ASSERT(0 <= digit && digit <= 9);
  ------------------
  |  |   47|  16.7k|    assert(condition)
  ------------------
  158|      0|    result = 10 * result + digit;
  159|  16.7k|  }
  160|  1.65k|  *number_of_read_digits = i;
  161|  1.65k|  return result;
  162|  1.65k|}
strtod.cc:_ZN17double_conversionL11DiyFpStrtodENS_6VectorIKcEEiPd:
  272|  1.35k|                        double* result) {
  273|  1.35k|  DiyFp input;
  274|  1.35k|  int remaining_decimals;
  275|  1.35k|  ReadDiyFp(buffer, &input, &remaining_decimals);
  276|       |  // Since we may have dropped some digits the input is not accurate.
  277|       |  // If remaining_decimals is different than 0 than the error is at most
  278|       |  // .5 ulp (unit in the last place).
  279|       |  // We don't want to deal with fractions and therefore keep a common
  280|       |  // denominator.
  281|  1.35k|  const int kDenominatorLog = 3;
  282|  1.35k|  const int kDenominator = 1 << kDenominatorLog;
  283|       |  // Move the remaining decimals into the exponent.
  284|  1.35k|  exponent += remaining_decimals;
  285|  1.35k|  uint64_t error = (remaining_decimals == 0 ? 0 : kDenominator / 2);
  ------------------
  |  Branch (285:21): [True: 1.05k, False: 303]
  ------------------
  286|       |
  287|  1.35k|  int old_e = input.e();
  288|  1.35k|  input.Normalize();
  289|  1.35k|  error <<= old_e - input.e();
  290|       |
  291|  1.35k|  DOUBLE_CONVERSION_ASSERT(exponent <= PowersOfTenCache::kMaxDecimalExponent);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  292|  1.35k|  if (exponent < PowersOfTenCache::kMinDecimalExponent) {
  ------------------
  |  Branch (292:7): [True: 0, False: 1.35k]
  ------------------
  293|      0|    *result = 0.0;
  294|      0|    return true;
  295|      0|  }
  296|  1.35k|  DiyFp cached_power;
  297|  1.35k|  int cached_decimal_exponent;
  298|  1.35k|  PowersOfTenCache::GetCachedPowerForDecimalExponent(exponent,
  299|  1.35k|                                                     &cached_power,
  300|  1.35k|                                                     &cached_decimal_exponent);
  301|       |
  302|  1.35k|  if (cached_decimal_exponent != exponent) {
  ------------------
  |  Branch (302:7): [True: 1.22k, False: 130]
  ------------------
  303|  1.22k|    int adjustment_exponent = exponent - cached_decimal_exponent;
  304|  1.22k|    DiyFp adjustment_power = AdjustmentPowerOfTen(adjustment_exponent);
  305|  1.22k|    input.Multiply(adjustment_power);
  306|  1.22k|    if (kMaxUint64DecimalDigits - buffer.length() >= adjustment_exponent) {
  ------------------
  |  Branch (306:9): [True: 612, False: 617]
  ------------------
  307|       |      // The product of input with the adjustment power fits into a 64 bit
  308|       |      // integer.
  309|    612|      DOUBLE_CONVERSION_ASSERT(DiyFp::kSignificandSize == 64);
  ------------------
  |  |   47|    612|    assert(condition)
  ------------------
  310|    617|    } else {
  311|       |      // The adjustment power is exact. There is hence only an error of 0.5.
  312|    617|      error += kDenominator / 2;
  313|    617|    }
  314|  1.22k|  }
  315|       |
  316|      0|  input.Multiply(cached_power);
  317|       |  // The error introduced by a multiplication of a*b equals
  318|       |  //   error_a + error_b + error_a*error_b/2^64 + 0.5
  319|       |  // Substituting a with 'input' and b with 'cached_power' we have
  320|       |  //   error_b = 0.5  (all cached powers have an error of less than 0.5 ulp),
  321|       |  //   error_ab = 0 or 1 / kDenominator > error_a*error_b/ 2^64
  322|  1.35k|  int error_b = kDenominator / 2;
  323|  1.35k|  int error_ab = (error == 0 ? 0 : 1);  // We round up to 1.
  ------------------
  |  Branch (323:19): [True: 707, False: 652]
  ------------------
  324|  1.35k|  int fixed_error = kDenominator / 2;
  325|  1.35k|  error += error_b + error_ab + fixed_error;
  326|       |
  327|  1.35k|  old_e = input.e();
  328|  1.35k|  input.Normalize();
  329|  1.35k|  error <<= old_e - input.e();
  330|       |
  331|       |  // See if the double's significand changes if we add/subtract the error.
  332|  1.35k|  int order_of_magnitude = DiyFp::kSignificandSize + input.e();
  333|  1.35k|  int effective_significand_size =
  334|  1.35k|      Double::SignificandSizeForOrderOfMagnitude(order_of_magnitude);
  335|  1.35k|  int precision_digits_count =
  336|  1.35k|      DiyFp::kSignificandSize - effective_significand_size;
  337|  1.35k|  if (precision_digits_count + kDenominatorLog >= DiyFp::kSignificandSize) {
  ------------------
  |  Branch (337:7): [True: 88, False: 1.27k]
  ------------------
  338|       |    // This can only happen for very small denormals. In this case the
  339|       |    // half-way multiplied by the denominator exceeds the range of an uint64.
  340|       |    // Simply shift everything to the right.
  341|     88|    int shift_amount = (precision_digits_count + kDenominatorLog) -
  342|     88|        DiyFp::kSignificandSize + 1;
  343|     88|    input.set_f(input.f() >> shift_amount);
  344|     88|    input.set_e(input.e() + shift_amount);
  345|       |    // We add 1 for the lost precision of error, and kDenominator for
  346|       |    // the lost precision of input.f().
  347|     88|    error = (error >> shift_amount) + 1 + kDenominator;
  348|     88|    precision_digits_count -= shift_amount;
  349|     88|  }
  350|       |  // We use uint64_ts now. This only works if the DiyFp uses uint64_ts too.
  351|  1.35k|  DOUBLE_CONVERSION_ASSERT(DiyFp::kSignificandSize == 64);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  352|  1.35k|  DOUBLE_CONVERSION_ASSERT(precision_digits_count < 64);
  ------------------
  |  |   47|  1.35k|    assert(condition)
  ------------------
  353|      0|  uint64_t one64 = 1;
  354|  1.35k|  uint64_t precision_bits_mask = (one64 << precision_digits_count) - 1;
  355|  1.35k|  uint64_t precision_bits = input.f() & precision_bits_mask;
  356|  1.35k|  uint64_t half_way = one64 << (precision_digits_count - 1);
  357|  1.35k|  precision_bits *= kDenominator;
  358|  1.35k|  half_way *= kDenominator;
  359|  1.35k|  DiyFp rounded_input(input.f() >> precision_digits_count,
  360|  1.35k|                      input.e() + precision_digits_count);
  361|  1.35k|  if (precision_bits >= half_way + error) {
  ------------------
  |  Branch (361:7): [True: 316, False: 1.04k]
  ------------------
  362|    316|    rounded_input.set_f(rounded_input.f() + 1);
  363|    316|  }
  364|       |  // If the last_bits are too close to the half-way case than we are too
  365|       |  // inaccurate and round down. In this case we return false so that we can
  366|       |  // fall back to a more precise algorithm.
  367|       |
  368|  1.35k|  *result = Double(rounded_input).value();
  369|  1.35k|  if (half_way - error < precision_bits && precision_bits < half_way + error) {
  ------------------
  |  Branch (369:7): [True: 1.02k, False: 332]
  |  Branch (369:44): [True: 711, False: 316]
  ------------------
  370|       |    // Too imprecise. The caller will have to fall back to a slower version.
  371|       |    // However the returned number is guaranteed to be either the correct
  372|       |    // double, or the next-lower double.
  373|    711|    return false;
  374|    711|  } else {
  375|    648|    return true;
  376|    648|  }
  377|  1.35k|}
strtod.cc:_ZN17double_conversionL9ReadDiyFpENS_6VectorIKcEEPNS_5DiyFpEPi:
  171|  1.35k|                      int* remaining_decimals) {
  172|  1.35k|  int read_digits;
  173|  1.35k|  uint64_t significand = ReadUint64(buffer, &read_digits);
  174|  1.35k|  if (buffer.length() == read_digits) {
  ------------------
  |  Branch (174:7): [True: 1.05k, False: 303]
  ------------------
  175|  1.05k|    *result = DiyFp(significand, 0);
  176|  1.05k|    *remaining_decimals = 0;
  177|  1.05k|  } else {
  178|       |    // Round the significand.
  179|    303|    if (buffer[read_digits] >= '5') {
  ------------------
  |  Branch (179:9): [True: 67, False: 236]
  ------------------
  180|     67|      significand++;
  181|     67|    }
  182|       |    // Compute the binary exponent.
  183|    303|    int exponent = 0;
  184|    303|    *result = DiyFp(significand, exponent);
  185|    303|    *remaining_decimals = buffer.length() - read_digits;
  186|    303|  }
  187|  1.35k|}
strtod.cc:_ZN17double_conversionL20AdjustmentPowerOfTenEi:
  247|  1.22k|static DiyFp AdjustmentPowerOfTen(int exponent) {
  248|  1.22k|  DOUBLE_CONVERSION_ASSERT(0 < exponent);
  ------------------
  |  |   47|  1.22k|    assert(condition)
  ------------------
  249|  1.22k|  DOUBLE_CONVERSION_ASSERT(exponent < PowersOfTenCache::kDecimalExponentDistance);
  ------------------
  |  |   47|  1.22k|    assert(condition)
  ------------------
  250|       |  // Simply hardcode the remaining powers for the given decimal exponent
  251|       |  // distance.
  252|  1.22k|  DOUBLE_CONVERSION_ASSERT(PowersOfTenCache::kDecimalExponentDistance == 8);
  ------------------
  |  |   47|  1.22k|    assert(condition)
  ------------------
  253|      0|  switch (exponent) {
  254|    161|    case 1: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xa0000000, 00000000), -60);
  ------------------
  |  |  195|    161|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (254:5): [True: 161, False: 1.06k]
  ------------------
  255|     99|    case 2: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xc8000000, 00000000), -57);
  ------------------
  |  |  195|     99|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (255:5): [True: 99, False: 1.13k]
  ------------------
  256|    130|    case 3: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xfa000000, 00000000), -54);
  ------------------
  |  |  195|    130|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (256:5): [True: 130, False: 1.09k]
  ------------------
  257|    416|    case 4: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0x9c400000, 00000000), -50);
  ------------------
  |  |  195|    416|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (257:5): [True: 416, False: 813]
  ------------------
  258|    150|    case 5: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xc3500000, 00000000), -47);
  ------------------
  |  |  195|    150|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (258:5): [True: 150, False: 1.07k]
  ------------------
  259|    124|    case 6: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xf4240000, 00000000), -44);
  ------------------
  |  |  195|    124|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (259:5): [True: 124, False: 1.10k]
  ------------------
  260|    149|    case 7: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0x98968000, 00000000), -40);
  ------------------
  |  |  195|    149|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (260:5): [True: 149, False: 1.08k]
  ------------------
  261|      0|    default:
  ------------------
  |  Branch (261:5): [True: 0, False: 1.22k]
  ------------------
  262|      0|      DOUBLE_CONVERSION_UNREACHABLE();
  ------------------
  |  |   77|      0|#define DOUBLE_CONVERSION_UNREACHABLE()   (abort())
  ------------------
  263|  1.22k|  }
  264|  1.22k|}
strtod.cc:_ZN17double_conversionL22CompareBufferWithDiyFpENS_6VectorIKcEEiNS_5DiyFpE:
  390|    710|                                  DiyFp diy_fp) {
  391|    710|  DOUBLE_CONVERSION_ASSERT(buffer.length() + exponent <= kMaxDecimalPower + 1);
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  392|    710|  DOUBLE_CONVERSION_ASSERT(buffer.length() + exponent > kMinDecimalPower);
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  393|    710|  DOUBLE_CONVERSION_ASSERT(buffer.length() <= kMaxSignificantDecimalDigits);
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  394|       |  // Make sure that the Bignum will be able to hold all our numbers.
  395|       |  // Our Bignum implementation has a separate field for exponents. Shifts will
  396|       |  // consume at most one bigit (< 64 bits).
  397|       |  // ln(10) == 3.3219...
  398|    710|  DOUBLE_CONVERSION_ASSERT(((kMaxDecimalPower + 1) * 333 / 100) < Bignum::kMaxSignificantBits);
  ------------------
  |  |   47|    710|    assert(condition)
  ------------------
  399|      0|  Bignum buffer_bignum;
  400|    710|  Bignum diy_fp_bignum;
  401|    710|  buffer_bignum.AssignDecimalString(buffer);
  402|    710|  diy_fp_bignum.AssignUInt64(diy_fp.f());
  403|    710|  if (exponent >= 0) {
  ------------------
  |  Branch (403:7): [True: 460, False: 250]
  ------------------
  404|    460|    buffer_bignum.MultiplyByPowerOfTen(exponent);
  405|    460|  } else {
  406|    250|    diy_fp_bignum.MultiplyByPowerOfTen(-exponent);
  407|    250|  }
  408|    710|  if (diy_fp.e() > 0) {
  ------------------
  |  Branch (408:7): [True: 400, False: 310]
  ------------------
  409|    400|    diy_fp_bignum.ShiftLeft(diy_fp.e());
  410|    400|  } else {
  411|    310|    buffer_bignum.ShiftLeft(-diy_fp.e());
  412|    310|  }
  413|    710|  return Bignum::Compare(buffer_bignum, diy_fp_bignum);
  414|    710|}

_ZN17double_conversion17TrimTrailingZerosENS_6VectorIKcEE:
   53|  1.88k|inline Vector<const char> TrimTrailingZeros(Vector<const char> buffer) {
   54|  10.2k|  for (int i = buffer.length() - 1; i >= 0; --i) {
  ------------------
  |  Branch (54:37): [True: 10.1k, False: 71]
  ------------------
   55|  10.1k|    if (buffer[i] != '0') {
  ------------------
  |  Branch (55:9): [True: 1.81k, False: 8.38k]
  ------------------
   56|  1.81k|      return buffer.SubVector(0, i + 1);
   57|  1.81k|    }
   58|  10.1k|  }
   59|     71|  return Vector<const char>(buffer.start(), 0);
   60|  1.88k|}

_ZN17double_conversion7BitCastIdmEET_RKT0_:
  395|  3.20k|Dest BitCast(const Source& source) {
  396|       |  // Compile time assertion: sizeof(Dest) == sizeof(Source)
  397|       |  // A compile error here means your Dest and Source have different sizes.
  398|  3.20k|#if __cplusplus >= 201103L
  399|  3.20k|  static_assert(sizeof(Dest) == sizeof(Source),
  400|  3.20k|                "source and destination size mismatch");
  401|       |#else
  402|       |  DOUBLE_CONVERSION_UNUSED
  403|       |  typedef char VerifySizesAreEqual[sizeof(Dest) == sizeof(Source) ? 1 : -1];
  404|       |#endif
  405|       |
  406|  3.20k|  Dest dest;
  407|  3.20k|  memmove(&dest, &source, sizeof(dest));
  408|  3.20k|  return dest;
  409|  3.20k|}
_ZN17double_conversion6VectorIKcEC2EPS1_i:
  252|  3.77k|  Vector(T* data, int len) : start_(data), length_(len) {
  253|  3.77k|    DOUBLE_CONVERSION_ASSERT(len == 0 || (len > 0 && data != DOUBLE_CONVERSION_NULLPTR));
  ------------------
  |  |   47|  3.77k|    assert(condition)
  ------------------
  254|  3.77k|  }
_ZNK17double_conversion6VectorIKcEixEi:
  275|   211k|  T& operator[](int index) const {
  276|   211k|    DOUBLE_CONVERSION_ASSERT(0 <= index && index < length_);
  ------------------
  |  |   47|   211k|    assert(condition)
  ------------------
  277|      0|    return start_[index];
  278|   211k|  }
_ZN17double_conversion6VectorIKcE9SubVectorEii:
  258|  1.81k|  Vector<T> SubVector(int from, int to) {
  259|  1.81k|    DOUBLE_CONVERSION_ASSERT(to <= length_);
  ------------------
  |  |   47|  1.81k|    assert(condition)
  ------------------
  260|  1.81k|    DOUBLE_CONVERSION_ASSERT(from < to);
  ------------------
  |  |   47|  1.81k|    assert(condition)
  ------------------
  261|  1.81k|    DOUBLE_CONVERSION_ASSERT(0 <= from);
  ------------------
  |  |   47|  1.81k|    assert(condition)
  ------------------
  262|      0|    return Vector<T>(start() + from, to - from);
  263|  1.81k|  }
_ZNK17double_conversion6VectorIKcE5startEv:
  272|  1.88k|  T* start() const { return start_; }
_ZNK17double_conversion6VectorIKcE6lengthEv:
  266|   157k|  int length() const { return length_; }
_ZN17double_conversion7BitCastImdEET_RKT0_:
  395|  1.34k|Dest BitCast(const Source& source) {
  396|       |  // Compile time assertion: sizeof(Dest) == sizeof(Source)
  397|       |  // A compile error here means your Dest and Source have different sizes.
  398|  1.34k|#if __cplusplus >= 201103L
  399|  1.34k|  static_assert(sizeof(Dest) == sizeof(Source),
  400|  1.34k|                "source and destination size mismatch");
  401|       |#else
  402|       |  DOUBLE_CONVERSION_UNUSED
  403|       |  typedef char VerifySizesAreEqual[sizeof(Dest) == sizeof(Source) ? 1 : -1];
  404|       |#endif
  405|       |
  406|  1.34k|  Dest dest;
  407|  1.34k|  memmove(&dest, &source, sizeof(dest));
  408|  1.34k|  return dest;
  409|  1.34k|}

LLVMFuzzerTestOneInput:
   23|  3.00k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
   24|  3.00k|  StringToDoubleConverter converter(
   25|  3.00k|      StringToDoubleConverter::ALLOW_HEX |
   26|  3.00k|          StringToDoubleConverter::ALLOW_OCTALS |
   27|  3.00k|          StringToDoubleConverter::ALLOW_TRAILING_JUNK |
   28|  3.00k|          StringToDoubleConverter::ALLOW_LEADING_SPACES |
   29|  3.00k|          StringToDoubleConverter::ALLOW_TRAILING_SPACES |
   30|  3.00k|          StringToDoubleConverter::ALLOW_SPACES_AFTER_SIGN |
   31|  3.00k|          StringToDoubleConverter::ALLOW_CASE_INSENSIBILITY |
   32|  3.00k|          StringToDoubleConverter::ALLOW_HEX_FLOATS,
   33|  3.00k|      /*empty_string_value=*/0.0,
   34|  3.00k|      /*junk_string_value=*/0.0, "inf", "nan");
   35|  3.00k|  int num_digits_unused;
   36|  3.00k|  converter.StringToDouble(reinterpret_cast<const char*>(data), size,
   37|  3.00k|                           &num_digits_unused);
   38|  3.00k|  return 0;
   39|  3.00k|}