Struct MemoryAccess

pub struct MemoryAccess<A: Arch> {
    pub kind: AccessKind,
    pub inputs: Inputs<A>,
    pub size: Range<u64>,
    pub calculation: AddressComputation,
    pub alignment: usize,
}

A memory access.

Fields

kind: AccessKind

The type of access that is performed.

inputs: Inputs<A>

The inputs for calculation.

size: Range<u64>

The determined size range of the access. The lower bound is the largest number of bytes that could be observed as being acesssed. The upper bound is set to one below the smallest byte index for which we could observe that it was not accessed.

calculation: AddressComputation

A simple expression for the calculation of the address of the form i1 + i2 + .. + i_k * c + i_k+1 + i_k+1 .. i_n + c. That is, all inputs are summed, one input can be multiplied by a certain factor, which is then offset by a constant value c. This allows for the computation of most common addresses. It speeds up enumeration by ~20% on average up to ~40% in extreme cases. Obviously the speedup gets bigger if the amount of memory accesses increases or if the number of randomize_new() and adapt() calls is greater.

alignment: usize

An alignment of 1 means that every address is OK. An alignment of 2 means that only addresses of the form 2n are ok. An alignment of 4 means that addresses of the form 4n are OK. Etc. NOTE: Only powers of 2 are acceptable values. Any other value will produce unspecified behavior.

Implementations

impl<A: Arch> MemoryAccess<A>

pub fn inputs(&self) -> &Inputs<A>

The inputs of the address calculation.

pub fn compute_address(&self, state: &SystemState<A>) -> Addr

Computes the address that this memory access will access, given the provided CPU state.

pub fn has_fixed_addr(&self) -> bool

Returns true if the memory address is fixed or only dependent on immediate values in the instruction.

pub fn compute_fixed_addr(&self) -> Addr

Computes the fixed address for this access. Only returns a valid value if Self::has_fixed_addr returns true.

Trait Implementations

impl<A: Clone + Arch> Clone for MemoryAccess<A>

fn clone(&self) -> MemoryAccess<A>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<A: Arch> Debug for MemoryAccess<A>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, A: Arch> Deserialize<'de> for MemoryAccess<A>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<A: Arch> Display for MemoryAccess<A>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<A: Hash + Arch> Hash for MemoryAccess<A>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<A> JsonSchema for MemoryAccess<A>

where A: JsonSchema + Arch, A::Reg: JsonSchema,

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl<A: PartialEq + Arch> PartialEq for MemoryAccess<A>

fn eq(&self, other: &MemoryAccess<A>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A: Arch> Serialize for MemoryAccess<A>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<A: Eq + Arch> Eq for MemoryAccess<A>

impl<A: Arch> StructuralPartialEq for MemoryAccess<A>