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 26 matching lines...) Expand all Loading... |
37 | 37 |
38 // Key exchange methods | 38 // Key exchange methods |
39 const QuicTag kP256 = TAG('P', '2', '5', '6'); // ECDH, Curve P-256 | 39 const QuicTag kP256 = TAG('P', '2', '5', '6'); // ECDH, Curve P-256 |
40 const QuicTag kC255 = TAG('C', '2', '5', '5'); // ECDH, Curve25519 | 40 const QuicTag kC255 = TAG('C', '2', '5', '5'); // ECDH, Curve25519 |
41 | 41 |
42 // AEAD algorithms | 42 // AEAD algorithms |
43 const QuicTag kNULL = TAG('N', 'U', 'L', 'N'); // null algorithm | 43 const QuicTag kNULL = TAG('N', 'U', 'L', 'N'); // null algorithm |
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 // Socket receive buffer |
| 48 const QuicTag kSRBF = TAG('S', 'R', 'B', 'F'); // Socket receive buffer |
| 49 |
47 // Congestion control feedback types | 50 // Congestion control feedback types |
48 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic | 51 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic |
49 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic | 52 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic |
50 const QuicTag kTSTP = TAG('T', 'S', 'T', 'P'); // Timestamp | 53 const QuicTag kTSTP = TAG('T', 'S', 'T', 'P'); // Timestamp |
51 | 54 |
52 // Congestion control options | 55 // Congestion control options |
53 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP | 56 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP |
54 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control | 57 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control |
55 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 | 58 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 |
56 | 59 |
(...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
164 // amplification factor of any mirror DoS attack. | 167 // amplification factor of any mirror DoS attack. |
165 // | 168 // |
166 // A client may pad an inchoate client hello to a size larger than | 169 // A client may pad an inchoate client hello to a size larger than |
167 // kClientHelloMinimumSize to make it more likely to receive a complete | 170 // kClientHelloMinimumSize to make it more likely to receive a complete |
168 // rejection message. | 171 // rejection message. |
169 const size_t kClientHelloMinimumSize = 1024; | 172 const size_t kClientHelloMinimumSize = 1024; |
170 | 173 |
171 } // namespace net | 174 } // namespace net |
172 | 175 |
173 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 176 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
OLD | NEW |