pub enum CfaRule<R: Reader> {
RegisterAndOffset {
register: Register,
offset: i64,
},
Expression(Expression<R>),
}
Expand description
The canonical frame address (CFA) recovery rules.
Variants§
RegisterAndOffset
Fields
The CFA is given offset from the given register’s value.
Expression(Expression<R>)
The CFA is obtained by evaluating this Reader
as a DWARF expression
program.
Trait Implementations§
source§impl<R: PartialEq + Reader> PartialEq for CfaRule<R>
impl<R: PartialEq + Reader> PartialEq for CfaRule<R>
impl<R: Eq + Reader> Eq for CfaRule<R>
impl<R: Reader> StructuralEq for CfaRule<R>
impl<R: Reader> StructuralPartialEq for CfaRule<R>
Auto Trait Implementations§
impl<R> RefUnwindSafe for CfaRule<R>where
R: RefUnwindSafe,
impl<R> Send for CfaRule<R>where
R: Send,
impl<R> Sync for CfaRule<R>where
R: Sync,
impl<R> Unpin for CfaRule<R>where
R: Unpin,
impl<R> UnwindSafe for CfaRule<R>where
R: 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
§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
Checks if this value is equivalent to the given key. Read more
§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
Compare self to
key
and return true
if they are equal.