218 lines
6.6 KiB
Rust
218 lines
6.6 KiB
Rust
// r15 : Return Value
|
|
// r0 : Unmanaged temp variable
|
|
// r1 - r7 : Temporary Variables
|
|
// r8 - r14 : Persistant Variables
|
|
|
|
use parser::tree_node::Literal;
|
|
use quick_error::quick_error;
|
|
use std::collections::{HashMap, VecDeque};
|
|
|
|
const TEMP: [u8; 7] = [1, 2, 3, 4, 5, 6, 7];
|
|
const PERSIST: [u8; 7] = [8, 9, 10, 11, 12, 13, 14];
|
|
|
|
quick_error! {
|
|
#[derive(Debug)]
|
|
pub enum Error {
|
|
DuplicateVariable(var: String) {
|
|
display("{var} already exists.")
|
|
}
|
|
UnknownVariable(var: String) {
|
|
display("{var} does not exist.")
|
|
}
|
|
Unknown(reason: String) {
|
|
display("{reason}")
|
|
}
|
|
}
|
|
}
|
|
|
|
/// A request to store a variable at a specific register type
|
|
pub enum LocationRequest {
|
|
#[allow(dead_code)]
|
|
/// Request to store a variable in a temprary register.
|
|
Temp,
|
|
/// Request to store a variable in a persistant register.
|
|
Persist,
|
|
/// Request to store a variable in the stack.
|
|
Stack,
|
|
}
|
|
|
|
#[derive(Clone)]
|
|
pub enum VariableLocation {
|
|
/// Represents a temporary register (r1 - r7)
|
|
Temporary(u8),
|
|
/// Represents a persistant register (r8 - r14)
|
|
Persistant(u8),
|
|
/// Represents a a stack offset (current stack - offset = variable loc)
|
|
Stack(u16),
|
|
/// Represents a constant value and should be directly substituted as such.
|
|
Constant(Literal),
|
|
}
|
|
|
|
pub struct VariableScope<'a> {
|
|
temporary_vars: VecDeque<u8>,
|
|
persistant_vars: VecDeque<u8>,
|
|
var_lookup_table: HashMap<String, VariableLocation>,
|
|
stack_offset: u16,
|
|
parent: Option<&'a VariableScope<'a>>,
|
|
}
|
|
|
|
impl<'a> Default for VariableScope<'a> {
|
|
fn default() -> Self {
|
|
Self {
|
|
parent: None,
|
|
stack_offset: 0,
|
|
persistant_vars: PERSIST.to_vec().into(),
|
|
temporary_vars: TEMP.to_vec().into(),
|
|
var_lookup_table: HashMap::new(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<'a> VariableScope<'a> {
|
|
#[allow(dead_code)]
|
|
pub const TEMP_REGISTER_COUNT: u8 = 7;
|
|
pub const PERSIST_REGISTER_COUNT: u8 = 7;
|
|
|
|
pub const RETURN_REGISTER: u8 = 15;
|
|
pub const TEMP_STACK_REGISTER: u8 = 0;
|
|
|
|
pub fn registers(&self) -> impl Iterator<Item = &u8> {
|
|
self.var_lookup_table
|
|
.values()
|
|
.filter(|val| {
|
|
matches!(
|
|
val,
|
|
VariableLocation::Temporary(_) | VariableLocation::Persistant(_)
|
|
)
|
|
})
|
|
.map(|loc| match loc {
|
|
VariableLocation::Persistant(reg) | VariableLocation::Temporary(reg) => reg,
|
|
_ => unreachable!(),
|
|
})
|
|
}
|
|
|
|
pub fn scoped(parent: &'a VariableScope<'a>) -> Self {
|
|
Self {
|
|
parent: Option::Some(parent),
|
|
temporary_vars: parent.temporary_vars.clone(),
|
|
persistant_vars: parent.persistant_vars.clone(),
|
|
..Default::default()
|
|
}
|
|
}
|
|
|
|
pub fn stack_offset(&self) -> u16 {
|
|
self.stack_offset
|
|
}
|
|
|
|
/// Adds and tracks a new scoped variable. If the location you request is full, will fall back
|
|
/// to the stack.
|
|
pub fn add_variable(
|
|
&mut self,
|
|
var_name: impl Into<String>,
|
|
location: LocationRequest,
|
|
) -> Result<VariableLocation, Error> {
|
|
let var_name = var_name.into();
|
|
if self.var_lookup_table.contains_key(var_name.as_str()) {
|
|
return Err(Error::DuplicateVariable(var_name));
|
|
}
|
|
let var_location = match location {
|
|
LocationRequest::Temp => {
|
|
if let Some(next_var) = self.temporary_vars.pop_front() {
|
|
VariableLocation::Temporary(next_var)
|
|
} else {
|
|
let loc = VariableLocation::Stack(self.stack_offset);
|
|
self.stack_offset += 1;
|
|
loc
|
|
}
|
|
}
|
|
LocationRequest::Persist => {
|
|
if let Some(next_var) = self.persistant_vars.pop_front() {
|
|
VariableLocation::Persistant(next_var)
|
|
} else {
|
|
let loc = VariableLocation::Stack(self.stack_offset);
|
|
self.stack_offset += 1;
|
|
loc
|
|
}
|
|
}
|
|
LocationRequest::Stack => {
|
|
let loc = VariableLocation::Stack(self.stack_offset);
|
|
self.stack_offset += 1;
|
|
loc
|
|
}
|
|
};
|
|
self.var_lookup_table.insert(var_name, var_location.clone());
|
|
|
|
Ok(var_location)
|
|
}
|
|
|
|
pub fn define_const(
|
|
&mut self,
|
|
var_name: impl Into<String>,
|
|
value: Literal,
|
|
) -> Result<VariableLocation, Error> {
|
|
let var_name = var_name.into();
|
|
if self.var_lookup_table.contains_key(&var_name) {
|
|
return Err(Error::DuplicateVariable(var_name));
|
|
}
|
|
|
|
let new_value = VariableLocation::Constant(value);
|
|
|
|
self.var_lookup_table.insert(var_name, new_value.clone());
|
|
Ok(new_value)
|
|
}
|
|
|
|
pub fn get_location_of(&self, var_name: impl Into<String>) -> Result<VariableLocation, Error> {
|
|
let var_name = var_name.into();
|
|
|
|
// 1. Check this scope
|
|
if let Some(var) = self.var_lookup_table.get(var_name.as_str()) {
|
|
if let VariableLocation::Stack(inserted_at_offset) = var {
|
|
// Return offset relative to CURRENT sp
|
|
return Ok(VariableLocation::Stack(
|
|
self.stack_offset - inserted_at_offset,
|
|
));
|
|
} else {
|
|
return Ok(var.clone());
|
|
}
|
|
}
|
|
|
|
// 2. Recursively check parent
|
|
if let Some(parent) = self.parent {
|
|
let loc = parent.get_location_of(var_name)?;
|
|
|
|
if let VariableLocation::Stack(parent_offset) = loc {
|
|
return Ok(VariableLocation::Stack(parent_offset + self.stack_offset));
|
|
}
|
|
return Ok(loc);
|
|
}
|
|
|
|
Err(Error::UnknownVariable(var_name))
|
|
}
|
|
|
|
pub fn has_parent(&self) -> bool {
|
|
self.parent.is_some()
|
|
}
|
|
|
|
#[allow(dead_code)]
|
|
pub fn free_temp(&mut self, var_name: impl Into<String>) -> Result<(), Error> {
|
|
let var_name = var_name.into();
|
|
let Some(location) = self.var_lookup_table.remove(var_name.as_str()) else {
|
|
return Err(Error::UnknownVariable(var_name));
|
|
};
|
|
|
|
match location {
|
|
VariableLocation::Temporary(t) => {
|
|
self.temporary_vars.push_back(t);
|
|
}
|
|
VariableLocation::Persistant(_) => {
|
|
return Err(Error::UnknownVariable(String::from(
|
|
"Attempted to free a `let` variable.",
|
|
)));
|
|
}
|
|
_ => {}
|
|
};
|
|
|
|
Ok(())
|
|
}
|
|
}
|