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
|
use num_derive::FromPrimitive;
use num_traits::FromPrimitive;
/// The type of a WebAssembly
/// [trap](http://webassembly.github.io/spec/core/intro/overview.html#trap).
#[repr(u32)]
#[derive(Copy, Clone, Debug, FromPrimitive, PartialEq)]
pub enum TrapCode {
StackOverflow = 0,
HeapOutOfBounds = 1,
OutOfBounds = 2,
IndirectCallToNull = 3,
BadSignature = 4,
IntegerOverflow = 5,
IntegerDivByZero = 6,
BadConversionToInteger = 7,
Interrupt = 8,
TableOutOfBounds = 9,
Unreachable = 10,
}
impl TrapCode {
pub fn try_from_u32(v: u32) -> Option<TrapCode> {
Self::from_u32(v)
}
}
/// Trap information for an address in a compiled function
///
/// To support zero-copy deserialization of trap tables, this
/// must be repr(C) [to avoid cases where Rust may change the
/// layout in some future version, mangling the interpretation
/// of an old TrapSite struct]
#[repr(C)]
#[derive(Clone, Debug)]
pub struct TrapSite {
pub offset: u32,
pub code: TrapCode,
}
/// A collection of trap sites, typically obtained from a
/// single function (see [`FunctionSpec::traps`])
#[repr(C)]
#[derive(Clone, Debug)]
pub struct TrapManifest<'a> {
pub traps: &'a [TrapSite],
}
impl<'a> TrapManifest<'a> {
pub fn new(traps: &'a [TrapSite]) -> TrapManifest<'_> {
TrapManifest { traps }
}
pub fn lookup_addr(&self, addr: u32) -> Option<TrapCode> {
// predicate to find the trapsite for the addr via binary search
let f = |ts: &TrapSite| ts.offset.cmp(&addr);
if let Ok(i) = self.traps.binary_search_by(f) {
Some(self.traps[i].code)
} else {
None
}
}
}
|
