pub enum CfaRule<T: ReaderOffset> {
RegisterAndOffset {
register: Register,
offset: i64,
},
Expression(UnwindExpression<T>),
}
Expand description
The canonical frame address (CFA) recovery rules.
Variants§
RegisterAndOffset
The CFA is given offset from the given register’s value.
Fields
Expression(UnwindExpression<T>)
The CFA is obtained by evaluating this Reader
as a DWARF expression
program.
Trait Implementations§
source§impl<T: ReaderOffset> Default for CfaRule<T>
impl<T: ReaderOffset> Default for CfaRule<T>
impl<T: Eq + ReaderOffset> Eq for CfaRule<T>
impl<T: ReaderOffset> StructuralPartialEq for CfaRule<T>
Auto Trait Implementations§
impl<T> Freeze for CfaRule<T>where
T: Freeze,
impl<T> RefUnwindSafe for CfaRule<T>where
T: RefUnwindSafe,
impl<T> Send for CfaRule<T>where
T: Send,
impl<T> Sync for CfaRule<T>where
T: Sync,
impl<T> Unpin for CfaRule<T>where
T: Unpin,
impl<T> UnwindSafe for CfaRule<T>where
T: UnwindSafe,
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.