_ZN17double_conversion6Bignum8RawBigitEi:
   36|  1.18M|Bignum::Chunk& Bignum::RawBigit(const int index) {
   37|  1.18M|  DOUBLE_CONVERSION_ASSERT(static_cast<unsigned>(index) < kBigitCapacity);
  ------------------
  |  |   47|  1.18M|    assert(condition)
  ------------------
  |  Branch (37:3): [True: 1.18M, False: 0]
  ------------------
   38|  1.18M|  return bigits_buffer_[index];
   39|  1.18M|}
_ZNK17double_conversion6Bignum8RawBigitEi:
   42|  20.5k|const Bignum::Chunk& Bignum::RawBigit(const int index) const {
   43|  20.5k|  DOUBLE_CONVERSION_ASSERT(static_cast<unsigned>(index) < kBigitCapacity);
  ------------------
  |  |   47|  20.5k|    assert(condition)
  ------------------
  |  Branch (43:3): [True: 20.5k, False: 0]
  ------------------
   44|  20.5k|  return bigits_buffer_[index];
   45|  20.5k|}
_ZN17double_conversion6Bignum12AssignUInt64Em:
   65|  3.48k|void Bignum::AssignUInt64(uint64_t value) {
   66|  3.48k|  Zero();
   67|  11.4k|  for(int i = 0; value > 0; ++i) {
  ------------------
  |  Branch (67:18): [True: 7.96k, False: 3.48k]
  ------------------
   68|  7.96k|    RawBigit(i) = value & kBigitMask;
   69|  7.96k|    value >>= kBigitSize;
   70|  7.96k|    ++used_bigits_;
   71|  7.96k|  }
   72|  3.48k|}
_ZN17double_conversion6Bignum19AssignDecimalStringENS_6VectorIKcEE:
   97|    759|void Bignum::AssignDecimalString(const Vector<const char> value) {
   98|       |  // 2^64 = 18446744073709551616 > 10^19
   99|    759|  static const int kMaxUint64DecimalDigits = 19;
  100|    759|  Zero();
  101|    759|  int length = value.length();
  102|    759|  unsigned pos = 0;
  103|       |  // Let's just say that each digit needs 4 bits.
  104|  4.48k|  while (length >= kMaxUint64DecimalDigits) {
  ------------------
  |  Branch (104:10): [True: 3.72k, False: 759]
  ------------------
  105|  3.72k|    const uint64_t digits = ReadUInt64(value, pos, kMaxUint64DecimalDigits);
  106|  3.72k|    pos += kMaxUint64DecimalDigits;
  107|  3.72k|    length -= kMaxUint64DecimalDigits;
  108|  3.72k|    MultiplyByPowerOfTen(kMaxUint64DecimalDigits);
  109|  3.72k|    AddUInt64(digits);
  110|  3.72k|  }
  111|    759|  const uint64_t digits = ReadUInt64(value, pos, length);
  112|    759|  MultiplyByPowerOfTen(length);
  113|    759|  AddUInt64(digits);
  114|    759|  Clamp();
  115|    759|}
_ZN17double_conversion6Bignum9AddUInt64Em:
  156|  4.48k|void Bignum::AddUInt64(const uint64_t operand) {
  157|  4.48k|  if (operand == 0) {
  ------------------
  |  Branch (157:7): [True: 1.76k, False: 2.72k]
  ------------------
  158|  1.76k|    return;
  159|  1.76k|  }
  160|  2.72k|  Bignum other;
  161|  2.72k|  other.AssignUInt64(operand);
  162|  2.72k|  AddBignum(other);
  163|  2.72k|}
_ZN17double_conversion6Bignum9AddBignumERKS0_:
  166|  2.72k|void Bignum::AddBignum(const Bignum& other) {
  167|  2.72k|  DOUBLE_CONVERSION_ASSERT(IsClamped());
  ------------------
  |  |   47|  2.72k|    assert(condition)
  ------------------
  |  Branch (167:3): [True: 2.72k, False: 0]
  ------------------
  168|  2.72k|  DOUBLE_CONVERSION_ASSERT(other.IsClamped());
  ------------------
  |  |   47|  2.72k|    assert(condition)
  ------------------
  |  Branch (168:3): [True: 2.72k, False: 0]
  ------------------
  169|       |
  170|       |  // If this has a greater exponent than other append zero-bigits to this.
  171|       |  // After this call exponent_ <= other.exponent_.
  172|  2.72k|  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.72k|  EnsureCapacity(1 + (std::max)(BigitLength(), other.BigitLength()) - exponent_);
  187|  2.72k|  Chunk carry = 0;
  188|  2.72k|  int bigit_pos = other.exponent_ - exponent_;
  189|  2.72k|  DOUBLE_CONVERSION_ASSERT(bigit_pos >= 0);
  ------------------
  |  |   47|  2.72k|    assert(condition)
  ------------------
  |  Branch (189:3): [True: 2.72k, False: 0]
  ------------------
  190|  2.72k|  for (int i = used_bigits_; i < bigit_pos; ++i) {
  ------------------
  |  Branch (190:30): [True: 0, False: 2.72k]
  ------------------
  191|      0|    RawBigit(i) = 0;
  192|      0|  }
  193|  9.19k|  for (int i = 0; i < other.used_bigits_; ++i) {
  ------------------
  |  Branch (193:19): [True: 6.47k, False: 2.72k]
  ------------------
  194|  6.47k|    const Chunk my = (bigit_pos < used_bigits_) ? RawBigit(bigit_pos) : 0;
  ------------------
  |  Branch (194:22): [True: 4.75k, False: 1.72k]
  ------------------
  195|  6.47k|    const Chunk sum = my + other.RawBigit(i) + carry;
  196|  6.47k|    RawBigit(bigit_pos) = sum & kBigitMask;
  197|  6.47k|    carry = sum >> kBigitSize;
  198|  6.47k|    ++bigit_pos;
  199|  6.47k|  }
  200|  3.15k|  while (carry != 0) {
  ------------------
  |  Branch (200:10): [True: 436, False: 2.72k]
  ------------------
  201|    436|    const Chunk my = (bigit_pos < used_bigits_) ? RawBigit(bigit_pos) : 0;
  ------------------
  |  Branch (201:22): [True: 436, False: 0]
  ------------------
  202|    436|    const Chunk sum = my + carry;
  203|    436|    RawBigit(bigit_pos) = sum & kBigitMask;
  204|    436|    carry = sum >> kBigitSize;
  205|    436|    ++bigit_pos;
  206|    436|  }
  207|  2.72k|  used_bigits_ = static_cast<int16_t>(std::max(bigit_pos, static_cast<int>(used_bigits_)));
  208|       |  DOUBLE_CONVERSION_ASSERT(IsClamped());
  ------------------
  |  |   47|  2.72k|    assert(condition)
  ------------------
  |  Branch (208:3): [True: 2.72k, False: 0]
  ------------------
  209|  2.72k|}
_ZN17double_conversion6Bignum9ShiftLeftEi:
  239|  4.90k|void Bignum::ShiftLeft(const int shift_amount) {
  240|  4.90k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (240:7): [True: 0, False: 4.90k]
  ------------------
  241|      0|    return;
  242|      0|  }
  243|  4.90k|  exponent_ += static_cast<int16_t>(shift_amount / kBigitSize);
  244|  4.90k|  const int local_shift = shift_amount % kBigitSize;
  245|  4.90k|  EnsureCapacity(used_bigits_ + 1);
  246|  4.90k|  BigitsShiftLeft(local_shift);
  247|  4.90k|}
_ZN17double_conversion6Bignum16MultiplyByUInt32Ej:
  250|  7.76k|void Bignum::MultiplyByUInt32(const uint32_t factor) {
  251|  7.76k|  if (factor == 1) {
  ------------------
  |  Branch (251:7): [True: 0, False: 7.76k]
  ------------------
  252|      0|    return;
  253|      0|  }
  254|  7.76k|  if (factor == 0) {
  ------------------
  |  Branch (254:7): [True: 0, False: 7.76k]
  ------------------
  255|      0|    Zero();
  256|      0|    return;
  257|      0|  }
  258|  7.76k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (258:7): [True: 0, False: 7.76k]
  ------------------
  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|  7.76k|  DOUBLE_CONVERSION_ASSERT(kDoubleChunkSize >= kBigitSize + 32 + 1);
  ------------------
  |  |   47|  7.76k|    assert(condition)
  ------------------
  |  Branch (263:3): [True: 7.76k, Folded]
  ------------------
  264|  7.76k|  DoubleChunk carry = 0;
  265|   242k|  for (int i = 0; i < used_bigits_; ++i) {
  ------------------
  |  Branch (265:19): [True: 234k, False: 7.76k]
  ------------------
  266|   234k|    const DoubleChunk product = static_cast<DoubleChunk>(factor) * RawBigit(i) + carry;
  267|   234k|    RawBigit(i) = static_cast<Chunk>(product & kBigitMask);
  268|   234k|    carry = (product >> kBigitSize);
  269|   234k|  }
  270|  13.7k|  while (carry != 0) {
  ------------------
  |  Branch (270:10): [True: 6.00k, False: 7.76k]
  ------------------
  271|  6.00k|    EnsureCapacity(used_bigits_ + 1);
  272|  6.00k|    RawBigit(used_bigits_) = carry & kBigitMask;
  273|  6.00k|    used_bigits_++;
  274|  6.00k|    carry >>= kBigitSize;
  275|  6.00k|  }
  276|  7.76k|}
_ZN17double_conversion6Bignum16MultiplyByUInt64Em:
  279|  4.48k|void Bignum::MultiplyByUInt64(const uint64_t factor) {
  280|  4.48k|  if (factor == 1) {
  ------------------
  |  Branch (280:7): [True: 0, False: 4.48k]
  ------------------
  281|      0|    return;
  282|      0|  }
  283|  4.48k|  if (factor == 0) {
  ------------------
  |  Branch (283:7): [True: 0, False: 4.48k]
  ------------------
  284|      0|    Zero();
  285|      0|    return;
  286|      0|  }
  287|  4.48k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (287:7): [True: 0, False: 4.48k]
  ------------------
  288|      0|    return;
  289|      0|  }
  290|  4.48k|  DOUBLE_CONVERSION_ASSERT(kBigitSize < 32);
  ------------------
  |  |   47|  4.48k|    assert(condition)
  ------------------
  |  Branch (290:3): [True: 4.48k, Folded]
  ------------------
  291|  4.48k|  uint64_t carry = 0;
  292|  4.48k|  const uint64_t low = factor & 0xFFFFFFFF;
  293|  4.48k|  const uint64_t high = factor >> 32;
  294|  92.7k|  for (int i = 0; i < used_bigits_; ++i) {
  ------------------
  |  Branch (294:19): [True: 88.2k, False: 4.48k]
  ------------------
  295|  88.2k|    const uint64_t product_low = low * RawBigit(i);
  296|  88.2k|    const uint64_t product_high = high * RawBigit(i);
  297|  88.2k|    const uint64_t tmp = (carry & kBigitMask) + product_low;
  298|  88.2k|    RawBigit(i) = tmp & kBigitMask;
  299|  88.2k|    carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
  300|  88.2k|        (product_high << (32 - kBigitSize));
  301|  88.2k|  }
  302|  14.5k|  while (carry != 0) {
  ------------------
  |  Branch (302:10): [True: 10.1k, False: 4.48k]
  ------------------
  303|  10.1k|    EnsureCapacity(used_bigits_ + 1);
  304|  10.1k|    RawBigit(used_bigits_) = carry & kBigitMask;
  305|  10.1k|    used_bigits_++;
  306|  10.1k|    carry >>= kBigitSize;
  307|  10.1k|  }
  308|  4.48k|}
_ZN17double_conversion6Bignum20MultiplyByPowerOfTenEi:
  311|  5.24k|void Bignum::MultiplyByPowerOfTen(const int exponent) {
  312|  5.24k|  static const uint64_t kFive27 = DOUBLE_CONVERSION_UINT64_2PART_C(0x6765c793, fa10079d);
  ------------------
  |  |  195|  5.24k|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  313|  5.24k|  static const uint16_t kFive1 = 5;
  314|  5.24k|  static const uint16_t kFive2 = kFive1 * 5;
  315|  5.24k|  static const uint16_t kFive3 = kFive2 * 5;
  316|  5.24k|  static const uint16_t kFive4 = kFive3 * 5;
  317|  5.24k|  static const uint16_t kFive5 = kFive4 * 5;
  318|  5.24k|  static const uint16_t kFive6 = kFive5 * 5;
  319|  5.24k|  static const uint32_t kFive7 = kFive6 * 5;
  320|  5.24k|  static const uint32_t kFive8 = kFive7 * 5;
  321|  5.24k|  static const uint32_t kFive9 = kFive8 * 5;
  322|  5.24k|  static const uint32_t kFive10 = kFive9 * 5;
  323|  5.24k|  static const uint32_t kFive11 = kFive10 * 5;
  324|  5.24k|  static const uint32_t kFive12 = kFive11 * 5;
  325|  5.24k|  static const uint32_t kFive13 = kFive12 * 5;
  326|  5.24k|  static const uint32_t kFive1_to_12[] =
  327|  5.24k|      { kFive1, kFive2, kFive3, kFive4, kFive5, kFive6,
  328|  5.24k|        kFive7, kFive8, kFive9, kFive10, kFive11, kFive12 };
  329|       |
  330|  5.24k|  DOUBLE_CONVERSION_ASSERT(exponent >= 0);
  ------------------
  |  |   47|  5.24k|    assert(condition)
  ------------------
  |  Branch (330:3): [True: 5.24k, False: 0]
  ------------------
  331|       |
  332|  5.24k|  if (exponent == 0) {
  ------------------
  |  Branch (332:7): [True: 334, False: 4.90k]
  ------------------
  333|    334|    return;
  334|    334|  }
  335|  4.90k|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (335:7): [True: 759, False: 4.14k]
  ------------------
  336|    759|    return;
  337|    759|  }
  338|       |  // We shift by exponent at the end just before returning.
  339|  4.14k|  int remaining_exponent = exponent;
  340|  8.63k|  while (remaining_exponent >= 27) {
  ------------------
  |  Branch (340:10): [True: 4.48k, False: 4.14k]
  ------------------
  341|  4.48k|    MultiplyByUInt64(kFive27);
  342|  4.48k|    remaining_exponent -= 27;
  343|  4.48k|  }
  344|  7.91k|  while (remaining_exponent >= 13) {
  ------------------
  |  Branch (344:10): [True: 3.76k, False: 4.14k]
  ------------------
  345|  3.76k|    MultiplyByUInt32(kFive13);
  346|  3.76k|    remaining_exponent -= 13;
  347|  3.76k|  }
  348|  4.14k|  if (remaining_exponent > 0) {
  ------------------
  |  Branch (348:7): [True: 4.00k, False: 143]
  ------------------
  349|  4.00k|    MultiplyByUInt32(kFive1_to_12[remaining_exponent - 1]);
  350|  4.00k|  }
  351|  4.14k|  ShiftLeft(exponent);
  352|  4.14k|}
