hexagon-e 0.1.5

The HexagonE virtual machine
Documentation 
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

use error::*;
use core::cell::Cell;

pub struct Tape<'a, T: 'static> {
    data: &'a [T],
    pos: Cell<usize>
}

impl<'a, T: 'static> From<&'a [T]> for Tape<'a, T> {
    fn from(other: &'a [T]) -> Tape<'a, T> {
        Tape {
            data: other,
            pos: Cell::new(0)
        }
    }
}

impl<'a, T: 'static> Tape<'a, T> {
    pub fn len(&self) -> usize {
        self.data.len()
    }

    pub fn remaining(&self) -> usize {
        self.data.len() - self.pos.get()
    }

    pub fn next(&self) -> ExecuteResult<&T> {
        if self.remaining() < 1 {
            Err(ExecuteError::Bounds)
        } else {
            let pos = self.pos.get();
            let v = &self.data[pos];
            self.pos.set(pos + 1);

            Ok(v)
        }
    }

    pub fn next_many(&self, n: usize) -> ExecuteResult<&[T]> {
        if self.remaining() < n {
            Err(ExecuteError::Bounds)
        } else {
            let pos = self.pos.get();
            let data = &self.data[pos..pos + n];
            self.pos.set(pos + n);

            Ok(data)
        }
    }

    pub fn prev(&self) -> ExecuteResult<&T> {
        if self.pos.get() == 0 {
            Err(ExecuteError::Bounds)
        } else {
            let pos = self.pos.get() - 1;
            let v = &self.data[pos];
            self.pos.set(pos);

            Ok(v)
        }
    }

    pub fn prev_many(&self, n: usize) -> ExecuteResult<&[T]> {
        match self.tail_many(n) {
            Ok(v) => {
                // This should never fail
                self.set_pos(self.get_pos() - n).unwrap();
                Ok(v)
            },
            Err(e) => Err(e)
        }
    }

    pub fn tail_many(&self, n: usize) -> ExecuteResult<&[T]> {
        let pos = self.pos.get();

        if n > pos {
            Err(ExecuteError::Bounds)
        } else {
            Ok(&self.data[pos - n .. pos])
        }
    }

    pub fn at(&self, at: usize) -> ExecuteResult<&T> {
        if at < self.data.len() {
            Ok(&self.data[at])
        } else {
            Err(ExecuteError::Bounds)
        }
    }

    pub fn get_pos(&self) -> usize {
        self.pos.get()
    }

    pub fn set_pos(&self, pos: usize) -> ExecuteResult<()> {
        if pos <= self.data.len() {
            self.pos.set(pos);
            Ok(())
        } else {
            Err(ExecuteError::Bounds)
        }
    }
}

pub trait TapeU8 {
    fn next_u32(&self) -> ExecuteResult<u32>;
    fn next_u64(&self) -> ExecuteResult<u64>;
}

impl<'a> TapeU8 for Tape<'a, u8> {
    #[inline]
    fn next_u32(&self) -> ExecuteResult<u32> {
        if self.remaining() < 4 {
            Err(ExecuteError::Bounds)
        } else {
            use byteorder::{LittleEndian, ByteOrder};

            let pos = self.pos.get();
            let v = LittleEndian::read_u32(&self.data[pos..pos + 4]);
            self.pos.set(pos + 4);

            Ok(v)
        }
    }

    #[inline]
    fn next_u64(&self) -> ExecuteResult<u64> {
        if self.remaining() < 8 {
            Err(ExecuteError::Bounds)
        } else {
            use byteorder::{LittleEndian, ByteOrder};

            let pos = self.pos.get();
            let v = LittleEndian::read_u64(&self.data[pos..pos + 8]);
            self.pos.set(pos + 8);

            Ok(v)
        }
    }
}