1 ;;;; This file contains miscellaneous utilities used for manipulating
2 ;;;; the IR1 representation.
4 ;;;; This software is part of the SBCL system. See the README file for
7 ;;;; This software is derived from the CMU CL system, which was
8 ;;;; written at Carnegie Mellon University and released into the
9 ;;;; public domain. The software is in the public domain and is
10 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
11 ;;;; files for more information.
17 ;;; Return the innermost cleanup enclosing NODE, or NIL if there is
18 ;;; none in its function. If NODE has no cleanup, but is in a LET,
19 ;;; then we must still check the environment that the call is in.
20 (defun node-enclosing-cleanup (node)
21 (declare (type node node))
22 (do ((lexenv (node-lexenv node)
23 (lambda-call-lexenv (lexenv-lambda lexenv))))
25 (let ((cup (lexenv-cleanup lexenv)))
26 (when cup (return cup)))))
28 ;;; Convert the FORM in a block inserted between BLOCK1 and BLOCK2 as
29 ;;; an implicit MV-PROG1. The inserted block is returned. NODE is used
30 ;;; for IR1 context when converting the form. Note that the block is
31 ;;; not assigned a number, and is linked into the DFO at the
32 ;;; beginning. We indicate that we have trashed the DFO by setting
33 ;;; COMPONENT-REANALYZE. If CLEANUP is supplied, then convert with
35 (defun insert-cleanup-code (block1 block2 node form &optional cleanup)
36 (declare (type cblock block1 block2) (type node node)
37 (type (or cleanup null) cleanup))
38 (setf (component-reanalyze (block-component block1)) t)
39 (with-ir1-environment-from-node node
40 (let* ((start (make-continuation))
41 (block (continuation-starts-block start))
42 (cont (make-continuation))
44 (make-lexenv :cleanup cleanup)
46 (change-block-successor block1 block2 block)
47 (link-blocks block block2)
48 (ir1-convert start cont form)
49 (setf (block-last block) (continuation-use cont))
52 ;;;; continuation use hacking
54 ;;; Return a list of all the nodes which use Cont.
55 (declaim (ftype (function (continuation) list) find-uses))
56 (defun find-uses (cont)
57 (ecase (continuation-kind cont)
58 ((:block-start :deleted-block-start)
59 (block-start-uses (continuation-block cont)))
60 (:inside-block (list (continuation-use cont)))
64 ;;; Update continuation use information so that NODE is no longer a
65 ;;; use of its CONT. If the old continuation doesn't start its block,
66 ;;; then we don't update the BLOCK-START-USES, since it will be
67 ;;; deleted when we are done.
69 ;;; Note: if you call this function, you may have to do a
70 ;;; REOPTIMIZE-CONTINUATION to inform IR1 optimization that something
72 (declaim (ftype (function (node) (values)) delete-continuation-use))
73 (defun delete-continuation-use (node)
74 (let* ((cont (node-cont node))
75 (block (continuation-block cont)))
76 (ecase (continuation-kind cont)
78 ((:block-start :deleted-block-start)
79 (let ((uses (delete node (block-start-uses block))))
80 (setf (block-start-uses block) uses)
81 (setf (continuation-use cont)
82 (if (cdr uses) nil (car uses)))))
84 (setf (continuation-kind cont) :unused)
85 (setf (continuation-block cont) nil)
86 (setf (continuation-use cont) nil)
87 (setf (continuation-next cont) nil)))
88 (setf (node-cont node) nil))
91 ;;; Update continuation use information so that NODE uses CONT. If
92 ;;; CONT is :UNUSED, then we set its block to NODE's NODE-BLOCK (which
95 ;;; Note: if you call this function, you may have to do a
96 ;;; REOPTIMIZE-CONTINUATION to inform IR1 optimization that something
98 (declaim (ftype (function (node continuation) (values)) add-continuation-use))
99 (defun add-continuation-use (node cont)
100 (aver (not (node-cont node)))
101 (let ((block (continuation-block cont)))
102 (ecase (continuation-kind cont)
106 (let ((block (node-block node)))
108 (setf (continuation-block cont) block))
109 (setf (continuation-kind cont) :inside-block)
110 (setf (continuation-use cont) node))
111 ((:block-start :deleted-block-start)
112 (let ((uses (cons node (block-start-uses block))))
113 (setf (block-start-uses block) uses)
114 (setf (continuation-use cont)
115 (if (cdr uses) nil (car uses)))))))
116 (setf (node-cont node) cont)
119 ;;; Return true if CONT is the NODE-CONT for NODE and CONT is
120 ;;; transferred to immediately after the evaluation of NODE.
121 (defun immediately-used-p (cont node)
122 (declare (type continuation cont) (type node node))
123 (and (eq (node-cont node) cont)
124 (not (eq (continuation-kind cont) :deleted))
125 (let ((cblock (continuation-block cont))
126 (nblock (node-block node)))
127 (or (eq cblock nblock)
128 (let ((succ (block-succ nblock)))
129 (and (= (length succ) 1)
130 (eq (first succ) cblock)))))))
132 ;;;; continuation substitution
134 ;;; In OLD's DEST, replace OLD with NEW. NEW's DEST must initially be
135 ;;; NIL. When we are done, we call FLUSH-DEST on OLD to clear its DEST
136 ;;; and to note potential optimization opportunities.
137 (defun substitute-continuation (new old)
138 (declare (type continuation old new))
139 (aver (not (continuation-dest new)))
140 (let ((dest (continuation-dest old)))
143 (cif (setf (if-test dest) new))
144 (cset (setf (set-value dest) new))
145 (creturn (setf (return-result dest) new))
146 (exit (setf (exit-value dest) new))
148 (if (eq old (basic-combination-fun dest))
149 (setf (basic-combination-fun dest) new)
150 (setf (basic-combination-args dest)
151 (nsubst new old (basic-combination-args dest))))))
154 (setf (continuation-dest new) dest)
155 (setf (continuation-%externally-checkable-type new) nil))
158 ;;; Replace all uses of OLD with uses of NEW, where NEW has an
159 ;;; arbitary number of uses. If NEW will end up with more than one
160 ;;; use, then we must arrange for it to start a block if it doesn't
162 (defun substitute-continuation-uses (new old)
163 (declare (type continuation old new))
164 (unless (and (eq (continuation-kind new) :unused)
165 (eq (continuation-kind old) :inside-block))
166 (ensure-block-start new))
169 (delete-continuation-use node)
170 (add-continuation-use node new))
171 (dolist (lexenv-use (continuation-lexenv-uses old))
172 (setf (cadr lexenv-use) new))
174 (reoptimize-continuation new)
177 ;;;; block starting/creation
179 ;;; Return the block that CONT is the start of, making a block if
180 ;;; necessary. This function is called by IR1 translators which may
181 ;;; cause a continuation to be used more than once. Every continuation
182 ;;; which may be used more than once must start a block by the time
183 ;;; that anyone does a USE-CONTINUATION on it.
185 ;;; We also throw the block into the next/prev list for the
186 ;;; *CURRENT-COMPONENT* so that we keep track of which blocks we have
188 (defun continuation-starts-block (cont)
189 (declare (type continuation cont))
190 (ecase (continuation-kind cont)
192 (aver (not (continuation-block cont)))
193 (let* ((head (component-head *current-component*))
194 (next (block-next head))
195 (new-block (make-block cont)))
196 (setf (block-next new-block) next
197 (block-prev new-block) head
198 (block-prev next) new-block
199 (block-next head) new-block
200 (continuation-block cont) new-block
201 (continuation-use cont) nil
202 (continuation-kind cont) :block-start)
205 (continuation-block cont))))
207 ;;; Ensure that CONT is the start of a block (or deleted) so that
208 ;;; the use set can be freely manipulated.
209 ;;; -- If the continuation is :UNUSED or is :INSIDE-BLOCK and the
210 ;;; CONT of LAST in its block, then we make it the start of a new
212 ;;; -- If the continuation is :INSIDE-BLOCK inside a block, then we
213 ;;; split the block using Node-Ends-Block, which makes the
214 ;;; continuation be a :BLOCK-START.
215 (defun ensure-block-start (cont)
216 (declare (type continuation cont))
217 (let ((kind (continuation-kind cont)))
219 ((:deleted :block-start :deleted-block-start))
220 ((:unused :inside-block)
221 (let ((block (continuation-block cont)))
222 (cond ((or (eq kind :unused)
223 (eq (node-cont (block-last block)) cont))
224 (setf (continuation-block cont)
225 (make-block-key :start cont
227 :start-uses (find-uses cont)))
228 (setf (continuation-kind cont) :deleted-block-start))
230 (node-ends-block (continuation-use cont))))))))
233 ;;;; miscellaneous shorthand functions
235 ;;; Return the home (i.e. enclosing non-LET) CLAMBDA for NODE. Since
236 ;;; the LEXENV-LAMBDA may be deleted, we must chain up the
237 ;;; LAMBDA-CALL-LEXENV thread until we find a CLAMBDA that isn't
238 ;;; deleted, and then return its home.
239 (defun node-home-lambda (node)
240 (declare (type node node))
241 (do ((fun (lexenv-lambda (node-lexenv node))
242 (lexenv-lambda (lambda-call-lexenv fun))))
243 ((not (eq (functional-kind fun) :deleted))
245 (when (eq (lambda-home fun) fun)
248 (defun node-block (node)
249 (declare (type node node))
250 (the cblock (continuation-block (node-prev node))))
251 (defun node-component (node)
252 (declare (type node node))
253 (block-component (node-block node)))
254 (defun node-physenv (node)
255 (declare (type node node))
256 (the physenv (lambda-physenv (node-home-lambda node))))
258 (defun lambda-block (clambda)
259 (declare (type clambda clambda))
260 (node-block (lambda-bind clambda)))
261 (defun lambda-component (clambda)
262 (block-component (lambda-block clambda)))
264 ;;; Return the enclosing cleanup for environment of the first or last
266 (defun block-start-cleanup (block)
267 (declare (type cblock block))
268 (node-enclosing-cleanup (continuation-next (block-start block))))
269 (defun block-end-cleanup (block)
270 (declare (type cblock block))
271 (node-enclosing-cleanup (block-last block)))
273 ;;; Return the non-LET LAMBDA that holds BLOCK's code, or NIL
274 ;;; if there is none.
276 ;;; There can legitimately be no home lambda in dead code early in the
277 ;;; IR1 conversion process, e.g. when IR1-converting the SETQ form in
278 ;;; (BLOCK B (RETURN-FROM B) (SETQ X 3))
279 ;;; where the block is just a placeholder during parsing and doesn't
280 ;;; actually correspond to code which will be written anywhere.
281 (defun block-home-lambda-or-null (block)
282 (declare (type cblock block))
283 (if (node-p (block-last block))
284 ;; This is the old CMU CL way of doing it.
285 (node-home-lambda (block-last block))
286 ;; Now that SBCL uses this operation more aggressively than CMU
287 ;; CL did, the old CMU CL way of doing it can fail in two ways.
288 ;; 1. It can fail in a few cases even when a meaningful home
289 ;; lambda exists, e.g. in IR1-CONVERT of one of the legs of
291 ;; 2. It can fail when converting a form which is born orphaned
292 ;; so that it never had a meaningful home lambda, e.g. a form
293 ;; which follows a RETURN-FROM or GO form.
294 (let ((pred-list (block-pred block)))
295 ;; To deal with case 1, we reason that
296 ;; previous-in-target-execution-order blocks should be in the
297 ;; same lambda, and that they seem in practice to be
298 ;; previous-in-compilation-order blocks too, so we look back
299 ;; to find one which is sufficiently initialized to tell us
300 ;; what the home lambda is.
302 ;; We could get fancy about this, flooding through the
303 ;; graph of all the previous blocks, but in practice it
304 ;; seems to work just to grab the first previous block and
306 (node-home-lambda (block-last (first pred-list)))
307 ;; In case 2, we end up with an empty PRED-LIST and
308 ;; have to punt: There's no home lambda.
311 ;;; Return the non-LET LAMBDA that holds BLOCK's code.
312 (defun block-home-lambda (block)
314 (block-home-lambda-or-null block)))
316 ;;; Return the IR1 physical environment for BLOCK.
317 (defun block-physenv (block)
318 (declare (type cblock block))
319 (lambda-physenv (block-home-lambda block)))
321 ;;; Return the Top Level Form number of PATH, i.e. the ordinal number
322 ;;; of its original source's top level form in its compilation unit.
323 (defun source-path-tlf-number (path)
324 (declare (list path))
327 ;;; Return the (reversed) list for the PATH in the original source
328 ;;; (with the Top Level Form number last).
329 (defun source-path-original-source (path)
330 (declare (list path) (inline member))
331 (cddr (member 'original-source-start path :test #'eq)))
333 ;;; Return the Form Number of PATH's original source inside the Top
334 ;;; Level Form that contains it. This is determined by the order that
335 ;;; we walk the subforms of the top level source form.
336 (defun source-path-form-number (path)
337 (declare (list path) (inline member))
338 (cadr (member 'original-source-start path :test #'eq)))
340 ;;; Return a list of all the enclosing forms not in the original
341 ;;; source that converted to get to this form, with the immediate
342 ;;; source for node at the start of the list.
343 (defun source-path-forms (path)
344 (subseq path 0 (position 'original-source-start path)))
346 ;;; Return the innermost source form for NODE.
347 (defun node-source-form (node)
348 (declare (type node node))
349 (let* ((path (node-source-path node))
350 (forms (source-path-forms path)))
353 (values (find-original-source path)))))
355 ;;; Return NODE-SOURCE-FORM, T if continuation has a single use,
356 ;;; otherwise NIL, NIL.
357 (defun continuation-source (cont)
358 (let ((use (continuation-use cont)))
360 (values (node-source-form use) t)
363 ;;; Return the LAMBDA that is CONT's home, or NIL if there is none.
364 (defun continuation-home-lambda-or-null (cont)
365 ;; KLUDGE: This function is a post-CMU-CL hack by WHN, and this
366 ;; implementation might not be quite right, or might be uglier than
367 ;; necessary. It appears that the original Python never found a need
368 ;; to do this operation. The obvious things based on
369 ;; NODE-HOME-LAMBDA of CONTINUATION-USE usually work; then if that
370 ;; fails, BLOCK-HOME-LAMBDA of CONTINUATION-BLOCK works, given that
371 ;; we generalize it enough to grovel harder when the simple CMU CL
372 ;; approach fails, and furthermore realize that in some exceptional
373 ;; cases it might return NIL. -- WHN 2001-12-04
374 (cond ((continuation-use cont)
375 (node-home-lambda (continuation-use cont)))
376 ((continuation-block cont)
377 (block-home-lambda-or-null (continuation-block cont)))
379 (bug "confused about home lambda for ~S"))))
381 ;;; Return the LAMBDA that is CONT's home.
382 (defun continuation-home-lambda (cont)
384 (continuation-home-lambda-or-null cont)))
386 ;;; Return a new LEXENV just like DEFAULT except for the specified
387 ;;; slot values. Values for the alist slots are NCONCed to the
388 ;;; beginning of the current value, rather than replacing it entirely.
389 (defun make-lexenv (&key (default *lexenv*)
390 funs vars blocks tags type-restrictions options
391 (lambda (lexenv-lambda default))
392 (cleanup (lexenv-cleanup default))
393 (policy (lexenv-policy default)))
394 (macrolet ((frob (var slot)
395 `(let ((old (,slot default)))
399 (internal-make-lexenv
400 (frob funs lexenv-funs)
401 (frob vars lexenv-vars)
402 (frob blocks lexenv-blocks)
403 (frob tags lexenv-tags)
404 (frob type-restrictions lexenv-type-restrictions)
405 lambda cleanup policy
406 (frob options lexenv-options))))
408 ;;; Makes a LEXENV, suitable for using in a MACROLET introduced
410 (defun make-restricted-lexenv (lexenv)
411 (flet ((fun-good-p (fun)
412 (destructuring-bind (name . thing) fun
413 (declare (ignore name))
417 (cons (aver (eq (car thing) 'macro))
420 (destructuring-bind (name . thing) var
421 (declare (ignore name))
424 (cons (aver (eq (car thing) 'macro))
426 (heap-alien-info nil)))))
427 (internal-make-lexenv
428 (remove-if-not #'fun-good-p (lexenv-funs lexenv))
429 (remove-if-not #'var-good-p (lexenv-vars lexenv))
432 (lexenv-type-restrictions lexenv) ; XXX
435 (lexenv-policy lexenv)
439 ;;;; flow/DFO/component hackery
441 ;;; Join BLOCK1 and BLOCK2.
442 (defun link-blocks (block1 block2)
443 (declare (type cblock block1 block2))
444 (setf (block-succ block1)
445 (if (block-succ block1)
446 (%link-blocks block1 block2)
448 (push block1 (block-pred block2))
450 (defun %link-blocks (block1 block2)
451 (declare (type cblock block1 block2) (inline member))
452 (let ((succ1 (block-succ block1)))
453 (aver (not (member block2 succ1 :test #'eq)))
454 (cons block2 succ1)))
456 ;;; This is like LINK-BLOCKS, but we separate BLOCK1 and BLOCK2. If
457 ;;; this leaves a successor with a single predecessor that ends in an
458 ;;; IF, then set BLOCK-TEST-MODIFIED so that any test constraint will
459 ;;; now be able to be propagated to the successor.
460 (defun unlink-blocks (block1 block2)
461 (declare (type cblock block1 block2))
462 (let ((succ1 (block-succ block1)))
463 (if (eq block2 (car succ1))
464 (setf (block-succ block1) (cdr succ1))
465 (do ((succ (cdr succ1) (cdr succ))
467 ((eq (car succ) block2)
468 (setf (cdr prev) (cdr succ)))
471 (let ((new-pred (delq block1 (block-pred block2))))
472 (setf (block-pred block2) new-pred)
473 (when (and new-pred (null (rest new-pred)))
474 (let ((pred-block (first new-pred)))
475 (when (if-p (block-last pred-block))
476 (setf (block-test-modified pred-block) t)))))
479 ;;; Swing the succ/pred link between BLOCK and OLD to be between BLOCK
480 ;;; and NEW. If BLOCK ends in an IF, then we have to fix up the
481 ;;; consequent/alternative blocks to point to NEW. We also set
482 ;;; BLOCK-TEST-MODIFIED so that any test constraint will be applied to
483 ;;; the new successor.
484 (defun change-block-successor (block old new)
485 (declare (type cblock new old block) (inline member))
486 (unlink-blocks block old)
487 (let ((last (block-last block))
488 (comp (block-component block)))
489 (setf (component-reanalyze comp) t)
492 (setf (block-test-modified block) t)
493 (let* ((succ-left (block-succ block))
494 (new (if (and (eq new (component-tail comp))
498 (unless (member new succ-left :test #'eq)
499 (link-blocks block new))
500 (macrolet ((frob (slot)
501 `(when (eq (,slot last) old)
502 (setf (,slot last) new))))
504 (frob if-alternative)
505 (when (eq (if-consequent last)
506 (if-alternative last))
507 (setf (component-reoptimize (block-component block)) t)))))
509 (unless (member new (block-succ block) :test #'eq)
510 (link-blocks block new)))))
514 ;;; Unlink a block from the next/prev chain. We also null out the
516 (declaim (ftype (function (cblock) (values)) remove-from-dfo))
517 (defun remove-from-dfo (block)
518 (let ((next (block-next block))
519 (prev (block-prev block)))
520 (setf (block-component block) nil)
521 (setf (block-next prev) next)
522 (setf (block-prev next) prev))
525 ;;; Add BLOCK to the next/prev chain following AFTER. We also set the
526 ;;; COMPONENT to be the same as for AFTER.
527 (defun add-to-dfo (block after)
528 (declare (type cblock block after))
529 (let ((next (block-next after))
530 (comp (block-component after)))
531 (aver (not (eq (component-kind comp) :deleted)))
532 (setf (block-component block) comp)
533 (setf (block-next after) block)
534 (setf (block-prev block) after)
535 (setf (block-next block) next)
536 (setf (block-prev next) block))
539 ;;; Set the FLAG for all the blocks in COMPONENT to NIL, except for
540 ;;; the head and tail which are set to T.
541 (declaim (ftype (function (component) (values)) clear-flags))
542 (defun clear-flags (component)
543 (let ((head (component-head component))
544 (tail (component-tail component)))
545 (setf (block-flag head) t)
546 (setf (block-flag tail) t)
547 (do-blocks (block component)
548 (setf (block-flag block) nil)))
551 ;;; Make a component with no blocks in it. The BLOCK-FLAG is initially
552 ;;; true in the head and tail blocks.
553 (declaim (ftype (function nil component) make-empty-component))
554 (defun make-empty-component ()
555 (let* ((head (make-block-key :start nil :component nil))
556 (tail (make-block-key :start nil :component nil))
557 (res (make-component :head head :tail tail)))
558 (setf (block-flag head) t)
559 (setf (block-flag tail) t)
560 (setf (block-component head) res)
561 (setf (block-component tail) res)
562 (setf (block-next head) tail)
563 (setf (block-prev tail) head)
566 ;;; Make NODE the LAST node in its block, splitting the block if necessary.
567 ;;; The new block is added to the DFO immediately following NODE's block.
568 (defun node-ends-block (node)
569 (declare (type node node))
570 (let* ((block (node-block node))
571 (start (node-cont node))
572 (last (block-last block))
573 (last-cont (node-cont last)))
574 (unless (eq last node)
575 (aver (and (eq (continuation-kind start) :inside-block)
576 (not (block-delete-p block))))
577 (let* ((succ (block-succ block))
579 (make-block-key :start start
580 :component (block-component block)
581 :start-uses (list (continuation-use start))
582 :succ succ :last last)))
583 (setf (continuation-kind start) :block-start)
586 (cons new-block (remove block (block-pred b)))))
587 (setf (block-succ block) ())
588 (setf (block-last block) node)
589 (link-blocks block new-block)
590 (add-to-dfo new-block block)
591 (setf (component-reanalyze (block-component block)) t)
593 (do ((cont start (node-cont (continuation-next cont))))
595 (when (eq (continuation-kind last-cont) :inside-block)
596 (setf (continuation-block last-cont) new-block)))
597 (setf (continuation-block cont) new-block))
599 (setf (block-type-asserted block) t)
600 (setf (block-test-modified block) t))))
606 ;;; Deal with deleting the last (read) reference to a LAMBDA-VAR.
607 (defun delete-lambda-var (leaf)
608 (declare (type lambda-var leaf))
610 ;; Iterate over all local calls flushing the corresponding argument,
611 ;; allowing the computation of the argument to be deleted. We also
612 ;; mark the LET for reoptimization, since it may be that we have
613 ;; deleted its last variable.
614 (let* ((fun (lambda-var-home leaf))
615 (n (position leaf (lambda-vars fun))))
616 (dolist (ref (leaf-refs fun))
617 (let* ((cont (node-cont ref))
618 (dest (continuation-dest cont)))
619 (when (and (combination-p dest)
620 (eq (basic-combination-fun dest) cont)
621 (eq (basic-combination-kind dest) :local))
622 (let* ((args (basic-combination-args dest))
624 (reoptimize-continuation arg)
626 (setf (elt args n) nil))))))
628 ;; The LAMBDA-VAR may still have some SETs, but this doesn't cause
629 ;; too much difficulty, since we can efficiently implement
630 ;; write-only variables. We iterate over the SETs, marking their
631 ;; blocks for dead code flushing, since we can delete SETs whose
633 (dolist (set (lambda-var-sets leaf))
634 (setf (block-flush-p (node-block set)) t))
638 ;;; Note that something interesting has happened to VAR.
639 (defun reoptimize-lambda-var (var)
640 (declare (type lambda-var var))
641 (let ((fun (lambda-var-home var)))
642 ;; We only deal with LET variables, marking the corresponding
643 ;; initial value arg as needing to be reoptimized.
644 (when (and (eq (functional-kind fun) :let)
646 (do ((args (basic-combination-args
649 (first (leaf-refs fun)))))
651 (vars (lambda-vars fun) (cdr vars)))
653 (reoptimize-continuation (car args))))))
656 ;;; Delete a function that has no references. This need only be called
657 ;;; on functions that never had any references, since otherwise
658 ;;; DELETE-REF will handle the deletion.
659 (defun delete-functional (fun)
660 (aver (and (null (leaf-refs fun))
661 (not (functional-entry-fun fun))))
663 (optional-dispatch (delete-optional-dispatch fun))
664 (clambda (delete-lambda fun)))
667 ;;; Deal with deleting the last reference to a CLAMBDA. Since there is
668 ;;; only one way into a CLAMBDA, deleting the last reference to a
669 ;;; CLAMBDA ensures that there is no way to reach any of the code in
670 ;;; it. So we just set the FUNCTIONAL-KIND for FUN and its LETs to
671 ;;; :DELETED, causing IR1 optimization to delete blocks in that
673 (defun delete-lambda (clambda)
674 (declare (type clambda clambda))
675 (let ((original-kind (functional-kind clambda))
676 (bind (lambda-bind clambda)))
677 (aver (not (member original-kind '(:deleted :optional :toplevel))))
678 (aver (not (functional-has-external-references-p clambda)))
679 (setf (functional-kind clambda) :deleted)
680 (setf (lambda-bind clambda) nil)
681 (dolist (let (lambda-lets clambda))
682 (setf (lambda-bind let) nil)
683 (setf (functional-kind let) :deleted))
685 ;; (The IF test is (FUNCTIONAL-SOMEWHAT-LETLIKE-P CLAMBDA), except
686 ;; that we're using the old value of the KIND slot, not the
687 ;; current slot value, which has now been set to :DELETED.)
688 (if (member original-kind '(:let :mv-let :assignment))
689 (let ((home (lambda-home clambda)))
690 (setf (lambda-lets home) (delete clambda (lambda-lets home))))
691 ;; If the function isn't a LET, we unlink the function head
692 ;; and tail from the component head and tail to indicate that
693 ;; the code is unreachable. We also delete the function from
694 ;; COMPONENT-LAMBDAS (it won't be there before local call
695 ;; analysis, but no matter.) If the lambda was never
696 ;; referenced, we give a note.
697 (let* ((bind-block (node-block bind))
698 (component (block-component bind-block))
699 (return (lambda-return clambda)))
700 (dolist (ref (lambda-refs clambda))
701 (let ((home (node-home-lambda ref)))
702 (aver (eq home clambda))))
703 (unless (leaf-ever-used clambda)
704 (let ((*compiler-error-context* bind))
705 (compiler-note "deleting unused function~:[.~;~:*~% ~S~]"
706 (leaf-debug-name clambda))))
707 (unlink-blocks (component-head component) bind-block)
709 (unlink-blocks (node-block return) (component-tail component)))
710 (setf (component-reanalyze component) t)
711 (let ((tails (lambda-tail-set clambda)))
712 (setf (tail-set-funs tails)
713 (delete clambda (tail-set-funs tails)))
714 (setf (lambda-tail-set clambda) nil))
715 (setf (component-lambdas component)
716 (delete clambda (component-lambdas component)))))
718 ;; If the lambda is an XEP, then we null out the ENTRY-FUN in its
719 ;; ENTRY-FUN so that people will know that it is not an entry
721 (when (eq original-kind :external)
722 (let ((fun (functional-entry-fun clambda)))
723 (setf (functional-entry-fun fun) nil)
724 (when (optional-dispatch-p fun)
725 (delete-optional-dispatch fun)))))
729 ;;; Deal with deleting the last reference to an OPTIONAL-DISPATCH. We
730 ;;; have to be a bit more careful than with lambdas, since DELETE-REF
731 ;;; is used both before and after local call analysis. Afterward, all
732 ;;; references to still-existing OPTIONAL-DISPATCHes have been moved
733 ;;; to the XEP, leaving it with no references at all. So we look at
734 ;;; the XEP to see whether an optional-dispatch is still really being
735 ;;; used. But before local call analysis, there are no XEPs, and all
736 ;;; references are direct.
738 ;;; When we do delete the OPTIONAL-DISPATCH, we grovel all of its
739 ;;; entry-points, making them be normal lambdas, and then deleting the
740 ;;; ones with no references. This deletes any e-p lambdas that were
741 ;;; either never referenced, or couldn't be deleted when the last
742 ;;; reference was deleted (due to their :OPTIONAL kind.)
744 ;;; Note that the last optional entry point may alias the main entry,
745 ;;; so when we process the main entry, its KIND may have been changed
746 ;;; to NIL or even converted to a LETlike value.
747 (defun delete-optional-dispatch (leaf)
748 (declare (type optional-dispatch leaf))
749 (let ((entry (functional-entry-fun leaf)))
750 (unless (and entry (leaf-refs entry))
751 (aver (or (not entry) (eq (functional-kind entry) :deleted)))
752 (setf (functional-kind leaf) :deleted)
755 (unless (eq (functional-kind fun) :deleted)
756 (aver (eq (functional-kind fun) :optional))
757 (setf (functional-kind fun) nil)
758 (let ((refs (leaf-refs fun)))
762 (or (maybe-let-convert fun)
763 (maybe-convert-to-assignment fun)))
765 (maybe-convert-to-assignment fun)))))))
767 (dolist (ep (optional-dispatch-entry-points leaf))
769 (when (optional-dispatch-more-entry leaf)
770 (frob (optional-dispatch-more-entry leaf)))
771 (let ((main (optional-dispatch-main-entry leaf)))
772 (when (eq (functional-kind main) :optional)
777 ;;; Do stuff to delete the semantic attachments of a REF node. When
778 ;;; this leaves zero or one reference, we do a type dispatch off of
779 ;;; the leaf to determine if a special action is appropriate.
780 (defun delete-ref (ref)
781 (declare (type ref ref))
782 (let* ((leaf (ref-leaf ref))
783 (refs (delete ref (leaf-refs leaf))))
784 (setf (leaf-refs leaf) refs)
789 (delete-lambda-var leaf))
791 (ecase (functional-kind leaf)
792 ((nil :let :mv-let :assignment :escape :cleanup)
793 (aver (null (functional-entry-fun leaf)))
794 (delete-lambda leaf))
796 (delete-lambda leaf))
797 ((:deleted :optional))))
799 (unless (eq (functional-kind leaf) :deleted)
800 (delete-optional-dispatch leaf)))))
803 (clambda (or (maybe-let-convert leaf)
804 (maybe-convert-to-assignment leaf)))
805 (lambda-var (reoptimize-lambda-var leaf))))
808 (clambda (maybe-convert-to-assignment leaf))))))
812 ;;; This function is called by people who delete nodes; it provides a
813 ;;; way to indicate that the value of a continuation is no longer
814 ;;; used. We null out the CONTINUATION-DEST, set FLUSH-P in the blocks
815 ;;; containing uses of CONT and set COMPONENT-REOPTIMIZE. If the PREV
816 ;;; of the use is deleted, then we blow off reoptimization.
818 ;;; If the continuation is :DELETED, then we don't do anything, since
819 ;;; all semantics have already been flushed. :DELETED-BLOCK-START
820 ;;; start continuations are treated just like :BLOCK-START; it is
821 ;;; possible that the continuation may be given a new dest (e.g. by
822 ;;; SUBSTITUTE-CONTINUATION), so we don't want to delete it.
823 (defun flush-dest (cont)
824 (declare (type continuation cont))
826 (unless (eq (continuation-kind cont) :deleted)
827 (aver (continuation-dest cont))
828 (setf (continuation-dest cont) nil)
829 (setf (continuation-%externally-checkable-type cont) nil)
831 (let ((prev (node-prev use)))
832 (unless (eq (continuation-kind prev) :deleted)
833 (let ((block (continuation-block prev)))
834 (setf (component-reoptimize (block-component block)) t)
835 (setf (block-attributep (block-flags block) flush-p type-asserted)
838 (setf (continuation-%type-check cont) nil)
842 ;;; Do a graph walk backward from BLOCK, marking all predecessor
843 ;;; blocks with the DELETE-P flag.
844 (defun mark-for-deletion (block)
845 (declare (type cblock block))
846 (unless (block-delete-p block)
847 (setf (block-delete-p block) t)
848 (setf (component-reanalyze (block-component block)) t)
849 (dolist (pred (block-pred block))
850 (mark-for-deletion pred)))
853 ;;; Delete CONT, eliminating both control and value semantics. We set
854 ;;; FLUSH-P and COMPONENT-REOPTIMIZE similarly to in FLUSH-DEST. Here
855 ;;; we must get the component from the use block, since the
856 ;;; continuation may be a :DELETED-BLOCK-START.
858 ;;; If CONT has DEST, then it must be the case that the DEST is
859 ;;; unreachable, since we can't compute the value desired. In this
860 ;;; case, we call MARK-FOR-DELETION to cause the DEST block and its
861 ;;; predecessors to tell people to ignore them, and to cause them to
862 ;;; be deleted eventually.
863 (defun delete-continuation (cont)
864 (declare (type continuation cont))
865 (aver (not (eq (continuation-kind cont) :deleted)))
868 (let ((prev (node-prev use)))
869 (unless (eq (continuation-kind prev) :deleted)
870 (let ((block (continuation-block prev)))
871 (setf (block-attributep (block-flags block) flush-p type-asserted) t)
872 (setf (component-reoptimize (block-component block)) t)))))
874 (let ((dest (continuation-dest cont)))
876 (let ((prev (node-prev dest)))
878 (not (eq (continuation-kind prev) :deleted)))
879 (let ((block (continuation-block prev)))
880 (unless (block-delete-p block)
881 (mark-for-deletion block)))))))
883 (setf (continuation-kind cont) :deleted)
884 (setf (continuation-dest cont) nil)
885 (setf (continuation-%externally-checkable-type cont) nil)
886 (setf (continuation-next cont) nil)
887 (setf (continuation-asserted-type cont) *empty-type*)
888 (setf (continuation-%derived-type cont) *empty-type*)
889 (setf (continuation-use cont) nil)
890 (setf (continuation-block cont) nil)
891 (setf (continuation-reoptimize cont) nil)
892 (setf (continuation-%type-check cont) nil)
893 (setf (continuation-info cont) nil)
897 ;;; This function does what is necessary to eliminate the code in it
898 ;;; from the IR1 representation. This involves unlinking it from its
899 ;;; predecessors and successors and deleting various node-specific
900 ;;; semantic information.
902 ;;; We mark the START as has having no next and remove the last node
903 ;;; from its CONT's uses. We also flush the DEST for all continuations
904 ;;; whose values are received by nodes in the block.
905 (defun delete-block (block)
906 (declare (type cblock block))
907 (aver (block-component block)) ; else block is already deleted!
908 (note-block-deletion block)
909 (setf (block-delete-p block) t)
911 (let* ((last (block-last block))
912 (cont (node-cont last)))
913 (delete-continuation-use last)
914 (if (eq (continuation-kind cont) :unused)
915 (delete-continuation cont)
916 (reoptimize-continuation cont)))
918 (dolist (b (block-pred block))
919 (unlink-blocks b block)
920 ;; In bug 147 the almost-all-blocks-have-a-successor invariant was
921 ;; broken when successors were deleted without setting the
922 ;; BLOCK-DELETE-P flags of their predececessors. Make sure that
923 ;; doesn't happen again.
924 (aver (not (and (null (block-succ b))
925 (not (block-delete-p b))
926 (not (eq b (component-head (block-component b))))))))
927 (dolist (b (block-succ block))
928 (unlink-blocks block b))
930 (do-nodes (node cont block)
932 (ref (delete-ref node))
934 (flush-dest (if-test node)))
935 ;; The next two cases serve to maintain the invariant that a LET
936 ;; always has a well-formed COMBINATION, REF and BIND. We delete
937 ;; the lambda whenever we delete any of these, but we must be
938 ;; careful that this LET has not already been partially deleted.
940 (when (and (eq (basic-combination-kind node) :local)
941 ;; Guards COMBINATION-LAMBDA agains the REF being deleted.
942 (continuation-use (basic-combination-fun node)))
943 (let ((fun (combination-lambda node)))
944 ;; If our REF was the second-to-last ref, and has been
945 ;; deleted, then FUN may be a LET for some other
947 (when (and (functional-letlike-p fun)
948 (eq (let-combination fun) node))
949 (delete-lambda fun))))
950 (flush-dest (basic-combination-fun node))
951 (dolist (arg (basic-combination-args node))
952 (when arg (flush-dest arg))))
954 (let ((lambda (bind-lambda node)))
955 (unless (eq (functional-kind lambda) :deleted)
956 (aver (functional-somewhat-letlike-p lambda))
957 (delete-lambda lambda))))
959 (let ((value (exit-value node))
960 (entry (exit-entry node)))
964 (setf (entry-exits entry)
965 (delete node (entry-exits entry))))))
967 (flush-dest (return-result node))
968 (delete-return node))
970 (flush-dest (set-value node))
971 (let ((var (set-var node)))
972 (setf (basic-var-sets var)
973 (delete node (basic-var-sets var))))))
975 (delete-continuation (node-prev node)))
977 (remove-from-dfo block)
980 ;;; Do stuff to indicate that the return node Node is being deleted.
981 ;;; We set the RETURN to NIL.
982 (defun delete-return (node)
983 (declare (type creturn node))
984 (let ((fun (return-lambda node)))
985 (aver (lambda-return fun))
986 (setf (lambda-return fun) nil))
989 ;;; If any of the VARS in FUN was never referenced and was not
990 ;;; declared IGNORE, then complain.
991 (defun note-unreferenced-vars (fun)
992 (declare (type clambda fun))
993 (dolist (var (lambda-vars fun))
994 (unless (or (leaf-ever-used var)
995 (lambda-var-ignorep var))
996 (let ((*compiler-error-context* (lambda-bind fun)))
997 (unless (policy *compiler-error-context* (= inhibit-warnings 3))
998 ;; ANSI section "3.2.5 Exceptional Situations in the Compiler"
999 ;; requires this to be no more than a STYLE-WARNING.
1000 (compiler-style-warn "The variable ~S is defined but never used."
1001 (leaf-debug-name var)))
1002 (setf (leaf-ever-used var) t)))) ; to avoid repeated warnings? -- WHN
1005 (defvar *deletion-ignored-objects* '(t nil))
1007 ;;; Return true if we can find OBJ in FORM, NIL otherwise. We bound
1008 ;;; our recursion so that we don't get lost in circular structures. We
1009 ;;; ignore the car of forms if they are a symbol (to prevent confusing
1010 ;;; function referencess with variables), and we also ignore anything
1012 (defun present-in-form (obj form depth)
1013 (declare (type (integer 0 20) depth))
1014 (cond ((= depth 20) nil)
1018 (let ((first (car form))
1020 (if (member first '(quote function))
1022 (or (and (not (symbolp first))
1023 (present-in-form obj first depth))
1024 (do ((l (cdr form) (cdr l))
1026 ((or (atom l) (> n 100))
1028 (declare (fixnum n))
1029 (when (present-in-form obj (car l) depth)
1032 ;;; This function is called on a block immediately before we delete
1033 ;;; it. We check to see whether any of the code about to die appeared
1034 ;;; in the original source, and emit a note if so.
1036 ;;; If the block was in a lambda is now deleted, then we ignore the
1037 ;;; whole block, since this case is picked off in DELETE-LAMBDA. We
1038 ;;; also ignore the deletion of CRETURN nodes, since it is somewhat
1039 ;;; reasonable for a function to not return, and there is a different
1040 ;;; note for that case anyway.
1042 ;;; If the actual source is an atom, then we use a bunch of heuristics
1043 ;;; to guess whether this reference really appeared in the original
1045 ;;; -- If a symbol, it must be interned and not a keyword.
1046 ;;; -- It must not be an easily introduced constant (T or NIL, a fixnum
1047 ;;; or a character.)
1048 ;;; -- The atom must be "present" in the original source form, and
1049 ;;; present in all intervening actual source forms.
1050 (defun note-block-deletion (block)
1051 (let ((home (block-home-lambda block)))
1052 (unless (eq (functional-kind home) :deleted)
1053 (do-nodes (node cont block)
1054 (let* ((path (node-source-path node))
1055 (first (first path)))
1056 (when (or (eq first 'original-source-start)
1058 (or (not (symbolp first))
1059 (let ((pkg (symbol-package first)))
1061 (not (eq pkg (symbol-package :end))))))
1062 (not (member first *deletion-ignored-objects*))
1063 (not (typep first '(or fixnum character)))
1065 (present-in-form first x 0))
1066 (source-path-forms path))
1067 (present-in-form first (find-original-source path)
1069 (unless (return-p node)
1070 (let ((*compiler-error-context* node))
1071 (compiler-note "deleting unreachable code")))
1075 ;;; Delete a node from a block, deleting the block if there are no
1076 ;;; nodes left. We remove the node from the uses of its CONT, but we
1077 ;;; don't deal with cleaning up any type-specific semantic
1078 ;;; attachments. If the CONT is :UNUSED after deleting this use, then
1079 ;;; we delete CONT. (Note :UNUSED is not the same as no uses. A
1080 ;;; continuation will only become :UNUSED if it was :INSIDE-BLOCK
1083 ;;; If the node is the last node, there must be exactly one successor.
1084 ;;; We link all of our precedessors to the successor and unlink the
1085 ;;; block. In this case, we return T, otherwise NIL. If no nodes are
1086 ;;; left, and the block is a successor of itself, then we replace the
1087 ;;; only node with a degenerate exit node. This provides a way to
1088 ;;; represent the bodyless infinite loop, given the prohibition on
1089 ;;; empty blocks in IR1.
1090 (defun unlink-node (node)
1091 (declare (type node node))
1092 (let* ((cont (node-cont node))
1093 (next (continuation-next cont))
1094 (prev (node-prev node))
1095 (block (continuation-block prev))
1096 (prev-kind (continuation-kind prev))
1097 (last (block-last block)))
1099 (unless (eq (continuation-kind cont) :deleted)
1100 (delete-continuation-use node)
1101 (when (eq (continuation-kind cont) :unused)
1102 (aver (not (continuation-dest cont)))
1103 (delete-continuation cont)))
1105 (setf (block-type-asserted block) t)
1106 (setf (block-test-modified block) t)
1108 (cond ((or (eq prev-kind :inside-block)
1109 (and (eq prev-kind :block-start)
1110 (not (eq node last))))
1111 (cond ((eq node last)
1112 (setf (block-last block) (continuation-use prev))
1113 (setf (continuation-next prev) nil))
1115 (setf (continuation-next prev) next)
1116 (setf (node-prev next) prev)))
1117 (setf (node-prev node) nil)
1120 (aver (eq prev-kind :block-start))
1121 (aver (eq node last))
1122 (let* ((succ (block-succ block))
1123 (next (first succ)))
1124 (aver (and succ (null (cdr succ))))
1126 ((member block succ)
1127 (with-ir1-environment-from-node node
1128 (let ((exit (make-exit))
1129 (dummy (make-continuation)))
1130 (setf (continuation-next prev) nil)
1131 (link-node-to-previous-continuation exit prev)
1132 (add-continuation-use exit dummy)
1133 (setf (block-last block) exit)))
1134 (setf (node-prev node) nil)
1137 (aver (eq (block-start-cleanup block)
1138 (block-end-cleanup block)))
1139 (unlink-blocks block next)
1140 (dolist (pred (block-pred block))
1141 (change-block-successor pred block next))
1142 (remove-from-dfo block)
1143 (cond ((continuation-dest prev)
1144 (setf (continuation-next prev) nil)
1145 (setf (continuation-kind prev) :deleted-block-start))
1147 (delete-continuation prev)))
1148 (setf (node-prev node) nil)
1151 ;;; Return true if NODE has been deleted, false if it is still a valid
1153 (defun node-deleted (node)
1154 (declare (type node node))
1155 (let ((prev (node-prev node)))
1157 (not (eq (continuation-kind prev) :deleted))
1158 (let ((block (continuation-block prev)))
1159 (and (block-component block)
1160 (not (block-delete-p block))))))))
1162 ;;; Delete all the blocks and functions in COMPONENT. We scan first
1163 ;;; marking the blocks as DELETE-P to prevent weird stuff from being
1164 ;;; triggered by deletion.
1165 (defun delete-component (component)
1166 (declare (type component component))
1167 (aver (null (component-new-functionals component)))
1168 (setf (component-kind component) :deleted)
1169 (do-blocks (block component)
1170 (setf (block-delete-p block) t))
1171 (dolist (fun (component-lambdas component))
1172 (setf (functional-kind fun) nil)
1173 (setf (functional-entry-fun fun) nil)
1174 (setf (leaf-refs fun) nil)
1175 (delete-functional fun))
1176 (do-blocks (block component)
1177 (delete-block block))
1180 ;;; Convert code of the form
1181 ;;; (FOO ... (FUN ...) ...)
1183 ;;; (FOO ... ... ...).
1184 ;;; In other words, replace the function combination FUN by its
1185 ;;; arguments. If there are any problems with doing this, use GIVE-UP
1186 ;;; to blow out of whatever transform called this. Note, as the number
1187 ;;; of arguments changes, the transform must be prepared to return a
1188 ;;; lambda with a new lambda-list with the correct number of
1190 (defun extract-fun-args (cont fun num-args)
1192 "If CONT is a call to FUN with NUM-ARGS args, change those arguments
1193 to feed directly to the continuation-dest of CONT, which must be
1195 (declare (type continuation cont)
1197 (type index num-args))
1198 (let ((outside (continuation-dest cont))
1199 (inside (continuation-use cont)))
1200 (aver (combination-p outside))
1201 (unless (combination-p inside)
1202 (give-up-ir1-transform))
1203 (let ((inside-fun (combination-fun inside)))
1204 (unless (eq (continuation-fun-name inside-fun) fun)
1205 (give-up-ir1-transform))
1206 (let ((inside-args (combination-args inside)))
1207 (unless (= (length inside-args) num-args)
1208 (give-up-ir1-transform))
1209 (let* ((outside-args (combination-args outside))
1210 (arg-position (position cont outside-args))
1211 (before-args (subseq outside-args 0 arg-position))
1212 (after-args (subseq outside-args (1+ arg-position))))
1213 (dolist (arg inside-args)
1214 (setf (continuation-dest arg) outside)
1215 (setf (continuation-%externally-checkable-type arg) nil))
1216 (setf (combination-args inside) nil)
1217 (setf (combination-args outside)
1218 (append before-args inside-args after-args))
1219 (change-ref-leaf (continuation-use inside-fun)
1220 (find-free-fun 'list "???"))
1221 (setf (combination-kind inside) :full)
1222 (setf (node-derived-type inside) *wild-type*)
1224 (setf (continuation-asserted-type cont) *wild-type*)
1229 ;;; Change the LEAF that a REF refers to.
1230 (defun change-ref-leaf (ref leaf)
1231 (declare (type ref ref) (type leaf leaf))
1232 (unless (eq (ref-leaf ref) leaf)
1233 (push ref (leaf-refs leaf))
1235 (setf (ref-leaf ref) leaf)
1236 (let ((ltype (leaf-type leaf)))
1237 (if (fun-type-p ltype)
1238 (setf (node-derived-type ref) ltype)
1239 (derive-node-type ref ltype)))
1240 (reoptimize-continuation (node-cont ref)))
1243 ;;; Change all REFS for OLD-LEAF to NEW-LEAF.
1244 (defun substitute-leaf (new-leaf old-leaf)
1245 (declare (type leaf new-leaf old-leaf))
1246 (dolist (ref (leaf-refs old-leaf))
1247 (change-ref-leaf ref new-leaf))
1250 ;;; like SUBSITUTE-LEAF, only there is a predicate on the REF to tell
1251 ;;; whether to substitute
1252 (defun substitute-leaf-if (test new-leaf old-leaf)
1253 (declare (type leaf new-leaf old-leaf) (type function test))
1254 (dolist (ref (leaf-refs old-leaf))
1255 (when (funcall test ref)
1256 (change-ref-leaf ref new-leaf)))
1259 ;;; Return a LEAF which represents the specified constant object. If
1260 ;;; the object is not in *CONSTANTS*, then we create a new constant
1261 ;;; LEAF and enter it.
1262 (defun find-constant (object)
1264 ;; FIXME: What is the significance of this test? ("things
1265 ;; that are worth uniquifying"?)
1266 '(or symbol number character instance))
1267 (or (gethash object *constants*)
1268 (setf (gethash object *constants*)
1269 (make-constant :value object
1270 :%source-name '.anonymous.
1271 :type (ctype-of object)
1272 :where-from :defined)))
1273 (make-constant :value object
1274 :%source-name '.anonymous.
1275 :type (ctype-of object)
1276 :where-from :defined)))
1278 ;;; If there is a non-local exit noted in ENTRY's environment that
1279 ;;; exits to CONT in that entry, then return it, otherwise return NIL.
1280 (defun find-nlx-info (entry cont)
1281 (declare (type entry entry) (type continuation cont))
1282 (let ((entry-cleanup (entry-cleanup entry)))
1283 (dolist (nlx (physenv-nlx-info (node-physenv entry)) nil)
1284 (when (and (eq (nlx-info-continuation nlx) cont)
1285 (eq (nlx-info-cleanup nlx) entry-cleanup))
1288 ;;;; functional hackery
1290 (declaim (ftype (function (functional) clambda) main-entry))
1291 (defun main-entry (functional)
1292 (etypecase functional
1293 (clambda functional)
1295 (optional-dispatch-main-entry functional))))
1297 ;;; RETURN true if FUNCTIONAL is a thing that can be treated like
1298 ;;; MV-BIND when it appears in an MV-CALL. All fixed arguments must be
1299 ;;; optional with null default and no SUPPLIED-P. There must be a
1300 ;;; &REST arg with no references.
1301 (declaim (ftype (function (functional) boolean) looks-like-an-mv-bind))
1302 (defun looks-like-an-mv-bind (functional)
1303 (and (optional-dispatch-p functional)
1304 (do ((arg (optional-dispatch-arglist functional) (cdr arg)))
1306 (let ((info (lambda-var-arg-info (car arg))))
1307 (unless info (return nil))
1308 (case (arg-info-kind info)
1310 (when (or (arg-info-supplied-p info) (arg-info-default info))
1313 (return (and (null (cdr arg)) (null (leaf-refs (car arg))))))
1317 ;;; Return true if function is an external entry point. This is true
1318 ;;; of normal XEPs (:EXTERNAL kind) and also of top level lambdas
1319 ;;; (:TOPLEVEL kind.)
1321 (declare (type functional fun))
1322 (not (null (member (functional-kind fun) '(:external :toplevel)))))
1324 ;;; If CONT's only use is a non-notinline global function reference,
1325 ;;; then return the referenced symbol, otherwise NIL. If NOTINLINE-OK
1326 ;;; is true, then we don't care if the leaf is NOTINLINE.
1327 (defun continuation-fun-name (cont &optional notinline-ok)
1328 (declare (type continuation cont))
1329 (let ((use (continuation-use cont)))
1331 (let ((leaf (ref-leaf use)))
1332 (if (and (global-var-p leaf)
1333 (eq (global-var-kind leaf) :global-function)
1334 (or (not (defined-fun-p leaf))
1335 (not (eq (defined-fun-inlinep leaf) :notinline))
1337 (leaf-source-name leaf)
1341 ;;; Return the source name of a combination. (This is an idiom
1342 ;;; which was used in CMU CL. I gather it always works. -- WHN)
1343 (defun combination-fun-source-name (combination)
1344 (let ((ref (continuation-use (combination-fun combination))))
1345 (leaf-source-name (ref-leaf ref))))
1347 ;;; Return the COMBINATION node that is the call to the LET FUN.
1348 (defun let-combination (fun)
1349 (declare (type clambda fun))
1350 (aver (functional-letlike-p fun))
1351 (continuation-dest (node-cont (first (leaf-refs fun)))))
1353 ;;; Return the initial value continuation for a LET variable, or NIL
1354 ;;; if there is none.
1355 (defun let-var-initial-value (var)
1356 (declare (type lambda-var var))
1357 (let ((fun (lambda-var-home var)))
1358 (elt (combination-args (let-combination fun))
1359 (position-or-lose var (lambda-vars fun)))))
1361 ;;; Return the LAMBDA that is called by the local CALL.
1362 (defun combination-lambda (call)
1363 (declare (type basic-combination call))
1364 (aver (eq (basic-combination-kind call) :local))
1365 (ref-leaf (continuation-use (basic-combination-fun call))))
1367 (defvar *inline-expansion-limit* 200
1369 "an upper limit on the number of inline function calls that will be expanded
1370 in any given code object (single function or block compilation)")
1372 ;;; Check whether NODE's component has exceeded its inline expansion
1373 ;;; limit, and warn if so, returning NIL.
1374 (defun inline-expansion-ok (node)
1375 (let ((expanded (incf (component-inline-expansions
1377 (node-block node))))))
1378 (cond ((> expanded *inline-expansion-limit*) nil)
1379 ((= expanded *inline-expansion-limit*)
1380 ;; FIXME: If the objective is to stop the recursive
1381 ;; expansion of inline functions, wouldn't it be more
1382 ;; correct to look back through surrounding expansions
1383 ;; (which are, I think, stored in the *CURRENT-PATH*, and
1384 ;; possibly stored elsewhere too) and suppress expansion
1385 ;; and print this warning when the function being proposed
1386 ;; for inline expansion is found there? (I don't like the
1387 ;; arbitrary numerical limit in principle, and I think
1388 ;; it'll be a nuisance in practice if we ever want the
1389 ;; compiler to be able to use WITH-COMPILATION-UNIT on
1390 ;; arbitrarily huge blocks of code. -- WHN)
1391 (let ((*compiler-error-context* node))
1392 (compiler-note "*INLINE-EXPANSION-LIMIT* (~W) was exceeded, ~
1393 probably trying to~% ~
1394 inline a recursive function."
1395 *inline-expansion-limit*))
1401 ;;; Apply a function to some arguments, returning a list of the values
1402 ;;; resulting of the evaluation. If an error is signalled during the
1403 ;;; application, then we produce a warning message using WARN-FUN and
1404 ;;; return NIL as our second value to indicate this. NODE is used as
1405 ;;; the error context for any error message, and CONTEXT is a string
1406 ;;; that is spliced into the warning.
1407 (declaim (ftype (function ((or symbol function) list node function string)
1408 (values list boolean))
1410 (defun careful-call (function args node warn-fun context)
1412 (multiple-value-list
1413 (handler-case (apply function args)
1415 (let ((*compiler-error-context* node))
1416 (funcall warn-fun "Lisp error during ~A:~%~A" context condition)
1417 (return-from careful-call (values nil nil))))))
1420 ;;; Variations of SPECIFIER-TYPE for parsing possibly wrong
1423 ((deffrob (basic careful compiler transform)
1425 (defun ,careful (specifier)
1426 (handler-case (,basic specifier)
1427 (simple-error (condition)
1428 (values nil (list* (simple-condition-format-control condition)
1429 (simple-condition-format-arguments condition))))))
1430 (defun ,compiler (specifier)
1431 (multiple-value-bind (type error-args) (,careful specifier)
1433 (apply #'compiler-error error-args))))
1434 (defun ,transform (specifier)
1435 (multiple-value-bind (type error-args) (,careful specifier)
1437 (apply #'give-up-ir1-transform
1439 (deffrob specifier-type careful-specifier-type compiler-specifier-type ir1-transform-specifier-type)
1440 (deffrob values-specifier-type careful-values-specifier-type compiler-values-specifier-type ir1-transform-values-specifier-type))
1443 ;;;; utilities used at run-time for parsing &KEY args in IR1
1445 ;;; This function is used by the result of PARSE-DEFTRANSFORM to find
1446 ;;; the continuation for the value of the &KEY argument KEY in the
1447 ;;; list of continuations ARGS. It returns the continuation if the
1448 ;;; keyword is present, or NIL otherwise. The legality and
1449 ;;; constantness of the keywords should already have been checked.
1450 (declaim (ftype (function (list keyword) (or continuation null))
1451 find-keyword-continuation))
1452 (defun find-keyword-continuation (args key)
1453 (do ((arg args (cddr arg)))
1455 (when (eq (continuation-value (first arg)) key)
1456 (return (second arg)))))
1458 ;;; This function is used by the result of PARSE-DEFTRANSFORM to
1459 ;;; verify that alternating continuations in ARGS are constant and
1460 ;;; that there is an even number of args.
1461 (declaim (ftype (function (list) boolean) check-key-args-constant))
1462 (defun check-key-args-constant (args)
1463 (do ((arg args (cddr arg)))
1465 (unless (and (rest arg)
1466 (constant-continuation-p (first arg)))
1469 ;;; This function is used by the result of PARSE-DEFTRANSFORM to
1470 ;;; verify that the list of continuations ARGS is a well-formed &KEY
1471 ;;; arglist and that only keywords present in the list KEYS are
1473 (declaim (ftype (function (list list) boolean) check-transform-keys))
1474 (defun check-transform-keys (args keys)
1475 (and (check-key-args-constant args)
1476 (do ((arg args (cddr arg)))
1478 (unless (member (continuation-value (first arg)) keys)
1483 ;;; Called by the expansion of the EVENT macro.
1484 (declaim (ftype (function (event-info (or node null)) *) %event))
1485 (defun %event (info node)
1486 (incf (event-info-count info))
1487 (when (and (>= (event-info-level info) *event-note-threshold*)
1488 (policy (or node *lexenv*)
1489 (= inhibit-warnings 0)))
1490 (let ((*compiler-error-context* node))
1491 (compiler-note (event-info-description info))))
1493 (let ((action (event-info-action info)))
1494 (when action (funcall action node))))