Move crypto files out of base, to a top level directory.

chrome/browser/safe_browsing/filter_false_positive_perftest.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.
 //
 // This test performs a series false positive checks using a list of URLs
 // against a known set of SafeBrowsing data.
 //
 // It uses a normal SafeBrowsing database to create a bloom filter where it
 // looks up all the URLs in the url file. A URL that has a prefix found in the
 // bloom filter and found in the database is considered a hit: a valid lookup
@@ skipping 46 matching lines @@
 #include <vector>
 
 #include "app/sql/statement.h"
 #include "base/command_line.h"
 #include "base/file_path.h"
 #include "base/file_util.h"
 #include "base/logging.h"
 #include "base/memory/scoped_ptr.h"
 #include "base/path_service.h"
 #include "base/rand_util.h"
-#include "base/sha2.h"
 #include "base/string_number_conversions.h"
 #include "base/string_util.h"
 #include "base/time.h"
+#include "crypto/sha2.h"
 #include "chrome/browser/safe_browsing/bloom_filter.h"
 #include "chrome/browser/safe_browsing/safe_browsing_util.h"
 #include "chrome/common/chrome_paths.h"
 #include "googleurl/src/gurl.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 using base::Time;
 using base::TimeDelta;
 
 namespace {
@@ skipping 88 matching lines @@
   } else {
     safe_browsing_util::GenerateHostsToCheck(url_check, &hosts);
   }
 
   std::vector<std::string> paths;
   safe_browsing_util::GeneratePathsToCheck(url_check, &paths);
 
   for (size_t i = 0; i < hosts.size(); ++i) {
     for (size_t j = 0; j < paths.size(); ++j) {
       SBPrefix prefix;
-      base::SHA256HashString(hosts[i] + paths[j], &prefix, sizeof(prefix));
+      crypto::SHA256HashString(hosts[i] + paths[j], &prefix, sizeof(prefix));
       if (bloom_filter->Exists(prefix))
         prefixes->push_back(prefix);
     }
   }
 
   return hosts.size() * paths.size();
 }
 
 // Binary search of sorted prefixes.
 bool IsPrefixInDatabase(SBPrefix prefix,
@@ skipping 164 matching lines @@
 
   std::cout << "Time results for checks: " << num_checks
             << ", prefixes: "              << prefix_list.size()
             << ", populate time (ms): "    << populate.InMilliseconds()
             << ", check time (ms): "       << check.InMilliseconds()
             << ", hits: "                  << hits
             << ", per-populate (us): "     << time_per_insert
             << ", per-check (us): "        << time_per_check
             << std::endl;
 }