1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793
use std::{ cmp, fmt, net::SocketAddr, num::TryFromIntError, sync::Arc, time::{Duration, Instant}, }; use bytes::BytesMut; use err_derive::Error; use rand::{Rng, RngCore}; #[cfg(feature = "rustls")] use crate::crypto::types::{Certificate, CertificateChain, PrivateKey}; use crate::{ crypto::{self, ClientConfig as _, HmacKey as _, ServerConfig as _}, packet::PartialDecode, VarInt, MAX_CID_SIZE, RESET_TOKEN_SIZE, }; /// Parameters governing the core QUIC state machine /// /// Default values should be suitable for most internet applications. Applications protocols which /// forbid remotely-initiated streams should set `stream_window_bidi` and `stream_window_uni` to /// zero. /// /// In some cases, performance or resource requirements can be improved by tuning these values to /// suit a particular application and/or network connection. In particular, window sizes for /// streams, stream data, and overall connection data can be tuned for a particular expected round /// trip time, link capacity, memory availability, and rate of stream creation. Tuning for higher /// bandwidths and latencies increases worst-case memory consumption, but does not impair /// performance at lower bandwidths and latencies. The default configuration is tuned for a 100Mbps /// link with a 100ms round trip time, with remote endpoints opening at most 320 new streams per /// second. #[derive(Debug)] pub struct TransportConfig { pub(crate) stream_window_bidi: u64, pub(crate) stream_window_uni: u64, pub(crate) max_idle_timeout: Option<Duration>, pub(crate) stream_receive_window: u64, pub(crate) receive_window: u64, pub(crate) send_window: u64, pub(crate) max_tlps: u32, pub(crate) packet_threshold: u32, pub(crate) time_threshold: f32, pub(crate) initial_rtt: Duration, pub(crate) max_datagram_size: u64, pub(crate) initial_window: u64, pub(crate) minimum_window: u64, pub(crate) loss_reduction_factor: f32, pub(crate) persistent_congestion_threshold: u32, pub(crate) keep_alive_interval: Option<Duration>, pub(crate) crypto_buffer_size: usize, pub(crate) allow_spin: bool, pub(crate) datagram_receive_buffer_size: Option<usize>, pub(crate) datagram_send_buffer_size: usize, } impl TransportConfig { /// Maximum number of bidirectional streams that may be initiated by the peer but not yet /// accepted locally /// /// Must be nonzero for the peer to open any bidirectional streams. /// /// Any number of streams may be in flight concurrently. However, to ensure predictable resource /// use, the number of streams which the peer has initiated but which the local application has /// not yet accepted will be kept below this threshold. /// /// Because it takes at least one round trip for an endpoint to open a new stream and be /// notified of its peer's flow control updates, this imposes a hard upper bound on the number /// of streams that may be opened per round-trip. In other words, this should be set to at least /// the desired number of streams opened per unit time, multiplied by the round trip time. /// /// Note that worst-case memory use is directly proportional to `stream_window_bidi * /// stream_receive_window`, with an upper bound proportional to `receive_window`. pub fn stream_window_bidi(&mut self, value: u64) -> &mut Self { self.stream_window_bidi = value; self } /// Variant of `stream_window_bidi` affecting unidirectional streams pub fn stream_window_uni(&mut self, value: u64) -> &mut Self { self.stream_window_uni = value; self } /// Maximum duration of inactivity to accept before timing out the connection. /// /// The true idle timeout is the minimum of this and the peer's own max idle timeout. `None` /// represents an infinite timeout. /// /// **WARNING**: If a peer or its network path malfunctions or acts maliciously, an infinite /// idle timeout can result in permanently hung futures! pub fn max_idle_timeout(&mut self, value: Option<Duration>) -> Result<&mut Self, ConfigError> { if value.map_or(false, |x| x.as_millis() > VarInt::MAX.0 as u128) { return Err(ConfigError::OutOfBounds); } self.max_idle_timeout = value; Ok(self) } /// Maximum number of bytes the peer may transmit without acknowledgement on any one stream /// before becoming blocked. /// /// This should be set to at least the expected connection latency multiplied by the maximum /// desired throughput. Setting this smaller than `receive_window` helps ensure that a single /// stream doesn't monopolize receive buffers, which may otherwise occur if the application /// chooses not to read from a large stream for a time while still requiring data on other /// streams. pub fn stream_receive_window(&mut self, value: u64) -> &mut Self { self.stream_receive_window = value; self } /// Maximum number of bytes the peer may transmit across all streams of a connection before /// becoming blocked. /// /// This should be set to at least the expected connection latency multiplied by the maximum /// desired throughput. Larger values can be useful to allow maximum throughput within a /// stream while another is blocked. pub fn receive_window(&mut self, value: u64) -> &mut Self { self.receive_window = value; self } /// Maximum number of bytes to transmit to a peer without acknowledgment /// /// Provides an upper bound on memory when communicating with peers that issue large amounts of /// flow control credit. Endpoints that wish to handle large numbers of connections robustly /// should take care to set this low enough to guarantee memory exhaustion does not occur if /// every connection uses the entire window. pub fn send_window(&mut self, value: u64) -> &mut Self { self.send_window = value; self } /// Maximum number of tail loss probes before an RTO fires. pub fn max_tlps(&mut self, value: u32) -> &mut Self { self.max_tlps = value; self } /// Maximum reordering in packet number space before FACK style loss detection considers a /// packet lost. Should not be less than 3, per RFC5681. pub fn packet_threshold(&mut self, value: u32) -> &mut Self { self.packet_threshold = value; self } /// Maximum reordering in time space before time based loss detection considers a packet lost, /// as a factor of RTT pub fn time_threshold(&mut self, value: f32) -> &mut Self { self.time_threshold = value; self } /// The RTT used before an RTT sample is taken pub fn initial_rtt(&mut self, value: Duration) -> &mut Self { self.initial_rtt = value; self } /// The sender’s maximum UDP payload size. Does not include UDP or IP overhead. /// /// Used for calculating initial and minimum congestion windows. pub fn max_datagram_size(&mut self, value: u64) -> &mut Self { self.max_datagram_size = value; self } /// Default limit on the amount of outstanding data in bytes. /// /// Recommended value: `min(10 * max_datagram_size, max(2 * max_datagram_size, 14720))` pub fn initial_window(&mut self, value: u64) -> &mut Self { self.initial_window = value; self } /// Default minimum congestion window. /// /// Recommended value: `2 * max_datagram_size`. pub fn minimum_window(&mut self, value: u64) -> &mut Self { self.minimum_window = value; self } /// Reduction in congestion window when a new loss event is detected. pub fn loss_reduction_factor(&mut self, value: f32) -> &mut Self { self.loss_reduction_factor = value; self } /// Number of consecutive PTOs after which network is considered to be experiencing persistent congestion. pub fn persistent_congestion_threshold(&mut self, value: u32) -> &mut Self { self.persistent_congestion_threshold = value; self } /// Period of inactivity before sending a keep-alive packet /// /// Keep-alive packets prevent an inactive but otherwise healthy connection from timing out. /// /// `None` to disable, which is the default. Only one side of any given connection needs keep-alive /// enabled for the connection to be preserved. Must be set lower than the idle_timeout of both /// peers to be effective. pub fn keep_alive_interval(&mut self, value: Option<Duration>) -> &mut Self { self.keep_alive_interval = value; self } /// Maximum quantity of out-of-order crypto layer data to buffer pub fn crypto_buffer_size(&mut self, value: usize) -> &mut Self { self.crypto_buffer_size = value; self } /// Whether the implementation is permitted to set the spin bit on this connection /// /// This allows passive observers to easily judge the round trip time of a connection, which can /// be useful for network administration but sacrifices a small amount of privacy. pub fn allow_spin(&mut self, value: bool) -> &mut Self { self.allow_spin = value; self } /// Maximum number of incoming application datagram bytes to buffer, or None to disable /// datagrams /// /// The peer is forbidden to send single datagrams larger than this size. If the aggregate size /// of all datagrams that have been received from the peer but not consumed by the application /// exceeds this value, old datagrams are dropped until it is no longer exceeded. pub fn datagram_receive_buffer_size(&mut self, value: Option<usize>) -> &mut Self { self.datagram_receive_buffer_size = value; self } /// Maximum number of outgoing application datagram bytes to buffer /// /// While datagrams are sent ASAP, it is possible for an application to generate data faster /// than the link, or even the underlying hardware, can transmit them. This limits the amount of /// memory that may be consumed in that case. When the send buffer is full and a new datagram is /// sent, older datagrams are dropped until sufficient space is available. pub fn datagram_send_buffer_size(&mut self, value: usize) -> &mut Self { self.datagram_send_buffer_size = value; self } } impl Default for TransportConfig { fn default() -> Self { const EXPECTED_RTT: u64 = 100; // ms const MAX_STREAM_BANDWIDTH: u64 = 12500 * 1000; // bytes/s // Window size needed to avoid pipeline // stalls const STREAM_RWND: u64 = MAX_STREAM_BANDWIDTH / 1000 * EXPECTED_RTT; const MAX_DATAGRAM_SIZE: u64 = 1200; TransportConfig { stream_window_bidi: 32, stream_window_uni: 32, max_idle_timeout: Some(Duration::from_millis(10_000)), stream_receive_window: STREAM_RWND, receive_window: 8 * STREAM_RWND, send_window: 8 * STREAM_RWND, max_tlps: 2, packet_threshold: 3, time_threshold: 9.0 / 8.0, initial_rtt: Duration::from_millis(500), // per spec, intentionally distinct from EXPECTED_RTT max_datagram_size: MAX_DATAGRAM_SIZE, initial_window: cmp::min( 10 * MAX_DATAGRAM_SIZE, cmp::max(2 * MAX_DATAGRAM_SIZE, 14720), ), minimum_window: 2 * MAX_DATAGRAM_SIZE, loss_reduction_factor: 0.5, persistent_congestion_threshold: 3, keep_alive_interval: None, crypto_buffer_size: 16 * 1024, allow_spin: true, datagram_receive_buffer_size: Some(STREAM_RWND as usize), datagram_send_buffer_size: 1024 * 1024, } } } /// Global configuration for the endpoint, affecting all connections /// /// Default values should be suitable for most internet applications. pub struct EndpointConfig<S> where S: crypto::Session, { /// Length of connection IDs for the endpoint. /// /// This must be no greater than 20. If zero, incoming packets are mapped to connections only by /// their source address. Otherwise, the connection ID field is used alone, allowing for source /// address to change and for multiple connections from a single address. When local_cid_len > /// 0, at most 3/4 * 2^(local_cid_len * 8) simultaneous connections can be supported. pub(crate) local_cid_len: usize, /// Private key used to send authenticated connection resets to peers who were /// communicating with a previous instance of this endpoint. pub(crate) reset_key: Arc<S::HmacKey>, } impl<S> EndpointConfig<S> where S: crypto::Session, { /// Create a default config with a particular `reset_key` pub fn new(reset_key: S::HmacKey) -> Self { Self { local_cid_len: 8, reset_key: Arc::new(reset_key), } } /// Length of connection IDs for the endpoint. /// /// This must be no greater than 20. If zero, incoming packets are mapped to connections only by /// their source address. Otherwise, the connection ID field is used alone, allowing for source /// address to change and for multiple connections from a single address. When local_cid_len > /// 0, at most 3/4 * 2^(local_cid_len * 8) simultaneous connections can be supported. pub fn local_cid_len(&mut self, value: usize) -> Result<&mut Self, ConfigError> { if value > MAX_CID_SIZE { return Err(ConfigError::OutOfBounds); } self.local_cid_len = value; Ok(self) } /// Private key used to send authenticated connection resets to peers who were /// communicating with a previous instance of this endpoint. pub fn reset_key(&mut self, value: &[u8]) -> Result<&mut Self, ConfigError> { self.reset_key = Arc::new(S::HmacKey::new(value)?); Ok(self) } } impl<S: crypto::Session> fmt::Debug for EndpointConfig<S> { fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { fmt.debug_struct("EndpointConfig") .field("local_cid_len", &self.local_cid_len) .field("reset_key", &"[ elided ]") .finish() } } impl<S: crypto::Session> Default for EndpointConfig<S> { fn default() -> Self { let mut reset_key = vec![0; S::HmacKey::KEY_LEN]; rand::thread_rng().fill_bytes(&mut reset_key); Self::new( S::HmacKey::new(&reset_key) .expect("HMAC key rejected random bytes; use EndpointConfig::new instead"), ) } } impl<S: crypto::Session> Clone for EndpointConfig<S> { fn clone(&self) -> Self { Self { local_cid_len: self.local_cid_len, reset_key: self.reset_key.clone(), } } } /// Parameters governing incoming connections /// /// Default values should be suitable for most internet applications. pub struct ServerConfig<S> where S: crypto::Session, { /// Transport configuration to use for incoming connections pub transport: Arc<TransportConfig>, /// TLS configuration used for incoming connections. /// /// Must be set to use TLS 1.3 only. pub crypto: S::ServerConfig, /// Private key used to authenticate data included in handshake tokens. pub(crate) token_key: Arc<S::HmacKey>, /// Whether to require clients to prove ownership of an address before committing resources. /// /// Introduces an additional round-trip to the handshake to make denial of service attacks more difficult. pub(crate) use_stateless_retry: bool, /// Microseconds after a stateless retry token was issued for which it's considered valid. pub(crate) retry_token_lifetime: u64, /// Maximum number of incoming connections to buffer. /// /// Accepting a connection removes it from the buffer, so this does not need to be large. pub(crate) accept_buffer: u32, /// Whether to allow clients to migrate to new addresses /// /// Improves behavior for clients that move between different internet connections or suffer NAT /// rebinding. Enabled by default. pub(crate) migration: bool, } impl<S> ServerConfig<S> where S: crypto::Session, { /// Create a default config with a particular `token_key` pub fn new(token_key: S::HmacKey) -> Self { Self { transport: Arc::new(TransportConfig::default()), crypto: S::ServerConfig::new(), token_key: Arc::new(token_key), use_stateless_retry: false, retry_token_lifetime: 15_000_000, accept_buffer: 1024, migration: true, } } /// Private key used to authenticate data included in handshake tokens. pub fn token_key(&mut self, value: &[u8]) -> Result<&mut Self, ConfigError> { self.token_key = Arc::new(S::HmacKey::new(value)?); Ok(self) } /// Whether to require clients to prove ownership of an address before committing resources. /// /// Introduces an additional round-trip to the handshake to make denial of service attacks more difficult. pub fn use_stateless_retry(&mut self, value: bool) -> &mut Self { self.use_stateless_retry = value; self } /// Microseconds after a stateless retry token was issued for which it's considered valid. pub fn retry_token_lifetime(&mut self, value: u64) -> &mut Self { self.retry_token_lifetime = value; self } /// Maximum number of incoming connections to buffer. /// /// Accepting a connection removes it from the buffer, so this does not need to be large. pub fn accept_buffer(&mut self, value: u32) -> &mut Self { self.accept_buffer = value; self } /// Whether to allow clients to migrate to new addresses /// /// Improves behavior for clients that move between different internet connections or suffer NAT /// rebinding. Enabled by default. pub fn migration(&mut self, value: bool) -> &mut Self { self.migration = value; self } } #[cfg(feature = "rustls")] impl ServerConfig<crypto::rustls::TlsSession> { /// Set the certificate chain that will be presented to clients pub fn certificate( &mut self, cert_chain: CertificateChain, key: PrivateKey, ) -> Result<&mut Self, rustls::TLSError> { Arc::make_mut(&mut self.crypto).set_single_cert(cert_chain.certs, key.inner)?; Ok(self) } } impl<S> fmt::Debug for ServerConfig<S> where S: crypto::Session, { fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { fmt.debug_struct("ServerConfig<T>") .field("transport", &self.transport) .field("crypto", &"ServerConfig { elided }") .field("token_key", &"[ elided ]") .field("use_stateless_retry", &self.use_stateless_retry) .field("retry_token_lifetime", &self.retry_token_lifetime) .field("accept_buffer", &self.accept_buffer) .field("migration", &self.migration) .finish() } } impl<S> Default for ServerConfig<S> where S: crypto::Session, { fn default() -> Self { let rng = &mut rand::thread_rng(); let mut token_key = vec![0; S::HmacKey::KEY_LEN]; rng.fill_bytes(&mut token_key); Self::new( S::HmacKey::new(&token_key) .expect("HMAC key rejected random bytes; use ServerConfig::new instead"), ) } } impl<S> Clone for ServerConfig<S> where S: crypto::Session, S::ServerConfig: Clone, { fn clone(&self) -> Self { Self { transport: self.transport.clone(), crypto: self.crypto.clone(), token_key: self.token_key.clone(), use_stateless_retry: self.use_stateless_retry, retry_token_lifetime: self.retry_token_lifetime, accept_buffer: self.accept_buffer, migration: self.migration, } } } /// Configuration for outgoing connections /// /// Default values should be suitable for most internet applications. pub struct ClientConfig<S> where S: crypto::Session, { /// Transport configuration to use pub transport: Arc<TransportConfig>, /// Cryptographic configuration to use pub crypto: S::ClientConfig, } #[cfg(feature = "rustls")] impl ClientConfig<crypto::rustls::TlsSession> { /// Add a trusted certificate authority pub fn add_certificate_authority( &mut self, cert: Certificate, ) -> Result<&mut Self, webpki::Error> { let anchor = webpki::trust_anchor_util::cert_der_as_trust_anchor(&cert.inner.0)?; Arc::make_mut(&mut self.crypto) .root_store .add_server_trust_anchors(&webpki::TLSServerTrustAnchors(&[anchor])); Ok(self) } } impl<S> Default for ClientConfig<S> where S: crypto::Session, { fn default() -> Self { Self { transport: Default::default(), crypto: S::ClientConfig::new(), } } } impl<S> Clone for ClientConfig<S> where S: crypto::Session, S::ClientConfig: Clone, { fn clone(&self) -> Self { Self { transport: self.transport.clone(), crypto: self.crypto.clone(), } } } impl<S> fmt::Debug for ClientConfig<S> where S: crypto::Session, { fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result { fmt.debug_struct("ClientConfig<T>") .field("transport", &self.transport) .field("crypto", &"ClientConfig { elided }") .finish() } } /// Errors in the configuration of an endpoint #[derive(Debug, Error, Clone, PartialEq, Eq)] #[non_exhaustive] pub enum ConfigError { /// Value exceeds supported bounds #[error(display = "value exceeds supported bounds")] OutOfBounds, } impl From<TryFromIntError> for ConfigError { fn from(_: TryFromIntError) -> Self { ConfigError::OutOfBounds } } /// Events sent from an Endpoint to a Connection #[derive(Debug)] pub struct ConnectionEvent(pub(crate) ConnectionEventInner); #[derive(Debug)] pub(crate) enum ConnectionEventInner { /// A datagram has been received for the Connection Datagram { now: Instant, remote: SocketAddr, ecn: Option<EcnCodepoint>, first_decode: PartialDecode, remaining: Option<BytesMut>, }, /// New connection identifiers have been issued for the Connection NewIdentifiers(Vec<IssuedCid>), } /// Events sent from a Connection to an Endpoint #[derive(Debug)] pub struct EndpointEvent(pub(crate) EndpointEventInner); impl EndpointEvent { /// Construct an event that indicating that a `Connection` will no longer emit events /// /// Useful for notifying an `Endpoint` that a `Connection` has been destroyed outside of the /// usual state machine flow, e.g. when being dropped by the user. pub fn drained() -> Self { Self(EndpointEventInner::Drained) } /// Determine whether this is the last event a `Connection` will emit /// /// Useful for determining when connection-related event loop state can be freed. pub fn is_drained(&self) -> bool { self.0 == EndpointEventInner::Drained } } #[derive(Clone, Debug, Eq, PartialEq)] pub(crate) enum EndpointEventInner { /// The connection has been drained Drained, /// The reset token and/or address eligible for generating resets has been updated ResetToken(SocketAddr, ResetToken), /// The connection needs connection identifiers NeedIdentifiers(u64), /// Stop routing connection ID for this sequence number to the connection RetireConnectionId(u64), } /// Protocol-level identifier for a connection. /// /// Mainly useful for identifying this connection's packets on the wire with tools like Wireshark. #[derive(Clone, Copy, Eq, PartialEq, Ord, PartialOrd, Hash)] pub struct ConnectionId { len: u8, bytes: [u8; MAX_CID_SIZE], } impl ConnectionId { pub(crate) fn new(bytes: &[u8]) -> Self { debug_assert!(bytes.len() <= MAX_CID_SIZE); let mut res = Self { len: bytes.len() as u8, bytes: [0; MAX_CID_SIZE], }; res.bytes[..bytes.len()].clone_from_slice(&bytes); res } pub(crate) fn random<R: Rng>(rng: &mut R, len: usize) -> Self { debug_assert!(len <= MAX_CID_SIZE); let mut res = Self { len: len as u8, bytes: [0; MAX_CID_SIZE], }; let mut rng_bytes = [0; MAX_CID_SIZE]; rng.fill_bytes(&mut rng_bytes); res.bytes[..len].clone_from_slice(&rng_bytes[..len]); res } } impl ::std::ops::Deref for ConnectionId { type Target = [u8]; fn deref(&self) -> &[u8] { &self.bytes[0..self.len as usize] } } impl ::std::ops::DerefMut for ConnectionId { fn deref_mut(&mut self) -> &mut [u8] { &mut self.bytes[0..self.len as usize] } } impl fmt::Debug for ConnectionId { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { self.bytes[0..self.len as usize].fmt(f) } } impl fmt::Display for ConnectionId { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { for byte in self.iter() { write!(f, "{:02x}", byte)?; } Ok(()) } } /// Explicit congestion notification codepoint #[repr(u8)] #[derive(Debug, Copy, Clone, Eq, PartialEq)] pub enum EcnCodepoint { #[doc(hidden)] ECT0 = 0b10, #[doc(hidden)] ECT1 = 0b01, #[doc(hidden)] CE = 0b11, } impl EcnCodepoint { /// Create new object from the given bits pub fn from_bits(x: u8) -> Option<Self> { use self::EcnCodepoint::*; Some(match x & 0b11 { 0b10 => ECT0, 0b01 => ECT1, 0b11 => CE, _ => { return None; } }) } } /// Stateless reset token /// /// Used for an endpoint to securely communicate that it has lost state for a connection. #[allow(clippy::derive_hash_xor_eq)] // Custom PartialEq impl matches derived semantics #[derive(Debug, Copy, Clone, Hash)] pub struct ResetToken([u8; RESET_TOKEN_SIZE]); impl cmp::PartialEq for ResetToken { fn eq(&self, other: &ResetToken) -> bool { crate::constant_time::eq(&self.0, &other.0) } } impl cmp::Eq for ResetToken {} impl From<[u8; RESET_TOKEN_SIZE]> for ResetToken { fn from(x: [u8; RESET_TOKEN_SIZE]) -> Self { Self(x) } } impl std::ops::Deref for ResetToken { type Target = [u8]; fn deref(&self) -> &[u8] { &self.0 } } impl fmt::Display for ResetToken { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { for byte in self.iter() { write!(f, "{:02x}", byte)?; } Ok(()) } } #[derive(Debug, Copy, Clone)] pub struct IssuedCid { pub sequence: u64, pub id: ConnectionId, pub reset_token: ResetToken, }