_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: 266, False: 5.17k]
  ------------------
  638|    266|    return 0;
  639|    266|  }
  640|  5.17k|  return RawBigit(index - exponent_);
  641|  5.44k|}
_ZN17double_conversion6Bignum7CompareERKS0_S2_:
  644|    759|int Bignum::Compare(const Bignum& a, const Bignum& b) {
  645|    759|  DOUBLE_CONVERSION_ASSERT(a.IsClamped());
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (645:3): [True: 759, False: 0]
  ------------------
  646|    759|  DOUBLE_CONVERSION_ASSERT(b.IsClamped());
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (646:3): [True: 759, False: 0]
  ------------------
  647|    759|  const int bigit_length_a = a.BigitLength();
  648|    759|  const int bigit_length_b = b.BigitLength();
  649|    759|  if (bigit_length_a < bigit_length_b) {
  ------------------
  |  Branch (649:7): [True: 2, False: 757]
  ------------------
  650|      2|    return -1;
  651|      2|  }
  652|    757|  if (bigit_length_a > bigit_length_b) {
  ------------------
  |  Branch (652:7): [True: 0, False: 757]
  ------------------
  653|      0|    return +1;
  654|      0|  }
  655|  2.82k|  for (int i = bigit_length_a - 1; i >= (std::min)(a.exponent_, b.exponent_); --i) {
  ------------------
  |  Branch (655:36): [True: 2.72k, False: 101]
  ------------------
  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: 225, False: 2.49k]
  ------------------
  659|    225|      return -1;
  660|    225|    }
  661|  2.49k|    if (bigit_a > bigit_b) {
  ------------------
  |  Branch (661:9): [True: 431, False: 2.06k]
  ------------------
  662|    431|      return +1;
  663|    431|    }
  664|       |    // Otherwise they are equal up to this digit. Try the next digit.
  665|  2.49k|  }
  666|    101|  return 0;
  667|    757|}
_ZN17double_conversion6Bignum5ClampEv:
  715|    759|void Bignum::Clamp() {
  716|    759|  while (used_bigits_ > 0 && RawBigit(used_bigits_ - 1) == 0) {
  ------------------
  |  Branch (716:10): [True: 759, False: 0]
  |  Branch (716:30): [True: 0, False: 759]
  ------------------
  717|      0|    used_bigits_--;
  718|      0|  }
  719|    759|  if (used_bigits_ == 0) {
  ------------------
  |  Branch (719:7): [True: 0, False: 759]
  ------------------
  720|       |    // Zero.
  721|      0|    exponent_ = 0;
  722|      0|  }
  723|    759|}
_ZN17double_conversion6Bignum5AlignERKS0_:
  726|  2.72k|void Bignum::Align(const Bignum& other) {
  727|  2.72k|  if (exponent_ > other.exponent_) {
  ------------------
  |  Branch (727:7): [True: 0, False: 2.72k]
  ------------------
  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)
  ------------------
  |  Branch (745:5): [True: 0, False: 0]
  ------------------
  746|      0|    DOUBLE_CONVERSION_ASSERT(exponent_ >= 0);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  |  Branch (746:5): [True: 0, False: 0]
  ------------------
  747|      0|  }
  748|  2.72k|}
_ZN17double_conversion6Bignum15BigitsShiftLeftEi:
  751|  4.90k|void Bignum::BigitsShiftLeft(const int shift_amount) {
  752|  4.90k|  DOUBLE_CONVERSION_ASSERT(shift_amount < kBigitSize);
  ------------------
  |  |   47|  4.90k|    assert(condition)
  ------------------
  |  Branch (752:3): [True: 4.90k, False: 0]
  ------------------
  753|  4.90k|  DOUBLE_CONVERSION_ASSERT(shift_amount >= 0);
  ------------------
  |  |   47|  4.90k|    assert(condition)
  ------------------
  |  Branch (753:3): [True: 4.90k, False: 0]
  ------------------
  754|  4.90k|  Chunk carry = 0;
  755|   140k|  for (int i = 0; i < used_bigits_; ++i) {
  ------------------
  |  Branch (755:19): [True: 135k, False: 4.90k]
  ------------------
  756|   135k|    const Chunk new_carry = RawBigit(i) >> (kBigitSize - shift_amount);
  757|   135k|    RawBigit(i) = ((RawBigit(i) << shift_amount) + carry) & kBigitMask;
  758|   135k|    carry = new_carry;
  759|   135k|  }
  760|  4.90k|  if (carry != 0) {
  ------------------
  |  Branch (760:7): [True: 3.08k, False: 1.82k]
  ------------------
  761|  3.08k|    RawBigit(used_bigits_) = carry;
  762|  3.08k|    used_bigits_++;
  763|  3.08k|  }
  764|  4.90k|}
bignum.cc:_ZN17double_conversionL10ReadUInt64ENS_6VectorIKcEEii:
   86|  4.48k|                           const int digits_to_read) {
   87|  4.48k|  uint64_t result = 0;
   88|  81.4k|  for (int i = from; i < from + digits_to_read; ++i) {
  ------------------
  |  Branch (88:22): [True: 76.9k, False: 4.48k]
  ------------------
   89|  76.9k|    const int digit = buffer[i] - '0';
   90|  76.9k|    DOUBLE_CONVERSION_ASSERT(0 <= digit && digit <= 9);
  ------------------
  |  |   47|  76.9k|    assert(condition)
  ------------------
  |  Branch (90:5): [True: 76.9k, False: 0]
  |  Branch (90:5): [True: 76.9k, False: 0]
  |  Branch (90:5): [True: 76.9k, False: 0]
  ------------------
   91|  76.9k|    result = result * 10 + digit;
   92|  76.9k|  }
   93|  4.48k|  return result;
   94|  4.48k|}

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

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

_ZN17double_conversion5DiyFpC2Emi:
   46|  6.47k|  DiyFp(const uint64_t significand, const int32_t exponent) : f_(significand), e_(exponent) {}
_ZNK17double_conversion5DiyFp1fEv:
  122|  5.58k|  uint64_t f() const { return f_; }
_ZNK17double_conversion5DiyFp1eEv:
  123|  11.3k|  int32_t e() const { return e_; }
_ZN17double_conversion5DiyFpC2Ev:
   45|  2.63k|  DiyFp() : f_(0), e_(0) {}
_ZN17double_conversion5DiyFp8MultiplyERKS0_:
   68|  2.52k|  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.52k|    const uint64_t kM32 = 0xFFFFFFFFU;
   74|  2.52k|    const uint64_t a = f_ >> 32;
   75|  2.52k|    const uint64_t b = f_ & kM32;
   76|  2.52k|    const uint64_t c = other.f_ >> 32;
   77|  2.52k|    const uint64_t d = other.f_ & kM32;
   78|  2.52k|    const uint64_t ac = a * c;
   79|  2.52k|    const uint64_t bc = b * c;
   80|  2.52k|    const uint64_t ad = a * d;
   81|  2.52k|    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.52k|    const uint64_t tmp = (bd >> 32) + (ad & kM32) + (bc & kM32) + (1U << 31);
   85|  2.52k|    e_ += other.e_ + 64;
   86|  2.52k|    f_ = ac + (ad >> 32) + (bc >> 32) + (tmp >> 32);
   87|  2.52k|  }
_ZN17double_conversion5DiyFp9NormalizeEv:
   96|  2.63k|  void Normalize() {
   97|  2.63k|    DOUBLE_CONVERSION_ASSERT(f_ != 0);
  ------------------
  |  |   47|  2.63k|    assert(condition)
  ------------------
  |  Branch (97:5): [True: 2.63k, False: 0]
  ------------------
   98|  2.63k|    uint64_t significand = f_;
   99|  2.63k|    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.63k|    const uint64_t k10MSBits = DOUBLE_CONVERSION_UINT64_2PART_C(0xFFC00000, 00000000);
  ------------------
  |  |  195|  2.63k|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  104|  5.52k|    while ((significand & k10MSBits) == 0) {
  ------------------
  |  Branch (104:12): [True: 2.89k, False: 2.63k]
  ------------------
  105|  2.89k|      significand <<= 10;
  106|  2.89k|      exponent -= 10;
  107|  2.89k|    }
  108|  6.95k|    while ((significand & kUint64MSB) == 0) {
  ------------------
  |  Branch (108:12): [True: 4.32k, False: 2.63k]
  ------------------
  109|  4.32k|      significand <<= 1;
  110|  4.32k|      exponent--;
  111|  4.32k|    }
  112|  2.63k|    f_ = significand;
  113|  2.63k|    e_ = exponent;
  114|  2.63k|  }
_ZN17double_conversion5DiyFp5set_fEm:
  125|    317|  void set_f(uint64_t new_value) { f_ = new_value; }
_ZN17double_conversion5DiyFp5set_eEi:
  126|     54|  void set_e(int32_t new_value) { e_ = new_value; }

_ZN17double_conversion6Double8InfinityEv:
  236|    883|  static double Infinity() {
  237|    883|    return Double(kInfinity).value();
  238|    883|  }
_ZN17double_conversion6DoubleC2Em:
   56|  1.37k|  explicit Double(uint64_t d64) : d64_(d64) {}
_ZNK17double_conversion6Double5valueEv:
  220|  3.25k|  double value() const { return uint64_to_double(d64_); }
string-to-double.cc:_ZN17double_conversionL16uint64_to_doubleEm:
   37|    567|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.87k|    : d64_(DiyFpToUint64(diy_fp)) {}
_ZN17double_conversion6Double13DiyFpToUint64ENS_5DiyFpE:
  256|  1.87k|  static uint64_t DiyFpToUint64(DiyFp diy_fp) {
  257|  1.87k|    uint64_t significand = diy_fp.f();
  258|  1.87k|    int exponent = diy_fp.e();
  259|  1.89k|    while (significand > kHiddenBit + kSignificandMask) {
  ------------------
  |  Branch (259:12): [True: 21, False: 1.87k]
  ------------------
  260|     21|      significand >>= 1;
  261|     21|      exponent++;
  262|     21|    }
  263|  1.87k|    if (exponent >= kMaxExponent) {
  ------------------
  |  Branch (263:9): [True: 71, False: 1.80k]
  ------------------
  264|     71|      return kInfinity;
  265|     71|    }
  266|  1.80k|    if (exponent < kDenormalExponent) {
  ------------------
  |  Branch (266:9): [True: 65, False: 1.74k]
  ------------------
  267|     65|      return 0;
  268|     65|    }
  269|  7.70k|    while (exponent > kDenormalExponent && (significand & kHiddenBit) == 0) {
  ------------------
  |  Branch (269:12): [True: 7.55k, False: 147]
  |  Branch (269:44): [True: 5.95k, False: 1.59k]
  ------------------
  270|  5.95k|      significand <<= 1;
  271|  5.95k|      exponent--;
  272|  5.95k|    }
  273|  1.74k|    uint64_t biased_exponent;
  274|  1.74k|    if (exponent == kDenormalExponent && (significand & kHiddenBit) == 0) {
  ------------------
  |  Branch (274:9): [True: 147, False: 1.59k]
  |  Branch (274:42): [True: 145, False: 2]
  ------------------
  275|    145|      biased_exponent = 0;
  276|  1.59k|    } else {
  277|  1.59k|      biased_exponent = static_cast<uint64_t>(exponent + kExponentBias);
  278|  1.59k|    }
  279|  1.74k|    return (significand & kSignificandMask) |
  280|  1.74k|        (biased_exponent << kPhysicalSignificandSize);
  281|  1.80k|  }
_ZN17double_conversion6DoubleC2Ed:
   55|  1.34k|  explicit Double(double d) : d64_(double_to_uint64(d)) {}
_ZNK17double_conversion6Double8AsUint64Ev:
   86|  4.89k|  uint64_t AsUint64() const {
   87|  4.89k|    return d64_;
   88|  4.89k|  }
_ZNK17double_conversion6Double10NextDoubleEv:
   91|    489|  double NextDouble() const {
   92|    489|    if (d64_ == kInfinity) return Double(kInfinity).value();
  ------------------
  |  Branch (92:9): [True: 0, False: 489]
  ------------------
   93|    489|    if (Sign() < 0 && Significand() == 0) {
  ------------------
  |  Branch (93:9): [True: 0, False: 489]
  |  Branch (93:23): [True: 0, False: 0]
  ------------------
   94|       |      // -0.0
   95|      0|      return 0.0;
   96|      0|    }
   97|    489|    if (Sign() < 0) {
  ------------------
  |  Branch (97:9): [True: 0, False: 489]
  ------------------
   98|      0|      return Double(d64_ - 1).value();
   99|    489|    } else {
  100|    489|      return Double(d64_ + 1).value();
  101|    489|    }
  102|    489|  }
_ZNK17double_conversion6Double8ExponentEv:
  114|    759|  int Exponent() const {
  115|    759|    if (IsDenormal()) return kDenormalExponent;
  ------------------
  |  Branch (115:9): [True: 77, False: 682]
  ------------------
  116|       |
  117|    682|    uint64_t d64 = AsUint64();
  118|    682|    int biased_e =
  119|    682|        static_cast<int>((d64 & kExponentMask) >> kPhysicalSignificandSize);
  120|    682|    return biased_e - kExponentBias;
  121|    759|  }
_ZNK17double_conversion6Double11SignificandEv:
  123|    860|  uint64_t Significand() const {
  124|    860|    uint64_t d64 = AsUint64();
  125|    860|    uint64_t significand = d64 & kSignificandMask;
  126|    860|    if (!IsDenormal()) {
  ------------------
  |  Branch (126:9): [True: 783, False: 77]
  ------------------
  127|    783|      return significand + kHiddenBit;
  128|    783|    } else {
  129|     77|      return significand;
  130|     77|    }
  131|    860|  }
