Rename files containing underscores.

src/cached-powers.h

 // 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 10 matching lines @@
 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #ifndef V8_CACHED_POWERS_H_
 #define V8_CACHED_POWERS_H_
 
-#include "diy_fp.h"
+#include "diy-fp.h"
 
 namespace v8 {
 namespace internal {
 
 struct CachedPower {
   uint64_t significand;
   int16_t binary_exponent;
   int16_t decimal_exponent;
 };
 
 // The following defines implement the interface between this file and the
 // generated 'powers_ten.h'.
 // GRISU_CACHE_NAME(1) contains all possible cached powers.
 // GRISU_CACHE_NAME(i) contains GRISU_CACHE_NAME(1) where only every 'i'th
 // element is kept. More formally GRISU_CACHE_NAME(i) contains the elements j*i
 // with 0 <= j < k with k such that j*k < the size of GRISU_CACHE_NAME(1).
 // The higher 'i' is the fewer elements we use.
 // Given that there are less elements, the exponent-distance between two
 // elements in the cache grows. The variable GRISU_CACHE_MAX_DISTANCE(i) stores
 // the maximum distance between two elements.
 #define GRISU_CACHE_STRUCT CachedPower
 #define GRISU_CACHE_NAME(i) kCachedPowers##i
 #define GRISU_CACHE_MAX_DISTANCE(i) kCachedPowersMaxDistance##i
 #define GRISU_CACHE_OFFSET kCachedPowerOffset
 #define GRISU_UINT64_C V8_2PART_UINT64_C
 // The following include imports the precompiled cached powers.
-#include "powers_ten.h"  // NOLINT
+#include "powers-ten.h"  // NOLINT
 
 static const double kD_1_LOG2_10 = 0.30102999566398114;  //  1 / lg(10)
 
 // We can't use a function since we reference variables depending on the 'i'.
 // This way the compiler is able to see at compile time that only one
 // cache-array variable is used and thus can remove all the others.
 #define COMPUTE_FOR_CACHE(i) \
   if (!found && (gamma - alpha + 1 >= GRISU_CACHE_MAX_DISTANCE(i))) {   \
     int kQ = DiyFp::kSignificandSize;                                   \
     double k = ceiling((alpha - e + kQ - 1) * kD_1_LOG2_10);            \
@@ skipping 41 matching lines @@
 #undef GRISU_REDUCTION
 #undef GRISU_CACHE_STRUCT
 #undef GRISU_CACHE_NAME
 #undef GRISU_CACHE_MAX_DISTANCE
 #undef GRISU_CACHE_OFFSET
 #undef GRISU_UINT64_C
 
 } }  // namespace v8::internal
 
 #endif  // V8_CACHED_POWERS_H_