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 <stddef.h> | 8 #include <stddef.h> |
9 #include <stdint.h> | 9 #include <stdint.h> |
10 | 10 |
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
74 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control | 74 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control |
75 const QuicTag kBYTE = TAG('B', 'Y', 'T', 'E'); // TCP cubic or reno in bytes | 75 const QuicTag kBYTE = TAG('B', 'Y', 'T', 'E'); // TCP cubic or reno in bytes |
76 const QuicTag kIW03 = TAG('I', 'W', '0', '3'); // Force ICWND to 3 | 76 const QuicTag kIW03 = TAG('I', 'W', '0', '3'); // Force ICWND to 3 |
77 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 | 77 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 |
78 const QuicTag kIW20 = TAG('I', 'W', '2', '0'); // Force ICWND to 20 | 78 const QuicTag kIW20 = TAG('I', 'W', '2', '0'); // Force ICWND to 20 |
79 const QuicTag kIW50 = TAG('I', 'W', '5', '0'); // Force ICWND to 50 | 79 const QuicTag kIW50 = TAG('I', 'W', '5', '0'); // Force ICWND to 50 |
80 const QuicTag k1CON = TAG('1', 'C', 'O', 'N'); // Emulate a single connection | 80 const QuicTag k1CON = TAG('1', 'C', 'O', 'N'); // Emulate a single connection |
81 const QuicTag kNTLP = TAG('N', 'T', 'L', 'P'); // No tail loss probe | 81 const QuicTag kNTLP = TAG('N', 'T', 'L', 'P'); // No tail loss probe |
82 const QuicTag kNCON = TAG('N', 'C', 'O', 'N'); // N Connection Congestion Ctrl | 82 const QuicTag kNCON = TAG('N', 'C', 'O', 'N'); // N Connection Congestion Ctrl |
83 const QuicTag kNRTO = TAG('N', 'R', 'T', 'O'); // CWND reduction on loss | 83 const QuicTag kNRTO = TAG('N', 'R', 'T', 'O'); // CWND reduction on loss |
| 84 const QuicTag kUNDO = TAG('U', 'N', 'D', 'O'); // Undo any pending retransmits |
| 85 // if they're likely spurious. |
84 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based loss detection | 86 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based loss detection |
85 const QuicTag kATIM = TAG('A', 'T', 'I', 'M'); // Adaptive time loss detection | 87 const QuicTag kATIM = TAG('A', 'T', 'I', 'M'); // Adaptive time loss detection |
86 const QuicTag kMIN1 = TAG('M', 'I', 'N', '1'); // Min CWND of 1 packet | 88 const QuicTag kMIN1 = TAG('M', 'I', 'N', '1'); // Min CWND of 1 packet |
87 const QuicTag kMIN4 = TAG('M', 'I', 'N', '4'); // Min CWND of 4 packets, | 89 const QuicTag kMIN4 = TAG('M', 'I', 'N', '4'); // Min CWND of 4 packets, |
88 // with a min rate of 1 BDP. | 90 // with a min rate of 1 BDP. |
89 const QuicTag kTLPR = TAG('T', 'L', 'P', 'R'); // Tail loss probe delay of | 91 const QuicTag kTLPR = TAG('T', 'L', 'P', 'R'); // Tail loss probe delay of |
90 // 0.5RTT. | 92 // 0.5RTT. |
91 const QuicTag kACKD = TAG('A', 'C', 'K', 'D'); // Ack decimation style acking. | 93 const QuicTag kACKD = TAG('A', 'C', 'K', 'D'); // Ack decimation style acking. |
92 const QuicTag kAKD2 = TAG('A', 'K', 'D', '2'); // Ack decimation tolerating | 94 const QuicTag kAKD2 = TAG('A', 'K', 'D', '2'); // Ack decimation tolerating |
93 // out of order packets. | 95 // out of order packets. |
(...skipping 140 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
234 // amplification factor of any mirror DoS attack. | 236 // amplification factor of any mirror DoS attack. |
235 // | 237 // |
236 // A client may pad an inchoate client hello to a size larger than | 238 // A client may pad an inchoate client hello to a size larger than |
237 // kClientHelloMinimumSize to make it more likely to receive a complete | 239 // kClientHelloMinimumSize to make it more likely to receive a complete |
238 // rejection message. | 240 // rejection message. |
239 const size_t kClientHelloMinimumSize = 1024; | 241 const size_t kClientHelloMinimumSize = 1024; |
240 | 242 |
241 } // namespace net | 243 } // namespace net |
242 | 244 |
243 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 245 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
OLD | NEW |