crackers 0.9.0

A tool for synthesizing Code Reuse Attacks (ROP chains) using Ghidra's p-code and Z3
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

use std::fmt::{Display, Formatter};

use colored::Colorize;

use crate::synthesis::pcode_theory::conflict_clause::ConflictClause;
use crate::synthesis::slot_assignments::SlotAssignments;

pub(crate) struct SlotAssignmentConflictDisplay<'a> {
    pub(crate) assignment: &'a SlotAssignments,
    pub(crate) conflict: &'a ConflictClause,
}

impl Display for SlotAssignmentConflictDisplay<'_> {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        match self.conflict.precondition {
            true => write!(f, "!")?,
            false => write!(f, " ")?,
        };
        write!(f, "[")?;
        let unit = self.conflict.decisions().len() == 1;
        for (i, assignment) in self.assignment.choices.iter().enumerate() {
            let token = if self.conflict.includes_index(i) {
                if unit {
                    format!("{assignment:04}").red()
                } else {
                    format!("{assignment:04}").yellow()
                }
            } else {
                format!("{assignment:04}").normal()
            };
            if i > 0 {
                write!(f, ", {token}")?;
            } else {
                write!(f, "{token}")?;
            }
        }
        write!(f, "]")?;
        match self.conflict.postcondition {
            true => write!(f, "!")?,
            false => write!(f, " ")?,
        };
        Ok(())
    }
}