1 ;;;; This file implements local call analysis. A local call is a
2 ;;;; function call between functions being compiled at the same time.
3 ;;;; If we can tell at compile time that such a call is legal, then we
4 ;;;; change the combination to call the correct lambda, mark it as
5 ;;;; local, and add this link to our call graph. Once a call is local,
6 ;;;; it is then eligible for let conversion, which places the body of
7 ;;;; the function inline.
9 ;;;; We cannot always do a local call even when we do have the
10 ;;;; function being called. Calls that cannot be shown to have legal
11 ;;;; arg counts are not converted.
13 ;;;; This software is part of the SBCL system. See the README file for
14 ;;;; more information.
16 ;;;; This software is derived from the CMU CL system, which was
17 ;;;; written at Carnegie Mellon University and released into the
18 ;;;; public domain. The software is in the public domain and is
19 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
20 ;;;; files for more information.
24 ;;; This function propagates information from the variables in the function
25 ;;; Fun to the actual arguments in Call. This is also called by the VALUES IR1
26 ;;; optimizer when it sleazily converts MV-BINDs to LETs.
28 ;;; We flush all arguments to Call that correspond to unreferenced variables
29 ;;; in Fun. We leave NILs in the Combination-Args so that the remaining args
30 ;;; still match up with their vars.
32 ;;; We also apply the declared variable type assertion to the argument
34 (defun propagate-to-args (call fun)
35 (declare (type combination call) (type clambda fun))
36 (do ((args (basic-combination-args call) (cdr args))
37 (vars (lambda-vars fun) (cdr vars)))
39 (let ((arg (car args))
41 (cond ((leaf-refs var)
42 (assert-continuation-type arg (leaf-type var)))
45 (setf (car args) nil)))))
49 ;;; This function handles merging the tail sets if Call is potentially
50 ;;; tail-recursive, and is a call to a function with a different TAIL-SET than
51 ;;; Call's Fun. This must be called whenever we alter IR1 so as to place a
52 ;;; local call in what might be a TR context. Note that any call which returns
53 ;;; its value to a RETURN is considered potentially TR, since any implicit
54 ;;; MV-PROG1 might be optimized away.
56 ;;; We destructively modify the set for the calling function to represent both,
57 ;;; and then change all the functions in callee's set to reference the first.
58 ;;; If we do merge, we reoptimize the RETURN-RESULT continuation to cause
59 ;;; IR1-OPTIMIZE-RETURN to recompute the tail set type.
60 (defun merge-tail-sets (call &optional (new-fun (combination-lambda call)))
61 (declare (type basic-combination call) (type clambda new-fun))
62 (let ((return (continuation-dest (node-cont call))))
63 (when (return-p return)
64 (let ((call-set (lambda-tail-set (node-home-lambda call)))
65 (fun-set (lambda-tail-set new-fun)))
66 (unless (eq call-set fun-set)
67 (let ((funs (tail-set-functions fun-set)))
69 (setf (lambda-tail-set fun) call-set))
70 (setf (tail-set-functions call-set)
71 (nconc (tail-set-functions call-set) funs)))
72 (reoptimize-continuation (return-result return))
75 ;;; Convert a combination into a local call. We PROPAGATE-TO-ARGS, set
76 ;;; the combination kind to :LOCAL, add FUN to the CALLS of the
77 ;;; function that the call is in, call MERGE-TAIL-SETS, then replace
78 ;;; the function in the REF node with the new function.
80 ;;; We change the REF last, since changing the reference can trigger
81 ;;; LET conversion of the new function, but will only do so if the
82 ;;; call is local. Note that the replacement may trigger LET
83 ;;; conversion or other changes in IR1. We must call MERGE-TAIL-SETS
84 ;;; with NEW-FUN before the substitution, since after the substitution
85 ;;; (and LET conversion), the call may no longer be recognizable as
87 (defun convert-call (ref call fun)
88 (declare (type ref ref) (type combination call) (type clambda fun))
89 (propagate-to-args call fun)
90 (setf (basic-combination-kind call) :local)
91 (pushnew fun (lambda-calls (node-home-lambda call)))
92 (merge-tail-sets call fun)
93 (change-ref-leaf ref fun)
96 ;;;; external entry point creation
98 ;;; Return a Lambda form that can be used as the definition of the XEP
101 ;;; If FUN is a lambda, then we check the number of arguments
102 ;;; (conditional on policy) and call FUN with all the arguments.
104 ;;; If FUN is an OPTIONAL-DISPATCH, then we dispatch off of the number
105 ;;; of supplied arguments by doing do an = test for each entry-point,
106 ;;; calling the entry with the appropriate prefix of the passed
109 ;;; If there is a more arg, then there are a couple of optimizations
110 ;;; that we make (more for space than anything else):
111 ;;; -- If MIN-ARGS is 0, then we make the more entry a T clause, since
112 ;;; no argument count error is possible.
113 ;;; -- We can omit the = clause for the last entry-point, allowing the
114 ;;; case of 0 more args to fall through to the more entry.
116 ;;; We don't bother to policy conditionalize wrong arg errors in
117 ;;; optional dispatches, since the additional overhead is negligible
118 ;;; compared to the cost of everything else going on.
120 ;;; Note that if policy indicates it, argument type declarations in
121 ;;; Fun will be verified. Since nothing is known about the type of the
122 ;;; XEP arg vars, type checks will be emitted when the XEP's arg vars
123 ;;; are passed to the actual function.
124 (defun make-xep-lambda (fun)
125 (declare (type functional fun))
128 (let ((nargs (length (lambda-vars fun)))
129 (n-supplied (gensym))
130 (temps (make-gensym-list (length (lambda-vars fun)))))
131 `(lambda (,n-supplied ,@temps)
132 (declare (type index ,n-supplied))
133 ,(if (policy nil (zerop safety))
134 `(declare (ignore ,n-supplied))
135 `(%verify-argument-count ,n-supplied ,nargs))
136 (%funcall ,fun ,@temps))))
138 (let* ((min (optional-dispatch-min-args fun))
139 (max (optional-dispatch-max-args fun))
140 (more (optional-dispatch-more-entry fun))
141 (n-supplied (gensym))
142 (temps (make-gensym-list max)))
144 (do ((eps (optional-dispatch-entry-points fun) (rest eps))
147 (entries `((= ,n-supplied ,n)
148 (%funcall ,(first eps) ,@(subseq temps 0 n)))))
149 `(lambda (,n-supplied ,@temps)
150 ;; FIXME: Make sure that INDEX type distinguishes between
151 ;; target and host. (Probably just make the SB!XC:DEFTYPE
152 ;; different from CL:DEFTYPE.)
153 (declare (type index ,n-supplied))
155 ,@(if more (butlast (entries)) (entries))
157 `((,(if (zerop min) 't `(>= ,n-supplied ,max))
158 ,(let ((n-context (gensym))
160 `(multiple-value-bind (,n-context ,n-count)
161 (%more-arg-context ,n-supplied ,max)
162 (%funcall ,more ,@temps ,n-context ,n-count))))))
164 (%argument-count-error ,n-supplied)))))))))
166 ;;; Make an external entry point (XEP) for FUN and return it. We
167 ;;; convert the result of MAKE-XEP-LAMBDA in the correct environment,
168 ;;; then associate this lambda with FUN as its XEP. After the
169 ;;; conversion, we iterate over the function's associated lambdas,
170 ;;; redoing local call analysis so that the XEP calls will get
171 ;;; converted. We also bind *LEXENV* to change the compilation policy
172 ;;; over to the interface policy.
174 ;;; We set REANALYZE and REOPTIMIZE in the component, just in case we
175 ;;; discover an XEP after the initial local call analyze pass.
176 (defun make-external-entry-point (fun)
177 (declare (type functional fun))
178 (assert (not (functional-entry-function fun)))
179 (with-ir1-environment (lambda-bind (main-entry fun))
180 (let* ((*lexenv* (make-lexenv :policy (make-interface-policy *lexenv*)))
181 (res (ir1-convert-lambda (make-xep-lambda fun))))
182 (setf (functional-kind res) :external)
183 (setf (leaf-ever-used res) t)
184 (setf (functional-entry-function res) fun)
185 (setf (functional-entry-function fun) res)
186 (setf (component-reanalyze *current-component*) t)
187 (setf (component-reoptimize *current-component*) t)
189 (clambda (local-call-analyze-1 fun))
191 (dolist (ep (optional-dispatch-entry-points fun))
192 (local-call-analyze-1 ep))
193 (when (optional-dispatch-more-entry fun)
194 (local-call-analyze-1 (optional-dispatch-more-entry fun)))))
197 ;;; Notice a Ref that is not in a local-call context. If the Ref is
198 ;;; already to an XEP, then do nothing, otherwise change it to the
199 ;;; XEP, making an XEP if necessary.
201 ;;; If Ref is to a special :Cleanup or :Escape function, then we treat
202 ;;; it as though it was not an XEP reference (i.e. leave it alone.)
203 (defun reference-entry-point (ref)
204 (declare (type ref ref))
205 (let ((fun (ref-leaf ref)))
206 (unless (or (external-entry-point-p fun)
207 (member (functional-kind fun) '(:escape :cleanup)))
208 (change-ref-leaf ref (or (functional-entry-function fun)
209 (make-external-entry-point fun))))))
211 ;;; Attempt to convert all references to Fun to local calls. The
212 ;;; reference must be the function for a call, and the function
213 ;;; continuation must be used only once, since otherwise we cannot be
214 ;;; sure what function is to be called. The call continuation would be
215 ;;; multiply used if there is hairy stuff such as conditionals in the
216 ;;; expression that computes the function.
218 ;;; If we cannot convert a reference, then we mark the referenced
219 ;;; function as an entry-point, creating a new XEP if necessary. We
220 ;;; don't try to convert calls that are in error (:ERROR kind.)
222 ;;; This is broken off from Local-Call-Analyze so that people can
223 ;;; force analysis of newly introduced calls. Note that we don't do
224 ;;; LET conversion here.
225 (defun local-call-analyze-1 (fun)
226 (declare (type functional fun))
227 (let ((refs (leaf-refs fun))
230 (let* ((cont (node-cont ref))
231 (dest (continuation-dest cont)))
232 (cond ((and (basic-combination-p dest)
233 (eq (basic-combination-fun dest) cont)
234 (eq (continuation-use cont) ref))
236 (convert-call-if-possible ref dest)
238 (unless (eq (basic-combination-kind dest) :local)
239 (reference-entry-point ref)))
241 (reference-entry-point ref))))
242 (setq first-time nil)))
246 ;;; We examine all New-Functions in component, attempting to convert
247 ;;; calls into local calls when it is legal. We also attempt to
248 ;;; convert each lambda to a LET. LET conversion is also triggered by
249 ;;; deletion of a function reference, but functions that start out
250 ;;; eligible for conversion must be noticed sometime.
252 ;;; Note that there is a lot of action going on behind the scenes
253 ;;; here, triggered by reference deletion. In particular, the
254 ;;; COMPONENT-LAMBDAS are being hacked to remove newly deleted and let
255 ;;; converted lambdas, so it is important that the lambda is added to
256 ;;; the COMPONENT-LAMBDAS when it is. Also, the
257 ;;; COMPONENT-NEW-FUNCTIONS may contain all sorts of drivel, since it
258 ;;; is not updated when we delete functions, etc. Only
259 ;;; COMPONENT-LAMBDAS is updated.
261 ;;; COMPONENT-REANALYZE-FUNCTIONS is treated similarly to
262 ;;; NEW-FUNCTIONS, but we don't add lambdas to the LAMBDAS.
263 (defun local-call-analyze (component)
264 (declare (type component component))
266 (let* ((new (pop (component-new-functions component)))
267 (fun (or new (pop (component-reanalyze-functions component)))))
268 (unless fun (return))
269 (let ((kind (functional-kind fun)))
270 (cond ((member kind '(:deleted :let :mv-let :assignment)))
271 ((and (null (leaf-refs fun)) (eq kind nil)
272 (not (functional-entry-function fun)))
273 (delete-functional fun))
275 (when (and new (lambda-p fun))
276 (push fun (component-lambdas component)))
277 (local-call-analyze-1 fun)
279 (maybe-let-convert fun)))))))
283 ;;; If policy is auspicious, CALL is not in an XEP, and we don't seem
284 ;;; to be in an infinite recursive loop, then change the reference to
285 ;;; reference a fresh copy. We return whichever function we decide to
287 (defun maybe-expand-local-inline (fun ref call)
288 (if (and (policy call
289 (and (>= speed space) (>= speed compilation-speed)))
290 (not (eq (functional-kind (node-home-lambda call)) :external))
291 (not *converting-for-interpreter*)
292 (inline-expansion-ok call))
293 (with-ir1-environment call
294 (let* ((*lexenv* (functional-lexenv fun))
296 (res (catch 'local-call-lossage
298 (ir1-convert-lambda (functional-inline-expansion fun))
301 (change-ref-leaf ref res)
304 (let ((*compiler-error-context* call))
305 (compiler-note "couldn't inline expand because expansion ~
306 calls this let-converted local function:~
312 ;;; Dispatch to the appropriate function to attempt to convert a call. Ref
313 ;;; most be a reference to a FUNCTIONAL. This is called in IR1 optimize as
314 ;;; well as in local call analysis. If the call is is already :Local, we do
315 ;;; nothing. If the call is already scheduled for deletion, also do nothing
316 ;;; (in addition to saving time, this also avoids some problems with optimizing
317 ;;; collections of functions that are partially deleted.)
319 ;;; This is called both before and after FIND-INITIAL-DFO runs. When called
320 ;;; on a :INITIAL component, we don't care whether the caller and callee are in
321 ;;; the same component. Afterward, we must stick with whatever component
322 ;;; division we have chosen.
324 ;;; Before attempting to convert a call, we see whether the function is
325 ;;; supposed to be inline expanded. Call conversion proceeds as before
326 ;;; after any expansion.
328 ;;; We bind *Compiler-Error-Context* to the node for the call so that
329 ;;; warnings will get the right context.
330 (defun convert-call-if-possible (ref call)
331 (declare (type ref ref) (type basic-combination call))
332 (let* ((block (node-block call))
333 (component (block-component block))
334 (original-fun (ref-leaf ref)))
335 (assert (functional-p original-fun))
336 (unless (or (member (basic-combination-kind call) '(:local :error))
337 (block-delete-p block)
338 (eq (functional-kind (block-home-lambda block)) :deleted)
339 (member (functional-kind original-fun)
340 '(:top-level-xep :deleted))
341 (not (or (eq (component-kind component) :initial)
344 (lambda-bind (main-entry original-fun))))
346 (let ((fun (if (external-entry-point-p original-fun)
347 (functional-entry-function original-fun)
349 (*compiler-error-context* call))
351 (when (and (eq (functional-inlinep fun) :inline)
352 (rest (leaf-refs original-fun)))
353 (setq fun (maybe-expand-local-inline fun ref call)))
355 (assert (member (functional-kind fun)
356 '(nil :escape :cleanup :optional)))
357 (cond ((mv-combination-p call)
358 (convert-mv-call ref call fun))
360 (convert-lambda-call ref call fun))
362 (convert-hairy-call ref call fun))))))
366 ;;; Attempt to convert a multiple-value call. The only interesting
367 ;;; case is a call to a function that Looks-Like-An-MV-Bind, has
368 ;;; exactly one reference and no XEP, and is called with one values
371 ;;; We change the call to be to the last optional entry point and
372 ;;; change the call to be local. Due to our preconditions, the call
373 ;;; should eventually be converted to a let, but we can't do that now,
374 ;;; since there may be stray references to the e-p lambda due to
375 ;;; optional defaulting code.
377 ;;; We also use variable types for the called function to construct an
378 ;;; assertion for the values continuation.
380 ;;; See CONVERT-CALL for additional notes on MERGE-TAIL-SETS, etc.
381 (defun convert-mv-call (ref call fun)
382 (declare (type ref ref) (type mv-combination call) (type functional fun))
383 (when (and (looks-like-an-mv-bind fun)
384 (not (functional-entry-function fun))
385 (= (length (leaf-refs fun)) 1)
386 (= (length (basic-combination-args call)) 1))
387 (let ((ep (car (last (optional-dispatch-entry-points fun)))))
388 (setf (basic-combination-kind call) :local)
389 (pushnew ep (lambda-calls (node-home-lambda call)))
390 (merge-tail-sets call ep)
391 (change-ref-leaf ref ep)
393 (assert-continuation-type
394 (first (basic-combination-args call))
395 (make-values-type :optional (mapcar #'leaf-type (lambda-vars ep))
396 :rest *universal-type*))))
399 ;;; Attempt to convert a call to a lambda. If the number of args is
400 ;;; wrong, we give a warning and mark the call as :ERROR to remove it
401 ;;; from future consideration. If the argcount is O.K. then we just
403 (defun convert-lambda-call (ref call fun)
404 (declare (type ref ref) (type combination call) (type clambda fun))
405 (let ((nargs (length (lambda-vars fun)))
406 (call-args (length (combination-args call))))
407 (cond ((= call-args nargs)
408 (convert-call ref call fun))
410 ;; FIXME: ANSI requires in "3.2.5 Exceptional Situations in the
411 ;; Compiler" that calling a function with "the wrong number of
412 ;; arguments" be only a STYLE-ERROR. I think, though, that this
413 ;; should only apply when the number of arguments is inferred
414 ;; from a previous definition. If the number of arguments
415 ;; is DECLAIMed, surely calling with the wrong number is a
416 ;; real WARNING. As long as SBCL continues to use CMU CL's
417 ;; non-ANSI DEFUN-is-a-DECLAIM policy, we're in violation here,
418 ;; but as long as we continue to use that policy, that's the
419 ;; not our biggest problem.:-| When we fix that policy, this
420 ;; should come back into compliance. (So fix that policy!)
422 "function called with ~R argument~:P, but wants exactly ~R"
424 (setf (basic-combination-kind call) :error)))))
426 ;;;; optional, more and keyword calls
428 ;;; Similar to Convert-Lambda-Call, but deals with Optional-Dispatches. If
429 ;;; only fixed args are supplied, then convert a call to the correct entry
430 ;;; point. If keyword args are supplied, then dispatch to a subfunction. We
431 ;;; don't convert calls to functions that have a more (or rest) arg.
432 (defun convert-hairy-call (ref call fun)
433 (declare (type ref ref) (type combination call)
434 (type optional-dispatch fun))
435 (let ((min-args (optional-dispatch-min-args fun))
436 (max-args (optional-dispatch-max-args fun))
437 (call-args (length (combination-args call))))
438 (cond ((< call-args min-args)
439 ;; FIXME: ANSI requires in "3.2.5 Exceptional Situations in the
440 ;; Compiler" that calling a function with "the wrong number of
441 ;; arguments" be only a STYLE-ERROR. I think, though, that this
442 ;; should only apply when the number of arguments is inferred
443 ;; from a previous definition. If the number of arguments
444 ;; is DECLAIMed, surely calling with the wrong number is a
445 ;; real WARNING. As long as SBCL continues to use CMU CL's
446 ;; non-ANSI DEFUN-is-a-DECLAIM policy, we're in violation here,
447 ;; but as long as we continue to use that policy, that's the
448 ;; not our biggest problem.:-| When we fix that policy, this
449 ;; should come back into compliance. (So fix that policy!)
451 "function called with ~R argument~:P, but wants at least ~R"
453 (setf (basic-combination-kind call) :error))
454 ((<= call-args max-args)
455 (convert-call ref call
456 (elt (optional-dispatch-entry-points fun)
457 (- call-args min-args))))
458 ((optional-dispatch-more-entry fun)
459 (convert-more-call ref call fun))
461 ;; FIXME: ANSI requires in "3.2.5 Exceptional Situations in the
462 ;; Compiler" that calling a function with "the wrong number of
463 ;; arguments" be only a STYLE-ERROR. I think, though, that this
464 ;; should only apply when the number of arguments is inferred
465 ;; from a previous definition. If the number of arguments
466 ;; is DECLAIMed, surely calling with the wrong number is a
467 ;; real WARNING. As long as SBCL continues to use CMU CL's
468 ;; non-ANSI DEFUN-is-a-DECLAIM policy, we're in violation here,
469 ;; but as long as we continue to use that policy, that's the
470 ;; not our biggest problem.:-| When we fix that policy, this
471 ;; should come back into compliance. (So fix that policy!)
473 "function called with ~R argument~:P, but wants at most ~R"
475 (setf (basic-combination-kind call) :error))))
478 ;;; This function is used to convert a call to an entry point when complex
479 ;;; transformations need to be done on the original arguments. Entry is the
480 ;;; entry point function that we are calling. Vars is a list of variable names
481 ;;; which are bound to the original call arguments. Ignores is the subset of
482 ;;; Vars which are ignored. Args is the list of arguments to the entry point
485 ;;; In order to avoid gruesome graph grovelling, we introduce a new function
486 ;;; that rearranges the arguments and calls the entry point. We analyze the
487 ;;; new function and the entry point immediately so that everything gets
488 ;;; converted during the single pass.
489 (defun convert-hairy-fun-entry (ref call entry vars ignores args)
490 (declare (list vars ignores args) (type ref ref) (type combination call)
491 (type clambda entry))
493 (with-ir1-environment call
496 (declare (ignorable . ,ignores))
497 (%funcall ,entry . ,args))))))
498 (convert-call ref call new-fun)
499 (dolist (ref (leaf-refs entry))
500 (convert-call-if-possible ref (continuation-dest (node-cont ref))))))
502 ;;; Use Convert-Hairy-Fun-Entry to convert a more-arg call to a known
503 ;;; function into a local call to the Main-Entry.
505 ;;; First we verify that all keywords are constant and legal. If there
506 ;;; aren't, then we warn the user and don't attempt to convert the call.
508 ;;; We massage the supplied keyword arguments into the order expected by the
509 ;;; main entry. This is done by binding all the arguments to the keyword call
510 ;;; to variables in the introduced lambda, then passing these values variables
511 ;;; in the correct order when calling the main entry. Unused arguments
512 ;;; (such as the keywords themselves) are discarded simply by not passing them
515 ;;; If there is a rest arg, then we bundle up the args and pass them to LIST.
516 (defun convert-more-call (ref call fun)
517 (declare (type ref ref) (type combination call) (type optional-dispatch fun))
518 (let* ((max (optional-dispatch-max-args fun))
519 (arglist (optional-dispatch-arglist fun))
520 (args (combination-args call))
521 (more (nthcdr max args))
522 (flame (policy call (or (> speed inhibit-warnings)
523 (> space inhibit-warnings))))
525 (temps (make-gensym-list max))
526 (more-temps (make-gensym-list (length more))))
531 (dolist (var arglist)
532 (let ((info (lambda-var-arg-info var)))
534 (ecase (arg-info-kind info)
538 ((:more-context :more-count)
539 (compiler-warning "can't local-call functions with &MORE args")
540 (setf (basic-combination-kind call) :error)
541 (return-from convert-more-call))))))
543 (when (optional-dispatch-keyp fun)
544 (when (oddp (length more))
545 (compiler-warning "function called with odd number of ~
546 arguments in keyword portion")
548 (setf (basic-combination-kind call) :error)
549 (return-from convert-more-call))
551 (do ((key more (cddr key))
552 (temp more-temps (cddr temp)))
554 (let ((cont (first key)))
555 (unless (constant-continuation-p cont)
557 (compiler-note "non-constant keyword in keyword call"))
558 (setf (basic-combination-kind call) :error)
559 (return-from convert-more-call))
561 (let ((name (continuation-value cont))
564 (dolist (var (key-vars)
568 (let ((info (lambda-var-arg-info var)))
569 (when (eq (arg-info-keyword info) name)
571 (supplied (cons var val))
574 (when (and loser (not (optional-dispatch-allowp fun)))
575 (compiler-warning "function called with unknown argument keyword ~S"
577 (setf (basic-combination-kind call) :error)
578 (return-from convert-more-call)))
580 (collect ((call-args))
581 (do ((var arglist (cdr var))
582 (temp temps (cdr temp)))
584 (let ((info (lambda-var-arg-info (car var))))
586 (ecase (arg-info-kind info)
588 (call-args (car temp))
589 (when (arg-info-supplied-p info)
592 (call-args `(list ,@more-temps))
596 (call-args (car temp)))))
598 (dolist (var (key-vars))
599 (let ((info (lambda-var-arg-info var))
600 (temp (cdr (assoc var (supplied)))))
603 (call-args (arg-info-default info)))
604 (when (arg-info-supplied-p info)
605 (call-args (not (null temp))))))
607 (convert-hairy-fun-entry ref call (optional-dispatch-main-entry fun)
608 (append temps more-temps)
609 (ignores) (call-args)))))
615 ;;;; Converting to a LET has differing significance to various parts of the
617 ;;;; -- The body of a LET is spliced in immediately after the corresponding
618 ;;;; combination node, making the control transfer explicit and allowing
619 ;;;; LETs to be mashed together into a single block. The value of the LET is
620 ;;;; delivered directly to the original continuation for the call,
621 ;;;; eliminating the need to propagate information from the dummy result
623 ;;;; -- As far as IR1 optimization is concerned, it is interesting in that
624 ;;;; there is only one expression that the variable can be bound to, and
625 ;;;; this is easily substitited for.
626 ;;;; -- LETs are interesting to environment analysis and to the back end
627 ;;;; because in most ways a LET can be considered to be "the same function"
628 ;;;; as its home function.
629 ;;;; -- LET conversion has dynamic scope implications, since control transfers
630 ;;;; within the same environment are local. In a local control transfer,
631 ;;;; cleanup code must be emitted to remove dynamic bindings that are no
632 ;;;; longer in effect.
634 ;;; Set up the control transfer to the called lambda. We split the call
635 ;;; block immediately after the call, and link the head of FUN to the call
636 ;;; block. The successor block after splitting (where we return to) is
639 ;;; If the lambda is is a different component than the call, then we call
640 ;;; JOIN-COMPONENTS. This only happens in block compilation before
641 ;;; FIND-INITIAL-DFO.
642 (defun insert-let-body (fun call)
643 (declare (type clambda fun) (type basic-combination call))
644 (let* ((call-block (node-block call))
645 (bind-block (node-block (lambda-bind fun)))
646 (component (block-component call-block)))
647 (let ((fun-component (block-component bind-block)))
648 (unless (eq fun-component component)
649 (assert (eq (component-kind component) :initial))
650 (join-components component fun-component)))
652 (let ((*current-component* component))
653 (node-ends-block call))
654 ;; FIXME: Use PROPER-LIST-OF-LENGTH-P here, and look for other
655 ;; uses of '=.*length' which could also be converted to use
656 ;; PROPER-LIST-OF-LENGTH-P.
657 (assert (= (length (block-succ call-block)) 1))
658 (let ((next-block (first (block-succ call-block))))
659 (unlink-blocks call-block next-block)
660 (link-blocks call-block bind-block)
663 ;;; Handle the environment semantics of LET conversion. We add the
664 ;;; lambda and its LETs to lets for the CALL's home function. We merge
665 ;;; the calls for FUN with the calls for the home function, removing
666 ;;; FUN in the process. We also merge the Entries.
668 ;;; We also unlink the function head from the component head and set
669 ;;; COMPONENT-REANALYZE to true to indicate that the DFO should be
671 (defun merge-lets (fun call)
672 (declare (type clambda fun) (type basic-combination call))
673 (let ((component (block-component (node-block call))))
674 (unlink-blocks (component-head component) (node-block (lambda-bind fun)))
675 (setf (component-lambdas component)
676 (delete fun (component-lambdas component)))
677 (setf (component-reanalyze component) t))
678 (setf (lambda-call-lexenv fun) (node-lexenv call))
679 (let ((tails (lambda-tail-set fun)))
680 (setf (tail-set-functions tails)
681 (delete fun (tail-set-functions tails))))
682 (setf (lambda-tail-set fun) nil)
683 (let* ((home (node-home-lambda call))
684 (home-env (lambda-environment home)))
685 (push fun (lambda-lets home))
686 (setf (lambda-home fun) home)
687 (setf (lambda-environment fun) home-env)
689 (let ((lets (lambda-lets fun)))
691 (setf (lambda-home let) home)
692 (setf (lambda-environment let) home-env))
694 (setf (lambda-lets home) (nconc lets (lambda-lets home)))
695 (setf (lambda-lets fun) ()))
697 (setf (lambda-calls home)
698 (delete fun (nunion (lambda-calls fun) (lambda-calls home))))
699 (setf (lambda-calls fun) ())
701 (setf (lambda-entries home)
702 (nconc (lambda-entries fun) (lambda-entries home)))
703 (setf (lambda-entries fun) ()))
706 ;;; Handle the value semantics of LET conversion. Delete FUN's return
707 ;;; node, and change the control flow to transfer to NEXT-BLOCK
708 ;;; instead. Move all the uses of the result continuation to CALL's
711 ;;; If the actual continuation is only used by the LET call, then we
712 ;;; intersect the type assertion on the dummy continuation with the
713 ;;; assertion for the actual continuation; in all other cases
714 ;;; assertions on the dummy continuation are lost.
716 ;;; We also intersect the derived type of the CALL with the derived
717 ;;; type of all the dummy continuation's uses. This serves mainly to
718 ;;; propagate TRULY-THE through LETs.
719 (defun move-return-uses (fun call next-block)
720 (declare (type clambda fun) (type basic-combination call)
721 (type cblock next-block))
722 (let* ((return (lambda-return fun))
723 (return-block (node-block return)))
724 (unlink-blocks return-block
725 (component-tail (block-component return-block)))
726 (link-blocks return-block next-block)
728 (delete-return return)
729 (let ((result (return-result return))
730 (cont (node-cont call))
731 (call-type (node-derived-type call)))
732 (when (eq (continuation-use cont) call)
733 (assert-continuation-type cont (continuation-asserted-type result)))
734 (unless (eq call-type *wild-type*)
735 (do-uses (use result)
736 (derive-node-type use call-type)))
737 (substitute-continuation-uses cont result)))
740 ;;; Change all CONT for all the calls to FUN to be the start
741 ;;; continuation for the bind node. This allows the blocks to be
742 ;;; joined if the caller count ever goes to one.
743 (defun move-let-call-cont (fun)
744 (declare (type clambda fun))
745 (let ((new-cont (node-prev (lambda-bind fun))))
746 (dolist (ref (leaf-refs fun))
747 (let ((dest (continuation-dest (node-cont ref))))
748 (delete-continuation-use dest)
749 (add-continuation-use dest new-cont))))
752 ;;; We are converting FUN to be a LET when the call is in a non-tail
753 ;;; position. Any previously tail calls in FUN are no longer tail
754 ;;; calls, and must be restored to normal calls which transfer to
755 ;;; NEXT-BLOCK (FUN's return point.) We can't do this by DO-USES on
756 ;;; the RETURN-RESULT, because the return might have been deleted (if
757 ;;; all calls were TR.)
759 ;;; The called function might be an assignment in the case where we
760 ;;; are currently converting that function. In steady-state,
761 ;;; assignments never appear in the lambda-calls.
762 (defun unconvert-tail-calls (fun call next-block)
763 (dolist (called (lambda-calls fun))
764 (dolist (ref (leaf-refs called))
765 (let ((this-call (continuation-dest (node-cont ref))))
766 (when (and (node-tail-p this-call)
767 (eq (node-home-lambda this-call) fun))
768 (setf (node-tail-p this-call) nil)
769 (ecase (functional-kind called)
770 ((nil :cleanup :optional)
771 (let ((block (node-block this-call))
772 (cont (node-cont call)))
773 (ensure-block-start cont)
774 (unlink-blocks block (first (block-succ block)))
775 (link-blocks block next-block)
776 (delete-continuation-use this-call)
777 (add-continuation-use this-call cont)))
780 (assert (eq called fun))))))))
783 ;;; Deal with returning from a LET or assignment that we are
784 ;;; converting. FUN is the function we are calling, CALL is a call to
785 ;;; FUN, and NEXT-BLOCK is the return point for a non-tail call, or
786 ;;; NULL if call is a tail call.
788 ;;; If the call is not a tail call, then we must do
789 ;;; UNCONVERT-TAIL-CALLS, since a tail call is a call which returns
790 ;;; its value out of the enclosing non-let function. When call is
791 ;;; non-TR, we must convert it back to an ordinary local call, since
792 ;;; the value must be delivered to the receiver of CALL's value.
794 ;;; We do different things depending on whether the caller and callee
795 ;;; have returns left:
797 ;;; -- If the callee has no return we just do MOVE-LET-CALL-CONT. Either
798 ;;; the function doesn't return, or all returns are via tail-recursive
800 ;;; -- If CALL is a non-tail call, or if both have returns, then we
801 ;;; delete the callee's return, move its uses to the call's result
802 ;;; continuation, and transfer control to the appropriate return point.
803 ;;; -- If the callee has a return, but the caller doesn't, then we move the
804 ;;; return to the caller.
805 (defun move-return-stuff (fun call next-block)
806 (declare (type clambda fun) (type basic-combination call)
807 (type (or cblock null) next-block))
809 (unconvert-tail-calls fun call next-block))
810 (let* ((return (lambda-return fun))
811 (call-fun (node-home-lambda call))
812 (call-return (lambda-return call-fun)))
814 ((or next-block call-return)
815 (unless (block-delete-p (node-block return))
816 (move-return-uses fun call
817 (or next-block (node-block call-return)))))
819 (assert (node-tail-p call))
820 (setf (lambda-return call-fun) return)
821 (setf (return-lambda return) call-fun))))
822 (move-let-call-cont fun)
825 ;;; Actually do LET conversion. We call subfunctions to do most of the
826 ;;; work. We change the CALL's cont to be the continuation heading the
827 ;;; bind block, and also do REOPTIMIZE-CONTINUATION on the args and
828 ;;; Cont so that let-specific IR1 optimizations get a chance. We blow
829 ;;; away any entry for the function in *FREE-FUNCTIONS* so that nobody
830 ;;; will create new reference to it.
831 (defun let-convert (fun call)
832 (declare (type clambda fun) (type basic-combination call))
833 (let ((next-block (if (node-tail-p call)
835 (insert-let-body fun call))))
836 (move-return-stuff fun call next-block)
837 (merge-lets fun call)))
839 ;;; Reoptimize all of Call's args and its result.
840 (defun reoptimize-call (call)
841 (declare (type basic-combination call))
842 (dolist (arg (basic-combination-args call))
844 (reoptimize-continuation arg)))
845 (reoptimize-continuation (node-cont call))
848 ;;; We also don't convert calls to named functions which appear in the
849 ;;; initial component, delaying this until optimization. This
850 ;;; minimizes the likelyhood that we well let-convert a function which
851 ;;; may have references added due to later local inline expansion
852 (defun ok-initial-convert-p (fun)
853 (not (and (leaf-name fun)
856 (node-block (lambda-bind fun))))
859 ;;; This function is called when there is some reason to believe that
860 ;;; the lambda Fun might be converted into a let. This is done after
861 ;;; local call analysis, and also when a reference is deleted. We only
862 ;;; convert to a let when the function is a normal local function, has
863 ;;; no XEP, and is referenced in exactly one local call. Conversion is
864 ;;; also inhibited if the only reference is in a block about to be
865 ;;; deleted. We return true if we converted.
867 ;;; These rules may seem unnecessarily restrictive, since there are
868 ;;; some cases where we could do the return with a jump that don't
869 ;;; satisfy these requirements. The reason for doing things this way
870 ;;; is that it makes the concept of a LET much more useful at the
871 ;;; level of IR1 semantics. The :ASSIGNMENT function kind provides
872 ;;; another way to optimize calls to single-return/multiple call
875 ;;; We don't attempt to convert calls to functions that have an XEP,
876 ;;; since we might be embarrassed later when we want to convert a
877 ;;; newly discovered local call. Also, see OK-INITIAL-CONVERT-P.
878 (defun maybe-let-convert (fun)
879 (declare (type clambda fun))
880 (let ((refs (leaf-refs fun)))
883 (member (functional-kind fun) '(nil :assignment))
884 (not (functional-entry-function fun)))
885 (let* ((ref-cont (node-cont (first refs)))
886 (dest (continuation-dest ref-cont)))
887 (when (and (basic-combination-p dest)
888 (eq (basic-combination-fun dest) ref-cont)
889 (eq (basic-combination-kind dest) :local)
890 (not (block-delete-p (node-block dest)))
891 (cond ((ok-initial-convert-p fun) t)
893 (reoptimize-continuation ref-cont)
895 (unless (eq (functional-kind fun) :assignment)
896 (let-convert fun dest))
897 (reoptimize-call dest)
898 (setf (functional-kind fun)
899 (if (mv-combination-p dest) :mv-let :let))))
902 ;;;; tail local calls and assignments
904 ;;; Return T if there are no cleanups between BLOCK1 and BLOCK2, or if
905 ;;; they definitely won't generate any cleanup code. Currently we
906 ;;; recognize lexical entry points that are only used locally (if at
908 (defun only-harmless-cleanups (block1 block2)
909 (declare (type cblock block1 block2))
910 (or (eq block1 block2)
911 (let ((cleanup2 (block-start-cleanup block2)))
912 (do ((cleanup (block-end-cleanup block1)
913 (node-enclosing-cleanup (cleanup-mess-up cleanup))))
914 ((eq cleanup cleanup2) t)
915 (case (cleanup-kind cleanup)
917 (unless (null (entry-exits (cleanup-mess-up cleanup)))
919 (t (return nil)))))))
921 ;;; If a potentially TR local call really is TR, then convert it to
922 ;;; jump directly to the called function. We also call
923 ;;; MAYBE-CONVERT-TO-ASSIGNMENT. The first value is true if we
924 ;;; tail-convert. The second is the value of M-C-T-A. We can switch
925 ;;; the succesor (potentially deleting the RETURN node) unless:
926 ;;; -- The call has already been converted.
927 ;;; -- The call isn't TR (some implicit MV PROG1.)
928 ;;; -- The call is in an XEP (thus we might decide to make it non-tail
929 ;;; so that we can use known return inside the component.)
930 ;;; -- There is a change in the cleanup between the call in the return,
931 ;;; so we might need to introduce cleanup code.
932 (defun maybe-convert-tail-local-call (call)
933 (declare (type combination call))
934 (let ((return (continuation-dest (node-cont call))))
935 (assert (return-p return))
936 (when (and (not (node-tail-p call))
937 (immediately-used-p (return-result return) call)
938 (not (eq (functional-kind (node-home-lambda call))
940 (only-harmless-cleanups (node-block call)
941 (node-block return)))
942 (node-ends-block call)
943 (let ((block (node-block call))
944 (fun (combination-lambda call)))
945 (setf (node-tail-p call) t)
946 (unlink-blocks block (first (block-succ block)))
947 (link-blocks block (node-block (lambda-bind fun)))
948 (values t (maybe-convert-to-assignment fun))))))
950 ;;; This is called when we believe it might make sense to convert Fun
951 ;;; to an assignment. All this function really does is determine when
952 ;;; a function with more than one call can still be combined with the
953 ;;; calling function's environment. We can convert when:
954 ;;; -- The function is a normal, non-entry function, and
955 ;;; -- Except for one call, all calls must be tail recursive calls
956 ;;; in the called function (i.e. are self-recursive tail calls)
957 ;;; -- OK-INITIAL-CONVERT-P is true.
959 ;;; There may be one outside call, and it need not be tail-recursive.
960 ;;; Since all tail local calls have already been converted to direct
961 ;;; transfers, the only control semantics needed are to splice in the
962 ;;; body at the non-tail call. If there is no non-tail call, then we
963 ;;; need only merge the environments. Both cases are handled by
966 ;;; ### It would actually be possible to allow any number of outside
967 ;;; calls as long as they all return to the same place (i.e. have the
968 ;;; same conceptual continuation.) A special case of this would be
969 ;;; when all of the outside calls are tail recursive.
970 (defun maybe-convert-to-assignment (fun)
971 (declare (type clambda fun))
972 (when (and (not (functional-kind fun))
973 (not (functional-entry-function fun)))
976 (when (and (dolist (ref (leaf-refs fun) t)
977 (let ((dest (continuation-dest (node-cont ref))))
978 (when (block-delete-p (node-block dest)) (return nil))
979 (let ((home (node-home-lambda ref)))
980 (unless (eq home fun)
981 (when call-fun (return nil))
982 (setq call-fun home))
983 (unless (node-tail-p dest)
984 (when (or non-tail (eq home fun)) (return nil))
985 (setq non-tail dest)))))
986 (ok-initial-convert-p fun))
987 (setf (functional-kind fun) :assignment)
988 (let-convert fun (or non-tail
990 (node-cont (first (leaf-refs fun))))))
991 (when non-tail (reoptimize-call non-tail))