Dtoa for fixed notation.

src/fixed-dtoa.cc

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 85 matching lines @@
       return result;
     }
   }
 
   bool IsZero() const {
     return high_bits_ == 0 && low_bits_ == 0;
   }
 
   int BitAt(int position) {
     if (position >= 64) {
-      return (high_bits_ >> (position - 64)) & 1;
+      return static_cast<int>(high_bits_ >> (position - 64)) & 1;
     } else {
-      return (low_bits_ >> position) & 1;
+      return static_cast<int>(low_bits_ >> position) & 1;
     }
   }
 
  private:
   static const uint64_t kMask32 = 0xFFFFFFFF;
   // Value == (high_bits_ << 64) + low_bits_
   uint64_t high_bits_;
   uint64_t low_bits_;
 };
 
@@ skipping 20 matching lines @@
     buffer[(*length) + number_length] = '0' + digit;
     number_length++;
   }
   // Exchange the digits.
   int i = *length;
   int j = *length + number_length - 1;
   while (i < j) {
     char tmp = buffer[i];
     buffer[i] = buffer[j];
     buffer[j] = tmp;
-    i++; j--;
+    i++;
+    j--;
   }
   *length += number_length;
 }
 
 
 static void FillDigits64FixedLength(uint64_t number, int requested_length,
                                     Vector<char> buffer, int* length) {
   const uint32_t kTen7 = 10000000;
   // For efficiency cut the number into 3 uint32_t parts, and print those.
-  uint32_t part2 = number % kTen7;
+  uint32_t part2 = static_cast<uint32_t>(number % kTen7);
   number /= kTen7;
-  uint32_t part1 = number % kTen7;
-  uint32_t part0 = number / kTen7;
+  uint32_t part1 = static_cast<uint32_t>(number % kTen7);
+  uint32_t part0 = static_cast<uint32_t>(number / kTen7);
 
   FillDigits32FixedLength(part0, 3, buffer, length);
   FillDigits32FixedLength(part1, 7, buffer, length);
   FillDigits32FixedLength(part2, 7, buffer, length);
 }
 
 
 static void FillDigits64(uint64_t number, Vector<char> buffer, int* length) {
   const uint32_t kTen7 = 10000000;
   // For efficiency cut the number into 3 uint32_t parts, and print those.
-  uint32_t part2 = number % kTen7;
+  uint32_t part2 = static_cast<uint32_t>(number % kTen7);
   number /= kTen7;
-  uint32_t part1 = number % kTen7;
-  uint32_t part0 = number / kTen7;
+  uint32_t part1 = static_cast<uint32_t>(number % kTen7);
+  uint32_t part0 = static_cast<uint32_t>(number / kTen7);
 
   if (part0 != 0) {
     FillDigits32(part0, buffer, length);
     FillDigits32FixedLength(part1, 7, buffer, length);
     FillDigits32FixedLength(part2, 7, buffer, length);
   } else if (part1 != 0) {
     FillDigits32(part1, buffer, length);
     FillDigits32FixedLength(part2, 7, buffer, length);
   } else {
     FillDigits32(part2, buffer, length);
@@ skipping 55 matching lines @@
     int point = -exponent;
     for (int i = 0; i < fractional_count; ++i) {
       if (fractionals == 0) break;
       // Instead of multiplying by 10 we multiply by 5 and adjust the point
       // location. This way the fractionals variable will not overflow.
       // Invariant at the beginning of the loop: fractionals < 2^point.
       // Initially we have: point <= 64 and fractionals < 2^56
       // After each iteration the point is decremented by one.
       // Note that 5^3 = 125 < 128 = 2^7.
       // Therefore three iterations of this loop will not overflow fractionals
-      // (even without the subtraction at the end of the loop body). At this time
-      // point will satisfy point <= 61 and therefore fractionals < 2^point and
-      // any further multiplication of fractionals by 5 will not overflow.
+      // (even without the subtraction at the end of the loop body). At this
+      // time point will satisfy point <= 61 and therefore fractionals < 2^point
+      // and any further multiplication of fractionals by 5 will not overflow.
       fractionals *= 5;
       point--;
       int digit = static_cast<int>(fractionals >> point);
       buffer[*length] = '0' + digit;
       (*length)++;
       fractionals -= static_cast<uint64_t>(digit) << point;
     }
     // If the first bit after the point is set we have to round up.
     if (((fractionals >> (point - 1)) & 1) == 1) {
       RoundUp(buffer, length, decimal_point);
@@ skipping 66 matching lines @@
     // We know that v = significand * 2^exponent.
     // And the exponent > 11.
     // We simplify the task by dividing v by 10^17.
     // The quotient delivers the first digits, and the remainder fits into a 64
     // bit number.
     // Dividing by 10^17 is equivalent to dividing by 5^17*2^17.
     const uint64_t kFive17 = V8_2PART_UINT64_C(0xB1, A2BC2EC5);  // 5^17
     uint64_t divisor = kFive17;
     int divisor_power = 17;
     uint64_t dividend = significand;
-    uint64_t quotient;
+    uint32_t quotient;
     uint64_t remainder;
     // Let v = f * 2^e with f == significand and e == exponent.
     // Then need q (quotient) and r (remainder) as follows:
     //   v            = q * 10^17       + r
     //   f * 2^e      = q * 10^17       + r
     //   f * 2^e      = q * 5^17 * 2^17 + r
     // If e > 17 then
     //   f * 2^(e-17) = q * 5^17        + r/2^17
     // else
     //   f  = q * 5^17 * 2^(17-e) + r/2^e
     if (exponent > divisor_power) {
       // We only allow exponents of up to 20 and therefore (17 - e) <= 3
       dividend <<= exponent - divisor_power;
-      quotient = dividend / divisor;
+      quotient = static_cast<uint32_t>(dividend / divisor);
       remainder = (dividend % divisor) << divisor_power;
     } else {
       divisor <<= divisor_power - exponent;
-      quotient = dividend / divisor;
+      quotient = static_cast<uint32_t>(dividend / divisor);
       remainder = (dividend % divisor) << exponent;
     }
     FillDigits32(quotient, buffer, length);
     FillDigits64FixedLength(remainder, divisor_power, buffer, length);
     *decimal_point = *length;
   } else if (exponent >= 0) {
     // 0 <= exponent <= 11
     significand <<= exponent;
     FillDigits64(significand, buffer, length);
     *decimal_point = *length;
@@ skipping 25 matching lines @@
   buffer[*length] = '\0';
   if ((*length) == 0) {
     // The string is empty and the decimal_point thus has no importance. Mimick
     // Gay's dtoa and and set it to -fractional_count.
     *decimal_point = -fractional_count;
   }
   return true;
 }
 
 } }  // namespace v8::internal