mirror/guile
mirror/guile
1
Fork 0
mirror of https://git.savannah.gnu.org/git/guile.git synced 2025-05-29 16:30:19 +02:00
Code Activity

peval: Improve alpha-renaming test.

Browse source 
* test-suite/tests/tree-il.test ("partial evaluation")["inlined lambdas
  are alpha-renamed"]: Rewrite.
This commit is contained in:
Ludovic Courtès 2011-09-18 22:34:40 +02:00
parent 1e2b4920ca
commit 239b4b2ac6
1 changed files with 45 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

57
test-suite/tests/tree-il.test
View file

@ -873,18 +873,51 @@
(lexical x2 _) (const 1)))))))))) (lexical x2 _) (const 1))))))))))
(pass-if "inlined lambdas are alpha-renamed" (pass-if "inlined lambdas are alpha-renamed"
;; This one should compile without errors; see above for an ;; In this example, the two anonymous lambdas are inlined more than
;; explanation. ;; once; thus, they should use different gensyms for their
(and (compile ;; arguments, because the variable allocation process assumes
'(letrec ((fold (lambda (f x3 b null? car cdr) ;; globally unique gensyms.
(if (null? x3) ;;
b ;; Bug reported at
(f (car x3) ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00019.html> and
(fold f (cdr x3) b null? car cdr)))))) ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00029.html>.
(fold * x 1 zero? (lambda (x1) x1) (lambda (x2) (- x2 1)))) (pmatch (unparse-tree-il
#:opts '(#:partial-eval? #t) (peval (compile
#:to 'glil) '(let ((f (lambda (g x)
#t)) (+ (g x) (g (+ x 1))))))
(f (lambda (x0) (* x0 x0)) y))
#:to 'tree-il)))
((let (f) (_)
((lambda ((name . f))
(lambda-case
(((g x) #f #f #f () (_ _))
(apply (primitive +)
(apply (lexical g _) (lexical x _))
(apply (lexical g _)
(apply (primitive +)
(lexical x _) (const 1))))))))
(apply (primitive +)
(apply (lambda ()
(lambda-case
(((x0) #f #f #f () (,gensym1))
(apply (primitive *)
(lexical x0 ,ref1a)
(lexical x0 ,ref1b)))))
(toplevel y))
(apply (lambda ()
(lambda-case
(((x0) #f #f #f () (,gensym2))
(apply (primitive *)
(lexical x0 ,ref2a)
(lexical x0 ,ref2b)))))
(apply (primitive +)
(toplevel y) (const 1)))))
(and (eq? gensym1 ref1a)
(eq? gensym1 ref1b)
(eq? gensym2 ref2a)
(eq? gensym2 ref2b)
(not (eq? gensym1 gensym2))))
(_ #f)))
(pass-if-peval (pass-if-peval
;; Higher order, mutually recursive procedures. ;; Higher order, mutually recursive procedures.