pub struct Liveness {
pub order_index: HashMap<NodeId, usize>,
pub order: Vec<NodeId>,
pub last_index: usize,
pub intervals: HashMap<ValueId, Interval>,
pub owners: Vec<ValueId>,
}Expand description
Result of liveness analysis over a graph.
Fields§
§order_index: HashMap<NodeId, usize>Topological position of each live node.
order: Vec<NodeId>Node ids in topological order.
last_index: usizeIndex of the last node (0 for an empty/single-node schedule).
intervals: HashMap<ValueId, Interval>Live interval of each buffer owner (never a view, input, or weight).
owners: Vec<ValueId>Owners in deterministic allocation order: ascending def, then id.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Liveness
impl RefUnwindSafe for Liveness
impl Send for Liveness
impl Sync for Liveness
impl Unpin for Liveness
impl UnsafeUnpin for Liveness
impl UnwindSafe for Liveness
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more