_ZNK17double_conversion6Double10IsDenormalEv:
  134|  1.61k|  bool IsDenormal() const {
  135|  1.61k|    uint64_t d64 = AsUint64();
  136|  1.61k|    return (d64 & kExponentMask) == 0;
  137|  1.61k|  }
_ZNK17double_conversion6Double4SignEv:
  175|  1.73k|  int Sign() const {
  176|  1.73k|    uint64_t d64 = AsUint64();
  177|  1.73k|    return (d64 & kSignMask) == 0? 1: -1;
  ------------------
  |  Branch (177:12): [True: 1.73k, False: 0]
  ------------------
  178|  1.73k|  }
_ZNK17double_conversion6Double13UpperBoundaryEv:
  182|    759|  DiyFp UpperBoundary() const {
  183|    759|    DOUBLE_CONVERSION_ASSERT(Sign() > 0);
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (183:5): [True: 759, False: 0]
  ------------------
  184|    759|    return DiyFp(Significand() * 2 + 1, Exponent() - 1);
  185|    759|  }
_ZN17double_conversion6Double34SignificandSizeForOrderOfMagnitudeEi:
  228|  1.31k|  static int SignificandSizeForOrderOfMagnitude(int order) {
  229|  1.31k|    if (order >= (kDenormalExponent + kSignificandSize)) {
  ------------------
  |  Branch (229:9): [True: 1.15k, False: 161]
  ------------------
  230|  1.15k|      return kSignificandSize;
  231|  1.15k|    }
  232|    161|    if (order <= kDenormalExponent) return 0;
  ------------------
  |  Branch (232:9): [True: 33, False: 128]
  ------------------
  233|    128|    return order - kDenormalExponent;
  234|    161|  }
strtod.cc:_ZN17double_conversionL16uint64_to_doubleEm:
   37|  2.68k|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:
  758|  3.02k|    int* processed_characters_count) const {
  759|  3.02k|  return StringToIeee(buffer, length, true, processed_characters_count);
  760|  3.02k|}
