mirror of
https://github.com/nim-lang/Nim.git
synced 2025-12-29 09:24:36 +00:00
dedb04fa9e
* 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
57 lines
1.3 KiB
Nim
57 lines
1.3 KiB
Nim
#
|
|
#
|
|
# Nim's Runtime Library
|
|
# (c) Copyright 2019 Andreas Rumpf
|
|
#
|
|
# See the file "copying.txt", included in this
|
|
# distribution, for details about the copyright.
|
|
#
|
|
|
|
# Cell seqs for cyclebreaker and cyclicrefs_v2.
|
|
|
|
type
|
|
CellTuple = (PT, PNimType)
|
|
CellArray = ptr UncheckedArray[CellTuple]
|
|
CellSeq = object
|
|
len, cap: int
|
|
d: CellArray
|
|
|
|
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):
|
|
var d = cast[CellArray](c_malloc(uint(s.cap * sizeof(CellTuple))))
|
|
else:
|
|
var d = cast[CellArray](alloc(s.cap * sizeof(CellTuple)))
|
|
copyMem(d, s.d, s.len * sizeof(CellTuple))
|
|
when defined(useMalloc):
|
|
c_free(s.d)
|
|
else:
|
|
dealloc(s.d)
|
|
s.d = d
|
|
# XXX: realloc?
|
|
s.d[s.len] = (c, t)
|
|
inc(s.len)
|
|
|
|
proc init(s: var CellSeq, cap: int = 1024) =
|
|
s.len = 0
|
|
s.cap = cap
|
|
when defined(useMalloc):
|
|
s.d = cast[CellArray](c_malloc(uint(s.cap * sizeof(CellTuple))))
|
|
else:
|
|
s.d = cast[CellArray](alloc(s.cap * sizeof(CellTuple)))
|
|
|
|
proc deinit(s: var CellSeq) =
|
|
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): (PT, PNimType) =
|
|
result = s.d[s.len-1]
|
|
dec s.len
|