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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
use crate::error::*;
use crate::value::*;
pub const DEFAULT_STACK_LIMIT: usize = 1024 * 1024;
pub const INIT_STACK_SIZE: usize = 1024;
#[derive(Debug)]
pub struct StackPtr(pub usize);
#[derive(Debug, Clone, Copy)]
pub struct StackValue(pub u64);
#[derive(Debug, Default, Clone, Copy)]
pub struct Frame {
pub bp: usize,
pub sbp: usize,
}
#[derive(Debug, Clone)]
pub struct Stack {
stack: Vec<StackValue>,
frame: Frame,
limit: usize,
}
impl Stack {
pub fn new() -> Stack {
Self::new_with_limit(DEFAULT_STACK_LIMIT)
}
pub fn new_with_limit(limit: usize) -> Stack {
Stack {
stack: Vec::with_capacity(INIT_STACK_SIZE),
frame: Default::default(),
limit,
}
}
#[inline]
pub fn len(&self) -> usize {
self.stack.len()
}
pub fn frame_size(&self) -> usize {
self.len() - self.frame.sbp
}
fn check_overflow(&mut self, need: usize) -> Trap<usize> {
let len = self.len();
let space = self.limit - len;
if space < need {
eprintln!("StackOverflow: limit={}, len={}", self.limit, len);
return Err(TrapKind::StackOverflow);
}
Ok(len)
}
pub fn push_frame(&mut self, params: usize, locals: usize) -> Trap<Frame> {
let cur_size = self.frame_size();
if cur_size < params {
eprintln!("StackOverflow: frame size={}, needed params={}", cur_size, params);
return Err(TrapKind::StackOverflow);
}
let old_frame = self.frame;
let bp = self.len() - params;
self.frame = Frame{
bp,
sbp: bp + locals,
};
Ok(old_frame)
}
pub fn reserve_locals(&mut self, locals: usize) -> Trap<()> {
if locals > 0 {
let new_len = self.len()
.checked_add(locals)
.ok_or(TrapKind::StackOverflow)?;
self.stack.truncate(new_len);
}
Ok(())
}
pub fn pop_frame(&mut self, old_frame: Frame) {
self.stack.truncate(self.frame.bp);
self.frame = old_frame;
}
pub fn push_params(&mut self, params: &[Value]) -> Trap<usize> {
let len = self.check_overflow(params.len())?;
for val in params.iter() {
self.stack.push(StackValue::from(*val));
}
Ok(len)
}
pub fn drop_values(&mut self, count: u32) -> Trap<()> {
let len = self.len();
let new_len = len
.checked_sub(count as usize)
.ok_or(TrapKind::StackOverflow)?;
self.stack.truncate(new_len);
Ok(())
}
#[inline]
pub fn tee_local(&mut self, local: LocalIdx) -> Trap<()> {
let val = self.top_val()?;
let idx = self.frame.bp + local as usize;
self.stack[idx] = val;
Ok(())
}
#[inline]
pub fn set_local(&mut self, local: LocalIdx) -> Trap<()> {
let val = self.pop_val()?;
let idx = self.frame.bp + local as usize;
self.stack[idx] = val;
Ok(())
}
#[inline]
pub fn get_local(&mut self, local: LocalIdx) -> Trap<()> {
let idx = self.frame.bp + local as usize;
self.push_val(self.stack[idx])
}
#[inline]
pub fn set_local_val(&mut self, local: LocalIdx, val: StackValue) {
let idx = self.frame.bp + local as usize;
self.stack[idx] = val;
}
#[inline]
pub fn get_local_val(&mut self, local: LocalIdx) -> StackValue {
let idx = self.frame.bp + local as usize;
self.stack[idx]
}
#[inline]
pub fn push_val(&mut self, val: StackValue) -> Trap<()> {
if self.len() >= self.limit {
eprintln!("StackOverflow: limit={}, len={}", self.limit, self.len());
return Err(TrapKind::StackOverflow);
}
self.stack.push(val);
Ok(())
}
pub fn pop_typed(&mut self, val_type: ValueType) -> Trap<Value> {
match val_type {
ValueType::I32 => self.pop().map(Value::I32),
ValueType::I64 => self.pop().map(Value::I64),
ValueType::F32 => self.pop().map(Value::F32),
ValueType::F64 => self.pop().map(Value::F64),
}
}
#[inline]
pub fn pop_val(&mut self) -> Trap<StackValue> {
self.stack.pop().ok_or(TrapKind::StackOverflow)
}
#[inline]
pub fn top_val(&mut self) -> Trap<StackValue> {
self.stack.last().map(|x| *x)
.ok_or(TrapKind::StackOverflow)
}
#[inline]
pub fn unop<F>(&mut self, op: F) -> Trap<()>
where F: FnOnce(&mut StackValue) -> Trap<()>
{
let mut val = self.stack.last_mut()
.ok_or(TrapKind::StackOverflow)?;
op(&mut val)
}
#[inline]
pub fn binop<F>(&mut self, op: F) -> Trap<()>
where F: FnOnce(&mut StackValue, StackValue) -> Trap<()>
{
let right = self.pop_val()?;
let mut left = self.stack.last_mut()
.ok_or(TrapKind::StackOverflow)?;
op(&mut left, right)
}
}
impl Default for Stack {
fn default() -> Stack {
Self::new()
}
}
pub trait FromValue
where
Self: Sized,
{
fn from_value(val: StackValue) -> Self;
}
pub trait FromStack<T>: Sized {
fn push(&mut self, val: T) -> Trap<()>;
fn pop(&mut self) -> Trap<T>;
fn pop_pair(&mut self) -> Trap<(T, T)>;
}
macro_rules! impl_stack_value {
($($t:ty),*) => {
$(
impl FromValue for $t {
fn from_value(StackValue(val): StackValue) -> Self {
val as _
}
}
impl From<$t> for StackValue {
fn from(other: $t) -> StackValue {
StackValue(other as _)
}
}
impl FromStack<$t> for Stack {
#[inline]
fn push(&mut self, val: $t) -> Trap<()> {
self.push_val(StackValue(val as _))
}
#[inline]
fn pop(&mut self) -> Trap<$t> {
self.pop_val().map(|x| x.0 as _)
}
fn pop_pair(&mut self) -> Trap<($t, $t)> {
let right = self.pop()?;
let left = self.pop()?;
Ok((left, right))
}
}
)*
};
}
impl_stack_value!(i8, u8, i16, u16, i32, u32, i64, u64);
macro_rules! impl_stack_value_float {
($($t:ty),*) => {
$(
impl FromValue for $t {
fn from_value(StackValue(val): StackValue) -> Self {
<$t>::from_bits(val as _)
}
}
impl From<$t> for StackValue {
fn from(other: $t) -> Self {
StackValue(other.to_bits() as _)
}
}
impl FromStack<$t> for Stack {
#[inline]
fn push(&mut self, val: $t) -> Trap<()> {
self.push_val(StackValue(val.to_bits() as _))
}
#[inline]
fn pop(&mut self) -> Trap<$t> {
self.pop_val().map(|x| <$t>::from_bits(x.0 as _))
}
fn pop_pair(&mut self) -> Trap<($t, $t)> {
let right = self.pop()?;
let left = self.pop()?;
Ok((left, right))
}
}
)*
};
}
impl_stack_value_float!(f32, f64);
impl From<Value> for StackValue {
fn from(val: Value) -> StackValue {
match val {
Value::I32(v) => StackValue(v as _),
Value::I64(v) => StackValue(v as _),
Value::F32(v) => StackValue(v.to_bits() as _),
Value::F64(v) => StackValue(v.to_bits() as _),
}
}
}