jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

new implementations for --gc:orc (#14121)

Browse source 
* cycle collector: new implementation
* cycle collector: make self-adaptive based on its previous effectiveness
* cycle collector: added Lins's jump stack to improve traversal from 3*N to 2*N
* cycle collector: make tests green
* API extensions and bugfixes
* code cleanup and use --gc:orc for tasyncawait
This commit is contained in:
Andreas Rumpf 2020-04-27 11:57:26 +02:00 • committed by GitHub
commit dedb04fa9e
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
13 changed files with 428 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

17
lib/system/cellseqs_v2.nim
View file

@ -10,13 +10,13 @@
# Cell seqs for cyclebreaker and cyclicrefs_v2.
type
CellTuple = (ptr pointer, PNimType)
CellTuple = (PT, PNimType)
CellArray = ptr UncheckedArray[CellTuple]
CellSeq = object
len, cap: int
d: CellArray
proc add(s: var CellSeq, c: ptr pointer; t: PNimType) {.inline.} =
proc add(s: var CellSeq, c: PT; t: PNimType) {.inline.} =
if s.len >= s.cap:
s.cap = s.cap * 3 div 2
when defined(useMalloc):
@ -42,14 +42,15 @@ proc init(s: var CellSeq, cap: int = 1024) =
s.d = cast[CellArray](alloc(s.cap * sizeof(CellTuple)))
proc deinit(s: var CellSeq) =
when defined(useMalloc):
c_free(s.d)
else:
dealloc(s.d)
s.d = nil
if s.d != nil:
when defined(useMalloc):
c_free(s.d)
else:
dealloc(s.d)
s.d = nil
s.len = 0
s.cap = 0
proc pop(s: var CellSeq): (ptr pointer, PNimType) =
proc pop(s: var CellSeq): (PT, PNimType) =
result = s.d[s.len-1]
dec s.len