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
use Layout;
use Cell;
use cmp;
use fmt;
use ;
use ptr;
use Rc;
use slice;
/*
pub struct Slice<T> {
ptr: *mut T,
len: usize,
_inner: Rc<Inner>,
}
#[derive(Debug)]
struct Inner {
/// Head of the arena space
head: *mut u8,
/// Offset into the last region
pos: Cell<usize>,
/// Total capacity of the arena
cap: usize,
}
*/
/*
pub fn slice<T>(&mut self, len: usize) -> Slice<T>
where
T: Default,
{
let ptr: *mut T = self.allocate(len);
for i in 0..len {
unsafe {
ptr::write(ptr.offset(i as isize), T::default());
}
}
Slice {
ptr,
len,
_inner: self.inner.clone(),
}
}
fn allocate<T>(&mut self, count: usize) -> *mut T {
let layout = Layout::new::<T>();
let mask = layout.align() - 1;
let pos = self.inner.pos.get();
debug_assert!(layout.align() >= (pos & mask));
let mut skip = layout.align() - (pos & mask);
if skip == layout.align() {
skip = 0;
}
let additional = skip + layout.size() * count;
assert!(pos + additional <= self.inner.cap, "arena overflow");
self.inner.pos.set(pos + additional);
let ret = unsafe { self.inner.head.offset((pos + skip) as isize) as *mut T };
debug_assert!((ret as usize) >= self.inner.head as usize);
debug_assert!((ret as usize) < (self.inner.head as usize + self.inner.cap));
ret
}
}
impl Drop for Inner {
fn drop(&mut self) {
let res = unsafe { libc::munmap(self.head as *mut libc::c_void, self.cap) };
// TODO: Do something on error
debug_assert_eq!(res, 0);
}
}
impl<T: Clone> Slice<T> {
pub fn clone_with(&self, arena: &mut Arena) -> Slice<T> {
let ptr: *mut T = arena.allocate(self.len);
for i in 0..self.len {
unsafe {
ptr::write(ptr.offset(i as isize), self[i].clone());
}
}
Slice {
ptr,
len: self.len,
_inner: arena.inner.clone(),
}
}
}
impl<T: fmt::Debug> fmt::Debug for Slice<T> {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
self.deref().fmt(fmt)
}
}
impl<T> Deref for Slice<T> {
type Target = [T];
fn deref(&self) -> &[T] {
unsafe { slice::from_raw_parts(self.ptr, self.len) }
}
}
impl<T> DerefMut for Slice<T> {
fn deref_mut(&mut self) -> &mut [T] {
unsafe { slice::from_raw_parts_mut(self.ptr, self.len) }
}
}
impl<T: Eq> Eq for Slice<T> {}
impl<T: PartialEq> PartialEq for Slice<T> {
fn eq(&self, other: &Self) -> bool {
self.deref().eq(other.deref())
}
}
impl<T: PartialOrd> PartialOrd for Slice<T> {
fn partial_cmp(&self, other: &Self) -> Option<cmp::Ordering> {
self.deref().partial_cmp(other.deref())
}
}
impl<T> Drop for Slice<T> {
fn drop(&mut self) {
for i in 0..self.len {
unsafe {
ptr::read(self.ptr.offset(i as isize) as *const _);
}
}
}
}
*/