mirror of
https://github.com/nim-lang/Nim.git
synced 2025-12-31 02:12:11 +00:00
a5e67071d2
* fixes #13102 * closes #13149 * ARC: fixes a move optimizer bug (there are more left regarding array and tuple indexing) * proper fix; fixes #12957 * fixes yet another case object '=' code generation problem
147 lines
2.8 KiB
Nim
147 lines
2.8 KiB
Nim
discard """
|
|
valgrind: true
|
|
cmd: "nim c --gc:arc -d:useMalloc $file"
|
|
output: '''myobj destroyed
|
|
myobj destroyed
|
|
myobj destroyed
|
|
A
|
|
B
|
|
begin
|
|
end
|
|
myobj destroyed
|
|
'''
|
|
"""
|
|
|
|
# bug #13102
|
|
|
|
type
|
|
D = ref object
|
|
R = object
|
|
case o: bool
|
|
of false:
|
|
discard
|
|
of true:
|
|
field: D
|
|
|
|
iterator things(): R =
|
|
when true:
|
|
var
|
|
unit = D()
|
|
while true:
|
|
yield R(o: true, field: unit)
|
|
else:
|
|
while true:
|
|
var
|
|
unit = D()
|
|
yield R(o: true, field: unit)
|
|
|
|
proc main =
|
|
var i = 0
|
|
for item in things():
|
|
discard item.field
|
|
inc i
|
|
if i == 2: break
|
|
|
|
main()
|
|
|
|
# bug #13149
|
|
|
|
type
|
|
TMyObj = object
|
|
p: pointer
|
|
len: int
|
|
|
|
proc `=destroy`(o: var TMyObj) =
|
|
if o.p != nil:
|
|
dealloc o.p
|
|
o.p = nil
|
|
echo "myobj destroyed"
|
|
|
|
proc `=`(dst: var TMyObj, src: TMyObj) =
|
|
`=destroy`(dst)
|
|
dst.p = alloc(src.len)
|
|
dst.len = src.len
|
|
|
|
proc `=sink`(dst: var TMyObj, src: TMyObj) =
|
|
`=destroy`(dst)
|
|
dst.p = src.p
|
|
dst.len = src.len
|
|
|
|
type
|
|
TObjKind = enum Z, A, B
|
|
TCaseObj = object
|
|
case kind: TObjKind
|
|
of Z: discard
|
|
of A:
|
|
x1: int # this int plays important role
|
|
x2: TMyObj
|
|
of B:
|
|
y: TMyObj
|
|
|
|
proc testSinks: TCaseObj =
|
|
result = TCaseObj(kind: A, x1: 5000, x2: TMyObj(len: 5, p: alloc(5)))
|
|
result = TCaseObj(kind: B, y: TMyObj(len: 3, p: alloc(3)))
|
|
|
|
proc use(x: TCaseObj) = discard
|
|
|
|
proc testCopies(i: int) =
|
|
var a: array[2, TCaseObj]
|
|
a[i] = TCaseObj(kind: A, x1: 5000, x2: TMyObj(len: 5, p: alloc(5)))
|
|
a[i+1] = a[i] # copy, cannot move
|
|
use(a[i])
|
|
|
|
let x1 = testSinks()
|
|
testCopies(0)
|
|
|
|
# bug #12957
|
|
|
|
type
|
|
PegKind* = enum
|
|
pkCharChoice,
|
|
pkSequence
|
|
Peg* = object ## type that represents a PEG
|
|
case kind: PegKind
|
|
of pkCharChoice: charChoice: ref set[char]
|
|
else: discard
|
|
sons: seq[Peg]
|
|
|
|
proc charSet*(s: set[char]): Peg =
|
|
## constructs a PEG from a character set `s`
|
|
result = Peg(kind: pkCharChoice)
|
|
new(result.charChoice)
|
|
result.charChoice[] = s
|
|
|
|
proc len(a: Peg): int {.inline.} = return a.sons.len
|
|
proc myadd(d: var Peg, s: Peg) {.inline.} = add(d.sons, s)
|
|
|
|
proc sequence*(a: openArray[Peg]): Peg =
|
|
result = Peg(kind: pkSequence, sons: @[])
|
|
when false:
|
|
#works too:
|
|
result.myadd(a[0])
|
|
result.myadd(a[1])
|
|
for x in items(a):
|
|
# works:
|
|
#result.sons.add(x)
|
|
# fails:
|
|
result.myadd x
|
|
if result.len == 1:
|
|
result = result.sons[0] # this must not move!
|
|
|
|
when true:
|
|
# bug #12957
|
|
|
|
proc p =
|
|
echo "A"
|
|
let x = sequence([charSet({'a'..'z', 'A'..'Z', '_'}),
|
|
charSet({'a'..'z', 'A'..'Z', '0'..'9', '_'})])
|
|
echo "B"
|
|
p()
|
|
|
|
proc testSubObjAssignment =
|
|
echo "begin"
|
|
# There must be extactly one element in the array constructor!
|
|
let x = sequence([charSet({'a'..'z', 'A'..'Z', '_'})])
|
|
echo "end"
|
|
testSubObjAssignment()
|