1 ;;;; This file contains the virtual-machine-independent parts of the
2 ;;;; code which does the actual translation of nodes to VOPs.
4 ;;;; This software is part of the SBCL system. See the README file for
7 ;;;; This software is derived from the CMU CL system, which was
8 ;;;; written at Carnegie Mellon University and released into the
9 ;;;; public domain. The software is in the public domain and is
10 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
11 ;;;; files for more information.
15 ;;;; moves and type checks
17 ;;; Move X to Y unless they are EQ.
18 (defun emit-move (node block x y)
19 (declare (type node node) (type ir2-block block) (type tn x y))
21 (vop move node block x y))
24 ;;; If there is any CHECK-xxx template for TYPE, then return it,
25 ;;; otherwise return NIL.
26 (defun type-check-template (type)
27 (declare (type ctype type))
28 (multiple-value-bind (check-ptype exact) (primitive-type type)
30 (primitive-type-check check-ptype)
31 (let ((name (hairy-type-check-template-name type)))
33 (template-or-lose name)
36 ;;; Emit code in BLOCK to check that VALUE is of the specified TYPE,
37 ;;; yielding the checked result in RESULT. VALUE and result may be of
38 ;;; any primitive type. There must be CHECK-xxx VOP for TYPE. Any
39 ;;; other type checks should have been converted to an explicit type
41 (defun emit-type-check (node block value result type)
42 (declare (type tn value result) (type node node) (type ir2-block block)
44 (emit-move-template node block (type-check-template type) value result)
47 ;;; Allocate an indirect value cell. Maybe do some clever stack
48 ;;; allocation someday.
49 (defevent make-value-cell "Allocate heap value cell for lexical var.")
50 (defun do-make-value-cell (node block value res)
51 (event make-value-cell node)
52 (vop make-value-cell node block value res))
56 ;;; Return the TN that holds the value of THING in the environment ENV.
57 (declaim (ftype (function ((or nlx-info lambda-var) physenv) tn)
59 (defun find-in-physenv (thing physenv)
60 (or (cdr (assoc thing (ir2-physenv-closure (physenv-info physenv))))
63 ;; I think that a failure of this assertion means that we're
64 ;; trying to access a variable which was improperly closed
65 ;; over. The PHYSENV describes a physical environment. Every
66 ;; variable that a form refers to should either be in its
67 ;; physical environment directly, or grabbed from a
68 ;; surrounding physical environment when it was closed over.
69 ;; The ASSOC expression above finds closed-over variables, so
70 ;; if we fell through the ASSOC expression, it wasn't closed
71 ;; over. Therefore, it must be in our physical environment
72 ;; directly. If instead it is in some other physical
73 ;; environment, then it's bogus for us to reference it here
74 ;; without it being closed over. -- WHN 2001-09-29
75 (aver (eq physenv (lambda-physenv (lambda-var-home thing))))
78 (aver (eq physenv (block-physenv (nlx-info-target thing))))
79 (ir2-nlx-info-home (nlx-info-info thing))))))
81 ;;; If LEAF already has a constant TN, return that, otherwise make a
83 (defun constant-tn (leaf)
84 (declare (type constant leaf))
86 (setf (leaf-info leaf)
87 (make-constant-tn leaf))))
89 ;;; Return a TN that represents the value of LEAF, or NIL if LEAF
90 ;;; isn't directly represented by a TN. ENV is the environment that
91 ;;; the reference is done in.
92 (defun leaf-tn (leaf env)
93 (declare (type leaf leaf) (type physenv env))
96 (unless (lambda-var-indirect leaf)
97 (find-in-physenv leaf env)))
98 (constant (constant-tn leaf))
101 ;;; This is used to conveniently get a handle on a constant TN during
102 ;;; IR2 conversion. It returns a constant TN representing the Lisp
104 (defun emit-constant (value)
105 (constant-tn (find-constant value)))
107 ;;; Convert a REF node. The reference must not be delayed.
108 (defun ir2-convert-ref (node block)
109 (declare (type ref node) (type ir2-block block))
110 (let* ((cont (node-cont node))
111 (leaf (ref-leaf node))
112 (locs (continuation-result-tns
113 cont (list (primitive-type (leaf-type leaf)))))
117 (let ((tn (find-in-physenv leaf (node-physenv node))))
118 (if (lambda-var-indirect leaf)
119 (vop value-cell-ref node block tn res)
120 (emit-move node block tn res))))
122 (if (legal-immediate-constant-p leaf)
123 (emit-move node block (constant-tn leaf) res)
124 (let* ((name (leaf-source-name leaf))
125 (name-tn (emit-constant name)))
126 (if (policy node (zerop safety))
127 (vop fast-symbol-value node block name-tn res)
128 (vop symbol-value node block name-tn res)))))
130 (ir2-convert-closure node block leaf res))
132 (let ((unsafe (policy node (zerop safety)))
133 (name (leaf-source-name leaf)))
134 (ecase (global-var-kind leaf)
136 (aver (symbolp name))
137 (let ((name-tn (emit-constant name)))
139 (vop fast-symbol-value node block name-tn res)
140 (vop symbol-value node block name-tn res))))
142 (let ((fdefn-tn (make-load-time-constant-tn :fdefinition name)))
144 (vop fdefn-fun node block fdefn-tn res)
145 (vop safe-fdefn-fun node block fdefn-tn res))))))))
146 (move-continuation-result node block locs cont))
149 ;;; Emit code to load a function object representing LEAF into RES.
150 ;;; This gets interesting when the referenced function is a closure:
151 ;;; we must make the closure and move the closed over values into it.
153 ;;; LEAF is either a :TOPLEVEL-XEP functional or the XEP lambda for
154 ;;; the called function, since local call analysis converts all
155 ;;; closure references. If a TL-XEP, we know it is not a closure.
157 ;;; If a closed-over LAMBDA-VAR has no refs (is deleted), then we
158 ;;; don't initialize that slot. This can happen with closures over
159 ;;; top level variables, where optimization of the closure deleted the
160 ;;; variable. Since we committed to the closure format when we
161 ;;; pre-analyzed the top level code, we just leave an empty slot.
162 (defun ir2-convert-closure (node block leaf res)
163 (declare (type ref node) (type ir2-block block)
164 (type functional leaf) (type tn res))
165 (unless (leaf-info leaf)
166 (setf (leaf-info leaf) (make-entry-info)))
167 (let ((entry (make-load-time-constant-tn :entry leaf))
168 (closure (etypecase leaf
170 (physenv-closure (get-lambda-physenv leaf)))
172 (aver (eq (functional-kind leaf) :toplevel-xep))
175 (let ((this-env (node-physenv node)))
176 (vop make-closure node block entry (length closure) res)
177 (loop for what in closure and n from 0 do
178 (unless (and (lambda-var-p what)
179 (null (leaf-refs what)))
180 (vop closure-init node block
182 (find-in-physenv what this-env)
185 (emit-move node block entry res))))
188 ;;; Convert a SET node. If the node's CONT is annotated, then we also
189 ;;; deliver the value to that continuation. If the var is a lexical
190 ;;; variable with no refs, then we don't actually set anything, since
191 ;;; the variable has been deleted.
192 (defun ir2-convert-set (node block)
193 (declare (type cset node) (type ir2-block block))
194 (let* ((cont (node-cont node))
195 (leaf (set-var node))
196 (val (continuation-tn node block (set-value node)))
197 (locs (if (continuation-info cont)
198 (continuation-result-tns
199 cont (list (primitive-type (leaf-type leaf))))
203 (when (leaf-refs leaf)
204 (let ((tn (find-in-physenv leaf (node-physenv node))))
205 (if (lambda-var-indirect leaf)
206 (vop value-cell-set node block tn val)
207 (emit-move node block val tn)))))
209 (ecase (global-var-kind leaf)
211 (aver (symbolp (leaf-source-name leaf)))
212 (vop set node block (emit-constant (leaf-source-name leaf)) val)))))
214 (emit-move node block val (first locs))
215 (move-continuation-result node block locs cont)))
218 ;;;; utilities for receiving fixed values
220 ;;; Return a TN that can be referenced to get the value of CONT. CONT
221 ;;; must be LTN-Annotated either as a delayed leaf ref or as a fixed,
222 ;;; single-value continuation. If a type check is called for, do it.
224 ;;; The primitive-type of the result will always be the same as the
225 ;;; IR2-CONTINUATION-PRIMITIVE-TYPE, ensuring that VOPs are always
226 ;;; called with TNs that satisfy the operand primitive-type
227 ;;; restriction. We may have to make a temporary of the desired type
228 ;;; and move the actual continuation TN into it. This happens when we
229 ;;; delete a type check in unsafe code or when we locally know
230 ;;; something about the type of an argument variable.
231 (defun continuation-tn (node block cont)
232 (declare (type node node) (type ir2-block block) (type continuation cont))
233 (let* ((2cont (continuation-info cont))
235 (ecase (ir2-continuation-kind 2cont)
237 (let ((ref (continuation-use cont)))
238 (leaf-tn (ref-leaf ref) (node-physenv ref))))
240 (aver (= (length (ir2-continuation-locs 2cont)) 1))
241 (first (ir2-continuation-locs 2cont)))))
242 (ptype (ir2-continuation-primitive-type 2cont)))
244 (cond ((and (eq (continuation-type-check cont) t)
245 (multiple-value-bind (check types)
246 (continuation-check-types cont)
247 (aver (eq check :simple))
248 ;; If the proven type is a subtype of the possibly
249 ;; weakened type check then it's always true and is
251 (unless (values-subtypep (continuation-proven-type cont)
253 (let ((temp (make-normal-tn ptype)))
254 (emit-type-check node block cont-tn temp
257 ((eq (tn-primitive-type cont-tn) ptype) cont-tn)
259 (let ((temp (make-normal-tn ptype)))
260 (emit-move node block cont-tn temp)
263 ;;; This is similar to CONTINUATION-TN, but hacks multiple values. We
264 ;;; return continuations holding the values of CONT with PTYPES as
265 ;;; their primitive types. CONT must be annotated for the same number
266 ;;; of fixed values are there are PTYPES.
268 ;;; If the continuation has a type check, check the values into temps
269 ;;; and return the temps. When we have more values than assertions, we
270 ;;; move the extra values with no check.
271 (defun continuation-tns (node block cont ptypes)
272 (declare (type node node) (type ir2-block block)
273 (type continuation cont) (list ptypes))
274 (let* ((locs (ir2-continuation-locs (continuation-info cont)))
275 (nlocs (length locs)))
276 (aver (= nlocs (length ptypes)))
277 (if (eq (continuation-type-check cont) t)
278 (multiple-value-bind (check types) (continuation-check-types cont)
279 (aver (eq check :simple))
280 (let ((ntypes (length types)))
281 (mapcar #'(lambda (from to-type assertion)
282 (let ((temp (make-normal-tn to-type)))
284 (emit-type-check node block from temp assertion)
285 (emit-move node block from temp))
289 (append types (make-list (- nlocs ntypes)
290 :initial-element nil))
292 (mapcar #'(lambda (from to-type)
293 (if (eq (tn-primitive-type from) to-type)
295 (let ((temp (make-normal-tn to-type)))
296 (emit-move node block from temp)
301 ;;;; utilities for delivering values to continuations
303 ;;; Return a list of TNs with the specifier TYPES that can be used as
304 ;;; result TNs to evaluate an expression into the continuation CONT.
305 ;;; This is used together with MOVE-CONTINUATION-RESULT to deliver
306 ;;; fixed values to a continuation.
308 ;;; If the continuation isn't annotated (meaning the values are
309 ;;; discarded) or is unknown-values, the then we make temporaries for
310 ;;; each supplied value, providing a place to compute the result in
311 ;;; until we decide what to do with it (if anything.)
313 ;;; If the continuation is fixed-values, and wants the same number of
314 ;;; values as the user wants to deliver, then we just return the
315 ;;; IR2-CONTINUATION-LOCS. Otherwise we make a new list padded as
316 ;;; necessary by discarded TNs. We always return a TN of the specified
317 ;;; type, using the continuation locs only when they are of the
319 (defun continuation-result-tns (cont types)
320 (declare (type continuation cont) (type list types))
321 (let ((2cont (continuation-info cont)))
323 (mapcar #'make-normal-tn types)
324 (ecase (ir2-continuation-kind 2cont)
326 (let* ((locs (ir2-continuation-locs 2cont))
327 (nlocs (length locs))
328 (ntypes (length types)))
329 (if (and (= nlocs ntypes)
330 (do ((loc locs (cdr loc))
331 (type types (cdr type)))
333 (unless (eq (tn-primitive-type (car loc)) (car type))
336 (mapcar #'(lambda (loc type)
337 (if (eq (tn-primitive-type loc) type)
339 (make-normal-tn type)))
342 (mapcar #'make-normal-tn
343 (subseq types nlocs)))
347 (mapcar #'make-normal-tn types))))))
349 ;;; Make the first N standard value TNs, returning them in a list.
350 (defun make-standard-value-tns (n)
351 (declare (type unsigned-byte n))
354 (res (standard-argument-location i)))
357 ;;; Return a list of TNs wired to the standard value passing
358 ;;; conventions that can be used to receive values according to the
359 ;;; unknown-values convention. This is used with together
360 ;;; MOVE-CONTINUATION-RESULT for delivering unknown values to a fixed
361 ;;; values continuation.
363 ;;; If the continuation isn't annotated, then we treat as 0-values,
364 ;;; returning an empty list of temporaries.
366 ;;; If the continuation is annotated, then it must be :FIXED.
367 (defun standard-result-tns (cont)
368 (declare (type continuation cont))
369 (let ((2cont (continuation-info cont)))
371 (ecase (ir2-continuation-kind 2cont)
373 (make-standard-value-tns (length (ir2-continuation-locs 2cont)))))
376 ;;; Just move each SRC TN into the corresponding DEST TN, defaulting
377 ;;; any unsupplied source values to NIL. We let EMIT-MOVE worry about
378 ;;; doing the appropriate coercions.
379 (defun move-results-coerced (node block src dest)
380 (declare (type node node) (type ir2-block block) (list src dest))
381 (let ((nsrc (length src))
382 (ndest (length dest)))
383 (mapc #'(lambda (from to)
385 (emit-move node block from to)))
387 (append src (make-list (- ndest nsrc)
388 :initial-element (emit-constant nil)))
393 ;;; If necessary, emit coercion code needed to deliver the RESULTS to
394 ;;; the specified continuation. NODE and BLOCK provide context for
395 ;;; emitting code. Although usually obtained from STANDARD-RESULT-TNs
396 ;;; or CONTINUATION-RESULT-TNs, RESULTS my be a list of any type or
399 ;;; If the continuation is fixed values, then move the results into
400 ;;; the continuation locations. If the continuation is unknown values,
401 ;;; then do the moves into the standard value locations, and use
402 ;;; PUSH-VALUES to put the values on the stack.
403 (defun move-continuation-result (node block results cont)
404 (declare (type node node) (type ir2-block block)
405 (list results) (type continuation cont))
406 (let* ((2cont (continuation-info cont)))
408 (ecase (ir2-continuation-kind 2cont)
410 (let ((locs (ir2-continuation-locs 2cont)))
411 (unless (eq locs results)
412 (move-results-coerced node block results locs))))
414 (let* ((nvals (length results))
415 (locs (make-standard-value-tns nvals)))
416 (move-results-coerced node block results locs)
417 (vop* push-values node block
418 ((reference-tn-list locs nil))
419 ((reference-tn-list (ir2-continuation-locs 2cont) t))
423 ;;;; template conversion
425 ;;; Build a TN-Refs list that represents access to the values of the
426 ;;; specified list of continuations ARGS for TEMPLATE. Any :CONSTANT
427 ;;; arguments are returned in the second value as a list rather than
428 ;;; being accessed as a normal argument. NODE and BLOCK provide the
429 ;;; context for emitting any necessary type-checking code.
430 (defun reference-arguments (node block args template)
431 (declare (type node node) (type ir2-block block) (list args)
432 (type template template))
433 (collect ((info-args))
436 (do ((args args (cdr args))
437 (types (template-arg-types template) (cdr types)))
439 (let ((type (first types))
441 (if (and (consp type) (eq (car type) ':constant))
442 (info-args (continuation-value arg))
443 (let ((ref (reference-tn (continuation-tn node block arg) nil)))
445 (setf (tn-ref-across last) ref)
449 (values (the (or tn-ref null) first) (info-args)))))
451 ;;; Convert a conditional template. We try to exploit any
452 ;;; drop-through, but emit an unconditional branch afterward if we
453 ;;; fail. NOT-P is true if the sense of the TEMPLATE's test should be
455 (defun ir2-convert-conditional (node block template args info-args if not-p)
456 (declare (type node node) (type ir2-block block)
457 (type template template) (type (or tn-ref null) args)
458 (list info-args) (type cif if) (type boolean not-p))
459 (aver (= (template-info-arg-count template) (+ (length info-args) 2)))
460 (let ((consequent (if-consequent if))
461 (alternative (if-alternative if)))
462 (cond ((drop-thru-p if consequent)
463 (emit-template node block template args nil
464 (list* (block-label alternative) (not not-p)
467 (emit-template node block template args nil
468 (list* (block-label consequent) not-p info-args))
469 (unless (drop-thru-p if alternative)
470 (vop branch node block (block-label alternative)))))))
472 ;;; Convert an IF that isn't the DEST of a conditional template.
473 (defun ir2-convert-if (node block)
474 (declare (type ir2-block block) (type cif node))
475 (let* ((test (if-test node))
476 (test-ref (reference-tn (continuation-tn node block test) nil))
477 (nil-ref (reference-tn (emit-constant nil) nil)))
478 (setf (tn-ref-across test-ref) nil-ref)
479 (ir2-convert-conditional node block (template-or-lose 'if-eq)
480 test-ref () node t)))
482 ;;; Return a list of primitive-types that we can pass to
483 ;;; CONTINUATION-RESULT-TNS describing the result types we want for a
484 ;;; template call. We duplicate here the determination of output type
485 ;;; that was done in initially selecting the template, so we know that
486 ;;; the types we find are allowed by the template output type
488 (defun find-template-result-types (call cont template rtypes)
489 (declare (type combination call) (type continuation cont)
490 (type template template) (list rtypes))
491 (let* ((dtype (node-derived-type call))
492 (type (if (and (or (eq (template-ltn-policy template) :safe)
493 (policy call (= safety 0)))
494 (continuation-type-check cont))
495 (values-type-intersection
497 (continuation-asserted-type cont))
499 (types (mapcar #'primitive-type
500 (if (values-type-p type)
501 (append (values-type-required type)
502 (values-type-optional type))
504 (let ((nvals (length rtypes))
505 (ntypes (length types)))
506 (cond ((< ntypes nvals)
508 (make-list (- nvals ntypes)
509 :initial-element *backend-t-primitive-type*)))
511 (subseq types 0 nvals))
515 ;;; Return a list of TNs usable in a CALL to TEMPLATE delivering
516 ;;; values to CONT. As an efficiency hack, we pick off the common case
517 ;;; where the continuation is fixed values and has locations that
518 ;;; satisfy the result restrictions. This can fail when there is a
519 ;;; type check or a values count mismatch.
520 (defun make-template-result-tns (call cont template rtypes)
521 (declare (type combination call) (type continuation cont)
522 (type template template) (list rtypes))
523 (let ((2cont (continuation-info cont)))
524 (if (and 2cont (eq (ir2-continuation-kind 2cont) :fixed))
525 (let ((locs (ir2-continuation-locs 2cont)))
526 (if (and (= (length rtypes) (length locs))
527 (do ((loc locs (cdr loc))
528 (rtype rtypes (cdr rtype)))
530 (unless (operand-restriction-ok
532 (tn-primitive-type (car loc))
536 (continuation-result-tns
538 (find-template-result-types call cont template rtypes))))
539 (continuation-result-tns
541 (find-template-result-types call cont template rtypes)))))
543 ;;; Get the operands into TNs, make TN-Refs for them, and then call
544 ;;; the template emit function.
545 (defun ir2-convert-template (call block)
546 (declare (type combination call) (type ir2-block block))
547 (let* ((template (combination-info call))
548 (cont (node-cont call))
549 (rtypes (template-result-types template)))
550 (multiple-value-bind (args info-args)
551 (reference-arguments call block (combination-args call) template)
552 (aver (not (template-more-results-type template)))
553 (if (eq rtypes :conditional)
554 (ir2-convert-conditional call block template args info-args
555 (continuation-dest cont) nil)
556 (let* ((results (make-template-result-tns call cont template rtypes))
557 (r-refs (reference-tn-list results t)))
558 (aver (= (length info-args)
559 (template-info-arg-count template)))
561 (emit-template call block template args r-refs info-args)
562 (emit-template call block template args r-refs))
563 (move-continuation-result call block results cont)))))
566 ;;; We don't have to do much because operand count checking is done by
567 ;;; IR1 conversion. The only difference between this and the function
568 ;;; case of IR2-CONVERT-TEMPLATE is that there can be codegen-info
570 (defoptimizer (%%primitive ir2-convert) ((template info &rest args) call block)
571 (let* ((template (continuation-value template))
572 (info (continuation-value info))
573 (cont (node-cont call))
574 (rtypes (template-result-types template))
575 (results (make-template-result-tns call cont template rtypes))
576 (r-refs (reference-tn-list results t)))
577 (multiple-value-bind (args info-args)
578 (reference-arguments call block (cddr (combination-args call))
580 (aver (not (template-more-results-type template)))
581 (aver (not (eq rtypes :conditional)))
582 (aver (null info-args))
585 (emit-template call block template args r-refs info)
586 (emit-template call block template args r-refs))
588 (move-continuation-result call block results cont)))
593 ;;; Convert a LET by moving the argument values into the variables.
594 ;;; Since a LET doesn't have any passing locations, we move the
595 ;;; arguments directly into the variables. We must also allocate any
596 ;;; indirect value cells, since there is no function prologue to do
598 (defun ir2-convert-let (node block fun)
599 (declare (type combination node) (type ir2-block block) (type clambda fun))
600 (mapc #'(lambda (var arg)
602 (let ((src (continuation-tn node block arg))
603 (dest (leaf-info var)))
604 (if (lambda-var-indirect var)
605 (do-make-value-cell node block src dest)
606 (emit-move node block src dest)))))
607 (lambda-vars fun) (basic-combination-args node))
610 ;;; Emit any necessary moves into assignment temps for a local call to
611 ;;; FUN. We return two lists of TNs: TNs holding the actual argument
612 ;;; values, and (possibly EQ) TNs that are the actual destination of
613 ;;; the arguments. When necessary, we allocate temporaries for
614 ;;; arguments to preserve parallel assignment semantics. These lists
615 ;;; exclude unused arguments and include implicit environment
616 ;;; arguments, i.e. they exactly correspond to the arguments passed.
618 ;;; OLD-FP is the TN currently holding the value we want to pass as
619 ;;; OLD-FP. If null, then the call is to the same environment (an
620 ;;; :ASSIGNMENT), so we only move the arguments, and leave the
621 ;;; environment alone.
622 (defun emit-psetq-moves (node block fun old-fp)
623 (declare (type combination node) (type ir2-block block) (type clambda fun)
624 (type (or tn null) old-fp))
625 (let* ((called-env (physenv-info (lambda-physenv fun)))
626 (this-1env (node-physenv node))
627 (actuals (mapcar #'(lambda (x)
629 (continuation-tn node block x)))
630 (combination-args node))))
633 (dolist (var (lambda-vars fun))
634 (let ((actual (pop actuals))
635 (loc (leaf-info var)))
638 ((lambda-var-indirect var)
640 (make-normal-tn *backend-t-primitive-type*)))
641 (do-make-value-cell node block actual temp)
643 ((member actual (locs))
644 (let ((temp (make-normal-tn (tn-primitive-type loc))))
645 (emit-move node block actual temp)
652 (dolist (thing (ir2-physenv-closure called-env))
653 (temps (find-in-physenv (car thing) this-1env))
657 (locs (ir2-physenv-old-fp called-env)))
659 (values (temps) (locs)))))
661 ;;; A tail-recursive local call is done by emitting moves of stuff
662 ;;; into the appropriate passing locations. After setting up the args
663 ;;; and environment, we just move our return-pc into the called
664 ;;; function's passing location.
665 (defun ir2-convert-tail-local-call (node block fun)
666 (declare (type combination node) (type ir2-block block) (type clambda fun))
667 (let ((this-env (physenv-info (node-physenv node))))
668 (multiple-value-bind (temps locs)
669 (emit-psetq-moves node block fun (ir2-physenv-old-fp this-env))
671 (mapc #'(lambda (temp loc)
672 (emit-move node block temp loc))
675 (emit-move node block
676 (ir2-physenv-return-pc this-env)
677 (ir2-physenv-return-pc-pass
679 (lambda-physenv fun)))))
683 ;;; Convert an :ASSIGNMENT call. This is just like a tail local call,
684 ;;; except that the caller and callee environment are the same, so we
685 ;;; don't need to mess with the environment locations, return PC, etc.
686 (defun ir2-convert-assignment (node block fun)
687 (declare (type combination node) (type ir2-block block) (type clambda fun))
688 (multiple-value-bind (temps locs) (emit-psetq-moves node block fun nil)
690 (mapc #'(lambda (temp loc)
691 (emit-move node block temp loc))
695 ;;; Do stuff to set up the arguments to a non-tail local call
696 ;;; (including implicit environment args.) We allocate a frame
697 ;;; (returning the FP and NFP), and also compute the TN-REFS list for
698 ;;; the values to pass and the list of passing location TNs.
699 (defun ir2-convert-local-call-args (node block fun)
700 (declare (type combination node) (type ir2-block block) (type clambda fun))
701 (let ((fp (make-stack-pointer-tn))
702 (nfp (make-number-stack-pointer-tn))
703 (old-fp (make-stack-pointer-tn)))
704 (multiple-value-bind (temps locs)
705 (emit-psetq-moves node block fun old-fp)
706 (vop current-fp node block old-fp)
707 (vop allocate-frame node block
708 (physenv-info (lambda-physenv fun))
710 (values fp nfp temps (mapcar #'make-alias-tn locs)))))
712 ;;; Handle a non-TR known-values local call. We emit the call, then
713 ;;; move the results to the continuation's destination.
714 (defun ir2-convert-local-known-call (node block fun returns cont start)
715 (declare (type node node) (type ir2-block block) (type clambda fun)
716 (type return-info returns) (type continuation cont)
718 (multiple-value-bind (fp nfp temps arg-locs)
719 (ir2-convert-local-call-args node block fun)
720 (let ((locs (return-info-locations returns)))
721 (vop* known-call-local node block
722 (fp nfp (reference-tn-list temps nil))
723 ((reference-tn-list locs t))
724 arg-locs (physenv-info (lambda-physenv fun)) start)
725 (move-continuation-result node block locs cont)))
728 ;;; Handle a non-TR unknown-values local call. We do different things
729 ;;; depending on what kind of values the continuation wants.
731 ;;; If CONT is :UNKNOWN, then we use the "multiple-" variant, directly
732 ;;; specifying the continuation's LOCS as the VOP results so that we
733 ;;; don't have to do anything after the call.
735 ;;; Otherwise, we use STANDARD-RESULT-TNS to get wired result TNs, and
736 ;;; then call MOVE-CONTINUATION-RESULT to do any necessary type checks
738 (defun ir2-convert-local-unknown-call (node block fun cont start)
739 (declare (type node node) (type ir2-block block) (type clambda fun)
740 (type continuation cont) (type label start))
741 (multiple-value-bind (fp nfp temps arg-locs)
742 (ir2-convert-local-call-args node block fun)
743 (let ((2cont (continuation-info cont))
744 (env (physenv-info (lambda-physenv fun)))
745 (temp-refs (reference-tn-list temps nil)))
746 (if (and 2cont (eq (ir2-continuation-kind 2cont) :unknown))
747 (vop* multiple-call-local node block (fp nfp temp-refs)
748 ((reference-tn-list (ir2-continuation-locs 2cont) t))
750 (let ((locs (standard-result-tns cont)))
751 (vop* call-local node block
753 ((reference-tn-list locs t))
754 arg-locs env start (length locs))
755 (move-continuation-result node block locs cont)))))
758 ;;; Dispatch to the appropriate function, depending on whether we have
759 ;;; a let, tail or normal call. If the function doesn't return, call
760 ;;; it using the unknown-value convention. We could compile it as a
761 ;;; tail call, but that might seem confusing in the debugger.
762 (defun ir2-convert-local-call (node block)
763 (declare (type combination node) (type ir2-block block))
764 (let* ((fun (ref-leaf (continuation-use (basic-combination-fun node))))
765 (kind (functional-kind fun)))
766 (cond ((eq kind :let)
767 (ir2-convert-let node block fun))
768 ((eq kind :assignment)
769 (ir2-convert-assignment node block fun))
771 (ir2-convert-tail-local-call node block fun))
773 (let ((start (block-label (lambda-block fun)))
774 (returns (tail-set-info (lambda-tail-set fun)))
775 (cont (node-cont node)))
777 (return-info-kind returns)
780 (ir2-convert-local-unknown-call node block fun cont start))
782 (ir2-convert-local-known-call node block fun returns
788 ;;; Given a function continuation FUN, return as values a TN holding
789 ;;; the thing that we call and true if the thing is named (false if it
790 ;;; is a function). There are two interesting non-named cases:
791 ;;; -- Known to be a function, no check needed: return the
792 ;;; continuation loc.
793 ;;; -- Not known what it is.
794 (defun function-continuation-tn (node block cont)
795 (declare (type continuation cont))
796 (let ((2cont (continuation-info cont)))
797 (if (eq (ir2-continuation-kind 2cont) :delayed)
798 (let ((name (continuation-fun-name cont t)))
800 (values (make-load-time-constant-tn :fdefinition name) t))
801 (let* ((locs (ir2-continuation-locs 2cont))
803 (check (continuation-type-check cont))
804 (function-ptype (primitive-type-or-lose 'function)))
805 (aver (and (eq (ir2-continuation-kind 2cont) :fixed)
806 (= (length locs) 1)))
807 (cond ((eq (tn-primitive-type loc) function-ptype)
808 (aver (not (eq check t)))
811 (let ((temp (make-normal-tn function-ptype)))
812 (aver (and (eq (ir2-continuation-primitive-type 2cont)
815 (emit-type-check node block loc temp
816 (specifier-type 'function))
817 (values temp nil))))))))
819 ;;; Set up the args to Node in the current frame, and return a tn-ref
820 ;;; list for the passing locations.
821 (defun move-tail-full-call-args (node block)
822 (declare (type combination node) (type ir2-block block))
823 (let ((args (basic-combination-args node))
826 (dotimes (num (length args))
827 (let ((loc (standard-argument-location num)))
828 (emit-move node block (continuation-tn node block (elt args num)) loc)
829 (let ((ref (reference-tn loc nil)))
831 (setf (tn-ref-across last) ref)
836 ;;; Move the arguments into the passing locations and do a (possibly
837 ;;; named) tail call.
838 (defun ir2-convert-tail-full-call (node block)
839 (declare (type combination node) (type ir2-block block))
840 (let* ((env (physenv-info (node-physenv node)))
841 (args (basic-combination-args node))
842 (nargs (length args))
843 (pass-refs (move-tail-full-call-args node block))
844 (old-fp (ir2-physenv-old-fp env))
845 (return-pc (ir2-physenv-return-pc env)))
847 (multiple-value-bind (fun-tn named)
848 (function-continuation-tn node block (basic-combination-fun node))
850 (vop* tail-call-named node block
851 (fun-tn old-fp return-pc pass-refs)
854 (vop* tail-call node block
855 (fun-tn old-fp return-pc pass-refs)
861 ;;; like IR2-CONVERT-LOCAL-CALL-ARGS, only different
862 (defun ir2-convert-full-call-args (node block)
863 (declare (type combination node) (type ir2-block block))
864 (let* ((args (basic-combination-args node))
865 (fp (make-stack-pointer-tn))
866 (nargs (length args)))
867 (vop allocate-full-call-frame node block nargs fp)
872 (locs (standard-argument-location num))
873 (let ((ref (reference-tn (continuation-tn node block (elt args num))
876 (setf (tn-ref-across last) ref)
880 (values fp first (locs) nargs)))))
882 ;;; Do full call when a fixed number of values are desired. We make
883 ;;; STANDARD-RESULT-TNS for our continuation, then deliver the result
884 ;;; using MOVE-CONTINUATION-RESULT. We do named or normal call, as
886 (defun ir2-convert-fixed-full-call (node block)
887 (declare (type combination node) (type ir2-block block))
888 (multiple-value-bind (fp args arg-locs nargs)
889 (ir2-convert-full-call-args node block)
890 (let* ((cont (node-cont node))
891 (locs (standard-result-tns cont))
892 (loc-refs (reference-tn-list locs t))
893 (nvals (length locs)))
894 (multiple-value-bind (fun-tn named)
895 (function-continuation-tn node block (basic-combination-fun node))
897 (vop* call-named node block (fp fun-tn args) (loc-refs)
898 arg-locs nargs nvals)
899 (vop* call node block (fp fun-tn args) (loc-refs)
900 arg-locs nargs nvals))
901 (move-continuation-result node block locs cont))))
904 ;;; Do full call when unknown values are desired.
905 (defun ir2-convert-multiple-full-call (node block)
906 (declare (type combination node) (type ir2-block block))
907 (multiple-value-bind (fp args arg-locs nargs)
908 (ir2-convert-full-call-args node block)
909 (let* ((cont (node-cont node))
910 (locs (ir2-continuation-locs (continuation-info cont)))
911 (loc-refs (reference-tn-list locs t)))
912 (multiple-value-bind (fun-tn named)
913 (function-continuation-tn node block (basic-combination-fun node))
915 (vop* multiple-call-named node block (fp fun-tn args) (loc-refs)
917 (vop* multiple-call node block (fp fun-tn args) (loc-refs)
921 ;;; stuff to check in CHECK-FULL-CALL
923 ;;; There are some things which are intended always to be optimized
924 ;;; away by DEFTRANSFORMs and such, and so never compiled into full
925 ;;; calls. This has been a source of bugs so many times that it seems
926 ;;; worth listing some of them here so that we can check the list
927 ;;; whenever we compile a full call.
929 ;;; FIXME: It might be better to represent this property by setting a
930 ;;; flag in DEFKNOWN, instead of representing it by membership in this
932 (defvar *always-optimized-away*
933 '(;; This should always be DEFTRANSFORMed away, but wasn't in a bug
934 ;; reported to cmucl-imp@cons.org 2000-06-20.
936 ;; These should always turn into VOPs, but wasn't in a bug which
937 ;; appeared when LTN-POLICY stuff was being tweaked in
938 ;; sbcl-0.6.9.16. in sbcl-0.6.0
942 ;;; more stuff to check in CHECK-FULL-CALL
944 ;;; These came in handy when troubleshooting cold boot after making
945 ;;; major changes in the package structure: various transforms and
946 ;;; VOPs and stuff got attached to the wrong symbol, so that
947 ;;; references to the right symbol were bogusly translated as full
948 ;;; calls instead of primitives, sending the system off into infinite
949 ;;; space. Having a report on all full calls generated makes it easier
950 ;;; to figure out what form caused the problem this time.
951 #!+sb-show (defvar *show-full-called-fnames-p* nil)
952 #!+sb-show (defvar *full-called-fnames* (make-hash-table :test 'equal))
954 ;;; Do some checks on a full call:
955 ;;; * Is this a full call to something we have reason to know should
956 ;;; never be full called?
957 ;;; * Is this a full call to (SETF FOO) which might conflict with
958 ;;; a DEFSETF or some such thing elsewhere in the program?
959 (defun check-full-call (node)
960 (let* ((cont (basic-combination-fun node))
961 (fname (continuation-fun-name cont t)))
962 (declare (type (or symbol cons) fname))
964 #!+sb-show (unless (gethash fname *full-called-fnames*)
965 (setf (gethash fname *full-called-fnames*) t))
966 #!+sb-show (when *show-full-called-fnames-p*
967 (/show "converting full call to named function" fname)
968 (/show (basic-combination-args node))
969 (/show (policy node speed) (policy node safety))
970 (/show (policy node compilation-speed))
971 (let ((arg-types (mapcar (lambda (maybe-continuation)
972 (when maybe-continuation
975 maybe-continuation))))
976 (basic-combination-args node))))
979 (when (memq fname *always-optimized-away*)
980 (/show (policy node speed) (policy node safety))
981 (/show (policy node compilation-speed))
982 (error "internal error: full call to ~S" fname))
985 (destructuring-bind (setf stem) fname
986 (aver (eq setf 'setf))
987 (setf (gethash stem *setf-assumed-fboundp*) t)))))
989 ;;; If the call is in a tail recursive position and the return
990 ;;; convention is standard, then do a tail full call. If one or fewer
991 ;;; values are desired, then use a single-value call, otherwise use a
992 ;;; multiple-values call.
993 (defun ir2-convert-full-call (node block)
994 (declare (type combination node) (type ir2-block block))
995 (check-full-call node)
996 (let ((2cont (continuation-info (node-cont node))))
997 (cond ((node-tail-p node)
998 (ir2-convert-tail-full-call node block))
1000 (eq (ir2-continuation-kind 2cont) :unknown))
1001 (ir2-convert-multiple-full-call node block))
1003 (ir2-convert-fixed-full-call node block))))
1006 ;;;; entering functions
1008 ;;; Do all the stuff that needs to be done on XEP entry:
1009 ;;; -- Create frame.
1010 ;;; -- Copy any more arg.
1011 ;;; -- Set up the environment, accessing any closure variables.
1012 ;;; -- Move args from the standard passing locations to their internal
1014 (defun init-xep-environment (node block fun)
1015 (declare (type bind node) (type ir2-block block) (type clambda fun))
1016 (let ((start-label (entry-info-offset (leaf-info fun)))
1017 (env (physenv-info (node-physenv node))))
1018 (let ((ef (functional-entry-fun fun)))
1019 (cond ((and (optional-dispatch-p ef) (optional-dispatch-more-entry ef))
1020 ;; Special case the xep-allocate-frame + copy-more-arg case.
1021 (vop xep-allocate-frame node block start-label t)
1022 (vop copy-more-arg node block (optional-dispatch-max-args ef)))
1024 ;; No more args, so normal entry.
1025 (vop xep-allocate-frame node block start-label nil)))
1026 (if (ir2-physenv-closure env)
1027 (let ((closure (make-normal-tn *backend-t-primitive-type*)))
1028 (vop setup-closure-environment node block start-label closure)
1029 (when (getf (functional-plist ef) :fin-function)
1030 (vop funcallable-instance-lexenv node block closure closure))
1032 (dolist (loc (ir2-physenv-closure env))
1033 (vop closure-ref node block closure (incf n) (cdr loc)))))
1034 (vop setup-environment node block start-label)))
1036 (unless (eq (functional-kind fun) :toplevel)
1037 (let ((vars (lambda-vars fun))
1039 (when (leaf-refs (first vars))
1040 (emit-move node block (make-argument-count-location)
1041 (leaf-info (first vars))))
1042 (dolist (arg (rest vars))
1043 (when (leaf-refs arg)
1044 (let ((pass (standard-argument-location n))
1045 (home (leaf-info arg)))
1046 (if (lambda-var-indirect arg)
1047 (do-make-value-cell node block pass home)
1048 (emit-move node block pass home))))
1051 (emit-move node block (make-old-fp-passing-location t)
1052 (ir2-physenv-old-fp env)))
1056 ;;; Emit function prolog code. This is only called on bind nodes for
1057 ;;; functions that allocate environments. All semantics of let calls
1058 ;;; are handled by IR2-CONVERT-LET.
1060 ;;; If not an XEP, all we do is move the return PC from its passing
1061 ;;; location, since in a local call, the caller allocates the frame
1062 ;;; and sets up the arguments.
1063 (defun ir2-convert-bind (node block)
1064 (declare (type bind node) (type ir2-block block))
1065 (let* ((fun (bind-lambda node))
1066 (env (physenv-info (lambda-physenv fun))))
1067 (aver (member (functional-kind fun)
1068 '(nil :external :optional :toplevel :cleanup)))
1070 (when (external-entry-point-p fun)
1071 (init-xep-environment node block fun)
1073 (when *collect-dynamic-statistics*
1074 (vop count-me node block *dynamic-counts-tn*
1075 (block-number (ir2-block-block block)))))
1079 (ir2-physenv-return-pc-pass env)
1080 (ir2-physenv-return-pc env))
1082 (let ((lab (gen-label)))
1083 (setf (ir2-physenv-environment-start env) lab)
1084 (vop note-environment-start node block lab)))
1088 ;;;; function return
1090 ;;; Do stuff to return from a function with the specified values and
1091 ;;; convention. If the return convention is :FIXED and we aren't
1092 ;;; returning from an XEP, then we do a known return (letting
1093 ;;; representation selection insert the correct move-arg VOPs.)
1094 ;;; Otherwise, we use the unknown-values convention. If there is a
1095 ;;; fixed number of return values, then use RETURN, otherwise use
1096 ;;; RETURN-MULTIPLE.
1097 (defun ir2-convert-return (node block)
1098 (declare (type creturn node) (type ir2-block block))
1099 (let* ((cont (return-result node))
1100 (2cont (continuation-info cont))
1101 (cont-kind (ir2-continuation-kind 2cont))
1102 (fun (return-lambda node))
1103 (env (physenv-info (lambda-physenv fun)))
1104 (old-fp (ir2-physenv-old-fp env))
1105 (return-pc (ir2-physenv-return-pc env))
1106 (returns (tail-set-info (lambda-tail-set fun))))
1108 ((and (eq (return-info-kind returns) :fixed)
1109 (not (external-entry-point-p fun)))
1110 (let ((locs (continuation-tns node block cont
1111 (return-info-types returns))))
1112 (vop* known-return node block
1113 (old-fp return-pc (reference-tn-list locs nil))
1115 (return-info-locations returns))))
1116 ((eq cont-kind :fixed)
1117 (let* ((types (mapcar #'tn-primitive-type (ir2-continuation-locs 2cont)))
1118 (cont-locs (continuation-tns node block cont types))
1119 (nvals (length cont-locs))
1120 (locs (make-standard-value-tns nvals)))
1121 (mapc #'(lambda (val loc)
1122 (emit-move node block val loc))
1126 (vop return-single node block old-fp return-pc (car locs))
1127 (vop* return node block
1128 (old-fp return-pc (reference-tn-list locs nil))
1132 (aver (eq cont-kind :unknown))
1133 (vop* return-multiple node block
1135 (reference-tn-list (ir2-continuation-locs 2cont) nil))
1142 ;;; This is used by the debugger to find the top function on the
1143 ;;; stack. It returns the OLD-FP and RETURN-PC for the current
1144 ;;; function as multiple values.
1145 (defoptimizer (sb!kernel:%caller-frame-and-pc ir2-convert) (() node block)
1146 (let ((ir2-physenv (physenv-info (node-physenv node))))
1147 (move-continuation-result node block
1148 (list (ir2-physenv-old-fp ir2-physenv)
1149 (ir2-physenv-return-pc ir2-physenv))
1152 ;;;; multiple values
1154 ;;; This is almost identical to IR2-Convert-Let. Since LTN annotates
1155 ;;; the continuation for the correct number of values (with the
1156 ;;; continuation user responsible for defaulting), we can just pick
1157 ;;; them up from the continuation.
1158 (defun ir2-convert-mv-bind (node block)
1159 (declare (type mv-combination node) (type ir2-block block))
1160 (let* ((cont (first (basic-combination-args node)))
1161 (fun (ref-leaf (continuation-use (basic-combination-fun node))))
1162 (vars (lambda-vars fun)))
1163 (aver (eq (functional-kind fun) :mv-let))
1164 (mapc #'(lambda (src var)
1165 (when (leaf-refs var)
1166 (let ((dest (leaf-info var)))
1167 (if (lambda-var-indirect var)
1168 (do-make-value-cell node block src dest)
1169 (emit-move node block src dest)))))
1170 (continuation-tns node block cont
1171 (mapcar #'(lambda (x)
1172 (primitive-type (leaf-type x)))
1177 ;;; Emit the appropriate fixed value, unknown value or tail variant of
1178 ;;; CALL-VARIABLE. Note that we only need to pass the values start for
1179 ;;; the first argument: all the other argument continuation TNs are
1180 ;;; ignored. This is because we require all of the values globs to be
1181 ;;; contiguous and on stack top.
1182 (defun ir2-convert-mv-call (node block)
1183 (declare (type mv-combination node) (type ir2-block block))
1184 (aver (basic-combination-args node))
1185 (let* ((start-cont (continuation-info (first (basic-combination-args node))))
1186 (start (first (ir2-continuation-locs start-cont)))
1187 (tails (and (node-tail-p node)
1188 (lambda-tail-set (node-home-lambda node))))
1189 (cont (node-cont node))
1190 (2cont (continuation-info cont)))
1191 (multiple-value-bind (fun named)
1192 (function-continuation-tn node block (basic-combination-fun node))
1193 (aver (and (not named)
1194 (eq (ir2-continuation-kind start-cont) :unknown)))
1197 (let ((env (physenv-info (node-physenv node))))
1198 (vop tail-call-variable node block start fun
1199 (ir2-physenv-old-fp env)
1200 (ir2-physenv-return-pc env))))
1202 (eq (ir2-continuation-kind 2cont) :unknown))
1203 (vop* multiple-call-variable node block (start fun nil)
1204 ((reference-tn-list (ir2-continuation-locs 2cont) t))))
1206 (let ((locs (standard-result-tns cont)))
1207 (vop* call-variable node block (start fun nil)
1208 ((reference-tn-list locs t)) (length locs))
1209 (move-continuation-result node block locs cont)))))))
1211 ;;; Reset the stack pointer to the start of the specified
1212 ;;; unknown-values continuation (discarding it and all values globs on
1214 (defoptimizer (%pop-values ir2-convert) ((continuation) node block)
1215 (let ((2cont (continuation-info (continuation-value continuation))))
1216 (aver (eq (ir2-continuation-kind 2cont) :unknown))
1217 (vop reset-stack-pointer node block
1218 (first (ir2-continuation-locs 2cont)))))
1220 ;;; Deliver the values TNs to CONT using MOVE-CONTINUATION-RESULT.
1221 (defoptimizer (values ir2-convert) ((&rest values) node block)
1222 (let ((tns (mapcar #'(lambda (x)
1223 (continuation-tn node block x))
1225 (move-continuation-result node block tns (node-cont node))))
1227 ;;; In the normal case where unknown values are desired, we use the
1228 ;;; VALUES-LIST VOP. In the relatively unimportant case of VALUES-LIST
1229 ;;; for a fixed number of values, we punt by doing a full call to the
1230 ;;; VALUES-LIST function. This gets the full call VOP to deal with
1231 ;;; defaulting any unsupplied values. It seems unworthwhile to
1232 ;;; optimize this case.
1233 (defoptimizer (values-list ir2-convert) ((list) node block)
1234 (let* ((cont (node-cont node))
1235 (2cont (continuation-info cont)))
1237 (ecase (ir2-continuation-kind 2cont)
1238 (:fixed (ir2-convert-full-call node block))
1240 (let ((locs (ir2-continuation-locs 2cont)))
1241 (vop* values-list node block
1242 ((continuation-tn node block list) nil)
1243 ((reference-tn-list locs t)))))))))
1245 (defoptimizer (%more-arg-values ir2-convert) ((context start count) node block)
1246 (let* ((cont (node-cont node))
1247 (2cont (continuation-info cont)))
1249 (ecase (ir2-continuation-kind 2cont)
1250 (:fixed (ir2-convert-full-call node block))
1252 (let ((locs (ir2-continuation-locs 2cont)))
1253 (vop* %more-arg-values node block
1254 ((continuation-tn node block context)
1255 (continuation-tn node block start)
1256 (continuation-tn node block count)
1258 ((reference-tn-list locs t)))))))))
1260 ;;;; special binding
1262 ;;; This is trivial, given our assumption of a shallow-binding
1264 (defoptimizer (%special-bind ir2-convert) ((var value) node block)
1265 (let ((name (leaf-source-name (continuation-value var))))
1266 (vop bind node block (continuation-tn node block value)
1267 (emit-constant name))))
1268 (defoptimizer (%special-unbind ir2-convert) ((var) node block)
1269 (vop unbind node block))
1271 ;;; ### It's not clear that this really belongs in this file, or
1272 ;;; should really be done this way, but this is the least violation of
1273 ;;; abstraction in the current setup. We don't want to wire
1274 ;;; shallow-binding assumptions into IR1tran.
1275 (def-ir1-translator progv ((vars vals &body body) start cont)
1278 (once-only ((n-save-bs '(%primitive current-binding-pointer)))
1281 (mapc #'(lambda (var val)
1282 (%primitive bind val var))
1286 (%primitive unbind-to-here ,n-save-bs)))))
1290 ;;; Convert a non-local lexical exit. First find the NLX-Info in our
1291 ;;; environment. Note that this is never called on the escape exits
1292 ;;; for CATCH and UNWIND-PROTECT, since the escape functions aren't
1294 (defun ir2-convert-exit (node block)
1295 (declare (type exit node) (type ir2-block block))
1296 (let ((loc (find-in-physenv (find-nlx-info (exit-entry node)
1298 (node-physenv node)))
1299 (temp (make-stack-pointer-tn))
1300 (value (exit-value node)))
1301 (vop value-cell-ref node block loc temp)
1303 (let ((locs (ir2-continuation-locs (continuation-info value))))
1304 (vop unwind node block temp (first locs) (second locs)))
1305 (let ((0-tn (emit-constant 0)))
1306 (vop unwind node block temp 0-tn 0-tn))))
1310 ;;; %CLEANUP-POINT doesn't do anything except prevent the body from
1311 ;;; being entirely deleted.
1312 (defoptimizer (%cleanup-point ir2-convert) (() node block) node block)
1314 ;;; This function invalidates a lexical exit on exiting from the
1315 ;;; dynamic extent. This is done by storing 0 into the indirect value
1316 ;;; cell that holds the closed unwind block.
1317 (defoptimizer (%lexical-exit-breakup ir2-convert) ((info) node block)
1318 (vop value-cell-set node block
1319 (find-in-physenv (continuation-value info) (node-physenv node))
1322 ;;; We have to do a spurious move of no values to the result
1323 ;;; continuation so that lifetime analysis won't get confused.
1324 (defun ir2-convert-throw (node block)
1325 (declare (type mv-combination node) (type ir2-block block))
1326 (let ((args (basic-combination-args node)))
1327 (vop* throw node block
1328 ((continuation-tn node block (first args))
1330 (ir2-continuation-locs (continuation-info (second args)))
1333 (move-continuation-result node block () (node-cont node))
1336 ;;; Emit code to set up a non-local exit. INFO is the NLX-Info for the
1337 ;;; exit, and TAG is the continuation for the catch tag (if any.) We
1338 ;;; get at the target PC by passing in the label to the vop. The vop
1339 ;;; is responsible for building a return-PC object.
1340 (defun emit-nlx-start (node block info tag)
1341 (declare (type node node) (type ir2-block block) (type nlx-info info)
1342 (type (or continuation null) tag))
1343 (let* ((2info (nlx-info-info info))
1344 (kind (cleanup-kind (nlx-info-cleanup info)))
1345 (block-tn (physenv-live-tn
1346 (make-normal-tn (primitive-type-or-lose 'catch-block))
1347 (node-physenv node)))
1348 (res (make-stack-pointer-tn))
1349 (target-label (ir2-nlx-info-target 2info)))
1351 (vop current-binding-pointer node block
1352 (car (ir2-nlx-info-dynamic-state 2info)))
1353 (vop* save-dynamic-state node block
1355 ((reference-tn-list (cdr (ir2-nlx-info-dynamic-state 2info)) t)))
1356 (vop current-stack-pointer node block (ir2-nlx-info-save-sp 2info))
1360 (vop make-catch-block node block block-tn
1361 (continuation-tn node block tag) target-label res))
1362 ((:unwind-protect :block :tagbody)
1363 (vop make-unwind-block node block block-tn target-label res)))
1367 (do-make-value-cell node block res (ir2-nlx-info-home 2info)))
1369 (vop set-unwind-protect node block block-tn))
1374 ;;; Scan each of ENTRY's exits, setting up the exit for each lexical exit.
1375 (defun ir2-convert-entry (node block)
1376 (declare (type entry node) (type ir2-block block))
1377 (dolist (exit (entry-exits node))
1378 (let ((info (find-nlx-info node (node-cont exit))))
1380 (member (cleanup-kind (nlx-info-cleanup info))
1381 '(:block :tagbody)))
1382 (emit-nlx-start node block info nil))))
1385 ;;; Set up the unwind block for these guys.
1386 (defoptimizer (%catch ir2-convert) ((info-cont tag) node block)
1387 (emit-nlx-start node block (continuation-value info-cont) tag))
1388 (defoptimizer (%unwind-protect ir2-convert) ((info-cont cleanup) node block)
1389 (emit-nlx-start node block (continuation-value info-cont) nil))
1391 ;;; Emit the entry code for a non-local exit. We receive values and
1392 ;;; restore dynamic state.
1394 ;;; In the case of a lexical exit or CATCH, we look at the exit
1395 ;;; continuation's kind to determine which flavor of entry VOP to
1396 ;;; emit. If unknown values, emit the xxx-MULTIPLE variant to the
1397 ;;; continuation locs. If fixed values, make the appropriate number of
1398 ;;; temps in the standard values locations and use the other variant,
1399 ;;; delivering the temps to the continuation using
1400 ;;; MOVE-CONTINUATION-RESULT.
1402 ;;; In the UNWIND-PROTECT case, we deliver the first register
1403 ;;; argument, the argument count and the argument pointer to our
1404 ;;; continuation as multiple values. These values are the block exited
1405 ;;; to and the values start and count.
1407 ;;; After receiving values, we restore dynamic state. Except in the
1408 ;;; UNWIND-PROTECT case, the values receiving restores the stack
1409 ;;; pointer. In an UNWIND-PROTECT cleanup, we want to leave the stack
1410 ;;; pointer alone, since the thrown values are still out there.
1411 (defoptimizer (%nlx-entry ir2-convert) ((info-cont) node block)
1412 (let* ((info (continuation-value info-cont))
1413 (cont (nlx-info-continuation info))
1414 (2cont (continuation-info cont))
1415 (2info (nlx-info-info info))
1416 (top-loc (ir2-nlx-info-save-sp 2info))
1417 (start-loc (make-nlx-entry-argument-start-location))
1418 (count-loc (make-argument-count-location))
1419 (target (ir2-nlx-info-target 2info)))
1421 (ecase (cleanup-kind (nlx-info-cleanup info))
1422 ((:catch :block :tagbody)
1423 (if (and 2cont (eq (ir2-continuation-kind 2cont) :unknown))
1424 (vop* nlx-entry-multiple node block
1425 (top-loc start-loc count-loc nil)
1426 ((reference-tn-list (ir2-continuation-locs 2cont) t))
1428 (let ((locs (standard-result-tns cont)))
1429 (vop* nlx-entry node block
1430 (top-loc start-loc count-loc nil)
1431 ((reference-tn-list locs t))
1434 (move-continuation-result node block locs cont))))
1436 (let ((block-loc (standard-argument-location 0)))
1437 (vop uwp-entry node block target block-loc start-loc count-loc)
1438 (move-continuation-result
1440 (list block-loc start-loc count-loc)
1444 (when *collect-dynamic-statistics*
1445 (vop count-me node block *dynamic-counts-tn*
1446 (block-number (ir2-block-block block))))
1448 (vop* restore-dynamic-state node block
1449 ((reference-tn-list (cdr (ir2-nlx-info-dynamic-state 2info)) nil))
1451 (vop unbind-to-here node block
1452 (car (ir2-nlx-info-dynamic-state 2info)))))
1454 ;;;; n-argument functions
1456 (macrolet ((def-frob (name)
1457 `(defoptimizer (,name ir2-convert) ((&rest args) node block)
1458 (let* ((refs (move-tail-full-call-args node block))
1459 (cont (node-cont node))
1460 (res (continuation-result-tns
1462 (list (primitive-type (specifier-type 'list))))))
1463 (vop* ,name node block (refs) ((first res) nil)
1465 (move-continuation-result node block res cont)))))
1469 ;;;; structure accessors
1471 ;;;; These guys have to bizarrely determine the slot offset by looking
1472 ;;;; at the called function.
1474 (defoptimizer (%slot-accessor ir2-convert) ((str) node block)
1475 (let* ((cont (node-cont node))
1476 (res (continuation-result-tns cont
1477 (list *backend-t-primitive-type*))))
1478 (vop instance-ref node block
1479 (continuation-tn node block str)
1484 (combination-fun node)))))
1486 (move-continuation-result node block res cont)))
1488 (defoptimizer (%slot-setter ir2-convert) ((value str) node block)
1489 (let ((val (continuation-tn node block value)))
1490 (vop instance-set node block
1491 (continuation-tn node block str)
1497 (combination-fun node))))))
1499 (move-continuation-result node block (list val) (node-cont node))))
1501 ;;; Convert the code in a component into VOPs.
1502 (defun ir2-convert (component)
1503 (declare (type component component))
1504 (let (#!+sb-dyncount
1505 (*dynamic-counts-tn*
1506 (when *collect-dynamic-statistics*
1508 (block-number (block-next (component-head component))))
1509 (counts (make-array blocks
1510 :element-type '(unsigned-byte 32)
1511 :initial-element 0))
1512 (info (make-dyncount-info
1513 :for (component-name component)
1514 :costs (make-array blocks
1515 :element-type '(unsigned-byte 32)
1518 (setf (ir2-component-dyncount-info (component-info component))
1520 (emit-constant info)
1521 (emit-constant counts)))))
1523 (declare (type index num))
1524 (do-ir2-blocks (2block component)
1525 (let ((block (ir2-block-block 2block)))
1526 (when (block-start block)
1527 (setf (block-number block) num)
1529 (when *collect-dynamic-statistics*
1530 (let ((first-node (continuation-next (block-start block))))
1531 (unless (or (and (bind-p first-node)
1532 (external-entry-point-p
1533 (bind-lambda first-node)))
1534 (eq (continuation-fun-name
1535 (node-cont first-node))
1540 #!+sb-dyncount *dynamic-counts-tn* #!-sb-dyncount nil
1542 (ir2-convert-block block)
1546 ;;; If necessary, emit a terminal unconditional branch to go to the
1547 ;;; successor block. If the successor is the component tail, then
1548 ;;; there isn't really any successor, but if the end is an unknown,
1549 ;;; non-tail call, then we emit an error trap just in case the
1550 ;;; function really does return.
1551 (defun finish-ir2-block (block)
1552 (declare (type cblock block))
1553 (let* ((2block (block-info block))
1554 (last (block-last block))
1555 (succ (block-succ block)))
1557 (aver (and succ (null (rest succ))))
1558 (let ((target (first succ)))
1559 (cond ((eq target (component-tail (block-component block)))
1560 (when (and (basic-combination-p last)
1561 (eq (basic-combination-kind last) :full))
1562 (let* ((fun (basic-combination-fun last))
1563 (use (continuation-use fun))
1564 (name (and (ref-p use)
1565 (leaf-has-source-name-p (ref-leaf use))
1566 (leaf-source-name (ref-leaf use)))))
1567 (unless (or (node-tail-p last)
1568 (info :function :info name)
1569 (policy last (zerop safety)))
1570 (vop nil-function-returned-error last 2block
1572 (emit-constant name)
1573 (multiple-value-bind (tn named)
1574 (function-continuation-tn last 2block fun)
1577 ((not (eq (ir2-block-next 2block) (block-info target)))
1578 (vop branch last 2block (block-label target)))))))
1582 ;;; Convert the code in a block into VOPs.
1583 (defun ir2-convert-block (block)
1584 (declare (type cblock block))
1585 (let ((2block (block-info block)))
1586 (do-nodes (node cont block)
1589 (let ((2cont (continuation-info cont)))
1591 (not (eq (ir2-continuation-kind 2cont) :delayed)))
1592 (ir2-convert-ref node 2block))))
1594 (let ((kind (basic-combination-kind node)))
1597 (ir2-convert-local-call node 2block))
1599 (ir2-convert-full-call node 2block))
1601 (let ((fun (function-info-ir2-convert kind)))
1603 (funcall fun node 2block))
1604 ((eq (basic-combination-info node) :full)
1605 (ir2-convert-full-call node 2block))
1607 (ir2-convert-template node 2block))))))))
1609 (when (continuation-info (if-test node))
1610 (ir2-convert-if node 2block)))
1612 (let ((fun (bind-lambda node)))
1613 (when (eq (lambda-home fun) fun)
1614 (ir2-convert-bind node 2block))))
1616 (ir2-convert-return node 2block))
1618 (ir2-convert-set node 2block))
1621 ((eq (basic-combination-kind node) :local)
1622 (ir2-convert-mv-bind node 2block))
1623 ((eq (continuation-fun-name (basic-combination-fun node))
1625 (ir2-convert-throw node 2block))
1627 (ir2-convert-mv-call node 2block))))
1629 (when (exit-entry node)
1630 (ir2-convert-exit node 2block)))
1632 (ir2-convert-entry node 2block)))))
1634 (finish-ir2-block block)