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))
157 ;;; Replace all uses of OLD with uses of NEW, where NEW has an
158 ;;; arbitary number of uses. If NEW will end up with more than one
159 ;;; use, then we must arrange for it to start a block if it doesn't
161 (defun substitute-continuation-uses (new old)
162 (declare (type continuation old new))
163 (unless (and (eq (continuation-kind new) :unused)
164 (eq (continuation-kind old) :inside-block))
165 (ensure-block-start new))
168 (delete-continuation-use node)
169 (add-continuation-use node new))
170 (dolist (lexenv-use (continuation-lexenv-uses old))
171 (setf (cadr lexenv-use) new))
173 (reoptimize-continuation new)
176 ;;;; block starting/creation
178 ;;; Return the block that CONT is the start of, making a block if
179 ;;; necessary. This function is called by IR1 translators which may
180 ;;; cause a continuation to be used more than once. Every continuation
181 ;;; which may be used more than once must start a block by the time
182 ;;; that anyone does a USE-CONTINUATION on it.
184 ;;; We also throw the block into the next/prev list for the
185 ;;; *CURRENT-COMPONENT* so that we keep track of which blocks we have
187 (defun continuation-starts-block (cont)
188 (declare (type continuation cont))
189 (ecase (continuation-kind cont)
191 (aver (not (continuation-block cont)))
192 (let* ((head (component-head *current-component*))
193 (next (block-next head))
194 (new-block (make-block cont)))
195 (setf (block-next new-block) next)
196 (setf (block-prev new-block) head)
197 (setf (block-prev next) new-block)
198 (setf (block-next head) new-block)
199 (setf (continuation-block cont) new-block)
200 (setf (continuation-use cont) nil)
201 (setf (continuation-kind cont) :block-start)
204 (continuation-block cont))))
206 ;;; Ensure that CONT is the start of a block (or deleted) so that
207 ;;; the use set can be freely manipulated.
208 ;;; -- If the continuation is :UNUSED or is :INSIDE-BLOCK and the
209 ;;; CONT of LAST in its block, then we make it the start of a new
211 ;;; -- If the continuation is :INSIDE-BLOCK inside a block, then we
212 ;;; split the block using Node-Ends-Block, which makes the
213 ;;; continuation be a :BLOCK-START.
214 (defun ensure-block-start (cont)
215 (declare (type continuation cont))
216 (let ((kind (continuation-kind cont)))
218 ((:deleted :block-start :deleted-block-start))
219 ((:unused :inside-block)
220 (let ((block (continuation-block cont)))
221 (cond ((or (eq kind :unused)
222 (eq (node-cont (block-last block)) cont))
223 (setf (continuation-block cont)
224 (make-block-key :start cont
226 :start-uses (find-uses cont)))
227 (setf (continuation-kind cont) :deleted-block-start))
229 (node-ends-block (continuation-use cont))))))))
232 ;;;; miscellaneous shorthand functions
234 ;;; Return the home (i.e. enclosing non-LET) CLAMBDA for NODE. Since
235 ;;; the LEXENV-LAMBDA may be deleted, we must chain up the
236 ;;; LAMBDA-CALL-LEXENV thread until we find a CLAMBDA that isn't
237 ;;; deleted, and then return its home.
238 (defun node-home-lambda (node)
239 (declare (type node node))
240 (do ((fun (lexenv-lambda (node-lexenv node))
241 (lexenv-lambda (lambda-call-lexenv fun))))
242 ((not (eq (functional-kind fun) :deleted))
244 (when (eq (lambda-home fun) fun)
247 (defun node-block (node)
248 (declare (type node node))
249 (the cblock (continuation-block (node-prev node))))
250 (defun node-component (node)
251 (declare (type node node))
252 (block-component (node-block node)))
253 (defun node-physenv (node)
254 (declare (type node node))
255 (the physenv (lambda-physenv (node-home-lambda node))))
257 (defun lambda-block (clambda)
258 (declare (type clambda clambda))
259 (node-block (lambda-bind clambda)))
260 (defun lambda-component (clambda)
261 (block-component (lambda-block clambda)))
263 ;;; Return the enclosing cleanup for environment of the first or last
265 (defun block-start-cleanup (block)
266 (declare (type cblock block))
267 (node-enclosing-cleanup (continuation-next (block-start block))))
268 (defun block-end-cleanup (block)
269 (declare (type cblock block))
270 (node-enclosing-cleanup (block-last block)))
272 ;;; Return the non-LET LAMBDA that holds BLOCK's code, or NIL
273 ;;; if there is none.
275 ;;; There can legitimately be no home lambda in dead code early in the
276 ;;; IR1 conversion process, e.g. when IR1-converting the SETQ form in
277 ;;; (BLOCK B (RETURN-FROM B) (SETQ X 3))
278 ;;; where the block is just a placeholder during parsing and doesn't
279 ;;; actually correspond to code which will be written anywhere.
280 (defun block-home-lambda-or-null (block)
281 (declare (type cblock block))
282 (if (node-p (block-last block))
283 ;; This is the old CMU CL way of doing it.
284 (node-home-lambda (block-last block))
285 ;; Now that SBCL uses this operation more aggressively than CMU
286 ;; CL did, the old CMU CL way of doing it can fail in two ways.
287 ;; 1. It can fail in a few cases even when a meaningful home
288 ;; lambda exists, e.g. in IR1-CONVERT of one of the legs of
290 ;; 2. It can fail when converting a form which is born orphaned
291 ;; so that it never had a meaningful home lambda, e.g. a form
292 ;; which follows a RETURN-FROM or GO form.
293 (let ((pred-list (block-pred block)))
294 ;; To deal with case 1, we reason that
295 ;; previous-in-target-execution-order blocks should be in the
296 ;; same lambda, and that they seem in practice to be
297 ;; previous-in-compilation-order blocks too, so we look back
298 ;; to find one which is sufficiently initialized to tell us
299 ;; what the home lambda is.
301 ;; We could get fancy about this, flooding through the
302 ;; graph of all the previous blocks, but in practice it
303 ;; seems to work just to grab the first previous block and
305 (node-home-lambda (block-last (first pred-list)))
306 ;; In case 2, we end up with an empty PRED-LIST and
307 ;; have to punt: There's no home lambda.
310 ;;; Return the non-LET LAMBDA that holds BLOCK's code.
311 (defun block-home-lambda (block)
313 (block-home-lambda-or-null block)))
315 ;;; Return the IR1 physical environment for BLOCK.
316 (defun block-physenv (block)
317 (declare (type cblock block))
318 (lambda-physenv (block-home-lambda block)))
320 ;;; Return the Top Level Form number of PATH, i.e. the ordinal number
321 ;;; of its original source's top level form in its compilation unit.
322 (defun source-path-tlf-number (path)
323 (declare (list path))
326 ;;; Return the (reversed) list for the PATH in the original source
327 ;;; (with the Top Level Form number last).
328 (defun source-path-original-source (path)
329 (declare (list path) (inline member))
330 (cddr (member 'original-source-start path :test #'eq)))
332 ;;; Return the Form Number of PATH's original source inside the Top
333 ;;; Level Form that contains it. This is determined by the order that
334 ;;; we walk the subforms of the top level source form.
335 (defun source-path-form-number (path)
336 (declare (list path) (inline member))
337 (cadr (member 'original-source-start path :test #'eq)))
339 ;;; Return a list of all the enclosing forms not in the original
340 ;;; source that converted to get to this form, with the immediate
341 ;;; source for node at the start of the list.
342 (defun source-path-forms (path)
343 (subseq path 0 (position 'original-source-start path)))
345 ;;; Return the innermost source form for NODE.
346 (defun node-source-form (node)
347 (declare (type node node))
348 (let* ((path (node-source-path node))
349 (forms (source-path-forms path)))
352 (values (find-original-source path)))))
354 ;;; Return NODE-SOURCE-FORM, T if continuation has a single use,
355 ;;; otherwise NIL, NIL.
356 (defun continuation-source (cont)
357 (let ((use (continuation-use cont)))
359 (values (node-source-form use) t)
362 ;;; Return the LAMBDA that is CONT's home, or NIL if there is none.
363 (defun continuation-home-lambda-or-null (cont)
364 ;; KLUDGE: This function is a post-CMU-CL hack by WHN, and this
365 ;; implementation might not be quite right, or might be uglier than
366 ;; necessary. It appears that the original Python never found a need
367 ;; to do this operation. The obvious things based on
368 ;; NODE-HOME-LAMBDA of CONTINUATION-USE usually work; then if that
369 ;; fails, BLOCK-HOME-LAMBDA of CONTINUATION-BLOCK works, given that
370 ;; we generalize it enough to grovel harder when the simple CMU CL
371 ;; approach fails, and furthermore realize that in some exceptional
372 ;; cases it might return NIL. -- WHN 2001-12-04
373 (cond ((continuation-use cont)
374 (node-home-lambda (continuation-use cont)))
375 ((continuation-block cont)
376 (block-home-lambda-or-null (continuation-block cont)))
378 (error "internal error: confused about home lambda for ~S"))))
380 ;;; Return the LAMBDA that is CONT's home.
381 (defun continuation-home-lambda (cont)
383 (continuation-home-lambda-or-null cont)))
385 ;;; Return a new LEXENV just like DEFAULT except for the specified
386 ;;; slot values. Values for the alist slots are NCONCed to the
387 ;;; beginning of the current value, rather than replacing it entirely.
388 (defun make-lexenv (&key (default *lexenv*)
389 functions variables blocks tags type-restrictions
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 functions lexenv-functions)
401 (frob variables lexenv-variables)
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 ;;;; flow/DFO/component hackery
410 ;;; Join BLOCK1 and BLOCK2.
411 (defun link-blocks (block1 block2)
412 (declare (type cblock block1 block2))
413 (setf (block-succ block1)
414 (if (block-succ block1)
415 (%link-blocks block1 block2)
417 (push block1 (block-pred block2))
419 (defun %link-blocks (block1 block2)
420 (declare (type cblock block1 block2) (inline member))
421 (let ((succ1 (block-succ block1)))
422 (aver (not (member block2 succ1 :test #'eq)))
423 (cons block2 succ1)))
425 ;;; This is like LINK-BLOCKS, but we separate BLOCK1 and BLOCK2. If
426 ;;; this leaves a successor with a single predecessor that ends in an
427 ;;; IF, then set BLOCK-TEST-MODIFIED so that any test constraint will
428 ;;; now be able to be propagated to the successor.
429 (defun unlink-blocks (block1 block2)
430 (declare (type cblock block1 block2))
431 (let ((succ1 (block-succ block1)))
432 (if (eq block2 (car succ1))
433 (setf (block-succ block1) (cdr succ1))
434 (do ((succ (cdr succ1) (cdr succ))
436 ((eq (car succ) block2)
437 (setf (cdr prev) (cdr succ)))
440 (let ((new-pred (delq block1 (block-pred block2))))
441 (setf (block-pred block2) new-pred)
442 (when (and new-pred (null (rest new-pred)))
443 (let ((pred-block (first new-pred)))
444 (when (if-p (block-last pred-block))
445 (setf (block-test-modified pred-block) t)))))
448 ;;; Swing the succ/pred link between BLOCK and OLD to be between BLOCK
449 ;;; and NEW. If BLOCK ends in an IF, then we have to fix up the
450 ;;; consequent/alternative blocks to point to NEW. We also set
451 ;;; BLOCK-TEST-MODIFIED so that any test constraint will be applied to
452 ;;; the new successor.
453 (defun change-block-successor (block old new)
454 (declare (type cblock new old block) (inline member))
455 (unlink-blocks block old)
456 (let ((last (block-last block))
457 (comp (block-component block)))
458 (setf (component-reanalyze comp) t)
461 (setf (block-test-modified block) t)
462 (let* ((succ-left (block-succ block))
463 (new (if (and (eq new (component-tail comp))
467 (unless (member new succ-left :test #'eq)
468 (link-blocks block new))
469 (macrolet ((frob (slot)
470 `(when (eq (,slot last) old)
471 (setf (,slot last) new))))
473 (frob if-alternative))))
475 (unless (member new (block-succ block) :test #'eq)
476 (link-blocks block new)))))
480 ;;; Unlink a block from the next/prev chain. We also null out the
482 (declaim (ftype (function (cblock) (values)) remove-from-dfo))
483 (defun remove-from-dfo (block)
484 (let ((next (block-next block))
485 (prev (block-prev block)))
486 (setf (block-component block) nil)
487 (setf (block-next prev) next)
488 (setf (block-prev next) prev))
491 ;;; Add BLOCK to the next/prev chain following AFTER. We also set the
492 ;;; Component to be the same as for AFTER.
493 (defun add-to-dfo (block after)
494 (declare (type cblock block after))
495 (let ((next (block-next after))
496 (comp (block-component after)))
497 (aver (not (eq (component-kind comp) :deleted)))
498 (setf (block-component block) comp)
499 (setf (block-next after) block)
500 (setf (block-prev block) after)
501 (setf (block-next block) next)
502 (setf (block-prev next) block))
505 ;;; Set the FLAG for all the blocks in COMPONENT to NIL, except for
506 ;;; the head and tail which are set to T.
507 (declaim (ftype (function (component) (values)) clear-flags))
508 (defun clear-flags (component)
509 (let ((head (component-head component))
510 (tail (component-tail component)))
511 (setf (block-flag head) t)
512 (setf (block-flag tail) t)
513 (do-blocks (block component)
514 (setf (block-flag block) nil)))
517 ;;; Make a component with no blocks in it. The BLOCK-FLAG is initially
518 ;;; true in the head and tail blocks.
519 (declaim (ftype (function nil component) make-empty-component))
520 (defun make-empty-component ()
521 (let* ((head (make-block-key :start nil :component nil))
522 (tail (make-block-key :start nil :component nil))
523 (res (make-component :head head :tail tail)))
524 (setf (block-flag head) t)
525 (setf (block-flag tail) t)
526 (setf (block-component head) res)
527 (setf (block-component tail) res)
528 (setf (block-next head) tail)
529 (setf (block-prev tail) head)
532 ;;; Make NODE the LAST node in its block, splitting the block if necessary.
533 ;;; The new block is added to the DFO immediately following NODE's block.
534 (defun node-ends-block (node)
535 (declare (type node node))
536 (let* ((block (node-block node))
537 (start (node-cont node))
538 (last (block-last block))
539 (last-cont (node-cont last)))
540 (unless (eq last node)
541 (aver (and (eq (continuation-kind start) :inside-block)
542 (not (block-delete-p block))))
543 (let* ((succ (block-succ block))
545 (make-block-key :start start
546 :component (block-component block)
547 :start-uses (list (continuation-use start))
548 :succ succ :last last)))
549 (setf (continuation-kind start) :block-start)
552 (cons new-block (remove block (block-pred b)))))
553 (setf (block-succ block) ())
554 (setf (block-last block) node)
555 (link-blocks block new-block)
556 (add-to-dfo new-block block)
557 (setf (component-reanalyze (block-component block)) t)
559 (do ((cont start (node-cont (continuation-next cont))))
561 (when (eq (continuation-kind last-cont) :inside-block)
562 (setf (continuation-block last-cont) new-block)))
563 (setf (continuation-block cont) new-block))
565 (setf (block-type-asserted block) t)
566 (setf (block-test-modified block) t))))
572 ;;; Deal with deleting the last (read) reference to a LAMBDA-VAR. We
573 ;;; iterate over all local calls flushing the corresponding argument,
574 ;;; allowing the computation of the argument to be deleted. We also
575 ;;; mark the let for reoptimization, since it may be that we have
576 ;;; deleted the last variable.
578 ;;; The LAMBDA-VAR may still have some SETs, but this doesn't cause
579 ;;; too much difficulty, since we can efficiently implement write-only
580 ;;; variables. We iterate over the sets, marking their blocks for dead
581 ;;; code flushing, since we can delete sets whose value is unused.
582 (defun delete-lambda-var (leaf)
583 (declare (type lambda-var leaf))
584 (let* ((fun (lambda-var-home leaf))
585 (n (position leaf (lambda-vars fun))))
586 (dolist (ref (leaf-refs fun))
587 (let* ((cont (node-cont ref))
588 (dest (continuation-dest cont)))
589 (when (and (combination-p dest)
590 (eq (basic-combination-fun dest) cont)
591 (eq (basic-combination-kind dest) :local))
592 (let* ((args (basic-combination-args dest))
594 (reoptimize-continuation arg)
596 (setf (elt args n) nil))))))
598 (dolist (set (lambda-var-sets leaf))
599 (setf (block-flush-p (node-block set)) t))
603 ;;; Note that something interesting has happened to VAR. We only deal
604 ;;; with LET variables, marking the corresponding initial value arg as
605 ;;; needing to be reoptimized.
606 (defun reoptimize-lambda-var (var)
607 (declare (type lambda-var var))
608 (let ((fun (lambda-var-home var)))
609 (when (and (eq (functional-kind fun) :let)
611 (do ((args (basic-combination-args
614 (first (leaf-refs fun)))))
616 (vars (lambda-vars fun) (cdr vars)))
618 (reoptimize-continuation (car args))))))
621 ;;; Delete a function that has no references. This need only be called
622 ;;; on functions that never had any references, since otherwise
623 ;;; DELETE-REF will handle the deletion.
624 (defun delete-functional (fun)
625 (aver (and (null (leaf-refs fun))
626 (not (functional-entry-fun fun))))
628 (optional-dispatch (delete-optional-dispatch fun))
629 (clambda (delete-lambda fun)))
632 ;;; Deal with deleting the last reference to a LAMBDA. Since there is
633 ;;; only one way into a LAMBDA, deleting the last reference to a
634 ;;; LAMBDA ensures that there is no way to reach any of the code in
635 ;;; it. So we just set the FUNCTIONAL-KIND for FUN and its LETs to
636 ;;; :DELETED, causing IR1 optimization to delete blocks in that
639 ;;; If the function isn't a LET, we unlink the function head and tail
640 ;;; from the component head and tail to indicate that the code is
641 ;;; unreachable. We also delete the function from COMPONENT-LAMBDAS
642 ;;; (it won't be there before local call analysis, but no matter.) If
643 ;;; the lambda was never referenced, we give a note.
645 ;;; If the lambda is an XEP, then we null out the ENTRY-FUN in its
646 ;;; ENTRY-FUN so that people will know that it is not an entry point
648 (defun delete-lambda (leaf)
649 (declare (type clambda leaf))
650 (let ((kind (functional-kind leaf))
651 (bind (lambda-bind leaf)))
652 (aver (not (member kind '(:deleted :optional :toplevel))))
653 (aver (not (functional-has-external-references-p leaf)))
654 (setf (functional-kind leaf) :deleted)
655 (setf (lambda-bind leaf) nil)
656 (dolist (let (lambda-lets leaf))
657 (setf (lambda-bind let) nil)
658 (setf (functional-kind let) :deleted))
660 (if (member kind '(:let :mv-let :assignment))
661 (let ((home (lambda-home leaf)))
662 (setf (lambda-lets home) (delete leaf (lambda-lets home))))
663 (let* ((bind-block (node-block bind))
664 (component (block-component bind-block))
665 (return (lambda-return leaf)))
666 (aver (null (leaf-refs leaf)))
667 (unless (leaf-ever-used leaf)
668 (let ((*compiler-error-context* bind))
669 (compiler-note "deleting unused function~:[.~;~:*~% ~S~]"
670 (leaf-debug-name leaf))))
671 (unlink-blocks (component-head component) bind-block)
673 (unlink-blocks (node-block return) (component-tail component)))
674 (setf (component-reanalyze component) t)
675 (let ((tails (lambda-tail-set leaf)))
676 (setf (tail-set-funs tails)
677 (delete leaf (tail-set-funs tails)))
678 (setf (lambda-tail-set leaf) nil))
679 (setf (component-lambdas component)
680 (delete leaf (component-lambdas component)))))
682 (when (eq kind :external)
683 (let ((fun (functional-entry-fun leaf)))
684 (setf (functional-entry-fun fun) nil)
685 (when (optional-dispatch-p fun)
686 (delete-optional-dispatch fun)))))
690 ;;; Deal with deleting the last reference to an OPTIONAL-DISPATCH. We
691 ;;; have to be a bit more careful than with lambdas, since DELETE-REF
692 ;;; is used both before and after local call analysis. Afterward, all
693 ;;; references to still-existing OPTIONAL-DISPATCHes have been moved
694 ;;; to the XEP, leaving it with no references at all. So we look at
695 ;;; the XEP to see whether an optional-dispatch is still really being
696 ;;; used. But before local call analysis, there are no XEPs, and all
697 ;;; references are direct.
699 ;;; When we do delete the OPTIONAL-DISPATCH, we grovel all of its
700 ;;; entry-points, making them be normal lambdas, and then deleting the
701 ;;; ones with no references. This deletes any e-p lambdas that were
702 ;;; either never referenced, or couldn't be deleted when the last
703 ;;; deference was deleted (due to their :OPTIONAL kind.)
705 ;;; Note that the last optional ep may alias the main entry, so when
706 ;;; we process the main entry, its kind may have been changed to NIL
707 ;;; or even converted to a let.
708 (defun delete-optional-dispatch (leaf)
709 (declare (type optional-dispatch leaf))
710 (let ((entry (functional-entry-fun leaf)))
711 (unless (and entry (leaf-refs entry))
712 (aver (or (not entry) (eq (functional-kind entry) :deleted)))
713 (setf (functional-kind leaf) :deleted)
716 (unless (eq (functional-kind fun) :deleted)
717 (aver (eq (functional-kind fun) :optional))
718 (setf (functional-kind fun) nil)
719 (let ((refs (leaf-refs fun)))
723 (or (maybe-let-convert fun)
724 (maybe-convert-to-assignment fun)))
726 (maybe-convert-to-assignment fun)))))))
728 (dolist (ep (optional-dispatch-entry-points leaf))
730 (when (optional-dispatch-more-entry leaf)
731 (frob (optional-dispatch-more-entry leaf)))
732 (let ((main (optional-dispatch-main-entry leaf)))
733 (when (eq (functional-kind main) :optional)
738 ;;; Do stuff to delete the semantic attachments of a REF node. When
739 ;;; this leaves zero or one reference, we do a type dispatch off of
740 ;;; the leaf to determine if a special action is appropriate.
741 (defun delete-ref (ref)
742 (declare (type ref ref))
743 (let* ((leaf (ref-leaf ref))
744 (refs (delete ref (leaf-refs leaf))))
745 (setf (leaf-refs leaf) refs)
750 (delete-lambda-var leaf))
752 (ecase (functional-kind leaf)
753 ((nil :let :mv-let :assignment :escape :cleanup)
754 (aver (not (functional-entry-fun leaf)))
755 (delete-lambda leaf))
757 (delete-lambda leaf))
758 ((:deleted :optional))))
760 (unless (eq (functional-kind leaf) :deleted)
761 (delete-optional-dispatch leaf)))))
764 (clambda (or (maybe-let-convert leaf)
765 (maybe-convert-to-assignment leaf)))
766 (lambda-var (reoptimize-lambda-var leaf))))
769 (clambda (maybe-convert-to-assignment leaf))))))
773 ;;; This function is called by people who delete nodes; it provides a
774 ;;; way to indicate that the value of a continuation is no longer
775 ;;; used. We null out the CONTINUATION-DEST, set FLUSH-P in the blocks
776 ;;; containing uses of CONT and set COMPONENT-REOPTIMIZE. If the PREV
777 ;;; of the use is deleted, then we blow off reoptimization.
779 ;;; If the continuation is :Deleted, then we don't do anything, since
780 ;;; all semantics have already been flushed. :DELETED-BLOCK-START
781 ;;; start continuations are treated just like :BLOCK-START; it is
782 ;;; possible that the continuation may be given a new dest (e.g. by
783 ;;; SUBSTITUTE-CONTINUATION), so we don't want to delete it.
784 (defun flush-dest (cont)
785 (declare (type continuation cont))
787 (unless (eq (continuation-kind cont) :deleted)
788 (aver (continuation-dest cont))
789 (setf (continuation-dest cont) nil)
791 (let ((prev (node-prev use)))
792 (unless (eq (continuation-kind prev) :deleted)
793 (let ((block (continuation-block prev)))
794 (setf (component-reoptimize (block-component block)) t)
795 (setf (block-attributep (block-flags block) flush-p type-asserted)
798 (setf (continuation-%type-check cont) nil)
802 ;;; Do a graph walk backward from BLOCK, marking all predecessor
803 ;;; blocks with the DELETE-P flag.
804 (defun mark-for-deletion (block)
805 (declare (type cblock block))
806 (unless (block-delete-p block)
807 (setf (block-delete-p block) t)
808 (setf (component-reanalyze (block-component block)) t)
809 (dolist (pred (block-pred block))
810 (mark-for-deletion pred)))
813 ;;; Delete CONT, eliminating both control and value semantics. We set
814 ;;; FLUSH-P and COMPONENT-REOPTIMIZE similarly to in FLUSH-DEST. Here
815 ;;; we must get the component from the use block, since the
816 ;;; continuation may be a :DELETED-BLOCK-START.
818 ;;; If CONT has DEST, then it must be the case that the DEST is
819 ;;; unreachable, since we can't compute the value desired. In this
820 ;;; case, we call MARK-FOR-DELETION to cause the DEST block and its
821 ;;; predecessors to tell people to ignore them, and to cause them to
822 ;;; be deleted eventually.
823 (defun delete-continuation (cont)
824 (declare (type continuation cont))
825 (aver (not (eq (continuation-kind cont) :deleted)))
828 (let ((prev (node-prev use)))
829 (unless (eq (continuation-kind prev) :deleted)
830 (let ((block (continuation-block prev)))
831 (setf (block-attributep (block-flags block) flush-p type-asserted) t)
832 (setf (component-reoptimize (block-component block)) t)))))
834 (let ((dest (continuation-dest cont)))
836 (let ((prev (node-prev dest)))
838 (not (eq (continuation-kind prev) :deleted)))
839 (let ((block (continuation-block prev)))
840 (unless (block-delete-p block)
841 (mark-for-deletion block)))))))
843 (setf (continuation-kind cont) :deleted)
844 (setf (continuation-dest cont) nil)
845 (setf (continuation-next cont) nil)
846 (setf (continuation-asserted-type cont) *empty-type*)
847 (setf (continuation-%derived-type cont) *empty-type*)
848 (setf (continuation-use cont) nil)
849 (setf (continuation-block cont) nil)
850 (setf (continuation-reoptimize cont) nil)
851 (setf (continuation-%type-check cont) nil)
852 (setf (continuation-info cont) nil)
856 ;;; This function does what is necessary to eliminate the code in it
857 ;;; from the IR1 representation. This involves unlinking it from its
858 ;;; predecessors and successors and deleting various node-specific
859 ;;; semantic information.
861 ;;; We mark the START as has having no next and remove the last node
862 ;;; from its CONT's uses. We also flush the DEST for all continuations
863 ;;; whose values are received by nodes in the block.
864 (defun delete-block (block)
865 (declare (type cblock block))
866 (aver (block-component block)) ; else block is already deleted!
867 (note-block-deletion block)
868 (setf (block-delete-p block) t)
870 (let* ((last (block-last block))
871 (cont (node-cont last)))
872 (delete-continuation-use last)
873 (if (eq (continuation-kind cont) :unused)
874 (delete-continuation cont)
875 (reoptimize-continuation cont)))
877 (dolist (b (block-pred block))
878 (unlink-blocks b block))
879 (dolist (b (block-succ block))
880 (unlink-blocks block b))
882 (do-nodes (node cont block)
884 (ref (delete-ref node))
886 (flush-dest (if-test node)))
887 ;; The next two cases serve to maintain the invariant that a LET
888 ;; always has a well-formed COMBINATION, REF and BIND. We delete
889 ;; the lambda whenever we delete any of these, but we must be
890 ;; careful that this LET has not already been partially deleted.
892 (when (and (eq (basic-combination-kind node) :local)
893 ;; Guards COMBINATION-LAMBDA agains the REF being deleted.
894 (continuation-use (basic-combination-fun node)))
895 (let ((fun (combination-lambda node)))
896 ;; If our REF was the 2'nd to last ref, and has been deleted, then
897 ;; Fun may be a LET for some other combination.
898 (when (and (member (functional-kind fun) '(:let :mv-let))
899 (eq (let-combination fun) node))
900 (delete-lambda fun))))
901 (flush-dest (basic-combination-fun node))
902 (dolist (arg (basic-combination-args node))
903 (when arg (flush-dest arg))))
905 (let ((lambda (bind-lambda node)))
906 (unless (eq (functional-kind lambda) :deleted)
907 (aver (member (functional-kind lambda) '(:let :mv-let :assignment)))
908 (delete-lambda lambda))))
910 (let ((value (exit-value node))
911 (entry (exit-entry node)))
915 (setf (entry-exits entry)
916 (delete node (entry-exits entry))))))
918 (flush-dest (return-result node))
919 (delete-return node))
921 (flush-dest (set-value node))
922 (let ((var (set-var node)))
923 (setf (basic-var-sets var)
924 (delete node (basic-var-sets var))))))
926 (delete-continuation (node-prev node)))
928 (remove-from-dfo block)
931 ;;; Do stuff to indicate that the return node Node is being deleted.
932 ;;; We set the RETURN to NIL.
933 (defun delete-return (node)
934 (declare (type creturn node))
935 (let ((fun (return-lambda node)))
936 (aver (lambda-return fun))
937 (setf (lambda-return fun) nil))
940 ;;; If any of the VARS in FUN was never referenced and was not
941 ;;; declared IGNORE, then complain.
942 (defun note-unreferenced-vars (fun)
943 (declare (type clambda fun))
944 (dolist (var (lambda-vars fun))
945 (unless (or (leaf-ever-used var)
946 (lambda-var-ignorep var))
947 (let ((*compiler-error-context* (lambda-bind fun)))
948 (unless (policy *compiler-error-context* (= inhibit-warnings 3))
949 ;; ANSI section "3.2.5 Exceptional Situations in the Compiler"
950 ;; requires this to be no more than a STYLE-WARNING.
951 (compiler-style-warning "The variable ~S is defined but never used."
952 (leaf-debug-name var)))
953 (setf (leaf-ever-used var) t)))) ; to avoid repeated warnings? -- WHN
956 (defvar *deletion-ignored-objects* '(t nil))
958 ;;; Return true if we can find OBJ in FORM, NIL otherwise. We bound
959 ;;; our recursion so that we don't get lost in circular structures. We
960 ;;; ignore the car of forms if they are a symbol (to prevent confusing
961 ;;; function referencess with variables), and we also ignore anything
963 (defun present-in-form (obj form depth)
964 (declare (type (integer 0 20) depth))
965 (cond ((= depth 20) nil)
969 (let ((first (car form))
971 (if (member first '(quote function))
973 (or (and (not (symbolp first))
974 (present-in-form obj first depth))
975 (do ((l (cdr form) (cdr l))
977 ((or (atom l) (> n 100))
980 (when (present-in-form obj (car l) depth)
983 ;;; This function is called on a block immediately before we delete
984 ;;; it. We check to see whether any of the code about to die appeared
985 ;;; in the original source, and emit a note if so.
987 ;;; If the block was in a lambda is now deleted, then we ignore the
988 ;;; whole block, since this case is picked off in DELETE-LAMBDA. We
989 ;;; also ignore the deletion of CRETURN nodes, since it is somewhat
990 ;;; reasonable for a function to not return, and there is a different
991 ;;; note for that case anyway.
993 ;;; If the actual source is an atom, then we use a bunch of heuristics
994 ;;; to guess whether this reference really appeared in the original
996 ;;; -- If a symbol, it must be interned and not a keyword.
997 ;;; -- It must not be an easily introduced constant (T or NIL, a fixnum
999 ;;; -- The atom must be "present" in the original source form, and
1000 ;;; present in all intervening actual source forms.
1001 (defun note-block-deletion (block)
1002 (let ((home (block-home-lambda block)))
1003 (unless (eq (functional-kind home) :deleted)
1004 (do-nodes (node cont block)
1005 (let* ((path (node-source-path node))
1006 (first (first path)))
1007 (when (or (eq first 'original-source-start)
1009 (or (not (symbolp first))
1010 (let ((pkg (symbol-package first)))
1012 (not (eq pkg (symbol-package :end))))))
1013 (not (member first *deletion-ignored-objects*))
1014 (not (typep first '(or fixnum character)))
1016 (present-in-form first x 0))
1017 (source-path-forms path))
1018 (present-in-form first (find-original-source path)
1020 (unless (return-p node)
1021 (let ((*compiler-error-context* node))
1022 (compiler-note "deleting unreachable code")))
1026 ;;; Delete a node from a block, deleting the block if there are no
1027 ;;; nodes left. We remove the node from the uses of its CONT, but we
1028 ;;; don't deal with cleaning up any type-specific semantic
1029 ;;; attachments. If the CONT is :UNUSED after deleting this use, then
1030 ;;; we delete CONT. (Note :UNUSED is not the same as no uses. A
1031 ;;; continuation will only become :UNUSED if it was :INSIDE-BLOCK
1034 ;;; If the node is the last node, there must be exactly one successor.
1035 ;;; We link all of our precedessors to the successor and unlink the
1036 ;;; block. In this case, we return T, otherwise NIL. If no nodes are
1037 ;;; left, and the block is a successor of itself, then we replace the
1038 ;;; only node with a degenerate exit node. This provides a way to
1039 ;;; represent the bodyless infinite loop, given the prohibition on
1040 ;;; empty blocks in IR1.
1041 (defun unlink-node (node)
1042 (declare (type node node))
1043 (let* ((cont (node-cont node))
1044 (next (continuation-next cont))
1045 (prev (node-prev node))
1046 (block (continuation-block prev))
1047 (prev-kind (continuation-kind prev))
1048 (last (block-last block)))
1050 (unless (eq (continuation-kind cont) :deleted)
1051 (delete-continuation-use node)
1052 (when (eq (continuation-kind cont) :unused)
1053 (aver (not (continuation-dest cont)))
1054 (delete-continuation cont)))
1056 (setf (block-type-asserted block) t)
1057 (setf (block-test-modified block) t)
1059 (cond ((or (eq prev-kind :inside-block)
1060 (and (eq prev-kind :block-start)
1061 (not (eq node last))))
1062 (cond ((eq node last)
1063 (setf (block-last block) (continuation-use prev))
1064 (setf (continuation-next prev) nil))
1066 (setf (continuation-next prev) next)
1067 (setf (node-prev next) prev)))
1068 (setf (node-prev node) nil)
1071 (aver (eq prev-kind :block-start))
1072 (aver (eq node last))
1073 (let* ((succ (block-succ block))
1074 (next (first succ)))
1075 (aver (and succ (null (cdr succ))))
1077 ((member block succ)
1078 (with-ir1-environment-from-node node
1079 (let ((exit (make-exit))
1080 (dummy (make-continuation)))
1081 (setf (continuation-next prev) nil)
1082 (link-node-to-previous-continuation exit prev)
1083 (add-continuation-use exit dummy)
1084 (setf (block-last block) exit)))
1085 (setf (node-prev node) nil)
1088 (aver (eq (block-start-cleanup block)
1089 (block-end-cleanup block)))
1090 (unlink-blocks block next)
1091 (dolist (pred (block-pred block))
1092 (change-block-successor pred block next))
1093 (remove-from-dfo block)
1094 (cond ((continuation-dest prev)
1095 (setf (continuation-next prev) nil)
1096 (setf (continuation-kind prev) :deleted-block-start))
1098 (delete-continuation prev)))
1099 (setf (node-prev node) nil)
1102 ;;; Return true if NODE has been deleted, false if it is still a valid
1104 (defun node-deleted (node)
1105 (declare (type node node))
1106 (let ((prev (node-prev node)))
1108 (not (eq (continuation-kind prev) :deleted))
1109 (let ((block (continuation-block prev)))
1110 (and (block-component block)
1111 (not (block-delete-p block))))))))
1113 ;;; Delete all the blocks and functions in COMPONENT. We scan first
1114 ;;; marking the blocks as DELETE-P to prevent weird stuff from being
1115 ;;; triggered by deletion.
1116 (defun delete-component (component)
1117 (declare (type component component))
1118 (aver (null (component-new-funs component)))
1119 (setf (component-kind component) :deleted)
1120 (do-blocks (block component)
1121 (setf (block-delete-p block) t))
1122 (dolist (fun (component-lambdas component))
1123 (setf (functional-kind fun) nil)
1124 (setf (functional-entry-fun fun) nil)
1125 (setf (leaf-refs fun) nil)
1126 (delete-functional fun))
1127 (do-blocks (block component)
1128 (delete-block block))
1131 ;;; Convert code of the form
1132 ;;; (FOO ... (FUN ...) ...)
1134 ;;; (FOO ... ... ...).
1135 ;;; In other words, replace the function combination FUN by its
1136 ;;; arguments. If there are any problems with doing this, use GIVE-UP
1137 ;;; to blow out of whatever transform called this. Note, as the number
1138 ;;; of arguments changes, the transform must be prepared to return a
1139 ;;; lambda with a new lambda-list with the correct number of
1141 (defun extract-function-args (cont fun num-args)
1143 "If CONT is a call to FUN with NUM-ARGS args, change those arguments
1144 to feed directly to the continuation-dest of CONT, which must be
1146 (declare (type continuation cont)
1148 (type index num-args))
1149 (let ((outside (continuation-dest cont))
1150 (inside (continuation-use cont)))
1151 (aver (combination-p outside))
1152 (unless (combination-p inside)
1153 (give-up-ir1-transform))
1154 (let ((inside-fun (combination-fun inside)))
1155 (unless (eq (continuation-fun-name inside-fun) fun)
1156 (give-up-ir1-transform))
1157 (let ((inside-args (combination-args inside)))
1158 (unless (= (length inside-args) num-args)
1159 (give-up-ir1-transform))
1160 (let* ((outside-args (combination-args outside))
1161 (arg-position (position cont outside-args))
1162 (before-args (subseq outside-args 0 arg-position))
1163 (after-args (subseq outside-args (1+ arg-position))))
1164 (dolist (arg inside-args)
1165 (setf (continuation-dest arg) outside))
1166 (setf (combination-args inside) nil)
1167 (setf (combination-args outside)
1168 (append before-args inside-args after-args))
1169 (change-ref-leaf (continuation-use inside-fun)
1170 (find-free-function 'list "???"))
1171 (setf (combination-kind inside) :full)
1172 (setf (node-derived-type inside) *wild-type*)
1174 (setf (continuation-asserted-type cont) *wild-type*)
1179 ;;; Change the LEAF that a REF refers to.
1180 (defun change-ref-leaf (ref leaf)
1181 (declare (type ref ref) (type leaf leaf))
1182 (unless (eq (ref-leaf ref) leaf)
1183 (push ref (leaf-refs leaf))
1185 (setf (ref-leaf ref) leaf)
1186 (let ((ltype (leaf-type leaf)))
1187 (if (fun-type-p ltype)
1188 (setf (node-derived-type ref) ltype)
1189 (derive-node-type ref ltype)))
1190 (reoptimize-continuation (node-cont ref)))
1193 ;;; Change all REFS for OLD-LEAF to NEW-LEAF.
1194 (defun substitute-leaf (new-leaf old-leaf)
1195 (declare (type leaf new-leaf old-leaf))
1196 (dolist (ref (leaf-refs old-leaf))
1197 (change-ref-leaf ref new-leaf))
1200 ;;; Like SUBSITUTE-LEAF, only there is a predicate on the REF to tell
1201 ;;; whether to substitute.
1202 (defun substitute-leaf-if (test new-leaf old-leaf)
1203 (declare (type leaf new-leaf old-leaf) (type function test))
1204 (dolist (ref (leaf-refs old-leaf))
1205 (when (funcall test ref)
1206 (change-ref-leaf ref new-leaf)))
1209 ;;; Return a LEAF which represents the specified constant object. If
1210 ;;; the object is not in *CONSTANTS*, then we create a new constant
1211 ;;; LEAF and enter it.
1212 (defun find-constant (object)
1214 ;; FIXME: What is the significance of this test? ("things
1215 ;; that are worth uniquifying"?)
1216 '(or symbol number character instance))
1217 (or (gethash object *constants*)
1218 (setf (gethash object *constants*)
1219 (make-constant :value object
1220 :%source-name '.anonymous.
1221 :type (ctype-of object)
1222 :where-from :defined)))
1223 (make-constant :value object
1224 :%source-name '.anonymous.
1225 :type (ctype-of object)
1226 :where-from :defined)))
1228 ;;; If there is a non-local exit noted in ENTRY's environment that
1229 ;;; exits to CONT in that entry, then return it, otherwise return NIL.
1230 (defun find-nlx-info (entry cont)
1231 (declare (type entry entry) (type continuation cont))
1232 (let ((entry-cleanup (entry-cleanup entry)))
1233 (dolist (nlx (physenv-nlx-info (node-physenv entry)) nil)
1234 (when (and (eq (nlx-info-continuation nlx) cont)
1235 (eq (nlx-info-cleanup nlx) entry-cleanup))
1238 ;;;; functional hackery
1240 (declaim (ftype (function (functional) clambda) main-entry))
1241 (defun main-entry (functional)
1242 (etypecase functional
1243 (clambda functional)
1245 (optional-dispatch-main-entry functional))))
1247 ;;; RETURN true if FUNCTIONAL is a thing that can be treated like
1248 ;;; MV-BIND when it appears in an MV-CALL. All fixed arguments must be
1249 ;;; optional with null default and no SUPPLIED-P. There must be a
1250 ;;; &REST arg with no references.
1251 (declaim (ftype (function (functional) boolean) looks-like-an-mv-bind))
1252 (defun looks-like-an-mv-bind (functional)
1253 (and (optional-dispatch-p functional)
1254 (do ((arg (optional-dispatch-arglist functional) (cdr arg)))
1256 (let ((info (lambda-var-arg-info (car arg))))
1257 (unless info (return nil))
1258 (case (arg-info-kind info)
1260 (when (or (arg-info-supplied-p info) (arg-info-default info))
1263 (return (and (null (cdr arg)) (null (leaf-refs (car arg))))))
1267 ;;; Return true if function is an external entry point. This is true
1268 ;;; of normal XEPs (:EXTERNAL kind) and also of top level lambdas
1269 ;;; (:TOPLEVEL kind.)
1271 (declare (type functional fun))
1272 (not (null (member (functional-kind fun) '(:external :toplevel)))))
1274 ;;; If CONT's only use is a non-notinline global function reference,
1275 ;;; then return the referenced symbol, otherwise NIL. If NOTINLINE-OK
1276 ;;; is true, then we don't care if the leaf is NOTINLINE.
1277 (defun continuation-fun-name (cont &optional notinline-ok)
1278 (declare (type continuation cont))
1279 (let ((use (continuation-use cont)))
1281 (let ((leaf (ref-leaf use)))
1282 (if (and (global-var-p leaf)
1283 (eq (global-var-kind leaf) :global-function)
1284 (or (not (defined-fun-p leaf))
1285 (not (eq (defined-fun-inlinep leaf) :notinline))
1287 (leaf-source-name leaf)
1291 ;;; Return the COMBINATION node that is the call to the LET FUN.
1292 (defun let-combination (fun)
1293 (declare (type clambda fun))
1294 (aver (member (functional-kind fun) '(:let :mv-let)))
1295 (continuation-dest (node-cont (first (leaf-refs fun)))))
1297 ;;; Return the initial value continuation for a LET variable, or NIL
1298 ;;; if there is none.
1299 (defun let-var-initial-value (var)
1300 (declare (type lambda-var var))
1301 (let ((fun (lambda-var-home var)))
1302 (elt (combination-args (let-combination fun))
1303 (position-or-lose var (lambda-vars fun)))))
1305 ;;; Return the LAMBDA that is called by the local CALL.
1306 (defun combination-lambda (call)
1307 (declare (type basic-combination call))
1308 (aver (eq (basic-combination-kind call) :local))
1309 (ref-leaf (continuation-use (basic-combination-fun call))))
1311 (defvar *inline-expansion-limit* 200
1313 "an upper limit on the number of inline function calls that will be expanded
1314 in any given code object (single function or block compilation)")
1316 ;;; Check whether NODE's component has exceeded its inline expansion
1317 ;;; limit, and warn if so, returning NIL.
1318 (defun inline-expansion-ok (node)
1319 (let ((expanded (incf (component-inline-expansions
1321 (node-block node))))))
1322 (cond ((> expanded *inline-expansion-limit*) nil)
1323 ((= expanded *inline-expansion-limit*)
1324 ;; FIXME: If the objective is to stop the recursive
1325 ;; expansion of inline functions, wouldn't it be more
1326 ;; correct to look back through surrounding expansions
1327 ;; (which are, I think, stored in the *CURRENT-PATH*, and
1328 ;; possibly stored elsewhere too) and suppress expansion
1329 ;; and print this warning when the function being proposed
1330 ;; for inline expansion is found there? (I don't like the
1331 ;; arbitrary numerical limit in principle, and I think
1332 ;; it'll be a nuisance in practice if we ever want the
1333 ;; compiler to be able to use WITH-COMPILATION-UNIT on
1334 ;; arbitrarily huge blocks of code. -- WHN)
1335 (let ((*compiler-error-context* node))
1336 (compiler-note "*INLINE-EXPANSION-LIMIT* (~W) was exceeded, ~
1337 probably trying to~% ~
1338 inline a recursive function."
1339 *inline-expansion-limit*))
1345 ;;; Apply a function to some arguments, returning a list of the values
1346 ;;; resulting of the evaluation. If an error is signalled during the
1347 ;;; application, then we print a warning message and return NIL as our
1348 ;;; second value to indicate this. Node is used as the error context
1349 ;;; for any error message, and Context is a string that is spliced
1350 ;;; into the warning.
1351 (declaim (ftype (function ((or symbol function) list node string)
1352 (values list boolean))
1354 (defun careful-call (function args node context)
1356 (multiple-value-list
1357 (handler-case (apply function args)
1359 (let ((*compiler-error-context* node))
1360 (compiler-warning "Lisp error during ~A:~%~A" context condition)
1361 (return-from careful-call (values nil nil))))))
1364 ;;;; utilities used at run-time for parsing &KEY args in IR1
1366 ;;; This function is used by the result of PARSE-DEFTRANSFORM to find
1367 ;;; the continuation for the value of the &KEY argument KEY in the
1368 ;;; list of continuations ARGS. It returns the continuation if the
1369 ;;; keyword is present, or NIL otherwise. The legality and
1370 ;;; constantness of the keywords should already have been checked.
1371 (declaim (ftype (function (list keyword) (or continuation null))
1372 find-keyword-continuation))
1373 (defun find-keyword-continuation (args key)
1374 (do ((arg args (cddr arg)))
1376 (when (eq (continuation-value (first arg)) key)
1377 (return (second arg)))))
1379 ;;; This function is used by the result of PARSE-DEFTRANSFORM to
1380 ;;; verify that alternating continuations in ARGS are constant and
1381 ;;; that there is an even number of args.
1382 (declaim (ftype (function (list) boolean) check-key-args-constant))
1383 (defun check-key-args-constant (args)
1384 (do ((arg args (cddr arg)))
1386 (unless (and (rest arg)
1387 (constant-continuation-p (first arg)))
1390 ;;; This function is used by the result of PARSE-DEFTRANSFORM to
1391 ;;; verify that the list of continuations ARGS is a well-formed &KEY
1392 ;;; arglist and that only keywords present in the list KEYS are
1394 (declaim (ftype (function (list list) boolean) check-transform-keys))
1395 (defun check-transform-keys (args keys)
1396 (and (check-key-args-constant args)
1397 (do ((arg args (cddr arg)))
1399 (unless (member (continuation-value (first arg)) keys)
1404 ;;; Called by the expansion of the EVENT macro.
1405 (declaim (ftype (function (event-info (or node null)) *) %event))
1406 (defun %event (info node)
1407 (incf (event-info-count info))
1408 (when (and (>= (event-info-level info) *event-note-threshold*)
1409 (policy (or node *lexenv*)
1410 (= inhibit-warnings 0)))
1411 (let ((*compiler-error-context* node))
1412 (compiler-note (event-info-description info))))
1414 (let ((action (event-info-action info)))
1415 (when action (funcall action node))))