QUIC - cleanup changes to keep in sync with internal source tree.

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 <string>
 
 #include "net/base/net_export.h"
@@ skipping 82 matching lines @@
 const QuicTag kEXPY = TAG('E', 'X', 'P', 'Y');   // Expiry
 // TODO(rjshade): Remove kIFCW when removing QUIC_VERSION_19.
 const QuicTag kIFCW = TAG('I', 'F', 'C', 'W');   // Initial flow control receive
                                                  // window.
 const QuicTag kSFCW = TAG('S', 'F', 'C', 'W');   // Initial stream flow control
                                                  // receive window.
 const QuicTag kCFCW = TAG('C', 'F', 'C', 'W');   // Initial session/connection
                                                  // flow control receive window.
 const QuicTag kUAID = TAG('U', 'A', 'I', 'D');   // Client's User Agent ID.
 
+// Rejection tags
+const QuicTag kRREJ = TAG('R', 'R', 'E', 'J');   // Reasons for server sending
+                                                 // rejection message tag.
+
 // 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
 
 // 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
 
-// Reasons for server sending rejection message tag.
-const QuicTag kRREJ = TAG('R', 'R', 'E', 'J');
-
 // 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
 // the end of any handshake messages because it's likely to be large and the
 // client might be able to get everything that it needs from the small values at
 // the beginning.
 //
@@ skipping 26 matching lines @@
 // amplification factor of any mirror DoS attack.
 //
 // A client may pad an inchoate client hello to a size larger than
 // kClientHelloMinimumSize to make it more likely to receive a complete
 // rejection message.
 const size_t kClientHelloMinimumSize = 1024;
 
 }  // namespace net
 
 #endif  // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_