-
Notifications
You must be signed in to change notification settings - Fork 13
/
gc.rs
2106 lines (1757 loc) · 69.6 KB
/
gc.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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
use super::class::{Class, Obj};
use super::code::{Bytecode, Coro, GFn, Lambda, Stay};
use super::collections::{Arr, DequeOps, Str, Tab};
use super::engine::{glsp, with_heap, Guard, RData, RFn, RGc, Span, Sym};
use super::error::GResult;
use super::iter::{GIter, GIterState};
use super::val::{Hashable, Val};
use super::wrap::IntoVal;
use std::borrow::Borrow;
use std::cell::{Cell, RefCell, RefMut};
use std::cmp::{max, min, Ordering};
use std::f32;
use std::fmt::{self, Debug};
use std::hash::{Hash, Hasher};
use std::marker::PhantomData;
use std::mem::size_of;
use std::ops::Deref;
use std::process::abort;
//the garbage collector currently uses a hybrid incremental and generational algorithm. see
//notes/gc.md for the details.
//-------------------------------------------------------------------------------------------------
// Raw
//-------------------------------------------------------------------------------------------------
// safe Raw<T> implementation
//----------------------------------------------------------------------------
#[cfg(not(feature = "unsafe-internals"))]
use std::rc::Rc;
#[doc(hidden)]
#[cfg(not(feature = "unsafe-internals"))]
pub struct Raw<T: Allocate> {
rc: Rc<T>,
}
#[cfg(not(feature = "unsafe-internals"))]
impl<T: Allocate> Raw<T> {
#[inline]
fn new(t: T) -> Raw<T> {
Raw { rc: Rc::new(t) }
}
#[inline]
pub(crate) fn ptr_eq(raw0: &Raw<T>, raw1: &Raw<T>) -> bool {
Rc::ptr_eq(&raw0.rc, &raw1.rc)
}
#[inline]
fn as_usize(&self) -> usize {
&(*self.rc) as *const T as usize
}
#[inline]
fn free(&self) {
self.clear_raws()
}
}
#[cfg(not(feature = "unsafe-internals"))]
impl<T: Allocate> Clone for Raw<T> {
#[inline]
fn clone(&self) -> Raw<T> {
Raw {
rc: Rc::clone(&self.rc),
}
}
}
#[cfg(not(feature = "unsafe-internals"))]
impl<T: Allocate> Deref for Raw<T> {
type Target = T;
#[inline]
fn deref(&self) -> &T {
&*self.rc
}
}
// unsafe Raw<T> implementation
//----------------------------------------------------------------------------
#[cfg(feature = "unsafe-internals")]
use std::ptr::NonNull;
#[doc(hidden)]
#[cfg(feature = "unsafe-internals")]
pub struct Raw<T: Allocate> {
ptr: NonNull<T>,
}
#[cfg(feature = "unsafe-internals")]
impl<T: Allocate> Raw<T> {
#[inline]
fn new(t: T) -> Raw<T> {
Raw {
ptr: NonNull::new(Box::into_raw(Box::new(t))).unwrap(),
}
}
#[inline]
pub(crate) fn ptr_eq(raw0: &Raw<T>, raw1: &Raw<T>) -> bool {
raw0.ptr == raw1.ptr
}
#[inline]
fn as_usize(&self) -> usize {
self.ptr.as_ptr() as usize
}
#[inline]
fn free(&self) {
unsafe { drop(Box::from_raw(self.ptr.as_ptr())) }
}
}
#[cfg(feature = "unsafe-internals")]
impl<T: Allocate> Clone for Raw<T> {
#[inline]
fn clone(&self) -> Raw<T> {
Raw { ptr: self.ptr }
}
}
#[cfg(feature = "unsafe-internals")]
impl<T: Allocate> Deref for Raw<T> {
type Target = T;
#[inline]
fn deref(&self) -> &T {
unsafe { &*self.ptr.as_ptr() }
}
}
// common Raw<T> methods
//----------------------------------------------------------------------------
impl<T: Allocate> Raw<T> {
#[inline]
pub(crate) fn from_root(root: &Root<T>) -> Raw<T> {
let engine_id = with_heap(|heap| heap.engine_id);
if engine_id != root.header().engine_id() {
eprintln!("attempted to move a Root to another Runtime - aborting process");
abort()
}
root.raw.clone()
}
#[inline]
pub(crate) fn root(&self) -> Root<T> {
Root::new(self.clone())
}
#[inline]
pub(crate) fn into_root(self) -> Root<T> {
Root::new(self)
}
#[inline]
fn header(&self) -> &Header {
(**self).header()
}
}
impl<T: Allocate> PartialEq for Raw<T> {
#[inline]
fn eq(&self, other: &Raw<T>) -> bool {
self.as_usize() == other.as_usize()
}
}
impl<T: Allocate> Eq for Raw<T> {}
impl<T: Allocate> Hash for Raw<T> {
#[inline]
fn hash<H: Hasher>(&self, state: &mut H) {
self.as_usize().hash(state)
}
}
//-------------------------------------------------------------------------------------------------
// ErasedRaw
//-------------------------------------------------------------------------------------------------
macro_rules! erased_types {
($($type_name:ident),+) => (
#[doc(hidden)]
pub trait Erase {
fn erase_raw(raw: Raw<Self>) -> ErasedRaw where Self: Allocate;
fn unerase_raw(erased_raw: &ErasedRaw) -> Raw<Self> where Self: Allocate;
}
$(impl Erase for $type_name {
#[inline(always)]
fn erase_raw(raw: Raw<$type_name>) -> ErasedRaw {
ErasedRaw::$type_name(raw)
}
#[inline(always)]
fn unerase_raw(erased_raw: &ErasedRaw) -> Raw<Self> {
match erased_raw {
ErasedRaw::$type_name(raw) => raw.clone(),
_ => panic!()
}
}
})+
#[doc(hidden)]
#[derive(Clone)]
pub enum ErasedRaw {
$($type_name(Raw<$type_name>)),+
}
impl ErasedRaw {
fn header(&self) -> &Header {
match *self {
$(ErasedRaw::$type_name(ref raw) => &raw.header()),+
}
}
}
impl Debug for ErasedRaw {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match *self {
$(
ErasedRaw::$type_name(ref raw) => {
write!(f, "ErasedRaw::{}(0x{:x})", stringify!($type_name),
(&**raw) as *const $type_name as usize)
}
)+
}
}
}
macro_rules! with_erased_raw {
($erased:expr, $raw_ident:ident, $body:expr) => (
match $erased {
$(ErasedRaw::$type_name(ref $raw_ident) => $body),+
}
);
}
);
}
erased_types!(Arr, Str, Tab, GIter, Obj, Class, GFn, Stay, Coro, RData, RFn, Bytecode, Lambda);
//-------------------------------------------------------------------------------------------------
// Root, RootStorage
//-------------------------------------------------------------------------------------------------
/**
A pointer onto the garbage-collected heap.
*/
pub struct Root<T: Allocate> {
pub(crate) raw: Raw<T>,
}
/*
i was tempted to align RootEntry to a power-of-two size to make indexing cheaper, but
i suspect the increased memory/cache pressure wouldn't be worth it.
*/
#[derive(Debug)]
struct RootEntry {
raw: Option<ErasedRaw>,
strong_count: u32,
weak_count: u32,
//null next/previous indexes are represented by 0
next_entry: u32,
prev_entry: u32,
}
const NULL_ENTRY: u32 = 0;
/*
RootStorage maintains three collections in a single vec:
- a singly-linked list of vacant entries (strong_count = 0, weak_count = 0, raw = None)
- a doubly-linked list of strong entries (strong_count > 0, raw = Some(_))
- a non-iterable collection of weak entries (strong_count = 0, weak_count > 0, raw = ?)
for vacant entries, next_entry contains junk data; for weak entries, both next_entry and
prev_entry contain junk data. entry 0 is a placeholder, and its next_entry and prev_entry
are always junk data - this eliminates a lot of branches.
the storage vector grows in power-of-two increments, filling in any empty space with new
vacant entries.
the main purpose of the linked lists is to keep root indexes stable (because Gc pointers
actually store the root index, rather than pointing to the object itself).
we considered some clever tricks to try to improve iteration performance (e.g. switching between
vector and linked-list iteration depending on the vector's occupancy percentage, or reordering
the linked lists during vector iteration so that they're sequential in memory), but that would
add a lot of complexity for something which is unlikely to cost more than 1 to 10 nanoseconds per
Root per gc step. 10,000 Roots implies 0.01 to 0.1ms per gc step. probably not worth it.
*/
pub(crate) struct RootStorage {
entries: Vec<RootEntry>,
first_vacant: u32,
first_strong: u32, /*
we could also add a last_strong field here, for appending new items to the end of the
strong list rather than its beginning. the only benefit would be that iteration through
the strong list would then generally move from lower memory addresses to higher ones, but
i'm pretty sure this wouldn't actually be more cache-friendly. it would also make alloc(),
increment_strong_count() and decrement_strong_count() more expensive... seems like
a bad trade-off.
*/
}
impl RootStorage {
fn new() -> RootStorage {
let mut entries = Vec::with_capacity(128);
while entries.len() < entries.capacity() {
let next_entry = (entries.len() + 1) as u32;
entries.push(RootEntry {
raw: None,
strong_count: 0,
weak_count: 0,
next_entry,
prev_entry: 0xffff_ffff, //deliberate junk data
});
}
RootStorage {
entries,
first_vacant: 1,
first_strong: NULL_ENTRY,
}
}
//double the length of `entries` by appending `entries.len()` new vacant entries
#[inline(never)]
fn grow(&mut self) {
//checking against MAX_ROOT_INDEX here means that we don't need to check it
//on every call to alloc()
let new_len = min(MAX_ROOT_INDEX as usize + 1, self.entries.len() * 2);
assert!(
new_len > self.entries.len(),
"no more than {} objects may be simultaneously rooted",
MAX_ROOT_INDEX as usize + 1
);
let to_reserve = new_len - self.entries.len();
self.entries.reserve_exact(to_reserve);
while self.entries.len() < self.entries.capacity() {
let next_entry = (self.entries.len() + 1) as u32;
self.entries.push(RootEntry {
raw: None,
strong_count: 0,
weak_count: 0,
next_entry,
prev_entry: 0xffff_ffff, //deliberate junk data
});
}
}
//change the first vacant entry into a strong entry with a strong_count of 1 and the
//specified `raw`, then return its index
#[inline(always)]
fn alloc(&mut self, raw: ErasedRaw) -> u32 {
//when we're at full capacity, we set first_vacant to the index just after the end of the
//vec. this should elide one of the bounds-checks below, because we've already asserted
//that first_vacant falls within the vec's bounds.
debug_assert!(self.first_vacant != NULL_ENTRY);
if self.first_vacant as usize >= self.entries.len() {
self.grow();
self.alloc(raw)
} else {
let entry_index = self.first_vacant;
let first_strong = self.first_strong;
self.entries[first_strong as usize].prev_entry = entry_index;
self.first_strong = entry_index;
let entry = &mut self.entries[entry_index as usize];
self.first_vacant = entry.next_entry;
debug_assert!(entry.raw.is_none());
debug_assert!(entry.strong_count == 0);
debug_assert!(entry.weak_count == 0);
entry.raw = Some(raw);
entry.prev_entry = NULL_ENTRY;
entry.next_entry = first_strong;
entry.strong_count = 1;
entry_index
}
}
//increment the strong_count of the specified *weak* entry with a Some `raw` field,
//changing it into a strong entry. (the strong_count of a strong entry can just be
//incremented directly rather than calling this method.)
#[inline(always)]
fn increment_strong_count(&mut self, entry_index: u32) {
debug_assert!(entry_index != NULL_ENTRY);
let entry = &mut self.entries[entry_index as usize];
debug_assert!(entry.raw.is_some());
debug_assert!(entry.strong_count == 0);
debug_assert!(entry.weak_count > 0);
entry.prev_entry = NULL_ENTRY;
entry.next_entry = self.first_strong;
entry.strong_count = 1;
self.entries[self.first_strong as usize].prev_entry = entry_index;
self.first_strong = entry_index;
}
//decrement the strong_count of the specified strong entry. this may change it into a
//weak entry or a vacant entry. returns `entry_index` if either the weak or strong
//count are now greater than 0, or returns 0 otherwise.
#[inline(always)]
fn decrement_strong_count(&mut self, entry_index: u32) -> u32 {
debug_assert!(entry_index != NULL_ENTRY);
let entry = &mut self.entries[entry_index as usize];
debug_assert!(entry.raw.is_some());
debug_assert!(entry.strong_count >= 1);
entry.strong_count -= 1;
if entry.strong_count == 0 {
//remove this entry from the strong list
let prev_entry = entry.prev_entry;
let next_entry = entry.next_entry;
self.entries[prev_entry as usize].next_entry = next_entry;
self.entries[next_entry as usize].prev_entry = prev_entry;
//this branch could be fairly unpredictable, but it should get optimized to a cmov
if prev_entry == NULL_ENTRY {
self.first_strong = next_entry;
}
//potentially add this entry to the vacant list
let entry = &mut self.entries[entry_index as usize];
if entry.weak_count == 0 {
entry.raw = None;
entry.next_entry = self.first_vacant;
self.first_vacant = entry_index;
0
} else {
entry_index
}
} else {
entry_index
}
}
//decrement the weak_count of the specified weak or strong entry. this may change
//a weak entry into a vacant entry. sets the pointee's header root_index to 0 if it
//hasn't been deallocated, and both the weak and strong count have been reduced to 0.
#[inline(always)]
fn decrement_weak_count(&mut self, entry_index: u32) {
debug_assert!(entry_index != NULL_ENTRY);
let entry = &mut self.entries[entry_index as usize];
debug_assert!(entry.weak_count >= 1);
entry.weak_count -= 1;
if entry.strong_count == 0 && entry.weak_count == 0 {
if let Some(raw) = entry.raw.take() {
raw.header().set_root_index(0);
}
entry.next_entry = self.first_vacant;
self.first_vacant = entry_index;
}
}
}
impl<T: Allocate> Root<T> {
#[inline]
fn new(raw: Raw<T>) -> Root<T> {
with_heap(|heap| {
let header = raw.header();
if heap.engine_id != header.engine_id() {
eprintln!("attempted to create a Root for an inactive Runtime - aborting process");
abort()
}
let mut root_storage = heap.root_storage.borrow_mut();
let root_index = header.root_index();
if root_index == 0 {
header.set_root_index(root_storage.alloc(T::erase_raw(raw.clone())));
} else {
root_storage.entries[root_index as usize].strong_count += 1;
}
});
Root { raw }
}
#[inline]
pub(crate) fn as_raw(&self) -> &Raw<T> {
&self.raw
}
#[inline]
pub(crate) fn to_raw(&self) -> Raw<T> {
Raw::from_root(self)
}
//weirdly, there's actually no way to do this safely in current rust. however, there's
//no point special-casing it for "unsafe-internals" mode, because Raw::from_root is
//basically free in that mode
pub(crate) fn into_raw(self) -> Raw<T> {
Raw::from_root(&self)
}
#[inline]
pub fn ptr_eq(root0: &Root<T>, root1: &Root<T>) -> bool {
Raw::ptr_eq(&root0.raw, &root1.raw)
}
}
impl<T: Allocate> Clone for Root<T> {
#[inline]
fn clone(&self) -> Root<T> {
with_heap(|heap| {
let header = self.raw.header();
if heap.engine_id != header.engine_id() {
eprintln!("attempted to clone a Root for an inactive Runtime - aborting process");
abort()
}
let root_index = header.root_index();
heap.root_storage.borrow_mut().entries[root_index as usize].strong_count += 1;
});
Root {
raw: self.raw.clone(),
}
}
}
impl<T: Allocate> Drop for Root<T> {
#[inline]
fn drop(&mut self) {
with_heap(|heap| {
let header = self.raw.header();
if heap.engine_id != header.engine_id() {
eprintln!("attempted to drop a Root for an inactive Runtime - aborting process");
abort()
}
let mut root_storage = heap.root_storage.borrow_mut();
header.set_root_index(root_storage.decrement_strong_count(header.root_index()));
});
}
}
impl<T: Allocate> Borrow<T> for Root<T> {
#[inline]
fn borrow(&self) -> &T {
&**self
}
}
impl<T: Allocate> AsRef<T> for Root<T> {
#[inline]
fn as_ref(&self) -> &T {
&**self
}
}
impl<T: Allocate + PartialEq<T>> PartialEq<Root<T>> for Root<T> {
#[inline]
fn eq(&self, other: &Root<T>) -> bool {
(**self).eq(&**other)
}
}
impl<T: Allocate + Eq> Eq for Root<T> {}
impl<T: Allocate + PartialOrd<T>> PartialOrd<Root<T>> for Root<T> {
#[inline]
fn partial_cmp(&self, other: &Root<T>) -> Option<Ordering> {
(**self).partial_cmp(&**other)
}
}
impl<T: Allocate + Ord> Ord for Root<T> {
#[inline]
fn cmp(&self, other: &Root<T>) -> Ordering {
(**self).cmp(&**other)
}
}
impl<T: Allocate> Deref for Root<T> {
type Target = T;
#[inline]
fn deref(&self) -> &T {
&self.raw
}
}
//-------------------------------------------------------------------------------------------------
// Gc
//-------------------------------------------------------------------------------------------------
/**
A weak pointer onto the garbage-collected heap.
`Gc`'s API is very similar to [`std::rc::Weak`]. You can construct a `Gc` by calling
[`Root::downgrade`](struct.Root.html#method.downgrade). A `Gc` can't be dereferenced; instead,
you should promote it to a `Root` by calling [`Gc::upgrade`](#method.upgrade).
[`std::rc::Weak`]: https://doc.rust-lang.org/std/rc/struct.Weak.html
You should almost always use [`Root`](struct.Root.html) rather than `Gc`.
The only exception is [`RData`](struct.RData.html). If you store a `Root` within an `RData`, it
will cause a memory leak. If you need to construct an `RData` which stores a pointer to another
heap-allocated object, you should:
- Use `Gc` where you would normally use `Root`.
- Call [`RClassBuilder::trace`](struct.RClassBuilder.html#method.trace) before constructing
the `RData`.
- Call [`glsp::write_barrier`](fn.write_barrier.html) when the `RData` is mutated.
The last two steps are necessary to prevent the pointed-to object from being deallocated.
See also [`GcVal`](struct.GcVal.html) (a `Val` which stores `Gc` pointers rather than `Root`
pointers), and [`RGc`](struct.RGc.html) (a strongly-typed alternative to `Gc<RData>`).
```
# #![feature(min_specialization)]
# extern crate glsp_engine as glsp;
# use glsp::*;
#
# struct Rect;
#
# impl FromVal for Rect {
# fn from_val(_val: &Val) -> GResult<Rect> { Ok(Rect) }
# }
#
struct Collider {
bounds: Rect,
obj: Gc<Obj>
}
impl Collider {
fn trace(&self, visitor: &mut GcVisitor) {
visitor.visit(&self.obj);
}
}
fn setup() {
RClassBuilder::<Collider>::new()
.trace(Collider::trace)
.build();
}
fn new_collider(obj: Root<Obj>) -> GResult<Root<RData>> {
let collider = Collider {
bounds: obj.get("bounds")?,
obj: obj.downgrade()
};
Ok(glsp::rdata(collider))
}
```
*/
//each Gc stores a u32. the upper 8 bits are the engine_id, the lower 23 bits are the root_index
pub struct Gc<T: Allocate>(u32, PhantomData<*mut T>);
impl<T: Allocate> Root<T> {
/**
Constructs a new [weak pointer](struct.Gc.html) to this heap-allocated object.
*/
#[inline]
pub fn downgrade(&self) -> Gc<T> {
with_heap(|heap| {
let header = self.raw.header();
if heap.engine_id != header.engine_id() {
eprintln!("attempted to create a Gc for an inactive Runtime - aborting process");
abort()
}
let root_index = header.root_index();
debug_assert!(root_index != 0);
heap.root_storage.borrow_mut().entries[root_index as usize].weak_count += 1;
Gc(root_index | ((heap.engine_id as u32) << 24), PhantomData)
})
}
}
impl<T: Allocate> Gc<T> {
#[inline]
fn engine_id(&self) -> u8 {
(self.0 >> 24) as u8
}
#[inline]
fn root_index(&self) -> u32 {
self.0 & 0x7fffff
}
/**
Attempts to construct a [strong pointer](struct.Root.html) from this weak pointer.
Returns `None` if the pointed-to object has been deallocated by the garbage
collector. To prevent this, use [`glsp::write_barrier`](fn.write_barrier.html) and
[`RClassBuilder::trace`](struct.RClassBuilder.html#method.trace).
*/
#[inline]
pub fn upgrade(&self) -> Option<Root<T>> {
with_heap(|heap| {
let mut root_storage = heap.root_storage.borrow_mut();
let entry = &mut root_storage.entries[self.root_index() as usize];
match entry.raw.as_ref() {
Some(erased_raw) => {
let raw = T::unerase_raw(erased_raw);
if heap.engine_id != raw.header().engine_id() {
eprintln!(
"attempted to create a Root for an inactive \
Runtime - aborting process"
);
abort()
}
let header = raw.header();
if !header.young() && header.color_index() == heap.ghost_index.get() {
None
} else {
if entry.strong_count == 0 {
root_storage.increment_strong_count(self.root_index());
} else {
entry.strong_count += 1;
}
Some(Root { raw })
}
}
None => None,
}
})
}
/**
Returns `true` if both `Gc`s point to the same heap-allocated object.
*/
#[inline]
pub fn ptr_eq(gc0: &Gc<T>, gc1: &Gc<T>) -> bool {
gc0.0 == gc1.0
}
}
impl<T: Allocate> Clone for Gc<T> {
#[inline]
fn clone(&self) -> Gc<T> {
with_heap(|heap| {
if heap.engine_id != self.engine_id() {
eprintln!("attempted to clone a Gc for an inactive Runtime - aborting process");
abort()
}
let mut root_storage = heap.root_storage.borrow_mut();
let entry = &mut root_storage.entries[self.root_index() as usize];
debug_assert!(entry.weak_count > 0);
entry.weak_count += 1;
Gc(self.0, PhantomData)
})
}
}
impl<T: Allocate> Drop for Gc<T> {
#[inline]
fn drop(&mut self) {
with_heap(|heap| {
if heap.engine_id != self.engine_id() {
eprintln!("attempted to drop a Gc for an inactive Runtime - aborting process");
abort()
}
heap.root_storage
.borrow_mut()
.decrement_weak_count(self.root_index());
});
}
}
//-------------------------------------------------------------------------------------------------
// GcVal
//-------------------------------------------------------------------------------------------------
/**
Equivalent to [`Val`](enum.Val.html), except that it stores weak [`Gc`](struct.Gc.html)
pointers rather than strong [`Root`](struct.Root.html) pointers.
Construct a `GcVal` by calling [`Val::downgrade`](enum.Val.html#method.downgrade). The `GcVal`
itself is an opaque struct which can't do anything useful. Instead, convert it to a `Val`
by calling its [`upgrade`](#method.upgrade) method.
A `GcVal` is only useful when you need to store a GameLisp value in an `RData`. `Val`s may
contain `Root`s, and storing a `Root` in an `RData` would cause a memory leak.
*/
#[derive(Clone)]
pub struct GcVal(GcValPriv);
#[derive(Clone)]
enum GcValPriv {
Nil,
Int(i32),
Flo(f32),
Char(char),
Bool(bool),
Sym(Sym),
Arr(Gc<Arr>),
Str(Gc<Str>),
Tab(Gc<Tab>),
GIter(Gc<GIter>),
Obj(Gc<Obj>),
Class(Gc<Class>),
GFn(Gc<GFn>),
Coro(Gc<Coro>),
RData(Gc<RData>),
RFn(Gc<RFn>),
}
impl Val {
/**
Constructs a [`GcVal`](struct.GcVal.html) based on this `Val`.
*/
pub fn downgrade(&self) -> GcVal {
GcVal(match self {
Val::Nil => GcValPriv::Nil,
Val::Int(i) => GcValPriv::Int(*i),
Val::Char(c) => GcValPriv::Char(*c),
Val::Flo(f) => GcValPriv::Flo(*f),
Val::Bool(b) => GcValPriv::Bool(*b),
Val::Sym(s) => GcValPriv::Sym(*s),
Val::Arr(ref a) => GcValPriv::Arr(a.downgrade()),
Val::Str(ref s) => GcValPriv::Str(s.downgrade()),
Val::Tab(ref t) => GcValPriv::Tab(t.downgrade()),
Val::GIter(ref g) => GcValPriv::GIter(g.downgrade()),
Val::Obj(ref o) => GcValPriv::Obj(o.downgrade()),
Val::Class(ref c) => GcValPriv::Class(c.downgrade()),
Val::GFn(ref g) => GcValPriv::GFn(g.downgrade()),
Val::Coro(ref c) => GcValPriv::Coro(c.downgrade()),
Val::RData(ref r) => GcValPriv::RData(r.downgrade()),
Val::RFn(ref r) => GcValPriv::RFn(r.downgrade()),
})
}
}
impl GcVal {
/**
Attempts to construct a [`Val`](enum.Val.html) based on this `GcVal`.
Returns `None` if this `GcVal` points to a heap-allocated object which has been
deallocated by the garbage collector. To prevent this, use
[`glsp::write_barrier`](fn.write_barrier.html) and
[`RClassBuilder::trace`](struct.RClassBuilder.html#method.trace).
*/
pub fn upgrade(&self) -> Option<Val> {
match &self.0 {
GcValPriv::Nil => Some(Val::Nil),
GcValPriv::Int(i) => Some(Val::Int(*i)),
GcValPriv::Char(c) => Some(Val::Char(*c)),
GcValPriv::Flo(f) => Some(Val::Flo(*f)),
GcValPriv::Bool(b) => Some(Val::Bool(*b)),
GcValPriv::Sym(s) => Some(Val::Sym(*s)),
GcValPriv::Arr(ref a) => a.upgrade().map(Val::Arr),
GcValPriv::Str(ref s) => s.upgrade().map(Val::Str),
GcValPriv::Tab(ref t) => t.upgrade().map(Val::Tab),
GcValPriv::GIter(ref g) => g.upgrade().map(Val::GIter),
GcValPriv::Obj(ref o) => o.upgrade().map(Val::Obj),
GcValPriv::Class(ref c) => c.upgrade().map(Val::Class),
GcValPriv::GFn(ref g) => g.upgrade().map(Val::GFn),
GcValPriv::Coro(ref c) => c.upgrade().map(Val::Coro),
GcValPriv::RData(ref r) => r.upgrade().map(Val::RData),
GcValPriv::RFn(ref r) => r.upgrade().map(Val::RFn),
}
}
}
//-------------------------------------------------------------------------------------------------
// Slot
//-------------------------------------------------------------------------------------------------
#[doc(hidden)]
#[derive(Clone)]
pub enum Slot {
Nil,
Int(i32),
Flo(f32),
Char(char),
Bool(bool),
Sym(Sym),
Arr(Raw<Arr>),
Str(Raw<Str>),
Tab(Raw<Tab>),
GIter(Raw<GIter>),
Obj(Raw<Obj>),
Class(Raw<Class>),
GFn(Raw<GFn>),
Coro(Raw<Coro>),
RData(Raw<RData>),
RFn(Raw<RFn>),
}
impl Slot {
#[inline]
pub(crate) fn from_val(val: &Val) -> Slot {
match *val {
Val::Nil => Slot::Nil,
Val::Int(i) => Slot::Int(i),
Val::Char(c) => Slot::Char(c),
Val::Flo(f) => Slot::Flo(f),
Val::Bool(b) => Slot::Bool(b),
Val::Sym(s) => Slot::Sym(s),
Val::Arr(ref a) => Slot::Arr(Raw::from_root(a)),
Val::Str(ref s) => Slot::Str(Raw::from_root(s)),
Val::Tab(ref t) => Slot::Tab(Raw::from_root(t)),
Val::GIter(ref g) => Slot::GIter(Raw::from_root(g)),
Val::Obj(ref o) => Slot::Obj(Raw::from_root(o)),
Val::Class(ref c) => Slot::Class(Raw::from_root(c)),
Val::GFn(ref g) => Slot::GFn(Raw::from_root(g)),
Val::Coro(ref c) => Slot::Coro(Raw::from_root(c)),
Val::RData(ref r) => Slot::RData(Raw::from_root(r)),
Val::RFn(ref r) => Slot::RFn(Raw::from_root(r)),
}
}
#[inline]
pub(crate) fn root(&self) -> Val {
match *self {
Slot::Nil => Val::Nil,
Slot::Int(i) => Val::Int(i),
Slot::Char(c) => Val::Char(c),
Slot::Flo(f) => Val::Flo(f),
Slot::Bool(b) => Val::Bool(b),
Slot::Sym(s) => Val::Sym(s),
Slot::Arr(ref a) => Val::Arr(a.root()),
Slot::Str(ref s) => Val::Str(s.root()),
Slot::Tab(ref t) => Val::Tab(t.root()),
Slot::GIter(ref g) => Val::GIter(g.root()),
Slot::Obj(ref o) => Val::Obj(o.root()),
Slot::Class(ref c) => Val::Class(c.root()),
Slot::GFn(ref c) => Val::GFn(c.root()),
Slot::Coro(ref c) => Val::Coro(c.root()),
Slot::RData(ref r) => Val::RData(r.root()),
Slot::RFn(ref r) => Val::RFn(r.root()),
}
}
pub(crate) fn type_name(&self) -> &'static str {
self.root().type_name()
}
pub(crate) fn a_type_name(&self) -> &'static str {
self.root().a_type_name()
}
}
//Slot implements Eq and Hash so that it can be used as HashMap key. unlike Val, its PartialEq
//implementation has the semantics of keys_eqv, rather than eq.
impl PartialEq<Slot> for Slot {
#[inline]
fn eq(&self, other: &Slot) -> bool {
self.root().keys_eqv(&other.root())
}
}