Deprecate --gfe2_reloadable_flag_quic_utils_use_fast_incremental_hash.

net/quic/quic_utils_test.cc

 // Copyright (c) 2013 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/quic/quic_utils.h"
 
 #include "net/quic/crypto/crypto_protocol.h"
 #include "net/quic/quic_flags.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ skipping 157 matching lines @@
   // kPrime = 309485009821345068724781371
   const uint128 kPrime(16777216, 315);
   const uint8_t* octets = reinterpret_cast<const uint8_t*>(data);
   for (size_t i = 0; i < len; ++i) {
     hash = hash ^ uint128(0, octets[i]);
     hash = hash * kPrime;
   }
   return hash;
 }
 
-TEST(QuicUtilsHashTest, ReferenceTestSlow) {
-  FLAGS_quic_utils_use_fast_incremental_hash = false;
+TEST(QuicUtilsHashTest, ReferenceTest) {
   std::vector<uint8_t> data(32);
   for (size_t i = 0; i < data.size(); ++i) {
     data[i] = i % 255;
-  }
-  EXPECT_EQ(IncrementalHashReference(data.data(), data.size()),
-            QuicUtils::FNV1a_128_Hash(
-                reinterpret_cast<const char*>(data.data()), data.size()));
-}
-
-TEST(QuicUtilsHashTest, ReferenceTestFast) {
-  FLAGS_quic_utils_use_fast_incremental_hash = true;
-  std::vector<uint8_t> data(32);
-  for (size_t i = 0; i < data.size(); ++i) {
-    data[i] = i % 255;
   }
   EXPECT_EQ(IncrementalHashReference(data.data(), data.size()),
             QuicUtils::FNV1a_128_Hash(
                 reinterpret_cast<const char*>(data.data()), data.size()));
 }
 
 }  // namespace
 }  // namespace test
 }  // namespace net