pub enum RegionOutcome {
Completed,
Deopt,
DeoptAt {
resume_pc: usize,
},
}Expand description
What one native region run produced.
Variants§
Completed
The region ran to its exit; write-back may proceed.
Deopt
Side exit: discard the private frame (NO write-back) and let the bytecode loop re-run from the head — VM registers are untouched, so the replay recomputes deterministically up to the faulting op.
DeoptAt
PRECISE side exit: the region’s non-array scalar registers are live in
the frame; materialize them into the VM registers and resume the
bytecode AT resume_pc (the faulting op) — no replay-from-head, no
buffer truncate. This is the contract that lets a region with a
ListPush coexisting with an in-place SetIndex (BFS-style worklists)
tier up soundly: completed iterations’ effects stand, and the faulting
op re-runs once on bytecode (raising the exact error or continuing).
Trait Implementations§
Source§impl Clone for RegionOutcome
impl Clone for RegionOutcome
Source§fn clone(&self) -> RegionOutcome
fn clone(&self) -> RegionOutcome
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for RegionOutcome
impl Debug for RegionOutcome
Source§impl PartialEq for RegionOutcome
impl PartialEq for RegionOutcome
Source§fn eq(&self, other: &RegionOutcome) -> bool
fn eq(&self, other: &RegionOutcome) -> bool
self and other values to be equal, and is used by ==.impl Copy for RegionOutcome
impl Eq for RegionOutcome
impl StructuralPartialEq for RegionOutcome
Auto Trait Implementations§
impl Freeze for RegionOutcome
impl RefUnwindSafe for RegionOutcome
impl Send for RegionOutcome
impl Sync for RegionOutcome
impl Unpin for RegionOutcome
impl UnsafeUnpin for RegionOutcome
impl UnwindSafe for RegionOutcome
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.