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
use crate::ExitReason;
#[derive(Clone, Debug)]
pub struct Memory {
data: Vec<u8>,
limit: usize,
}
impl Memory {
pub fn new(limit: usize) -> Self {
Self {
data: Vec::new(),
limit,
}
}
pub fn len(&self) -> usize {
self.data.len()
}
pub fn is_empty(&self) -> bool {
self.len() == 0
}
pub fn resize(&mut self, mut size: usize) -> Result<(), ExitReason> {
if self.data.len() >= size {
return Ok(())
}
while size % 32 != 0 {
size += 1;
}
if size > self.limit {
return Err(ExitReason::NotSupported)
}
self.data.resize(size, 0);
Ok(())
}
pub fn get(&self, offset: usize, size: usize) -> Vec<u8> {
let mut ret = Vec::new();
ret.resize(size, 0);
for index in 0..size {
let position = offset + index;
if position >= self.data.len() {
break
}
ret[index] = self.data[position];
}
ret
}
pub fn set(
&mut self,
offset: usize,
value: &[u8],
target_size: Option<usize>
) -> Result<(), ExitReason> {
let target_size = target_size.unwrap_or(value.len());
if offset.checked_add(target_size)
.map(|pos| pos > self.limit).unwrap_or(true)
{
return Err(ExitReason::NotSupported)
}
self.resize(offset + value.len())?;
for index in 0..value.len() {
if self.data.len() > offset + index {
self.data[offset + index] = value[index];
}
}
Ok(())
}
}