symjit 2.16.2

a lightweight just-in-time (JIT) optimizer compiler
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
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143

use std::cell::RefCell;
use std::collections::HashMap;
use std::fmt;
use std::hash::{Hash, Hasher};
use std::rc::Rc;

use crate::config::{SLICE_CAP, SPILL_AREA};

#[derive(Clone, Copy, PartialEq, Eq, Hash)]
pub enum Loc {
    Stack(u32),
    Mem(u32),
    Param(u32),
}

impl fmt::Debug for Loc {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            Loc::Mem(idx) => write!(f, "Mem[{}]", idx),
            Loc::Stack(idx) => write!(f, "Stack[{}]", idx),
            Loc::Param(idx) => write!(f, "Param[{}]", idx),
        }
    }
}

impl Loc {
    pub fn imag(&self) -> Loc {
        match self {
            Loc::Mem(idx) => Loc::Mem(1 + idx),
            Loc::Stack(idx) => Loc::Stack(1 + idx),
            Loc::Param(idx) => Loc::Param(1 + idx),
        }
    }
}

#[derive(Clone)]
pub struct Symbol {
    pub _name: String,
    pub loc: Loc,
    pub visited: bool,
    pub reg: Option<u8>,
}

impl fmt::Debug for Symbol {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self.loc {
            Loc::Stack(idx) => write!(f, "{} in Stack[{}]", self._name, idx),
            Loc::Param(idx) => write!(f, "{} in Param[{}]", self._name, idx),
            Loc::Mem(idx) => write!(f, "{} in Mem[{}]", self._name, idx),
        }
    }
}

impl Hash for Symbol {
    fn hash<H: Hasher>(&self, state: &mut H) {
        self._name.hash(state);
    }
}

#[derive(Debug, Clone)]
pub struct SymbolTable {
    pub syms: HashMap<String, Rc<RefCell<Symbol>>>,
    pub num_stack: usize,
    pub num_mem: usize,
    pub num_param: usize,
    pub slot_size: usize,
}

impl SymbolTable {
    pub fn new(is_complex: bool) -> SymbolTable {
        let mut s = SymbolTable {
            syms: HashMap::new(),
            num_stack: 0,
            num_mem: 0,
            num_param: 0,
            slot_size: 1,
        };

        /*
           The spill area has two functions:

           1, As storage area for fast functions to store arguments
               passed in registers (up to 4 in Windows and 8 otherwise).
           2. To preserve registers XMM6-XMM15 in Windows (if needed).
        */

        for i in 0..SPILL_AREA {
            s.add_stack(&format!("μ{}", i));
        }

        if is_complex {
            s.slot_size = 2;
        }

        for i in 0..SLICE_CAP {
            s.add_stack(&format!("__Arg{}", i));
        }

        s
    }

    fn add_sym(&mut self, name: &str, loc: Loc) {
        let sym = Rc::new(RefCell::new(Symbol {
            _name: name.to_string(),
            loc,
            visited: false,
            reg: None,
        }));
        self.syms.insert(name.to_string(), sym);
    }

    pub fn add_mem(&mut self, name: &str) {
        if self.find_sym(name).is_none() {
            let loc = Loc::Mem(self.num_mem as u32);
            self.num_mem += self.slot_size;
            self.add_sym(name, loc);
        }
    }

    pub fn add_param(&mut self, name: &str) {
        if self.find_sym(name).is_none() {
            let loc = Loc::Param(self.num_param as u32);
            self.num_param += self.slot_size;
            self.add_sym(name, loc);
        }
    }

    pub fn add_stack(&mut self, name: &str) {
        if self.find_sym(name).is_none() {
            let loc = Loc::Stack(self.num_stack as u32);
            self.num_stack += self.slot_size;
            self.add_sym(name, loc);
        }
    }

    pub fn find_sym(&self, name: &str) -> Option<Rc<RefCell<Symbol>>> {
        self.syms.get(name).map(Rc::clone)
    }

    pub fn contains(&self, name: &str) -> bool {
        self.syms.contains_key(name)
    }
}