_ZNK17double_conversion23StringToDoubleConverter12StringToIeeeIPKcEEdT_ibPi:
  429|  3.02k|    int* processed_characters_count) const {
  430|  3.02k|  Iterator current = input;
  431|  3.02k|  Iterator end = input + length;
  432|       |
  433|  3.02k|  *processed_characters_count = 0;
  434|       |
  435|  3.02k|  const bool allow_trailing_junk = (flags_ & ALLOW_TRAILING_JUNK) != 0;
  436|  3.02k|  const bool allow_leading_spaces = (flags_ & ALLOW_LEADING_SPACES) != 0;
  437|  3.02k|  const bool allow_trailing_spaces = (flags_ & ALLOW_TRAILING_SPACES) != 0;
  438|  3.02k|  const bool allow_spaces_after_sign = (flags_ & ALLOW_SPACES_AFTER_SIGN) != 0;
  439|  3.02k|  const bool allow_case_insensitivity = (flags_ & ALLOW_CASE_INSENSITIVITY) != 0;
  440|       |
  441|       |  // To make sure that iterator dereferencing is valid the following
  442|       |  // convention is used:
  443|       |  // 1. Each '++current' statement is followed by check for equality to 'end'.
  444|       |  // 2. If AdvanceToNonspace returned false then current == end.
  445|       |  // 3. If 'current' becomes equal to 'end' the function returns or goes to
  446|       |  // 'parsing_done'.
  447|       |  // 4. 'current' is not dereferenced after the 'parsing_done' label.
  448|       |  // 5. Code before 'parsing_done' may rely on 'current != end'.
  449|  3.02k|  if (current == end) return empty_string_value_;
  ------------------
  |  Branch (449:7): [True: 0, False: 3.02k]
  ------------------
  450|       |
  451|  3.02k|  if (allow_leading_spaces || allow_trailing_spaces) {
  ------------------
  |  Branch (451:7): [True: 3.02k, False: 0]
  |  Branch (451:31): [True: 0, False: 0]
  ------------------
  452|  3.02k|    if (!AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (452:9): [True: 12, False: 3.01k]
  ------------------
  453|     12|      *processed_characters_count = static_cast<int>(current - input);
  454|     12|      return empty_string_value_;
  455|     12|    }
  456|  3.01k|    if (!allow_leading_spaces && (input != current)) {
  ------------------
  |  Branch (456:9): [True: 0, False: 3.01k]
  |  Branch (456:34): [True: 0, False: 0]
  ------------------
  457|       |      // No leading spaces allowed, but AdvanceToNonspace moved forward.
  458|      0|      return junk_string_value_;
  459|      0|    }
  460|  3.01k|  }
  461|       |
  462|       |  // Exponent will be adjusted if insignificant digits of the integer part
  463|       |  // or insignificant leading zeros of the fractional part are dropped.
  464|  3.01k|  int exponent = 0;
  465|  3.01k|  int significant_digits = 0;
  466|  3.01k|  int insignificant_digits = 0;
  467|  3.01k|  bool nonzero_digit_dropped = false;
  468|       |
  469|  3.01k|  bool sign = false;
  470|       |
  471|  3.01k|  if (*current == '+' || *current == '-') {
  ------------------
  |  Branch (471:7): [True: 11, False: 3.00k]
  |  Branch (471:26): [True: 132, False: 2.87k]
  ------------------
  472|    143|    sign = (*current == '-');
  473|    143|    ++current;
  474|    143|    Iterator next_non_space = current;
  475|       |    // Skip following spaces (if allowed).
  476|    143|    if (!AdvanceToNonspace(&next_non_space, end)) return junk_string_value_;
  ------------------
  |  Branch (476:9): [True: 15, False: 128]
  ------------------
  477|    128|    if (!allow_spaces_after_sign && (current != next_non_space)) {
  ------------------
  |  Branch (477:9): [True: 0, False: 128]
  |  Branch (477:37): [True: 0, False: 0]
  ------------------
  478|      0|      return junk_string_value_;
  479|      0|    }
  480|    128|    current = next_non_space;
  481|    128|  }
  482|       |
  483|  2.99k|  if (infinity_symbol_ != DOUBLE_CONVERSION_NULLPTR) {
  ------------------
  |  |   39|  2.99k|#define DOUBLE_CONVERSION_NULLPTR nullptr
  ------------------
  |  Branch (483:7): [True: 2.99k, False: 0]
  ------------------
  484|  2.99k|    if (ConsumeFirstCharacter(*current, infinity_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (484:9): [True: 5, False: 2.99k]
  ------------------
  485|      5|      if (!ConsumeSubString(&current, end, infinity_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (485:11): [True: 3, False: 2]
  ------------------
  486|      3|        return junk_string_value_;
  487|      3|      }
  488|       |
  489|      2|      if (!(allow_trailing_spaces || allow_trailing_junk) && (current != end)) {
  ------------------
  |  Branch (489:13): [True: 2, False: 0]
  |  Branch (489:38): [True: 0, False: 0]
  |  Branch (489:62): [True: 0, False: 0]
  ------------------
  490|      0|        return junk_string_value_;
  491|      0|      }
  492|      2|      if (!allow_trailing_junk && AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (492:11): [True: 0, False: 2]
  |  Branch (492:35): [True: 0, False: 0]
  ------------------
  493|      0|        return junk_string_value_;
  494|      0|      }
  495|       |
  496|      2|      *processed_characters_count = static_cast<int>(current - input);
  497|      2|      return sign ? -Double::Infinity() : Double::Infinity();
  ------------------
  |  Branch (497:14): [True: 1, False: 1]
  ------------------
  498|      2|    }
  499|  2.99k|  }
  500|       |
  501|  2.99k|  if (nan_symbol_ != DOUBLE_CONVERSION_NULLPTR) {
  ------------------
  |  |   39|  2.99k|#define DOUBLE_CONVERSION_NULLPTR nullptr
  ------------------
  |  Branch (501:7): [True: 2.99k, False: 0]
  ------------------
  502|  2.99k|    if (ConsumeFirstCharacter(*current, nan_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (502:9): [True: 4, False: 2.99k]
  ------------------
  503|      4|      if (!ConsumeSubString(&current, end, nan_symbol_, allow_case_insensitivity)) {
  ------------------
  |  Branch (503:11): [True: 2, False: 2]
  ------------------
  504|      2|        return junk_string_value_;
  505|      2|      }
  506|       |
  507|      2|      if (!(allow_trailing_spaces || allow_trailing_junk) && (current != end)) {
  ------------------
  |  Branch (507:13): [True: 2, False: 0]
  |  Branch (507:38): [True: 0, False: 0]
  |  Branch (507:62): [True: 0, False: 0]
  ------------------
  508|      0|        return junk_string_value_;
  509|      0|      }
  510|      2|      if (!allow_trailing_junk && AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (510:11): [True: 0, False: 2]
  |  Branch (510:35): [True: 0, False: 0]
  ------------------
  511|      0|        return junk_string_value_;
  512|      0|      }
  513|       |
  514|      2|      *processed_characters_count = static_cast<int>(current - input);
  515|      2|      return sign ? -Double::NaN() : Double::NaN();
  ------------------
  |  Branch (515:14): [True: 1, False: 1]
  ------------------
  516|      2|    }
  517|  2.99k|  }
  518|       |
  519|  2.99k|  bool leading_zero = false;
  520|  2.99k|  if (*current == '0') {
  ------------------
  |  Branch (520:7): [True: 1.11k, False: 1.88k]
  ------------------
  521|  1.11k|    if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (521:9): [True: 3, False: 1.10k]
  ------------------
  522|      3|      *processed_characters_count = static_cast<int>(current - input);
  523|      3|      return SignedZero(sign);
  524|      3|    }
  525|       |
  526|  1.10k|    leading_zero = true;
  527|       |
  528|       |    // It could be hexadecimal value.
  529|  1.10k|    if (((flags_ & ALLOW_HEX) || (flags_ & ALLOW_HEX_FLOATS)) &&
  ------------------
  |  Branch (529:10): [True: 1.10k, False: 0]
  |  Branch (529:34): [True: 0, False: 0]
  ------------------
  530|  1.10k|        (*current == 'x' || *current == 'X')) {
  ------------------
  |  Branch (530:10): [True: 321, False: 786]
  |  Branch (530:29): [True: 447, False: 339]
  ------------------
  531|    768|      ++current;
  532|       |
  533|    768|      if (current == end) return junk_string_value_;  // "0x"
  ------------------
  |  Branch (533:11): [True: 2, False: 766]
  ------------------
  534|       |
  535|    766|      bool parse_as_hex_float = (flags_ & ALLOW_HEX_FLOATS) &&
  ------------------
  |  Branch (535:33): [True: 766, False: 0]
  ------------------
  536|    766|                IsHexFloatString(current, end, separator_, allow_trailing_junk);
  ------------------
  |  Branch (536:17): [True: 306, False: 460]
  ------------------
  537|       |
  538|    766|      if (!parse_as_hex_float && !isDigit(*current, 16)) {
  ------------------
  |  Branch (538:11): [True: 460, False: 306]
  |  Branch (538:34): [True: 87, False: 373]
  ------------------
  539|     87|        return junk_string_value_;
  540|     87|      }
  541|       |
  542|    679|      bool result_is_junk;
  543|    679|      double result = RadixStringToIeee<4>(&current,
  544|    679|                                           end,
  545|    679|                                           sign,
  546|    679|                                           separator_,
  547|    679|                                           parse_as_hex_float,
  548|    679|                                           allow_trailing_junk,
  549|    679|                                           junk_string_value_,
  550|    679|                                           read_as_double,
  551|    679|                                           &result_is_junk);
  552|    679|      if (!result_is_junk) {
  ------------------
  |  Branch (552:11): [True: 679, False: 0]
  ------------------
  553|    679|        if (allow_trailing_spaces) AdvanceToNonspace(&current, end);
  ------------------
  |  Branch (553:13): [True: 679, False: 0]
  ------------------
  554|    679|        *processed_characters_count = static_cast<int>(current - input);
  555|    679|      }
  556|    679|      return result;
  557|    766|    }
  558|       |
  559|       |    // Ignore leading zeros in the integer part.
  560|    720|    while (*current == '0') {
  ------------------
  |  Branch (560:12): [True: 389, False: 331]
  ------------------
  561|    389|      if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (561:11): [True: 8, False: 381]
  ------------------
  562|      8|        *processed_characters_count = static_cast<int>(current - input);
  563|      8|        return SignedZero(sign);
  564|      8|      }
  565|    389|    }
  566|    339|  }
  567|       |
  568|  2.21k|  bool octal = leading_zero && (flags_ & ALLOW_OCTALS) != 0;
  ------------------
  |  Branch (568:16): [True: 331, False: 1.88k]
  |  Branch (568:32): [True: 331, False: 0]
  ------------------
  569|       |
  570|       |  // The longest form of simplified number is: "-<significant digits>.1eXXX\0".
  571|  2.21k|  const int kBufferSize = kMaxSignificantDigits + 10;
  572|  2.21k|  DOUBLE_CONVERSION_STACK_UNINITIALIZED char
  ------------------
  |  |  104|  2.21k|#define DOUBLE_CONVERSION_STACK_UNINITIALIZED __attribute__((uninitialized))
  ------------------
  573|  2.21k|      buffer[kBufferSize];  // NOLINT: size is known at compile time.
  574|  2.21k|  int buffer_pos = 0;
  575|       |
  576|       |  // Copy significant digits of the integer part (if any) to the buffer.
  577|   594k|  while (*current >= '0' && *current <= '9') {
  ------------------
  |  Branch (577:10): [True: 594k, False: 480]
  |  Branch (577:29): [True: 593k, False: 943]
  ------------------
  578|   593k|    if (significant_digits < kMaxSignificantDigits) {
  ------------------
  |  Branch (578:9): [True: 69.1k, False: 523k]
  ------------------
  579|  69.1k|      DOUBLE_CONVERSION_ASSERT(buffer_pos < kBufferSize);
  ------------------
  |  |   47|  69.1k|    assert(condition)
  ------------------
  |  Branch (579:7): [True: 69.1k, False: 0]
  ------------------
  580|  69.1k|      buffer[buffer_pos++] = static_cast<char>(*current);
  581|  69.1k|      significant_digits++;
  582|       |      // Will later check if it's an octal in the buffer.
  583|   523k|    } else {
  584|   523k|      insignificant_digits++;  // Move the digit into the exponential part.
  585|   523k|      nonzero_digit_dropped = nonzero_digit_dropped || *current != '0';
  ------------------
  |  Branch (585:31): [True: 200, False: 523k]
  |  Branch (585:56): [True: 15, False: 523k]
  ------------------
  586|   523k|    }
  587|   593k|    octal = octal && *current < '8';
  ------------------
  |  Branch (587:13): [True: 10.7k, False: 582k]
  |  Branch (587:22): [True: 10.7k, False: 4]
  ------------------
  588|   593k|    if (Advance(&current, separator_, 10, end)) goto parsing_done;
  ------------------
  |  Branch (588:9): [True: 788, False: 592k]
  ------------------
  589|   593k|  }
  590|       |
  591|  1.42k|  if (significant_digits == 0) {
  ------------------
  |  Branch (591:7): [True: 298, False: 1.12k]
  ------------------
  592|    298|    octal = false;
  593|    298|  }
  594|       |
  595|  1.42k|  if (*current == '.') {
  ------------------
  |  Branch (595:7): [True: 387, False: 1.03k]
  ------------------
  596|    387|    if (octal && !allow_trailing_junk) return junk_string_value_;
  ------------------
  |  Branch (596:9): [True: 1, False: 386]
  |  Branch (596:18): [True: 0, False: 1]
  ------------------
  597|    387|    if (octal) goto parsing_done;
  ------------------
  |  Branch (597:9): [True: 1, False: 386]
  ------------------
  598|       |
  599|    386|    if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (599:9): [True: 4, False: 382]
  ------------------
  600|      4|      if (significant_digits == 0 && !leading_zero) {
  ------------------
  |  Branch (600:11): [True: 3, False: 1]
  |  Branch (600:38): [True: 1, False: 2]
  ------------------
  601|      1|        return junk_string_value_;
  602|      3|      } else {
  603|      3|        goto parsing_done;
  604|      3|      }
  605|      4|    }
  606|       |
  607|    382|    if (significant_digits == 0) {
  ------------------
  |  Branch (607:9): [True: 165, False: 217]
  ------------------
  608|       |      // octal = false;
  609|       |      // Integer part consists of 0 or is absent. Significant digits start after
  610|       |      // leading zeros (if any).
  611|  2.24M|      while (*current == '0') {
  ------------------
  |  Branch (611:14): [True: 2.24M, False: 152]
  ------------------
  612|  2.24M|        if (Advance(&current, separator_, 10, end)) {
  ------------------
  |  Branch (612:13): [True: 13, False: 2.24M]
  ------------------
  613|     13|          *processed_characters_count = static_cast<int>(current - input);
  614|     13|          return SignedZero(sign);
  615|     13|        }
  616|  2.24M|        exponent--;  // Move this 0 into the exponent.
  617|  2.24M|      }
  618|    165|    }
  619|       |
  620|       |    // There is a fractional part.
  621|       |    // We don't emit a '.', but adjust the exponent instead.
  622|   150k|    while (*current >= '0' && *current <= '9') {
  ------------------
  |  Branch (622:12): [True: 150k, False: 33]
  |  Branch (622:31): [True: 150k, False: 65]
  ------------------
  623|   150k|      if (significant_digits < kMaxSignificantDigits) {
  ------------------
  |  Branch (623:11): [True: 66.9k, False: 83.6k]
  ------------------
  624|  66.9k|        DOUBLE_CONVERSION_ASSERT(buffer_pos < kBufferSize);
  ------------------
  |  |   47|  66.9k|    assert(condition)
  ------------------
  |  Branch (624:9): [True: 66.9k, False: 0]
  ------------------
  625|  66.9k|        buffer[buffer_pos++] = static_cast<char>(*current);
  626|  66.9k|        significant_digits++;
  627|  66.9k|        exponent--;
  628|  83.6k|      } else {
  629|       |        // Ignore insignificant digits in the fractional part.
  630|  83.6k|        nonzero_digit_dropped = nonzero_digit_dropped || *current != '0';
  ------------------
  |  Branch (630:33): [True: 63.8k, False: 19.7k]
  |  Branch (630:58): [True: 17, False: 19.7k]
  ------------------
  631|  83.6k|      }
  632|   150k|      if (Advance(&current, separator_, 10, end)) goto parsing_done;
  ------------------
  |  Branch (632:11): [True: 271, False: 150k]
  ------------------
  633|   150k|    }
  634|    369|  }
  635|       |
  636|  1.13k|  if (!leading_zero && exponent == 0 && significant_digits == 0) {
  ------------------
  |  Branch (636:7): [True: 1.06k, False: 70]
  |  Branch (636:24): [True: 987, False: 77]
  |  Branch (636:41): [True: 82, False: 905]
  ------------------
  637|       |    // If leading_zeros is true then the string contains zeros.
  638|       |    // If exponent < 0 then string was [+-]\.0*...
  639|       |    // If significant_digits != 0 the string is not equal to 0.
  640|       |    // Otherwise there are no digits in the string.
  641|     82|    return junk_string_value_;
  642|     82|  }
  643|       |
  644|       |  // Parse exponential part.
  645|  1.05k|  if (*current == 'e' || *current == 'E') {
  ------------------
  |  Branch (645:7): [True: 485, False: 567]
  |  Branch (645:26): [True: 472, False: 95]
  ------------------
  646|    957|    if (octal && !allow_trailing_junk) return junk_string_value_;
  ------------------
  |  Branch (646:9): [True: 1, False: 956]
  |  Branch (646:18): [True: 0, False: 1]
  ------------------
  647|    957|    if (octal) goto parsing_done;
  ------------------
  |  Branch (647:9): [True: 1, False: 956]
  ------------------
  648|    956|    Iterator junk_begin = current;
  649|    956|    ++current;
  650|    956|    if (current == end) {
  ------------------
  |  Branch (650:9): [True: 2, False: 954]
  ------------------
  651|      2|      if (allow_trailing_junk) {
  ------------------
  |  Branch (651:11): [True: 2, False: 0]
  ------------------
  652|      2|        current = junk_begin;
  653|      2|        goto parsing_done;
  654|      2|      } else {
  655|      0|        return junk_string_value_;
  656|      0|      }
  657|      2|    }
  658|    954|    char exponen_sign = '+';
  659|    954|    if (*current == '+' || *current == '-') {
  ------------------
  |  Branch (659:9): [True: 1, False: 953]
  |  Branch (659:28): [True: 338, False: 615]
  ------------------
  660|    339|      exponen_sign = static_cast<char>(*current);
  661|    339|      ++current;
  662|    339|      if (current == end) {
  ------------------
  |  Branch (662:11): [True: 2, False: 337]
  ------------------
  663|      2|        if (allow_trailing_junk) {
  ------------------
  |  Branch (663:13): [True: 2, False: 0]
  ------------------
  664|      2|          current = junk_begin;
  665|      2|          goto parsing_done;
  666|      2|        } else {
  667|      0|          return junk_string_value_;
  668|      0|        }
  669|      2|      }
  670|    339|    }
  671|       |
  672|    952|    if (current == end || *current < '0' || *current > '9') {
  ------------------
  |  Branch (672:9): [True: 0, False: 952]
  |  Branch (672:27): [True: 15, False: 937]
  |  Branch (672:45): [True: 4, False: 933]
  ------------------
  673|     19|      if (allow_trailing_junk) {
  ------------------
  |  Branch (673:11): [True: 19, False: 0]
  ------------------
  674|     19|        current = junk_begin;
  675|     19|        goto parsing_done;
  676|     19|      } else {
  677|      0|        return junk_string_value_;
  678|      0|      }
  679|     19|    }
  680|       |
  681|    933|    const int max_exponent = INT_MAX / 2;
  682|    933|    DOUBLE_CONVERSION_ASSERT(-max_exponent / 2 <= exponent && exponent <= max_exponent / 2);
  ------------------
  |  |   47|    933|    assert(condition)
  ------------------
  |  Branch (682:5): [True: 933, False: 0]
  |  Branch (682:5): [True: 933, False: 0]
  |  Branch (682:5): [True: 933, False: 0]
  ------------------
  683|    933|    int num = 0;
  684|  3.45k|    do {
  685|       |      // Check overflow.
  686|  3.45k|      int digit = *current - '0';
  687|  3.45k|      if (num >= max_exponent / 10
  ------------------
  |  Branch (687:11): [True: 367, False: 3.08k]
  ------------------
  688|    367|          && !(num == max_exponent / 10 && digit <= max_exponent % 10)) {
  ------------------
  |  Branch (688:16): [True: 2, False: 365]
  |  Branch (688:44): [True: 1, False: 1]
  ------------------
  689|    366|        num = max_exponent;
  690|  3.08k|      } else {
  691|  3.08k|        num = num * 10 + digit;
  692|  3.08k|      }
  693|  3.45k|      ++current;
  694|  3.45k|    } while (current != end && *current >= '0' && *current <= '9');
  ------------------
  |  Branch (694:14): [True: 2.53k, False: 915]
  |  Branch (694:32): [True: 2.52k, False: 12]
  |  Branch (694:51): [True: 2.51k, False: 6]
  ------------------
  695|       |
  696|    933|    exponent += (exponen_sign == '-' ? -num : num);
  ------------------
  |  Branch (696:18): [True: 337, False: 596]
  ------------------
  697|    933|  }
  698|       |
  699|  1.02k|  if (!(allow_trailing_spaces || allow_trailing_junk) && (current != end)) {
  ------------------
  |  Branch (699:9): [True: 1.02k, False: 0]
  |  Branch (699:34): [True: 0, False: 0]
  |  Branch (699:58): [True: 0, False: 0]
  ------------------
  700|      0|    return junk_string_value_;
  701|      0|  }
  702|  1.02k|  if (!allow_trailing_junk && AdvanceToNonspace(&current, end)) {
  ------------------
  |  Branch (702:7): [True: 0, False: 1.02k]
  |  Branch (702:31): [True: 0, False: 0]
  ------------------
  703|      0|    return junk_string_value_;
  704|      0|  }
  705|  1.02k|  if (allow_trailing_spaces) {
  ------------------
  |  Branch (705:7): [True: 1.02k, False: 0]
  ------------------
  706|  1.02k|    AdvanceToNonspace(&current, end);
  707|  1.02k|  }
  708|       |
  709|  2.11k|  parsing_done:
  710|  2.11k|  exponent += insignificant_digits;
  711|       |
  712|  2.11k|  if (octal) {
  ------------------
  |  Branch (712:7): [True: 257, False: 1.85k]
  ------------------
  713|    257|    double result;
  714|    257|    bool result_is_junk;
  715|    257|    char* start = buffer;
  716|    257|    result = RadixStringToIeee<3>(&start,
  717|    257|                                  buffer + buffer_pos,
  718|    257|                                  sign,
  719|    257|                                  separator_,
  720|    257|                                  false, // Don't parse as hex_float.
  721|    257|                                  allow_trailing_junk,
  722|    257|                                  junk_string_value_,
  723|    257|                                  read_as_double,
  724|    257|                                  &result_is_junk);
  725|    257|    DOUBLE_CONVERSION_ASSERT(!result_is_junk);
  ------------------
  |  |   47|    257|    assert(condition)
  ------------------
  |  Branch (725:5): [True: 257, False: 0]
  ------------------
  726|    257|    *processed_characters_count = static_cast<int>(current - input);
  727|    257|    return result;
  728|    257|  }
  729|       |
  730|  1.85k|  if (nonzero_digit_dropped) {
  ------------------
  |  Branch (730:7): [True: 32, False: 1.82k]
  ------------------
  731|     32|    buffer[buffer_pos++] = '1';
  732|     32|    exponent--;
  733|     32|  }
  734|       |
  735|  1.85k|  DOUBLE_CONVERSION_ASSERT(buffer_pos < kBufferSize);
  ------------------
  |  |   47|  1.85k|    assert(condition)
  ------------------
  |  Branch (735:3): [True: 1.85k, False: 0]
  ------------------
  736|  1.85k|  buffer[buffer_pos] = '\0';
  737|       |
  738|       |  // Code above ensures there are no leading zeros and the buffer has fewer than
  739|       |  // kMaxSignificantDecimalDigits characters. Trim trailing zeros.
  740|  1.85k|  Vector<const char> chars(buffer, buffer_pos);
  741|  1.85k|  chars = TrimTrailingZeros(chars);
  742|  1.85k|  exponent += buffer_pos - chars.length();
  743|       |
  744|  1.85k|  double converted;
  745|  1.85k|  if (read_as_double) {
  ------------------
  |  Branch (745:7): [True: 1.85k, False: 0]
  ------------------
  746|  1.85k|    converted = StrtodTrimmed(chars, exponent);
  747|  1.85k|  } else {
  748|      0|    converted = StrtofTrimmed(chars, exponent);
  749|      0|  }
  750|  1.85k|  *processed_characters_count = static_cast<int>(current - input);
  751|  1.85k|  return sign? -converted: converted;
  ------------------
  |  Branch (751:10): [True: 2, False: 1.85k]
  ------------------
  752|  1.85k|}
string-to-double.cc:_ZN17double_conversionL17AdvanceToNonspaceIPKcEEbPT_S3_:
  139|  4.87k|static inline bool AdvanceToNonspace(Iterator* current, Iterator end) {
  140|  6.46k|  while (*current != end) {
  ------------------
  |  Branch (140:10): [True: 4.96k, False: 1.50k]
  ------------------
  141|  4.96k|    if (!isWhitespace(**current)) return true;
  ------------------
  |  Branch (141:9): [True: 3.37k, False: 1.59k]
  ------------------
  142|  1.59k|    ++*current;
  143|  1.59k|  }
  144|  1.50k|  return false;
  145|  4.87k|}
