Struct cwe_checker_lib::intermediate_representation::Term

pub struct Term<T> {
    pub tid: Tid,
    pub term: T,
}

A term is an object inside a binary with an address and an unique ID (both contained in the tid).

Fields

tid: Tid

The term identifier, which also contains the address of the term

term: T

The object

Implementations

impl Term<Def>

pub fn check_for_zero_extension( &self, output_name: String, output_sub_register: String ) -> Option<Tid>

This function checks whether the instruction is a zero extension of the overwritten sub register of the previous instruction. If so, returns its TID

pub fn substitute_input_var( &mut self, input_var: &Variable, replace_with_expression: &Expression )

Substitute every occurence of input_var in the address and value expressions with replace_with_expression. Does not change the target variable of assignment- and load-instructions.

impl Term<Blk>

pub fn remove_nonexisting_indirect_jump_targets( &mut self, all_jump_targets: &HashSet<Tid> ) -> Result<(), Vec<LogMessage>>

Remove indirect jump target addresses for which no corresponding target block exists.

Returns an error message for each removed address.

pub fn artificial_sink(id_suffix: &str) -> Self

Returns a new artificial sink block with the given suffix attached to its ID.

impl Term<Sub>

pub fn id_suffix(&self) -> String

Returns the ID suffix for this function.

pub fn has_artifical_sink(&self) -> bool

Returns true iff the function has an artificial sink block.

pub fn artificial_sink() -> Self

Returns a new artificial sink sub.

pub fn add_artifical_sink(&mut self) -> bool

Adds an artificial sink block if there is none.

Returns true iff the artificial sink block was added.

impl Term<Sub>

pub fn into_ir_sub_term(self, generic_pointer_size: ByteSize) -> Term<IrSub>

Convert a Sub term in the P-Code representation to a Sub term in the intermediate representation. The conversion also repairs the order of the basic blocks in the blocks array of the Sub in the sense that the first block of the array is required to also be the function entry point after the conversion.

Trait Implementations

impl<T: Clone> Clone for Term<T>

fn clone(&self) -> Term<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Term<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for Term<T>

where T: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Hash> Hash for Term<T>

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<T: PartialEq> PartialEq for Term<T>

fn eq(&self, other: &Term<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T> Serialize for Term<T>

where T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq> Eq for Term<T>

impl<T> StructuralEq for Term<T>

impl<T> StructuralPartialEq for Term<T>