1 ;;;; tree-il.test --- test suite for compiling tree-il -*- scheme -*-
2 ;;;; Andy Wingo <wingo@pobox.com> --- May 2009
4 ;;;; Copyright (C) 2009, 2010, 2011 Free Software Foundation, Inc.
6 ;;;; This library is free software; you can redistribute it and/or
7 ;;;; modify it under the terms of the GNU Lesser General Public
8 ;;;; License as published by the Free Software Foundation; either
9 ;;;; version 3 of the License, or (at your option) any later version.
11 ;;;; This library is distributed in the hope that it will be useful,
12 ;;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
13 ;;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 ;;;; Lesser General Public License for more details.
16 ;;;; You should have received a copy of the GNU Lesser General Public
17 ;;;; License along with this library; if not, write to the Free Software
18 ;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 (define-module (test-suite tree-il)
21 #:use-module (test-suite lib)
22 #:use-module (system base compile)
23 #:use-module (system base pmatch)
24 #:use-module (system base message)
25 #:use-module (language tree-il)
26 #:use-module (language tree-il primitives)
27 #:use-module (language glil)
28 #:use-module (srfi srfi-13))
30 ;; Of course, the GLIL that is emitted depends on the source info of the
31 ;; input. Here we're not concerned about that, so we strip source
32 ;; information from the incoming tree-il.
34 (define (strip-source x)
35 (post-order! (lambda (x) (set! (tree-il-src x) #f))
38 (define-syntax assert-tree-il->glil
39 (syntax-rules (with-partial-evaluation without-partial-evaluation
41 ((_ with-partial-evaluation in pat test ...)
42 (assert-tree-il->glil with-options (#:partial-eval? #t)
44 ((_ without-partial-evaluation in pat test ...)
45 (assert-tree-il->glil with-options (#:partial-eval? #f)
47 ((_ with-options opts in pat test ...)
50 (let ((glil (unparse-glil
51 (compile (strip-source (parse-tree-il exp))
52 #:from 'tree-il #:to 'glil
55 (pat (guard test ...) #t)
58 (assert-tree-il->glil with-partial-evaluation
61 (define-syntax pass-if-tree-il->scheme
64 (assert-scheme->tree-il->scheme in pat #t))
67 (pmatch (tree-il->scheme
68 (compile 'in #:from 'scheme #:to 'tree-il))
69 (pat (guard guard-exp) #t)
73 ;; The partial evaluator.
74 (@@ (language tree-il optimize) peval))
76 (define-syntax pass-if-peval
77 (syntax-rules (resolve-primitives)
80 (compile 'in #:from 'scheme #:to 'tree-il)))
81 ((_ resolve-primitives in pat)
85 (compile 'in #:from 'scheme #:to 'tree-il)
89 (let ((evaled (unparse-tree-il (peval code))))
92 (_ (pk 'peval-mismatch)
93 ((@ (ice-9 pretty-print) pretty-print)
96 ((@ (ice-9 pretty-print) pretty-print)
99 ((@ (ice-9 pretty-print) pretty-print)
105 (with-test-prefix "tree-il->scheme"
106 (pass-if-tree-il->scheme
107 (case-lambda ((a) a) ((b c) (list b c)))
108 (case-lambda ((,a) ,a1) ((,b ,c) (list ,b1 ,c1)))
109 (and (eq? a a1) (eq? b b1) (eq? c c1))))
111 (with-test-prefix "void"
112 (assert-tree-il->glil
114 (program () (std-prelude 0 0 #f) (label _) (void) (call return 1)))
115 (assert-tree-il->glil
116 (begin (void) (const 1))
117 (program () (std-prelude 0 0 #f) (label _) (const 1) (call return 1)))
118 (assert-tree-il->glil
119 (apply (primitive +) (void) (const 1))
120 (program () (std-prelude 0 0 #f) (label _) (void) (call add1 1) (call return 1))))
122 (with-test-prefix "application"
123 (assert-tree-il->glil
124 (apply (toplevel foo) (const 1))
125 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (const 1) (call tail-call 1)))
126 (assert-tree-il->glil
127 (begin (apply (toplevel foo) (const 1)) (void))
128 (program () (std-prelude 0 0 #f) (label _) (call new-frame 0) (toplevel ref foo) (const 1) (mv-call 1 ,l1)
129 (call drop 1) (branch br ,l2)
130 (label ,l3) (mv-bind 0 #f)
132 (void) (call return 1))
133 (and (eq? l1 l3) (eq? l2 l4)))
134 (assert-tree-il->glil
135 (apply (toplevel foo) (apply (toplevel bar)))
136 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (call new-frame 0) (toplevel ref bar) (call call 0)
137 (call tail-call 1))))
139 (with-test-prefix "conditional"
140 (assert-tree-il->glil
141 (if (toplevel foo) (const 1) (const 2))
142 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (branch br-if-not ,l1)
143 (const 1) (call return 1)
144 (label ,l2) (const 2) (call return 1))
147 (assert-tree-il->glil without-partial-evaluation
148 (begin (if (toplevel foo) (const 1) (const 2)) (const #f))
149 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (branch br-if-not ,l1) (branch br ,l2)
150 (label ,l3) (label ,l4) (const #f) (call return 1))
151 (eq? l1 l3) (eq? l2 l4))
153 (assert-tree-il->glil
154 (apply (primitive null?) (if (toplevel foo) (const 1) (const 2)))
155 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (branch br-if-not ,l1)
156 (const 1) (branch br ,l2)
157 (label ,l3) (const 2) (label ,l4)
158 (call null? 1) (call return 1))
159 (eq? l1 l3) (eq? l2 l4)))
161 (with-test-prefix "primitive-ref"
162 (assert-tree-il->glil
164 (program () (std-prelude 0 0 #f) (label _) (toplevel ref +) (call return 1)))
166 (assert-tree-il->glil
167 (begin (primitive +) (const #f))
168 (program () (std-prelude 0 0 #f) (label _) (const #f) (call return 1)))
170 (assert-tree-il->glil
171 (apply (primitive null?) (primitive +))
172 (program () (std-prelude 0 0 #f) (label _) (toplevel ref +) (call null? 1)
175 (with-test-prefix "lexical refs"
176 (assert-tree-il->glil without-partial-evaluation
177 (let (x) (y) ((const 1)) (lexical x y))
178 (program () (std-prelude 0 1 #f) (label _)
179 (const 1) (bind (x #f 0)) (lexical #t #f set 0)
180 (lexical #t #f ref 0) (call return 1)
183 (assert-tree-il->glil without-partial-evaluation
184 (let (x) (y) ((const 1)) (begin (lexical x y) (const #f)))
185 (program () (std-prelude 0 1 #f) (label _)
186 (const 1) (bind (x #f 0)) (lexical #t #f set 0)
187 (const #f) (call return 1)
190 (assert-tree-il->glil without-partial-evaluation
191 (let (x) (y) ((const 1)) (apply (primitive null?) (lexical x y)))
192 (program () (std-prelude 0 1 #f) (label _)
193 (const 1) (bind (x #f 0)) (lexical #t #f set 0)
194 (lexical #t #f ref 0) (call null? 1) (call return 1)
197 (with-test-prefix "lexical sets"
198 (assert-tree-il->glil
199 ;; unreferenced sets may be optimized away -- make sure they are ref'd
200 (let (x) (y) ((const 1))
201 (set! (lexical x y) (apply (primitive 1+) (lexical x y))))
202 (program () (std-prelude 0 1 #f) (label _)
203 (const 1) (bind (x #t 0)) (lexical #t #t box 0)
204 (lexical #t #t ref 0) (call add1 1) (lexical #t #t set 0)
205 (void) (call return 1)
208 (assert-tree-il->glil
209 (let (x) (y) ((const 1))
210 (begin (set! (lexical x y) (apply (primitive 1+) (lexical x y)))
212 (program () (std-prelude 0 1 #f) (label _)
213 (const 1) (bind (x #t 0)) (lexical #t #t box 0)
214 (lexical #t #t ref 0) (call add1 1) (lexical #t #t set 0)
215 (lexical #t #t ref 0) (call return 1)
218 (assert-tree-il->glil
219 (let (x) (y) ((const 1))
220 (apply (primitive null?)
221 (set! (lexical x y) (apply (primitive 1+) (lexical x y)))))
222 (program () (std-prelude 0 1 #f) (label _)
223 (const 1) (bind (x #t 0)) (lexical #t #t box 0)
224 (lexical #t #t ref 0) (call add1 1) (lexical #t #t set 0) (void)
225 (call null? 1) (call return 1)
228 (with-test-prefix "module refs"
229 (assert-tree-il->glil
231 (program () (std-prelude 0 0 #f) (label _)
232 (module public ref (foo) bar)
235 (assert-tree-il->glil
236 (begin (@ (foo) bar) (const #f))
237 (program () (std-prelude 0 0 #f) (label _)
238 (module public ref (foo) bar) (call drop 1)
239 (const #f) (call return 1)))
241 (assert-tree-il->glil
242 (apply (primitive null?) (@ (foo) bar))
243 (program () (std-prelude 0 0 #f) (label _)
244 (module public ref (foo) bar)
245 (call null? 1) (call return 1)))
247 (assert-tree-il->glil
249 (program () (std-prelude 0 0 #f) (label _)
250 (module private ref (foo) bar)
253 (assert-tree-il->glil
254 (begin (@@ (foo) bar) (const #f))
255 (program () (std-prelude 0 0 #f) (label _)
256 (module private ref (foo) bar) (call drop 1)
257 (const #f) (call return 1)))
259 (assert-tree-il->glil
260 (apply (primitive null?) (@@ (foo) bar))
261 (program () (std-prelude 0 0 #f) (label _)
262 (module private ref (foo) bar)
263 (call null? 1) (call return 1))))
265 (with-test-prefix "module sets"
266 (assert-tree-il->glil
267 (set! (@ (foo) bar) (const 2))
268 (program () (std-prelude 0 0 #f) (label _)
269 (const 2) (module public set (foo) bar)
270 (void) (call return 1)))
272 (assert-tree-il->glil
273 (begin (set! (@ (foo) bar) (const 2)) (const #f))
274 (program () (std-prelude 0 0 #f) (label _)
275 (const 2) (module public set (foo) bar)
276 (const #f) (call return 1)))
278 (assert-tree-il->glil
279 (apply (primitive null?) (set! (@ (foo) bar) (const 2)))
280 (program () (std-prelude 0 0 #f) (label _)
281 (const 2) (module public set (foo) bar)
282 (void) (call null? 1) (call return 1)))
284 (assert-tree-il->glil
285 (set! (@@ (foo) bar) (const 2))
286 (program () (std-prelude 0 0 #f) (label _)
287 (const 2) (module private set (foo) bar)
288 (void) (call return 1)))
290 (assert-tree-il->glil
291 (begin (set! (@@ (foo) bar) (const 2)) (const #f))
292 (program () (std-prelude 0 0 #f) (label _)
293 (const 2) (module private set (foo) bar)
294 (const #f) (call return 1)))
296 (assert-tree-il->glil
297 (apply (primitive null?) (set! (@@ (foo) bar) (const 2)))
298 (program () (std-prelude 0 0 #f) (label _)
299 (const 2) (module private set (foo) bar)
300 (void) (call null? 1) (call return 1))))
302 (with-test-prefix "toplevel refs"
303 (assert-tree-il->glil
305 (program () (std-prelude 0 0 #f) (label _)
309 (assert-tree-il->glil without-partial-evaluation
310 (begin (toplevel bar) (const #f))
311 (program () (std-prelude 0 0 #f) (label _)
312 (toplevel ref bar) (call drop 1)
313 (const #f) (call return 1)))
315 (assert-tree-il->glil
316 (apply (primitive null?) (toplevel bar))
317 (program () (std-prelude 0 0 #f) (label _)
319 (call null? 1) (call return 1))))
321 (with-test-prefix "toplevel sets"
322 (assert-tree-il->glil
323 (set! (toplevel bar) (const 2))
324 (program () (std-prelude 0 0 #f) (label _)
325 (const 2) (toplevel set bar)
326 (void) (call return 1)))
328 (assert-tree-il->glil
329 (begin (set! (toplevel bar) (const 2)) (const #f))
330 (program () (std-prelude 0 0 #f) (label _)
331 (const 2) (toplevel set bar)
332 (const #f) (call return 1)))
334 (assert-tree-il->glil
335 (apply (primitive null?) (set! (toplevel bar) (const 2)))
336 (program () (std-prelude 0 0 #f) (label _)
337 (const 2) (toplevel set bar)
338 (void) (call null? 1) (call return 1))))
340 (with-test-prefix "toplevel defines"
341 (assert-tree-il->glil
342 (define bar (const 2))
343 (program () (std-prelude 0 0 #f) (label _)
344 (const 2) (toplevel define bar)
345 (void) (call return 1)))
347 (assert-tree-il->glil
348 (begin (define bar (const 2)) (const #f))
349 (program () (std-prelude 0 0 #f) (label _)
350 (const 2) (toplevel define bar)
351 (const #f) (call return 1)))
353 (assert-tree-il->glil
354 (apply (primitive null?) (define bar (const 2)))
355 (program () (std-prelude 0 0 #f) (label _)
356 (const 2) (toplevel define bar)
357 (void) (call null? 1) (call return 1))))
359 (with-test-prefix "constants"
360 (assert-tree-il->glil
362 (program () (std-prelude 0 0 #f) (label _)
363 (const 2) (call return 1)))
365 (assert-tree-il->glil
366 (begin (const 2) (const #f))
367 (program () (std-prelude 0 0 #f) (label _)
368 (const #f) (call return 1)))
370 (assert-tree-il->glil
371 ;; This gets simplified by `peval'.
372 (apply (primitive null?) (const 2))
373 (program () (std-prelude 0 0 #f) (label _)
374 (const #f) (call return 1))))
376 (with-test-prefix "letrec"
377 ;; simple bindings -> let
378 (assert-tree-il->glil without-partial-evaluation
379 (letrec (x y) (x1 y1) ((const 10) (const 20))
380 (apply (toplevel foo) (lexical x x1) (lexical y y1)))
381 (program () (std-prelude 0 2 #f) (label _)
382 (const 10) (const 20)
383 (bind (x #f 0) (y #f 1))
384 (lexical #t #f set 1) (lexical #t #f set 0)
386 (lexical #t #f ref 0) (lexical #t #f ref 1)
390 ;; complex bindings -> box and set! within let
391 (assert-tree-il->glil without-partial-evaluation
392 (letrec (x y) (x1 y1) ((apply (toplevel foo)) (apply (toplevel bar)))
393 (apply (primitive +) (lexical x x1) (lexical y y1)))
394 (program () (std-prelude 0 4 #f) (label _)
395 (void) (void) ;; what are these?
396 (bind (x #t 0) (y #t 1))
397 (lexical #t #t box 1) (lexical #t #t box 0)
398 (call new-frame 0) (toplevel ref foo) (call call 0)
399 (call new-frame 0) (toplevel ref bar) (call call 0)
400 (bind (x #f 2) (y #f 3)) (lexical #t #f set 3) (lexical #t #f set 2)
401 (lexical #t #f ref 2) (lexical #t #t set 0)
402 (lexical #t #f ref 3) (lexical #t #t set 1) (unbind)
403 (lexical #t #t ref 0) (lexical #t #t ref 1)
404 (call add 2) (call return 1) (unbind)))
406 ;; complex bindings in letrec* -> box and set! in order
407 (assert-tree-il->glil without-partial-evaluation
408 (letrec* (x y) (x1 y1) ((apply (toplevel foo)) (apply (toplevel bar)))
409 (apply (primitive +) (lexical x x1) (lexical y y1)))
410 (program () (std-prelude 0 2 #f) (label _)
411 (void) (void) ;; what are these?
412 (bind (x #t 0) (y #t 1))
413 (lexical #t #t box 1) (lexical #t #t box 0)
414 (call new-frame 0) (toplevel ref foo) (call call 0)
415 (lexical #t #t set 0)
416 (call new-frame 0) (toplevel ref bar) (call call 0)
417 (lexical #t #t set 1)
418 (lexical #t #t ref 0)
419 (lexical #t #t ref 1)
420 (call add 2) (call return 1) (unbind)))
422 ;; simple bindings in letrec* -> equivalent to letrec
423 (assert-tree-il->glil without-partial-evaluation
424 (letrec* (x y) (xx yy) ((const 1) (const 2))
426 (program () (std-prelude 0 1 #f) (label _)
428 (bind (y #f 0)) ;; X is removed, and Y is unboxed
429 (lexical #t #f set 0)
430 (lexical #t #f ref 0)
431 (call return 1) (unbind))))
433 (with-test-prefix "lambda"
434 (assert-tree-il->glil
436 (lambda-case (((x) #f #f #f () (y)) (const 2)) #f))
437 (program () (std-prelude 0 0 #f) (label _)
438 (program () (std-prelude 1 1 #f)
439 (bind (x #f 0)) (label _)
440 (const 2) (call return 1) (unbind))
443 (assert-tree-il->glil
445 (lambda-case (((x y) #f #f #f () (x1 y1))
448 (program () (std-prelude 0 0 #f) (label _)
449 (program () (std-prelude 2 2 #f)
450 (bind (x #f 0) (y #f 1)) (label _)
451 (const 2) (call return 1)
455 (assert-tree-il->glil
457 (lambda-case ((() #f x #f () (y)) (const 2))
459 (program () (std-prelude 0 0 #f) (label _)
460 (program () (opt-prelude 0 0 0 1 #f)
461 (bind (x #f 0)) (label _)
462 (const 2) (call return 1)
466 (assert-tree-il->glil
468 (lambda-case (((x) #f x1 #f () (y y1)) (const 2))
470 (program () (std-prelude 0 0 #f) (label _)
471 (program () (opt-prelude 1 0 1 2 #f)
472 (bind (x #f 0) (x1 #f 1)) (label _)
473 (const 2) (call return 1)
477 (assert-tree-il->glil
479 (lambda-case (((x) #f x1 #f () (y y1)) (lexical x y))
481 (program () (std-prelude 0 0 #f) (label _)
482 (program () (opt-prelude 1 0 1 2 #f)
483 (bind (x #f 0) (x1 #f 1)) (label _)
484 (lexical #t #f ref 0) (call return 1)
488 (assert-tree-il->glil
490 (lambda-case (((x) #f x1 #f () (y y1)) (lexical x1 y1))
492 (program () (std-prelude 0 0 #f) (label _)
493 (program () (opt-prelude 1 0 1 2 #f)
494 (bind (x #f 0) (x1 #f 1)) (label _)
495 (lexical #t #f ref 1) (call return 1)
499 (assert-tree-il->glil
501 (lambda-case (((x) #f #f #f () (x1))
503 (lambda-case (((y) #f #f #f () (y1))
507 (program () (std-prelude 0 0 #f) (label _)
508 (program () (std-prelude 1 1 #f)
509 (bind (x #f 0)) (label _)
510 (program () (std-prelude 1 1 #f)
511 (bind (y #f 0)) (label _)
512 (lexical #f #f ref 0) (call return 1)
514 (lexical #t #f ref 0)
515 (call make-closure 1)
520 (with-test-prefix "sequence"
521 (assert-tree-il->glil
522 (begin (begin (const 2) (const #f)) (const #t))
523 (program () (std-prelude 0 0 #f) (label _)
524 (const #t) (call return 1)))
526 (assert-tree-il->glil
527 ;; This gets simplified by `peval'.
528 (apply (primitive null?) (begin (const #f) (const 2)))
529 (program () (std-prelude 0 0 #f) (label _)
530 (const #f) (call return 1))))
532 (with-test-prefix "values"
533 (assert-tree-il->glil
534 (apply (primitive values)
535 (apply (primitive values) (const 1) (const 2)))
536 (program () (std-prelude 0 0 #f) (label _)
537 (const 1) (call return 1)))
539 (assert-tree-il->glil
540 (apply (primitive values)
541 (apply (primitive values) (const 1) (const 2))
543 (program () (std-prelude 0 0 #f) (label _)
544 (const 1) (const 3) (call return/values 2)))
546 (assert-tree-il->glil
548 (apply (primitive values) (const 1) (const 2)))
549 (program () (std-prelude 0 0 #f) (label _)
550 (const 1) (call return 1))))
552 ;; FIXME: binding info for or-hacked locals might bork the disassembler,
553 ;; and could be tightened in any case
554 (with-test-prefix "the or hack"
555 (assert-tree-il->glil without-partial-evaluation
556 (let (x) (y) ((const 1))
559 (let (a) (b) ((const 2))
561 (program () (std-prelude 0 1 #f) (label _)
562 (const 1) (bind (x #f 0)) (lexical #t #f set 0)
563 (lexical #t #f ref 0) (branch br-if-not ,l1)
564 (lexical #t #f ref 0) (call return 1)
566 (const 2) (bind (a #f 0)) (lexical #t #f set 0)
567 (lexical #t #f ref 0) (call return 1)
572 ;; second bound var is unreferenced
573 (assert-tree-il->glil without-partial-evaluation
574 (let (x) (y) ((const 1))
577 (let (a) (b) ((const 2))
579 (program () (std-prelude 0 1 #f) (label _)
580 (const 1) (bind (x #f 0)) (lexical #t #f set 0)
581 (lexical #t #f ref 0) (branch br-if-not ,l1)
582 (lexical #t #f ref 0) (call return 1)
584 (lexical #t #f ref 0) (call return 1)
588 (with-test-prefix "apply"
589 (assert-tree-il->glil
590 (apply (primitive @apply) (toplevel foo) (toplevel bar))
591 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (toplevel ref bar) (call tail-apply 2)))
592 (assert-tree-il->glil
593 (begin (apply (primitive @apply) (toplevel foo) (toplevel bar)) (void))
594 (program () (std-prelude 0 0 #f) (label _)
595 (call new-frame 0) (toplevel ref apply) (toplevel ref foo) (toplevel ref bar) (mv-call 2 ,l1)
596 (call drop 1) (branch br ,l2) (label ,l3) (mv-bind 0 #f)
598 (void) (call return 1))
599 (and (eq? l1 l3) (eq? l2 l4)))
600 (assert-tree-il->glil
601 (apply (toplevel foo) (apply (toplevel @apply) (toplevel bar) (toplevel baz)))
602 (program () (std-prelude 0 0 #f) (label _)
604 (call new-frame 0) (toplevel ref bar) (toplevel ref baz) (call apply 2)
605 (call tail-call 1))))
607 (with-test-prefix "call/cc"
608 (assert-tree-il->glil
609 (apply (primitive @call-with-current-continuation) (toplevel foo))
610 (program () (std-prelude 0 0 #f) (label _) (toplevel ref foo) (call tail-call/cc 1)))
611 (assert-tree-il->glil
612 (begin (apply (primitive @call-with-current-continuation) (toplevel foo)) (void))
613 (program () (std-prelude 0 0 #f) (label _)
614 (call new-frame 0) (toplevel ref call-with-current-continuation) (toplevel ref foo) (mv-call 1 ,l1)
615 (call drop 1) (branch br ,l2) (label ,l3) (mv-bind 0 #f)
617 (void) (call return 1))
618 (and (eq? l1 l3) (eq? l2 l4)))
619 (assert-tree-il->glil
620 (apply (toplevel foo)
621 (apply (toplevel @call-with-current-continuation) (toplevel bar)))
622 (program () (std-prelude 0 0 #f) (label _)
624 (toplevel ref bar) (call call/cc 1)
625 (call tail-call 1))))
628 (with-test-prefix "partial evaluation"
631 ;; First order, primitive.
632 (let ((x 1) (y 2)) (+ x y))
636 ;; First order, thunk.
638 (let ((f (lambda () (+ x y))))
642 (pass-if-peval resolve-primitives
643 ;; First order, let-values (requires primitive expansion for
644 ;; `call-with-values'.)
647 (lambda () (if (zero? x) (values 1 2) (values 3 4)))
653 ;; First order, coalesced, mutability preserved.
654 (cons 0 (cons 1 (cons 2 (list 3 4 5))))
655 (apply (primitive list)
656 (const 0) (const 1) (const 2) (const 3) (const 4) (const 5)))
659 ;; First order, coalesced, mutability preserved.
660 (cons 0 (cons 1 (cons 2 (list 3 4 5))))
661 ;; This must not be a constant.
662 (apply (primitive list)
663 (const 0) (const 1) (const 2) (const 3) (const 4) (const 5)))
666 ;; First order, coalesced, immutability preserved.
667 (cons 0 (cons 1 (cons 2 '(3 4 5))))
668 (apply (primitive cons) (const 0)
669 (apply (primitive cons) (const 1)
670 (apply (primitive cons) (const 2)
673 ;; These two tests doesn't work any more because we changed the way we
674 ;; deal with constants -- now the algorithm will see a construction as
675 ;; being bound to the lexical, so it won't propagate it. It can't
676 ;; even propagate it in the case that it is only referenced once,
679 ;; (let ((x (cons 1 2))) (lambda () x))
681 ;; is not the same as
683 ;; (lambda () (cons 1 2))
685 ;; Perhaps if we determined that not only was it only referenced once,
686 ;; it was not closed over by a lambda, then we could propagate it, and
687 ;; re-enable these two tests.
691 ;; First order, mutability preserved.
692 (let loop ((i 3) (r '()))
695 (loop (1- i) (cons (cons i i) r))))
696 (apply (primitive list)
697 (apply (primitive cons) (const 1) (const 1))
698 (apply (primitive cons) (const 2) (const 2))
699 (apply (primitive cons) (const 3) (const 3))))
704 ;; First order, evaluated.
709 (loop (1- i) (cons i r))))
712 ;; Instead here are tests for what happens for the above cases: they
713 ;; unroll but they don't fold.
715 (let loop ((i 3) (r '()))
718 (loop (1- i) (cons (cons i i) r))))
719 (letrec (loop) (_) (_)
721 ((apply (primitive list)
722 (apply (primitive cons) (const 3) (const 3))))
724 ((apply (primitive cons)
725 (apply (primitive cons) (const 2) (const 2))
727 (apply (primitive cons)
728 (apply (primitive cons) (const 1) (const 1))
737 (loop (1- i) (cons i r))))
738 (letrec (loop) (_) (_)
740 ((apply (primitive list) (const 4)))
742 ((apply (primitive cons)
746 ((apply (primitive cons)
750 ((apply (primitive cons)
753 (apply (primitive car)
758 (let loop ((l '(1 2 3 4)) (sum 0))
761 (loop (cdr l) (+ sum (car l)))))
765 ;; Mutability preserved.
766 ((lambda (x y z) (list x y z)) 1 2 3)
767 (apply (primitive list) (const 1) (const 2) (const 3)))
770 ;; Don't propagate effect-free expressions that operate on mutable
776 (let (x) (_) ((apply (primitive list) (const 1)))
777 (let (y) (_) ((apply (primitive car) (lexical x _)))
779 (apply (toplevel set-car!) (lexical x _) (const 0))
783 ;; Don't propagate effect-free expressions that operate on objects we
788 (let (y) (_) ((apply (primitive car) (toplevel x)))
790 (apply (toplevel set-car!) (toplevel x) (const 0))
794 ;; Infinite recursion
795 ((lambda (x) (x x)) (lambda (x) (x x)))
799 (apply (lexical x _) (lexical x _)))))
803 (apply (lexical x _) (lexical x _)))))))
806 ;; First order, aliased primitive.
807 (let* ((x *) (y (x 1 2))) y)
811 ;; First order, shadowed primitive.
813 (define (+ x y) (pk x y))
819 (((x y) #f #f #f () (_ _))
820 (apply (toplevel pk) (lexical x _) (lexical y _))))))
821 (apply (toplevel +) (const 1) (const 2))))
824 ;; First-order, effects preserved.
829 (apply (toplevel do-something!))
833 ;; First order, residual bindings removed.
836 (apply (primitive *) (const 5) (toplevel z)))
839 ;; First order, with lambda.
841 (define (bar z) (* z z))
846 (((x) #f #f #f () (_))
847 (apply (primitive +) (lexical x _) (const 9)))))))
850 ;; First order, with lambda inlined & specialized twice.
851 (let ((f (lambda (x y)
860 (apply (primitive +) ; (f 2 3)
865 (let (x) (_) ((toplevel something)) ; (f something 2)
866 ;; `something' is not const, so preserve order of
867 ;; effects with a lexical binding.
875 ;; First order, with lambda inlined & specialized 3 times.
876 (let ((f (lambda (x y) (if (> x 0) y x))))
883 (const -1) ; (f -1 0)
885 (begin (toplevel y) (const -1)) ; (f -1 y)
886 (toplevel y) ; (f 2 y)
887 (let (x y) (_ _) ((toplevel z) (toplevel y)) ; (f z y)
888 (if (apply (primitive >) (lexical x _) (const 0))
893 ;; First order, conditional.
901 (((x) #f #f #f () (_))
902 (apply (toplevel display) (lexical x _))))))
905 ;; First order, recursive procedure.
906 (letrec ((fibo (lambda (n)
915 ;; Don't propagate toplevel references, as intervening expressions
916 ;; could alter their bindings.
920 (let (x) (_) ((toplevel top))
922 (apply (toplevel foo))
928 (f (* (car x) (cadr x))))
935 ;; Higher order with optional argument (default value).
936 ((lambda* (f x #:optional (y 0))
937 (+ y (f (* (car x) (cadr x)))))
944 ;; Higher order with optional argument (caller-supplied value).
945 ((lambda* (f x #:optional (y 0))
946 (+ y (f (* (car x) (cadr x)))))
954 ;; Higher order with optional argument (side-effecting default
956 ((lambda* (f x #:optional (y (foo)))
957 (+ y (f (* (car x) (cadr x)))))
961 (let (y) (_) ((apply (toplevel foo)))
962 (apply (primitive +) (lexical y _) (const 7))))
965 ;; Higher order with optional argument (caller-supplied value).
966 ((lambda* (f x #:optional (y (foo)))
967 (+ y (f (* (car x) (cadr x)))))
976 ((lambda (f) (f x)) (lambda (x) x))
981 ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00019.html>.
982 (let ((fold (lambda (f g) (f (g top)))))
983 (fold 1+ (lambda (x) x)))
984 (apply (primitive 1+) (toplevel top)))
987 ;; Procedure not inlined when residual code contains recursive calls.
988 ;; <http://debbugs.gnu.org/9542>
989 (letrec ((fold (lambda (f x3 b null? car cdr)
992 (f (car x3) (fold f (cdr x3) b null? car cdr))))))
993 (fold * x 1 zero? (lambda (x1) x1) (lambda (x2) (- x2 1))))
994 (letrec (fold) (_) (_)
995 (apply (lexical fold _)
1002 (((x1) #f #f #f () (_))
1006 (((x2) #f #f #f () (_))
1007 (apply (primitive -) (lexical x2 _) (const 1))))))))
1009 (pass-if "inlined lambdas are alpha-renamed"
1010 ;; In this example, `make-adder' is inlined more than once; thus,
1011 ;; they should use different gensyms for their arguments, because
1012 ;; the various optimization passes assume uniquely-named variables.
1015 ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00019.html> and
1016 ;; <https://lists.gnu.org/archive/html/bug-guile/2011-09/msg00029.html>.
1017 (pmatch (unparse-tree-il
1020 (lambda (x) (lambda (y) (+ x y)))))
1021 (cons (make-adder 1) (make-adder 2)))
1023 ((apply (primitive cons)
1026 (((y) #f #f #f () (,gensym1))
1027 (apply (primitive +)
1029 (lexical y ,ref1)))))
1032 (((y) #f #f #f () (,gensym2))
1033 (apply (primitive +)
1035 (lexical y ,ref2))))))
1036 (and (eq? gensym1 ref1)
1038 (not (eq? gensym1 gensym2))))
1042 ;; Higher order, mutually recursive procedures.
1043 (letrec ((even? (lambda (x)
1047 (not (even? (- x 1))))))
1048 (and (even? 4) (odd? 7)))
1052 ;; Below are cases where constant propagation should bail out.
1056 ;; Non-constant lexical is not propagated.
1057 (let ((v (make-vector 6 #f)))
1059 (vector-set! v n n)))
1061 ((apply (toplevel make-vector) (const 6) (const #f)))
1064 (((n) #f #f #f () (_))
1065 (apply (toplevel vector-set!)
1066 (lexical v _) (lexical n _) (lexical n _)))))))
1069 ;; Mutable lexical is not propagated.
1070 (let ((v (vector 1 2 3)))
1074 ((apply (primitive vector) (const 1) (const 2) (const 3)))
1077 ((() #f #f #f () ())
1081 ;; Lexical that is not provably pure is not inlined nor propagated.
1082 (let* ((x (if (> p q) (frob!) (display 'chbouib)))
1085 (let (x) (_) ((if (apply (primitive >) (toplevel p) (toplevel q))
1086 (apply (toplevel frob!))
1087 (apply (toplevel display) (const chbouib))))
1088 (let (y) (_) ((apply (primitive *) (lexical x _) (const 2)))
1089 (apply (primitive +)
1090 (lexical x _) (lexical x _) (lexical y _)))))
1093 ;; Non-constant arguments not propagated to lambdas.
1101 (let (x y z) (_ _ _)
1102 ((apply (primitive vector) (const 1) (const 2) (const 3))
1103 (apply (toplevel make-list) (const 10))
1104 (apply (primitive list) (const 1) (const 2) (const 3)))
1106 (apply (toplevel vector-set!)
1107 (lexical x _) (const 0) (const 0))
1108 (apply (toplevel set-car!)
1109 (lexical y _) (const 0))
1110 (apply (toplevel set-cdr!)
1111 (lexical z _) (const ())))))
1114 (let ((foo top-foo) (bar top-bar))
1115 (let* ((g (lambda (x y) (+ x y)))
1116 (f (lambda (g x) (g x x))))
1117 (+ (f g foo) (f g bar))))
1118 (let (foo bar) (_ _) ((toplevel top-foo) (toplevel top-bar))
1119 (apply (primitive +)
1120 (apply (primitive +) (lexical foo _) (lexical foo _))
1121 (apply (primitive +) (lexical bar _) (lexical bar _)))))
1124 ;; Fresh objects are not turned into constants, nor are constants
1125 ;; turned into fresh objects.
1130 (let (x) (_) ((apply (primitive cons) (const 1) (const (2 3))))
1131 (apply (primitive cons) (const 0) (lexical x _))))
1134 ;; Bindings mutated.
1138 (let (x) (_) ((const 2))
1140 (set! (lexical x _) (const 3))
1144 ;; Bindings mutated.
1149 (frob f) ; may mutate `x'
1151 (letrec (x) (_) ((const 0))
1153 (apply (toplevel frob) (lambda _ _))
1157 ;; Bindings mutated.
1158 (letrec ((f (lambda (x)
1159 (set! f (lambda (_) x))
1165 ;; Bindings possibly mutated.
1166 (let ((x (make-foo)))
1167 (frob! x) ; may mutate `x'
1169 (let (x) (_) ((apply (toplevel make-foo)))
1171 (apply (toplevel frob!) (lexical x _))
1175 ;; Inlining stops at recursive calls with dynamic arguments.
1177 (if (< x 0) x (loop (1- x))))
1178 (letrec (loop) (_) ((lambda (_)
1180 (((x) #f #f #f () (_))
1182 (apply (lexical loop _)
1183 (apply (primitive 1-)
1184 (lexical x _))))))))
1185 (apply (lexical loop _) (toplevel x))))
1188 ;; Recursion on the 2nd argument is fully evaluated.
1190 (let loop ((x x) (y 10))
1194 (let (x) (_) ((apply (toplevel top)))
1195 (letrec (loop) (_) (_)
1196 (apply (toplevel foo) (lexical x _) (const 0)))))
1199 ;; Inlining aborted when residual code contains recursive calls.
1201 ;; <http://debbugs.gnu.org/9542>
1202 (let loop ((x x) (y 0))
1204 (loop (1- x) (1- y))
1207 (loop (1+ x) (1+ y)))))
1208 (letrec (loop) (_) ((lambda (_)
1210 (((x y) #f #f #f () (_ _))
1211 (if (apply (primitive >)
1212 (lexical y _) (const 0))
1214 (apply (lexical loop _) (toplevel x) (const 0))))
1217 ;; Infinite recursion: `peval' gives up and leaves it as is.
1218 (letrec ((f (lambda (x) (g (1- x))))
1219 (g (lambda (x) (h (1+ x))))
1220 (h (lambda (x) (f x))))
1225 ;; Constant folding: cons
1226 (begin (cons 1 2) #f)
1230 ;; Constant folding: cons
1231 (begin (cons (foo) 2) #f)
1232 (begin (apply (toplevel foo)) (const #f)))
1235 ;; Constant folding: cons
1240 ;; Constant folding: car+cons
1245 ;; Constant folding: cdr+cons
1250 ;; Constant folding: car+cons, impure
1251 (car (cons 1 (bar)))
1252 (begin (apply (toplevel bar)) (const 1)))
1255 ;; Constant folding: cdr+cons, impure
1256 (cdr (cons (bar) 0))
1257 (begin (apply (toplevel bar)) (const 0)))
1260 ;; Constant folding: car+list
1265 ;; Constant folding: cdr+list
1267 (apply (primitive list) (const 0)))
1270 ;; Constant folding: car+list, impure
1271 (car (list 1 (bar)))
1272 (begin (apply (toplevel bar)) (const 1)))
1275 ;; Constant folding: cdr+list, impure
1276 (cdr (list (bar) 0))
1277 (begin (apply (toplevel bar)) (apply (primitive list) (const 0))))
1281 ;; Prompt is removed if tag is unreferenced
1282 (let ((tag (make-prompt-tag)))
1283 (call-with-prompt tag
1285 (lambda args args)))
1290 ;; Prompt is removed if tag is unreferenced, with explicit stem
1291 (let ((tag (make-prompt-tag "foo")))
1292 (call-with-prompt tag
1294 (lambda args args)))
1299 ;; `while' without `break' or `continue' has no prompts and gets its
1300 ;; condition folded. Unfortunately the outer `lp' does not yet get
1306 ((() #f #f #f () ())
1310 ((() #f #f #f () ())
1311 (apply (lexical loop _))))))
1312 (apply (lexical loop _)))))))
1313 (apply (lexical lp _)))))
1317 (with-test-prefix "tree-il-fold"
1319 (pass-if "empty tree"
1320 (let ((leaf? #f) (up? #f) (down? #f) (mark (list 'mark)))
1322 (tree-il-fold (lambda (x y) (set! leaf? #t) y)
1323 (lambda (x y) (set! down? #t) y)
1324 (lambda (x y) (set! up? #t) y)
1331 (pass-if "lambda and application"
1332 (let* ((leaves '()) (ups '()) (downs '())
1333 (result (tree-il-fold (lambda (x y)
1334 (set! leaves (cons x leaves))
1337 (set! downs (cons x downs))
1340 (set! ups (cons x ups))
1346 (((x y) #f #f #f () (x1 y1))
1351 (and (equal? (map strip-source leaves)
1352 (list (make-lexical-ref #f 'y 'y1)
1353 (make-lexical-ref #f 'x 'x1)
1354 (make-toplevel-ref #f '+)))
1355 (= (length downs) 3)
1356 (equal? (reverse (map strip-source ups))
1357 (map strip-source downs))))))
1364 ;; Make sure we get English messages.
1365 (setlocale LC_ALL "C")
1367 (define (call-with-warnings thunk)
1368 (let ((port (open-output-string)))
1369 (with-fluids ((*current-warning-port* port)
1370 (*current-warning-prefix* ""))
1372 (let ((warnings (get-output-string port)))
1373 (string-tokenize warnings
1374 (char-set-complement (char-set #\newline))))))
1376 (define %opts-w-unused
1377 '(#:warnings (unused-variable)))
1379 (define %opts-w-unused-toplevel
1380 '(#:warnings (unused-toplevel)))
1382 (define %opts-w-unbound
1383 '(#:warnings (unbound-variable)))
1385 (define %opts-w-arity
1386 '(#:warnings (arity-mismatch)))
1388 (define %opts-w-format
1389 '(#:warnings (format)))
1392 (with-test-prefix "warnings"
1394 (pass-if "unknown warning type"
1395 (let ((w (call-with-warnings
1397 (compile #t #:opts '(#:warnings (does-not-exist)))))))
1398 (and (= (length w) 1)
1399 (number? (string-contains (car w) "unknown warning")))))
1401 (with-test-prefix "unused-variable"
1404 (null? (call-with-warnings
1406 (compile '(lambda (x y) (+ x y))
1407 #:opts %opts-w-unused)))))
1409 (pass-if "let/unused"
1410 (let ((w (call-with-warnings
1412 (compile '(lambda (x)
1415 #:opts %opts-w-unused)))))
1416 (and (= (length w) 1)
1417 (number? (string-contains (car w) "unused variable `y'")))))
1419 (pass-if "shadowed variable"
1420 (let ((w (call-with-warnings
1422 (compile '(lambda (x)
1426 #:opts %opts-w-unused)))))
1427 (and (= (length w) 1)
1428 (number? (string-contains (car w) "unused variable `y'")))))
1431 (null? (call-with-warnings
1433 (compile '(lambda ()
1434 (letrec ((x (lambda () (y)))
1435 (y (lambda () (x))))
1437 #:opts %opts-w-unused)))))
1439 (pass-if "unused argument"
1440 ;; Unused arguments should not be reported.
1441 (null? (call-with-warnings
1443 (compile '(lambda (x y z) #t)
1444 #:opts %opts-w-unused)))))
1446 (pass-if "special variable names"
1447 (null? (call-with-warnings
1449 (compile '(lambda ()
1450 (let ((_ 'underscore)
1451 (#{gensym name}# 'ignore-me))
1454 #:opts %opts-w-unused))))))
1456 (with-test-prefix "unused-toplevel"
1458 (pass-if "used after definition"
1459 (null? (call-with-warnings
1461 (let ((in (open-input-string
1462 "(define foo 2) foo")))
1463 (read-and-compile in
1465 #:opts %opts-w-unused-toplevel))))))
1467 (pass-if "used before definition"
1468 (null? (call-with-warnings
1470 (let ((in (open-input-string
1471 "(define (bar) foo) (define foo 2) (bar)")))
1472 (read-and-compile in
1474 #:opts %opts-w-unused-toplevel))))))
1476 (pass-if "unused but public"
1477 (let ((in (open-input-string
1478 "(define-module (test-suite tree-il x) #:export (bar))
1479 (define (bar) #t)")))
1480 (null? (call-with-warnings
1482 (read-and-compile in
1484 #:opts %opts-w-unused-toplevel))))))
1486 (pass-if "unused but public (more)"
1487 (let ((in (open-input-string
1488 "(define-module (test-suite tree-il x) #:export (bar))
1489 (define (bar) (baz))
1490 (define (baz) (foo))
1491 (define (foo) #t)")))
1492 (null? (call-with-warnings
1494 (read-and-compile in
1496 #:opts %opts-w-unused-toplevel))))))
1498 (pass-if "unused but define-public"
1499 (null? (call-with-warnings
1501 (compile '(define-public foo 2)
1503 #:opts %opts-w-unused-toplevel)))))
1505 (pass-if "used by macro"
1506 ;; FIXME: See comment about macros at `unused-toplevel-analysis'.
1509 (null? (call-with-warnings
1511 (let ((in (open-input-string
1512 "(define (bar) 'foo)
1514 (syntax-rules () ((_) (bar))))")))
1515 (read-and-compile in
1517 #:opts %opts-w-unused-toplevel))))))
1520 (let ((w (call-with-warnings
1522 (compile '(define foo 2)
1524 #:opts %opts-w-unused-toplevel)))))
1525 (and (= (length w) 1)
1526 (number? (string-contains (car w)
1527 (format #f "top-level variable `~A'"
1530 (pass-if "unused recursive"
1531 (let ((w (call-with-warnings
1533 (compile '(define (foo) (foo))
1535 #:opts %opts-w-unused-toplevel)))))
1536 (and (= (length w) 1)
1537 (number? (string-contains (car w)
1538 (format #f "top-level variable `~A'"
1541 (pass-if "unused mutually recursive"
1542 (let* ((in (open-input-string
1543 "(define (foo) (bar)) (define (bar) (foo))"))
1544 (w (call-with-warnings
1546 (read-and-compile in
1548 #:opts %opts-w-unused-toplevel)))))
1549 (and (= (length w) 2)
1550 (number? (string-contains (car w)
1551 (format #f "top-level variable `~A'"
1553 (number? (string-contains (cadr w)
1554 (format #f "top-level variable `~A'"
1557 (pass-if "special variable names"
1558 (null? (call-with-warnings
1560 (compile '(define #{gensym name}# 'ignore-me)
1562 #:opts %opts-w-unused-toplevel))))))
1564 (with-test-prefix "unbound variable"
1567 (null? (call-with-warnings
1569 (compile '+ #:opts %opts-w-unbound)))))
1573 (w (call-with-warnings
1577 #:opts %opts-w-unbound)))))
1578 (and (= (length w) 1)
1579 (number? (string-contains (car w)
1580 (format #f "unbound variable `~A'"
1585 (w (call-with-warnings
1587 (compile `(set! ,v 7)
1589 #:opts %opts-w-unbound)))))
1590 (and (= (length w) 1)
1591 (number? (string-contains (car w)
1592 (format #f "unbound variable `~A'"
1595 (pass-if "module-local top-level is visible"
1596 (let ((m (make-module))
1598 (beautify-user-module! m)
1599 (compile `(define ,v 123)
1600 #:env m #:opts %opts-w-unbound)
1601 (null? (call-with-warnings
1606 #:opts %opts-w-unbound))))))
1608 (pass-if "module-local top-level is visible after"
1609 (let ((m (make-module))
1611 (beautify-user-module! m)
1612 (null? (call-with-warnings
1614 (let ((in (open-input-string
1617 (define chbouib 5)")))
1618 (read-and-compile in
1620 #:opts %opts-w-unbound)))))))
1622 (pass-if "optional arguments are visible"
1623 (null? (call-with-warnings
1625 (compile '(lambda* (x #:optional y z) (list x y z))
1626 #:opts %opts-w-unbound
1629 (pass-if "keyword arguments are visible"
1630 (null? (call-with-warnings
1632 (compile '(lambda* (x #:key y z) (list x y z))
1633 #:opts %opts-w-unbound
1636 (pass-if "GOOPS definitions are visible"
1637 (let ((m (make-module))
1639 (beautify-user-module! m)
1640 (module-use! m (resolve-interface '(oop goops)))
1641 (null? (call-with-warnings
1643 (let ((in (open-input-string
1644 "(define-class <foo> ()
1645 (bar #:getter foo-bar))
1646 (define z (foo-bar (make <foo>)))")))
1647 (read-and-compile in
1649 #:opts %opts-w-unbound))))))))
1651 (with-test-prefix "arity mismatch"
1654 (null? (call-with-warnings
1656 (compile '(cons 'a 'b) #:opts %opts-w-arity)))))
1658 (pass-if "direct application"
1659 (let ((w (call-with-warnings
1661 (compile '((lambda (x y) (or x y)) 1 2 3 4 5)
1662 #:opts %opts-w-arity
1664 (and (= (length w) 1)
1665 (number? (string-contains (car w)
1666 "wrong number of arguments to")))))
1668 (let ((w (call-with-warnings
1670 (compile '(let ((f (lambda (x y) (+ x y))))
1672 #:opts %opts-w-arity
1674 (and (= (length w) 1)
1675 (number? (string-contains (car w)
1676 "wrong number of arguments to")))))
1679 (let ((w (call-with-warnings
1681 (compile '(cons 1 2 3 4)
1682 #:opts %opts-w-arity
1684 (and (= (length w) 1)
1685 (number? (string-contains (car w)
1686 "wrong number of arguments to")))))
1688 (pass-if "alias to global"
1689 (let ((w (call-with-warnings
1691 (compile '(let ((f cons)) (f 1 2 3 4))
1692 #:opts %opts-w-arity
1694 (and (= (length w) 1)
1695 (number? (string-contains (car w)
1696 "wrong number of arguments to")))))
1698 (pass-if "alias to lexical to global"
1699 (let ((w (call-with-warnings
1701 (compile '(let ((f number?))
1704 #:opts %opts-w-arity
1706 (and (= (length w) 1)
1707 (number? (string-contains (car w)
1708 "wrong number of arguments to")))))
1710 (pass-if "alias to lexical"
1711 (let ((w (call-with-warnings
1713 (compile '(let ((f (lambda (x y z) (+ x y z))))
1716 #:opts %opts-w-arity
1718 (and (= (length w) 1)
1719 (number? (string-contains (car w)
1720 "wrong number of arguments to")))))
1723 (let ((w (call-with-warnings
1725 (compile '(letrec ((odd? (lambda (x) (even? (1- x))))
1730 #:opts %opts-w-arity
1732 (and (= (length w) 1)
1733 (number? (string-contains (car w)
1734 "wrong number of arguments to")))))
1736 (pass-if "case-lambda"
1737 (null? (call-with-warnings
1739 (compile '(let ((f (case-lambda
1746 #:opts %opts-w-arity
1749 (pass-if "case-lambda with wrong number of arguments"
1750 (let ((w (call-with-warnings
1752 (compile '(let ((f (case-lambda
1756 #:opts %opts-w-arity
1758 (and (= (length w) 1)
1759 (number? (string-contains (car w)
1760 "wrong number of arguments to")))))
1762 (pass-if "case-lambda*"
1763 (null? (call-with-warnings
1765 (compile '(let ((f (case-lambda*
1766 ((x #:optional y) 1)
1768 ((x y #:key z) 3))))
1773 #:opts %opts-w-arity
1776 (pass-if "case-lambda* with wrong arguments"
1777 (let ((w (call-with-warnings
1779 (compile '(let ((f (case-lambda*
1780 ((x #:optional y) 1)
1782 ((x y #:key z) 3))))
1785 #:opts %opts-w-arity
1787 (and (= (length w) 2)
1788 (null? (filter (lambda (w)
1792 w "wrong number of arguments to"))))
1795 (pass-if "local toplevel-defines"
1796 (let ((w (call-with-warnings
1798 (let ((in (open-input-string "
1799 (define (g x) (f x))
1801 (read-and-compile in
1802 #:opts %opts-w-arity
1803 #:to 'assembly))))))
1804 (and (= (length w) 1)
1805 (number? (string-contains (car w)
1806 "wrong number of arguments to")))))
1808 (pass-if "global toplevel alias"
1809 (let ((w (call-with-warnings
1811 (let ((in (open-input-string "
1813 (define (g) (f))")))
1814 (read-and-compile in
1815 #:opts %opts-w-arity
1816 #:to 'assembly))))))
1817 (and (= (length w) 1)
1818 (number? (string-contains (car w)
1819 "wrong number of arguments to")))))
1821 (pass-if "local toplevel overrides global"
1822 (null? (call-with-warnings
1824 (let ((in (open-input-string "
1826 (define (foo x) (cons))")))
1827 (read-and-compile in
1828 #:opts %opts-w-arity
1829 #:to 'assembly))))))
1831 (pass-if "keyword not passed and quiet"
1832 (null? (call-with-warnings
1834 (compile '(let ((f (lambda* (x #:key y) y)))
1836 #:opts %opts-w-arity
1839 (pass-if "keyword passed and quiet"
1840 (null? (call-with-warnings
1842 (compile '(let ((f (lambda* (x #:key y) y)))
1844 #:opts %opts-w-arity
1847 (pass-if "keyword passed to global and quiet"
1848 (null? (call-with-warnings
1850 (let ((in (open-input-string "
1851 (use-modules (system base compile))
1852 (compile '(+ 2 3) #:env (current-module))")))
1853 (read-and-compile in
1854 #:opts %opts-w-arity
1855 #:to 'assembly))))))
1857 (pass-if "extra keyword"
1858 (let ((w (call-with-warnings
1860 (compile '(let ((f (lambda* (x #:key y) y)))
1862 #:opts %opts-w-arity
1864 (and (= (length w) 1)
1865 (number? (string-contains (car w)
1866 "wrong number of arguments to")))))
1868 (pass-if "extra keywords allowed"
1869 (null? (call-with-warnings
1871 (compile '(let ((f (lambda* (x #:key y #:allow-other-keys)
1874 #:opts %opts-w-arity
1875 #:to 'assembly))))))
1877 (with-test-prefix "format"
1879 (pass-if "quiet (no args)"
1880 (null? (call-with-warnings
1882 (compile '(format #t "hey!")
1883 #:opts %opts-w-format
1886 (pass-if "quiet (1 arg)"
1887 (null? (call-with-warnings
1889 (compile '(format #t "hey ~A!" "you")
1890 #:opts %opts-w-format
1893 (pass-if "quiet (2 args)"
1894 (null? (call-with-warnings
1896 (compile '(format #t "~A ~A!" "hello" "world")
1897 #:opts %opts-w-format
1900 (pass-if "wrong port arg"
1901 (let ((w (call-with-warnings
1903 (compile '(format 10 "foo")
1904 #:opts %opts-w-format
1906 (and (= (length w) 1)
1907 (number? (string-contains (car w)
1908 "wrong port argument")))))
1910 (pass-if "non-literal format string"
1911 (let ((w (call-with-warnings
1913 (compile '(format #f fmt)
1914 #:opts %opts-w-format
1916 (and (= (length w) 1)
1917 (number? (string-contains (car w)
1918 "non-literal format string")))))
1920 (pass-if "non-literal format string using gettext"
1921 (null? (call-with-warnings
1923 (compile '(format #t (_ "~A ~A!") "hello" "world")
1924 #:opts %opts-w-format
1927 (pass-if "wrong format string"
1928 (let ((w (call-with-warnings
1930 (compile '(format #f 'not-a-string)
1931 #:opts %opts-w-format
1933 (and (= (length w) 1)
1934 (number? (string-contains (car w)
1935 "wrong format string")))))
1937 (pass-if "wrong number of args"
1938 (let ((w (call-with-warnings
1940 (compile '(format "shbweeb")
1941 #:opts %opts-w-format
1943 (and (= (length w) 1)
1944 (number? (string-contains (car w)
1945 "wrong number of arguments")))))
1947 (pass-if "~%, ~~, ~&, ~t, ~_, and ~\\n"
1948 (null? (call-with-warnings
1950 (compile '(format some-port "~&~3_~~ ~\n~12they~%")
1951 #:opts %opts-w-format
1954 (pass-if "one missing argument"
1955 (let ((w (call-with-warnings
1957 (compile '(format some-port "foo ~A~%")
1958 #:opts %opts-w-format
1960 (and (= (length w) 1)
1961 (number? (string-contains (car w)
1962 "expected 1, got 0")))))
1964 (pass-if "one missing argument, gettext"
1965 (let ((w (call-with-warnings
1967 (compile '(format some-port (_ "foo ~A~%"))
1968 #:opts %opts-w-format
1970 (and (= (length w) 1)
1971 (number? (string-contains (car w)
1972 "expected 1, got 0")))))
1974 (pass-if "two missing arguments"
1975 (let ((w (call-with-warnings
1977 (compile '(format #f "foo ~10,2f and bar ~S~%")
1978 #:opts %opts-w-format
1980 (and (= (length w) 1)
1981 (number? (string-contains (car w)
1982 "expected 2, got 0")))))
1984 (pass-if "one given, one missing argument"
1985 (let ((w (call-with-warnings
1987 (compile '(format #t "foo ~A and ~S~%" hey)
1988 #:opts %opts-w-format
1990 (and (= (length w) 1)
1991 (number? (string-contains (car w)
1992 "expected 2, got 1")))))
1994 (pass-if "too many arguments"
1995 (let ((w (call-with-warnings
1997 (compile '(format #t "foo ~A~%" 1 2)
1998 #:opts %opts-w-format
2000 (and (= (length w) 1)
2001 (number? (string-contains (car w)
2002 "expected 1, got 2")))))
2004 (with-test-prefix "conditionals"
2006 (null? (call-with-warnings
2008 (compile '(format #f "~A ~[foo~;bar~;baz~;~] ~10,2f"
2010 #:opts %opts-w-format
2013 (pass-if "literals with selector"
2014 (let ((w (call-with-warnings
2016 (compile '(format #f "~2[foo~;bar~;baz~;~] ~A"
2018 #:opts %opts-w-format
2020 (and (= (length w) 1)
2021 (number? (string-contains (car w)
2022 "expected 1, got 2")))))
2024 (pass-if "escapes (exact count)"
2025 (let ((w (call-with-warnings
2027 (compile '(format #f "~[~a~;~a~]")
2028 #:opts %opts-w-format
2030 (and (= (length w) 1)
2031 (number? (string-contains (car w)
2032 "expected 2, got 0")))))
2034 (pass-if "escapes with selector"
2035 (let ((w (call-with-warnings
2037 (compile '(format #f "~1[chbouib~;~a~]")
2038 #:opts %opts-w-format
2040 (and (= (length w) 1)
2041 (number? (string-contains (car w)
2042 "expected 1, got 0")))))
2044 (pass-if "escapes, range"
2045 (let ((w (call-with-warnings
2047 (compile '(format #f "~[chbouib~;~a~;~2*~a~]")
2048 #:opts %opts-w-format
2050 (and (= (length w) 1)
2051 (number? (string-contains (car w)
2052 "expected 1 to 4, got 0")))))
2055 (let ((w (call-with-warnings
2057 (compile '(format #f "~@[temperature=~d~]")
2058 #:opts %opts-w-format
2060 (and (= (length w) 1)
2061 (number? (string-contains (car w)
2062 "expected 1, got 0")))))
2065 (let ((w (call-with-warnings
2067 (compile '(format #f "~:[~[hey~;~a~;~va~]~;~3*~]")
2068 #:opts %opts-w-format
2070 (and (= (length w) 1)
2071 (number? (string-contains (car w)
2072 "expected 2 to 4, got 0")))))
2074 (pass-if "unterminated"
2075 (let ((w (call-with-warnings
2077 (compile '(format #f "~[unterminated")
2078 #:opts %opts-w-format
2080 (and (= (length w) 1)
2081 (number? (string-contains (car w)
2082 "unterminated conditional")))))
2084 (pass-if "unexpected ~;"
2085 (let ((w (call-with-warnings
2087 (compile '(format #f "foo~;bar")
2088 #:opts %opts-w-format
2090 (and (= (length w) 1)
2091 (number? (string-contains (car w)
2094 (pass-if "unexpected ~]"
2095 (let ((w (call-with-warnings
2097 (compile '(format #f "foo~]")
2098 #:opts %opts-w-format
2100 (and (= (length w) 1)
2101 (number? (string-contains (car w)
2105 (null? (call-with-warnings
2107 (compile '(format #f "~A ~{~S~} ~A"
2108 'hello '("ladies" "and")
2110 #:opts %opts-w-format
2113 (pass-if "~{...~}, too many args"
2114 (let ((w (call-with-warnings
2116 (compile '(format #f "~{~S~}" 1 2 3)
2117 #:opts %opts-w-format
2119 (and (= (length w) 1)
2120 (number? (string-contains (car w)
2121 "expected 1, got 3")))))
2124 (null? (call-with-warnings
2126 (compile '(format #f "~@{~S~}" 1 2 3)
2127 #:opts %opts-w-format
2130 (pass-if "~@{...~}, too few args"
2131 (let ((w (call-with-warnings
2133 (compile '(format #f "~A ~@{~S~}")
2134 #:opts %opts-w-format
2136 (and (= (length w) 1)
2137 (number? (string-contains (car w)
2138 "expected at least 1, got 0")))))
2140 (pass-if "unterminated ~{...~}"
2141 (let ((w (call-with-warnings
2143 (compile '(format #f "~{")
2144 #:opts %opts-w-format
2146 (and (= (length w) 1)
2147 (number? (string-contains (car w)
2151 (null? (call-with-warnings
2153 (compile '(format #f "~:@(~A ~A~)" 'foo 'bar)
2154 #:opts %opts-w-format
2158 (let ((w (call-with-warnings
2160 (compile '(format #f "~v_foo")
2161 #:opts %opts-w-format
2163 (and (= (length w) 1)
2164 (number? (string-contains (car w)
2165 "expected 1, got 0")))))
2167 (null? (call-with-warnings
2169 (compile '(format #f "~v:@y" 1 123)
2170 #:opts %opts-w-format
2175 (let ((w (call-with-warnings
2177 (compile '(format #f "~2*~a" 'a 'b)
2178 #:opts %opts-w-format
2180 (and (= (length w) 1)
2181 (number? (string-contains (car w)
2182 "expected 3, got 2")))))
2185 (null? (call-with-warnings
2187 (compile '(format #f "~?" "~d ~d" '(1 2))
2188 #:opts %opts-w-format
2191 (pass-if "complex 1"
2192 (let ((w (call-with-warnings
2194 (compile '(format #f
2195 "~4@S ~32S~@[;; ~1{~@?~}~]~@[~61t at ~a~]\n"
2197 #:opts %opts-w-format
2199 (and (= (length w) 1)
2200 (number? (string-contains (car w)
2201 "expected 4, got 6")))))
2203 (pass-if "complex 2"
2204 (let ((w (call-with-warnings
2206 (compile '(format #f
2207 "~:(~A~) Commands~:[~; [abbrev]~]:~2%"
2209 #:opts %opts-w-format
2211 (and (= (length w) 1)
2212 (number? (string-contains (car w)
2213 "expected 2, got 4")))))
2215 (pass-if "complex 3"
2216 (let ((w (call-with-warnings
2218 (compile '(format #f "~9@a~:[~*~3_~;~3d~] ~v:@y~%")
2219 #:opts %opts-w-format
2221 (and (= (length w) 1)
2222 (number? (string-contains (car w)
2223 "expected 5, got 0")))))
2225 (pass-if "ice-9 format"
2226 (let ((w (call-with-warnings
2228 (let ((in (open-input-string
2229 "(use-modules ((ice-9 format)
2230 #:renamer (symbol-prefix-proc 'i9-)))
2231 (i9-format #t \"yo! ~A\" 1 2)")))
2232 (read-and-compile in
2233 #:opts %opts-w-format
2234 #:to 'assembly))))))
2235 (and (= (length w) 1)
2236 (number? (string-contains (car w)
2237 "expected 1, got 2")))))
2239 (pass-if "not format"
2240 (null? (call-with-warnings
2242 (compile '(let ((format chbouib))
2243 (format #t "not ~A a format string"))
2244 #:opts %opts-w-format
2245 #:to 'assembly)))))))