Update from https://crrev.com/316786

net/quic/quic_utils.h

Index: net/quic/quic_utils.h
diff --git a/net/quic/quic_utils.h b/net/quic/quic_utils.h
index 2c34ec4245b0c085c6ad760415dc6002f3611282..5e76a0da43682b294c4fd1c459bd123e37619975 100644
--- a/net/quic/quic_utils.h
+++ b/net/quic/quic_utils.h
@@ -28,7 +28,18 @@ class NET_EXPORT_PRIVATE QuicUtils {
 
   // returns the 128 bit FNV1a hash of the data.  See
   // http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param
-  static uint128 FNV1a_128_Hash(const char* data, int len);
+  static uint128 FNV1a_128_Hash(const char* data1, int len1);
+
+  // returns the 128 bit FNV1a hash of the two sequences of data.  See
+  // http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param
+  static uint128 FNV1a_128_Hash_Two(const char* data1,
+                                    int len1,
+                                    const char* data2,
+                                    int len2);
+
+  // returns the 128 bit FNV1a hash of the |data|, starting with the
+  // previous hash.
+  static uint128 IncrementalHash(uint128 hash, const char* data, size_t len);
 
   // FindMutualTag sets |out_result| to the first tag in the priority list that
   // is also in the other list and returns true. If there is no intersection it