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
use crate::builtins::Blob;
use crate::io::{Decode, DecodeError, Encode, Wasmbin};
use crate::sections::{Section, StdPayload};
use crate::visit::Visit;
use arbitrary::Arbitrary;
use std::cmp::Ordering;
const MAGIC_AND_VERSION: [u8; 8] = [b'\0', b'a', b's', b'm', 0x01, 0x00, 0x00, 0x00];
#[derive(Debug, Default, Arbitrary, PartialEq, Eq, Hash, Clone, Visit)]
pub struct MagicAndVersion;
encode_decode_as!(MagicAndVersion, {
MagicAndVersion <=> MAGIC_AND_VERSION,
}, |actual| {
Err(DecodeError::InvalidMagic { actual })
});
#[derive(Wasmbin, Debug, Default, Arbitrary, PartialEq, Eq, Hash, Clone, Visit)]
pub struct Module {
#[doc(hidden)]
pub magic_and_version: MagicAndVersion,
pub sections: Vec<Section>,
}
impl Module {
pub fn decode_from(mut r: impl std::io::Read) -> Result<Module, DecodeError> {
Self::decode(&mut r)
}
pub fn encode_into<W: std::io::Write>(&self, mut w: W) -> std::io::Result<W> {
self.encode(&mut w)?;
Ok(w)
}
pub fn find_std_section<T: StdPayload>(&self) -> Option<&Blob<T>> {
self.sections.iter().find_map(Section::try_as)
}
pub fn find_std_section_mut<T: StdPayload>(&mut self) -> Option<&mut Blob<T>> {
self.sections.iter_mut().find_map(Section::try_as_mut)
}
pub fn find_or_insert_std_section<T: StdPayload>(
&mut self,
insert_callback: impl FnOnce() -> T,
) -> &mut Blob<T> {
let mut index = self.sections.len();
let mut insert = true;
for (i, section) in self.sections.iter_mut().enumerate() {
match section.kind().cmp(&T::KIND) {
Ordering::Less => continue,
Ordering::Equal => {
insert = false;
}
Ordering::Greater => {}
}
index = i;
break;
}
if insert {
self.sections.insert(index, insert_callback().into());
}
unsafe { self.sections.get_unchecked_mut(index) }
.try_as_mut()
.unwrap_or_else(|| unsafe { std::hint::unreachable_unchecked() })
}
}