rsleigh 0.4.2

SLEIGH (.slaspec) parser and Rust decoder/P-code emitter codegen — Ghidra-compatible disassembly in pure Rust
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77

use super::execution::ExportLen;
use crate::pattern::BitConstraint;
use crate::semantic::display::Display;
use crate::semantic::execution::Execution;
use crate::semantic::pattern::{Pattern, PatternLen};
use crate::Span;

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct ConstructorId(pub usize);

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct VariantId(pub usize);

#[derive(Clone, Debug)]
pub struct Constructor {
    pub pattern: Pattern,
    pub display: Display,
    pub execution: Option<Execution>,
    pub location: Span,
    // the bit pattern for all possible variants in the pattern,
    // impossible variants are simply not present here
    // TODO VariantId is the position on the vector, just use the index
    #[allow(clippy::type_complexity)]
    pub(crate) variants_bits: Box<[(VariantId, Box<[BitConstraint]>, Box<[BitConstraint]>)]>,
}

impl Constructor {
    pub fn variants(
        &self,
    ) -> impl Iterator<Item = (VariantId, &'_ [BitConstraint], &'_ [BitConstraint])> {
        self.variants_bits
            .iter()
            .map(|(id, context, token)| (*id, context.as_ref(), token.as_ref()))
    }
    /// return the variant constraint for the context and pattern
    pub fn variant(&self, id: VariantId) -> (&[BitConstraint], &[BitConstraint]) {
        self.variants_bits
            .iter()
            .find(|(current, _, _)| *current == id)
            .map(|(_, c, t)| (c.as_ref(), t.as_ref()))
            .unwrap()
    }
}

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct Matcher {
    pub constructor: ConstructorId,
    pub variant_id: VariantId,
}

#[derive(Clone, Debug)]
pub struct Table {
    pub(crate) name: Box<str>,
    pub(crate) is_root: bool,
    pub(crate) constructors: Box<[Constructor]>,
    pub matcher_order: Box<[Matcher]>,
    pub export: Option<ExportLen>,
    pub pattern_len: PatternLen,
}

impl Table {
    pub fn is_root(&self) -> bool {
        self.is_root
    }
    pub fn name(&self) -> &str {
        &self.name
    }
    pub fn constructors(&self) -> &[Constructor] {
        &self.constructors
    }
    pub fn constructor(&self, id: ConstructorId) -> &Constructor {
        &self.constructors[id.0]
    }
    pub fn matcher_order(&self) -> &[Matcher] {
        &self.matcher_order
    }
}