string-to-double.cc:_ZN17double_conversionL12isWhitespaceEi:
  123|  4.96k|static bool isWhitespace(int x) {
  124|  4.96k|  if (x < 128) {
  ------------------
  |  Branch (124:7): [True: 4.96k, False: 0]
  ------------------
  125|  31.0k|    for (int i = 0; i < kWhitespaceTable7Length; i++) {
  ------------------
  |  Branch (125:21): [True: 27.7k, False: 3.37k]
  ------------------
  126|  27.7k|      if (kWhitespaceTable7[i] == x) return true;
  ------------------
  |  Branch (126:11): [True: 1.59k, False: 26.1k]
  ------------------
  127|  27.7k|    }
  128|  4.96k|  } 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.37k|  return false;
  134|  4.96k|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_121ConsumeFirstCharacterEcPKcb:
   97|  5.99k|                                         bool case_insensitivity) {
   98|  5.99k|  return case_insensitivity ? ToLower(ch) == str[0] : ch == str[0];
  ------------------
  |  Branch (98:10): [True: 5.99k, False: 0]
  ------------------
   99|  5.99k|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_17ToLowerEc:
   54|  6.01k|inline char ToLower(char ch) {
   55|  6.01k|  static const std::ctype<char>& cType =
   56|  6.01k|      std::use_facet<std::ctype<char> >(std::locale::classic());
   57|  6.01k|  return cType.tolower(ch);
   58|  6.01k|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_116ConsumeSubStringIPKcEEbPT_S4_S3_b:
   86|      9|                             bool allow_case_insensitivity) {
   87|      9|  if (allow_case_insensitivity) {
  ------------------
  |  Branch (87:7): [True: 9, False: 0]
  ------------------
   88|      9|    return ConsumeSubStringImpl(current, end, substring, ToLower);
   89|      9|  } else {
   90|      0|    return ConsumeSubStringImpl(current, end, substring, Pass);
   91|      0|  }
   92|      9|}
string-to-double.cc:_ZN17double_conversion12_GLOBAL__N_120ConsumeSubStringImplIPKcPFccEEEbPT_S6_S3_T0_:
   68|      9|                                        Converter converter) {
   69|      9|  DOUBLE_CONVERSION_ASSERT(converter(**current) == *substring);
  ------------------
  |  |   47|      9|    assert(condition)
  ------------------
  |  Branch (69:3): [True: 9, False: 0]
  ------------------
   70|     19|  for (substring++; *substring != '\0'; substring++) {
  ------------------
  |  Branch (70:21): [True: 15, False: 4]
  ------------------
   71|     15|    ++*current;
   72|     15|    if (*current == end || converter(**current) != *substring) {
  ------------------
  |  Branch (72:9): [True: 3, False: 12]
  |  Branch (72:28): [True: 2, False: 10]
  ------------------
   73|      5|      return false;
   74|      5|    }
   75|     15|  }
   76|      4|  ++*current;
   77|      4|  return true;
   78|      9|}
string-to-double.cc:_ZN17double_conversionL7AdvanceIPKcEEbPT_tiRS3_:
  190|  15.6M|static bool Advance (Iterator* it, uc16 separator, int base, Iterator& end) {
  191|  15.6M|  if (separator == StringToDoubleConverter::kNoSeparator) {
  ------------------
  |  Branch (191:7): [True: 15.6M, False: 0]
  ------------------
  192|  15.6M|    ++(*it);
  193|  15.6M|    return *it == end;
  194|  15.6M|  }
  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|     33|static double SignedZero(bool sign) {
  156|     33|  return sign ? -0.0 : 0.0;
  ------------------
  |  Branch (156:10): [True: 1, False: 32]
  ------------------
  157|     33|}
string-to-double.cc:_ZN17double_conversionL16IsHexFloatStringIPKcEEbT_S3_tb:
  219|  1.07k|                             bool allow_trailing_junk) {
  220|  1.07k|  DOUBLE_CONVERSION_ASSERT(start != end);
  ------------------
  |  |   47|  1.07k|    assert(condition)
  ------------------
  |  Branch (220:3): [True: 1.07k, False: 0]
  ------------------
  221|       |
  222|  1.07k|  Iterator current = start;
  223|       |
  224|  1.07k|  bool saw_digit = false;
  225|  1.09M|  while (isDigit(*current, 16)) {
  ------------------
  |  Branch (225:10): [True: 1.09M, False: 823]
  ------------------
  226|  1.09M|    saw_digit = true;
  227|  1.09M|    if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (227:9): [True: 249, False: 1.09M]
  ------------------
  228|  1.09M|  }
  229|    823|  if (*current == '.') {
  ------------------
  |  Branch (229:7): [True: 150, False: 673]
  ------------------
  230|    150|    if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (230:9): [True: 1, False: 149]
  ------------------
  231|  7.24M|    while (isDigit(*current, 16)) {
  ------------------
  |  Branch (231:12): [True: 7.24M, False: 131]
  ------------------
  232|  7.24M|      saw_digit = true;
  233|  7.24M|      if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (233:11): [True: 18, False: 7.24M]
  ------------------
  234|  7.24M|    }
  235|    149|  }
  236|    804|  if (!saw_digit) return false;
  ------------------
  |  Branch (236:7): [True: 65, False: 739]
  ------------------
  237|    739|  if (*current != 'p' && *current != 'P') return false;
  ------------------
  |  Branch (237:7): [True: 362, False: 377]
  |  Branch (237:26): [True: 101, False: 261]
  ------------------
  238|    638|  if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (238:7): [True: 4, False: 634]
  ------------------
  239|    634|  if (*current == '+' || *current == '-') {
  ------------------
  |  Branch (239:7): [True: 3, False: 631]
  |  Branch (239:26): [True: 152, False: 479]
  ------------------
  240|    155|    if (Advance(&current, separator, 16, end)) return false;
  ------------------
  |  Branch (240:9): [True: 2, False: 153]
  ------------------
  241|    155|  }
  242|    632|  if (!isDigit(*current, 10)) return false;
  ------------------
  |  Branch (242:7): [True: 20, False: 612]
  ------------------
  243|    612|  if (Advance(&current, separator, 16, end)) return true;
  ------------------
  |  Branch (243:7): [True: 250, False: 362]
  ------------------
  244|  3.50k|  while (isDigit(*current, 10)) {
  ------------------
  |  Branch (244:10): [True: 3.45k, False: 48]
  ------------------
  245|  3.45k|    if (Advance(&current, separator, 16, end)) return true;
  ------------------
  |  Branch (245:9): [True: 314, False: 3.13k]
  ------------------
  246|  3.45k|  }
  247|     48|  return allow_trailing_junk || !AdvanceToNonspace(&current, end);
  ------------------
  |  Branch (247:10): [True: 48, False: 0]
  |  Branch (247:33): [True: 0, False: 0]
  ------------------
  248|    362|}
string-to-double.cc:_ZN17double_conversionL7isDigitEii:
  148|  9.04M|static bool isDigit(int x, int radix) {
  149|  9.04M|  return (x >= '0' && x <= '9' && x < '0' + radix)
  ------------------
  |  Branch (149:11): [True: 9.04M, False: 364]
  |  Branch (149:23): [True: 9.03M, False: 10.7k]
  |  Branch (149:35): [True: 9.03M, False: 0]
  ------------------
  150|  11.0k|      || (radix > 10 && x >= 'a' && x < 'a' + radix - 10)
  ------------------
  |  Branch (150:11): [True: 11.0k, False: 68]
  |  Branch (150:25): [True: 6.39k, False: 4.60k]
  |  Branch (150:37): [True: 5.96k, False: 430]
  ------------------
  151|  5.10k|      || (radix > 10 && x >= 'A' && x < 'A' + radix - 10);
  ------------------
  |  Branch (151:11): [True: 5.03k, False: 68]
  |  Branch (151:25): [True: 4.68k, False: 351]
  |  Branch (151:37): [True: 3.93k, False: 755]
  ------------------
  152|  9.04M|}
string-to-double.cc:_ZN17double_conversionL17RadixStringToIeeeILi4EPKcEEdPT0_S3_btbbdbPb:
  264|    679|                                bool* result_is_junk) {
  265|    679|  DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|    679|    assert(condition)
  ------------------
  |  Branch (265:3): [True: 679, False: 0]
  ------------------
  266|    679|  DOUBLE_CONVERSION_ASSERT(!parse_as_hex_float ||
  ------------------
  |  |   47|    679|    assert(condition)
  ------------------
  |  Branch (266:3): [True: 373, False: 306]
  |  Branch (266:3): [True: 306, False: 0]
  |  Branch (266:3): [True: 679, False: 0]
  ------------------
  267|    679|      IsHexFloatString(*current, end, separator, allow_trailing_junk));
  268|       |
  269|    679|  const int kDoubleSize = Double::kSignificandSize;
  270|    679|  const int kSingleSize = Single::kSignificandSize;
  271|    679|  const int kSignificandSize = read_as_double? kDoubleSize: kSingleSize;
  ------------------
  |  Branch (271:32): [True: 679, False: 0]
  ------------------
  272|       |
  273|    679|  *result_is_junk = true;
  274|       |
  275|    679|  int64_t number = 0;
  276|    679|  int exponent = 0;
  277|    679|  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|    679|  bool post_decimal = false;
  281|       |
  282|       |  // Skip leading 0s.
  283|  1.17k|  while (**current == '0') {
  ------------------
  |  Branch (283:10): [True: 501, False: 670]
  ------------------
  284|    501|    if (Advance(current, separator, radix, end)) {
  ------------------
  |  Branch (284:9): [True: 9, False: 492]
  ------------------
  285|      9|      *result_is_junk = false;
  286|      9|      return SignedZero(sign);
  287|      9|    }
  288|    501|  }
  289|       |
  290|  3.62M|  while (true) {
  ------------------
  |  Branch (290:10): [True: 3.62M, Folded]
  ------------------
  291|  3.62M|    int digit;
  292|  3.62M|    if (IsDecimalDigitForRadix(**current, radix)) {
  ------------------
  |  Branch (292:9): [True: 3.62M, False: 2.99k]
  ------------------
  293|  3.62M|      digit = static_cast<char>(**current) - '0';
  294|  3.62M|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (294:11): [True: 3.61M, False: 1.33k]
  ------------------
  295|  3.62M|    } else if (IsCharacterDigitForRadix(**current, radix, 'a')) {
  ------------------
  |  Branch (295:16): [True: 1.20k, False: 1.78k]
  ------------------
  296|  1.20k|      digit = static_cast<char>(**current) - 'a' + 10;
  297|  1.20k|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (297:11): [True: 89, False: 1.12k]
  ------------------
  298|  1.78k|    } else if (IsCharacterDigitForRadix(**current, radix, 'A')) {
  ------------------
  |  Branch (298:16): [True: 1.37k, False: 412]
  ------------------
  299|  1.37k|      digit = static_cast<char>(**current) - 'A' + 10;
  300|  1.37k|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (300:11): [True: 118, False: 1.25k]
  ------------------
  301|  1.37k|    } else if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (301:16): [True: 321, False: 91]
  |  Branch (301:38): [True: 47, False: 274]
  ------------------
  302|     47|      post_decimal = true;
  303|     47|      Advance(current, separator, radix, end);
  304|     47|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|     47|    assert(condition)
  ------------------
  |  Branch (304:7): [True: 47, False: 0]
  ------------------
  305|     47|      continue;
  306|    365|    } else if (parse_as_hex_float && (**current == 'p' || **current == 'P')) {
  ------------------
  |  Branch (306:16): [True: 274, False: 91]
  |  Branch (306:39): [True: 159, False: 115]
  |  Branch (306:59): [True: 115, False: 0]
  ------------------
  307|    274|      break;
  308|    274|    } else {
  309|     91|      if (allow_trailing_junk || !AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (309:11): [True: 91, False: 0]
  |  Branch (309:34): [True: 0, False: 0]
  ------------------
  310|     91|        break;
  311|     91|      } else {
  312|      0|        return junk_string_value;
  313|      0|      }
  314|     91|    }
  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: 182, False: 3.62M]
  ------------------
  319|       |      // Overflow occurred. Need to determine which direction to round the
  320|       |      // result.
  321|    182|      int overflow_bits_count = 1;
  322|    511|      while (overflow > 1) {
  ------------------
  |  Branch (322:14): [True: 329, False: 182]
  ------------------
  323|    329|        overflow_bits_count++;
  324|    329|        overflow >>= 1;
  325|    329|      }
  326|       |
  327|    182|      int dropped_bits_mask = ((1 << overflow_bits_count) - 1);
  328|    182|      int dropped_bits = static_cast<int>(number) & dropped_bits_mask;
  329|    182|      number >>= overflow_bits_count;
  330|    182|      exponent += overflow_bits_count;
  331|       |
  332|    182|      bool zero_tail = true;
  333|   697k|      for (;;) {
  334|   697k|        if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (334:13): [True: 117, False: 697k]
  ------------------
  335|   697k|        if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (335:13): [True: 394k, False: 302k]
  |  Branch (335:35): [True: 1, False: 394k]
  ------------------
  336|       |          // Just run over the '.'. We are just trying to see whether there is
  337|       |          // a non-zero digit somewhere.
  338|      1|          Advance(current, separator, radix, end);
  339|      1|          DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      1|    assert(condition)
  ------------------
  |  Branch (339:11): [True: 1, False: 0]
  ------------------
  340|      1|          post_decimal = true;
  341|      1|        }
  342|   697k|        if (!isDigit(**current, radix)) break;
  ------------------
  |  Branch (342:13): [True: 65, False: 696k]
  ------------------
  343|   696k|        zero_tail = zero_tail && **current == '0';
  ------------------
  |  Branch (343:21): [True: 116k, False: 580k]
  |  Branch (343:34): [True: 116k, False: 84]
  ------------------
  344|   696k|        if (!post_decimal) {
  ------------------
  |  Branch (344:13): [True: 696k, False: 589]
  ------------------
  345|   696k|          if (exponent <= INT_MAX - radix_log_2) {
  ------------------
  |  Branch (345:15): [True: 696k, False: 0]
  ------------------
  346|   696k|            exponent += radix_log_2;
  347|   696k|          } else {
  348|      0|            exponent = INT_MAX;
  349|      0|          }
  350|   696k|        }
  351|   696k|      }
  352|       |
  353|    182|      if (!parse_as_hex_float &&
  ------------------
  |  Branch (353:11): [True: 150, False: 32]
  ------------------
  354|    150|          !allow_trailing_junk &&
  ------------------
  |  Branch (354:11): [True: 0, False: 150]
  ------------------
  355|      0|          AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (355:11): [True: 0, False: 0]
  ------------------
  356|      0|        return junk_string_value;
  357|      0|      }
  358|       |
  359|    182|      int middle_value = (1 << (overflow_bits_count - 1));
  360|    182|      if (dropped_bits > middle_value) {
  ------------------
  |  Branch (360:11): [True: 69, False: 113]
  ------------------
  361|     69|        number++;  // Rounding up.
  362|    113|      } else if (dropped_bits == middle_value) {
  ------------------
  |  Branch (362:18): [True: 30, False: 83]
  ------------------
  363|       |        // Rounding to even to consistency with decimals: half-way case rounds
  364|       |        // up if significant part is odd and down otherwise.
  365|     30|        if ((number & 1) != 0 || !zero_tail) {
  ------------------
  |  Branch (365:13): [True: 17, False: 13]
  |  Branch (365:34): [True: 6, False: 7]
  ------------------
  366|     23|          number++;  // Rounding up.
  367|     23|        }
  368|     30|      }
  369|       |
  370|       |      // Rounding up may cause overflow.
  371|    182|      if ((number & ((int64_t)1 << kSignificandSize)) != 0) {
  ------------------
  |  Branch (371:11): [True: 5, False: 177]
  ------------------
  372|      5|        exponent++;
  373|      5|        number >>= 1;
  374|      5|      }
  375|    182|      break;
  376|    182|    }
  377|  3.62M|    if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (377:9): [True: 123, False: 3.62M]
  ------------------
  378|  3.62M|  }
  379|       |
  380|    670|  DOUBLE_CONVERSION_ASSERT(number < ((int64_t)1 << kSignificandSize));
  ------------------
  |  |   47|    670|    assert(condition)
  ------------------
  |  Branch (380:3): [True: 670, False: 0]
  ------------------
  381|    670|  DOUBLE_CONVERSION_ASSERT(static_cast<int64_t>(static_cast<double>(number)) == number);
  ------------------
  |  |   47|    670|    assert(condition)
  ------------------
  |  Branch (381:3): [True: 670, False: 0]
  ------------------
  382|       |
  383|    670|  *result_is_junk = false;
  384|       |
  385|    670|  if (parse_as_hex_float) {
  ------------------
  |  Branch (385:7): [True: 306, False: 364]
  ------------------
  386|    306|    DOUBLE_CONVERSION_ASSERT(**current == 'p' || **current == 'P');
  ------------------
  |  |   47|    306|    assert(condition)
  ------------------
  |  Branch (386:5): [True: 180, False: 126]
  |  Branch (386:5): [True: 126, False: 0]
  |  Branch (386:5): [True: 306, False: 0]
  ------------------
  387|    306|    Advance(current, separator, radix, end);
  388|    306|    DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|    306|    assert(condition)
  ------------------
  |  Branch (388:5): [True: 306, False: 0]
  ------------------
  389|    306|    bool is_negative = false;
  390|    306|    if (**current == '+') {
  ------------------
  |  Branch (390:9): [True: 1, False: 305]
  ------------------
  391|      1|      Advance(current, separator, radix, end);
  392|      1|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      1|    assert(condition)
  ------------------
  |  Branch (392:7): [True: 1, False: 0]
  ------------------
  393|    305|    } else if (**current == '-') {
  ------------------
  |  Branch (393:16): [True: 75, False: 230]
  ------------------
  394|     75|      is_negative = true;
  395|     75|      Advance(current, separator, radix, end);
  396|     75|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|     75|    assert(condition)
  ------------------
  |  Branch (396:7): [True: 75, False: 0]
  ------------------
  397|     75|    }
  398|    306|    int written_exponent = 0;
  399|  2.05k|    while (IsDecimalDigitForRadix(**current, 10)) {
  ------------------
  |  Branch (399:12): [True: 2.03k, False: 24]
  ------------------
  400|       |      // No need to read exponents if they are too big. That could potentially overflow
  401|       |      // the `written_exponent` variable.
  402|  2.03k|      if (abs(written_exponent) <= 100 * Double::kMaxExponent) {
  ------------------
  |  Branch (402:11): [True: 1.20k, False: 829]
  ------------------
  403|  1.20k|        written_exponent = 10 * written_exponent + **current - '0';
  404|  1.20k|      }
  405|  2.03k|      if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (405:11): [True: 282, False: 1.75k]
  ------------------
  406|  2.03k|    }
  407|    306|    if (is_negative) written_exponent = -written_exponent;
  ------------------
  |  Branch (407:9): [True: 75, False: 231]
  ------------------
  408|    306|    exponent += written_exponent;
  409|    306|  }
  410|       |
  411|    670|  if (exponent == 0 || number == 0) {
  ------------------
  |  Branch (411:7): [True: 224, False: 446]
  |  Branch (411:24): [True: 27, False: 419]
  ------------------
  412|    251|    if (sign) {
  ------------------
  |  Branch (412:9): [True: 54, False: 197]
  ------------------
  413|     54|      if (number == 0) return -0.0;
  ------------------
  |  Branch (413:11): [True: 1, False: 53]
  ------------------
  414|     53|      number = -number;
  415|     53|    }
  416|    250|    return static_cast<double>(number);
  417|    251|  }
  418|       |
  419|    419|  DOUBLE_CONVERSION_ASSERT(number != 0);
  ------------------
  |  |   47|    419|    assert(condition)
  ------------------
  |  Branch (419:3): [True: 419, False: 0]
  ------------------
  420|    419|  double result = Double(DiyFp(number, exponent)).value();
  421|    419|  return sign ? -result : result;
  ------------------
  |  Branch (421:10): [True: 1, False: 418]
  ------------------
  422|    419|}
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: 106]
  |  Branch (174:22): [True: 3.62M, False: 2.91k]
  |  Branch (174:34): [True: 3.62M, False: 0]
  ------------------
  175|  3.62M|}
