Integrating the QuicStreamFactory into the network stack.

net/quic/quic_utils.cc

 // 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.
 
 #include "net/quic/quic_utils.h"
 
 #include "base/logging.h"
 #include "base/port.h"
 
 namespace net {
 
 // static
 size_t QuicUtils::StreamFramePacketOverhead(int num_frames) {
   // TODO(jar): Use sizeof(some name).
   return kPacketHeaderSize +
          1 +   // frame count
          (1 +  // 8 bit type
           2 +  // 16 bit length
           kMinStreamFrameLength) * num_frames;
 }
 
-// TODO(jar): put into an anonymous namespage.
-// The following two constants are defined as part of the hash algorithm.
-// 309485009821345068724781371
-static uint128 kPrime(16777216, 315);
-// 14406626329776981559649562966706236762
-static uint128 kOffset(GG_UINT64_C(780984778246553632),
-                       GG_UINT64_C(4400696054689967450));
+uint128 QuicUtils::FNV1a_128_Hash(const char* data, int len) {
+  // The following two constants are defined as part of the hash algorithm.
+  // 309485009821345068724781371
+  const uint128 kPrime(16777216, 315);
+  // 14406626329776981559649562966706236762
+  const uint128 kOffset(GG_UINT64_C(780984778246553632),
+                        GG_UINT64_C(4400696054689967450));
 
-uint128 QuicUtils::FNV1a_128_Hash(const char* data, int len) {
   const uint8* octets = reinterpret_cast<const uint8*>(data);
 
   uint128 hash = kOffset;
 
   for (int i = 0; i < len; ++i) {
     hash  = hash ^ uint128(0, octets[i]);
     hash = hash * kPrime;
   }
 
   return hash;
@@ skipping 30 matching lines @@
     RETURN_STRING_LITERAL(QUIC_INVALID_STREAM_ID);
     RETURN_STRING_LITERAL(QUIC_TOO_MANY_OPEN_STREAMS);
     RETURN_STRING_LITERAL(QUIC_CONNECTION_TIMED_OUT);
     // Intentionally have no default case, so we'll break the build
     // if we add errors and don't put them here.
   }
   return "";
 }
 
 }  // namespace net