| 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 108 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 119 | 119 |
| 120 // Enable bandwidth resumption experiment. | 120 // Enable bandwidth resumption experiment. |
| 121 const QuicTag kBWRE = TAG('B', 'W', 'R', 'E'); // Bandwidth resumption. | 121 const QuicTag kBWRE = TAG('B', 'W', 'R', 'E'); // Bandwidth resumption. |
| 122 const QuicTag kBWMX = TAG('B', 'W', 'M', 'X'); // Max bandwidth resumption. | 122 const QuicTag kBWMX = TAG('B', 'W', 'M', 'X'); // Max bandwidth resumption. |
| 123 const QuicTag kBWRS = TAG('B', 'W', 'R', 'S'); // Server bandwidth resumption. | 123 const QuicTag kBWRS = TAG('B', 'W', 'R', 'S'); // Server bandwidth resumption. |
| 124 | 124 |
| 125 // Enable path MTU discovery experiment. | 125 // Enable path MTU discovery experiment. |
| 126 const QuicTag kMTUH = TAG('M', 'T', 'U', 'H'); // High-target MTU discovery. | 126 const QuicTag kMTUH = TAG('M', 'T', 'U', 'H'); // High-target MTU discovery. |
| 127 const QuicTag kMTUL = TAG('M', 'T', 'U', 'L'); // Low-target MTU discovery. | 127 const QuicTag kMTUL = TAG('M', 'T', 'U', 'L'); // Low-target MTU discovery. |
| 128 | 128 |
| 129 const QuicTag kFHOL = TAG('F', 'H', 'O', 'L'); // Force head of line blocking. |
| 130 |
| 129 // Proof types (i.e. certificate types) | 131 // Proof types (i.e. certificate types) |
| 130 // NOTE: although it would be silly to do so, specifying both kX509 and kX59R | 132 // NOTE: although it would be silly to do so, specifying both kX509 and kX59R |
| 131 // is allowed and is equivalent to specifying only kX509. | 133 // is allowed and is equivalent to specifying only kX509. |
| 132 const QuicTag kX509 = TAG('X', '5', '0', '9'); // X.509 certificate, all key | 134 const QuicTag kX509 = TAG('X', '5', '0', '9'); // X.509 certificate, all key |
| 133 // types | 135 // types |
| 134 const QuicTag kX59R = TAG('X', '5', '9', 'R'); // X.509 certificate, RSA keys | 136 const QuicTag kX59R = TAG('X', '5', '9', 'R'); // X.509 certificate, RSA keys |
| 135 // only | 137 // only |
| 136 const QuicTag kCHID = TAG('C', 'H', 'I', 'D'); // Channel ID. | 138 const QuicTag kCHID = TAG('C', 'H', 'I', 'D'); // Channel ID. |
| 137 | 139 |
| 138 // Client hello tags | 140 // Client hello tags |
| (...skipping 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 241 // amplification factor of any mirror DoS attack. | 243 // amplification factor of any mirror DoS attack. |
| 242 // | 244 // |
| 243 // A client may pad an inchoate client hello to a size larger than | 245 // A client may pad an inchoate client hello to a size larger than |
| 244 // kClientHelloMinimumSize to make it more likely to receive a complete | 246 // kClientHelloMinimumSize to make it more likely to receive a complete |
| 245 // rejection message. | 247 // rejection message. |
| 246 const size_t kClientHelloMinimumSize = 1024; | 248 const size_t kClientHelloMinimumSize = 1024; |
| 247 | 249 |
| 248 } // namespace net | 250 } // namespace net |
| 249 | 251 |
| 250 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 252 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
| OLD | NEW |