GC tests: make them take less time to save CI cycles
This commit is contained in:
parent
f7c0360aba
commit
9985706fb8
2 changed files with 5 additions and 7 deletions
|
|
@ -12,7 +12,7 @@ type
|
||||||
proc makeObj(): TTestObj =
|
proc makeObj(): TTestObj =
|
||||||
result.x = "Hello"
|
result.x = "Hello"
|
||||||
|
|
||||||
for i in 1 .. 1_000_000:
|
for i in 1 .. 100_000:
|
||||||
when defined(gcMarkAndSweep) or defined(boehmgc):
|
when defined(gcMarkAndSweep) or defined(boehmgc):
|
||||||
GC_fullcollect()
|
GC_fullcollect()
|
||||||
var obj = makeObj()
|
var obj = makeObj()
|
||||||
|
|
|
||||||
|
|
@ -10,15 +10,13 @@ import lists
|
||||||
import strutils
|
import strutils
|
||||||
|
|
||||||
proc mkleak() =
|
proc mkleak() =
|
||||||
# allocate 10 MB via linked lists
|
# allocate 1 MB via linked lists
|
||||||
let numberOfLists = 100
|
let numberOfLists = 100
|
||||||
for i in countUp(1, numberOfLists):
|
for i in countUp(1, numberOfLists):
|
||||||
var leakList = initDoublyLinkedList[string]()
|
var leakList = initDoublyLinkedList[string]()
|
||||||
let numberOfLeaks = 50000
|
let numberOfLeaks = 5000
|
||||||
for j in countUp(1, numberOfLeaks):
|
for j in countUp(1, numberOfLeaks):
|
||||||
let leakSize = 200
|
leakList.append(newString(200))
|
||||||
let leaked = newString(leakSize)
|
|
||||||
leakList.append(leaked)
|
|
||||||
|
|
||||||
proc mkManyLeaks() =
|
proc mkManyLeaks() =
|
||||||
for i in 0..0:
|
for i in 0..0:
|
||||||
|
|
@ -29,7 +27,7 @@ proc mkManyLeaks() =
|
||||||
# lists and bring the memory usage down to a few MB's.
|
# lists and bring the memory usage down to a few MB's.
|
||||||
GC_fullCollect()
|
GC_fullCollect()
|
||||||
when false: echo getOccupiedMem()
|
when false: echo getOccupiedMem()
|
||||||
if getOccupiedMem() > 8 * 200 * 50_000 * 2:
|
if getOccupiedMem() > 8 * 200 * 5000 * 2:
|
||||||
echo GC_getStatistics()
|
echo GC_getStatistics()
|
||||||
quit "leaking"
|
quit "leaking"
|
||||||
echo "Success"
|
echo "Success"
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue