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
//! Zip any.
use std::marker::PhantomData;
use super::*;
/// Extension trait for `zip_any`.
pub trait ZipAnyExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any.
fn zip_any(self) -> Self::E;
}
/// Hazard specification for zip-any with two interfaces.
#[derive(Debug, Clone, Copy)]
pub struct ZipAnyH<H1: Hazard, H2: Hazard> {
_marker: PhantomData<(H1, H2)>,
}
impl<H1: Hazard, H2: Hazard> Hazard for ZipAnyH<H1, H2> {
type P = (HOption<H1::P>, HOption<H2::P>);
type R = (H1::R, H2::R);
fn ready((p1, p2): Self::P, (r1, r2): Self::R) -> bool {
p1.is_some_and(|p| H1::ready(p, r1)) || p2.is_some_and(|p| H2::ready(p, r2))
}
}
impl<H1: Hazard, H2: Hazard, const D: Dep> ZipAnyExt for (I<H1, D>, I<H2, D>) {
type E = I<ZipAnyH<H1, H2>, D>;
/// Zips any of the two hazard interfaces.
///
/// Ingress transfers and an egress transfer happen as soon as any of the ingress transfer conditions are satisfied.
/// Note that the ingress transfers happen only for the interfaces whose transfer condition is satisfied.
///
/// To achieve this, the egress interface's hazard is `ZipAnyH` with ready condition "any of the ingress interfaces'
/// transfer conditions are true".
///
/// - Payloads: Wrapped in another `HOption`. The outer `HOption` is `Some` if any of the payloads are `Some`.
/// - Resolver: Preserved.
///
/// | Interface | Ingress | Egress |
/// | :-------: | ---------------------------------- | ------------------------------------------- |
/// | **Fwd** | `(HOption<H1::P>, HOption<H2::P>)` | `HOption<(HOption<H1::P>, HOption<H2::P>)>` |
/// | **Bwd** | `(H1::R, H2::R)` | `(H1::R, H2::R)` |
fn zip_any(self) -> I<ZipAnyH<H1, H2>, D> {
unsafe {
self.fsm::<I<ZipAnyH<H1, H2>, D>, ()>((), |(ip1, ip2), er, s| {
let ep = if ip1.is_some() || ip2.is_some() { Some((ip1, ip2)) } else { None };
(ep, er, s)
})
}
}
}
// TODO: Add 4 to 12-tuple variants.
/// Hazard specification for zip-any with 3 interfaces.
#[derive(Debug, Clone, Copy)]
pub struct ZipAny3H<H1: Hazard, H2: Hazard, H3: Hazard> {
_marker: PhantomData<(H1, H2, H3)>,
}
impl<H1: Hazard, H2: Hazard, H3: Hazard> Hazard for ZipAny3H<H1, H2, H3> {
type P = (HOption<H1::P>, HOption<H2::P>, HOption<H3::P>);
type R = (H1::R, H2::R, H3::R);
fn ready((p1, p2, p3): Self::P, (r1, r2, r3): Self::R) -> bool {
p1.is_some_and(|p| H1::ready(p, r1))
|| p2.is_some_and(|p| H2::ready(p, r2))
|| p3.is_some_and(|p| H3::ready(p, r3))
}
}
impl<H1: Hazard, H2: Hazard, H3: Hazard, const D: Dep> ZipAnyExt for (I<H1, D>, I<H2, D>, I<H3, D>) {
type E = I<ZipAny3H<H1, H2, H3>, D>;
/// A variation of [`zip_any`] for 3 hazard interfaces. See the 2-tuple version for more information.
fn zip_any(self) -> I<ZipAny3H<H1, H2, H3>, D> {
unsafe {
self.fsm::<I<ZipAny3H<H1, H2, H3>, D>, ()>((), |(ip1, ip2, ip3), er, s| {
let ep = if ip1.is_some() || ip2.is_some() || ip3.is_some() { Some((ip1, ip2, ip3)) } else { None };
(ep, er, s)
})
}
}
}
// TODO: Add 3 to 12-tuple variants of `zip_any_i_valid_h`, `zip_any_i_vr_h`, `zip_any_vr`.
// TODO(kjh): Better name?
/// Extension trait for `zip_any_i_valid_h`.
pub trait ZipAnyIValidHExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any `I<ValidH<_, _>, _>`.
fn zip_any_i_valid_h(self) -> Self::E;
}
impl<P1: Copy, R1: Copy, P2: Copy, R2: Copy, const D: Dep> ZipAnyIValidHExt
for (I<ValidH<P1, R1>, D>, I<ValidH<P2, R2>, D>)
{
type E = I<ValidH<(HOption<P1>, HOption<P2>), (R1, R2)>, D>;
/// TODO(kjh): Documentation
fn zip_any_i_valid_h(self) -> I<ValidH<(HOption<P1>, HOption<P2>), (R1, R2)>, D> {
unsafe {
self.fsm((), |(ip1, ip2), er: (R1, R2), ()| {
let ep = if ip1.is_some() || ip2.is_some() { Some((ip1, ip2)) } else { None };
let ir = er;
(ep, ir, ())
})
}
}
}
/// Extension trait for `zip_any_valid`.
pub trait ZipAnyValidExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any valid.
fn zip_any_valid(self) -> Self::E;
}
impl<P1: Copy, P2: Copy> ZipAnyValidExt for (Valid<P1>, Valid<P2>) {
type E = Valid<(HOption<P1>, HOption<P2>)>;
/// Zips any of the two valid interfaces.
///
/// - Payloads: Wrapped in another `HOption`. The outer `HOption` is `Some` if any of the payloads are `Some`.
/// - Resolver: The resolver carries no information.
///
/// | Interface | Ingress | Egress |
/// | :-------: | ---------------------------- | ------------------------------------- |
/// | **Fwd** | `(HOption<P1>, HOption<P2>)` | `HOption<(HOption<P1>, HOption<P2>)>` |
/// | **Bwd** | `((), ())` | `()` |
fn zip_any_valid(self) -> Valid<(HOption<P1>, HOption<P2>)> {
self.zip_any_i_valid_h().map_resolver::<()>(|_| ((), ()))
}
}
macro_rules! impl_valid_zip_any_valid {
($($P:ident),+) => {
impl<$($P: Copy,)+> ZipAnyValidExt for ($(Valid<$P>,)+) {
type E = Valid<($(HOption<$P>,)+)>;
/// A variation of [`zip_any_valid`](zip_any) for 3-12 valid interfaces. See the 2-tuple version for more
/// information.
fn zip_any_valid(self) -> Valid<($(HOption<$P>,)+)> {
unsafe {
// This is a hack that uses `P1`, `P2`, ... as variable names.
#[allow(non_snake_case)]
self.fsm((), |($($P,)+), (), ()| {
(if $($P.is_some())||+ { Some(($($P,)+)) } else { None }, ($(replace!($P, ()),)+), ())
})
}
}
}
};
}
impl_valid_zip_any_valid! { P1, P2, P3 }
impl_valid_zip_any_valid! { P1, P2, P3, P4 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6, P7 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6, P7, P8 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6, P7, P8, P9 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6, P7, P8, P9, P10 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6, P7, P8, P9, P10, P11 }
impl_valid_zip_any_valid! { P1, P2, P3, P4, P5, P6, P7, P8, P9, P10, P11, P12 }
// TODO(kjh): Better name?
/// Extension trait for `zip_any_i_vr_h`.
pub trait ZipAnyIVrHExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any `I<VrH<_, _>, _>`.
fn zip_any_i_vr_h(self) -> Self::E;
}
impl<P1: Copy, R1: Copy, P2: Copy, R2: Copy, const D: Dep> ZipAnyIVrHExt for (I<VrH<P1, R1>, D>, I<VrH<P2, R2>, D>) {
type E = I<VrH<(HOption<P1>, HOption<P2>), (R1, R2)>, D>;
/// TODO(kjh): Documentation
fn zip_any_i_vr_h(self) -> I<VrH<(HOption<P1>, HOption<P2>), (R1, R2)>, D> {
unsafe {
self.fsm((), |(ip1, ip2), er: Ready<(R1, R2)>, ()| {
let ep = if ip1.is_some() || ip2.is_some() { Some((ip1, ip2)) } else { None };
let ir1 = Ready::new(er.ready, er.inner.0);
let ir2 = Ready::new(er.ready, er.inner.1);
(ep, (ir1, ir2), ())
})
}
}
}
/// Extension trait for `zip_any_vr`.
pub trait ZipAnyVrExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any valid-ready.
fn zip_any_vr(self) -> Self::E;
}
impl<P1: Copy, P2: Copy, const D: Dep> ZipAnyVrExt for (Vr<P1, D>, Vr<P2, D>) {
type E = Vr<(HOption<P1>, HOption<P2>), D>;
/// TODO(kjh): Documentation
fn zip_any_vr(self) -> Vr<(HOption<P1>, HOption<P2>), D> {
self.zip_any_i_vr_h().map_resolver::<()>(|_| ((), ()))
}
}
/// Extension trait for `zip_any_vr_h`.
pub trait ZipAnyIVrHArrExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any `I<VrH<_, _>, _>`.
fn zip_any_i_vr_h(self) -> Self::E;
}
impl<P: Copy, R: Copy, const D: Dep, const N: usize> ZipAnyIVrHArrExt for [I<VrH<P, R>, D>; N] {
type E = I<VrH<Array<HOption<P>, N>, [R; N]>, D>;
/// Zips any of the `N` hazard interfaces.
///
/// - Payloads: Wrapped in another `HOption`. The outer `HOption` is `Some` if any of the payloads are `Some`.
/// - Resolver: Preserved.
///
/// | Interface | Ingress | Egress |
/// | :-------: | ---------------------------------- | ------------------------------------------- |
/// | **Fwd** | `(HOption<P>, HOption<P>, ...)` | `HOption<(HOption<P>, HOption<P>, ...)>` |
/// | **Bwd** | `(R, R, ...)` | `(R, R, ...)` |
fn zip_any_i_vr_h(self) -> Self::E {
unsafe {
self.fsm((), |ips, er: Ready<[R; N]>, ()| {
let ep = if ips.any(|ip| ip.is_some()) { Some(ips) } else { None };
let irs = Array::from(er.inner).map(|inner| Ready::new(er.ready, inner));
(ep, irs, ())
})
}
}
}
/// Extension trait for `zip_any_vr`.
pub trait ZipAnyVrArrExt: Interface {
/// Egress interface.
type E: Interface;
/// Zip-any valid-ready.
fn zip_any_vr(self) -> Self::E;
}
impl<P: Copy, const D: Dep, const N: usize> ZipAnyVrArrExt for [Vr<P, D>; N] {
type E = Vr<Array<HOption<P>, N>, D>;
/// Zips any of the `N` valid-ready interfaces.
///
/// - Payloads: Wrapped in another `HOption`. The outer `HOption` is `Some` if any of the payloads are `Some`.
/// - Resolver: Ignored.
///
/// | Interface | Ingress | Egress |
/// | :-------: | ---------------------------- | ------------------------------------- |
/// | **Fwd** | `(HOption<P>, HOption<P>, ...)` | `HOption<(HOption<P>, HOption<P>, ...)>` |
/// | **Bwd** | `((), ())` | `()` |
fn zip_any_vr(self) -> Self::E {
self.zip_any_i_vr_h().map_resolver::<()>(|_| [(); N])
}
}