base: export GetBuildTime

base/metrics/field_trial.cc

 // Copyright (c) 2011 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "base/metrics/field_trial.h"
 
+#include "base/build_time.h"
 #include "base/logging.h"
 #include "base/rand_util.h"
 #include "base/sha1.h"
+#include "base/stringprintf.h"
 #include "base/string_util.h"
-#include "base/stringprintf.h"
 #include "base/utf_string_conversions.h"
 
 namespace base {
 
 // static
 const int FieldTrial::kNotFinalized = -1;
 
 // static
 const int FieldTrial::kDefaultGroupNumber = 0;
 
@@ skipping 125 matching lines @@
 
 // static
 void FieldTrial::EnableBenchmarking() {
   DCHECK_EQ(0u, FieldTrialList::GetFieldTrialCount());
   enable_benchmarking_ = true;
 }
 
 FieldTrial::~FieldTrial() {}
 
 // static
-Time FieldTrial::GetBuildTime() {
-  Time integral_build_time;
-  const char* kDateTime = __DATE__ " " __TIME__;
-  bool result = Time::FromString(kDateTime, &integral_build_time);
-  DCHECK(result);
-  return integral_build_time;
-}
-
-// static
 double FieldTrial::HashClientId(const std::string& client_id,
                                 const std::string& trial_name) {
   // SHA-1 is designed to produce a uniformly random spread in its output space,
   // even for nearly-identical inputs, so it helps massage whatever client_id
   // and trial_name we get into something with a uniform distribution, which
   // is desirable so that we don't skew any part of the 0-100% spectrum.
   std::string input(client_id + trial_name);
   unsigned char sha1_hash[kSHA1Length];
   SHA1HashBytes(reinterpret_cast<const unsigned char*>(input.c_str()),
                 input.size(),
@@ skipping 210 matching lines @@
 }
 
 FieldTrial* FieldTrialList::PreLockedFind(const std::string& name) {
   RegistrationList::iterator it = registered_.find(name);
   if (registered_.end() == it)
     return NULL;
   return it->second;
 }
 
 }  // namespace base