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
|
use std::collections::HashMap;
use crate::error::{Error, ImportError};
use crate::semantics::{AlphaVar, Cache, ImportLocation, TypedHir, VarEnv};
use crate::syntax::{Hash, Label, V};
/// Environment for resolving names.
#[derive(Debug, Clone, Default)]
pub struct NameEnv {
names: Vec<Label>,
}
pub type MemCache = HashMap<ImportLocation, TypedHir>;
pub type CyclesStack = Vec<ImportLocation>;
/// Environment for resolving imports
#[derive(Debug)]
pub struct ImportEnv {
file_cache: Option<Cache>,
mem_cache: MemCache,
stack: CyclesStack,
}
impl NameEnv {
pub fn new() -> Self {
NameEnv::default()
}
pub fn as_varenv(&self) -> VarEnv {
VarEnv::from_size(self.names.len())
}
pub fn insert(&self, x: &Label) -> Self {
let mut env = self.clone();
env.insert_mut(x);
env
}
pub fn insert_mut(&mut self, x: &Label) {
self.names.push(x.clone())
}
pub fn remove_mut(&mut self) {
self.names.pop();
}
pub fn unlabel_var(&self, var: &V) -> Option<AlphaVar> {
let V(name, idx) = var;
let (idx, _) = self
.names
.iter()
.rev()
.enumerate()
.filter(|(_, n)| *n == name)
.nth(*idx)?;
Some(AlphaVar::new(idx))
}
pub fn label_var(&self, var: AlphaVar) -> V {
let name = &self.names[self.names.len() - 1 - var.idx()];
let idx = self
.names
.iter()
.rev()
.take(var.idx())
.filter(|n| *n == name)
.count();
V(name.clone(), idx)
}
}
impl ImportEnv {
pub fn new() -> Self {
ImportEnv {
file_cache: Cache::new().ok(),
mem_cache: Default::default(),
stack: Default::default(),
}
}
pub fn get_from_cache(
&mut self,
location: &ImportLocation,
hash: Option<&Hash>,
) -> Option<TypedHir> {
if let Some(expr) = self.mem_cache.get(location) {
return Some(expr.clone());
}
let hash = hash.as_ref()?;
let expr = self.file_cache.as_ref()?.get(hash).ok()?;
Some(expr)
}
pub fn set_cache(
&mut self,
location: ImportLocation,
hash: Option<&Hash>,
expr: TypedHir,
) {
if let Some(file_cache) = self.file_cache.as_ref() {
if let Some(hash) = hash {
let _ = file_cache.insert(hash, &expr);
}
}
self.mem_cache.insert(location, expr);
}
pub fn with_cycle_detection(
&mut self,
location: ImportLocation,
do_resolve: impl FnOnce(&mut Self) -> Result<TypedHir, Error>,
) -> Result<TypedHir, Error> {
if self.stack.contains(&location) {
return Err(
ImportError::ImportCycle(self.stack.clone(), location).into()
);
}
// Push the current location on the stack
self.stack.push(location);
// Resolve the import recursively
// WARNING: do not propagate errors here or the stack will get messed up.
let result = do_resolve(self);
// Remove location from the stack.
self.stack.pop().unwrap();
result
}
}
|
