;;;; tree-il.test --- test suite for compiling tree-il -*- scheme -*-
;;;; Andy Wingo <wingo@pobox.com> --- May 2009
;;;;
-;;;; Copyright (C) 2009, 2010, 2011 Free Software Foundation, Inc.
+;;;; Copyright (C) 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
;;;;
;;;; This library is free software; you can redistribute it and/or
;;;; modify it under the terms of the GNU Lesser General Public
(pat (guard guard-exp) #t)
(_ #f))))))
-(define peval
- ;; The partial evaluator.
- (@@ (language tree-il optimize) peval))
-
-(define-syntax pass-if-peval
- (syntax-rules (resolve-primitives)
- ((_ in pat)
- (pass-if-peval in pat
- (compile 'in #:from 'scheme #:to 'tree-il)))
- ((_ resolve-primitives in pat)
- (pass-if-peval in pat
- (expand-primitives!
- (resolve-primitives!
- (compile 'in #:from 'scheme #:to 'tree-il)
- (current-module)))))
- ((_ in pat code)
- (pass-if 'in
- (let ((evaled (unparse-tree-il (peval code))))
- (pmatch evaled
- (pat #t)
- (_ (pk 'peval-mismatch)
- ((@ (ice-9 pretty-print) pretty-print)
- 'in)
- (newline)
- ((@ (ice-9 pretty-print) pretty-print)
- evaled)
- (newline)
- ((@ (ice-9 pretty-print) pretty-print)
- 'pat)
- (newline)
- #f)))))))
-
\f
(with-test-prefix "tree-il->scheme"
(pass-if-tree-il->scheme
(call new-frame 0) (toplevel ref bar) (call call 0)
(bind (x #f 2) (y #f 3)) (lexical #t #f set 3) (lexical #t #f set 2)
(lexical #t #f ref 2) (lexical #t #t set 0)
- (lexical #t #f ref 3) (lexical #t #t set 1) (unbind)
+ (lexical #t #f ref 3) (lexical #t #t set 1)
+ (void) (lexical #t #f set 2) (void) (lexical #t #f set 3) ;; clear bindings
+ (unbind)
(lexical #t #t ref 0) (lexical #t #t ref 1)
(call add 2) (call return 1) (unbind)))
(primcall +
(primcall values (const 1) (const 2)))
(program () (std-prelude 0 0 #f) (label _)
- (const 1) (call return 1))))
+ (const 1) (call return 1)))
+
+ ;; Testing `(values foo)' in push context with RA.
+ (assert-tree-il->glil without-partial-evaluation
+ (primcall cdr
+ (letrec (lp) (#{lp ~V9KrhVD4PFEL6oCTrLg3A}#)
+ ((lambda ((name . lp))
+ (lambda-case ((() #f #f #f () ())
+ (primcall values (const (one two)))))))
+ (call (lexical lp #{lp ~V9KrhVD4PFEL6oCTrLg3A}#))))
+ (program () (std-prelude 0 0 #f) (label _)
+ (branch br _) ;; entering the fix, jump to :2
+ ;; :1 body of lp, jump to :3
+ (label _) (bind) (const (one two)) (branch br _) (unbind)
+ ;; :2 initial call of lp, jump to :1
+ (label _) (bind) (branch br _) (label _) (unbind)
+ ;; :3 the push continuation
+ (call cdr 1) (call return 1))))
;; FIXME: binding info for or-hacked locals might bork the disassembler,
;; and could be tightened in any case
#:opts '(#:partial-eval? #f)))))
\f
-(with-test-prefix "partial evaluation"
-
- (pass-if-peval
- ;; First order, primitive.
- (let ((x 1) (y 2)) (+ x y))
- (const 3))
-
- (pass-if-peval
- ;; First order, thunk.
- (let ((x 1) (y 2))
- (let ((f (lambda () (+ x y))))
- (f)))
- (const 3))
-
- (pass-if-peval resolve-primitives
- ;; First order, let-values (requires primitive expansion for
- ;; `call-with-values'.)
- (let ((x 0))
- (call-with-values
- (lambda () (if (zero? x) (values 1 2) (values 3 4)))
- (lambda (a b)
- (+ a b))))
- (const 3))
-
- (pass-if-peval
- ;; First order, coalesced, mutability preserved.
- (cons 0 (cons 1 (cons 2 (list 3 4 5))))
- (primcall list
- (const 0) (const 1) (const 2) (const 3) (const 4) (const 5)))
-
- (pass-if-peval
- ;; First order, coalesced, mutability preserved.
- (cons 0 (cons 1 (cons 2 (list 3 4 5))))
- ;; This must not be a constant.
- (primcall list
- (const 0) (const 1) (const 2) (const 3) (const 4) (const 5)))
-
- (pass-if-peval
- ;; First order, coalesced, immutability preserved.
- (cons 0 (cons 1 (cons 2 '(3 4 5))))
- (primcall cons (const 0)
- (primcall cons (const 1)
- (primcall cons (const 2)
- (const (3 4 5))))))
-
- ;; These two tests doesn't work any more because we changed the way we
- ;; deal with constants -- now the algorithm will see a construction as
- ;; being bound to the lexical, so it won't propagate it. It can't
- ;; even propagate it in the case that it is only referenced once,
- ;; because:
- ;;
- ;; (let ((x (cons 1 2))) (lambda () x))
- ;;
- ;; is not the same as
- ;;
- ;; (lambda () (cons 1 2))
- ;;
- ;; Perhaps if we determined that not only was it only referenced once,
- ;; it was not closed over by a lambda, then we could propagate it, and
- ;; re-enable these two tests.
- ;;
- #;
- (pass-if-peval
- ;; First order, mutability preserved.
- (let loop ((i 3) (r '()))
- (if (zero? i)
- r
- (loop (1- i) (cons (cons i i) r))))
- (primcall list
- (primcall cons (const 1) (const 1))
- (primcall cons (const 2) (const 2))
- (primcall cons (const 3) (const 3))))
- ;;
- ;; See above.
- #;
- (pass-if-peval
- ;; First order, evaluated.
- (let loop ((i 7)
- (r '()))
- (if (<= i 0)
- (car r)
- (loop (1- i) (cons i r))))
- (const 1))
-
- ;; Instead here are tests for what happens for the above cases: they
- ;; unroll but they don't fold.
- (pass-if-peval
- (let loop ((i 3) (r '()))
- (if (zero? i)
- r
- (loop (1- i) (cons (cons i i) r))))
- (let (r) (_)
- ((primcall list
- (primcall cons (const 3) (const 3))))
- (let (r) (_)
- ((primcall cons
- (primcall cons (const 2) (const 2))
- (lexical r _)))
- (primcall cons
- (primcall cons (const 1) (const 1))
- (lexical r _)))))
-
- ;; See above.
- (pass-if-peval
- (let loop ((i 4)
- (r '()))
- (if (<= i 0)
- (car r)
- (loop (1- i) (cons i r))))
- (let (r) (_)
- ((primcall list (const 4)))
- (let (r) (_)
- ((primcall cons
- (const 3)
- (lexical r _)))
- (let (r) (_)
- ((primcall cons
- (const 2)
- (lexical r _)))
- (let (r) (_)
- ((primcall cons
- (const 1)
- (lexical r _)))
- (primcall car
- (lexical r _)))))))
-
- ;; Static sums.
- (pass-if-peval
- (let loop ((l '(1 2 3 4)) (sum 0))
- (if (null? l)
- sum
- (loop (cdr l) (+ sum (car l)))))
- (const 10))
-
- (pass-if-peval resolve-primitives
- (let ((string->chars
- (lambda (s)
- (define (char-at n)
- (string-ref s n))
- (define (len)
- (string-length s))
- (let loop ((i 0))
- (if (< i (len))
- (cons (char-at i)
- (loop (1+ i)))
- '())))))
- (string->chars "yo"))
- (apply (primitive list) (const #\y) (const #\o)))
-
- (pass-if-peval
- ;; Primitives in module-refs are resolved (the expansion of `pmatch'
- ;; below leads to calls to (@@ (system base pmatch) car) and
- ;; similar, which is what we want to be inlined.)
- (begin
- (use-modules (system base pmatch))
- (pmatch '(a b c d)
- ((a b . _)
- #t)))
- (seq (call . _)
- (const #t)))
-
- (pass-if-peval
- ;; Mutability preserved.
- ((lambda (x y z) (list x y z)) 1 2 3)
- (primcall list (const 1) (const 2) (const 3)))
-
- (pass-if-peval
- ;; Don't propagate effect-free expressions that operate on mutable
- ;; objects.
- (let* ((x (list 1))
- (y (car x)))
- (set-car! x 0)
- y)
- (let (x) (_) ((primcall list (const 1)))
- (let (y) (_) ((primcall car (lexical x _)))
- (seq
- (call (toplevel set-car!) (lexical x _) (const 0))
- (lexical y _)))))
-
- (pass-if-peval
- ;; Don't propagate effect-free expressions that operate on objects we
- ;; don't know about.
- (let ((y (car x)))
- (set-car! x 0)
- y)
- (let (y) (_) ((primcall car (toplevel x)))
- (seq
- (call (toplevel set-car!) (toplevel x) (const 0))
- (lexical y _))))
-
- (pass-if-peval
- ;; Infinite recursion
- ((lambda (x) (x x)) (lambda (x) (x x)))
- (let (x) (_)
- ((lambda _
- (lambda-case
- (((x) _ _ _ _ _)
- (call (lexical x _) (lexical x _))))))
- (call (lexical x _) (lexical x _))))
-
- (pass-if-peval
- ;; First order, aliased primitive.
- (let* ((x *) (y (x 1 2))) y)
- (const 2))
-
- (pass-if-peval
- ;; First order, shadowed primitive.
- (begin
- (define (+ x y) (pk x y))
- (+ 1 2))
- (seq
- (define +
- (lambda (_)
- (lambda-case
- (((x y) #f #f #f () (_ _))
- (call (toplevel pk) (lexical x _) (lexical y _))))))
- (call (toplevel +) (const 1) (const 2))))
-
- (pass-if-peval
- ;; First-order, effects preserved.
- (let ((x 2))
- (do-something!)
- x)
- (seq
- (call (toplevel do-something!))
- (const 2)))
-
- (pass-if-peval
- ;; First order, residual bindings removed.
- (let ((x 2) (y 3))
- (* (+ x y) z))
- (primcall * (const 5) (toplevel z)))
-
- (pass-if-peval
- ;; First order, with lambda.
- (define (foo x)
- (define (bar z) (* z z))
- (+ x (bar 3)))
- (define foo
- (lambda (_)
- (lambda-case
- (((x) #f #f #f () (_))
- (primcall + (lexical x _) (const 9)))))))
-
- (pass-if-peval
- ;; First order, with lambda inlined & specialized twice.
- (let ((f (lambda (x y)
- (+ (* x top) y)))
- (x 2)
- (y 3))
- (+ (* x (f x y))
- (f something x)))
- (primcall +
- (primcall *
- (const 2)
- (primcall + ; (f 2 3)
- (primcall *
- (const 2)
- (toplevel top))
- (const 3)))
- (let (x) (_) ((toplevel something)) ; (f something 2)
- ;; `something' is not const, so preserve order of
- ;; effects with a lexical binding.
- (primcall +
- (primcall *
- (lexical x _)
- (toplevel top))
- (const 2)))))
-
- (pass-if-peval
- ;; First order, with lambda inlined & specialized 3 times.
- (let ((f (lambda (x y) (if (> x 0) y x))))
- (+ (f -1 0)
- (f 1 0)
- (f -1 y)
- (f 2 y)
- (f z y)))
- (primcall +
- (const -1) ; (f -1 0)
- (const 0) ; (f 1 0)
- (seq (toplevel y) (const -1)) ; (f -1 y)
- (toplevel y) ; (f 2 y)
- (let (x y) (_ _) ((toplevel z) (toplevel y)) ; (f z y)
- (if (primcall > (lexical x _) (const 0))
- (lexical y _)
- (lexical x _)))))
-
- (pass-if-peval
- ;; First order, conditional.
- (let ((y 2))
- (lambda (x)
- (if (> y 0)
- (display x)
- 'never-reached)))
- (lambda ()
- (lambda-case
- (((x) #f #f #f () (_))
- (call (toplevel display) (lexical x _))))))
-
- (pass-if-peval
- ;; First order, recursive procedure.
- (letrec ((fibo (lambda (n)
- (if (<= n 1)
- n
- (+ (fibo (- n 1))
- (fibo (- n 2)))))))
- (fibo 4))
- (const 3))
-
- (pass-if-peval
- ;; Don't propagate toplevel references, as intervening expressions
- ;; could alter their bindings.
- (let ((x top))
- (foo)
- x)
- (let (x) (_) ((toplevel top))
- (seq
- (call (toplevel foo))
- (lexical x _))))
-
- (pass-if-peval
- ;; Higher order.
- ((lambda (f x)
- (f (* (car x) (cadr x))))
- (lambda (x)
- (+ x 1))
- '(2 3))
- (const 7))
-
- (pass-if-peval
- ;; Higher order with optional argument (default value).
- ((lambda* (f x #:optional (y 0))
- (+ y (f (* (car x) (cadr x)))))
- (lambda (x)
- (+ x 1))
- '(2 3))
- (const 7))
-
- (pass-if-peval
- ;; Higher order with optional argument (caller-supplied value).
- ((lambda* (f x #:optional (y 0))
- (+ y (f (* (car x) (cadr x)))))
- (lambda (x)
- (+ x 1))
- '(2 3)
- 35)
- (const 42))
-
- (pass-if-peval
- ;; Higher order with optional argument (side-effecting default
- ;; value).
- ((lambda* (f x #:optional (y (foo)))
- (+ y (f (* (car x) (cadr x)))))
- (lambda (x)
- (+ x 1))
- '(2 3))
- (let (y) (_) ((call (toplevel foo)))
- (primcall + (lexical y _) (const 7))))
-
- (pass-if-peval
- ;; Higher order with optional argument (caller-supplied value).
- ((lambda* (f x #:optional (y (foo)))
- (+ y (f (* (car x) (cadr x)))))
- (lambda (x)
- (+ x 1))
- '(2 3)
- 35)
- (const 42))
-
- (pass-if-peval
- ;; Higher order.
- ((lambda (f) (f x)) (lambda (x) x))
- (toplevel x))
-
- (pass-if-peval
- ;; Bug reported at
- ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00019.html>.
- (let ((fold (lambda (f g) (f (g top)))))
- (fold 1+ (lambda (x) x)))
- (primcall 1+ (toplevel top)))
-
- (pass-if-peval
- ;; Procedure not inlined when residual code contains recursive calls.
- ;; <http://debbugs.gnu.org/9542>
- (letrec ((fold (lambda (f x3 b null? car cdr)
- (if (null? x3)
- b
- (f (car x3) (fold f (cdr x3) b null? car cdr))))))
- (fold * x 1 zero? (lambda (x1) x1) (lambda (x2) (- x2 1))))
- (letrec (fold) (_) (_)
- (call (lexical fold _)
- (primitive *)
- (toplevel x)
- (const 1)
- (primitive zero?)
- (lambda ()
- (lambda-case
- (((x1) #f #f #f () (_))
- (lexical x1 _))))
- (lambda ()
- (lambda-case
- (((x2) #f #f #f () (_))
- (primcall - (lexical x2 _) (const 1))))))))
-
- (pass-if "inlined lambdas are alpha-renamed"
- ;; In this example, `make-adder' is inlined more than once; thus,
- ;; they should use different gensyms for their arguments, because
- ;; the various optimization passes assume uniquely-named variables.
- ;;
- ;; Bug reported at
- ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00019.html> and
- ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00029.html>.
- (pmatch (unparse-tree-il
- (peval (compile
- '(let ((make-adder
- (lambda (x) (lambda (y) (+ x y)))))
- (cons (make-adder 1) (make-adder 2)))
- #:to 'tree-il)))
- ((primcall cons
- (lambda ()
- (lambda-case
- (((y) #f #f #f () (,gensym1))
- (primcall +
- (const 1)
- (lexical y ,ref1)))))
- (lambda ()
- (lambda-case
- (((y) #f #f #f () (,gensym2))
- (primcall +
- (const 2)
- (lexical y ,ref2))))))
- (and (eq? gensym1 ref1)
- (eq? gensym2 ref2)
- (not (eq? gensym1 gensym2))))
- (_ #f)))
-
- (pass-if-peval
- ;; Unused letrec bindings are pruned.
- (letrec ((a (lambda () (b)))
- (b (lambda () (a)))
- (c (lambda (x) x)))
- (c 10))
- (const 10))
-
- (pass-if-peval
- ;; Unused letrec bindings are pruned.
- (letrec ((a (foo!))
- (b (lambda () (a)))
- (c (lambda (x) x)))
- (c 10))
- (seq (call (toplevel foo!))
- (const 10)))
-
- (pass-if-peval
- ;; Higher order, mutually recursive procedures.
- (letrec ((even? (lambda (x)
- (or (= 0 x)
- (odd? (- x 1)))))
- (odd? (lambda (x)
- (not (even? x)))))
- (and (even? 4) (odd? 7)))
- (const #t))
-
- (pass-if-peval
- ;; Memv with constants.
- (memv 1 '(3 2 1))
- (const '(1)))
-
- (pass-if-peval
- ;; Memv with non-constant list. It could fold but doesn't
- ;; currently.
- (memv 1 (list 3 2 1))
- (primcall memv
- (const 1)
- (primcall list (const 3) (const 2) (const 1))))
-
- (pass-if-peval
- ;; Memv with non-constant key, constant list, test context
- (case foo
- ((3 2 1) 'a)
- (else 'b))
- (if (let (t) (_) ((toplevel foo))
- (if (primcall eqv? (lexical t _) (const 3))
- (const #t)
- (if (primcall eqv? (lexical t _) (const 2))
- (const #t)
- (primcall eqv? (lexical t _) (const 1)))))
- (const a)
- (const b)))
-
- (pass-if-peval
- ;; Memv with non-constant key, empty list, test context. Currently
- ;; doesn't fold entirely.
- (case foo
- (() 'a)
- (else 'b))
- (if (seq (toplevel foo) (const #f))
- (const a)
- (const b)))
-
- ;;
- ;; Below are cases where constant propagation should bail out.
- ;;
-
- (pass-if-peval
- ;; Non-constant lexical is not propagated.
- (let ((v (make-vector 6 #f)))
- (lambda (n)
- (vector-set! v n n)))
- (let (v) (_)
- ((call (toplevel make-vector) (const 6) (const #f)))
- (lambda ()
- (lambda-case
- (((n) #f #f #f () (_))
- (call (toplevel vector-set!)
- (lexical v _) (lexical n _) (lexical n _)))))))
-
- (pass-if-peval
- ;; Mutable lexical is not propagated.
- (let ((v (vector 1 2 3)))
- (lambda ()
- v))
- (let (v) (_)
- ((primcall vector (const 1) (const 2) (const 3)))
- (lambda ()
- (lambda-case
- ((() #f #f #f () ())
- (lexical v _))))))
-
- (pass-if-peval
- ;; Lexical that is not provably pure is not inlined nor propagated.
- (let* ((x (if (> p q) (frob!) (display 'chbouib)))
- (y (* x 2)))
- (+ x x y))
- (let (x) (_) ((if (primcall > (toplevel p) (toplevel q))
- (call (toplevel frob!))
- (call (toplevel display) (const chbouib))))
- (let (y) (_) ((primcall * (lexical x _) (const 2)))
- (primcall +
- (lexical x _) (lexical x _) (lexical y _)))))
-
- (pass-if-peval
- ;; Non-constant arguments not propagated to lambdas.
- ((lambda (x y z)
- (vector-set! x 0 0)
- (set-car! y 0)
- (set-cdr! z '()))
- (vector 1 2 3)
- (make-list 10)
- (list 1 2 3))
- (let (x y z) (_ _ _)
- ((primcall vector (const 1) (const 2) (const 3))
- (call (toplevel make-list) (const 10))
- (primcall list (const 1) (const 2) (const 3)))
- (seq
- (call (toplevel vector-set!)
- (lexical x _) (const 0) (const 0))
- (seq (call (toplevel set-car!)
- (lexical y _) (const 0))
- (call (toplevel set-cdr!)
- (lexical z _) (const ()))))))
-
- (pass-if-peval
- (let ((foo top-foo) (bar top-bar))
- (let* ((g (lambda (x y) (+ x y)))
- (f (lambda (g x) (g x x))))
- (+ (f g foo) (f g bar))))
- (let (foo bar) (_ _) ((toplevel top-foo) (toplevel top-bar))
- (primcall +
- (primcall + (lexical foo _) (lexical foo _))
- (primcall + (lexical bar _) (lexical bar _)))))
-
- (pass-if-peval
- ;; Fresh objects are not turned into constants, nor are constants
- ;; turned into fresh objects.
- (let* ((c '(2 3))
- (x (cons 1 c))
- (y (cons 0 x)))
- y)
- (let (x) (_) ((primcall cons (const 1) (const (2 3))))
- (primcall cons (const 0) (lexical x _))))
-
- (pass-if-peval
- ;; Bindings mutated.
- (let ((x 2))
- (set! x 3)
- x)
- (let (x) (_) ((const 2))
- (seq
- (set! (lexical x _) (const 3))
- (lexical x _))))
-
- (pass-if-peval
- ;; Bindings mutated.
- (letrec ((x 0)
- (f (lambda ()
- (set! x (+ 1 x))
- x)))
- (frob f) ; may mutate `x'
- x)
- (letrec (x) (_) ((const 0))
- (seq
- (call (toplevel frob) (lambda _ _))
- (lexical x _))))
-
- (pass-if-peval
- ;; Bindings mutated.
- (letrec ((f (lambda (x)
- (set! f (lambda (_) x))
- x)))
- (f 2))
- (letrec _ . _))
-
- (pass-if-peval
- ;; Bindings possibly mutated.
- (let ((x (make-foo)))
- (frob! x) ; may mutate `x'
- x)
- (let (x) (_) ((call (toplevel make-foo)))
- (seq
- (call (toplevel frob!) (lexical x _))
- (lexical x _))))
-
- (pass-if-peval
- ;; Inlining stops at recursive calls with dynamic arguments.
- (let loop ((x x))
- (if (< x 0) x (loop (1- x))))
- (letrec (loop) (_) ((lambda (_)
- (lambda-case
- (((x) #f #f #f () (_))
- (if _ _
- (call (lexical loop _)
- (primcall 1-
- (lexical x _))))))))
- (call (lexical loop _) (toplevel x))))
-
- (pass-if-peval
- ;; Recursion on the 2nd argument is fully evaluated.
- (let ((x (top)))
- (let loop ((x x) (y 10))
- (if (> y 0)
- (loop x (1- y))
- (foo x y))))
- (let (x) (_) ((call (toplevel top)))
- (call (toplevel foo) (lexical x _) (const 0))))
-
- (pass-if-peval
- ;; Inlining aborted when residual code contains recursive calls.
- ;;
- ;; <http://debbugs.gnu.org/9542>
- (let loop ((x x) (y 0))
- (if (> y 0)
- (loop (1- x) (1- y))
- (if (< x 0)
- x
- (loop (1+ x) (1+ y)))))
- (letrec (loop) (_) ((lambda (_)
- (lambda-case
- (((x y) #f #f #f () (_ _))
- (if (primcall >
- (lexical y _) (const 0))
- _ _)))))
- (call (lexical loop _) (toplevel x) (const 0))))
-
- (pass-if-peval
- ;; Infinite recursion: `peval' gives up and leaves it as is.
- (letrec ((f (lambda (x) (g (1- x))))
- (g (lambda (x) (h (1+ x))))
- (h (lambda (x) (f x))))
- (f 0))
- (letrec _ . _))
-
- (pass-if-peval
- ;; Infinite recursion: all the arguments to `loop' are static, but
- ;; unrolling it would lead `peval' to enter an infinite loop.
- (let loop ((x 0))
- (and (< x top)
- (loop (1+ x))))
- (letrec (loop) (_) ((lambda . _))
- (call (lexical loop _) (const 0))))
-
- (pass-if-peval
- ;; This test checks that the `start' binding is indeed residualized.
- ;; See the `referenced?' procedure in peval's `prune-bindings'.
- (let ((pos 0))
- (set! pos 1) ;; Cause references to `pos' to residualize.
- (let ((here (let ((start pos)) (lambda () start))))
- (here)))
- (let (pos) (_) ((const 0))
- (seq
- (set! (lexical pos _) (const 1))
- (let (here) (_) (_)
- (call (lexical here _))))))
-
- (pass-if-peval
- ;; FIXME: should this one residualize the binding?
- (letrec ((a a))
- 1)
- (const 1))
-
- (pass-if-peval
- ;; This is a fun one for peval to handle.
- (letrec ((a a))
- a)
- (letrec (a) (_) ((lexical a _))
- (lexical a _)))
-
- (pass-if-peval
- ;; Another interesting recursive case.
- (letrec ((a b) (b a))
- a)
- (letrec (a) (_) ((lexical a _))
- (lexical a _)))
-
- (pass-if-peval
- ;; Another pruning case, that `a' is residualized.
- (letrec ((a (lambda () (a)))
- (b (lambda () (a)))
- (c (lambda (x) x)))
- (let ((d (foo b)))
- (c d)))
-
- ;; "b c a" is the current order that we get with unordered letrec,
- ;; but it's not important to this test, so if it changes, just adapt
- ;; the test.
- (letrec (b c a) (_ _ _)
- ((lambda _
- (lambda-case
- ((() #f #f #f () ())
- (call (lexical a _)))))
- (lambda _
- (lambda-case
- (((x) #f #f #f () (_))
- (lexical x _))))
- (lambda _
- (lambda-case
- ((() #f #f #f () ())
- (call (lexical a _))))))
- (let (d)
- (_)
- ((call (toplevel foo) (lexical b _)))
- (call (lexical c _) (lexical d _)))))
-
- (pass-if-peval
- ;; In this case, we can prune the bindings. `a' ends up being copied
- ;; because it is only referenced once in the source program. Oh
- ;; well.
- (letrec* ((a (lambda (x) (top x)))
- (b (lambda () a)))
- (foo (b) (b)))
- (call (toplevel foo)
- (lambda _
- (lambda-case
- (((x) #f #f #f () (_))
- (call (toplevel top) (lexical x _)))))
- (lambda _
- (lambda-case
- (((x) #f #f #f () (_))
- (call (toplevel top) (lexical x _)))))))
-
- (pass-if-peval
- ;; Constant folding: cons
- (begin (cons 1 2) #f)
- (const #f))
-
- (pass-if-peval
- ;; Constant folding: cons
- (begin (cons (foo) 2) #f)
- (seq (call (toplevel foo)) (const #f)))
-
- (pass-if-peval
- ;; Constant folding: cons
- (if (cons 0 0) 1 2)
- (const 1))
-
- (pass-if-peval
- ;; Constant folding: car+cons
- (car (cons 1 0))
- (const 1))
-
- (pass-if-peval
- ;; Constant folding: cdr+cons
- (cdr (cons 1 0))
- (const 0))
-
- (pass-if-peval
- ;; Constant folding: car+cons, impure
- (car (cons 1 (bar)))
- (seq (call (toplevel bar)) (const 1)))
-
- (pass-if-peval
- ;; Constant folding: cdr+cons, impure
- (cdr (cons (bar) 0))
- (seq (call (toplevel bar)) (const 0)))
-
- (pass-if-peval
- ;; Constant folding: car+list
- (car (list 1 0))
- (const 1))
-
- (pass-if-peval
- ;; Constant folding: cdr+list
- (cdr (list 1 0))
- (primcall list (const 0)))
-
- (pass-if-peval
- ;; Constant folding: car+list, impure
- (car (list 1 (bar)))
- (seq (call (toplevel bar)) (const 1)))
-
- (pass-if-peval
- ;; Constant folding: cdr+list, impure
- (cdr (list (bar) 0))
- (seq (call (toplevel bar)) (primcall list (const 0))))
-
- (pass-if-peval
- resolve-primitives
- ;; Prompt is removed if tag is unreferenced
- (let ((tag (make-prompt-tag)))
- (call-with-prompt tag
- (lambda () 1)
- (lambda args args)))
- (const 1))
-
- (pass-if-peval
- resolve-primitives
- ;; Prompt is removed if tag is unreferenced, with explicit stem
- (let ((tag (make-prompt-tag "foo")))
- (call-with-prompt tag
- (lambda () 1)
- (lambda args args)))
- (const 1))
-
- (pass-if-peval
- resolve-primitives
- ;; `while' without `break' or `continue' has no prompts and gets its
- ;; condition folded. Unfortunately the outer `lp' does not yet get
- ;; elided.
- (while #t #t)
- (letrec (lp) (_)
- ((lambda _
- (lambda-case
- ((() #f #f #f () ())
- (letrec (loop) (_)
- ((lambda _
- (lambda-case
- ((() #f #f #f () ())
- (call (lexical loop _))))))
- (call (lexical loop _)))))))
- (call (lexical lp _)))))
-
-
-\f
(with-test-prefix "tree-il-fold"
(pass-if "empty tree"
"non-literal format string")))))
(pass-if "non-literal format string using gettext"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '(format #t (gettext "~A ~A!") "hello" "world")
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
+ (pass-if "non-literal format string using gettext as _"
(null? (call-with-warnings
(lambda ()
(compile '(format #t (_ "~A ~A!") "hello" "world")
#:opts %opts-w-format
#:to 'assembly)))))
+ (pass-if "non-literal format string using ngettext"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '(format #t
+ (ngettext "~a thing" "~a things" n "dom") n)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
+ (pass-if "non-literal format string using ngettext as N_"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '(format #t (N_ "~a thing" "~a things" n) n)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
+ (pass-if "non-literal format string with (define _ gettext)"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '(begin
+ (define _ gettext)
+ (define (foo)
+ (format #t (_ "~A ~A!") "hello" "world")))
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
(pass-if "wrong format string"
(let ((w (call-with-warnings
(lambda ()
(pass-if "~%, ~~, ~&, ~t, ~_, and ~\\n"
(null? (call-with-warnings
(lambda ()
- (compile '(format some-port "~&~3_~~ ~\n~12they~%")
+ (compile '((@ (ice-9 format) format) some-port
+ "~&~3_~~ ~\n~12they~%")
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "one missing argument, gettext"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format some-port (_ "foo ~A~%"))
+ (compile '(format some-port (gettext "foo ~A~%"))
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "two missing arguments"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "foo ~10,2f and bar ~S~%")
+ (compile '((@ (ice-9 format) format) #f
+ "foo ~10,2f and bar ~S~%")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(number? (string-contains (car w)
"expected 1, got 2")))))
+ (pass-if "~h"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '((@ (ice-9 format) format) #t
+ "foo ~h ~a~%" 123.4 'bar)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
+ (pass-if "~:h with locale object"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '((@ (ice-9 format) format) #t
+ "foo ~:h~%" 123.4 %global-locale)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
+ (pass-if "~:h without locale object"
+ (let ((w (call-with-warnings
+ (lambda ()
+ (compile '((@ (ice-9 format) format) #t "foo ~,2:h" 123.4)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+ (and (= (length w) 1)
+ (number? (string-contains (car w)
+ "expected 2, got 1")))))
+
(with-test-prefix "conditionals"
(pass-if "literals"
(null? (call-with-warnings
(lambda ()
- (compile '(format #f "~A ~[foo~;bar~;baz~;~] ~10,2f"
+ (compile '((@ (ice-9 format) format) #f "~A ~[foo~;bar~;baz~;~] ~10,2f"
'a 1 3.14)
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "literals with selector"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~2[foo~;bar~;baz~;~] ~A"
+ (compile '((@ (ice-9 format) format) #f "~2[foo~;bar~;baz~;~] ~A"
1 'dont-ignore-me)
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "escapes (exact count)"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~[~a~;~a~]")
+ (compile '((@ (ice-9 format) format) #f "~[~a~;~a~]")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "escapes with selector"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~1[chbouib~;~a~]")
+ (compile '((@ (ice-9 format) format) #f "~1[chbouib~;~a~]")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "escapes, range"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~[chbouib~;~a~;~2*~a~]")
+ (compile '((@ (ice-9 format) format) #f "~[chbouib~;~a~;~2*~a~]")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "@"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~@[temperature=~d~]")
+ (compile '((@ (ice-9 format) format) #f "~@[temperature=~d~]")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "nested"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~:[~[hey~;~a~;~va~]~;~3*~]")
+ (compile '((@ (ice-9 format) format) #f "~:[~[hey~;~a~;~va~]~;~3*~]")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "unterminated"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~[unterminated")
+ (compile '((@ (ice-9 format) format) #f "~[unterminated")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "unexpected ~;"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "foo~;bar")
+ (compile '((@ (ice-9 format) format) #f "foo~;bar")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "unexpected ~]"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "foo~]")
+ (compile '((@ (ice-9 format) format) #f "foo~]")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "~{...~}"
(null? (call-with-warnings
(lambda ()
- (compile '(format #f "~A ~{~S~} ~A"
+ (compile '((@ (ice-9 format) format) #f "~A ~{~S~} ~A"
'hello '("ladies" "and")
'gentlemen)
#:opts %opts-w-format
(pass-if "~{...~}, too many args"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~{~S~}" 1 2 3)
+ (compile '((@ (ice-9 format) format) #f "~{~S~}" 1 2 3)
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "~@{...~}"
(null? (call-with-warnings
(lambda ()
- (compile '(format #f "~@{~S~}" 1 2 3)
+ (compile '((@ (ice-9 format) format) #f "~@{~S~}" 1 2 3)
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "~@{...~}, too few args"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~A ~@{~S~}")
+ (compile '((@ (ice-9 format) format) #f "~A ~@{~S~}")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "unterminated ~{...~}"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~{")
+ (compile '((@ (ice-9 format) format) #f "~{")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "~(...~)"
(null? (call-with-warnings
(lambda ()
- (compile '(format #f "~:@(~A ~A~)" 'foo 'bar)
+ (compile '((@ (ice-9 format) format) #f "~:@(~A ~A~)" 'foo 'bar)
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "~v"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~v_foo")
+ (compile '((@ (ice-9 format) format) #f "~v_foo")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "~v:@y"
(null? (call-with-warnings
(lambda ()
- (compile '(format #f "~v:@y" 1 123)
+ (compile '((@ (ice-9 format) format) #f "~v:@y" 1 123)
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "~*"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~2*~a" 'a 'b)
+ (compile '((@ (ice-9 format) format) #f "~2*~a" 'a 'b)
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(pass-if "~?"
(null? (call-with-warnings
(lambda ()
- (compile '(format #f "~?" "~d ~d" '(1 2))
+ (compile '((@ (ice-9 format) format) #f "~?" "~d ~d" '(1 2))
#:opts %opts-w-format
#:to 'assembly)))))
(pass-if "complex 1"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f
+ (compile '((@ (ice-9 format) format) #f
"~4@S ~32S~@[;; ~1{~@?~}~]~@[~61t at ~a~]\n"
1 2 3 4 5 6)
#:opts %opts-w-format
(pass-if "complex 2"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f
+ (compile '((@ (ice-9 format) format) #f
"~:(~A~) Commands~:[~; [abbrev]~]:~2%"
1 2 3 4)
#:opts %opts-w-format
(pass-if "complex 3"
(let ((w (call-with-warnings
(lambda ()
- (compile '(format #f "~9@a~:[~*~3_~;~3d~] ~v:@y~%")
+ (compile '((@ (ice-9 format) format) #f "~9@a~:[~*~3_~;~3d~] ~v:@y~%")
#:opts %opts-w-format
#:to 'assembly)))))
(and (= (length w) 1)
(compile '(let ((format chbouib))
(format #t "not ~A a format string"))
#:opts %opts-w-format
- #:to 'assembly)))))))
+ #:to 'assembly)))))
+
+ (with-test-prefix "simple-format"
+
+ (pass-if "good"
+ (null? (call-with-warnings
+ (lambda ()
+ (compile '(simple-format #t "foo ~a bar ~s ~%~~" 1 2)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+
+ (pass-if "wrong number of args"
+ (let ((w (call-with-warnings
+ (lambda ()
+ (compile '(simple-format #t "foo ~a ~s~%" 'one-missing)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+ (and (= (length w) 1)
+ (number? (string-contains (car w) "wrong number")))))
+
+ (pass-if "unsupported"
+ (let ((w (call-with-warnings
+ (lambda ()
+ (compile '(simple-format #t "foo ~x~%" 16)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+ (and (= (length w) 1)
+ (number? (string-contains (car w) "unsupported format option")))))
+
+ (pass-if "unsupported, gettext"
+ (let ((w (call-with-warnings
+ (lambda ()
+ (compile '(simple-format #t (gettext "foo ~2f~%") 3.14)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+ (and (= (length w) 1)
+ (number? (string-contains (car w) "unsupported format option")))))
+
+ (pass-if "unsupported, ngettext"
+ (let ((w (call-with-warnings
+ (lambda ()
+ (compile '(simple-format #t (ngettext "s ~x" "p ~x" x) x)
+ #:opts %opts-w-format
+ #:to 'assembly)))))
+ (and (= (length w) 1)
+ (number? (string-contains (car w) "unsupported format option"))))))))
HCoop / bpt / guile.git / blobdiff