string-to-double.cc:_ZN17double_conversionL24IsCharacterDigitForRadixEiic:
  184|  4.78k|static bool IsCharacterDigitForRadix(int c, int radix, char a_character) {
  185|  4.78k|  return radix > 10 && c >= a_character && c < a_character + radix - 10;
  ------------------
  |  Branch (185:10): [True: 4.78k, False: 0]
  |  Branch (185:24): [True: 3.08k, False: 1.70k]
  |  Branch (185:44): [True: 2.58k, False: 497]
  ------------------
  186|  4.78k|}
string-to-double.cc:_ZN17double_conversionL17RadixStringToIeeeILi3EPcEEdPT0_S2_btbbdbPb:
  264|    257|                                bool* result_is_junk) {
  265|    257|  DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|    257|    assert(condition)
  ------------------
  |  Branch (265:3): [True: 257, False: 0]
  ------------------
  266|    257|  DOUBLE_CONVERSION_ASSERT(!parse_as_hex_float ||
  ------------------
  |  |   47|    257|    assert(condition)
  ------------------
  |  Branch (266:3): [True: 257, False: 0]
  |  Branch (266:3): [True: 0, False: 0]
  |  Branch (266:3): [True: 257, False: 0]
  ------------------
  267|    257|      IsHexFloatString(*current, end, separator, allow_trailing_junk));
  268|       |
  269|    257|  const int kDoubleSize = Double::kSignificandSize;
  270|    257|  const int kSingleSize = Single::kSignificandSize;
  271|    257|  const int kSignificandSize = read_as_double? kDoubleSize: kSingleSize;
  ------------------
  |  Branch (271:32): [True: 257, False: 0]
  ------------------
  272|       |
  273|    257|  *result_is_junk = true;
  274|       |
  275|    257|  int64_t number = 0;
  276|    257|  int exponent = 0;
  277|    257|  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|    257|  bool post_decimal = false;
  281|       |
  282|       |  // Skip leading 0s.
  283|    257|  while (**current == '0') {
  ------------------
  |  Branch (283:10): [True: 0, False: 257]
  ------------------
  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.60k|  while (true) {
  ------------------
  |  Branch (290:10): [True: 3.60k, Folded]
  ------------------
  291|  3.60k|    int digit;
  292|  3.60k|    if (IsDecimalDigitForRadix(**current, radix)) {
  ------------------
  |  Branch (292:9): [True: 3.60k, False: 0]
  ------------------
  293|  3.60k|      digit = static_cast<char>(**current) - '0';
  294|  3.60k|      if (post_decimal) exponent -= radix_log_2;
  ------------------
  |  Branch (294:11): [True: 0, False: 3.60k]
  ------------------
  295|  3.60k|    } 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)
  ------------------
  |  Branch (304:7): [True: 0, False: 0]
  ------------------
  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.60k|    number = number * radix + digit;
  317|  3.60k|    int overflow = static_cast<int>(number >> kSignificandSize);
  318|  3.60k|    if (overflow != 0) {
  ------------------
  |  Branch (318:9): [True: 144, False: 3.46k]
  ------------------
  319|       |      // Overflow occurred. Need to determine which direction to round the
  320|       |      // result.
  321|    144|      int overflow_bits_count = 1;
  322|    181|      while (overflow > 1) {
  ------------------
  |  Branch (322:14): [True: 37, False: 144]
  ------------------
  323|     37|        overflow_bits_count++;
  324|     37|        overflow >>= 1;
  325|     37|      }
  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|  7.32k|      for (;;) {
  334|  7.32k|        if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (334:13): [True: 144, False: 7.17k]
  ------------------
  335|  7.17k|        if (parse_as_hex_float && **current == '.') {
  ------------------
  |  Branch (335:13): [True: 0, False: 7.17k]
  |  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)
  ------------------
  |  Branch (339:11): [True: 0, False: 0]
  ------------------
  340|      0|          post_decimal = true;
  341|      0|        }
  342|  7.17k|        if (!isDigit(**current, radix)) break;
  ------------------
  |  Branch (342:13): [True: 0, False: 7.17k]
  ------------------
  343|  7.17k|        zero_tail = zero_tail && **current == '0';
  ------------------
  |  Branch (343:21): [True: 1.75k, False: 5.42k]
  |  Branch (343:34): [True: 1.69k, False: 58]
  ------------------
  344|  7.17k|        if (!post_decimal) {
  ------------------
  |  Branch (344:13): [True: 7.17k, False: 0]
  ------------------
  345|  7.17k|          if (exponent <= INT_MAX - radix_log_2) {
  ------------------
  |  Branch (345:15): [True: 7.17k, False: 0]
  ------------------
  346|  7.17k|            exponent += radix_log_2;
  347|  7.17k|          } else {
  348|      0|            exponent = INT_MAX;
  349|      0|          }
  350|  7.17k|        }
  351|  7.17k|      }
  352|       |
  353|    144|      if (!parse_as_hex_float &&
  ------------------
  |  Branch (353:11): [True: 144, False: 0]
  ------------------
  354|    144|          !allow_trailing_junk &&
  ------------------
  |  Branch (354:11): [True: 0, False: 144]
  ------------------
  355|      0|          AdvanceToNonspace(current, end)) {
  ------------------
  |  Branch (355:11): [True: 0, False: 0]
  ------------------
  356|      0|        return junk_string_value;
  357|      0|      }
  358|       |
  359|    144|      int middle_value = (1 << (overflow_bits_count - 1));
  360|    144|      if (dropped_bits > middle_value) {
  ------------------
  |  Branch (360:11): [True: 7, False: 137]
  ------------------
  361|      7|        number++;  // Rounding up.
  362|    137|      } else if (dropped_bits == middle_value) {
  ------------------
  |  Branch (362:18): [True: 66, False: 71]
  ------------------
  363|       |        // Rounding to even to consistency with decimals: half-way case rounds
  364|       |        // up if significant part is odd and down otherwise.
  365|     66|        if ((number & 1) != 0 || !zero_tail) {
  ------------------
  |  Branch (365:13): [True: 52, False: 14]
  |  Branch (365:34): [True: 4, False: 10]
  ------------------
  366|     56|          number++;  // Rounding up.
  367|     56|        }
  368|     66|      }
  369|       |
  370|       |      // Rounding up may cause overflow.
  371|    144|      if ((number & ((int64_t)1 << kSignificandSize)) != 0) {
  ------------------
  |  Branch (371:11): [True: 18, False: 126]
  ------------------
  372|     18|        exponent++;
  373|     18|        number >>= 1;
  374|     18|      }
  375|    144|      break;
  376|    144|    }
  377|  3.46k|    if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (377:9): [True: 113, False: 3.34k]
  ------------------
  378|  3.46k|  }
  379|       |
  380|    257|  DOUBLE_CONVERSION_ASSERT(number < ((int64_t)1 << kSignificandSize));
  ------------------
  |  |   47|    257|    assert(condition)
  ------------------
  |  Branch (380:3): [True: 257, False: 0]
  ------------------
  381|    257|  DOUBLE_CONVERSION_ASSERT(static_cast<int64_t>(static_cast<double>(number)) == number);
  ------------------
  |  |   47|    257|    assert(condition)
  ------------------
  |  Branch (381:3): [True: 257, False: 0]
  ------------------
  382|       |
  383|    257|  *result_is_junk = false;
  384|       |
  385|    257|  if (parse_as_hex_float) {
  ------------------
  |  Branch (385:7): [True: 0, False: 257]
  ------------------
  386|      0|    DOUBLE_CONVERSION_ASSERT(**current == 'p' || **current == 'P');
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  |  Branch (386:5): [True: 0, False: 0]
  |  Branch (386:5): [True: 0, False: 0]
  |  Branch (386:5): [True: 0, False: 0]
  ------------------
  387|      0|    Advance(current, separator, radix, end);
  388|      0|    DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  |  Branch (388:5): [True: 0, False: 0]
  ------------------
  389|      0|    bool is_negative = false;
  390|      0|    if (**current == '+') {
  ------------------
  |  Branch (390:9): [True: 0, False: 0]
  ------------------
  391|      0|      Advance(current, separator, radix, end);
  392|      0|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  |  Branch (392:7): [True: 0, False: 0]
  ------------------
  393|      0|    } else if (**current == '-') {
  ------------------
  |  Branch (393:16): [True: 0, False: 0]
  ------------------
  394|      0|      is_negative = true;
  395|      0|      Advance(current, separator, radix, end);
  396|      0|      DOUBLE_CONVERSION_ASSERT(*current != end);
  ------------------
  |  |   47|      0|    assert(condition)
  ------------------
  |  Branch (396:7): [True: 0, False: 0]
  ------------------
  397|      0|    }
  398|      0|    int written_exponent = 0;
  399|      0|    while (IsDecimalDigitForRadix(**current, 10)) {
  ------------------
  |  Branch (399:12): [True: 0, False: 0]
  ------------------
  400|       |      // No need to read exponents if they are too big. That could potentially overflow
  401|       |      // the `written_exponent` variable.
  402|      0|      if (abs(written_exponent) <= 100 * Double::kMaxExponent) {
  ------------------
  |  Branch (402:11): [True: 0, False: 0]
  ------------------
  403|      0|        written_exponent = 10 * written_exponent + **current - '0';
  404|      0|      }
  405|      0|      if (Advance(current, separator, radix, end)) break;
  ------------------
  |  Branch (405:11): [True: 0, False: 0]
  ------------------
  406|      0|    }
  407|      0|    if (is_negative) written_exponent = -written_exponent;
  ------------------
  |  Branch (407:9): [True: 0, False: 0]
  ------------------
  408|      0|    exponent += written_exponent;
  409|      0|  }
  410|       |
  411|    257|  if (exponent == 0 || number == 0) {
  ------------------
  |  Branch (411:7): [True: 113, False: 144]
  |  Branch (411:24): [True: 0, False: 144]
  ------------------
  412|    113|    if (sign) {
  ------------------
  |  Branch (412:9): [True: 53, False: 60]
  ------------------
  413|     53|      if (number == 0) return -0.0;
  ------------------
  |  Branch (413:11): [True: 0, False: 53]
  ------------------
  414|     53|      number = -number;
  415|     53|    }
  416|    113|    return static_cast<double>(number);
  417|    113|  }
  418|       |
  419|    144|  DOUBLE_CONVERSION_ASSERT(number != 0);
  ------------------
  |  |   47|    144|    assert(condition)
  ------------------
  |  Branch (419:3): [True: 144, False: 0]
  ------------------
  420|    144|  double result = Double(DiyFp(number, exponent)).value();
  421|    144|  return sign ? -result : result;
  ------------------
  |  Branch (421:10): [True: 1, False: 143]
  ------------------
  422|    144|}
