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 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
44 const QuicTag kAESG = TAG('A', 'E', 'S', 'G'); // AES128 + GCM-12 | 44 const QuicTag kAESG = TAG('A', 'E', 'S', 'G'); // AES128 + GCM-12 |
45 const QuicTag kCC12 = TAG('C', 'C', '1', '2'); // ChaCha20 + Poly1305 | 45 const QuicTag kCC12 = TAG('C', 'C', '1', '2'); // ChaCha20 + Poly1305 |
46 | 46 |
47 // Congestion control feedback types | 47 // Congestion control feedback types |
48 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic | 48 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic |
49 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic | 49 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic |
50 const QuicTag kINAR = TAG('I', 'N', 'A', 'R'); // Inter arrival | 50 const QuicTag kINAR = TAG('I', 'N', 'A', 'R'); // Inter arrival |
51 | 51 |
52 // Congestion control options | 52 // Congestion control options |
53 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP | 53 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP |
| 54 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control |
54 | 55 |
55 // Loss detection algorithm types | 56 // Loss detection algorithm types |
56 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting | 57 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting |
57 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based | 58 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based |
58 | 59 |
59 // FEC options | 60 // FEC options |
60 const QuicTag kFHDR = TAG('F', 'H', 'D', 'R'); // FEC protect headers | 61 const QuicTag kFHDR = TAG('F', 'H', 'D', 'R'); // FEC protect headers |
61 | 62 |
62 // Proof types (i.e. certificate types) | 63 // Proof types (i.e. certificate types) |
63 // NOTE: although it would be silly to do so, specifying both kX509 and kX59R | 64 // NOTE: although it would be silly to do so, specifying both kX509 and kX59R |
(...skipping 98 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
162 // amplification factor of any mirror DoS attack. | 163 // amplification factor of any mirror DoS attack. |
163 // | 164 // |
164 // A client may pad an inchoate client hello to a size larger than | 165 // A client may pad an inchoate client hello to a size larger than |
165 // kClientHelloMinimumSize to make it more likely to receive a complete | 166 // kClientHelloMinimumSize to make it more likely to receive a complete |
166 // rejection message. | 167 // rejection message. |
167 const size_t kClientHelloMinimumSize = 1024; | 168 const size_t kClientHelloMinimumSize = 1024; |
168 | 169 |
169 } // namespace net | 170 } // namespace net |
170 | 171 |
171 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 172 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
OLD | NEW |