Check whether some entry `(p2, n2)` in `l2` with `p2 ⊆ p1` contains a variable node that dominates `(w, off)`: i.e., some `v ∈ n_p2.var` with `v.idx == w && v.offset >= off`. Because `v.idx` is always in `p2`, the matching p2 automatically has `w ∈ p2 ⊆ p1`, keeping the branch analysis consistent.
(l2: &NormLevel, p1: &[u64], w: u64, off: u64)
| 593 | is_subset(p2, p1) |
| 594 | && (c <= n2.constant || n2.var.iter().any(|v| c <= v.offset + 1)) |
| 595 | }) |
| 596 | } |
| 597 | |
| 598 | /// Check whether some entry `(p2, n2)` in `l2` with `p2 ⊆ p1` contains a |
| 599 | /// variable node that dominates `(w, off)`: i.e., some `v ∈ n_p2.var` with |
| 600 | /// `v.idx == w && v.offset >= off`. Because `v.idx` is always in `p2`, the |
| 601 | /// matching p2 automatically has `w ∈ p2 ⊆ p1`, keeping the branch analysis |
| 602 | /// consistent. |
no test coverage detected