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

net/base/dnssec_chain_verifier.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 "net/base/dnssec_chain_verifier.h"
 
 #include "base/logging.h"
 #include "base/memory/scoped_ptr.h"
 #include "base/sha1.h"
-#include "base/sha2.h"
 #include "base/string_util.h"
+#include "crypto/sha2.h"
 #include "net/base/dns_util.h"
 #include "net/base/dnssec_keyset.h"
 
 // We don't have a location for the spec yet, so we'll include it here until it
 // finds a better home.
 
 /*
 When connecting to a host www.example.com, www.example.com may present a certificate which includes a DNSSEC chain embedded in it. The aim of the embedded chain is to prove that the fingerprint of the public key is valid DNSSEC data. This is achieved by proving a CERT record for the target domain.
 
 Initially, the target domain is constructed by prepending _ssl. For example, the initial target domain for www.example.com is _ssl.www.example.com.
@@ skipping 487 matching lines @@
 //   digest_type: see http://tools.ietf.org/html/rfc4034#appendix-A.2
 //   keyid: the key's id
 //   algorithm: see http://tools.ietf.org/html/rfc4034#appendix-A.1
 bool DNSSECChainVerifier::DigestKey(base::StringPiece* out,
                                     const base::StringPiece& name,
                                     const base::StringPiece& dnskey,
                                     uint8 digest_type,
                                     uint16 keyid,
                                     uint8 algorithm) {
   std::string temp;
-  uint8 temp2[base::SHA256_LENGTH];
+  uint8 temp2[crypto::SHA256_LENGTH];
   const uint8* digest;
   unsigned digest_len;
 
   std::string input = name.as_string() + dnskey.as_string();
 
   if (digest_type == kDNSSEC_SHA1) {
     temp = base::SHA1HashString(input);
     digest = reinterpret_cast<const uint8*>(temp.data());
     digest_len = base::SHA1_LENGTH;
   } else if (digest_type == kDNSSEC_SHA256) {
-    base::SHA256HashString(input, temp2, sizeof(temp2));
+    crypto::SHA256HashString(input, temp2, sizeof(temp2));
     digest = temp2;
     digest_len = sizeof(temp2);
   } else {
     return false;
   }
 
   uint8* output = static_cast<uint8*>(malloc(4 + digest_len));
   scratch_pool_.push_back(output);
   output[0] = static_cast<uint8>(keyid >> 8);
   output[1] = static_cast<uint8>(keyid);
@@ skipping 260 matching lines @@
   base::StringPiece name;
   if (!ReadName(&name))
     return BAD_DATA;
 
   rrdatas->resize(1);
   (*rrdatas)[0] = name;
   return OK;
 }
 
 }  // namespace net