Move platform abstraction to base library

test/cctest/test-fast-dtoa.cc

 // Copyright 2006-2008 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 11 matching lines @@
 // 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.
 
 #include <stdlib.h>
 
 #include "src/v8.h"
 
+#include "src/base/platform/platform.h"
 #include "src/diy-fp.h"
 #include "src/double.h"
 #include "src/fast-dtoa.h"
-#include "src/platform.h"
 #include "test/cctest/cctest.h"
 #include "test/cctest/gay-precision.h"
 #include "test/cctest/gay-shortest.h"
 
 using namespace v8::internal;
 
 static const int kBufferSize = 100;
 
 
 // Removes trailing '0' digits.
@@ skipping 238 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);
 }