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
use ::compiler::graph::Node;
pub trait ManageScope {
fn current_scope(&self) -> Box<ScopeNode>;
fn enter_scope(&self, ScopeHint);
fn exit_scope<T>(&self, T) -> T;
}
pub type ScopeNode = Descriptor<Scope>;
#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash, Copy, Clone, Serialize)]
pub enum ScopeHint {
BaseScope,
ModuleScope,
FunctionScope
}
#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash, Copy, Clone, Serialize)]
pub struct Scope {
id: usize,
parent_id: usize
}
impl Node for Scope {
fn id(&self) -> usize {
self.id
}
fn parent_id(&self) -> usize {
self.parent_id
}
}
#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash, Copy, Clone, Serialize)]
pub enum Descriptor<T> {
Base(T),
Module(T),
Function(T)
}
impl Descriptor<Scope> {
pub fn new(parent_id: usize, id: usize, hint: ScopeHint) -> Self {
let node = Scope {
id: id,
parent_id: parent_id
};
match hint {
ScopeHint::BaseScope => Descriptor::Base(node),
ScopeHint::ModuleScope => Descriptor::Module(node),
ScopeHint::FunctionScope => Descriptor::Function(node)
}
}
fn node(&self) -> &Scope {
match self {
&Descriptor::Base(ref node) |
&Descriptor::Module(ref node) |
&Descriptor::Function(ref node) => node
}
}
}
impl Node for Descriptor<Scope> {
fn id(&self) -> usize {
self.node().id()
}
fn parent_id(&self) -> usize {
self.node().parent_id()
}
}