Rename variables in Bigint file.

runtime/vm/bigint_operations.cc

 // Copyright 2012 Google Inc. All Rights Reserved.
 
 #include "vm/bigint_operations.h"
 
 #include "platform/utils.h"
 
 #include "vm/double_internals.h"
 #include "vm/exceptions.h"
 #include "vm/object_store.h"
 #include "vm/zone.h"
@@ skipping 337 matching lines @@
   }
   ASSERT(required_size == static_cast<intptr_t>(required_size));
   // We will fill the result in the inverse order and then exchange at the end.
   char* result =
       reinterpret_cast<char*>(allocator(static_cast<intptr_t>(required_size)));
   ASSERT(result != NULL);
   int result_pos = 0;
 
   // We divide the input into pieces of ~27 bits which can be efficiently
   // handled.
-  const intptr_t kDivisorValue = 100000000;
-  const int kPowerOfTen = 8;
-  ASSERT(pow(10.0, kPowerOfTen) == kDivisorValue);
-  ASSERT(static_cast<Chunk>(kDivisorValue) < kDigitMaxValue);
-  ASSERT(Smi::IsValid(kDivisorValue));
-  const Bigint& divisor = Bigint::Handle(NewFromInt64(kDivisorValue));
+  const intptr_t kChunkDivisor = 100000000;
+  const int kChunkDigits = 8;
+  ASSERT(pow(10.0, kChunkDigits) == kChunkDivisor);
+  ASSERT(static_cast<Chunk>(kChunkDivisor) < kDigitMaxValue);
+  ASSERT(Smi::IsValid(kChunkDivisor));
+  const Bigint& divisor = Bigint::Handle(NewFromInt64(kChunkDivisor));
 
   // Rest contains the remaining bigint that needs to be printed.
   Bigint& rest = Bigint::Handle(bigint.raw());
   Bigint& quotient = Bigint::Handle();
   Bigint& remainder = Bigint::Handle();
   while (!rest.IsZero()) {
     DivideRemainder(rest, divisor, &quotient, &remainder);
     ASSERT(remainder.Length() <= 1);
     intptr_t part = (remainder.Length() == 1)
         ? static_cast<intptr_t>(remainder.GetChunkAt(0))
         : 0;
-    for (int i = 0; i < kPowerOfTen; i++) {
+    for (int i = 0; i < kChunkDigits; i++) {
       result[result_pos++] = '0' + (part % 10);
       part /= 10;
     }
     ASSERT(part == 0);
     rest = quotient.raw();
   }
   // Move the resulting position back until we don't have any zeroes anymore.
   // This is done so that we can remove all leading zeroes.
   while (result_pos > 1 && result[result_pos - 1] == '0') {
     result_pos--;
@@ skipping 1259 matching lines @@
 int BigintOperations::CountBits(Chunk digit) {
   int result = 0;
   while (digit != 0) {
     digit >>= 1;
     result++;
   }
   return result;
 }
 
 }  // namespace dart