string-to-double.cc:_ZN17double_conversionL7AdvanceIPcEEbPT_tiRS2_:
  190|  10.7k|static bool Advance (Iterator* it, uc16 separator, int base, Iterator& end) {
  191|  10.7k|  if (separator == StringToDoubleConverter::kNoSeparator) {
  ------------------
  |  Branch (191:7): [True: 10.7k, False: 0]
  ------------------
  192|  10.7k|    ++(*it);
  193|  10.7k|    return *it == end;
  194|  10.7k|  }
  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:
  173|  3.02k|      : flags_(flags),
  174|  3.02k|        empty_string_value_(empty_string_value),
  175|  3.02k|        junk_string_value_(junk_string_value),
  176|  3.02k|        infinity_symbol_(infinity_symbol),
  177|  3.02k|        nan_symbol_(nan_symbol),
  178|  3.02k|        separator_(separator) {
  179|  3.02k|  }

_ZN17double_conversion13StrtodTrimmedENS_6VectorIKcEEi:
  466|  1.85k|double StrtodTrimmed(Vector<const char> trimmed, int exponent) {
  467|  1.85k|  DOUBLE_CONVERSION_ASSERT(trimmed.length() <= kMaxSignificantDecimalDigits);
  ------------------
  |  |   47|  1.85k|    assert(condition)
  ------------------
  |  Branch (467:3): [True: 1.85k, False: 0]
  ------------------
  468|  1.85k|  DOUBLE_CONVERSION_ASSERT(AssertTrimmedDigits(trimmed));
  ------------------
  |  |   47|  1.85k|    assert(condition)
  ------------------
  |  Branch (468:3): [True: 1.85k, False: 0]
  ------------------
  469|  1.85k|  double guess;
  470|  1.85k|  const bool is_correct = ComputeGuess(trimmed, exponent, &guess);
  471|  1.85k|  if (is_correct) {
  ------------------
  |  Branch (471:7): [True: 1.09k, False: 759]
  ------------------
  472|  1.09k|    return guess;
  473|  1.09k|  }
  474|    759|  DiyFp upper_boundary = Double(guess).UpperBoundary();
  475|    759|  int comparison = CompareBufferWithDiyFp(trimmed, exponent, upper_boundary);
  476|    759|  if (comparison < 0) {
  ------------------
  |  Branch (476:7): [True: 227, False: 532]
  ------------------
  477|    227|    return guess;
  478|    532|  } else if (comparison > 0) {
  ------------------
  |  Branch (478:14): [True: 431, False: 101]
  ------------------
  479|    431|    return Double(guess).NextDouble();
  480|    431|  } else if ((Double(guess).Significand() & 1) == 0) {
  ------------------
  |  Branch (480:14): [True: 43, False: 58]
  ------------------
  481|       |    // Round towards even.
  482|     43|    return guess;
  483|     58|  } else {
  484|     58|    return Double(guess).NextDouble();
  485|     58|  }
  486|    759|}
strtod.cc:_ZN17double_conversionL19AssertTrimmedDigitsERKNS_6VectorIKcEE:
  457|  1.85k|static bool AssertTrimmedDigits(const Vector<const char>& buffer) {
  458|   124k|  for(int i = 0; i < buffer.length(); ++i) {
  ------------------
  |  Branch (458:18): [True: 122k, False: 1.85k]
  ------------------
  459|   122k|    if(!IsDigit(buffer[i])) {
  ------------------
  |  Branch (459:8): [True: 0, False: 122k]
  ------------------
  460|      0|      return false;
  461|      0|    }
  462|   122k|  }
  463|  1.85k|  return (buffer.length() == 0) || (IsNonZeroDigit(buffer[0]) && IsNonZeroDigit(buffer[buffer.length()-1]));
  ------------------
  |  Branch (463:10): [True: 76, False: 1.78k]
  |  Branch (463:37): [True: 1.78k, False: 0]
  |  Branch (463:66): [True: 1.78k, False: 0]
  ------------------
  464|  1.85k|}
strtod.cc:_ZN17double_conversionL7IsDigitEc:
  444|   122k|static bool IsDigit(const char d) {
  445|   122k|  return ('0' <= d) && (d <= '9');
  ------------------
  |  Branch (445:10): [True: 122k, False: 0]
  |  Branch (445:24): [True: 122k, False: 0]
  ------------------
  446|   122k|}
strtod.cc:_ZN17double_conversionL14IsNonZeroDigitEc:
  448|  3.56k|static bool IsNonZeroDigit(const char d) {
  449|  3.56k|  return ('1' <= d) && (d <= '9');
  ------------------
  |  Branch (449:10): [True: 3.56k, False: 0]
  |  Branch (449:24): [True: 3.56k, False: 0]
  ------------------
  450|  3.56k|}
strtod.cc:_ZN17double_conversionL12ComputeGuessENS_6VectorIKcEEiPd:
  420|  1.85k|                         double* guess) {
  421|  1.85k|  if (trimmed.length() == 0) {
  ------------------
  |  Branch (421:7): [True: 76, False: 1.78k]
  ------------------
  422|     76|    *guess = 0.0;
  423|     76|    return true;
  424|     76|  }
  425|  1.78k|  if (exponent + trimmed.length() - 1 >= kMaxDecimalPower) {
  ------------------
  |  Branch (425:7): [True: 121, False: 1.66k]
  ------------------
  426|    121|    *guess = Double::Infinity();
  427|    121|    return true;
  428|    121|  }
  429|  1.66k|  if (exponent + trimmed.length() <= kMinDecimalPower) {
  ------------------
  |  Branch (429:7): [True: 68, False: 1.59k]
  ------------------
  430|     68|    *guess = 0.0;
  431|     68|    return true;
  432|     68|  }
  433|       |
  434|  1.59k|  if (DoubleStrtod(trimmed, exponent, guess) ||
  ------------------
  |  Branch (434:7): [True: 278, False: 1.31k]
  ------------------
  435|  1.31k|      DiyFpStrtod(trimmed, exponent, guess)) {
  ------------------
  |  Branch (435:7): [True: 555, False: 760]
  ------------------
  436|    833|    return true;
  437|    833|  }
  438|    760|  if (*guess == Double::Infinity()) {
  ------------------
  |  Branch (438:7): [True: 1, False: 759]
  ------------------
  439|      1|    return true;
  440|      1|  }
  441|    759|  return false;
  442|    760|}
strtod.cc:_ZN17double_conversionL12DoubleStrtodENS_6VectorIKcEEiPd:
  192|  1.59k|                         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.59k|  if (trimmed.length() <= kMaxExactDoubleIntegerDecimalDigits) {
  ------------------
  |  Branch (204:7): [True: 862, False: 731]
  ------------------
  205|    862|    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|    862|    if (exponent < 0 && -exponent < kExactPowersOfTenSize) {
  ------------------
  |  Branch (212:9): [True: 284, False: 578]
  |  Branch (212:25): [True: 71, False: 213]
  ------------------
  213|       |      // 10^-exponent fits into a double.
  214|     71|      *result = static_cast<double>(ReadUint64(trimmed, &read_digits));
  215|     71|      DOUBLE_CONVERSION_ASSERT(read_digits == trimmed.length());
  ------------------
  |  |   47|     71|    assert(condition)
  ------------------
  |  Branch (215:7): [True: 71, False: 0]
  ------------------
  216|     71|      *result /= exact_powers_of_ten[-exponent];
  217|     71|      return true;
  218|     71|    }
  219|    791|    if (0 <= exponent && exponent < kExactPowersOfTenSize) {
  ------------------
  |  Branch (219:9): [True: 578, False: 213]
  |  Branch (219:26): [True: 148, False: 430]
  ------------------
  220|       |      // 10^exponent fits into a double.
  221|    148|      *result = static_cast<double>(ReadUint64(trimmed, &read_digits));
  222|    148|      DOUBLE_CONVERSION_ASSERT(read_digits == trimmed.length());
  ------------------
  |  |   47|    148|    assert(condition)
  ------------------
  |  Branch (222:7): [True: 148, False: 0]
  ------------------
  223|    148|      *result *= exact_powers_of_ten[exponent];
  224|    148|      return true;
  225|    148|    }
  226|    643|    int remaining_digits =
  227|    643|        kMaxExactDoubleIntegerDecimalDigits - trimmed.length();
  228|    643|    if ((0 <= exponent) &&
  ------------------
  |  Branch (228:9): [True: 430, False: 213]
  ------------------
  229|    430|        (exponent - remaining_digits < kExactPowersOfTenSize)) {
  ------------------
  |  Branch (229:9): [True: 59, False: 371]
  ------------------
  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|     59|      *result = static_cast<double>(ReadUint64(trimmed, &read_digits));
  234|     59|      DOUBLE_CONVERSION_ASSERT(read_digits == trimmed.length());
  ------------------
  |  |   47|     59|    assert(condition)
  ------------------
  |  Branch (234:7): [True: 59, False: 0]
  ------------------
  235|     59|      *result *= exact_powers_of_ten[remaining_digits];
  236|     59|      *result *= exact_powers_of_ten[exponent - remaining_digits];
  237|     59|      return true;
  238|     59|    }
  239|    643|  }
  240|  1.31k|  return false;
  241|  1.59k|#endif
  242|  1.59k|}
strtod.cc:_ZN17double_conversionL10ReadUint64ENS_6VectorIKcEEPi:
  152|  1.59k|                           int* number_of_read_digits) {
  153|  1.59k|  uint64_t result = 0;
  154|  1.59k|  int i = 0;
  155|  19.1k|  while (i < buffer.length() && result <= (kMaxUint64 / 10 - 1)) {
  ------------------
  |  Branch (155:10): [True: 17.9k, False: 1.25k]
  |  Branch (155:33): [True: 17.5k, False: 334]
  ------------------
  156|  17.5k|    int digit = buffer[i++] - '0';
  157|  17.5k|    DOUBLE_CONVERSION_ASSERT(0 <= digit && digit <= 9);
  ------------------
  |  |   47|  17.5k|    assert(condition)
  ------------------
  |  Branch (157:5): [True: 17.5k, False: 0]
  |  Branch (157:5): [True: 17.5k, False: 0]
  |  Branch (157:5): [True: 17.5k, False: 0]
  ------------------
  158|  17.5k|    result = 10 * result + digit;
  159|  17.5k|  }
  160|  1.59k|  *number_of_read_digits = i;
  161|  1.59k|  return result;
  162|  1.59k|}
