Add the client address to the Public Reset packet.

net/quic/crypto/crypto_protocol.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.
 
 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_
 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_
 
-#include <map>
 #include <string>
-#include <vector>
 
 #include "net/base/net_export.h"
 #include "net/quic/quic_protocol.h"
 
 // Version and Crypto tags are written to the wire with a big-endian
 // representation of the name of the tag.  For example
 // the client hello tag (CHLO) will be written as the
 // following 4 bytes: 'C' 'H' 'L' 'O'.  Since it is
 // stored in memory as a little endian uint32, we need
 // to reverse the order of the bytes.
 //
 // We use a macro to ensure that no static initialisers are created. Use the
 // MakeQuicTag function in normal code.
 #define TAG(a, b, c, d) ((d << 24) + (c << 16) + (b << 8) + a)
 
 namespace net {
 
 typedef std::string ServerConfigID;
-typedef std::map<QuicTag, std::string> QuicTagValueMap;
 
 const QuicTag kCHLO = TAG('C', 'H', 'L', 'O');  // Client hello
 const QuicTag kSHLO = TAG('S', 'H', 'L', 'O');  // Server hello
 const QuicTag kSCFG = TAG('S', 'C', 'F', 'G');  // Server config
 const QuicTag kREJ  = TAG('R', 'E', 'J', '\0'); // Reject
 const QuicTag kCETV = TAG('C', 'E', 'T', 'V');  // Client encrypted tag-value
                                                 // pairs
+const QuicTag kPRST = TAG('P', 'R', 'S', 'T');  // Public reset
 
 // Key exchange methods
 const QuicTag kP256 = TAG('P', '2', '5', '6');  // ECDH, Curve P-256
 const QuicTag kC255 = TAG('C', '2', '5', '5');  // ECDH, Curve25519
 
 // AEAD algorithms
 const QuicTag kNULL = TAG('N', 'U', 'L', 'N');  // null algorithm
 const QuicTag kAESG = TAG('A', 'E', 'S', 'G');  // AES128 + GCM-12
 
 // Congestion control feedback types
@@ skipping 31 matching lines @@
                                                 // indication
 const QuicTag kPUBS = TAG('P', 'U', 'B', 'S');  // Public key values
 const QuicTag kSCID = TAG('S', 'C', 'I', 'D');  // Server config id
 const QuicTag kORBT = TAG('O', 'B', 'I', 'T');  // Server orbit.
 const QuicTag kPDMD = TAG('P', 'D', 'M', 'D');  // Proof demand.
 const QuicTag kPROF = TAG('P', 'R', 'O', 'F');  // Proof (signature).
 const QuicTag kCCS  = TAG('C', 'C', 'S', 0);    // Common certificate set
 const QuicTag kCCRT = TAG('C', 'C', 'R', 'T');  // Cached certificate
 const QuicTag kEXPY = TAG('E', 'X', 'P', 'Y');  // Expiry
 
+// Server hello tags
+const QuicTag kCADR = TAG('C', 'A', 'D', 'R');  // Client IP address and port
+
 // CETV tags
 const QuicTag kCIDK = TAG('C', 'I', 'D', 'K');  // ChannelID key
 const QuicTag kCIDS = TAG('C', 'I', 'D', 'S');  // ChannelID signature
 
-// Server hello tags
-const QuicTag kCADR = TAG('C', 'A', 'D', 'R');  // Client IP address and port
+// Public reset tags
+const QuicTag kRNON = TAG('R', 'N', 'O', 'N');  // Public reset nonce proof
+const QuicTag kRSEQ = TAG('R', 'S', 'E', 'Q');  // Rejected sequence number
 
 // Universal tags
 const QuicTag kPAD  = TAG('P', 'A', 'D', '\0'); // Padding
 
 // These tags have a special form so that they appear either at the beginning
 // or the end of a handshake message. Since handshake messages are sorted by
 // tag value, the tags with 0 at the end will sort first and those with 255 at
 // the end will sort last.
 //
 // The certificate chain should have a tag that will cause it to be sorted at
@@ skipping 36 matching lines @@
 
 // kClientHelloMinimumSizeOld is the previous value of kClientHelloMinimumSize.
 // To support old clients, the server only enforces this size.
 // TODO(wtc): Replace it with kClientHelloMinimumSize when we drop support for
 // QUIC_VERSION_12 clients.
 const size_t kClientHelloMinimumSizeOld = 512;
 
 }  // namespace net
 
 #endif  // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_