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 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978
// Copyright 2019 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//! Execution contexts.
//!
//! This module defines "context" traits, which allow code in this crate to be
//! written agnostic to their execution context.
//!
//! All of the code in this crate operates in terms of "events". When an event
//! occurs (for example, a packet is received, an application makes a request,
//! or a timer fires), a function is called to handle that event. In response to
//! that event, the code may wish to emit new events (for example, to send a
//! packet, to respond to an application request, or to install a new timer).
//! The traits in this module provide the ability to emit new events. For
//! example, if, in order to handle some event, we need the ability to install
//! new timers, then the function to handle that event would take a
//! [`TimerContext`] parameter, which it could use to install new timers.
//!
//! Structuring code this way allows us to write code which is agnostic to
//! execution context - a test fake or any number of possible "real-world"
//! implementations of these traits all appear as indistinguishable, opaque
//! trait implementations to our code.
//!
//! The benefits are deeper than this, though. Large units of code can be
//! subdivided into smaller units that view each other as "contexts". For
//! example, the ARP implementation in the [`crate::device::arp`] module defines
//! the [`ArpContext`] trait, which is an execution context for ARP operations.
//! It is implemented both by the test fakes in that module, and also by the
//! Ethernet device implementation in the [`crate::device::ethernet`] module.
//!
//! This subdivision of code into small units in turn enables modularity. If,
//! for example, the IP code sees transport layer protocols as execution
//! contexts, then customizing which transport layer protocols are supported is
//! just a matter of providing a different implementation of the transport layer
//! context traits (this isn't what we do today, but we may in the future).
use lock_order::Unlocked;
use crate::{
marker::{BindingsContext, BindingsTypes},
state::StackState,
};
pub use netstack3_base::{
ContextPair, ContextProvider, CoreEventContext, CoreTimerContext, CounterContext, CtxPair,
DeferredResourceRemovalContext, EventContext, HandleableTimer, InstantBindingsTypes,
InstantContext, NestedIntoCoreTimerCtx, NonTestCtxMarker, ReceivableFrameMeta,
RecvFrameContext, ReferenceNotifiers, ResourceCounterContext, RngContext, SendFrameContext,
SendableFrameMeta, TimerBindingsTypes, TimerContext, TimerHandler, TracingContext,
};
impl<BC: BindingsContext, L> NonTestCtxMarker for CoreCtx<'_, BC, L> {}
/// Provides access to core context implementations.
///
/// `L` is the current lock level of `CoreCtx`. The alias [`UnlockedCoreCtx`] is
/// provided at the [`Unlocked`] level.
pub type CoreCtx<'a, BT, L> = Locked<&'a StackState<BT>, L>;
pub(crate) type CoreCtxAndResource<'a, BT, R, L> =
Locked<lock_order::OwnedTupleWrapper<&'a StackState<BT>, &'a R>, L>;
/// An alias for an unlocked [`CoreCtx`].
pub type UnlockedCoreCtx<'a, BT> = CoreCtx<'a, BT, Unlocked>;
pub(crate) use locked::Locked;
impl<'a, BT, L> ContextProvider for CoreCtx<'a, BT, L>
where
BT: BindingsTypes,
{
type Context = Self;
fn context(&mut self) -> &mut Self::Context {
self
}
}
/// Provides a crate-local wrapper for `[lock_order::Locked]`.
///
/// This module is intentionally private so usage is limited to the type alias
/// in [`CoreCtx`].
mod locked {
use super::{BindingsTypes, CoreCtx, StackState};
use core::ops::Deref;
use lock_order::{wrap::LockedWrapper, Locked as ExternalLocked, TupleWrapper, Unlocked};
/// A crate-local wrapper on [`lock_order::Locked`].
pub struct Locked<T, L>(ExternalLocked<T, L>);
impl<T, L> LockedWrapper<T, L> for Locked<T, L>
where
T: Deref,
T::Target: Sized,
{
type AtLockLevel<'l, M> = Locked<&'l T::Target, M>
where
M: 'l,
T: 'l;
type CastWrapper<X> = Locked<X, L>
where
X: Deref,
X::Target: Sized;
fn wrap<'l, M>(locked: ExternalLocked<&'l T::Target, M>) -> Self::AtLockLevel<'l, M>
where
M: 'l,
T: 'l,
{
Locked(locked)
}
fn wrap_cast<R: Deref>(locked: ExternalLocked<R, L>) -> Self::CastWrapper<R>
where
R::Target: Sized,
{
Locked(locked)
}
fn get_mut(&mut self) -> &mut ExternalLocked<T, L> {
let Self(locked) = self;
locked
}
fn get(&self) -> &ExternalLocked<T, L> {
let Self(locked) = self;
locked
}
}
impl<'a, BT: BindingsTypes> CoreCtx<'a, BT, Unlocked> {
/// Creates a new `CoreCtx` from a borrowed [`StackState`].
pub fn new(stack_state: &'a StackState<BT>) -> Self {
Self(ExternalLocked::new(stack_state))
}
}
impl<'a, BT, R, L, T> Locked<T, L>
where
R: 'a,
T: Deref<Target = TupleWrapper<&'a StackState<BT>, &'a R>>,
BT: BindingsTypes,
{
pub(crate) fn cast_resource(&mut self) -> Locked<&'_ R, L> {
let Self(locked) = self;
Locked(locked.cast_with(|c| c.right()))
}
pub(crate) fn cast_core_ctx(&mut self) -> CoreCtx<'_, BT, L> {
let Self(locked) = self;
crate::CoreCtx::<BT, L>::wrap(locked.cast_with(|c| c.left()))
}
}
}
/// Fake implementations of context traits.
///
/// Each trait `Xxx` has a fake called `FakeXxx`. `FakeXxx` implements `Xxx`,
/// and `impl<T> FakeXxx for T` where either `T: AsRef<FakeXxx>` or `T:
/// AsMut<FakeXxx>` or both (depending on the trait). This allows fake
/// implementations to be composed easily - any container type need only provide
/// the appropriate `AsRef` and/or `AsMut` implementations, and the blanket impl
/// will take care of the rest.
#[cfg(any(test, feature = "testutils"))]
pub(crate) mod testutil {
use alloc::sync::Arc;
#[cfg(test)]
use alloc::vec;
#[cfg(test)]
use alloc::{
collections::{BinaryHeap, HashMap},
vec::Vec,
};
use core::fmt::Debug;
#[cfg(test)]
use core::{hash::Hash, marker::PhantomData, time::Duration};
use derivative::Derivative;
use net_types::ip::IpVersion;
#[cfg(test)]
use packet::Buf;
#[cfg(test)]
use crate::{
context::{ContextProvider, CounterContext, InstantContext},
device::{EthernetDeviceId, EthernetWeakDeviceId},
filter::{FilterBindingsTypes, FilterHandlerProvider},
testutil::DispatchedFrame,
};
use crate::{
device::{link::LinkDevice, pure_ip::PureIpWeakDeviceId, DeviceLayerTypes},
ip::device::nud::{LinkResolutionContext, LinkResolutionNotifier},
sync::Mutex,
};
pub use netstack3_base::testutil::{
FakeBindingsCtx, FakeCryptoRng, FakeEventCtx, FakeFrameCtx, FakeInstant, FakeInstantCtx,
FakeTimerCtx, FakeTimerCtxExt, FakeTracingCtx, InstantAndData, WithFakeFrameContext,
WithFakeTimerContext,
};
/// A tuple of device ID and IP version.
#[derive(Derivative)]
#[derivative(Debug(bound = ""))]
pub struct PureIpDeviceAndIpVersion<BT: DeviceLayerTypes> {
pub(crate) device: PureIpWeakDeviceId<BT>,
pub(crate) version: IpVersion,
}
impl<D: LinkDevice, Id, Event: Debug, State, FrameMeta> LinkResolutionContext<D>
for FakeBindingsCtx<Id, Event, State, FrameMeta>
{
type Notifier = FakeLinkResolutionNotifier<D>;
}
/// A fake implementation of [`LinkResolutionNotifier`].
#[derive(Debug)]
pub struct FakeLinkResolutionNotifier<D: LinkDevice>(
Arc<Mutex<Option<Result<D::Address, crate::error::AddressResolutionFailed>>>>,
);
impl<D: LinkDevice> LinkResolutionNotifier<D> for FakeLinkResolutionNotifier<D> {
type Observer =
Arc<Mutex<Option<Result<D::Address, crate::error::AddressResolutionFailed>>>>;
fn new() -> (Self, Self::Observer) {
let inner = Arc::new(Mutex::new(None));
(Self(inner.clone()), inner)
}
fn notify(self, result: Result<D::Address, crate::error::AddressResolutionFailed>) {
let Self(inner) = self;
let mut inner = inner.lock();
assert_eq!(*inner, None, "resolved link address was set more than once");
*inner = Some(result);
}
}
#[cfg(test)]
impl<CC, TimerId, Event: Debug, State> WithFakeTimerContext<TimerId>
for FakeCtxWithCoreCtx<CC, TimerId, Event, State>
{
fn with_fake_timer_ctx<O, F: FnOnce(&FakeTimerCtx<TimerId>) -> O>(&self, f: F) -> O {
let Self { core_ctx: _, bindings_ctx } = self;
f(&bindings_ctx.timers)
}
fn with_fake_timer_ctx_mut<O, F: FnOnce(&mut FakeTimerCtx<TimerId>) -> O>(
&mut self,
f: F,
) -> O {
let Self { core_ctx: _, bindings_ctx } = self;
f(&mut bindings_ctx.timers)
}
}
#[cfg(test)]
pub(crate) type FakeCtxWithCoreCtx<CC, TimerId, Event, BindingsCtxState> =
crate::testutil::ContextPair<CC, FakeBindingsCtx<TimerId, Event, BindingsCtxState, ()>>;
#[cfg(test)]
pub(crate) type FakeCtx<S, TimerId, Meta, Event, DeviceId, BindingsCtxState> =
FakeCtxWithCoreCtx<FakeCoreCtx<S, Meta, DeviceId>, TimerId, Event, BindingsCtxState>;
#[cfg(test)]
impl<CC, Id, Event: Debug, BindingsCtxState> AsRef<FakeInstantCtx>
for FakeCtxWithCoreCtx<CC, Id, Event, BindingsCtxState>
{
fn as_ref(&self) -> &FakeInstantCtx {
self.bindings_ctx.timers.as_ref()
}
}
#[cfg(test)]
impl<CC, Id, Event: Debug, BindingsCtxState> AsRef<FakeTimerCtx<Id>>
for FakeCtxWithCoreCtx<CC, Id, Event, BindingsCtxState>
{
fn as_ref(&self) -> &FakeTimerCtx<Id> {
&self.bindings_ctx.timers
}
}
#[cfg(test)]
impl<CC, Id, Event: Debug, BindingsCtxState> AsMut<FakeTimerCtx<Id>>
for FakeCtxWithCoreCtx<CC, Id, Event, BindingsCtxState>
{
fn as_mut(&mut self) -> &mut FakeTimerCtx<Id> {
&mut self.bindings_ctx.timers
}
}
#[cfg(test)]
impl<S, Id, Meta, Event: Debug, DeviceId, BindingsCtxState> AsMut<FakeFrameCtx<Meta>>
for FakeCtx<S, Id, Meta, Event, DeviceId, BindingsCtxState>
{
fn as_mut(&mut self) -> &mut FakeFrameCtx<Meta> {
&mut self.core_ctx.frames
}
}
#[cfg(test)]
impl<S, Id, Meta, Event: Debug, DeviceId, BindingsCtxState> WithFakeFrameContext<Meta>
for FakeCtx<S, Id, Meta, Event, DeviceId, BindingsCtxState>
{
fn with_fake_frame_ctx_mut<O, F: FnOnce(&mut FakeFrameCtx<Meta>) -> O>(
&mut self,
f: F,
) -> O {
f(&mut self.core_ctx.frames)
}
}
#[cfg(test)]
#[derive(Default)]
pub(crate) struct Wrapped<Outer, Inner> {
pub(crate) inner: Inner,
pub(crate) outer: Outer,
}
#[cfg(test)]
impl<Outer, Inner> ContextProvider for Wrapped<Outer, Inner> {
type Context = Self;
fn context(&mut self) -> &mut Self::Context {
self
}
}
#[cfg(test)]
pub(crate) type WrappedFakeCoreCtx<Outer, S, Meta, DeviceId> =
Wrapped<Outer, FakeCoreCtx<S, Meta, DeviceId>>;
#[cfg(test)]
impl<Outer, S, Meta, DeviceId> WrappedFakeCoreCtx<Outer, S, Meta, DeviceId> {
pub(crate) fn with_inner_and_outer_state(inner: S, outer: Outer) -> Self {
Self { inner: FakeCoreCtx::with_state(inner), outer }
}
}
#[cfg(test)]
impl<Outer, T, Inner: AsRef<T>> AsRef<T> for Wrapped<Outer, Inner> {
fn as_ref(&self) -> &T {
self.inner.as_ref()
}
}
#[cfg(test)]
impl<Outer, T, Inner: AsMut<T>> AsMut<T> for Wrapped<Outer, Inner> {
fn as_mut(&mut self) -> &mut T {
self.inner.as_mut()
}
}
/// A test helper used to provide an implementation of a core context.
#[cfg(test)]
#[derive(Derivative)]
#[derivative(Default(bound = "S: Default"))]
pub(crate) struct FakeCoreCtx<S, Meta, DeviceId> {
pub(crate) state: S,
pub(crate) frames: FakeFrameCtx<Meta>,
_devices_marker: PhantomData<DeviceId>,
}
#[cfg(test)]
impl<S, Meta, DeviceId> ContextProvider for FakeCoreCtx<S, Meta, DeviceId> {
type Context = Self;
fn context(&mut self) -> &mut Self::Context {
self
}
}
#[cfg(test)]
impl<S, Meta, DeviceId> AsRef<FakeCoreCtx<S, Meta, DeviceId>> for FakeCoreCtx<S, Meta, DeviceId> {
fn as_ref(&self) -> &FakeCoreCtx<S, Meta, DeviceId> {
self
}
}
#[cfg(test)]
impl<S, Meta, DeviceId> AsMut<FakeCoreCtx<S, Meta, DeviceId>> for FakeCoreCtx<S, Meta, DeviceId> {
fn as_mut(&mut self) -> &mut FakeCoreCtx<S, Meta, DeviceId> {
self
}
}
#[cfg(test)]
impl<I: packet_formats::ip::IpExt, BC: FilterBindingsTypes, S, Meta, DeviceId>
FilterHandlerProvider<I, BC> for FakeCoreCtx<S, Meta, DeviceId>
{
type Handler<'a> = crate::filter::NoopImpl where Self: 'a;
fn filter_handler(&mut self) -> Self::Handler<'_> {
crate::filter::NoopImpl
}
}
#[cfg(test)]
impl<Outer, I: packet_formats::ip::IpExt, BC: FilterBindingsTypes, S, Meta, DeviceId>
FilterHandlerProvider<I, BC> for Wrapped<Outer, FakeCoreCtx<S, Meta, DeviceId>>
{
type Handler<'a> = crate::filter::NoopImpl where Self: 'a;
fn filter_handler(&mut self) -> Self::Handler<'_> {
crate::filter::NoopImpl
}
}
#[cfg(test)]
impl<BC, S, Meta, DeviceId> CounterContext<BC> for FakeCoreCtx<S, Meta, DeviceId>
where
S: CounterContext<BC>,
{
fn with_counters<O, F: FnOnce(&BC) -> O>(&self, cb: F) -> O {
CounterContext::<BC>::with_counters(&self.state, cb)
}
}
#[cfg(test)]
impl<S, Meta, DeviceId> FakeCoreCtx<S, Meta, DeviceId> {
/// Constructs a `FakeCoreCtx` with the given state and default
/// `FakeTimerCtx`, and `FakeFrameCtx`.
pub(crate) fn with_state(state: S) -> Self {
FakeCoreCtx { state, frames: FakeFrameCtx::default(), _devices_marker: PhantomData }
}
/// Get an immutable reference to the inner state.
///
/// This method is provided instead of an [`AsRef`] impl to avoid
/// conflicting with user-provided implementations of `AsRef<T> for
/// FakeCtx<S, Id, Meta, Event>` for other types, `T`. It is named
/// `get_ref` instead of `as_ref` so that programmer doesn't need to
/// specify which `as_ref` method is intended.
pub(crate) fn get_ref(&self) -> &S {
&self.state
}
/// Get a mutable reference to the inner state.
///
/// `get_mut` is like `get_ref`, but it returns a mutable reference.
pub(crate) fn get_mut(&mut self) -> &mut S {
&mut self.state
}
/// Get the list of frames sent so far.
pub(crate) fn frames(&self) -> &[(Meta, Vec<u8>)] {
self.frames.frames()
}
/// Take the list of frames sent so far.
pub(crate) fn take_frames(&mut self) -> Vec<(Meta, Vec<u8>)> {
self.frames.take_frames()
}
/// Consumes the `FakeCoreCtx` and returns the inner state.
pub(crate) fn into_state(self) -> S {
self.state
}
}
#[cfg(test)]
impl<S, Meta, DeviceId> AsMut<FakeFrameCtx<Meta>> for FakeCoreCtx<S, Meta, DeviceId> {
fn as_mut(&mut self) -> &mut FakeFrameCtx<Meta> {
&mut self.frames
}
}
#[cfg(test)]
impl<S, Meta, DeviceId> WithFakeFrameContext<Meta> for FakeCoreCtx<S, Meta, DeviceId> {
fn with_fake_frame_ctx_mut<O, F: FnOnce(&mut FakeFrameCtx<Meta>) -> O>(
&mut self,
f: F,
) -> O {
f(&mut self.frames)
}
}
#[cfg(test)]
impl<Outer, Inner: WithFakeFrameContext<Meta>, Meta> WithFakeFrameContext<Meta>
for Wrapped<Outer, Inner>
{
fn with_fake_frame_ctx_mut<O, F: FnOnce(&mut FakeFrameCtx<Meta>) -> O>(
&mut self,
f: F,
) -> O {
self.inner.with_fake_frame_ctx_mut(f)
}
}
#[cfg(test)]
#[derive(Debug)]
pub(crate) struct PendingFrameData<CtxId, Meta> {
pub(crate) dst_context: CtxId,
pub(crate) meta: Meta,
pub(crate) frame: Vec<u8>,
}
#[cfg(test)]
pub(crate) type PendingFrame<CtxId, Meta> = InstantAndData<PendingFrameData<CtxId, Meta>>;
/// A fake network, composed of many `FakeCoreCtx`s.
///
/// Provides a utility to have many contexts keyed by `CtxId` that can
/// exchange frames.
#[cfg(test)]
pub(crate) struct FakeNetwork<CtxId, Ctx: FakeNetworkContext, Links>
where
Links: FakeNetworkLinks<Ctx::SendMeta, Ctx::RecvMeta, CtxId>,
{
links: Links,
current_time: FakeInstant,
pending_frames: BinaryHeap<PendingFrame<CtxId, Ctx::RecvMeta>>,
// Declare `contexts` last to ensure that it is dropped last. See
// https://doc.rust-lang.org/std/ops/trait.Drop.html#drop-order for
// details.
contexts: HashMap<CtxId, Ctx>,
}
/// A context which can be used with a [`FakeNetwork`].
#[cfg(test)]
pub(crate) trait FakeNetworkContext {
/// The type of timer IDs installed by this context.
type TimerId;
/// The type of metadata associated with frames sent by this context.
type SendMeta;
/// The type of metadata associated with frames received by this
/// context.
type RecvMeta;
/// Handles a single received frame in this context.
fn handle_frame(&mut self, recv: Self::RecvMeta, data: Buf<Vec<u8>>);
/// Handles a single timer id in this context.
fn handle_timer(&mut self, timer: Self::TimerId);
/// Processes any context-internal queues, returning `true` if any work
/// was done.
///
/// This is used to drive queued frames that may be sitting inside the
/// context and invisible to the [`FakeNetwork`].
fn process_queues(&mut self) -> bool;
}
/// A set of links in a `FakeNetwork`.
///
/// A `FakeNetworkLinks` represents the set of links in a `FakeNetwork`.
/// It exposes the link information by providing the ability to map from a
/// frame's sending metadata - including its context, local state, and
/// `SendMeta` - to the set of appropriate receivers, each represented by
/// a context ID, receive metadata, and latency.
#[cfg(test)]
pub(crate) trait FakeNetworkLinks<SendMeta, RecvMeta, CtxId> {
fn map_link(&self, ctx: CtxId, meta: SendMeta) -> Vec<(CtxId, RecvMeta, Option<Duration>)>;
}
#[cfg(test)]
impl<
SendMeta,
RecvMeta,
CtxId,
F: Fn(CtxId, SendMeta) -> Vec<(CtxId, RecvMeta, Option<Duration>)>,
> FakeNetworkLinks<SendMeta, RecvMeta, CtxId> for F
{
fn map_link(&self, ctx: CtxId, meta: SendMeta) -> Vec<(CtxId, RecvMeta, Option<Duration>)> {
(self)(ctx, meta)
}
}
/// The result of a single step in a `FakeNetwork`
#[cfg(test)]
#[derive(Debug)]
pub(crate) struct StepResult {
pub(crate) timers_fired: usize,
pub(crate) frames_sent: usize,
pub(crate) contexts_with_queued_frames: usize,
}
#[cfg(test)]
impl StepResult {
fn new(
timers_fired: usize,
frames_sent: usize,
contexts_with_queued_frames: usize,
) -> Self {
Self { timers_fired, frames_sent, contexts_with_queued_frames }
}
fn new_idle() -> Self {
Self::new(0, 0, 0)
}
/// Returns `true` if the last step did not perform any operations.
pub(crate) fn is_idle(&self) -> bool {
return self.timers_fired == 0
&& self.frames_sent == 0
&& self.contexts_with_queued_frames == 0;
}
}
#[cfg(test)]
impl<CtxId, Ctx, Links> FakeNetwork<CtxId, Ctx, Links>
where
CtxId: Eq + Hash + Copy + Debug,
Ctx: FakeNetworkContext,
Links: FakeNetworkLinks<Ctx::SendMeta, Ctx::RecvMeta, CtxId>,
{
/// Retrieves a context named `context`.
pub(crate) fn context<K: Into<CtxId>>(&mut self, context: K) -> &mut Ctx {
self.contexts.get_mut(&context.into()).unwrap()
}
pub(crate) fn with_context<K: Into<CtxId>, O, F: FnOnce(&mut Ctx) -> O>(
&mut self,
context: K,
f: F,
) -> O {
f(self.context(context))
}
}
#[cfg(test)]
impl<CtxId, Ctx, Links> FakeNetwork<CtxId, Ctx, Links>
where
CtxId: Eq + Hash + Copy + Debug,
Ctx: FakeNetworkContext
+ WithFakeTimerContext<Ctx::TimerId>
+ WithFakeFrameContext<Ctx::SendMeta>,
Ctx::TimerId: Clone,
Links: FakeNetworkLinks<Ctx::SendMeta, Ctx::RecvMeta, CtxId>,
{
/// Creates a new `FakeNetwork`.
///
/// Creates a new `FakeNetwork` with the collection of `FakeCoreCtx`s in
/// `contexts`. `Ctx`s are named by type parameter `CtxId`.
///
/// # Panics
///
/// Calls to `new` will panic if given a `FakeCoreCtx` with timer events.
/// `FakeCoreCtx`s given to `FakeNetwork` **must not** have any timer
/// events already attached to them, because `FakeNetwork` maintains
/// all the internal timers in dispatchers in sync to enable synchronous
/// simulation steps.
pub(crate) fn new<I: IntoIterator<Item = (CtxId, Ctx)>>(contexts: I, links: Links) -> Self {
let mut contexts = contexts.into_iter().collect::<HashMap<_, _>>();
// Take the current time to be the latest of the times of any of the
// contexts. This ensures that no context has state which is based
// on having observed a time in the future, which could cause bugs.
// For any contexts which have a time further in the past, it will
// appear as though time has jumped forwards, but that's fine. The
// only way that this could be a problem would be if a timer were
// installed which should have fired in the interim (code might
// become buggy in this case). However, we assert below that no
// timers are installed.
let latest_time = contexts
.iter()
.map(|(_, ctx)| ctx.with_fake_timer_ctx(|ctx| ctx.instant.time))
.max()
// If `max` returns `None`, it means that we were called with no
// contexts. That's kind of silly, but whatever - arbitrarily
// choose the current time as the epoch.
.unwrap_or(FakeInstant::default());
assert!(
!contexts
.iter()
.any(|(_, ctx)| { !ctx.with_fake_timer_ctx(|ctx| ctx.timers.is_empty()) }),
"can't start network with contexts that already have timers set"
);
// Synchronize all contexts' current time to the latest time of any
// of the contexts. See comment above for more details.
for (_, ctx) in contexts.iter_mut() {
ctx.with_fake_timer_ctx_mut(|ctx| ctx.instant.time = latest_time);
}
Self { contexts, current_time: latest_time, pending_frames: BinaryHeap::new(), links }
}
/// Iterates over pending frames in an arbitrary order.
pub(crate) fn iter_pending_frames(
&self,
) -> impl Iterator<Item = &PendingFrame<CtxId, Ctx::RecvMeta>> {
self.pending_frames.iter()
}
/// Drops all pending frames; they will not be delivered.
pub(crate) fn drop_pending_frames(&mut self) {
self.pending_frames.clear();
}
/// Performs a single step in network simulation.
///
/// `step` performs a single logical step in the collection of `Ctx`s
/// held by this `FakeNetwork`. A single step consists of the following
/// operations:
///
/// - All pending frames, kept in each `FakeCoreCtx`, are mapped to their
/// destination context/device pairs and moved to an internal
/// collection of pending frames.
/// - The collection of pending timers and scheduled frames is inspected
/// and a simulation time step is retrieved, which will cause a next
/// event to trigger. The simulation time is updated to the new time.
/// - All scheduled frames whose deadline is less than or equal to the
/// new simulation time are sent to their destinations, handled using
/// `handle_frame`.
/// - All timer events whose deadline is less than or equal to the new
/// simulation time are fired, handled using `handle_timer`.
///
/// If any new events are created during the operation of frames or
/// timers, they **will not** be taken into account in the current
/// `step`. That is, `step` collects all the pending events before
/// dispatching them, ensuring that an infinite loop can't be created as
/// a side effect of calling `step`.
///
/// The return value of `step` indicates which of the operations were
/// performed.
///
/// # Panics
///
/// If `FakeNetwork` was set up with a bad `links`, calls to `step` may
/// panic when trying to route frames to their context/device
/// destinations.
pub(crate) fn step(&mut self) -> StepResult
where
Ctx::TimerId: core::fmt::Debug,
{
self.step_with(|_, meta, buf| Some((meta, buf)))
}
/// Like [`FakeNetwork::step`], but receives a function
/// `filter_map_frame` that can modify the an inbound frame before
/// delivery or drop it altogether by returning `None`.
pub(crate) fn step_with<
F: FnMut(&mut Ctx, Ctx::RecvMeta, Buf<Vec<u8>>) -> Option<(Ctx::RecvMeta, Buf<Vec<u8>>)>,
>(
&mut self,
mut filter_map_frame: F,
) -> StepResult
where
Ctx::TimerId: core::fmt::Debug,
{
let mut ret = StepResult::new_idle();
// Drive all queues before checking for the network and time
// simulation.
for (_, ctx) in self.contexts.iter_mut() {
if ctx.process_queues() {
ret.contexts_with_queued_frames += 1;
}
}
self.collect_frames();
let next_step = if let Some(t) = self.next_step() {
t
} else {
return ret;
};
// This assertion holds the contract that `next_step` does not
// return a time in the past.
assert!(next_step >= self.current_time);
// Move time forward:
self.current_time = next_step;
for (_, ctx) in self.contexts.iter_mut() {
ctx.with_fake_timer_ctx_mut(|ctx| ctx.instant.time = next_step);
}
// Dispatch all pending frames:
while let Some(InstantAndData(t, _)) = self.pending_frames.peek() {
// TODO(https://github.com/rust-lang/rust/issues/53667): Remove
// this break once let_chains is stable.
if *t > self.current_time {
break;
}
// We can unwrap because we just peeked.
let PendingFrameData { dst_context, meta, frame } =
self.pending_frames.pop().unwrap().1;
let dst_context = self.context(dst_context);
if let Some((meta, frame)) =
filter_map_frame(dst_context, meta, Buf::new(frame, ..))
{
dst_context.handle_frame(meta, frame)
}
ret.frames_sent += 1;
}
// Dispatch all pending timers.
for (_, ctx) in self.contexts.iter_mut() {
// We have to collect the timers before dispatching them, to
// avoid an infinite loop in case handle_timer schedules another
// timer for the same or older FakeInstant.
let mut timers = Vec::<Ctx::TimerId>::new();
ctx.with_fake_timer_ctx_mut(|ctx| {
while let Some(InstantAndData(t, timer)) = ctx.timers.peek() {
// TODO(https://github.com/rust-lang/rust/issues/53667):
// Remove this break once let_chains is stable.
if *t > ctx.now() {
break;
}
timers.push(timer.dispatch_id.clone());
assert_ne!(ctx.timers.pop(), None);
}
});
for t in timers {
ctx.handle_timer(t);
ret.timers_fired += 1;
}
}
ret
}
/// Runs the network until it is starved of events.
///
/// # Panics
///
/// Panics if 1,000,000 steps are performed without becoming idle.
/// Also panics under the same conditions as [`step`].
pub(crate) fn run_until_idle(&mut self)
where
Ctx::TimerId: core::fmt::Debug,
{
self.run_until_idle_with(|_, meta, frame| Some((meta, frame)))
}
/// Like [`FakeNetwork::run_until_idle`] but receives a function
/// `filter_map_frame` that can modify the an inbound frame before
/// delivery or drop it altogether by returning `None`.
pub(crate) fn run_until_idle_with<
F: FnMut(&mut Ctx, Ctx::RecvMeta, Buf<Vec<u8>>) -> Option<(Ctx::RecvMeta, Buf<Vec<u8>>)>,
>(
&mut self,
mut filter_map_frame: F,
) where
Ctx::TimerId: core::fmt::Debug,
{
for _ in 0..1_000_000 {
if self.step_with(&mut filter_map_frame).is_idle() {
return;
}
}
panic!("FakeNetwork seems to have gotten stuck in a loop.");
}
/// Collects all queued frames.
///
/// Collects all pending frames and schedules them for delivery to the
/// destination context/device based on the result of `links`. The
/// collected frames are queued for dispatching in the `FakeNetwork`,
/// ordered by their scheduled delivery time given by the latency result
/// provided by `links`.
pub(crate) fn collect_frames(&mut self) {
let all_frames: Vec<(CtxId, Vec<(Ctx::SendMeta, Vec<u8>)>)> = self
.contexts
.iter_mut()
.filter_map(|(n, ctx)| {
ctx.with_fake_frame_ctx_mut(|ctx| {
let frames = ctx.take_frames();
if frames.is_empty() {
None
} else {
Some((n.clone(), frames))
}
})
})
.collect();
for (src_context, frames) in all_frames.into_iter() {
for (send_meta, frame) in frames.into_iter() {
for (dst_context, recv_meta, latency) in
self.links.map_link(src_context, send_meta)
{
self.pending_frames.push(PendingFrame::new(
self.current_time + latency.unwrap_or(Duration::from_millis(0)),
PendingFrameData { frame: frame.clone(), dst_context, meta: recv_meta },
));
}
}
}
}
/// Calculates the next `FakeInstant` when events are available.
///
/// Returns the smallest `FakeInstant` greater than or equal to the
/// current time for which an event is available. If no events are
/// available, returns `None`.
pub(crate) fn next_step(&self) -> Option<FakeInstant> {
// Get earliest timer in all contexts.
let next_timer = self
.contexts
.iter()
.filter_map(|(_, ctx)| {
ctx.with_fake_timer_ctx(|ctx| match ctx.timers.peek() {
Some(tmr) => Some(tmr.0),
None => None,
})
})
.min();
// Get the instant for the next packet.
let next_packet_due = self.pending_frames.peek().map(|t| t.0);
// Return the earliest of them both, and protect against returning a
// time in the past.
match next_timer {
Some(t) if next_packet_due.is_some() => Some(t).min(next_packet_due),
Some(t) => Some(t),
None => next_packet_due,
}
.map(|t| t.max(self.current_time))
}
}
#[cfg(test)]
impl<CtxId, Links, CC, BC> FakeNetwork<CtxId, crate::testutil::ContextPair<CC, BC>, Links>
where
crate::testutil::ContextPair<CC, BC>: FakeNetworkContext,
CtxId: Eq + Hash + Copy + Debug,
Links: FakeNetworkLinks<
<crate::testutil::ContextPair<CC, BC> as FakeNetworkContext>::SendMeta,
<crate::testutil::ContextPair<CC, BC> as FakeNetworkContext>::RecvMeta,
CtxId,
>,
{
/// Retrieves a `FakeCoreCtx` named `context`.
pub(crate) fn core_ctx<K: Into<CtxId>>(&mut self, context: K) -> &mut CC {
let crate::testutil::ContextPair { core_ctx, bindings_ctx: _ } = self.context(context);
core_ctx
}
/// Retrieves a `FakeBindingsCtx` named `context`.
pub(crate) fn bindings_ctx<K: Into<CtxId>>(&mut self, context: K) -> &mut BC {
let crate::testutil::ContextPair { core_ctx: _, bindings_ctx } = self.context(context);
bindings_ctx
}
}
/// Creates a new [`FakeNetwork`] of [`Ctx`]s in a simple two-host
/// configuration.
///
/// Two hosts are created with the given names. Packets emitted by one
/// arrive at the other and vice-versa.
#[cfg(test)]
pub(crate) fn new_simple_fake_network<CtxId: Copy + Debug + Hash + Eq>(
a_id: CtxId,
a: crate::testutil::FakeCtx,
a_device_id: EthernetWeakDeviceId<crate::testutil::FakeBindingsCtx>,
b_id: CtxId,
b: crate::testutil::FakeCtx,
b_device_id: EthernetWeakDeviceId<crate::testutil::FakeBindingsCtx>,
) -> FakeNetwork<
CtxId,
crate::testutil::FakeCtx,
impl FakeNetworkLinks<
DispatchedFrame,
EthernetDeviceId<crate::testutil::FakeBindingsCtx>,
CtxId,
>,
> {
let contexts = vec![(a_id, a), (b_id, b)].into_iter();
FakeNetwork::new(contexts, move |net, _frame: DispatchedFrame| {
if net == a_id {
b_device_id
.upgrade()
.map(|device_id| (b_id, device_id, None))
.into_iter()
.collect::<Vec<_>>()
} else {
a_device_id
.upgrade()
.map(|device_id| (a_id, device_id, None))
.into_iter()
.collect::<Vec<_>>()
}
})
}
}