1 ;;;; This file implements the IR1 optimization phase of the compiler.
2 ;;;; IR1 optimization is a grab-bag of optimizations that don't make
3 ;;;; major changes to the block-level control flow and don't use flow
4 ;;;; analysis. These optimizations can mostly be classified as
5 ;;;; "meta-evaluation", but there is a sizable top-down component as
8 ;;;; This software is part of the SBCL system. See the README file for
11 ;;;; This software is derived from the CMU CL system, which was
12 ;;;; written at Carnegie Mellon University and released into the
13 ;;;; public domain. The software is in the public domain and is
14 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
15 ;;;; files for more information.
19 ;;;; interface for obtaining results of constant folding
21 ;;; Return true if the sole use of Cont is a reference to a constant leaf.
22 (declaim (ftype (function (continuation) boolean) constant-continuation-p))
23 (defun constant-continuation-p (cont)
24 (let ((use (continuation-use cont)))
26 (constant-p (ref-leaf use)))))
28 ;;; Return the constant value for a continuation whose only use is a
30 (declaim (ftype (function (continuation) t) continuation-value))
31 (defun continuation-value (cont)
32 (aver (constant-continuation-p cont))
33 (constant-value (ref-leaf (continuation-use cont))))
35 ;;;; interface for obtaining results of type inference
37 ;;; Return a (possibly values) type that describes what we have proven
38 ;;; about the type of Cont without taking any type assertions into
39 ;;; consideration. This is just the union of the NODE-DERIVED-TYPE of
40 ;;; all the uses. Most often people use CONTINUATION-DERIVED-TYPE or
41 ;;; CONTINUATION-TYPE instead of using this function directly.
42 (defun continuation-proven-type (cont)
43 (declare (type continuation cont))
44 (ecase (continuation-kind cont)
45 ((:block-start :deleted-block-start)
46 (let ((uses (block-start-uses (continuation-block cont))))
48 (do ((res (node-derived-type (first uses))
49 (values-type-union (node-derived-type (first current))
51 (current (rest uses) (rest current)))
55 (node-derived-type (continuation-use cont)))))
57 ;;; Our best guess for the type of this continuation's value. Note
58 ;;; that this may be Values or Function type, which cannot be passed
59 ;;; as an argument to the normal type operations. See
60 ;;; Continuation-Type. This may be called on deleted continuations,
61 ;;; always returning *.
63 ;;; What we do is call CONTINUATION-PROVEN-TYPE and check whether the
64 ;;; result is a subtype of the assertion. If so, return the proven
65 ;;; type and set TYPE-CHECK to nil. Otherwise, return the intersection
66 ;;; of the asserted and proven types, and set TYPE-CHECK T. If
67 ;;; TYPE-CHECK already has a non-null value, then preserve it. Only in
68 ;;; the somewhat unusual circumstance of a newly discovered assertion
69 ;;; will we change TYPE-CHECK from NIL to T.
71 ;;; The result value is cached in the CONTINUATION-%DERIVED-TYPE slot.
72 ;;; If the slot is true, just return that value, otherwise recompute
73 ;;; and stash the value there.
74 #!-sb-fluid (declaim (inline continuation-derived-type))
75 (defun continuation-derived-type (cont)
76 (declare (type continuation cont))
77 (or (continuation-%derived-type cont)
78 (%continuation-derived-type cont)))
79 (defun %continuation-derived-type (cont)
80 (declare (type continuation cont))
81 (let ((proven (continuation-proven-type cont))
82 (asserted (continuation-asserted-type cont)))
83 (cond ((values-subtypep proven asserted)
84 (setf (continuation-%type-check cont) nil)
85 (setf (continuation-%derived-type cont) proven))
87 (unless (or (continuation-%type-check cont)
88 (not (continuation-dest cont))
89 (eq asserted *universal-type*))
90 (setf (continuation-%type-check cont) t))
92 (setf (continuation-%derived-type cont)
93 (values-type-intersection asserted proven))))))
95 ;;; Call CONTINUATION-DERIVED-TYPE to make sure the slot is up to
96 ;;; date, then return it.
97 #!-sb-fluid (declaim (inline continuation-type-check))
98 (defun continuation-type-check (cont)
99 (declare (type continuation cont))
100 (continuation-derived-type cont)
101 (continuation-%type-check cont))
103 ;;; Return the derived type for CONT's first value. This is guaranteed
104 ;;; not to be a VALUES or FUNCTION type.
105 (declaim (ftype (function (continuation) ctype) continuation-type))
106 (defun continuation-type (cont)
107 (single-value-type (continuation-derived-type cont)))
109 ;;;; interface routines used by optimizers
111 ;;; This function is called by optimizers to indicate that something
112 ;;; interesting has happened to the value of Cont. Optimizers must
113 ;;; make sure that they don't call for reoptimization when nothing has
114 ;;; happened, since optimization will fail to terminate.
116 ;;; We clear any cached type for the continuation and set the
117 ;;; reoptimize flags on everything in sight, unless the continuation
118 ;;; is deleted (in which case we do nothing.)
120 ;;; Since this can get called during IR1 conversion, we have to be
121 ;;; careful not to fly into space when the Dest's Prev is missing.
122 (defun reoptimize-continuation (cont)
123 (declare (type continuation cont))
124 (unless (member (continuation-kind cont) '(:deleted :unused))
125 (setf (continuation-%derived-type cont) nil)
126 (let ((dest (continuation-dest cont)))
128 (setf (continuation-reoptimize cont) t)
129 (setf (node-reoptimize dest) t)
130 (let ((prev (node-prev dest)))
132 (let* ((block (continuation-block prev))
133 (component (block-component block)))
134 (when (typep dest 'cif)
135 (setf (block-test-modified block) t))
136 (setf (block-reoptimize block) t)
137 (setf (component-reoptimize component) t))))))
139 (setf (block-type-check (node-block node)) t)))
142 ;;; Annotate Node to indicate that its result has been proven to be
143 ;;; typep to RType. After IR1 conversion has happened, this is the
144 ;;; only correct way to supply information discovered about a node's
145 ;;; type. If you screw with the Node-Derived-Type directly, then
146 ;;; information may be lost and reoptimization may not happen.
148 ;;; What we do is intersect Rtype with Node's Derived-Type. If the
149 ;;; intersection is different from the old type, then we do a
150 ;;; Reoptimize-Continuation on the Node-Cont.
151 (defun derive-node-type (node rtype)
152 (declare (type node node) (type ctype rtype))
153 (let ((node-type (node-derived-type node)))
154 (unless (eq node-type rtype)
155 (let ((int (values-type-intersection node-type rtype)))
156 (when (type/= node-type int)
157 (when (and *check-consistency*
158 (eq int *empty-type*)
159 (not (eq rtype *empty-type*)))
160 (let ((*compiler-error-context* node))
162 "New inferred type ~S conflicts with old type:~
164 (type-specifier rtype) (type-specifier node-type))))
165 (setf (node-derived-type node) int)
166 (reoptimize-continuation (node-cont node))))))
169 ;;; Similar to Derive-Node-Type, but asserts that it is an error for
170 ;;; Cont's value not to be typep to Type. If we improve the assertion,
171 ;;; we set TYPE-CHECK and TYPE-ASSERTED to guarantee that the new
172 ;;; assertion will be checked.
173 (defun assert-continuation-type (cont type)
174 (declare (type continuation cont) (type ctype type))
175 (let ((cont-type (continuation-asserted-type cont)))
176 (unless (eq cont-type type)
177 (let ((int (values-type-intersection cont-type type)))
178 (when (type/= cont-type int)
179 (setf (continuation-asserted-type cont) int)
181 (setf (block-attributep (block-flags (node-block node))
182 type-check type-asserted)
184 (reoptimize-continuation cont)))))
187 ;;; Assert that Call is to a function of the specified Type. It is
188 ;;; assumed that the call is legal and has only constants in the
189 ;;; keyword positions.
190 (defun assert-call-type (call type)
191 (declare (type combination call) (type function-type type))
192 (derive-node-type call (function-type-returns type))
193 (let ((args (combination-args call)))
194 (dolist (req (function-type-required type))
195 (when (null args) (return-from assert-call-type))
196 (let ((arg (pop args)))
197 (assert-continuation-type arg req)))
198 (dolist (opt (function-type-optional type))
199 (when (null args) (return-from assert-call-type))
200 (let ((arg (pop args)))
201 (assert-continuation-type arg opt)))
203 (let ((rest (function-type-rest type)))
206 (assert-continuation-type arg rest))))
208 (dolist (key (function-type-keywords type))
209 (let ((name (key-info-name key)))
210 (do ((arg args (cddr arg)))
212 (when (eq (continuation-value (first arg)) name)
213 (assert-continuation-type
214 (second arg) (key-info-type key)))))))
219 ;;; Do one forward pass over Component, deleting unreachable blocks
220 ;;; and doing IR1 optimizations. We can ignore all blocks that don't
221 ;;; have the Reoptimize flag set. If Component-Reoptimize is true when
222 ;;; we are done, then another iteration would be beneficial.
224 ;;; We delete blocks when there is either no predecessor or the block
225 ;;; is in a lambda that has been deleted. These blocks would
226 ;;; eventually be deleted by DFO recomputation, but doing it here
227 ;;; immediately makes the effect available to IR1 optimization.
228 (defun ir1-optimize (component)
229 (declare (type component component))
230 (setf (component-reoptimize component) nil)
231 (do-blocks (block component)
233 ((or (block-delete-p block)
234 (null (block-pred block))
235 (eq (functional-kind (block-home-lambda block)) :deleted))
236 (delete-block block))
239 (let ((succ (block-succ block)))
240 (unless (and succ (null (rest succ)))
243 (let ((last (block-last block)))
246 (flush-dest (if-test last))
247 (when (unlink-node last)
250 (when (maybe-delete-exit last)
253 (unless (join-successor-if-possible block)
256 (when (and (block-reoptimize block) (block-component block))
257 (aver (not (block-delete-p block)))
258 (ir1-optimize-block block))
260 (when (and (block-flush-p block) (block-component block))
261 (aver (not (block-delete-p block)))
262 (flush-dead-code block)))))
266 ;;; Loop over the nodes in Block, looking for stuff that needs to be
267 ;;; optimized. We dispatch off of the type of each node with its
268 ;;; reoptimize flag set:
270 ;;; -- With a combination, we call Propagate-Function-Change whenever
271 ;;; the function changes, and call IR1-Optimize-Combination if any
272 ;;; argument changes.
273 ;;; -- With an Exit, we derive the node's type from the Value's type.
274 ;;; We don't propagate Cont's assertion to the Value, since if we
275 ;;; did, this would move the checking of Cont's assertion to the
276 ;;; exit. This wouldn't work with Catch and UWP, where the Exit
277 ;;; node is just a placeholder for the actual unknown exit.
279 ;;; Note that we clear the node & block reoptimize flags *before*
280 ;;; doing the optimization. This ensures that the node or block will
281 ;;; be reoptimized if necessary. We leave the NODE-OPTIMIZE flag set
282 ;;; going into IR1-OPTIMIZE-RETURN, since IR1-OPTIMIZE-RETURN wants to
283 ;;; clear the flag itself.
284 (defun ir1-optimize-block (block)
285 (declare (type cblock block))
286 (setf (block-reoptimize block) nil)
287 (do-nodes (node cont block :restart-p t)
288 (when (node-reoptimize node)
289 (setf (node-reoptimize node) nil)
293 (ir1-optimize-combination node))
295 (ir1-optimize-if node))
297 (setf (node-reoptimize node) t)
298 (ir1-optimize-return node))
300 (ir1-optimize-mv-combination node))
302 (let ((value (exit-value node)))
304 (derive-node-type node (continuation-derived-type value)))))
306 (ir1-optimize-set node)))))
309 ;;; We cannot combine with a successor block if:
310 ;;; 1. The successor has more than one predecessor.
311 ;;; 2. The last node's CONT is also used somewhere else.
312 ;;; 3. The successor is the current block (infinite loop).
313 ;;; 4. The next block has a different cleanup, and thus we may want to
314 ;;; insert cleanup code between the two blocks at some point.
315 ;;; 5. The next block has a different home lambda, and thus the control
316 ;;; transfer is a non-local exit.
318 ;;; If we succeed, we return true, otherwise false.
320 ;;; Joining is easy when the successor's Start continuation is the
321 ;;; same from our Last's Cont. If they differ, then we can still join
322 ;;; when the last continuation has no next and the next continuation
323 ;;; has no uses. In this case, we replace the next continuation with
324 ;;; the last before joining the blocks.
325 (defun join-successor-if-possible (block)
326 (declare (type cblock block))
327 (let ((next (first (block-succ block))))
328 (when (block-start next)
329 (let* ((last (block-last block))
330 (last-cont (node-cont last))
331 (next-cont (block-start next)))
332 (cond ((or (rest (block-pred next))
333 (not (eq (continuation-use last-cont) last))
335 (not (eq (block-end-cleanup block)
336 (block-start-cleanup next)))
337 (not (eq (block-home-lambda block)
338 (block-home-lambda next))))
340 ((eq last-cont next-cont)
341 (join-blocks block next)
343 ((and (null (block-start-uses next))
344 (eq (continuation-kind last-cont) :inside-block))
345 (let ((next-node (continuation-next next-cont)))
346 ;; If next-cont does have a dest, it must be
347 ;; unreachable, since there are no uses.
348 ;; DELETE-CONTINUATION will mark the dest block as
349 ;; delete-p [and also this block, unless it is no
350 ;; longer backward reachable from the dest block.]
351 (delete-continuation next-cont)
352 (setf (node-prev next-node) last-cont)
353 (setf (continuation-next last-cont) next-node)
354 (setf (block-start next) last-cont)
355 (join-blocks block next))
360 ;;; Join together two blocks which have the same ending/starting
361 ;;; continuation. The code in Block2 is moved into Block1 and Block2
362 ;;; is deleted from the DFO. We combine the optimize flags for the two
363 ;;; blocks so that any indicated optimization gets done.
364 (defun join-blocks (block1 block2)
365 (declare (type cblock block1 block2))
366 (let* ((last (block-last block2))
367 (last-cont (node-cont last))
368 (succ (block-succ block2))
369 (start2 (block-start block2)))
370 (do ((cont start2 (node-cont (continuation-next cont))))
372 (when (eq (continuation-kind last-cont) :inside-block)
373 (setf (continuation-block last-cont) block1)))
374 (setf (continuation-block cont) block1))
376 (unlink-blocks block1 block2)
378 (unlink-blocks block2 block)
379 (link-blocks block1 block))
381 (setf (block-last block1) last)
382 (setf (continuation-kind start2) :inside-block))
384 (setf (block-flags block1)
385 (attributes-union (block-flags block1)
387 (block-attributes type-asserted test-modified)))
389 (let ((next (block-next block2))
390 (prev (block-prev block2)))
391 (setf (block-next prev) next)
392 (setf (block-prev next) prev))
396 ;;; Delete any nodes in BLOCK whose value is unused and have no
397 ;;; side-effects. We can delete sets of lexical variables when the set
398 ;;; variable has no references.
400 ;;; [### For now, don't delete potentially flushable calls when they
401 ;;; have the CALL attribute. Someday we should look at the funcitonal
402 ;;; args to determine if they have any side-effects.]
403 (defun flush-dead-code (block)
404 (declare (type cblock block))
405 (do-nodes-backwards (node cont block)
406 (unless (continuation-dest cont)
412 (let ((info (combination-kind node)))
413 (when (function-info-p info)
414 (let ((attr (function-info-attributes info)))
415 (when (and (ir1-attributep attr flushable)
416 (not (ir1-attributep attr call)))
417 (flush-dest (combination-fun node))
418 (dolist (arg (combination-args node))
420 (unlink-node node))))))
422 (when (eq (basic-combination-kind node) :local)
423 (let ((fun (combination-lambda node)))
424 (when (dolist (var (lambda-vars fun) t)
425 (when (or (leaf-refs var)
426 (lambda-var-sets var))
428 (flush-dest (first (basic-combination-args node)))
431 (let ((value (exit-value node)))
434 (setf (exit-value node) nil))))
436 (let ((var (set-var node)))
437 (when (and (lambda-var-p var)
438 (null (leaf-refs var)))
439 (flush-dest (set-value node))
440 (setf (basic-var-sets var)
441 (delete node (basic-var-sets var)))
442 (unlink-node node)))))))
444 (setf (block-flush-p block) nil)
447 ;;;; local call return type propagation
449 ;;; This function is called on RETURN nodes that have their REOPTIMIZE
450 ;;; flag set. It iterates over the uses of the RESULT, looking for
451 ;;; interesting stuff to update the TAIL-SET. If a use isn't a local
452 ;;; call, then we union its type together with the types of other such
453 ;;; uses. We assign to the RETURN-RESULT-TYPE the intersection of this
454 ;;; type with the RESULT's asserted type. We can make this
455 ;;; intersection now (potentially before type checking) because this
456 ;;; assertion on the result will eventually be checked (if
459 ;;; We call MAYBE-CONVERT-TAIL-LOCAL-CALL on each local non-MV
460 ;;; combination, which may change the succesor of the call to be the
461 ;;; called function, and if so, checks if the call can become an
462 ;;; assignment. If we convert to an assignment, we abort, since the
463 ;;; RETURN has been deleted.
464 (defun find-result-type (node)
465 (declare (type creturn node))
466 (let ((result (return-result node)))
467 (collect ((use-union *empty-type* values-type-union))
468 (do-uses (use result)
469 (cond ((and (basic-combination-p use)
470 (eq (basic-combination-kind use) :local))
471 (aver (eq (lambda-tail-set (node-home-lambda use))
472 (lambda-tail-set (combination-lambda use))))
473 (when (combination-p use)
474 (when (nth-value 1 (maybe-convert-tail-local-call use))
475 (return-from find-result-type (values)))))
477 (use-union (node-derived-type use)))))
478 (let ((int (values-type-intersection
479 (continuation-asserted-type result)
481 (setf (return-result-type node) int))))
484 ;;; Do stuff to realize that something has changed about the value
485 ;;; delivered to a return node. Since we consider the return values of
486 ;;; all functions in the tail set to be equivalent, this amounts to
487 ;;; bringing the entire tail set up to date. We iterate over the
488 ;;; returns for all the functions in the tail set, reanalyzing them
489 ;;; all (not treating Node specially.)
491 ;;; When we are done, we check whether the new type is different from
492 ;;; the old TAIL-SET-TYPE. If so, we set the type and also reoptimize
493 ;;; all the continuations for references to functions in the tail set.
494 ;;; This will cause IR1-OPTIMIZE-COMBINATION to derive the new type as
495 ;;; the results of the calls.
496 (defun ir1-optimize-return (node)
497 (declare (type creturn node))
498 (let* ((tails (lambda-tail-set (return-lambda node)))
499 (funs (tail-set-functions tails)))
500 (collect ((res *empty-type* values-type-union))
502 (let ((return (lambda-return fun)))
504 (when (node-reoptimize return)
505 (setf (node-reoptimize return) nil)
506 (find-result-type return))
507 (res (return-result-type return)))))
509 (when (type/= (res) (tail-set-type tails))
510 (setf (tail-set-type tails) (res))
511 (dolist (fun (tail-set-functions tails))
512 (dolist (ref (leaf-refs fun))
513 (reoptimize-continuation (node-cont ref)))))))
519 ;;; If the test has multiple uses, replicate the node when possible.
520 ;;; Also check whether the predicate is known to be true or false,
521 ;;; deleting the IF node in favor of the appropriate branch when this
523 (defun ir1-optimize-if (node)
524 (declare (type cif node))
525 (let ((test (if-test node))
526 (block (node-block node)))
528 (when (and (eq (block-start block) test)
529 (eq (continuation-next test) node)
530 (rest (block-start-uses block)))
532 (when (immediately-used-p test use)
533 (convert-if-if use node)
534 (when (continuation-use test) (return)))))
536 (let* ((type (continuation-type test))
538 (cond ((constant-continuation-p test)
539 (if (continuation-value test)
540 (if-alternative node)
541 (if-consequent node)))
542 ((not (types-equal-or-intersect type (specifier-type 'null)))
543 (if-alternative node))
544 ((type= type (specifier-type 'null))
545 (if-consequent node)))))
548 (when (rest (block-succ block))
549 (unlink-blocks block victim))
550 (setf (component-reanalyze (block-component (node-block node))) t)
551 (unlink-node node))))
554 ;;; Create a new copy of an IF Node that tests the value of the node
555 ;;; Use. The test must have >1 use, and must be immediately used by
556 ;;; Use. Node must be the only node in its block (implying that
557 ;;; block-start = if-test).
559 ;;; This optimization has an effect semantically similar to the
560 ;;; source-to-source transformation:
561 ;;; (IF (IF A B C) D E) ==>
562 ;;; (IF A (IF B D E) (IF C D E))
564 ;;; We clobber the NODE-SOURCE-PATH of both the original and the new
565 ;;; node so that dead code deletion notes will definitely not consider
566 ;;; either node to be part of the original source. One node might
567 ;;; become unreachable, resulting in a spurious note.
568 (defun convert-if-if (use node)
569 (declare (type node use) (type cif node))
570 (with-ir1-environment node
571 (let* ((block (node-block node))
572 (test (if-test node))
573 (cblock (if-consequent node))
574 (ablock (if-alternative node))
575 (use-block (node-block use))
576 (dummy-cont (make-continuation))
577 (new-cont (make-continuation))
578 (new-node (make-if :test new-cont
580 :alternative ablock))
581 (new-block (continuation-starts-block new-cont)))
582 (prev-link new-node new-cont)
583 (setf (continuation-dest new-cont) new-node)
584 (add-continuation-use new-node dummy-cont)
585 (setf (block-last new-block) new-node)
587 (unlink-blocks use-block block)
588 (delete-continuation-use use)
589 (add-continuation-use use new-cont)
590 (link-blocks use-block new-block)
592 (link-blocks new-block cblock)
593 (link-blocks new-block ablock)
595 (push "<IF Duplication>" (node-source-path node))
596 (push "<IF Duplication>" (node-source-path new-node))
598 (reoptimize-continuation test)
599 (reoptimize-continuation new-cont)
600 (setf (component-reanalyze *current-component*) t)))
603 ;;;; exit IR1 optimization
605 ;;; This function attempts to delete an exit node, returning true if
606 ;;; it deletes the block as a consequence:
607 ;;; -- If the exit is degenerate (has no Entry), then we don't do anything,
608 ;;; since there is nothing to be done.
609 ;;; -- If the exit node and its Entry have the same home lambda then we know
610 ;;; the exit is local, and can delete the exit. We change uses of the
611 ;;; Exit-Value to be uses of the original continuation, then unlink the
612 ;;; node. If the exit is to a TR context, then we must do MERGE-TAIL-SETS
613 ;;; on any local calls which delivered their value to this exit.
614 ;;; -- If there is no value (as in a GO), then we skip the value semantics.
616 ;;; This function is also called by environment analysis, since it
617 ;;; wants all exits to be optimized even if normal optimization was
619 (defun maybe-delete-exit (node)
620 (declare (type exit node))
621 (let ((value (exit-value node))
622 (entry (exit-entry node))
623 (cont (node-cont node)))
625 (eq (node-home-lambda node) (node-home-lambda entry)))
626 (setf (entry-exits entry) (delete node (entry-exits entry)))
631 (when (return-p (continuation-dest cont))
633 (when (and (basic-combination-p use)
634 (eq (basic-combination-kind use) :local))
636 (substitute-continuation-uses cont value)
637 (dolist (merge (merges))
638 (merge-tail-sets merge))))))))
640 ;;;; combination IR1 optimization
642 ;;; Report as we try each transform?
644 (defvar *show-transforms-p* nil)
646 ;;; Do IR1 optimizations on a COMBINATION node.
647 (declaim (ftype (function (combination) (values)) ir1-optimize-combination))
648 (defun ir1-optimize-combination (node)
649 (when (continuation-reoptimize (basic-combination-fun node))
650 (propagate-function-change node))
651 (let ((args (basic-combination-args node))
652 (kind (basic-combination-kind node)))
655 (let ((fun (combination-lambda node)))
656 (if (eq (functional-kind fun) :let)
657 (propagate-let-args node fun)
658 (propagate-local-call-args node fun))))
662 (setf (continuation-reoptimize arg) nil))))
666 (setf (continuation-reoptimize arg) nil)))
668 (let ((attr (function-info-attributes kind)))
669 (when (and (ir1-attributep attr foldable)
670 ;; KLUDGE: The next test could be made more sensitive,
671 ;; only suppressing constant-folding of functions with
672 ;; CALL attributes when they're actually passed
673 ;; function arguments. -- WHN 19990918
674 (not (ir1-attributep attr call))
675 (every #'constant-continuation-p args)
676 (continuation-dest (node-cont node))
677 ;; Even if the function is foldable in principle,
678 ;; it might be one of our low-level
679 ;; implementation-specific functions. Such
680 ;; functions don't necessarily exist at runtime on
681 ;; a plain vanilla ANSI Common Lisp
682 ;; cross-compilation host, in which case the
683 ;; cross-compiler can't fold it because the
684 ;; cross-compiler doesn't know how to evaluate it.
686 (let* ((ref (continuation-use (combination-fun node)))
687 (fun (leaf-name (ref-leaf ref))))
689 (constant-fold-call node)
690 (return-from ir1-optimize-combination)))
692 (let ((fun (function-info-derive-type kind)))
694 (let ((res (funcall fun node)))
696 (derive-node-type node res)
697 (maybe-terminate-block node nil)))))
699 (let ((fun (function-info-optimizer kind)))
700 (unless (and fun (funcall fun node))
701 (dolist (x (function-info-transforms kind))
703 (when *show-transforms-p*
704 (let* ((cont (basic-combination-fun node))
705 (fname (continuation-function-name cont t)))
706 (/show "trying transform" x (transform-function x) "for" fname)))
707 (unless (ir1-transform node x)
709 (when *show-transforms-p*
710 (/show "quitting because IR1-TRANSFORM result was NIL"))
715 ;;; If Call is to a function that doesn't return (i.e. return type is
716 ;;; NIL), then terminate the block there, and link it to the component
717 ;;; tail. We also change the call's CONT to be a dummy continuation to
718 ;;; prevent the use from confusing things.
720 ;;; Except when called during IR1, we delete the continuation if it
721 ;;; has no other uses. (If it does have other uses, we reoptimize.)
723 ;;; Termination on the basis of a continuation type assertion is
725 ;;; -- The continuation is deleted (hence the assertion is spurious), or
726 ;;; -- We are in IR1 conversion (where THE assertions are subject to
728 (defun maybe-terminate-block (call ir1-p)
729 (declare (type basic-combination call))
730 (let* ((block (node-block call))
731 (cont (node-cont call))
732 (tail (component-tail (block-component block)))
733 (succ (first (block-succ block))))
734 (unless (or (and (eq call (block-last block)) (eq succ tail))
735 (block-delete-p block))
736 (when (or (and (eq (continuation-asserted-type cont) *empty-type*)
737 (not (or ir1-p (eq (continuation-kind cont) :deleted))))
738 (eq (node-derived-type call) *empty-type*))
740 (delete-continuation-use call)
743 (aver (and (eq (block-last block) call)
744 (eq (continuation-kind cont) :block-start))))
746 (setf (block-last block) call)
747 (link-blocks block (continuation-starts-block cont)))))
749 (node-ends-block call)
750 (delete-continuation-use call)
751 (if (eq (continuation-kind cont) :unused)
752 (delete-continuation cont)
753 (reoptimize-continuation cont))))
755 (unlink-blocks block (first (block-succ block)))
756 (setf (component-reanalyze (block-component block)) t)
757 (aver (not (block-succ block)))
758 (link-blocks block tail)
759 (add-continuation-use call (make-continuation))
762 ;;; This is called both by IR1 conversion and IR1 optimization when
763 ;;; they have verified the type signature for the call, and are
764 ;;; wondering if something should be done to special-case the call. If
765 ;;; Call is a call to a global function, then see whether it defined
767 ;;; -- If a DEFINED-FUNCTION should be inline expanded, then convert the
768 ;;; expansion and change the call to call it. Expansion is enabled if
769 ;;; :INLINE or if space=0. If the FUNCTIONAL slot is true, we never expand,
770 ;;; since this function has already been converted. Local call analysis
771 ;;; will duplicate the definition if necessary. We claim that the parent
772 ;;; form is LABELS for context declarations, since we don't want it to be
773 ;;; considered a real global function.
774 ;;; -- In addition to a direct check for the function name in the table, we
775 ;;; also must check for slot accessors. If the function is a slot accessor,
776 ;;; then we set the combination kind to the function info of %Slot-Setter or
777 ;;; %Slot-Accessor, as appropriate.
778 ;;; -- If it is a known function, mark it as such by setting the Kind.
780 ;;; We return the leaf referenced (NIL if not a leaf) and the
781 ;;; function-info assigned.
782 (defun recognize-known-call (call ir1-p)
783 (declare (type combination call))
784 (let* ((ref (continuation-use (basic-combination-fun call)))
785 (leaf (when (ref-p ref) (ref-leaf ref)))
786 (inlinep (if (and (defined-function-p leaf)
787 (not (byte-compiling)))
788 (defined-function-inlinep leaf)
791 ((eq inlinep :notinline) (values nil nil))
792 ((not (and (global-var-p leaf)
793 (eq (global-var-kind leaf) :global-function)))
798 ((nil :maybe-inline) (policy call (zerop space))))
799 (defined-function-inline-expansion leaf)
800 (let ((fun (defined-function-functional leaf)))
802 (and (eq inlinep :inline) (functional-kind fun))))
803 (inline-expansion-ok call))
805 (let ((res (ir1-convert-lambda-for-defun
806 (defined-function-inline-expansion leaf)
808 #'ir1-convert-inline-lambda)))
809 (setf (defined-function-functional leaf) res)
810 (change-ref-leaf ref res))))
813 (with-ir1-environment call
815 (local-call-analyze *current-component*))))
817 (values (ref-leaf (continuation-use (basic-combination-fun call)))
820 (let* ((name (leaf-name leaf))
821 (info (info :function :info
822 (if (slot-accessor-p leaf)
828 (values leaf (setf (basic-combination-kind call) info))
829 (values leaf nil)))))))
831 ;;; Check whether CALL satisfies TYPE. If so, apply the type to the
832 ;;; call, and do MAYBE-TERMINATE-BLOCK and return the values of
833 ;;; RECOGNIZE-KNOWN-CALL. If an error, set the combination kind and
834 ;;; return NIL, NIL. If the type is just FUNCTION, then skip the
835 ;;; syntax check, arg/result type processing, but still call
836 ;;; RECOGNIZE-KNOWN-CALL, since the call might be to a known lambda,
837 ;;; and that checking is done by local call analysis.
838 (defun validate-call-type (call type ir1-p)
839 (declare (type combination call) (type ctype type))
840 (cond ((not (function-type-p type))
841 (aver (multiple-value-bind (val win)
842 (csubtypep type (specifier-type 'function))
844 (recognize-known-call call ir1-p))
845 ((valid-function-use call type
846 :argument-test #'always-subtypep
847 :result-test #'always-subtypep
848 ;; KLUDGE: Common Lisp is such a dynamic
849 ;; language that all we can do here in
850 ;; general is issue a STYLE-WARNING. It
851 ;; would be nice to issue a full WARNING
852 ;; in the special case of of type
853 ;; mismatches within a compilation unit
854 ;; (as in section 3.2.2.3 of the spec)
855 ;; but at least as of sbcl-0.6.11, we
856 ;; don't keep track of whether the
857 ;; mismatched data came from the same
858 ;; compilation unit, so we can't do that.
861 ;; FIXME: Actually, I think we could
862 ;; issue a full WARNING if the call
863 ;; violates a DECLAIM FTYPE.
864 :error-function #'compiler-style-warning
865 :warning-function #'compiler-note)
866 (assert-call-type call type)
867 (maybe-terminate-block call ir1-p)
868 (recognize-known-call call ir1-p))
870 (setf (combination-kind call) :error)
873 ;;; This is called by IR1-OPTIMIZE when the function for a call has
874 ;;; changed. If the call is local, we try to let-convert it, and
875 ;;; derive the result type. If it is a :FULL call, we validate it
876 ;;; against the type, which recognizes known calls, does inline
877 ;;; expansion, etc. If a call to a predicate in a non-conditional
878 ;;; position or to a function with a source transform, then we
879 ;;; reconvert the form to give IR1 another chance.
880 (defun propagate-function-change (call)
881 (declare (type combination call))
882 (let ((*compiler-error-context* call)
883 (fun-cont (basic-combination-fun call)))
884 (setf (continuation-reoptimize fun-cont) nil)
885 (case (combination-kind call)
887 (let ((fun (combination-lambda call)))
888 (maybe-let-convert fun)
889 (unless (member (functional-kind fun) '(:let :assignment :deleted))
890 (derive-node-type call (tail-set-type (lambda-tail-set fun))))))
892 (multiple-value-bind (leaf info)
893 (validate-call-type call (continuation-type fun-cont) nil)
894 (cond ((functional-p leaf)
895 (convert-call-if-possible
896 (continuation-use (basic-combination-fun call))
899 ((or (info :function :source-transform (leaf-name leaf))
901 (ir1-attributep (function-info-attributes info)
903 (let ((dest (continuation-dest (node-cont call))))
904 (and dest (not (if-p dest))))))
905 (let ((name (leaf-name leaf)))
907 (let ((dums (make-gensym-list (length
908 (combination-args call)))))
911 (,name ,@dums))))))))))))
914 ;;;; known function optimization
916 ;;; Add a failed optimization note to FAILED-OPTIMZATIONS for Node,
917 ;;; Fun and Args. If there is already a note for Node and Transform,
918 ;;; replace it, otherwise add a new one.
919 (defun record-optimization-failure (node transform args)
920 (declare (type combination node) (type transform transform)
921 (type (or function-type list) args))
922 (let* ((table (component-failed-optimizations *component-being-compiled*))
923 (found (assoc transform (gethash node table))))
925 (setf (cdr found) args)
926 (push (cons transform args) (gethash node table))))
929 ;;; Attempt to transform NODE using TRANSFORM-FUNCTION, subject to the
930 ;;; call type constraint TRANSFORM-TYPE. If we are inhibited from
931 ;;; doing the transform for some reason and FLAME is true, then we
932 ;;; make a note of the message in FAILED-OPTIMIZATIONS for IR1
933 ;;; finalize to pick up. We return true if the transform failed, and
934 ;;; thus further transformation should be attempted. We return false
935 ;;; if either the transform succeeded or was aborted.
936 (defun ir1-transform (node transform)
937 (declare (type combination node) (type transform transform))
938 (let* ((type (transform-type transform))
939 (fun (transform-function transform))
940 (constrained (function-type-p type))
941 (table (component-failed-optimizations *component-being-compiled*))
942 (flame (if (transform-important transform)
943 (policy node (>= speed inhibit-warnings))
944 (policy node (> speed inhibit-warnings))))
945 (*compiler-error-context* node))
946 (cond ((not (member (transform-when transform)
950 ;; FIXME: Make sure that there's a transform for
951 ;; (MEMBER SYMBOL ..) into MEMQ.
952 ;; FIXME: Note that when/if I make SHARE operation to shared
953 ;; constant data between objects in the system, remember that a
954 ;; SHAREd list, or other SHAREd compound object, can be processed
955 ;; recursively, so that e.g. the two lists above can share their
956 ;; '(:BOTH) tail sublists.
957 (let ((when (transform-when transform)))
958 (not (or (eq when :both)
959 (eq when (if *byte-compiling* :byte :native)))))
961 ((or (not constrained)
962 (valid-function-use node type :strict-result t))
963 (multiple-value-bind (severity args)
964 (catch 'give-up-ir1-transform
965 (transform-call node (funcall fun node))
972 (setf (combination-kind node) :error)
974 (apply #'compiler-warning args))
980 (record-optimization-failure node transform args))
981 (setf (gethash node table)
982 (remove transform (gethash node table) :key #'car)))
988 (valid-function-use node
990 :argument-test #'types-equal-or-intersect
992 #'values-types-equal-or-intersect))
993 (record-optimization-failure node transform type)
998 ;;; When we don't like an IR1 transform, we throw the severity/reason
1001 ;;; GIVE-UP-IR1-TRANSFORM is used to throw out of an IR1 transform,
1002 ;;; aborting this attempt to transform the call, but admitting the
1003 ;;; possibility that this or some other transform will later succeed.
1004 ;;; If arguments are supplied, they are format arguments for an
1005 ;;; efficiency note.
1007 ;;; ABORT-IR1-TRANSFORM is used to throw out of an IR1 transform and
1008 ;;; force a normal call to the function at run time. No further
1009 ;;; optimizations will be attempted.
1011 ;;; DELAY-IR1-TRANSFORM is used to throw out of an IR1 transform, and
1012 ;;; delay the transform on the node until later. REASONS specifies
1013 ;;; when the transform will be later retried. The :OPTIMIZE reason
1014 ;;; causes the transform to be delayed until after the current IR1
1015 ;;; optimization pass. The :CONSTRAINT reason causes the transform to
1016 ;;; be delayed until after constraint propagation.
1018 ;;; FIXME: Now (0.6.11.44) that there are 4 variants of this (GIVE-UP,
1019 ;;; ABORT, DELAY/:OPTIMIZE, DELAY/:CONSTRAINT) and we're starting to
1020 ;;; do CASE operations on the various REASON values, it might be a
1021 ;;; good idea to go OO, representing the reasons by objects, using
1022 ;;; CLOS methods on the objects instead of CASE, and (possibly) using
1023 ;;; SIGNAL instead of THROW.
1024 (declaim (ftype (function (&rest t) nil) give-up-ir1-transform))
1025 (defun give-up-ir1-transform (&rest args)
1026 (throw 'give-up-ir1-transform (values :failure args)))
1027 (defun abort-ir1-transform (&rest args)
1028 (throw 'give-up-ir1-transform (values :aborted args)))
1029 (defun delay-ir1-transform (node &rest reasons)
1030 (let ((assoc (assoc node *delayed-ir1-transforms*)))
1032 (setf *delayed-ir1-transforms*
1033 (acons node reasons *delayed-ir1-transforms*))
1034 (throw 'give-up-ir1-transform :delayed))
1036 (dolist (reason reasons)
1037 (pushnew reason (cdr assoc)))
1038 (throw 'give-up-ir1-transform :delayed)))))
1040 ;;; Clear any delayed transform with no reasons - these should have
1041 ;;; been tried in the last pass. Then remove the reason from the
1042 ;;; delayed transform reasons, and if any become empty then set
1043 ;;; reoptimize flags for the node. Return true if any transforms are
1045 (defun retry-delayed-ir1-transforms (reason)
1046 (setf *delayed-ir1-transforms*
1047 (remove-if-not #'cdr *delayed-ir1-transforms*))
1048 (let ((reoptimize nil))
1049 (dolist (assoc *delayed-ir1-transforms*)
1050 (let ((reasons (remove reason (cdr assoc))))
1051 (setf (cdr assoc) reasons)
1053 (let ((node (car assoc)))
1054 (unless (node-deleted node)
1056 (setf (node-reoptimize node) t)
1057 (let ((block (node-block node)))
1058 (setf (block-reoptimize block) t)
1059 (setf (component-reoptimize (block-component block)) t)))))))
1063 ;;; Take the lambda-expression RES, IR1 convert it in the proper
1064 ;;; environment, and then install it as the function for the call
1065 ;;; NODE. We do local call analysis so that the new function is
1066 ;;; integrated into the control flow.
1067 (defun transform-call (node res)
1068 (declare (type combination node) (list res))
1069 (with-ir1-environment node
1070 (let ((new-fun (ir1-convert-inline-lambda res))
1071 (ref (continuation-use (combination-fun node))))
1072 (change-ref-leaf ref new-fun)
1073 (setf (combination-kind node) :full)
1074 (local-call-analyze *current-component*)))
1077 ;;; Replace a call to a foldable function of constant arguments with
1078 ;;; the result of evaluating the form. We insert the resulting
1079 ;;; constant node after the call, stealing the call's continuation. We
1080 ;;; give the call a continuation with no Dest, which should cause it
1081 ;;; and its arguments to go away. If there is an error during the
1082 ;;; evaluation, we give a warning and leave the call alone, making the
1083 ;;; call a :ERROR call.
1085 ;;; If there is more than one value, then we transform the call into a
1087 (defun constant-fold-call (call)
1088 (declare (type combination call))
1089 (let* ((args (mapcar #'continuation-value (combination-args call)))
1090 (ref (continuation-use (combination-fun call)))
1091 (fun (leaf-name (ref-leaf ref))))
1093 (multiple-value-bind (values win)
1094 (careful-call fun args call "constant folding")
1096 (setf (combination-kind call) :error)
1097 (let ((dummies (make-gensym-list (length args))))
1101 (declare (ignore ,@dummies))
1102 (values ,@(mapcar #'(lambda (x) `',x) values))))))))
1106 ;;;; local call optimization
1108 ;;; Propagate Type to Leaf and its Refs, marking things changed. If
1109 ;;; the leaf type is a function type, then just leave it alone, since
1110 ;;; TYPE is never going to be more specific than that (and
1111 ;;; TYPE-INTERSECTION would choke.)
1112 (defun propagate-to-refs (leaf type)
1113 (declare (type leaf leaf) (type ctype type))
1114 (let ((var-type (leaf-type leaf)))
1115 (unless (function-type-p var-type)
1116 (let ((int (type-approx-intersection2 var-type type)))
1117 (when (type/= int var-type)
1118 (setf (leaf-type leaf) int)
1119 (dolist (ref (leaf-refs leaf))
1120 (derive-node-type ref int))))
1123 ;;; Figure out the type of a LET variable that has sets. We compute
1124 ;;; the union of the initial value Type and the types of all the set
1125 ;;; values and to a PROPAGATE-TO-REFS with this type.
1126 (defun propagate-from-sets (var type)
1127 (collect ((res type type-union))
1128 (dolist (set (basic-var-sets var))
1129 (res (continuation-type (set-value set)))
1130 (setf (node-reoptimize set) nil))
1131 (propagate-to-refs var (res)))
1134 ;;; If a LET variable, find the initial value's type and do
1135 ;;; PROPAGATE-FROM-SETS. We also derive the VALUE's type as the node's
1137 (defun ir1-optimize-set (node)
1138 (declare (type cset node))
1139 (let ((var (set-var node)))
1140 (when (and (lambda-var-p var) (leaf-refs var))
1141 (let ((home (lambda-var-home var)))
1142 (when (eq (functional-kind home) :let)
1143 (let ((iv (let-var-initial-value var)))
1144 (setf (continuation-reoptimize iv) nil)
1145 (propagate-from-sets var (continuation-type iv)))))))
1147 (derive-node-type node (continuation-type (set-value node)))
1150 ;;; Return true if the value of Ref will always be the same (and is
1151 ;;; thus legal to substitute.)
1152 (defun constant-reference-p (ref)
1153 (declare (type ref ref))
1154 (let ((leaf (ref-leaf ref)))
1156 ((or constant functional) t)
1158 (null (lambda-var-sets leaf)))
1160 (not (eq (defined-function-inlinep leaf) :notinline)))
1162 (case (global-var-kind leaf)
1163 (:global-function t)
1166 ;;; If we have a non-set LET var with a single use, then (if possible)
1167 ;;; replace the variable reference's CONT with the arg continuation.
1168 ;;; This is inhibited when:
1169 ;;; -- CONT has other uses, or
1170 ;;; -- CONT receives multiple values, or
1171 ;;; -- the reference is in a different environment from the variable, or
1172 ;;; -- either continuation has a funky TYPE-CHECK annotation.
1173 ;;; -- the continuations have incompatible assertions, so the new asserted type
1175 ;;; -- the var's DEST has a different policy than the ARG's (think safety).
1177 ;;; We change the Ref to be a reference to NIL with unused value, and
1178 ;;; let it be flushed as dead code. A side-effect of this substitution
1179 ;;; is to delete the variable.
1180 (defun substitute-single-use-continuation (arg var)
1181 (declare (type continuation arg) (type lambda-var var))
1182 (let* ((ref (first (leaf-refs var)))
1183 (cont (node-cont ref))
1184 (cont-atype (continuation-asserted-type cont))
1185 (dest (continuation-dest cont)))
1186 (when (and (eq (continuation-use cont) ref)
1188 (not (typep dest '(or creturn exit mv-combination)))
1189 (eq (node-home-lambda ref)
1190 (lambda-home (lambda-var-home var)))
1191 (member (continuation-type-check arg) '(t nil))
1192 (member (continuation-type-check cont) '(t nil))
1193 (not (eq (values-type-intersection
1195 (continuation-asserted-type arg))
1197 (eq (lexenv-policy (node-lexenv dest))
1198 (lexenv-policy (node-lexenv (continuation-dest arg)))))
1199 (aver (member (continuation-kind arg)
1200 '(:block-start :deleted-block-start :inside-block)))
1201 (assert-continuation-type arg cont-atype)
1202 (setf (node-derived-type ref) *wild-type*)
1203 (change-ref-leaf ref (find-constant nil))
1204 (substitute-continuation arg cont)
1205 (reoptimize-continuation arg)
1208 ;;; Delete a LET, removing the call and bind nodes, and warning about
1209 ;;; any unreferenced variables. Note that FLUSH-DEAD-CODE will come
1210 ;;; along right away and delete the REF and then the lambda, since we
1211 ;;; flush the FUN continuation.
1212 (defun delete-let (fun)
1213 (declare (type clambda fun))
1214 (aver (member (functional-kind fun) '(:let :mv-let)))
1215 (note-unreferenced-vars fun)
1216 (let ((call (let-combination fun)))
1217 (flush-dest (basic-combination-fun call))
1219 (unlink-node (lambda-bind fun))
1220 (setf (lambda-bind fun) nil))
1223 ;;; This function is called when one of the arguments to a LET
1224 ;;; changes. We look at each changed argument. If the corresponding
1225 ;;; variable is set, then we call PROPAGATE-FROM-SETS. Otherwise, we
1226 ;;; consider substituting for the variable, and also propagate
1227 ;;; derived-type information for the arg to all the Var's refs.
1229 ;;; Substitution is inhibited when the arg leaf's derived type isn't a
1230 ;;; subtype of the argument's asserted type. This prevents type
1231 ;;; checking from being defeated, and also ensures that the best
1232 ;;; representation for the variable can be used.
1234 ;;; Substitution of individual references is inhibited if the
1235 ;;; reference is in a different component from the home. This can only
1236 ;;; happen with closures over top-level lambda vars. In such cases,
1237 ;;; the references may have already been compiled, and thus can't be
1238 ;;; retroactively modified.
1240 ;;; If all of the variables are deleted (have no references) when we
1241 ;;; are done, then we delete the LET.
1243 ;;; Note that we are responsible for clearing the
1244 ;;; Continuation-Reoptimize flags.
1245 (defun propagate-let-args (call fun)
1246 (declare (type combination call) (type clambda fun))
1247 (loop for arg in (combination-args call)
1248 and var in (lambda-vars fun) do
1249 (when (and arg (continuation-reoptimize arg))
1250 (setf (continuation-reoptimize arg) nil)
1252 ((lambda-var-sets var)
1253 (propagate-from-sets var (continuation-type arg)))
1254 ((let ((use (continuation-use arg)))
1256 (let ((leaf (ref-leaf use)))
1257 (when (and (constant-reference-p use)
1258 (values-subtypep (leaf-type leaf)
1259 (continuation-asserted-type arg)))
1260 (propagate-to-refs var (continuation-type arg))
1261 (let ((this-comp (block-component (node-block use))))
1264 (cond ((eq (block-component (node-block ref))
1268 (aver (eq (functional-kind (lambda-home fun))
1273 ((and (null (rest (leaf-refs var)))
1274 (not *byte-compiling*)
1275 (substitute-single-use-continuation arg var)))
1277 (propagate-to-refs var (continuation-type arg))))))
1279 (when (every #'null (combination-args call))
1284 ;;; This function is called when one of the args to a non-LET local
1285 ;;; call changes. For each changed argument corresponding to an unset
1286 ;;; variable, we compute the union of the types across all calls and
1287 ;;; propagate this type information to the var's refs.
1289 ;;; If the function has an XEP, then we don't do anything, since we
1290 ;;; won't discover anything.
1292 ;;; We can clear the Continuation-Reoptimize flags for arguments in
1293 ;;; all calls corresponding to changed arguments in Call, since the
1294 ;;; only use in IR1 optimization of the Reoptimize flag for local call
1295 ;;; args is right here.
1296 (defun propagate-local-call-args (call fun)
1297 (declare (type combination call) (type clambda fun))
1299 (unless (or (functional-entry-function fun)
1300 (lambda-optional-dispatch fun))
1301 (let* ((vars (lambda-vars fun))
1302 (union (mapcar #'(lambda (arg var)
1304 (continuation-reoptimize arg)
1305 (null (basic-var-sets var)))
1306 (continuation-type arg)))
1307 (basic-combination-args call)
1309 (this-ref (continuation-use (basic-combination-fun call))))
1311 (dolist (arg (basic-combination-args call))
1313 (setf (continuation-reoptimize arg) nil)))
1315 (dolist (ref (leaf-refs fun))
1316 (let ((dest (continuation-dest (node-cont ref))))
1317 (unless (or (eq ref this-ref) (not dest))
1319 (mapcar #'(lambda (this-arg old)
1321 (setf (continuation-reoptimize this-arg) nil)
1322 (type-union (continuation-type this-arg) old)))
1323 (basic-combination-args dest)
1326 (mapc #'(lambda (var type)
1328 (propagate-to-refs var type)))
1333 ;;;; multiple values optimization
1335 ;;; Do stuff to notice a change to a MV combination node. There are
1336 ;;; two main branches here:
1337 ;;; -- If the call is local, then it is already a MV let, or should
1338 ;;; become one. Note that although all :LOCAL MV calls must eventually
1339 ;;; be converted to :MV-LETs, there can be a window when the call
1340 ;;; is local, but has not been LET converted yet. This is because
1341 ;;; the entry-point lambdas may have stray references (in other
1342 ;;; entry points) that have not been deleted yet.
1343 ;;; -- The call is full. This case is somewhat similar to the non-MV
1344 ;;; combination optimization: we propagate return type information and
1345 ;;; notice non-returning calls. We also have an optimization
1346 ;;; which tries to convert MV-CALLs into MV-binds.
1347 (defun ir1-optimize-mv-combination (node)
1348 (ecase (basic-combination-kind node)
1350 (let ((fun-cont (basic-combination-fun node)))
1351 (when (continuation-reoptimize fun-cont)
1352 (setf (continuation-reoptimize fun-cont) nil)
1353 (maybe-let-convert (combination-lambda node))))
1354 (setf (continuation-reoptimize (first (basic-combination-args node))) nil)
1355 (when (eq (functional-kind (combination-lambda node)) :mv-let)
1356 (unless (convert-mv-bind-to-let node)
1357 (ir1-optimize-mv-bind node))))
1359 (let* ((fun (basic-combination-fun node))
1360 (fun-changed (continuation-reoptimize fun))
1361 (args (basic-combination-args node)))
1363 (setf (continuation-reoptimize fun) nil)
1364 (let ((type (continuation-type fun)))
1365 (when (function-type-p type)
1366 (derive-node-type node (function-type-returns type))))
1367 (maybe-terminate-block node nil)
1368 (let ((use (continuation-use fun)))
1369 (when (and (ref-p use) (functional-p (ref-leaf use)))
1370 (convert-call-if-possible use node)
1371 (when (eq (basic-combination-kind node) :local)
1372 (maybe-let-convert (ref-leaf use))))))
1373 (unless (or (eq (basic-combination-kind node) :local)
1374 (eq (continuation-function-name fun) '%throw))
1375 (ir1-optimize-mv-call node))
1377 (setf (continuation-reoptimize arg) nil))))
1381 ;;; Propagate derived type info from the values continuation to the
1383 (defun ir1-optimize-mv-bind (node)
1384 (declare (type mv-combination node))
1385 (let ((arg (first (basic-combination-args node)))
1386 (vars (lambda-vars (combination-lambda node))))
1387 (multiple-value-bind (types nvals)
1388 (values-types (continuation-derived-type arg))
1389 (unless (eq nvals :unknown)
1390 (mapc #'(lambda (var type)
1391 (if (basic-var-sets var)
1392 (propagate-from-sets var type)
1393 (propagate-to-refs var type)))
1396 (make-list (max (- (length vars) nvals) 0)
1397 :initial-element (specifier-type 'null))))))
1398 (setf (continuation-reoptimize arg) nil))
1401 ;;; If possible, convert a general MV call to an MV-BIND. We can do
1403 ;;; -- The call has only one argument, and
1404 ;;; -- The function has a known fixed number of arguments, or
1405 ;;; -- The argument yields a known fixed number of values.
1407 ;;; What we do is change the function in the MV-CALL to be a lambda
1408 ;;; that "looks like an MV bind", which allows
1409 ;;; IR1-OPTIMIZE-MV-COMBINATION to notice that this call can be
1410 ;;; converted (the next time around.) This new lambda just calls the
1411 ;;; actual function with the MV-BIND variables as arguments. Note that
1412 ;;; this new MV bind is not let-converted immediately, as there are
1413 ;;; going to be stray references from the entry-point functions until
1414 ;;; they get deleted.
1416 ;;; In order to avoid loss of argument count checking, we only do the
1417 ;;; transformation according to a known number of expected argument if
1418 ;;; safety is unimportant. We can always convert if we know the number
1419 ;;; of actual values, since the normal call that we build will still
1420 ;;; do any appropriate argument count checking.
1422 ;;; We only attempt the transformation if the called function is a
1423 ;;; constant reference. This allows us to just splice the leaf into
1424 ;;; the new function, instead of trying to somehow bind the function
1425 ;;; expression. The leaf must be constant because we are evaluating it
1426 ;;; again in a different place. This also has the effect of squelching
1427 ;;; multiple warnings when there is an argument count error.
1428 (defun ir1-optimize-mv-call (node)
1429 (let ((fun (basic-combination-fun node))
1430 (*compiler-error-context* node)
1431 (ref (continuation-use (basic-combination-fun node)))
1432 (args (basic-combination-args node)))
1434 (unless (and (ref-p ref) (constant-reference-p ref)
1435 args (null (rest args)))
1436 (return-from ir1-optimize-mv-call))
1438 (multiple-value-bind (min max)
1439 (function-type-nargs (continuation-type fun))
1441 (multiple-value-bind (types nvals)
1442 (values-types (continuation-derived-type (first args)))
1443 (declare (ignore types))
1444 (if (eq nvals :unknown) nil nvals))))
1447 (when (and min (< total-nvals min))
1449 "MULTIPLE-VALUE-CALL with ~R values when the function expects ~
1452 (setf (basic-combination-kind node) :error)
1453 (return-from ir1-optimize-mv-call))
1454 (when (and max (> total-nvals max))
1456 "MULTIPLE-VALUE-CALL with ~R values when the function expects ~
1459 (setf (basic-combination-kind node) :error)
1460 (return-from ir1-optimize-mv-call)))
1462 (let ((count (cond (total-nvals)
1463 ((and (policy node (zerop safety))
1468 (with-ir1-environment node
1469 (let* ((dums (make-gensym-list count))
1471 (fun (ir1-convert-lambda
1472 `(lambda (&optional ,@dums &rest ,ignore)
1473 (declare (ignore ,ignore))
1474 (funcall ,(ref-leaf ref) ,@dums)))))
1475 (change-ref-leaf ref fun)
1476 (aver (eq (basic-combination-kind node) :full))
1477 (local-call-analyze *current-component*)
1478 (aver (eq (basic-combination-kind node) :local)))))))))
1482 ;;; (multiple-value-bind
1491 ;;; What we actually do is convert the VALUES combination into a
1492 ;;; normal LET combination calling the original :MV-LET lambda. If
1493 ;;; there are extra args to VALUES, discard the corresponding
1494 ;;; continuations. If there are insufficient args, insert references
1496 (defun convert-mv-bind-to-let (call)
1497 (declare (type mv-combination call))
1498 (let* ((arg (first (basic-combination-args call)))
1499 (use (continuation-use arg)))
1500 (when (and (combination-p use)
1501 (eq (continuation-function-name (combination-fun use))
1503 (let* ((fun (combination-lambda call))
1504 (vars (lambda-vars fun))
1505 (vals (combination-args use))
1506 (nvars (length vars))
1507 (nvals (length vals)))
1508 (cond ((> nvals nvars)
1509 (mapc #'flush-dest (subseq vals nvars))
1510 (setq vals (subseq vals 0 nvars)))
1512 (with-ir1-environment use
1513 (let ((node-prev (node-prev use)))
1514 (setf (node-prev use) nil)
1515 (setf (continuation-next node-prev) nil)
1516 (collect ((res vals))
1517 (loop as cont = (make-continuation use)
1518 and prev = node-prev then cont
1519 repeat (- nvars nvals)
1520 do (reference-constant prev cont nil)
1523 (prev-link use (car (last vals)))))))
1524 (setf (combination-args use) vals)
1525 (flush-dest (combination-fun use))
1526 (let ((fun-cont (basic-combination-fun call)))
1527 (setf (continuation-dest fun-cont) use)
1528 (setf (combination-fun use) fun-cont))
1529 (setf (combination-kind use) :local)
1530 (setf (functional-kind fun) :let)
1531 (flush-dest (first (basic-combination-args call)))
1534 (reoptimize-continuation (first vals)))
1535 (propagate-to-args use fun))
1539 ;;; (values-list (list x y z))
1544 ;;; In implementation, this is somewhat similar to
1545 ;;; CONVERT-MV-BIND-TO-LET. We grab the args of LIST and make them
1546 ;;; args of the VALUES-LIST call, flushing the old argument
1547 ;;; continuation (allowing the LIST to be flushed.)
1548 (defoptimizer (values-list optimizer) ((list) node)
1549 (let ((use (continuation-use list)))
1550 (when (and (combination-p use)
1551 (eq (continuation-function-name (combination-fun use))
1553 (change-ref-leaf (continuation-use (combination-fun node))
1554 (find-free-function 'values "in a strange place"))
1555 (setf (combination-kind node) :full)
1556 (let ((args (combination-args use)))
1558 (setf (continuation-dest arg) node))
1559 (setf (combination-args use) nil)
1561 (setf (combination-args node) args))
1564 ;;; If VALUES appears in a non-MV context, then effectively convert it
1565 ;;; to a PROG1. This allows the computation of the additional values
1566 ;;; to become dead code.
1567 (deftransform values ((&rest vals) * * :node node)
1568 (when (typep (continuation-dest (node-cont node))
1569 '(or creturn exit mv-combination))
1570 (give-up-ir1-transform))
1571 (setf (node-derived-type node) *wild-type*)
1573 (let ((dummies (make-gensym-list (length (cdr vals)))))
1574 `(lambda (val ,@dummies)
1575 (declare (ignore ,@dummies))