Use SHA-1 functions from BoringSSL directly.

net/quic/test_tools/quic_test_utils.h

 // Copyright (c) 2012 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.
 //
 // Common utilities for Quic tests
 
 #ifndef NET_QUIC_TEST_TOOLS_QUIC_TEST_UTILS_H_
 #define NET_QUIC_TEST_TOOLS_QUIC_TEST_UTILS_H_
 
 #include <stddef.h>
@@ skipping 198 matching lines @@
                                    size_t packet_size);
 
 // When constructed, checks that all QUIC flags have their correct default
 // values and when destructed, restores those values.
 class QuicFlagSaver {
  public:
   QuicFlagSaver();
   ~QuicFlagSaver();
 };
 
+// Compute SHA-1 hash of the supplied std::string.
+std::string Sha1Hash(base::StringPiece data);
+
 // Simple random number generator used to compute random numbers suitable
 // for pseudo-randomly dropping packets in tests.  It works by computing
 // the sha1 hash of the current seed, and using the first 64 bits as
 // the next random number, and the next seed.
 class SimpleRandom : public QuicRandom {
  public:
   SimpleRandom() : seed_(0) {}
   ~SimpleRandom() override {}
 
   // Returns a random number in the range [0, kuint64max].
@@ skipping 829 matching lines @@
   iov->iov_base = const_cast<char*>(str.data());
   iov->iov_len = static_cast<size_t>(str.size());
   QuicIOVector quic_iov(iov, 1, str.size());
   return quic_iov;
 }
 
 }  // namespace test
 }  // namespace net
 
 #endif  // NET_QUIC_TEST_TOOLS_QUIC_TEST_UTILS_H_