strtod.cc:_ZN17double_conversionL11DiyFpStrtodENS_6VectorIKcEEiPd:
  272|  1.31k|                        double* result) {
  273|  1.31k|  DiyFp input;
  274|  1.31k|  int remaining_decimals;
  275|  1.31k|  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.31k|  const int kDenominatorLog = 3;
  282|  1.31k|  const int kDenominator = 1 << kDenominatorLog;
  283|       |  // Move the remaining decimals into the exponent.
  284|  1.31k|  exponent += remaining_decimals;
  285|  1.31k|  uint64_t error = (remaining_decimals == 0 ? 0 : kDenominator / 2);
  ------------------
  |  Branch (285:21): [True: 981, False: 334]
  ------------------
  286|       |
  287|  1.31k|  int old_e = input.e();
  288|  1.31k|  input.Normalize();
  289|  1.31k|  error <<= old_e - input.e();
  290|       |
  291|  1.31k|  DOUBLE_CONVERSION_ASSERT(exponent <= PowersOfTenCache::kMaxDecimalExponent);
  ------------------
  |  |   47|  1.31k|    assert(condition)
  ------------------
  |  Branch (291:3): [True: 1.31k, False: 0]
  ------------------
  292|  1.31k|  if (exponent < PowersOfTenCache::kMinDecimalExponent) {
  ------------------
  |  Branch (292:7): [True: 0, False: 1.31k]
  ------------------
  293|      0|    *result = 0.0;
  294|      0|    return true;
  295|      0|  }
  296|  1.31k|  DiyFp cached_power;
  297|  1.31k|  int cached_decimal_exponent;
  298|  1.31k|  PowersOfTenCache::GetCachedPowerForDecimalExponent(exponent,
  299|  1.31k|                                                     &cached_power,
  300|  1.31k|                                                     &cached_decimal_exponent);
  301|       |
  302|  1.31k|  if (cached_decimal_exponent != exponent) {
  ------------------
  |  Branch (302:7): [True: 1.21k, False: 104]
  ------------------
  303|  1.21k|    int adjustment_exponent = exponent - cached_decimal_exponent;
  304|  1.21k|    DiyFp adjustment_power = AdjustmentPowerOfTen(adjustment_exponent);
  305|  1.21k|    input.Multiply(adjustment_power);
  306|  1.21k|    if (kMaxUint64DecimalDigits - buffer.length() >= adjustment_exponent) {
  ------------------
  |  Branch (306:9): [True: 519, False: 692]
  ------------------
  307|       |      // The product of input with the adjustment power fits into a 64 bit
  308|       |      // integer.
  309|    519|      DOUBLE_CONVERSION_ASSERT(DiyFp::kSignificandSize == 64);
  ------------------
  |  |   47|    519|    assert(condition)
  ------------------
  |  Branch (309:7): [True: 519, Folded]
  ------------------
  310|    692|    } else {
  311|       |      // The adjustment power is exact. There is hence only an error of 0.5.
  312|    692|      error += kDenominator / 2;
  313|    692|    }
  314|  1.21k|  }
  315|       |
  316|  1.31k|  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.31k|  int error_b = kDenominator / 2;
  323|  1.31k|  int error_ab = (error == 0 ? 0 : 1);  // We round up to 1.
  ------------------
  |  Branch (323:19): [True: 603, False: 712]
  ------------------
  324|  1.31k|  int fixed_error = kDenominator / 2;
  325|  1.31k|  error += error_b + error_ab + fixed_error;
  326|       |
  327|  1.31k|  old_e = input.e();
  328|  1.31k|  input.Normalize();
  329|  1.31k|  error <<= old_e - input.e();
  330|       |
  331|       |  // See if the double's significand changes if we add/subtract the error.
  332|  1.31k|  int order_of_magnitude = DiyFp::kSignificandSize + input.e();
  333|  1.31k|  int effective_significand_size =
  334|  1.31k|      Double::SignificandSizeForOrderOfMagnitude(order_of_magnitude);
  335|  1.31k|  int precision_digits_count =
  336|  1.31k|      DiyFp::kSignificandSize - effective_significand_size;
  337|  1.31k|  if (precision_digits_count + kDenominatorLog >= DiyFp::kSignificandSize) {
  ------------------
  |  Branch (337:7): [True: 54, False: 1.26k]
  ------------------
  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|     54|    int shift_amount = (precision_digits_count + kDenominatorLog) -
  342|     54|        DiyFp::kSignificandSize + 1;
  343|     54|    input.set_f(input.f() >> shift_amount);
  344|     54|    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|     54|    error = (error >> shift_amount) + 1 + kDenominator;
  348|     54|    precision_digits_count -= shift_amount;
  349|     54|  }
  350|       |  // We use uint64_ts now. This only works if the DiyFp uses uint64_ts too.
  351|  1.31k|  DOUBLE_CONVERSION_ASSERT(DiyFp::kSignificandSize == 64);
  ------------------
  |  |   47|  1.31k|    assert(condition)
  ------------------
  |  Branch (351:3): [True: 1.31k, Folded]
  ------------------
  352|  1.31k|  DOUBLE_CONVERSION_ASSERT(precision_digits_count < 64);
  ------------------
  |  |   47|  1.31k|    assert(condition)
  ------------------
  |  Branch (352:3): [True: 1.31k, False: 0]
  ------------------
  353|  1.31k|  uint64_t one64 = 1;
  354|  1.31k|  uint64_t precision_bits_mask = (one64 << precision_digits_count) - 1;
  355|  1.31k|  uint64_t precision_bits = input.f() & precision_bits_mask;
  356|  1.31k|  uint64_t half_way = one64 << (precision_digits_count - 1);
  357|  1.31k|  precision_bits *= kDenominator;
  358|  1.31k|  half_way *= kDenominator;
  359|  1.31k|  DiyFp rounded_input(input.f() >> precision_digits_count,
  360|  1.31k|                      input.e() + precision_digits_count);
  361|  1.31k|  if (precision_bits >= half_way + error) {
  ------------------
  |  Branch (361:7): [True: 263, False: 1.05k]
  ------------------
  362|    263|    rounded_input.set_f(rounded_input.f() + 1);
  363|    263|  }
  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.31k|  *result = Double(rounded_input).value();
  369|  1.31k|  if (half_way - error < precision_bits && precision_bits < half_way + error) {
  ------------------
  |  Branch (369:7): [True: 1.02k, False: 292]
  |  Branch (369:44): [True: 760, False: 263]
  ------------------
  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|    760|    return false;
  374|    760|  } else {
  375|    555|    return true;
  376|    555|  }
  377|  1.31k|}
strtod.cc:_ZN17double_conversionL9ReadDiyFpENS_6VectorIKcEEPNS_5DiyFpEPi:
  171|  1.31k|                      int* remaining_decimals) {
  172|  1.31k|  int read_digits;
  173|  1.31k|  uint64_t significand = ReadUint64(buffer, &read_digits);
  174|  1.31k|  if (buffer.length() == read_digits) {
  ------------------
  |  Branch (174:7): [True: 981, False: 334]
  ------------------
  175|    981|    *result = DiyFp(significand, 0);
  176|    981|    *remaining_decimals = 0;
  177|    981|  } else {
  178|       |    // Round the significand.
  179|    334|    if (buffer[read_digits] >= '5') {
  ------------------
  |  Branch (179:9): [True: 99, False: 235]
  ------------------
  180|     99|      significand++;
  181|     99|    }
  182|       |    // Compute the binary exponent.
  183|    334|    int exponent = 0;
  184|    334|    *result = DiyFp(significand, exponent);
  185|    334|    *remaining_decimals = buffer.length() - read_digits;
  186|    334|  }
  187|  1.31k|}
strtod.cc:_ZN17double_conversionL20AdjustmentPowerOfTenEi:
  247|  1.21k|static DiyFp AdjustmentPowerOfTen(int exponent) {
  248|  1.21k|  DOUBLE_CONVERSION_ASSERT(0 < exponent);
  ------------------
  |  |   47|  1.21k|    assert(condition)
  ------------------
  |  Branch (248:3): [True: 1.21k, False: 0]
  ------------------
  249|  1.21k|  DOUBLE_CONVERSION_ASSERT(exponent < PowersOfTenCache::kDecimalExponentDistance);
  ------------------
  |  |   47|  1.21k|    assert(condition)
  ------------------
  |  Branch (249:3): [True: 1.21k, False: 0]
  ------------------
  250|       |  // Simply hardcode the remaining powers for the given decimal exponent
  251|       |  // distance.
  252|  1.21k|  DOUBLE_CONVERSION_ASSERT(PowersOfTenCache::kDecimalExponentDistance == 8);
  ------------------
  |  |   47|  1.21k|    assert(condition)
  ------------------
  |  Branch (252:3): [True: 1.21k, Folded]
  ------------------
  253|  1.21k|  switch (exponent) {
  254|    182|    case 1: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xa0000000, 00000000), -60);
  ------------------
  |  |  195|    182|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (254:5): [True: 182, False: 1.02k]
  ------------------
  255|    100|    case 2: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xc8000000, 00000000), -57);
  ------------------
  |  |  195|    100|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (255:5): [True: 100, False: 1.11k]
  ------------------
  256|    115|    case 3: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xfa000000, 00000000), -54);
  ------------------
  |  |  195|    115|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (256:5): [True: 115, False: 1.09k]
  ------------------
  257|    397|    case 4: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0x9c400000, 00000000), -50);
  ------------------
  |  |  195|    397|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (257:5): [True: 397, False: 814]
  ------------------
  258|    145|    case 5: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xc3500000, 00000000), -47);
  ------------------
  |  |  195|    145|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (258:5): [True: 145, False: 1.06k]
  ------------------
  259|    111|    case 6: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0xf4240000, 00000000), -44);
  ------------------
  |  |  195|    111|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (259:5): [True: 111, False: 1.10k]
  ------------------
  260|    161|    case 7: return DiyFp(DOUBLE_CONVERSION_UINT64_2PART_C(0x98968000, 00000000), -40);
  ------------------
  |  |  195|    161|#define DOUBLE_CONVERSION_UINT64_2PART_C(a, b) (((static_cast<uint64_t>(a) << 32) + 0x##b##u))
  ------------------
  |  Branch (260:5): [True: 161, False: 1.05k]
  ------------------
  261|      0|    default:
  ------------------
  |  Branch (261:5): [True: 0, False: 1.21k]
  ------------------
  262|      0|      DOUBLE_CONVERSION_UNREACHABLE();
  ------------------
  |  |   77|      0|#define DOUBLE_CONVERSION_UNREACHABLE()   (abort())
  ------------------
  263|  1.21k|  }
  264|  1.21k|}
strtod.cc:_ZN17double_conversionL22CompareBufferWithDiyFpENS_6VectorIKcEEiNS_5DiyFpE:
  390|    759|                                  DiyFp diy_fp) {
  391|    759|  DOUBLE_CONVERSION_ASSERT(buffer.length() + exponent <= kMaxDecimalPower + 1);
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (391:3): [True: 759, False: 0]
  ------------------
  392|    759|  DOUBLE_CONVERSION_ASSERT(buffer.length() + exponent > kMinDecimalPower);
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (392:3): [True: 759, False: 0]
  ------------------
  393|    759|  DOUBLE_CONVERSION_ASSERT(buffer.length() <= kMaxSignificantDecimalDigits);
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (393:3): [True: 759, False: 0]
  ------------------
  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|    759|  DOUBLE_CONVERSION_ASSERT(((kMaxDecimalPower + 1) * 333 / 100) < Bignum::kMaxSignificantBits);
  ------------------
  |  |   47|    759|    assert(condition)
  ------------------
  |  Branch (398:3): [True: 759, Folded]
  ------------------
  399|    759|  Bignum buffer_bignum;
  400|    759|  Bignum diy_fp_bignum;
  401|    759|  buffer_bignum.AssignDecimalString(buffer);
  402|    759|  diy_fp_bignum.AssignUInt64(diy_fp.f());
  403|    759|  if (exponent >= 0) {
  ------------------
  |  Branch (403:7): [True: 424, False: 335]
  ------------------
  404|    424|    buffer_bignum.MultiplyByPowerOfTen(exponent);
  405|    424|  } else {
  406|    335|    diy_fp_bignum.MultiplyByPowerOfTen(-exponent);
  407|    335|  }
  408|    759|  if (diy_fp.e() > 0) {
  ------------------
  |  Branch (408:7): [True: 401, False: 358]
  ------------------
  409|    401|    diy_fp_bignum.ShiftLeft(diy_fp.e());
  410|    401|  } else {
  411|    358|    buffer_bignum.ShiftLeft(-diy_fp.e());
  412|    358|  }
  413|    759|  return Bignum::Compare(buffer_bignum, diy_fp_bignum);
  414|    759|}

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

_ZN17double_conversion7BitCastIdmEET_RKT0_:
  395|  3.25k|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.25k|#if __cplusplus >= 201103L
  399|  3.25k|  static_assert(sizeof(Dest) == sizeof(Source),
  400|  3.25k|                "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.25k|  Dest dest;
  407|  3.25k|  memmove(&dest, &source, sizeof(dest));
  408|  3.25k|  return dest;
  409|  3.25k|}
_ZN17double_conversion6VectorIKcEC2EPS1_i:
  252|  3.71k|  Vector(T* data, int len) : start_(data), length_(len) {
  253|       |    DOUBLE_CONVERSION_ASSERT(len == 0 || (len > 0 && data != DOUBLE_CONVERSION_NULLPTR));
  ------------------
  |  |   47|  3.71k|    assert(condition)
  ------------------
  |  Branch (253:5): [True: 3.56k, False: 0]
  |  Branch (253:5): [True: 3.56k, False: 0]
  |  Branch (253:5): [True: 152, False: 3.56k]
  |  Branch (253:5): [True: 3.71k, False: 0]
  ------------------
  254|  3.71k|  }
_ZNK17double_conversion6VectorIKcEixEi:
  275|   225k|  T& operator[](int index) const {
  276|   225k|    DOUBLE_CONVERSION_ASSERT(0 <= index && index < length_);
  ------------------
  |  |   47|   225k|    assert(condition)
  ------------------
  |  Branch (276:5): [True: 225k, False: 0]
  |  Branch (276:5): [True: 225k, False: 0]
  |  Branch (276:5): [True: 225k, False: 0]
  ------------------
  277|   225k|    return start_[index];
  278|   225k|  }
_ZN17double_conversion6VectorIKcE9SubVectorEii:
  258|  1.78k|  Vector<T> SubVector(int from, int to) {
  259|  1.78k|    DOUBLE_CONVERSION_ASSERT(to <= length_);
  ------------------
  |  |   47|  1.78k|    assert(condition)
  ------------------
  |  Branch (259:5): [True: 1.78k, False: 0]
  ------------------
  260|  1.78k|    DOUBLE_CONVERSION_ASSERT(from < to);
  ------------------
  |  |   47|  1.78k|    assert(condition)
  ------------------
  |  Branch (260:5): [True: 1.78k, False: 0]
  ------------------
  261|  1.78k|    DOUBLE_CONVERSION_ASSERT(0 <= from);
  ------------------
  |  |   47|  1.78k|    assert(condition)
  ------------------
  |  Branch (261:5): [True: 1.78k, False: 0]
  ------------------
  262|  1.78k|    return Vector<T>(start() + from, to - from);
  263|  1.78k|  }
_ZNK17double_conversion6VectorIKcE5startEv:
  272|  1.85k|  T* start() const { return start_; }
_ZNK17double_conversion6VectorIKcE6lengthEv:
  266|   166k|  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.02k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
   24|  3.02k|  StringToDoubleConverter converter(
   25|  3.02k|      StringToDoubleConverter::ALLOW_HEX |
   26|  3.02k|          StringToDoubleConverter::ALLOW_OCTALS |
   27|  3.02k|          StringToDoubleConverter::ALLOW_TRAILING_JUNK |
   28|  3.02k|          StringToDoubleConverter::ALLOW_LEADING_SPACES |
   29|  3.02k|          StringToDoubleConverter::ALLOW_TRAILING_SPACES |
   30|  3.02k|          StringToDoubleConverter::ALLOW_SPACES_AFTER_SIGN |
   31|  3.02k|          StringToDoubleConverter::ALLOW_CASE_INSENSIBILITY |
   32|  3.02k|          StringToDoubleConverter::ALLOW_HEX_FLOATS,
   33|  3.02k|      /*empty_string_value=*/0.0,
   34|  3.02k|      /*junk_string_value=*/0.0, "inf", "nan");
   35|  3.02k|  int num_digits_unused;
   36|  3.02k|  converter.StringToDouble(reinterpret_cast<const char*>(data), size,
   37|  3.02k|                           &num_digits_unused);
   38|  3.02k|  return 0;
   39|  3.02k|}