/[cmucl]/src/compiler/locall.lisp
ViewVC logotype

Contents of /src/compiler/locall.lisp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1.44 - (hide annotations)
Thu Jan 6 18:07:06 1994 UTC (20 years, 3 months ago) by ram
Branch: MAIN
Changes since 1.43: +5 -3 lines
In UNCONVERT-TAIL-CALLS, do ENSURE-BLOCK-START so that we can manipulate the
use list.
 
1 wlott 1.1 ;;; -*- Package: C; Log: C.Log -*-
2     ;;;
3     ;;; **********************************************************************
4 ram 1.15 ;;; This code was written as part of the CMU Common Lisp project at
5     ;;; Carnegie Mellon University, and has been placed in the public domain.
6     ;;; If you want to use this code or any part of CMU Common Lisp, please contact
7     ;;; Scott Fahlman or slisp-group@cs.cmu.edu.
8     ;;;
9     (ext:file-comment
10 ram 1.44 "$Header: /tiger/var/lib/cvsroots/cmucl/src/compiler/locall.lisp,v 1.44 1994/01/06 18:07:06 ram Exp $")
11 ram 1.15 ;;;
12 wlott 1.1 ;;; **********************************************************************
13     ;;;
14     ;;; This file implements local call analysis. A local call is a function
15     ;;; call between functions being compiled at the same time. If we can tell at
16 ram 1.9 ;;; compile time that such a call is legal, then we change the combination
17     ;;; to call the correct lambda, mark it as local, and add this link to our call
18     ;;; graph. Once a call is local, it is then eligible for let conversion, which
19     ;;; places the body of the function inline.
20 wlott 1.1 ;;;
21     ;;; We cannot always do a local call even when we do have the function being
22 ram 1.35 ;;; called. Calls that cannot be shown to have legal arg counts are not
23     ;;; converted.
24 wlott 1.1 ;;;
25     ;;; Written by Rob MacLachlan
26     ;;;
27 ram 1.31 (in-package :c)
28 wlott 1.1
29    
30 ram 1.11 ;;; Propagate-To-Args -- Interface
31 wlott 1.1 ;;;
32     ;;; This function propagates information from the variables in the function
33 ram 1.11 ;;; Fun to the actual arguments in Call. This is also called by the VALUES IR1
34     ;;; optimizer when it sleazily converts MV-BINDs to LETs.
35 wlott 1.1 ;;;
36     ;;; We flush all arguments to Call that correspond to unreferenced variables
37     ;;; in Fun. We leave NILs in the Combination-Args so that the remaining args
38     ;;; still match up with their vars.
39     ;;;
40     ;;; We also apply the declared variable type assertion to the argument
41     ;;; continuations.
42     ;;;
43     (defun propagate-to-args (call fun)
44     (declare (type combination call) (type clambda fun))
45     (do ((args (basic-combination-args call) (cdr args))
46     (vars (lambda-vars fun) (cdr vars)))
47     ((null args))
48     (let ((arg (car args))
49     (var (car vars)))
50     (cond ((leaf-refs var)
51     (assert-continuation-type arg (leaf-type var)))
52     (t
53     (flush-dest arg)
54     (setf (car args) nil)))))
55    
56     (undefined-value))
57    
58    
59 ram 1.31 ;;; Merge-Tail-Sets -- Interface
60     ;;;
61     ;;; This function handles merging the tail sets if Call is potentially
62     ;;; tail-recursive, and is a call to a function with a different TAIL-SET than
63     ;;; Call's Fun. This must be called whenever we alter IR1 so as to place a
64     ;;; local call in what might be a TR context. Note that any call which returns
65     ;;; its value to a RETURN is considered potentially TR, since any implicit
66     ;;; MV-PROG1 might be optimized away.
67     ;;;
68     ;;; We destructively modify the set for the calling function to represent both,
69     ;;; and then change all the functions in callee's set to reference the first.
70     ;;; If we do merge, we reoptimize the RETURN-RESULT continuation to cause
71     ;;; IR1-OPTIMIZE-RETURN to recompute the tail set type.
72     ;;;
73 ram 1.33 (defun merge-tail-sets (call &optional (new-fun (combination-lambda call)))
74     (declare (type basic-combination call) (type clambda new-fun))
75 ram 1.31 (let ((return (continuation-dest (node-cont call))))
76     (when (return-p return)
77     (let ((call-set (lambda-tail-set (node-home-lambda call)))
78 ram 1.33 (fun-set (lambda-tail-set new-fun)))
79 ram 1.31 (unless (eq call-set fun-set)
80     (let ((funs (tail-set-functions fun-set)))
81     (dolist (fun funs)
82     (setf (lambda-tail-set fun) call-set))
83     (setf (tail-set-functions call-set)
84     (nconc (tail-set-functions call-set) funs)))
85     (reoptimize-continuation (return-result return))
86     t)))))
87    
88    
89 wlott 1.1 ;;; Convert-Call -- Internal
90     ;;;
91 ram 1.31 ;;; Convert a combination into a local call. We PROPAGATE-TO-ARGS, set the
92 wlott 1.1 ;;; combination kind to :Local, add Fun to the Calls of the function that the
93 ram 1.33 ;;; call is in, call MERGE-TAIL-SETS, then replace the function in the Ref node
94     ;;; with the new function.
95 wlott 1.1 ;;;
96 ram 1.33 ;;; We change the Ref last, since changing the reference can trigger let
97 wlott 1.1 ;;; conversion of the new function, but will only do so if the call is local.
98 ram 1.33 ;;; Note that the replacement may trigger let conversion or other changes in
99     ;;; IR1. We must call MERGE-TAIL-SETS with NEW-FUN before the substitution,
100     ;;; since after the substitution (and let conversion), the call may no longer
101     ;;; be recognizable as tail-recursive.
102 wlott 1.1 ;;;
103     (defun convert-call (ref call fun)
104     (declare (type ref ref) (type combination call) (type clambda fun))
105     (propagate-to-args call fun)
106     (setf (basic-combination-kind call) :local)
107 ram 1.6 (pushnew fun (lambda-calls (node-home-lambda call)))
108 ram 1.33 (merge-tail-sets call fun)
109 wlott 1.1 (change-ref-leaf ref fun)
110     (undefined-value))
111    
112    
113     ;;;; External entry point creation:
114    
115     ;;; Make-XEP-Lambda -- Internal
116     ;;;
117     ;;; Return a Lambda form that can be used as the definition of the XEP for
118     ;;; Fun.
119     ;;;
120     ;;; If Fun is a lambda, then we check the number of arguments (conditional
121     ;;; on policy) and call Fun with all the arguments.
122     ;;;
123     ;;; If Fun is an Optional-Dispatch, then we dispatch off of the number of
124     ;;; supplied arguments by doing do an = test for each entry-point, calling the
125     ;;; entry with the appropriate prefix of the passed arguments.
126     ;;;
127     ;;; If there is a more arg, then there are a couple of optimizations that we
128     ;;; make (more for space than anything else):
129     ;;; -- If Min-Args is 0, then we make the more entry a T clause, since no
130     ;;; argument count error is possible.
131     ;;; -- We can omit the = clause for the last entry-point, allowing the case of
132     ;;; 0 more args to fall through to the more entry.
133     ;;;
134     ;;; We don't bother to policy conditionalize wrong arg errors in optional
135     ;;; dispatches, since the additional overhead is negligible compared to the
136     ;;; other hair going down.
137     ;;;
138     ;;; Note that if policy indicates it, argument type declarations in Fun will
139     ;;; be verified. Since nothing is known about the type of the XEP arg vars,
140     ;;; type checks will be emitted when the XEP's arg vars are passed to the
141     ;;; actual function.
142     ;;;
143     (defun make-xep-lambda (fun)
144     (declare (type functional fun))
145     (etypecase fun
146     (clambda
147     (let ((nargs (length (lambda-vars fun)))
148     (n-supplied (gensym)))
149     (collect ((temps))
150     (dotimes (i nargs)
151     (temps (gensym)))
152     `(lambda (,n-supplied ,@(temps))
153 wlott 1.40 (declare (type index ,n-supplied))
154 ram 1.35 ,(if (policy nil (zerop safety))
155 wlott 1.1 `(declare (ignore ,n-supplied))
156     `(%verify-argument-count ,n-supplied ,nargs))
157     (%funcall ,fun ,@(temps))))))
158     (optional-dispatch
159     (let* ((min (optional-dispatch-min-args fun))
160     (max (optional-dispatch-max-args fun))
161     (more (optional-dispatch-more-entry fun))
162     (n-supplied (gensym)))
163     (collect ((temps)
164     (entries))
165     (dotimes (i max)
166     (temps (gensym)))
167    
168     (do ((eps (optional-dispatch-entry-points fun) (rest eps))
169     (n min (1+ n)))
170     ((null eps))
171     (entries `((= ,n-supplied ,n)
172     (%funcall ,(first eps) ,@(subseq (temps) 0 n)))))
173    
174     `(lambda (,n-supplied ,@(temps))
175 wlott 1.40 (declare (type index ,n-supplied))
176 wlott 1.1 (cond
177     ,@(if more (butlast (entries)) (entries))
178     ,@(when more
179     `((,(if (zerop min) 't `(>= ,n-supplied ,max))
180     ,(let ((n-context (gensym))
181     (n-count (gensym)))
182     `(multiple-value-bind
183     (,n-context ,n-count)
184     (%more-arg-context ,n-supplied ,max)
185     (%funcall ,more ,@(temps) ,n-context ,n-count))))))
186     (t
187     (%argument-count-error ,n-supplied)))))))))
188    
189    
190     ;;; Make-External-Entry-Point -- Internal
191     ;;;
192     ;;; Make an external entry point (XEP) for Fun and return it. We convert
193     ;;; the result of Make-XEP-Lambda in the correct environment, then associate
194     ;;; this lambda with Fun as its XEP. After the conversion, we iterate over the
195     ;;; function's associated lambdas, redoing local call analysis so that the XEP
196 ram 1.18 ;;; calls will get converted. We also bind *lexical-environment* to change the
197     ;;; compilation policy over to the interface policy.
198 wlott 1.1 ;;;
199     ;;; We set Reanalyze and Reoptimize in the component, just in case we
200     ;;; discover an XEP after the initial local call analyze pass.
201     ;;;
202     (defun make-external-entry-point (fun)
203     (declare (type functional fun))
204     (assert (not (functional-entry-function fun)))
205     (with-ir1-environment (lambda-bind (main-entry fun))
206 ram 1.18 (let* ((*lexical-environment*
207     (make-lexenv :cookie
208     (make-interface-cookie *lexical-environment*)))
209     (res (ir1-convert-lambda (make-xep-lambda fun))))
210 wlott 1.1 (setf (functional-kind res) :external)
211 ram 1.12 (setf (leaf-ever-used res) t)
212 wlott 1.1 (setf (functional-entry-function res) fun)
213     (setf (functional-entry-function fun) res)
214     (setf (component-reanalyze *current-component*) t)
215     (setf (component-reoptimize *current-component*) t)
216     (etypecase fun
217     (clambda (local-call-analyze-1 fun))
218     (optional-dispatch
219     (dolist (ep (optional-dispatch-entry-points fun))
220     (local-call-analyze-1 ep))
221     (when (optional-dispatch-more-entry fun)
222     (local-call-analyze-1 (optional-dispatch-more-entry fun)))))
223     res)))
224    
225    
226     ;;; Reference-Entry-Point -- Internal
227     ;;;
228     ;;; Notice a Ref that is not in a local-call context. If the Ref is already
229     ;;; to an XEP, then do nothing, otherwise change it to the XEP, making an XEP
230     ;;; if necessary.
231     ;;;
232     ;;; If Ref is to a special :Cleanup or :Escape function, then we treat it as
233     ;;; though it was not an XEP reference (i.e. leave it alone.)
234     ;;;
235     (defun reference-entry-point (ref)
236     (declare (type ref ref))
237     (let ((fun (ref-leaf ref)))
238     (unless (or (external-entry-point-p fun)
239     (member (functional-kind fun) '(:escape :cleanup)))
240     (change-ref-leaf ref (or (functional-entry-function fun)
241     (make-external-entry-point fun))))))
242    
243 ram 1.35
244 wlott 1.1
245     ;;; Local-Call-Analyze-1 -- Interface
246     ;;;
247     ;;; Attempt to convert all references to Fun to local calls. The reference
248 ram 1.35 ;;; must be the function for a call, and the function continuation must be used
249     ;;; only once, since otherwise we cannot be sure what function is to be called.
250     ;;; The call continuation would be multiply used if there is hairy stuff such
251     ;;; as conditionals in the expression that computes the function.
252 wlott 1.1 ;;;
253     ;;; If we cannot convert a reference, then we mark the referenced function
254 ram 1.35 ;;; as an entry-point, creating a new XEP if necessary. We don't try to
255     ;;; convert calls that are in error (:ERROR kind.)
256 wlott 1.1 ;;;
257     ;;; This is broken off from Local-Call-Analyze so that people can force
258     ;;; analysis of newly introduced calls. Note that we don't do let conversion
259     ;;; here.
260     ;;;
261     (defun local-call-analyze-1 (fun)
262     (declare (type functional fun))
263 ram 1.35 (let ((refs (leaf-refs fun))
264     (first-time t))
265 ram 1.3 (dolist (ref refs)
266     (let* ((cont (node-cont ref))
267     (dest (continuation-dest cont)))
268     (cond ((and (basic-combination-p dest)
269     (eq (basic-combination-fun dest) cont)
270 ram 1.35 (eq (continuation-use cont) ref))
271    
272     (convert-call-if-possible ref dest)
273 ram 1.3
274     (unless (eq (basic-combination-kind dest) :local)
275     (reference-entry-point ref)))
276     (t
277 ram 1.35 (reference-entry-point ref))))
278     (setq first-time nil)))
279 wlott 1.1
280     (undefined-value))
281    
282    
283     ;;; Local-Call-Analyze -- Interface
284     ;;;
285     ;;; We examine all New-Functions in component, attempting to convert calls
286     ;;; into local calls when it is legal. We also attempt to convert each lambda
287     ;;; to a let. Let conversion is also triggered by deletion of a function
288     ;;; reference, but functions that start out eligible for conversion must be
289     ;;; noticed sometime.
290     ;;;
291     ;;; Note that there is a lot of action going on behind the scenes here,
292     ;;; triggered by reference deletion. In particular, the Component-Lambdas are
293     ;;; being hacked to remove newly deleted and let converted lambdas, so it is
294     ;;; important that the lambda is added to the Component-Lambdas when it is.
295 ram 1.37 ;;; Also, the COMPONENT-NEW-FUNCTIONS may contain all sorts of drivel, since it
296 ram 1.35 ;;; is not updated when we delete functions, etc. Only COMPONENT-LAMBDAS is
297     ;;; updated.
298 wlott 1.1 ;;;
299 ram 1.37 ;;; COMPONENT-REANALYZE-FUNCTIONS is treated similarly to NEW-FUNCTIONS, but we
300     ;;; don't add lambdas to the LAMBDAS.
301     ;;;
302 wlott 1.1 (defun local-call-analyze (component)
303     (declare (type component component))
304     (loop
305 ram 1.37 (let* ((new (pop (component-new-functions component)))
306     (fun (or new (pop (component-reanalyze-functions component)))))
307     (unless fun (return))
308     (let ((kind (functional-kind fun)))
309     (cond ((member kind '(:deleted :let :mv-let :assignment)))
310     ((and (null (leaf-refs fun)) (eq kind nil)
311     (not (functional-entry-function fun)))
312     (delete-functional fun))
313     (t
314     (when (and new (lambda-p fun))
315     (push fun (component-lambdas component)))
316     (local-call-analyze-1 fun)
317     (when (lambda-p fun)
318     (maybe-let-convert fun)))))))
319 ram 1.17
320 wlott 1.1 (undefined-value))
321    
322    
323 ram 1.35 ;;; MAYBE-EXPAND-LOCAL-INLINE -- Internal
324     ;;;
325     ;;; If policy is auspicious, Call is not in an XEP, and we don't seem to be
326     ;;; in an infinite recursive loop, then change the reference to reference a
327     ;;; fresh copy. We return whichever function we decide to reference.
328     ;;;
329     (defun maybe-expand-local-inline (fun ref call)
330     (if (and (policy call (>= speed space) (>= speed cspeed))
331     (not (eq (functional-kind (node-home-lambda call)) :external))
332 ram 1.43 (not *converting-for-interpreter*)
333 ram 1.35 (inline-expansion-ok call))
334     (with-ir1-environment call
335     (let* ((*lexical-environment* (functional-lexenv fun))
336 ram 1.36 (won nil)
337     (res (catch 'local-call-lossage
338     (prog1
339     (ir1-convert-lambda (functional-inline-expansion fun))
340     (setq won t)))))
341     (cond (won
342     (change-ref-leaf ref res)
343     res)
344     (t
345     (let ((*compiler-error-context* call))
346     (compiler-note "Couldn't inline expand because expansion ~
347     calls this let-converted local function:~
348     ~% ~S"
349     (leaf-name res)))
350     fun))))
351 ram 1.35 fun))
352    
353    
354 wlott 1.1 ;;; Convert-Call-If-Possible -- Interface
355     ;;;
356     ;;; Dispatch to the appropriate function to attempt to convert a call. This
357     ;;; is called in IR1 optimize as well as in local call analysis. If the call
358 ram 1.35 ;;; is is already :Local, we do nothing. If the call is already scheduled for
359     ;;; deletion, also do nothing (in addition to saving time, this also avoids
360     ;;; some problems with optimizing collections of functions that are partially
361     ;;; deleted.)
362 wlott 1.1 ;;;
363 ram 1.35 ;;; This is called both before and after FIND-INITIAL-DFO runs. When called
364     ;;; on a :INITIAL component, we don't care whether the caller and callee are in
365     ;;; the same component. Afterward, we must stick with whatever component
366     ;;; division we have chosen.
367     ;;;
368     ;;; Before attempting to convert a call, we see if the function is supposed
369     ;;; to be inline expanded. Call conversion proceeds as before after any
370     ;;; expansion.
371     ;;;
372 wlott 1.1 ;;; We bind *Compiler-Error-Context* to the node for the call so that
373     ;;; warnings will get the right context.
374     ;;;
375 ram 1.35 ;;;
376 wlott 1.1 (defun convert-call-if-possible (ref call)
377     (declare (type ref ref) (type basic-combination call))
378 ram 1.35 (let* ((block (node-block call))
379     (component (block-component block))
380     (original-fun (ref-leaf ref)))
381     (unless (or (member (basic-combination-kind call) '(:local :error))
382     (block-delete-p block)
383     (eq (functional-kind (block-home-lambda block)) :deleted)
384     (not (or (eq (component-kind component) :initial)
385     (eq (block-component
386     (node-block
387     (lambda-bind (main-entry original-fun))))
388     component))))
389     (let ((fun (if (external-entry-point-p original-fun)
390     (functional-entry-function original-fun)
391     original-fun))
392     (*compiler-error-context* call))
393    
394     (when (and (eq (functional-inlinep fun) :inline)
395     (rest (leaf-refs original-fun)))
396     (setq fun (maybe-expand-local-inline fun ref call)))
397    
398     (assert (member (functional-kind fun)
399     '(nil :escape :cleanup :optional)))
400     (cond ((mv-combination-p call)
401     (convert-mv-call ref call fun))
402     ((lambda-p fun)
403     (convert-lambda-call ref call fun))
404     (t
405     (convert-hairy-call ref call fun))))))
406    
407 wlott 1.1 (undefined-value))
408    
409    
410     ;;; Convert-MV-Call -- Internal
411     ;;;
412     ;;; Attempt to convert a multiple-value call. The only interesting case is
413     ;;; a call to a function that Looks-Like-An-MV-Bind, has exactly one reference
414     ;;; and no XEP, and is called with one values continuation.
415     ;;;
416     ;;; We change the call to be to the last optional entry point and change the
417     ;;; call to be local. Due to our preconditions, the call should eventually be
418     ;;; converted to a let, but we can't do that now, since there may be stray
419     ;;; references to the e-p lambda due to optional defaulting code.
420     ;;;
421     ;;; We also use variable types for the called function to construct an
422     ;;; assertion for the values continuation.
423     ;;;
424 ram 1.34 ;;; See CONVERT-CALL for additional notes on MERGE-TAIL-SETS, etc.
425     ;;;
426 wlott 1.1 (defun convert-mv-call (ref call fun)
427     (declare (type ref ref) (type mv-combination call) (type functional fun))
428     (when (and (looks-like-an-mv-bind fun)
429     (not (functional-entry-function fun))
430     (= (length (leaf-refs fun)) 1)
431     (= (length (basic-combination-args call)) 1))
432     (let ((ep (car (last (optional-dispatch-entry-points fun)))))
433     (setf (basic-combination-kind call) :local)
434 ram 1.6 (pushnew ep (lambda-calls (node-home-lambda call)))
435 ram 1.34 (merge-tail-sets call ep)
436 ram 1.22 (change-ref-leaf ref ep)
437 ram 1.31
438 wlott 1.1 (assert-continuation-type
439     (first (basic-combination-args call))
440     (make-values-type :optional (mapcar #'leaf-type (lambda-vars ep))
441     :rest *universal-type*))))
442     (undefined-value))
443    
444    
445     ;;; Convert-Lambda-Call -- Internal
446     ;;;
447     ;;; Attempt to convert a call to a lambda. If the number of args is wrong,
448 ram 1.35 ;;; we give a warning and mark the call as :ERROR to remove it from future
449 wlott 1.1 ;;; consideration. If the argcount is O.K. then we just convert it.
450     ;;;
451     (defun convert-lambda-call (ref call fun)
452 ram 1.9 (declare (type ref ref) (type combination call) (type clambda fun))
453 wlott 1.1 (let ((nargs (length (lambda-vars fun)))
454     (call-args (length (combination-args call))))
455     (cond ((= call-args nargs)
456     (convert-call ref call fun))
457     (t
458     (compiler-warning
459     "Function called with ~R argument~:P, but wants exactly ~R."
460     call-args nargs)
461 ram 1.35 (setf (basic-combination-kind call) :error)))))
462 wlott 1.1
463    
464    
465     ;;;; Optional, more and keyword calls:
466    
467     ;;; Convert-Hairy-Call -- Internal
468     ;;;
469     ;;; Similar to Convert-Lambda-Call, but deals with Optional-Dispatches. If
470     ;;; only fixed args are supplied, then convert a call to the correct entry
471     ;;; point. If keyword args are supplied, then dispatch to a subfunction. We
472     ;;; don't convert calls to functions that have a more (or rest) arg.
473     ;;;
474     (defun convert-hairy-call (ref call fun)
475     (declare (type ref ref) (type combination call)
476     (type optional-dispatch fun))
477     (let ((min-args (optional-dispatch-min-args fun))
478     (max-args (optional-dispatch-max-args fun))
479     (call-args (length (combination-args call))))
480     (cond ((< call-args min-args)
481     (compiler-warning "Function called with ~R argument~:P, but wants at least ~R."
482     call-args min-args)
483 ram 1.35 (setf (basic-combination-kind call) :error))
484 wlott 1.1 ((<= call-args max-args)
485     (convert-call ref call
486     (elt (optional-dispatch-entry-points fun)
487     (- call-args min-args))))
488 ram 1.13 ((optional-dispatch-more-entry fun)
489     (convert-more-call ref call fun))
490     (t
491 wlott 1.1 (compiler-warning "Function called with ~R argument~:P, but wants at most ~R."
492     call-args max-args)
493 ram 1.35 (setf (basic-combination-kind call) :error))))
494 wlott 1.1 (undefined-value))
495    
496    
497     ;;; Convert-Hairy-Fun-Entry -- Internal
498     ;;;
499     ;;; This function is used to convert a call to an entry point when complex
500     ;;; transformations need to be done on the original arguments. Entry is the
501     ;;; entry point function that we are calling. Vars is a list of variable names
502     ;;; which are bound to the oringinal call arguments. Ignores is the subset of
503     ;;; Vars which are ignored. Args is the list of arguments to the entry point
504     ;;; function.
505     ;;;
506     ;;; In order to avoid gruesome graph grovelling, we introduce a new function
507     ;;; that rearranges the arguments and calls the entry point. We analyze the
508     ;;; new function and the entry point immediately so that everything gets
509     ;;; converted during the single pass.
510     ;;;
511     (defun convert-hairy-fun-entry (ref call entry vars ignores args)
512 ram 1.9 (declare (list vars ignores args) (type ref ref) (type combination call)
513     (type clambda entry))
514 wlott 1.1 (let ((new-fun
515     (with-ir1-environment call
516     (ir1-convert-lambda
517     `(lambda ,vars
518 ram 1.13 (declare (ignorable . ,ignores))
519 ram 1.6 (%funcall ,entry . ,args))))))
520 wlott 1.1 (convert-call ref call new-fun)
521     (dolist (ref (leaf-refs entry))
522     (convert-call-if-possible ref (continuation-dest (node-cont ref))))))
523    
524    
525 ram 1.13 ;;; Convert-More-Call -- Internal
526 wlott 1.1 ;;;
527 ram 1.13 ;;; Use Convert-Hairy-Fun-Entry to convert a more-arg call to a known
528     ;;; function into a local call to the Main-Entry.
529 wlott 1.1 ;;;
530     ;;; First we verify that all keywords are constant and legal. If there
531     ;;; aren't, then we warn the user and don't attempt to convert the call.
532     ;;;
533     ;;; We massage the supplied keyword arguments into the order expected by the
534     ;;; main entry. This is done by binding all the arguments to the keyword call
535     ;;; to variables in the introduced lambda, then passing these values variables
536     ;;; in the correct order when calling the main entry. Unused arguments
537     ;;; (such as the keywords themselves) are discarded simply by not passing them
538     ;;; along.
539     ;;;
540 ram 1.13 ;;; If there is a rest arg, then we bundle up the args and pass them to
541     ;;; LIST.
542     ;;;
543     (defun convert-more-call (ref call fun)
544 wlott 1.1 (declare (type ref ref) (type combination call) (type optional-dispatch fun))
545     (let* ((max (optional-dispatch-max-args fun))
546     (arglist (optional-dispatch-arglist fun))
547     (args (combination-args call))
548 ram 1.13 (more (nthcdr max args))
549 ram 1.11 (flame (policy call (or (> speed brevity) (> space brevity))))
550 wlott 1.1 (loser nil))
551     (collect ((temps)
552 ram 1.13 (more-temps)
553 wlott 1.1 (ignores)
554     (supplied)
555     (key-vars))
556    
557     (dolist (var arglist)
558     (let ((info (lambda-var-arg-info var)))
559     (when info
560     (ecase (arg-info-kind info)
561     (:keyword
562     (key-vars var))
563 wlott 1.42 ((:rest :optional))
564     ((:more-context :more-count)
565     (compiler-warning "Can't local-call functions with &MORE args.")
566     (setf (basic-combination-kind call) :error)
567     (return-from convert-more-call))))))
568 wlott 1.1
569     (dotimes (i max)
570 ram 1.13 (temps (gensym "FIXED-ARG-TEMP-")))
571 wlott 1.1
572 ram 1.13 (dotimes (i (length more))
573     (more-temps (gensym "MORE-ARG-TEMP-")))
574 wlott 1.1
575 ram 1.13 (when (optional-dispatch-keyp fun)
576     (when (oddp (length more))
577     (compiler-warning "Function called with odd number of ~
578     arguments in keyword portion.")
579 ram 1.35
580     (setf (basic-combination-kind call) :error)
581 ram 1.13 (return-from convert-more-call))
582    
583     (do ((key more (cddr key))
584     (temp (more-temps) (cddr temp)))
585     ((null key))
586     (let ((cont (first key)))
587     (unless (constant-continuation-p cont)
588     (when flame
589     (compiler-note "Non-constant keyword in keyword call."))
590 ram 1.35 (setf (basic-combination-kind call) :error)
591 ram 1.13 (return-from convert-more-call))
592    
593     (let ((name (continuation-value cont))
594     (dummy (first temp))
595     (val (second temp)))
596     (dolist (var (key-vars)
597     (progn
598     (ignores dummy val)
599     (setq loser name)))
600     (let ((info (lambda-var-arg-info var)))
601     (when (eq (arg-info-keyword info) name)
602 wlott 1.1 (ignores dummy)
603 ram 1.14 (supplied (cons var val))
604     (return)))))))
605 ram 1.13
606     (when (and loser (not (optional-dispatch-allowp fun)))
607     (compiler-warning "Function called with unknown argument keyword ~S."
608     loser)
609 ram 1.35 (setf (basic-combination-kind call) :error)
610 ram 1.13 (return-from convert-more-call)))
611 wlott 1.1
612     (collect ((call-args))
613     (do ((var arglist (cdr var))
614     (temp (temps) (cdr temp)))
615     (())
616     (let ((info (lambda-var-arg-info (car var))))
617     (if info
618 ram 1.13 (ecase (arg-info-kind info)
619 wlott 1.1 (:optional
620     (call-args (car temp))
621     (when (arg-info-supplied-p info)
622     (call-args t)))
623 ram 1.13 (:rest
624     (call-args `(list ,@(more-temps)))
625     (return))
626     (:keyword
627 wlott 1.1 (return)))
628     (call-args (car temp)))))
629    
630     (dolist (var (key-vars))
631     (let ((info (lambda-var-arg-info var))
632     (temp (cdr (assoc var (supplied)))))
633     (if temp
634     (call-args temp)
635     (call-args (arg-info-default info)))
636     (when (arg-info-supplied-p info)
637     (call-args (not (null temp))))))
638    
639     (convert-hairy-fun-entry ref call (optional-dispatch-main-entry fun)
640 ram 1.13 (append (temps) (more-temps))
641     (ignores) (call-args)))))
642 wlott 1.1
643     (undefined-value))
644    
645    
646     ;;;; Let conversion:
647     ;;;
648     ;;; Converting to a let has differing significance to various parts of the
649     ;;; compiler:
650     ;;; -- The body of a Let is spliced in immediately after the the corresponding
651     ;;; combination node, making the control transfer explicit and allowing lets
652     ;;; to mashed together into a single block. The value of the let is
653     ;;; delivered directly to the original continuation for the call,
654     ;;; eliminating the need to propagate information from the dummy result
655     ;;; continuation.
656     ;;; -- As far as IR1 optimization is concerned, it is interesting in that there
657     ;;; is only one expression that the variable can be bound to, and this is
658     ;;; easily substitited for.
659     ;;; -- Lets are interesting to environment analysis and the back end because in
660     ;;; most ways a let can be considered to be "the same function" as its home
661     ;;; function.
662     ;;; -- Let conversion has dynamic scope implications, since control transfers
663     ;;; within the same environment are local. In a local control transfer,
664     ;;; cleanup code must be emitted to remove dynamic bindings that are no
665     ;;; longer in effect.
666    
667    
668 ram 1.23 ;;; Insert-Let-Body -- Internal
669     ;;;
670     ;;; Set up the control transfer to the called lambda. We split the call
671     ;;; block immediately after the call, and link the head of Fun to the call
672     ;;; block. The successor block after splitting (where we return to) is
673     ;;; returned.
674     ;;;
675     ;;; If the lambda is is a different component than the call, then we call
676     ;;; JOIN-COMPONENTS. This only happens in block compilation before
677     ;;; FIND-INITIAL-DFO.
678     ;;;
679     (defun insert-let-body (fun call)
680     (declare (type clambda fun) (type basic-combination call))
681     (let* ((call-block (node-block call))
682     (bind-block (node-block (lambda-bind fun)))
683     (component (block-component call-block)))
684     (let ((fun-component (block-component bind-block)))
685     (unless (eq fun-component component)
686     (assert (eq (component-kind component) :initial))
687     (join-components component fun-component)))
688    
689     (let ((*current-component* component))
690     (node-ends-block call))
691     (assert (= (length (block-succ call-block)) 1))
692     (let ((next-block (first (block-succ call-block))))
693     (unlink-blocks call-block next-block)
694     (link-blocks call-block bind-block)
695     next-block)))
696    
697    
698 ram 1.6 ;;; Merge-Lets -- Internal
699 wlott 1.1 ;;;
700     ;;; Handle the environment semantics of let conversion. We add the lambda
701 ram 1.23 ;;; and its lets to lets for the Call's home function. We merge the calls for
702 ram 1.6 ;;; Fun with the calls for the home function, removing Fun in the process. We
703     ;;; also merge the Entries.
704 wlott 1.1 ;;;
705 ram 1.23 ;;; We also unlink the function head from the component head and set
706     ;;; Component-Reanalyze to true to indicate that the DFO should be recomputed.
707     ;;;
708 ram 1.6 (defun merge-lets (fun call)
709 wlott 1.1 (declare (type clambda fun) (type basic-combination call))
710 ram 1.23 (let ((component (block-component (node-block call))))
711     (unlink-blocks (component-head component) (node-block (lambda-bind fun)))
712     (setf (component-lambdas component)
713     (delete fun (component-lambdas component)))
714     (setf (component-reanalyze component) t))
715     (setf (lambda-call-lexenv fun) (node-lexenv call))
716     (let ((tails (lambda-tail-set fun)))
717     (setf (tail-set-functions tails)
718     (delete fun (tail-set-functions tails))))
719     (setf (lambda-tail-set fun) nil)
720     (let* ((home (node-home-lambda call))
721 ram 1.3 (home-env (lambda-environment home)))
722 wlott 1.1 (push fun (lambda-lets home))
723     (setf (lambda-home fun) home)
724 ram 1.3 (setf (lambda-environment fun) home-env)
725 wlott 1.1
726 ram 1.6 (let ((lets (lambda-lets fun)))
727 wlott 1.1 (dolist (let lets)
728 ram 1.3 (setf (lambda-home let) home)
729     (setf (lambda-environment let) home-env))
730 wlott 1.1
731     (setf (lambda-lets home) (nconc lets (lambda-lets home)))
732     (setf (lambda-lets fun) ()))
733    
734     (setf (lambda-calls home)
735     (nunion (lambda-calls fun)
736     (delete fun (lambda-calls home))))
737     (setf (lambda-calls fun) ())
738    
739     (setf (lambda-entries home)
740     (nconc (lambda-entries fun) (lambda-entries home)))
741     (setf (lambda-entries fun) ()))
742     (undefined-value))
743    
744    
745     ;;; Move-Return-Uses -- Internal
746     ;;;
747 ram 1.23 ;;; Handle the value semantics of let conversion. Delete Fun's return node,
748     ;;; and change the control flow to transfer to Next-Block instead. Move all
749     ;;; the uses of the result continuation to Call's Cont.
750 wlott 1.1 ;;;
751     ;;; If the actual continuation is only used by the let call, then we
752     ;;; intersect the type assertion on the dummy continuation with the assertion
753     ;;; for the actual continuation; in all other cases assertions on the dummy
754     ;;; continuation are lost.
755     ;;;
756 ram 1.7 ;;; We also intersect the derived type of the call with the derived type of
757     ;;; all the dummy continuation's uses. This serves mainly to propagate
758     ;;; TRULY-THE through lets.
759     ;;;
760 ram 1.23 (defun move-return-uses (fun call next-block)
761     (declare (type clambda fun) (type basic-combination call)
762     (type cblock next-block))
763     (let* ((return (lambda-return fun))
764     (return-block (node-block return)))
765     (unlink-blocks return-block
766     (component-tail (block-component return-block)))
767     (link-blocks return-block next-block)
768     (unlink-node return)
769     (delete-return return)
770     (let ((result (return-result return))
771     (cont (node-cont call))
772     (call-type (node-derived-type call)))
773     (when (eq (continuation-use cont) call)
774     (assert-continuation-type cont (continuation-asserted-type result)))
775     (unless (eq call-type *wild-type*)
776     (do-uses (use result)
777     (derive-node-type use call-type)))
778     (substitute-continuation-uses cont result)))
779     (undefined-value))
780 wlott 1.1
781    
782 ram 1.23
783     ;;; MOVE-LET-CALL-CONT -- Internal
784     ;;;
785     ;;; Change all Cont for all the calls to Fun to be the start continuation
786     ;;; for the bind node. This allows the blocks to be joined if the caller count
787     ;;; ever goes to one.
788     ;;;
789     (defun move-let-call-cont (fun)
790     (declare (type clambda fun))
791     (let ((new-cont (node-prev (lambda-bind fun))))
792     (dolist (ref (leaf-refs fun))
793     (let ((dest (continuation-dest (node-cont ref))))
794     (delete-continuation-use dest)
795     (add-continuation-use dest new-cont))))
796 wlott 1.1 (undefined-value))
797    
798    
799 ram 1.25 ;;; Unconvert-Tail-Calls -- Internal
800     ;;;
801     ;;; We are converting Fun to be a let when the call is in a non-tail
802     ;;; position. Any previously tail calls in Fun are no longer tail calls, and
803     ;;; must be restored to normal calls which transfer to Next-Block (Fun's
804 ram 1.31 ;;; return point.) We can't do this by DO-USES on the RETURN-RESULT, because
805     ;;; the return might have been deleted (if all calls were TR.)
806 ram 1.25 ;;;
807 ram 1.30 ;;; The called function might be an assignment in the case where we are
808     ;;; currently converting that function. In steady-state, assignments never
809     ;;; appear in the lambda-calls.
810     ;;;
811 ram 1.25 (defun unconvert-tail-calls (fun call next-block)
812     (dolist (called (lambda-calls fun))
813     (dolist (ref (leaf-refs called))
814     (let ((this-call (continuation-dest (node-cont ref))))
815     (when (and (node-tail-p this-call)
816     (eq (node-home-lambda this-call) fun))
817     (setf (node-tail-p this-call) nil)
818 ram 1.30 (ecase (functional-kind called)
819     ((nil :cleanup :optional)
820 ram 1.44 (let ((block (node-block this-call))
821     (cont (node-cont call)))
822     (ensure-block-start cont)
823 ram 1.30 (unlink-blocks block (first (block-succ block)))
824     (link-blocks block next-block)
825     (delete-continuation-use this-call)
826 ram 1.44 (add-continuation-use this-call cont)))
827 ram 1.41 (:deleted)
828 ram 1.30 (:assignment
829     (assert (eq called fun))))))))
830 ram 1.25 (undefined-value))
831    
832    
833 ram 1.23 ;;; MOVE-RETURN-STUFF -- Internal
834     ;;;
835     ;;; Deal with returning from a let or assignment that we are converting.
836     ;;; FUN is the function we are calling, CALL is a call to FUN, and NEXT-BLOCK
837     ;;; is the return point for a non-tail call, or NULL if call is a tail call.
838     ;;;
839 ram 1.26 ;;; If the call is not a tail call, then we must do UNCONVERT-TAIL-CALLS, since
840     ;;; a tail call is a call which returns its value out of the enclosing non-let
841     ;;; function. When call is non-TR, we must convert it back to an ordinary
842     ;;; local call, since the value must be delivered to the receiver of CALL's
843     ;;; value.
844     ;;;
845 ram 1.23 ;;; We do different things depending on whether the caller and callee have
846     ;;; returns left:
847 ram 1.26 ;;; -- If the callee has no return we just do MOVE-LET-CALL-CONT. Either the
848     ;;; function doesn't return, or all returns are via tail-recursive local
849     ;;; calls.
850 ram 1.23 ;;; -- If CALL is a non-tail call, or if both have returns, then we
851     ;;; delete the callee's return, move its uses to the call's result
852     ;;; continuation, and transfer control to the appropriate return point.
853     ;;; -- If the callee has a return, but the caller doesn't, then we move the
854 ram 1.25 ;;; return to the caller.
855 ram 1.23 ;;;
856     (defun move-return-stuff (fun call next-block)
857     (declare (type clambda fun) (type basic-combination call)
858     (type (or cblock null) next-block))
859 ram 1.25 (when next-block
860     (unconvert-tail-calls fun call next-block))
861 ram 1.23 (let* ((return (lambda-return fun))
862     (call-fun (node-home-lambda call))
863     (call-return (lambda-return call-fun)))
864 ram 1.25 (cond ((not return))
865     ((or next-block call-return)
866     (unless (block-delete-p (node-block return))
867     (move-return-uses fun call
868     (or next-block (node-block call-return)))))
869     (t
870     (assert (node-tail-p call))
871     (setf (lambda-return call-fun) return)
872     (setf (return-lambda return) call-fun))))
873     (move-let-call-cont fun)
874 ram 1.23 (undefined-value))
875    
876    
877 wlott 1.1 ;;; Let-Convert -- Internal
878     ;;;
879     ;;; Actually do let conversion. We call subfunctions to do most of the
880     ;;; work. We change the Call's cont to be the continuation heading the bind
881     ;;; block, and also do Reoptimize-Continuation on the args and Cont so that
882 ram 1.5 ;;; let-specific IR1 optimizations get a chance. We blow away any entry for
883     ;;; the function in *free-functions* so that nobody will create new reference
884     ;;; to it.
885 wlott 1.1 ;;;
886     (defun let-convert (fun call)
887     (declare (type clambda fun) (type basic-combination call))
888 ram 1.23 (let ((next-block (if (node-tail-p call)
889     nil
890     (insert-let-body fun call))))
891 ram 1.25 (move-return-stuff fun call next-block)
892 ram 1.38 (merge-lets fun call)))
893 ram 1.23
894 ram 1.38
895     ;;; REOPTIMIZE-CALL -- Internal
896     ;;;
897     ;;; Reoptimize all of Call's args and its result.
898     ;;;
899     (defun reoptimize-call (call)
900     (declare (type basic-combination call))
901 wlott 1.1 (dolist (arg (basic-combination-args call))
902     (when arg
903     (reoptimize-continuation arg)))
904     (reoptimize-continuation (node-cont call))
905     (undefined-value))
906    
907 ram 1.38 ;;; OK-INITIAL-CONVERT-P -- Internal
908     ;;;
909     ;;; We also don't convert calls to named functions which appear in the initial
910     ;;; component, delaying this until optimization. This minimizes the likelyhood
911     ;;; that we well let-convert a function which may have references added due to
912     ;;; later local inline expansion
913     ;;;
914     (defun ok-initial-convert-p (fun)
915     (not (and (leaf-name fun)
916     (eq (component-kind
917     (block-component
918     (node-block (lambda-bind fun))))
919     :initial))))
920 wlott 1.1
921 ram 1.38
922 wlott 1.1 ;;; Maybe-Let-Convert -- Interface
923     ;;;
924     ;;; This function is called when there is some reason to believe that
925     ;;; the lambda Fun might be converted into a let. This is done after local
926     ;;; call analysis, and also when a reference is deleted. We only convert to a
927     ;;; let when the function is a normal local function, has no XEP, and is
928     ;;; referenced in exactly one local call. Conversion is also inhibited if the
929 ram 1.23 ;;; only reference is in a block about to be deleted. We return true if we
930     ;;; converted.
931 wlott 1.1 ;;;
932     ;;; These rules may seem unnecessarily restrictive, since there are some
933     ;;; cases where we could do the return with a jump that don't satisfy these
934     ;;; requirements. The reason for doing things this way is that it makes the
935 ram 1.23 ;;; concept of a let much more useful at the level of IR1 semantics. The
936     ;;; :ASSIGNMENT function kind provides another way to optimize calls to
937     ;;; single-return/multiple call functions.
938 wlott 1.1 ;;;
939     ;;; We don't attempt to convert calls to functions that have an XEP, since
940     ;;; we might be embarrassed later when we want to convert a newly discovered
941 ram 1.38 ;;; local call. Also, see OK-INITIAL-CONVERT-P.
942 wlott 1.1 ;;;
943     (defun maybe-let-convert (fun)
944     (declare (type clambda fun))
945     (let ((refs (leaf-refs fun)))
946     (when (and refs (null (rest refs))
947 ram 1.23 (member (functional-kind fun) '(nil :assignment))
948 wlott 1.1 (not (functional-entry-function fun)))
949     (let* ((ref-cont (node-cont (first refs)))
950     (dest (continuation-dest ref-cont)))
951     (when (and (basic-combination-p dest)
952     (eq (basic-combination-fun dest) ref-cont)
953 ram 1.24 (eq (basic-combination-kind dest) :local)
954 ram 1.36 (not (block-delete-p (node-block dest)))
955 ram 1.38 (cond ((ok-initial-convert-p fun) t)
956     (t
957 ram 1.36 (reoptimize-continuation ref-cont)
958 ram 1.38 nil)))
959     (unless (eq (functional-kind fun) :assignment)
960     (let-convert fun dest))
961     (reoptimize-call dest)
962 wlott 1.1 (setf (functional-kind fun)
963 ram 1.23 (if (mv-combination-p dest) :mv-let :let))))
964     t)))
965    
966    
967     ;;;; Tail local calls and assignments:
968    
969     ;;; ONLY-HARMLESS-CLEANUPS -- Internal
970     ;;;
971     ;;; Return T if there are no cleanups between Block1 and Block2, or if they
972     ;;; definitely won't generate any cleanup code. Currently we recognize lexical
973     ;;; entry points that are only used locally (if at all).
974     ;;;
975     (defun only-harmless-cleanups (block1 block2)
976     (declare (type cblock block1 block2))
977     (or (eq block1 block2)
978     (let ((cleanup2 (block-start-cleanup block2)))
979     (do ((cleanup (block-end-cleanup block1)
980     (node-enclosing-cleanup (cleanup-mess-up cleanup))))
981     ((eq cleanup cleanup2) t)
982     (case (cleanup-kind cleanup)
983     ((:block :tagbody)
984     (unless (null (entry-exits (cleanup-mess-up cleanup)))
985     (return nil)))
986     (t (return nil)))))))
987    
988    
989     ;;; MAYBE-CONVERT-TAIL-LOCAL-CALL -- Interface
990     ;;;
991 ram 1.31 ;;; If a potentially TR local call really is TR, then convert it to jump
992     ;;; directly to the called function. We also call MAYBE-CONVERT-TO-ASSIGNMENT.
993 ram 1.39 ;;; The first value is true if we tail-convert. The second is the value of
994     ;;; M-C-T-A. We can switch the succesor (potentially deleting the RETURN node)
995     ;;; unless:
996 ram 1.31 ;;; -- The call has already been converted.
997     ;;; -- The call isn't TR (random implicit MV PROG1.)
998 ram 1.23 ;;; -- The call is in an XEP (thus we might decide to make it non-tail so that
999     ;;; we can use known return inside the component.)
1000     ;;; -- There is a change in the cleanup between the call in the return, so we
1001     ;;; might need to introduce cleanup code.
1002     ;;;
1003     (defun maybe-convert-tail-local-call (call)
1004     (declare (type combination call))
1005     (let ((return (continuation-dest (node-cont call))))
1006     (assert (return-p return))
1007     (when (and (not (node-tail-p call))
1008 ram 1.31 (immediately-used-p (return-result return) call)
1009 ram 1.23 (not (eq (functional-kind (node-home-lambda call))
1010     :external))
1011     (only-harmless-cleanups (node-block call)
1012     (node-block return)))
1013     (node-ends-block call)
1014     (let ((block (node-block call))
1015     (fun (combination-lambda call)))
1016     (setf (node-tail-p call) t)
1017     (unlink-blocks block (first (block-succ block)))
1018     (link-blocks block (node-block (lambda-bind fun)))
1019     (values t (maybe-convert-to-assignment fun))))))
1020    
1021    
1022     ;;; MAYBE-CONVERT-TO-ASSIGNMENT -- Interface
1023     ;;;
1024     ;;; Called when we believe it might make sense to convert Fun to an
1025 ram 1.25 ;;; assignment. All this function really does is determine when a function
1026     ;;; with more than one call can still be combined with the calling function's
1027     ;;; environment. We can convert when:
1028 ram 1.23 ;;; -- The function is a normal, non-entry function, and
1029 ram 1.25 ;;; -- Except for one call, all calls must be tail recursive calls in the
1030     ;;; called function (i.e. are self-recursive tail calls)
1031 ram 1.38 ;;; -- OK-INITIAL-CONVERT-P is true.
1032 ram 1.23 ;;;
1033 ram 1.25 ;;; There may be one outside call, and it need not be tail-recursive. Since
1034     ;;; all tail local calls have already been converted to direct transfers, the
1035     ;;; only control semantics needed are to splice in the body at the non-tail
1036     ;;; call. If there is no non-tail call, then we need only merge the
1037     ;;; environments. Both cases are handled by LET-CONVERT.
1038     ;;;
1039     ;;; ### It would actually be possible to allow any number of outside calls as
1040     ;;; long as they all return to the same place (i.e. have the same conceptual
1041     ;;; continuation.) A special case of this would be when all of the outside
1042     ;;; calls are tail recursive.
1043 ram 1.23 ;;;
1044     (defun maybe-convert-to-assignment (fun)
1045     (declare (type clambda fun))
1046     (when (and (not (functional-kind fun))
1047     (not (functional-entry-function fun)))
1048     (let ((non-tail nil)
1049     (call-fun nil))
1050 ram 1.38 (when (and (dolist (ref (leaf-refs fun) t)
1051     (let ((dest (continuation-dest (node-cont ref))))
1052     (when (block-delete-p (node-block dest)) (return nil))
1053     (let ((home (node-home-lambda ref)))
1054     (unless (eq home fun)
1055     (when call-fun (return nil))
1056     (setq call-fun home))
1057     (unless (node-tail-p dest)
1058     (when (or non-tail (eq home fun)) (return nil))
1059     (setq non-tail dest)))))
1060     (ok-initial-convert-p fun))
1061 ram 1.30 (setf (functional-kind fun) :assignment)
1062 ram 1.23 (let-convert fun (or non-tail
1063     (continuation-dest
1064     (node-cont (first (leaf-refs fun))))))
1065 ram 1.38 (when non-tail (reoptimize-call non-tail))
1066 ram 1.23 t))))

  ViewVC Help
Powered by ViewVC 1.1.5