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 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
48 const QuicTag kSRBF = TAG('S', 'R', 'B', 'F'); // Socket receive buffer | 48 const QuicTag kSRBF = TAG('S', 'R', 'B', 'F'); // Socket receive buffer |
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 | 59 |
59 // Loss detection algorithm types | 60 // Loss detection algorithm types |
60 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting | 61 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting |
61 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based | 62 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based |
62 | 63 |
63 // FEC options | 64 // FEC options |
64 const QuicTag kFHDR = TAG('F', 'H', 'D', 'R'); // FEC protect headers | 65 const QuicTag kFHDR = TAG('F', 'H', 'D', 'R'); // FEC protect headers |
65 | 66 |
66 // Proof types (i.e. certificate types) | 67 // Proof types (i.e. certificate types) |
67 // NOTE: although it would be silly to do so, specifying both kX509 and kX59R | 68 // NOTE: although it would be silly to do so, specifying both kX509 and kX59R |
(...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
164 // amplification factor of any mirror DoS attack. | 165 // amplification factor of any mirror DoS attack. |
165 // | 166 // |
166 // A client may pad an inchoate client hello to a size larger than | 167 // A client may pad an inchoate client hello to a size larger than |
167 // kClientHelloMinimumSize to make it more likely to receive a complete | 168 // kClientHelloMinimumSize to make it more likely to receive a complete |
168 // rejection message. | 169 // rejection message. |
169 const size_t kClientHelloMinimumSize = 1024; | 170 const size_t kClientHelloMinimumSize = 1024; |
170 | 171 |
171 } // namespace net | 172 } // namespace net |
172 | 173 |
173 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 174 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
OLD | NEW |