Size ptr tuple (#10846)
* fixes #10117 * Add support for recursive tuples * detect in generics
This commit is contained in:
parent
5661a8303c
commit
97c3b113a5
8 changed files with 153 additions and 10 deletions
49
tests/destructor/smart_ptr.nim
Normal file
49
tests/destructor/smart_ptr.nim
Normal file
|
|
@ -0,0 +1,49 @@
|
|||
|
||||
type
|
||||
SharedPtr*[T] = object
|
||||
val: ptr tuple[atomicCounter: int, value: T]
|
||||
|
||||
proc `=destroy`*[T](p: var SharedPtr[T]) =
|
||||
mixin `=destroy`
|
||||
if p.val != nil:
|
||||
let c = atomicDec(p.val[].atomicCounter)
|
||||
if c == 0:
|
||||
`=destroy`(p.val.value)
|
||||
freeShared(p.val)
|
||||
p.val = nil
|
||||
|
||||
proc `=`*[T](dest: var SharedPtr[T], src: SharedPtr[T]) {.inline.} =
|
||||
if dest.val != src.val:
|
||||
if dest.val != nil:
|
||||
`=destroy`(dest)
|
||||
if src.val != nil:
|
||||
discard atomicInc(src.val[].atomicCounter)
|
||||
dest.val = src.val
|
||||
|
||||
proc `=sink`*[T](dest: var SharedPtr[T], src: SharedPtr[T]) {.inline.} =
|
||||
if dest.val != src.val:
|
||||
if dest.val != nil:
|
||||
`=destroy`(dest)
|
||||
dest.val = src.val
|
||||
|
||||
proc newSharedPtr*[T](val: sink T): SharedPtr[T] =
|
||||
result.val = cast[type(result.val)](allocShared0(sizeof(result.val[])))
|
||||
result.val.atomicCounter = 1
|
||||
result.val.value = val
|
||||
|
||||
func get*[T](p: SharedPtr[T]): var T {.inline.} =
|
||||
p.val.value
|
||||
|
||||
func isNil*[T](p: SharedPtr[T]): bool {.inline.} =
|
||||
p.val == nil
|
||||
|
||||
proc cas*[T](p, old_val: var SharedPtr[T], new_val: SharedPtr[T]): bool {.inline.} =
|
||||
if old_val.val == new_val.val:
|
||||
result = true
|
||||
else:
|
||||
result = cas(p.val.addr, old_val.val, new_val.val)
|
||||
if result:
|
||||
`=destroy`(old_val)
|
||||
if new_val.val != nil:
|
||||
discard atomicInc(new_val.val[].atomicCounter)
|
||||
|
||||
34
tests/destructor/trecursive.nim
Normal file
34
tests/destructor/trecursive.nim
Normal file
|
|
@ -0,0 +1,34 @@
|
|||
|
||||
discard """
|
||||
output: '''
|
||||
test1 OK
|
||||
'''
|
||||
"""
|
||||
|
||||
import smart_ptr
|
||||
|
||||
type
|
||||
Node[T] = object
|
||||
value: T
|
||||
next: SharedPtr[Node[T]]
|
||||
|
||||
ForwardList[T] = object
|
||||
first: SharedPtr[Node[T]]
|
||||
len: Natural
|
||||
|
||||
proc pushFront*[T] (list: var ForwardList[T], val: sink T) =
|
||||
var newNode = newSharedPtr(Node[T](value: val))
|
||||
var result = false
|
||||
while not result:
|
||||
var head = list.first
|
||||
newNode.get.next = head
|
||||
result = list.first.cas(head, newNode)
|
||||
list.len.atomicInc()
|
||||
|
||||
proc test1() =
|
||||
var list: ForwardList[int]
|
||||
list.pushFront(1)
|
||||
doAssert list.len == 1
|
||||
echo "test1 OK"
|
||||
|
||||
test1()
|
||||
Loading…
Add table
Add a link
Reference in a new issue