VM: Re-format to use at most one newline between functions

runtime/platform/utils.cc

Index: runtime/platform/utils.cc
diff --git a/runtime/platform/utils.cc b/runtime/platform/utils.cc
index 0dde3c702713eee0fb8c6f92dadd07c425146878..c103385441d058699dc644298539e614f90c90f3 100644
--- a/runtime/platform/utils.cc
+++ b/runtime/platform/utils.cc
@@ -21,7 +21,6 @@ uintptr_t Utils::RoundUpToPowerOfTwo(uintptr_t x) {
   return x + 1;
 }
 
-
 // Implementation is from "Hacker's Delight" by Henry S. Warren, Jr.,
 // figure 5-2, page 66, where the function is called pop.
 int Utils::CountOneBits(uint32_t x) {
@@ -33,7 +32,6 @@ int Utils::CountOneBits(uint32_t x) {
   return static_cast<int>(x & 0x0000003F);
 }
 
-
 // TODO(koda): Compare to flsll call/intrinsic.
 int Utils::HighestBit(int64_t v) {
   uint64_t x = static_cast<uint64_t>((v > 0) ? v : -v);
@@ -63,7 +61,6 @@ int Utils::HighestBit(int64_t v) {
   return r;
 }
 
-
 uint32_t Utils::StringHash(const char* data, int length) {
   // This implementation is based on the public domain MurmurHash
   // version 2.0. It assumes that the underlying CPU can read from
@@ -107,7 +104,6 @@ uint32_t Utils::StringHash(const char* data, int length) {
   return hash;
 }
 
-
 uint32_t Utils::WordHash(intptr_t key) {
   // TODO(iposva): Need to check hash spreading.
   // This example is from http://www.concentric.net/~Ttwang/tech/inthash.htm
@@ -121,5 +117,4 @@ uint32_t Utils::WordHash(intptr_t key) {
   return static_cast<uint32_t>(a);
 }
 
-
 }  // namespace dart