| OLD | NEW |
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 5 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
| 6 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 6 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
| 7 | 7 |
| 8 #include <string> | 8 #include <string> |
| 9 | 9 |
| 10 #include "net/base/net_export.h" | 10 #include "net/base/net_export.h" |
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 49 | 49 |
| 50 // Congestion control feedback types | 50 // Congestion control feedback types |
| 51 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic | 51 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic |
| 52 | 52 |
| 53 // Connection options (COPT) values | 53 // Connection options (COPT) values |
| 54 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP | 54 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP |
| 55 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control | 55 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control |
| 56 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 | 56 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 |
| 57 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic | 57 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic |
| 58 const QuicTag k1CON = TAG('1', 'C', 'O', 'N'); // Emulate a single connection | 58 const QuicTag k1CON = TAG('1', 'C', 'O', 'N'); // Emulate a single connection |
| 59 const QuicTag kNTLP = TAG('N', 'T', 'L', 'P'); // No tail loss probe |
| 59 | 60 |
| 60 // Loss detection algorithm types | 61 // Loss detection algorithm types |
| 61 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting | 62 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting |
| 62 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based | 63 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based |
| 63 | 64 |
| 64 // Optional support of truncated Connection IDs. If sent by a peer, the value | 65 // Optional support of truncated Connection IDs. If sent by a peer, the value |
| 65 // is the minimum number of bytes allowed for the connection ID sent to the | 66 // is the minimum number of bytes allowed for the connection ID sent to the |
| 66 // peer. | 67 // peer. |
| 67 const QuicTag kTCID = TAG('T', 'C', 'I', 'D'); // Connection ID truncation. | 68 const QuicTag kTCID = TAG('T', 'C', 'I', 'D'); // Connection ID truncation. |
| 68 | 69 |
| (...skipping 101 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 170 // amplification factor of any mirror DoS attack. | 171 // amplification factor of any mirror DoS attack. |
| 171 // | 172 // |
| 172 // A client may pad an inchoate client hello to a size larger than | 173 // A client may pad an inchoate client hello to a size larger than |
| 173 // kClientHelloMinimumSize to make it more likely to receive a complete | 174 // kClientHelloMinimumSize to make it more likely to receive a complete |
| 174 // rejection message. | 175 // rejection message. |
| 175 const size_t kClientHelloMinimumSize = 1024; | 176 const size_t kClientHelloMinimumSize = 1024; |
| 176 | 177 |
| 177 } // namespace net | 178 } // namespace net |
| 178 | 179 |
| 179 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 180 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
| OLD | NEW |