racket/collects/tests/mzscheme/will.ss
Matthew Flatt e1126a66ed some gc-related tests
svn: r12705
2008-12-04 23:04:10 +00:00

139 lines
4.3 KiB
Scheme

(load-relative "loadtest.ss")
(Section 'wills)
(test #f will-executor? 5)
(test #t will-executor? (make-will-executor))
(define we (make-will-executor))
;; Never GC this one:
(test (void) will-register we test (lambda (x) (error 'bad-will-call)))
; There's no excuse for not GCing half or more:
(define counter null)
(let loop ([n 10])
(unless (zero? n)
(will-register we (cons n null)
(lambda (s)
(set! counter (cons (car s) counter))
12))
(loop (sub1 n))))
(collect-garbage)
(collect-garbage)
(let* ([v #f]
[t (thread (lambda () (set! v (will-execute we))))])
(sleep 0.1)
(test #f thread-running? t)
(test v values 12))
(let loop ([m 1])
(if (let ([v (will-try-execute we)])
(test #t 'good-result (or (not v) (= v 12)))
v)
(loop (add1 m))
(begin
(test #t >= m 5)
;; Make sure counter grew ok
(test m length counter)
;; Make sure they're all different
(let loop ([l counter])
(unless (or (null? l) (null? (cdr l)))
(test #f member (car l) (cdr l))
(loop (cdr l)))))))
(err/rt-test (will-register we we we))
(err/rt-test (will-register we we (lambda () 10)))
(err/rt-test (will-register 5 we (lambda (s) 10)))
(err/rt-test (will-execute "bad"))
(err/rt-test (will-try-execute "bad"))
(arity-test make-will-executor 0 0)
(arity-test will-executor? 1 1)
(arity-test will-register 3 3)
(arity-test will-execute 1 1)
(arity-test will-try-execute 1 1)
;; ----------------------------------------
;; Test custodian boxes
(let ([c (make-custodian)]
[we (make-will-executor)]
[removed null])
(let ([mk-finalized (lambda (n)
(let ([l (list n)])
(will-register we l (lambda (v)
(set! removed (cons (car v) removed))))
(make-custodian-box c l)))]
[gc (lambda ()
(collect-garbage)
(collect-garbage)
(let loop ()
(when (will-try-execute we)
(loop)))
(collect-garbage)
(collect-garbage))]
[b1 (make-custodian-box c 12)])
(let ([saved (map mk-finalized '(a b c d e f g h i))])
(let loop ([m 2])
(unless (zero? m)
(set! removed null)
(let loop ([n 100])
(unless (zero? n)
(mk-finalized n)
(loop (sub1 n))))
(gc)
;; finalize at least half?
(test #t > (length removed) 50)
(test #f ormap symbol? removed)
(test 12 custodian-box-value b1)
(loop (sub1 m))))
(test #t andmap (lambda (x) (and (pair? x) (symbol? (car x))))
(map custodian-box-value saved))
(set! removed null)
(custodian-shutdown-all c)
(test #f custodian-box-value b1)
(test #f ormap values (map custodian-box-value saved))
(gc)
(test #t <= 5 (apply + (map (lambda (v) (if (symbol? v) 1 0)) removed))))))
(when (custodian-memory-accounting-available?)
;; Check custodian boxes for accounting
(let* ([c (map (lambda (n) (make-custodian))
'(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20))]
[b (map (lambda (c)
(make-custodian-box c (make-bytes 100000)))
c)]
[t (map (lambda (c)
;; Each thread can reach all boxes:
(parameterize ([current-custodian c])
(thread (lambda () (sync (make-semaphore)) b))))
c)])
;; Each custodian must be charged at least 100000 bytes:
(collect-garbage)
(test #t andmap (lambda (c)
((current-memory-use c) . >= . 100000))
c)))
(let ()
(define c1 (make-custodian (current-custodian)))
(define b1 (make-custodian-box c1 #t))
(define c2 (make-custodian c1))
(define b2 (make-custodian-box c2 #t))
(test '(#t #t) map custodian-box-value (list b1 b2))
(custodian-shutdown-all c1)
(test '(#f #f) map custodian-box-value (list b1 b2)))
(let ()
(let ([c (make-custodian)])
(let ([l (for/list ([i (in-range 32)])
(make-custodian-box c 7))])
(test #t andmap (lambda (b) (number? (custodian-box-value b))) l)
(custodian-shutdown-all c)
(test #f ormap (lambda (b) (number? (custodian-box-value b))) l))))
;; ----------------------------------------
(report-errs)