Fix X64 Windows compilation.

test/cctest/test-fast-dtoa.cc

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #include <stdlib.h>
 
 #include "v8.h"
 
 #include "platform.h"
 #include "cctest.h"
 #include "diy-fp.h"
 #include "double.h"
 #include "fast-dtoa.h"
 #include "gay-precision.h"
 #include "gay-shortest.h"
 
 using namespace v8::internal;
 
 static const int kBufferSize = 100;
 
 
 // Removes trailing '0' digits.
 static void TrimRepresentation(Vector<char> representation) {
-  int len = strlen(representation.start());
+  int len = StrLength(representation.start());
   int i;
   for (i = len - 1; i >= 0; --i) {
     if (representation[i] != '0') break;
   }
   representation[i + 1] = '\0';
 }
 
 
 TEST(FastDtoaShortestVariousDoubles) {
   char buffer_container[kBufferSize];
@@ skipping 226 matching lines @@
     CHECK_EQ(current_test.representation, buffer.start());
   }
   // The precomputed numbers contain many entries with many requested
   // digits. These have a high failure rate and we therefore expect a lower
   // success rate than for the shortest representation.
   CHECK_GT(succeeded*1.0/total, 0.85);
   // However with less than 15 digits almost the algorithm should almost always
   // succeed.
   CHECK_GT(succeeded_15*1.0/total_15, 0.9999);
 }