Newer
Older
;;; -*- Package: C; Log: C.Log -*-
;;;
;;; **********************************************************************
;;; This code was written as part of the CMU Common Lisp project at
;;; Carnegie Mellon University, and has been placed in the public domain.
;;; If you want to use this code or any part of CMU Common Lisp, please contact
;;; Scott Fahlman or slisp-group@cs.cmu.edu.
;;;
(ext:file-comment
"$Header: /Volumes/share2/src/cmucl/cvs2git/cvsroot/src/compiler/ir1util.lisp,v 1.57 1992/08/03 12:32:11 ram Exp $")
;;; **********************************************************************
;;;
;;; This file contains random utilities used for manipulating the IR1
;;; representation.
;;;
;;; Written by Rob MacLachlan
;;;
(in-package "C")
(export '(*compiler-notification-function*))
(in-package "EXTENSIONS")
(export '(*error-print-level* *error-print-length* *error-print-lines*
def-source-context *undefined-warning-limit*
*enclosing-source-cutoff*))
(in-package "C")
;;; Node-Enclosing-Cleanup -- Interface
;;; Return the innermost cleanup enclosing Node, or NIL if there is none in
;;; its function. If Node has no cleanup, but is in a let, then we must still
;;; check the environment that the call is in.
(defun node-enclosing-cleanup (node)
(declare (type node node))
(do ((lexenv (node-lexenv node)
(lambda-call-lexenv (lexenv-lambda lexenv))))
((null lexenv) nil)
(let ((cup (lexenv-cleanup lexenv)))
(when cup (return cup)))))
;;; Insert-Cleanup-Code -- Interface
;;;
;;; Convert the Form in a block inserted between Block1 and Block2 as an
;;; implicit MV-Prog1. The inserted block is returned. Node is used for IR1
;;; context when converting the form. Note that the block is not assigned a
;;; number, and is linked into the DFO at the beginning. We indicate that we
;;; have trashed the DFO by setting Component-Reanalyze. If Cleanup is
;;; supplied, then convert with that cleanup.
(defun insert-cleanup-code (block1 block2 node form &optional cleanup)
(declare (type cblock block1 block2) (type node node)
(type (or cleanup null) cleanup))
(setf (component-reanalyze (block-component block1)) t)
(with-ir1-environment node
(let* ((start (make-continuation))
(block (continuation-starts-block start))
(cont (make-continuation))
(*lexical-environment*
(if cleanup
(make-lexenv :cleanup cleanup)
*lexical-environment*)))
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
(change-block-successor block1 block2 block)
(link-blocks block block2)
(ir1-convert start cont form)
(setf (block-last block) (continuation-use cont))
block)))
;;;; Continuation use hacking:
;;; Find-Uses -- Interface
;;;
;;; Return a list of all the nodes which use Cont.
;;;
(proclaim '(function find-uses (continuation) list))
(defun find-uses (cont)
(ecase (continuation-kind cont)
((:block-start :deleted-block-start)
(block-start-uses (continuation-block cont)))
(:inside-block (list (continuation-use cont)))
(:unused nil)))
;;; Delete-Continuation-Use -- Interface
;;;
;;; Update continuation use information so that Node is no longer a use of
;;; its Cont. If the old continuation doesn't start its block, then we don't
;;; update the Block-Start-Uses, since it will be deleted when we are done.
;;;
;;; Note: if you call this function, you may have to do a
;;; REOPTIMIZE-CONTINUATION to inform IR1 optimization that something has
;;; changed.
;;;
(proclaim '(function delete-continuation-use (node) void))
(defun delete-continuation-use (node)
(let* ((cont (node-cont node))
(block (continuation-block cont)))
(ecase (continuation-kind cont)
(:deleted)
((:block-start :deleted-block-start)
(let ((uses (delete node (block-start-uses block))))
(setf (block-start-uses block) uses)
(setf (continuation-use cont)
(if (cdr uses) nil (car uses)))))
(:inside-block
(setf (continuation-kind cont) :unused)
(setf (continuation-block cont) nil)
(setf (continuation-use cont) nil)
(setf (continuation-next cont) nil)))
(setf (node-cont node) nil)))
;;; Add-Continuation-Use -- Interface
;;;
;;; Update continuation use information so that Node uses Cont. If Cont is
;;; :Unused, then we set its block to Node's Node-Block (which must be set.)
;;;
;;; Note: if you call this function, you may have to do a
;;; REOPTIMIZE-CONTINUATION to inform IR1 optimization that something has
;;; changed.
;;;
(proclaim '(function add-continuation-use (node continuation) void))
(defun add-continuation-use (node cont)
(assert (not (node-cont node)))
(let ((block (continuation-block cont)))
(ecase (continuation-kind cont)
(:deleted)
(:unused
(assert (not block))
(let ((block (node-block node)))
(assert block)
(setf (continuation-block cont) block))
(setf (continuation-kind cont) :inside-block)
(setf (continuation-use cont) node))
((:block-start :deleted-block-start)
(let ((uses (cons node (block-start-uses block))))
(setf (block-start-uses block) uses)
(setf (continuation-use cont)
(if (cdr uses) nil (car uses)))))))
(setf (node-cont node) cont))
;;; Immediately-Used-P -- Interface
;;;
;;; Return true if Cont is the Node-Cont for Node and Cont is transferred to
;;; immediately after the evaluation of Node.
;;;
(defun immediately-used-p (cont node)
(declare (type continuation cont) (type node node))
(and (eq (node-cont node) cont)
(not (eq (continuation-kind cont) :deleted))
(let ((cblock (continuation-block cont))
(nblock (node-block node)))
(or (eq cblock nblock)
(let ((succ (block-succ nblock)))
(and (= (length succ) 1)
(eq (first succ) cblock)))))))
;;;; Continuation substitution:
;;; Substitute-Continuation -- Interface
;;;
;;; In Old's Dest, replace Old with New. New's Dest must initially be NIL.
;;; When we are done, we call Flush-Dest on Old to clear its Dest and to note
;;; potential optimization opportunities.
;;;
(defun substitute-continuation (new old)
(declare (type continuation old new))
(assert (not (continuation-dest new)))
(let ((dest (continuation-dest old)))
(etypecase dest
((or ref bind))
(cif (setf (if-test dest) new))
(cset (setf (set-value dest) new))
(creturn (setf (return-result dest) new))
(exit (setf (exit-value dest) new))
(basic-combination
(if (eq old (basic-combination-fun dest))
(setf (basic-combination-fun dest) new)
(setf (basic-combination-args dest)
(nsubst new old (basic-combination-args dest))))))
(flush-dest old)
(setf (continuation-dest new) dest))
(undefined-value))
;;; Ensure-Block-Start -- Interface
;;;
;;; Ensure that Cont is the start of a block (or deleted) so that the use
;;; set can be freely manipulated.
;;; -- If the continuation is :Unused or is :Inside-Block and the Cont of Last
;;; in its block, then we make it the start of a new deleted block.
;;; -- If the continuation is :Inside-Block inside a block, then we split the
;;; block using Node-Ends-Block, which makes the continuation be a
;;; :Block-Start.
;;;
(defun ensure-block-start (cont)
(declare (type continuation cont))
(let ((kind (continuation-kind cont)))
(ecase kind
((:deleted :block-start :deleted-block-start))
((:unused :inside-block)
(let ((block (continuation-block cont)))
(cond ((or (eq kind :unused)
(eq (node-cont (block-last block)) cont))
(setf (continuation-block cont)
(make-block-key :start cont :component nil
:start-uses (find-uses cont)))
(setf (continuation-kind cont) :deleted-block-start))
(t
(node-ends-block (continuation-use cont))))))))
(undefined-value))
;;; Substitute-Continuation-Uses -- Interface
;;;
;;; Replace all uses of Old with uses of New, where New has an arbitary
;;; number of uses. If New will end up with more than one use, then we must
;;; arrange for it to start a block if it doesn't already.
;;;
(defun substitute-continuation-uses (new old)
(declare (type continuation old new))
(unless (and (eq (continuation-kind new) :unused)
(eq (continuation-kind old) :inside-block))
(ensure-block-start new))
(do-uses (node old)
(delete-continuation-use node)
(add-continuation-use node new))
(reoptimize-continuation new)
(undefined-value))
;;;; Misc shortand functions:
;;; NODE-HOME-LAMBDA -- Interface
;;;
;;; Return the home (i.e. enclosing non-let) lambda for Node. Since the
;;; LEXENV-LAMBDA may be deleted, we must chain up the LAMBDA-CALL-LEXENV
;;; thread until we find a lambda that isn't deleted, and then return its home.
;;;
(declaim (maybe-inline node-home-lambda))
(defun node-home-lambda (node)
(declare (type node node))
(do ((fun (lexenv-lambda (node-lexenv node))
(lexenv-lambda (lambda-call-lexenv fun))))
((not (eq (functional-kind fun) :deleted))
(lambda-home fun))
(when (eq (lambda-home fun) fun)
(return fun))))
;;; NODE-xxx -- Interface
(declaim (inline node-block node-tlf-number))
(declaim (maybe-inline node-environment))
(defun node-block (node)
(declare (type node node))
(the cblock (continuation-block (node-prev node))))
;;;
(defun node-environment (node)
(declare (type node node) (inline node-home-lambda))
(the environment (lambda-environment (node-home-lambda node))))
;;; BLOCK-xxx-CLEANUP -- Interface
;;;
;;; Return the enclosing cleanup for environment of the first or last node
;;; in Block.
;;;
(defun block-start-cleanup (block)
(declare (type cblock block))
(node-enclosing-cleanup (continuation-next (block-start block))))
;;;
(defun block-end-cleanup (block)
(declare (type cblock block))
(node-enclosing-cleanup (block-last block)))
;;; BLOCK-HOME-LAMBDA -- Interface
;;;
;;; Return the non-let lambda that holds Block's code.
;;;
(defun block-home-lambda (block)
(declare (type cblock block) (inline node-home-lambda))
(node-home-lambda (block-last block)))
;;; BLOCK-ENVIRONMENT -- Interface
;;;
;;; Return the IR1 environment for Block.
;;;
(defun block-environment (block)
(declare (type cblock block) (inline node-home-lambda))
(lambda-environment (node-home-lambda (block-last block))))
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
;;; SOURCE-PATH-TLF-NUMBER -- Interface
;;;
;;; Return the Top Level Form number of path, i.e. the ordinal number of
;;; its orignal source's top-level form in its compilation unit.
;;;
(defun source-path-tlf-number (path)
(declare (list path))
(car (last path)))
;;; SOURCE-PATH-ORIGINAL-SOURCE -- Interface
;;;
;;; Return the (reversed) list for the path in the orignal source (with the
;;; TLF number last.)
;;;
(defun source-path-original-source (path)
(declare (list path))
(cddr (member 'original-source-start path)))
;;; SOURCE-PATH-FORM-NUMBER -- Interface
;;;
;;; Return the Form Number of Path's orignal source inside the Top Level
;;; Form that contains it. This is determined by the order that we walk the
;;; subforms of the top level source form.
;;;
(defun source-path-form-number (path)
(declare (list path))
(cadr (member 'original-source-start path)))
;;; SOURCE-PATH-FORMS -- Interface
;;;
;;; Return a list of all the enclosing forms not in the original source that
;;; converted to get to this form, with the immediate source for node at the
;;; start of the list.
;;;
(defun source-path-forms (path)
(subseq path 0 (position 'original-source-start path)))
;;; NODE-SOURCE-FORM -- Interface
;;;
;;; Return the innermost source form for Node.
;;;
(defun node-source-form (node)
(declare (type node node))
(let* ((path (node-source-path node))
(forms (source-path-forms path)))
(if forms
(first forms)
(values (find-original-source path)))))
;;; CONTINUATION-SOURCE-FORM -- Interface
;;;
;;; Return NODE-SOURCE-FORM, T if continuation has a single use, otherwise
;;; NIL, NIL.
;;;
(defun continuation-source (cont)
(let ((use (continuation-use cont)))
(if use
(values (node-source-form use) t)
(values nil nil))))
;;; MAKE-LEXENV -- Interface
;;;
;;; Return a new LEXENV just like Default except for the specified slot
;;; values. Values for the alist slots are NCONC'ed to the beginning of the
;;; current value, rather than replacing it entirely.
;;;
(defun make-lexenv (&key (default *lexical-environment*)
functions variables blocks tags type-restrictions
(lambda (lexenv-lambda default))
(cleanup (lexenv-cleanup default))
(cookie (lexenv-cookie default))
(interface-cookie (lexenv-interface-cookie default)))
(macrolet ((frob (var slot)
`(let ((old (,slot default)))
(if ,var
(nconc ,var old)
old))))
(internal-make-lexenv
(frob functions lexenv-functions)
(frob variables lexenv-variables)
(frob blocks lexenv-blocks)
(frob tags lexenv-tags)
(frob type-restrictions lexenv-type-restrictions)
(frob inlines lexenv-inlines)
lambda cleanup cookie interface-cookie
(frob options lexenv-options))))
;;; MAKE-INTERFACE-COOKIE -- Interface
;;;
;;; Return a cookie that defaults any unsupplied optimize qualities in the
;;; Interface-Cookie with the corresponding ones from the Cookie.
;;;
(defun make-interface-cookie (lexenv)
(declare (type lexenv lexenv))
(let ((icookie (lexenv-interface-cookie lexenv))
(cookie (lexenv-cookie lexenv)))
(make-cookie
:speed (or (cookie-speed icookie) (cookie-speed cookie))
:space (or (cookie-space icookie) (cookie-space cookie))
:safety (or (cookie-safety icookie) (cookie-safety cookie))
:cspeed (or (cookie-cspeed icookie) (cookie-cspeed cookie))
:brevity (or (cookie-brevity icookie) (cookie-brevity cookie))
:debug (or (cookie-debug icookie) (cookie-debug cookie)))))
;;; Link-Blocks -- Interface
;;; Join Block1 and Block2.
(declare (type cblock block1 block2))
(assert (not (member block2 (block-succ block1))))
(push block2 (block-succ block1))
(push block1 (block-pred block2))
(undefined-value))
;;; UNLINK-BLOCKS -- Interface
;;;
;;; Like LINK-BLOCKS, but we separate BLOCK1 and BLOCK2. If this leaves a
;;; successor with a single predecessor that ends in an IF, then set
;;; BLOCK-TEST-MODIFIED so that any test constraint will now be able to be
;;; propagated to the successor.
(declare (type cblock block1 block2))
(assert (member block2 (block-succ block1)))
(setf (block-succ block1)
(delete block2 (block-succ block1)))
(let ((new-pred (delete block1 (block-pred block2))))
(setf (block-pred block2) new-pred)
(when (and new-pred (null (rest new-pred)))
(let ((pred-block (first new-pred)))
(when (if-p (block-last pred-block))
(setf (block-test-modified pred-block) t)))))
(undefined-value))
;;; Change-Block-Successor -- Internal
;;;
;;; Swing the succ/pred link between Block and Old to be between Block and
;;; New. If Block ends in an IF, then we have to fix up the
;;; consequent/alternative blocks to point to New. We also set
;;; BLOCK-TEST-MODIFIED so that any test constraint will be applied to the new
;;; successor.
;;;
(defun change-block-successor (block old new)
(declare (type cblock new old block))
(unlink-blocks block old)
(setf (component-reanalyze (block-component block)) t)
(unless (member new (block-succ block))
(link-blocks block new))
(let ((last (block-last block)))
(when (if-p last)
(setf (block-test-modified block) t)
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
(macrolet ((frob (slot)
`(when (eq (,slot last) old)
(setf (,slot last) new))))
(frob if-consequent)
(frob if-alternative))))
(undefined-value))
;;; Remove-From-DFO -- Interface
;;;
;;; Unlink a block from the next/prev chain. We also null out the
;;; Component.
;;;
(proclaim '(function remove-from-dfo (cblock) void))
(defun remove-from-dfo (block)
(let ((next (block-next block))
(prev (block-prev block)))
(setf (block-component block) nil)
(setf (block-next prev) next)
(setf (block-prev next) prev)))
;;; Add-To-DFO -- Interface
;;;
;;; Add Block to the next/prev chain following After. We also set the
;;; Component to be the same as for After.
;;;
(defun add-to-dfo (block after)
(declare (type cblock block after))
(let ((next (block-next after))
(comp (block-component after)))
(assert (not (eq (component-kind comp) :deleted)))
(setf (block-component block) comp)
(setf (block-next after) block)
(setf (block-prev block) after)
(setf (block-next block) next)
(setf (block-prev next) block))
(undefined-value))
;;; Clear-Flags -- Interface
;;;
;;; Set the Flag for all the blocks in Component to NIL, except for the head
;;; and tail which are set to T.
;;;
(proclaim '(function clear-flags (component) void))
(defun clear-flags (component)
(let ((head (component-head component))
(tail (component-tail component)))
(setf (block-flag head) t)
(setf (block-flag tail) t)
(do-blocks (block component)
(setf (block-flag block) nil))))
;;; Make-Empty-Component -- Interface
;;;
;;; Make a component with no blocks in it. The Block-Flag is initially true
;;; in the head and tail blocks.
;;;
(proclaim '(function make-empty-component () component))
(defun make-empty-component ()
(let* ((head (make-block-key :start nil :component nil))
(tail (make-block-key :start nil :component nil))
(res (make-component :head head :tail tail)))
(setf (block-flag head) t)
(setf (block-flag tail) t)
(setf (block-component head) res)
(setf (block-component tail) res)
(setf (block-next head) tail)
(setf (block-prev tail) head)
res))
;;; Node-Ends-Block -- Interface
;;;
;;; Makes Node the Last node in its block, splitting the block if necessary.
;;; The new block is added to the DFO immediately following Node's block.
;;;
(defun node-ends-block (node)
(declare (type node node))
(let* ((block (node-block node))
(start (node-cont node))
(last (block-last block))
(last-cont (node-cont last)))
(unless (eq last node)
(assert (and (eq (continuation-kind start) :inside-block)
(not (block-delete-p block))))
(let* ((succ (block-succ block))
(new-block
(make-block-key :start start
:component (block-component block)
:start-uses (list (continuation-use start))
:succ succ :last last)))
(setf (continuation-kind start) :block-start)
(dolist (b succ)
(setf (block-pred b)
(cons new-block (remove block (block-pred b)))))
(setf (block-succ block) ())
(setf (block-last block) node)
(link-blocks block new-block)
(add-to-dfo new-block block)
(setf (component-reanalyze (block-component block)) t)
(do ((cont start (node-cont (continuation-next cont))))
((eq cont last-cont)
(when (eq (continuation-kind last-cont) :inside-block)
(setf (continuation-block last-cont) new-block)))
(setf (continuation-block cont) new-block))
(setf (block-type-asserted block) t)
(setf (block-test-modified block) t))))
(undefined-value))
;;;; Deleting stuff:
;;; Delete-Lambda-Var -- Internal
;;;
;;; Deal with deleting the last (read) reference to a lambda-var. We
;;; iterate over all local calls flushing the corresponding argument, allowing
;;; the computation of the argument to be deleted. We also mark the let for
;;; reoptimization, since it may be that we have deleted the last variable.
;;;
;;; The lambda-var may still have some sets, but this doesn't cause too much
;;; difficulty, since we can efficiently implement write-only variables. We
;;; iterate over the sets, marking their blocks for dead code flushing, since
;;; we can delete sets whose value is unused.
;;;
(defun delete-lambda-var (leaf)
(declare (type lambda-var leaf))
(let* ((fun (lambda-var-home leaf))
(n (position leaf (lambda-vars fun))))
(dolist (ref (leaf-refs fun))
(let* ((cont (node-cont ref))
(dest (continuation-dest cont)))
(when (and (combination-p dest)
(eq (basic-combination-fun dest) cont)
(eq (basic-combination-kind dest) :local))
(let* ((args (basic-combination-args dest))
(arg (elt args n)))
(reoptimize-continuation arg)
(flush-dest arg)
(setf (elt args n) nil))))))
(dolist (set (lambda-var-sets leaf))
(setf (block-flush-p (node-block set)) t))
(undefined-value))
;;; REOPTIMIZE-LAMBDA-VAR -- Internal
;;;
;;; Note that something interesting has happened to Var. We only deal with
;;; LET variables, marking the corresponding initial value arg as needing to be
;;; reoptimized.
;;;
(defun reoptimize-lambda-var (var)
(declare (type lambda-var var))
(let ((fun (lambda-var-home var)))
(when (and (eq (functional-kind fun) :let)
(leaf-refs var))
(reoptimize-continuation
(elt (basic-combination-args
(continuation-dest
(node-cont
(first (leaf-refs fun)))))
(position var (lambda-vars fun))))))
(undefined-value))
;;; DELETE-FUNCTIONAL -- Interface
;;;
;;; This function deletes functions that have no references. This need only
;;; be called on functions that never had any references, since otherwise
;;; DELETE-REF will handle the deletion.
;;;
(defun delete-functional (fun)
(assert (and (null (leaf-refs fun))
(not (functional-entry-function fun))))
(etypecase fun
(optional-dispatch (delete-optional-dispatch fun))
(clambda (delete-lambda fun)))
(undefined-value))
;;; MAYBE-REMOVE-FREE-FUNCTION -- Interface
;;;
;;; This function is called when we let convert a function or blow away an
;;; XEP, or otherwise do something that should prevent any new references to
;;; Fun (or its optional-dispatch) from being created.
;;;
(defun maybe-remove-free-function (fun)
(declare (type functional fun))
(let* ((fun (etypecase fun
(clambda (or (lambda-optional-dispatch fun) fun))
(optional-dispatch fun)))
(entry (gethash (leaf-name fun) *free-functions*)))
(when (eq entry fun)
(remhash (leaf-name fun) *free-functions*)))
(undefined-value))
;;; Delete-Lambda -- Internal
;;;
;;; Deal with deleting the last reference to a lambda. Since there is only
;;; one way into a lambda, deleting the last reference to a lambda ensures that
;;; there is no way to reach any of the code in it. So we just set the
;;; Functional-Kind for Fun and its Lets to :Deleted, causing IR1 optimization
;;; to delete blocks in that lambda.
;;;
;;; If the function isn't a Let, we unlink the function head and tail from
;;; the component head and tail to indicate that the code is unreachable. We
;;; also delete the function from Component-Lambdas (it won't be there before
;;; local call analysis, but no matter.) If the lambda was never referenced,
;;; we give a note.
;;;
;;; If the lambda is an XEP, then we null out the Entry-Function in its
;;; Entry-Function so that people will know that it is not an entry point
;;; anymore.
;;;
(defun delete-lambda (leaf)
(declare (type clambda leaf))
(let ((kind (functional-kind leaf))
(bind (lambda-bind leaf)))
(assert (not (member kind '(:deleted :optional :top-level))))
(setf (functional-kind leaf) :deleted)
(setf (lambda-bind leaf) nil)
(setf (lambda-bind let) nil)
(if (member kind '(:let :mv-let :assignment))
(let ((home (lambda-home leaf)))
(setf (lambda-lets home) (delete leaf (lambda-lets home))))
(let* ((bind-block (node-block bind))
(component (block-component bind-block))
(return (lambda-return leaf)))
(assert (null (leaf-refs leaf)))
(unless (leaf-ever-used leaf)
(let ((*compiler-error-context* bind))
(compiler-note "Deleting unused function~:[.~;~:*~% ~S~]"
(leaf-name leaf))))
(unlink-blocks (component-head component) bind-block)
(when return
(unlink-blocks (node-block return) (component-tail component)))
(setf (component-reanalyze component) t)
(let ((tails (lambda-tail-set leaf)))
(setf (tail-set-functions tails)
(delete leaf (tail-set-functions tails)))
(setf (lambda-tail-set leaf) nil))
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
(setf (component-lambdas component)
(delete leaf (component-lambdas component)))))
(when (eq kind :external)
(let ((fun (functional-entry-function leaf)))
(setf (functional-entry-function fun) nil)
(when (optional-dispatch-p fun)
(delete-optional-dispatch fun)))))
(undefined-value))
;;; Delete-Optional-Dispatch -- Internal
;;;
;;; Deal with deleting the last reference to an Optional-Dispatch. We have
;;; to be a bit more careful than with lambdas, since Delete-Ref is used both
;;; before and after local call analysis. Afterward, all references to
;;; still-existing optional-dispatches have been moved to the XEP, leaving it
;;; with no references at all. So we look at the XEP to see if an
;;; optional-dispatch is still really being used. But before local call
;;; analysis, there are no XEPs, and all references are direct.
;;;
;;; When we do delete the optional-dispatch, we grovel all of its
;;; entry-points, making them be normal lambdas, and then deleting the ones
;;; with no references. This deletes any e-p lambdas that were either never
;;; referenced, or couldn't be deleted when the last deference was deleted (due
;;; to their :Optional kind.)
;;;
;;; Note that the last optional ep may alias the main entry, so when we process
;;; the main entry, its kind may have been changed to NIL or even converted to
;;; a let.
;;;
(defun delete-optional-dispatch (leaf)
(declare (type optional-dispatch leaf))
(maybe-remove-free-function leaf)
(let ((entry (functional-entry-function leaf)))
(unless (and entry (leaf-refs entry))
(assert (or (not entry) (eq (functional-kind entry) :deleted)))
(setf (functional-kind leaf) :deleted)
(flet ((frob (fun)
(unless (eq (functional-kind fun) :deleted)
(assert (eq (functional-kind fun) :optional))
(setf (functional-kind fun) nil)
(let ((refs (leaf-refs fun)))
(cond ((null refs)
(delete-lambda fun))
((null (rest refs))
(or (maybe-let-convert fun)
(maybe-convert-to-assignment fun)))
(t
(maybe-convert-to-assignment fun)))))))
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
(dolist (ep (optional-dispatch-entry-points leaf))
(frob ep))
(when (optional-dispatch-more-entry leaf)
(frob (optional-dispatch-more-entry leaf)))
(let ((main (optional-dispatch-main-entry leaf)))
(when (eq (functional-kind main) :optional)
(frob main))))))
(undefined-value))
;;; Delete-Ref -- Interface
;;;
;;; Do stuff to delete the semantic attachments of a Ref node. When this
;;; leaves zero or one reference, we do a type dispatch off of the leaf to
;;; determine if a special action is appropriate.
;;;
(defun delete-ref (ref)
(declare (type ref ref))
(let* ((leaf (ref-leaf ref))
(refs (delete ref (leaf-refs leaf))))
(setf (leaf-refs leaf) refs)
(cond ((null refs)
(typecase leaf
(lambda-var (delete-lambda-var leaf))
(clambda
(ecase (functional-kind leaf)
((nil :let :mv-let :assignment :escape :cleanup)
(assert (not (functional-entry-function leaf)))
(delete-lambda leaf))
(delete-lambda leaf))
((:deleted :optional))))
(optional-dispatch
(unless (eq (functional-kind leaf) :deleted)
(delete-optional-dispatch leaf)))))
((null (rest refs))
(typecase leaf
(clambda (or (maybe-let-convert leaf)
(maybe-convert-to-assignment leaf)))
(lambda-var (reoptimize-lambda-var leaf))))
(t
(typecase leaf
(clambda (maybe-convert-to-assignment leaf))))))
(undefined-value))
;;; Delete-Return -- Interface
;;;
;;; Do stuff to indicate that the return node Node is being deleted. We set
;;; the RETURN to NIL.
;;;
(defun delete-return (node)
(declare (type creturn node))
(let ((fun (return-lambda node)))
(assert (lambda-return fun))
(setf (lambda-return fun) nil))
(undefined-value))
;;; NOTE-UNREFERENCED-VARS -- Interface
;;;
;;; If any of the Vars in fun were never referenced and was not declared
;;; IGNORE, then complain.
;;;
(defun note-unreferenced-vars (fun)
(declare (type clambda fun))
(dolist (var (lambda-vars fun))
(unless (or (leaf-ever-used var)
(lambda-var-ignorep var))
(let ((*compiler-error-context* (lambda-bind fun)))
(unless (policy *compiler-error-context* (= brevity 3))
(compiler-warning "Variable ~S defined but never used."
(leaf-name var)))
(setf (leaf-ever-used var) t))))
(undefined-value))
;;; Flush-Dest -- Interface
;;;
;;; This function is called by people who delete nodes; it provides a way to
;;; indicate that the value of a continuation is no longer used. We null out
;;; the Continuation-Dest, set Flush-P in the blocks containing uses of Cont
;;; and set Component-Reoptimize. If the Prev of the use is deleted, then we
;;; blow off reoptimization.
;;;
;;; If the continuation is :Deleted, then we don't do anything, since all
;;; semantics have already been flushed. :Deleted-Block-Start start
;;; continuations are treated just like :Block-Start; it is possible that the
;;; continuation may be given a new dest (e.g. by SUBSTITUTE-CONTINUATION), so
;;; we don't want to delete it.
;;;
(defun flush-dest (cont)
(declare (type continuation cont))
(unless (eq (continuation-kind cont) :deleted)
(assert (continuation-dest cont))
(setf (continuation-dest cont) nil)
(do-uses (use cont)
(let ((prev (node-prev use)))
(unless (eq (continuation-kind prev) :deleted)
(let ((block (continuation-block prev)))
(setf (component-reoptimize (block-component block)) t)
(setf (block-attributep (block-flags block) flush-p type-asserted)
t))))))
(setf (continuation-%type-check cont) nil)
(undefined-value))
;;; MARK-FOR-DELETION -- Internal
;;;
;;; Do a graph walk backward from Block, marking all predecessor blocks with
;;; the DELETE-P flag.
;;;
(defun mark-for-deletion (block)
(declare (type cblock block))
(unless (block-delete-p block)
(setf (block-delete-p block) t)
(setf (component-reanalyze (block-component block)) t)
(dolist (pred (block-pred block))
(mark-for-deletion pred)))
(undefined-value))
;;; DELETE-CONTINUATION -- Interface
;;;
;;; Delete Cont, eliminating both control and value semantics. We set
;;; FLUSH-P and COMPONENT-REOPTIMIZE similarly to in FLUSH-DEST. Here we must
;;; get the component from the use block, since the continuation may be a
;;; :DELETED-BLOCK-START.
;;;
;;; If Cont has DEST, then it must be the case that the DEST is unreachable,
;;; since we can't compute the value desired. In this case, we call
;;; MARK-FOR-DELETION to cause the DEST block and its predecessors to tell
;;; people to ignore them, and to cause them to be deleted eventually.
;;;
(defun delete-continuation (cont)
(declare (type continuation cont))
(assert (not (eq (continuation-kind cont) :deleted)))
(do-uses (use cont)
(let ((prev (node-prev use)))
(unless (eq (continuation-kind prev) :deleted)
(let ((block (continuation-block prev)))
(setf (block-attributep (block-flags block) flush-p type-asserted) t)
(setf (component-reoptimize (block-component block)) t)))))
(let ((dest (continuation-dest cont)))
(when dest
(let ((prev (node-prev dest)))
(when (and prev
(not (eq (continuation-kind prev) :deleted)))
(let ((block (continuation-block prev)))
(unless (block-delete-p block)
(mark-for-deletion block)))))))
(setf (continuation-kind cont) :deleted)
(setf (continuation-dest cont) nil)
(setf (continuation-next cont) nil)
(setf (continuation-asserted-type cont) *empty-type*)
(setf (continuation-%derived-type cont) *empty-type*)
(setf (continuation-use cont) nil)
(setf (continuation-block cont) nil)
(setf (continuation-reoptimize cont) nil)
(setf (continuation-%type-check cont) nil)
(setf (continuation-info cont) nil)
(undefined-value))
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
(defvar *deletion-ignored-objects* '(t nil))
;;; PRESENT-IN-FORM -- Internal
;;;
;;; Return true if we can find Obj in Form, NIL otherwise. We bound our
;;; recursion so that we don't get lost in circular structures. We ignore the
;;; car of forms if they are a symbol (to prevent confusing function
;;; referencess with variables), and we also ignore anything inside ' or #'.
;;;
(defun present-in-form (obj form depth)
(declare (type (integer 0 20) depth))
(cond ((= depth 20) nil)
((eq obj form) t)
((atom form) nil)
(t
(let ((first (car form))
(depth (1+ depth)))
(if (member first '(quote function))
nil
(or (and (not (symbolp first))
(present-in-form obj first depth))
(do ((l (cdr form) (cdr l))
(n 0 (1+ n)))
((or (atom l) (> n 100))
nil)
(declare (fixnum n))
(when (present-in-form obj (car l) depth)
(return t)))))))))
;;; NOTE-BLOCK-DELETION -- Internal
;;;
;;; This function is called on a block immediately before we delete it. We
;;; check to see if any of the code about to die appeared in the original
;;; source, and emit a note if so.
;;;
;;; If the block was in a lambda is now deleted, then we ignore the whole
;;; block, since this case is picked off in DELETE-LAMBDA. We also ignore the
;;; deletion of CRETURN nodes, since it is somewhat reasonable for a function
;;; to not return, and there is a different note for that case anyway.
;;;
;;; If the actual source is an atom, then we use a bunch of heuristics to
;;; guess whether this reference really appeared in the original source:
;;; -- If a symbol, it must be interned and not a keyword.
;;; -- It must not be an easily introduced constant (T or NIL, a fixnum or a
;;; character.)
;;; -- The atom must be "present" in the original source form, and present in
;;; all intervening actual source forms.
;;;
(defun note-block-deletion (block)
(let ((home (block-home-lambda block)))
(unless (eq (functional-kind home) :deleted)