-
Notifications
You must be signed in to change notification settings - Fork 42
/
types.rs
319 lines (281 loc) · 10.6 KB
/
types.rs
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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
use core::alloc::Layout;
use core::cell::Cell;
use core::marker::PhantomData;
use core::ptr::NonNull;
use core::{mem, ptr};
use crate::collect::Collect;
/// A thin-pointer-sized box containing a type-erased GC object.
/// Stores the metadata required by the GC algorithm inline (see `GcBoxInner`
/// for its typed counterpart).
#[derive(Copy, Clone, Debug, Eq, PartialEq)]
pub(crate) struct GcBox(NonNull<GcBoxInner<()>>);
impl GcBox {
/// Erases a pointer to a typed GC object.
///
/// **SAFETY:** The pointer must point to a valid `GcBoxInner` allocated
/// in a `Box`.
#[inline(always)]
pub(crate) unsafe fn erase<T: ?Sized>(ptr: NonNull<GcBoxInner<T>>) -> Self {
// This cast is sound because `GcBoxInner` is `repr(C)`.
let erased = ptr.as_ptr() as *mut GcBoxInner<()>;
Self(NonNull::new_unchecked(erased))
}
/// Gets a pointer to the value stored inside this box.
/// `T` must be the same type that was used with `erase`, so that
/// we can correctly compute the field offset.
#[inline(always)]
fn unerased_value<T>(&self) -> *mut T {
unsafe {
let ptr = self.0.as_ptr() as *mut GcBoxInner<T>;
// Don't create a reference, to keep the full provenance.
// Also, this gives us interior mutability "for free".
ptr::addr_of_mut!((*ptr).value) as *mut T
}
}
#[inline(always)]
pub(crate) fn header(&self) -> &GcBoxHeader {
unsafe { &self.0.as_ref().header }
}
/// Traces the stored value.
///
/// **SAFETY**: `Self::drop_in_place` must not have been called.
#[inline(always)]
pub(crate) unsafe fn trace_value(&self, cc: &crate::Collection) {
(self.header().vtable().trace_value)(*self, cc)
}
/// Drops the stored value.
///
/// **SAFETY**: once called, no GC pointers should access the stored value
/// (but accessing the `GcBox` itself is still safe).
#[inline(always)]
pub(crate) unsafe fn drop_in_place(&mut self) {
(self.header().vtable().drop_value)(*self)
}
/// Deallocates the box. Failing to call `Self::drop_in_place` beforehand
/// will cause the stored value to be leaked.
///
/// **SAFETY**: once called, this `GcBox` should never be accessed by any GC
/// pointers again.
#[inline(always)]
pub(crate) unsafe fn dealloc(self) {
let layout = self.header().vtable().box_layout;
let ptr = self.0.as_ptr() as *mut u8;
// SAFETY: the pointer was `Box`-allocated with this layout.
alloc::alloc::dealloc(ptr, layout);
}
}
pub(crate) struct GcBoxHeader {
/// The next element in the global linked list of allocated objects.
next: Cell<Option<GcBox>>,
/// A custom virtual function table for handling type-specific operations.
///
/// The lower bits of the pointer are used to store GC flags:
/// - bits 0 & 1 for the current `GcColor`;
/// - bit 2 for the `needs_trace` flag;
/// - bit 3 for the `is_live` flag.
tagged_vtable: Cell<*const CollectVtable>,
}
impl GcBoxHeader {
#[inline(always)]
pub fn new<T: Collect>() -> Self {
// Helper trait to materialize vtables in static memory.
trait HasCollectVtable {
const VTABLE: CollectVtable;
}
impl<T: Collect> HasCollectVtable for T {
const VTABLE: CollectVtable = CollectVtable::vtable_for::<T>();
}
let vtable: &'static _ = &<T as HasCollectVtable>::VTABLE;
Self {
next: Cell::new(None),
tagged_vtable: Cell::new(vtable as *const _),
}
}
/// Gets a reference to the `CollectVtable` used by this box.
#[inline(always)]
fn vtable(&self) -> &'static CollectVtable {
let ptr = tagged_ptr::untag(self.tagged_vtable.get());
// SAFETY:
// - the pointer was properly untagged.
// - the vtable is stored in static memory.
unsafe { &*ptr }
}
/// Gets the next element in the global linked list of allocated objects.
#[inline(always)]
pub(crate) fn next(&self) -> Option<GcBox> {
self.next.get()
}
/// Sets the next element in the global linked list of allocated objects.
#[inline(always)]
pub(crate) fn set_next(&self, next: Option<GcBox>) {
self.next.set(next)
}
/// Returns the (shallow) size occupied by this box in memory.
#[inline(always)]
pub(crate) fn size_of_box(&self) -> usize {
self.vtable().box_layout.size()
}
#[inline]
pub(crate) fn color(&self) -> GcColor {
match tagged_ptr::get::<0x3, _>(self.tagged_vtable.get()) {
0x0 => GcColor::White,
0x1 => GcColor::WhiteWeak,
0x2 => GcColor::Gray,
_ => GcColor::Black,
}
}
#[inline]
pub(crate) fn set_color(&self, color: GcColor) {
tagged_ptr::set::<0x3, _>(
&self.tagged_vtable,
match color {
GcColor::White => 0x0,
GcColor::WhiteWeak => 0x1,
GcColor::Gray => 0x2,
GcColor::Black => 0x3,
},
);
}
#[inline]
pub(crate) fn needs_trace(&self) -> bool {
tagged_ptr::get::<0x4, _>(self.tagged_vtable.get()) != 0x0
}
/// Determines whether or not we've dropped the `dyn Collect` value
/// stored in `GcBox.value`
/// When we garbage-collect a `GcBox` that still has outstanding weak pointers,
/// we set `alive` to false. When there are no more weak pointers remaining,
/// we will deallocate the `GcBox`, but skip dropping the `dyn Collect` value
/// (since we've already done it).
#[inline]
pub(crate) fn is_live(&self) -> bool {
tagged_ptr::get::<0x8, _>(self.tagged_vtable.get()) != 0x0
}
#[inline]
pub(crate) fn set_needs_trace(&self, needs_trace: bool) {
tagged_ptr::set_bool::<0x4, _>(&self.tagged_vtable, needs_trace);
}
#[inline]
pub(crate) fn set_live(&self, alive: bool) {
tagged_ptr::set_bool::<0x8, _>(&self.tagged_vtable, alive);
}
}
/// Type-specific operations for GC'd values.
///
/// We use a custom vtable instead of `dyn Collect` for extra flexibility.
/// The type is over-aligned so that `GcBoxHeader` can store flags into the LSBs of the vtable pointer.
#[repr(align(16))]
struct CollectVtable {
/// The layout of the `GcBox` the GC'd value is stored in.
box_layout: Layout,
/// Drops the value stored in the given `GcBox` (without deallocating the box).
drop_value: unsafe fn(GcBox),
/// Traces the value stored in the given `GcBox`.
trace_value: unsafe fn(GcBox, &crate::Collection),
}
impl CollectVtable {
/// Makes a vtable for a known, `Sized` type.
/// Because `T: Sized`, we can recover a typed pointer
/// directly from the erased `GcBox`.
#[inline(always)]
const fn vtable_for<T: Collect>() -> Self {
Self {
box_layout: Layout::new::<GcBoxInner<T>>(),
drop_value: |erased| unsafe {
ptr::drop_in_place(erased.unerased_value::<T>());
},
trace_value: |erased, cc| unsafe {
let val = &*(erased.unerased_value::<T>());
val.trace(cc)
},
}
}
}
/// A typed GC'd value, together with its metadata.
/// This type is never manipulated directly by the GC algorithm, allowing
/// user-facing `Gc`s to freely cast their pointer to it.
#[repr(C)]
pub(crate) struct GcBoxInner<T: ?Sized> {
pub(crate) header: GcBoxHeader,
/// The typed value stored in this `GcBox`.
pub(crate) value: mem::ManuallyDrop<T>,
}
impl<T: ?Sized> GcBoxInner<T> {
#[inline(always)]
pub(crate) fn new(header: GcBoxHeader, t: T) -> Self
where
T: Collect + Sized,
{
Self {
header,
value: mem::ManuallyDrop::new(t),
}
}
}
#[derive(Copy, Clone, Eq, PartialEq, Debug)]
pub(crate) enum GcColor {
/// An object that has not yet been reached by tracing (if we're in a tracing phase).
///
/// During `Phase::Sweep`, we will free all white objects that existed *before* the start of the
/// current `Phase::Sweep`. Objects allocated during `Phase::Sweep` will be white, but will not
/// be freed.
White,
/// Like White, but for objects weakly reachable from a Black object.
///
/// These objects may drop their contents during `Phase::Sweep`, but must stay allocated so that
/// weak references can check the alive status.
WhiteWeak,
/// An object reachable from a Black object, but that has not yet been traced using
/// `Collect::trace`. We also mark black objects as gray during `Phase::Mark` in response to
/// a write barrier, so that we re-trace and find any objects newly reachable from the mutated
/// object.
Gray,
/// An object that was reached during tracing. It will not be freed during `Phase::Sweep`. At
/// the end of `Phase::Sweep`, all black objects will be reset to white.
Black,
}
// Phantom type that holds a lifetime and ensures that it is invariant.
pub(crate) type Invariant<'a> = PhantomData<Cell<&'a ()>>;
/// Utility functions for tagging and untagging pointers.
mod tagged_ptr {
#![cfg_attr(not(miri), allow(unstable_name_collisions))]
#[cfg(not(miri))]
use sptr::Strict as _;
use core::cell::Cell;
trait ValidMask<const MASK: usize> {
const CHECK: ();
}
impl<T, const MASK: usize> ValidMask<MASK> for T {
const CHECK: () = assert!(MASK < core::mem::align_of::<T>());
}
/// Checks that `$mask` can be used to tag a pointer to `$type`.
/// If this isn't true, this macro will cause a post-monomorphization error.
macro_rules! check_mask {
($type:ty, $mask:expr) => {
let _ = <$type as ValidMask<$mask>>::CHECK;
};
}
#[inline(always)]
pub(super) fn untag<T>(tagged_ptr: *const T) -> *const T {
let mask = core::mem::align_of::<T>() - 1;
tagged_ptr.map_addr(|addr| addr & !mask)
}
#[inline(always)]
pub(super) fn get<const MASK: usize, T>(tagged_ptr: *const T) -> usize {
check_mask!(T, MASK);
tagged_ptr.addr() & MASK
}
#[inline(always)]
pub(super) fn set<const MASK: usize, T>(pcell: &Cell<*const T>, tag: usize) {
check_mask!(T, MASK);
let ptr = pcell.get();
let ptr = ptr.map_addr(|addr| (addr & !MASK) | (tag & MASK));
pcell.set(ptr)
}
#[inline(always)]
pub(super) fn set_bool<const MASK: usize, T>(pcell: &Cell<*const T>, value: bool) {
check_mask!(T, MASK);
let ptr = pcell.get();
let ptr = ptr.map_addr(|addr| (addr & !MASK) | if value { MASK } else { 0 });
pcell.set(ptr)
}
}