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 (defun find-in-environment (thing env)
58 (declare (type (or nlx-info lambda-var) thing) (type environment env)
60 (or (cdr (assoc thing (ir2-environment-environment (environment-info env))))
63 (aver (eq env (lambda-environment (lambda-var-home thing))))
66 (aver (eq env (block-environment (nlx-info-target thing))))
67 (ir2-nlx-info-home (nlx-info-info thing))))))
69 ;;; If LEAF already has a constant TN, return that, otherwise make a
71 (defun constant-tn (leaf)
72 (declare (type constant leaf))
74 (setf (leaf-info leaf)
75 (make-constant-tn leaf))))
77 ;;; Return a TN that represents the value of LEAF, or NIL if LEAF
78 ;;; isn't directly represented by a TN. ENV is the environment that
79 ;;; the reference is done in.
80 (defun leaf-tn (leaf env)
81 (declare (type leaf leaf) (type environment env))
84 (unless (lambda-var-indirect leaf)
85 (find-in-environment leaf env)))
86 (constant (constant-tn leaf))
89 ;;; This is used to conveniently get a handle on a constant TN during
90 ;;; IR2 conversion. It returns a constant TN representing the Lisp
92 (defun emit-constant (value)
93 (constant-tn (find-constant value)))
95 ;;; Convert a REF node. The reference must not be delayed.
96 (defun ir2-convert-ref (node block)
97 (declare (type ref node) (type ir2-block block))
98 (let* ((cont (node-cont node))
99 (leaf (ref-leaf node))
100 (name (leaf-name leaf))
101 (locs (continuation-result-tns
102 cont (list (primitive-type (leaf-type leaf)))))
106 (let ((tn (find-in-environment leaf (node-environment node))))
107 (if (lambda-var-indirect leaf)
108 (vop value-cell-ref node block tn res)
109 (emit-move node block tn res))))
111 (if (legal-immediate-constant-p leaf)
112 (emit-move node block (constant-tn leaf) res)
113 (let ((name-tn (emit-constant name)))
114 (if (policy node (zerop safety))
115 (vop fast-symbol-value node block name-tn res)
116 (vop symbol-value node block name-tn res)))))
118 (ir2-convert-closure node block leaf res))
120 (let ((unsafe (policy node (zerop safety))))
121 (ecase (global-var-kind leaf)
122 ((:special :global :constant)
123 (aver (symbolp name))
124 (let ((name-tn (emit-constant name)))
126 (vop fast-symbol-value node block name-tn res)
127 (vop symbol-value node block name-tn res))))
129 (let ((fdefn-tn (make-load-time-constant-tn :fdefinition name)))
131 (vop fdefn-function node block fdefn-tn res)
132 (vop safe-fdefn-function node block fdefn-tn res))))))))
133 (move-continuation-result node block locs cont))
136 ;;; Emit code to load a function object representing LEAF into RES.
137 ;;; This gets interesting when the referenced function is a closure:
138 ;;; we must make the closure and move the closed over values into it.
140 ;;; LEAF is either a :TOP-LEVEL-XEP functional or the XEP lambda for
141 ;;; the called function, since local call analysis converts all
142 ;;; closure references. If a TL-XEP, we know it is not a closure.
144 ;;; If a closed-over lambda-var has no refs (is deleted), then we
145 ;;; don't initialize that slot. This can happen with closures over
146 ;;; top-level variables, where optimization of the closure deleted the
147 ;;; variable. Since we committed to the closure format when we
148 ;;; pre-analyzed the top-level code, we just leave an empty slot.
149 (defun ir2-convert-closure (node block leaf res)
150 (declare (type ref node) (type ir2-block block)
151 (type functional leaf) (type tn res))
152 (unless (leaf-info leaf)
153 (setf (leaf-info leaf) (make-entry-info)))
154 (let ((entry (make-load-time-constant-tn :entry leaf))
155 (closure (etypecase leaf
157 (environment-closure (get-lambda-environment leaf)))
159 (aver (eq (functional-kind leaf) :top-level-xep))
162 (let ((this-env (node-environment node)))
163 (vop make-closure node block entry (length closure) res)
164 (loop for what in closure and n from 0 do
165 (unless (and (lambda-var-p what)
166 (null (leaf-refs what)))
167 (vop closure-init node block
169 (find-in-environment what this-env)
172 (emit-move node block entry res))))
175 ;;; Convert a SET node. If the node's CONT is annotated, then we also
176 ;;; deliver the value to that continuation. If the var is a lexical
177 ;;; variable with no refs, then we don't actually set anything, since
178 ;;; the variable has been deleted.
179 (defun ir2-convert-set (node block)
180 (declare (type cset node) (type ir2-block block))
181 (let* ((cont (node-cont node))
182 (leaf (set-var node))
183 (val (continuation-tn node block (set-value node)))
184 (locs (if (continuation-info cont)
185 (continuation-result-tns
186 cont (list (primitive-type (leaf-type leaf))))
190 (when (leaf-refs leaf)
191 (let ((tn (find-in-environment leaf (node-environment node))))
192 (if (lambda-var-indirect leaf)
193 (vop value-cell-set node block tn val)
194 (emit-move node block val tn)))))
196 (ecase (global-var-kind leaf)
198 (aver (symbolp (leaf-name leaf)))
199 (vop set node block (emit-constant (leaf-name leaf)) val)))))
201 (emit-move node block val (first locs))
202 (move-continuation-result node block locs cont)))
205 ;;;; utilities for receiving fixed values
207 ;;; Return a TN that can be referenced to get the value of CONT. CONT
208 ;;; must be LTN-Annotated either as a delayed leaf ref or as a fixed,
209 ;;; single-value continuation. If a type check is called for, do it.
211 ;;; The primitive-type of the result will always be the same as the
212 ;;; IR2-CONTINUATION-PRIMITIVE-TYPE, ensuring that VOPs are always
213 ;;; called with TNs that satisfy the operand primitive-type
214 ;;; restriction. We may have to make a temporary of the desired type
215 ;;; and move the actual continuation TN into it. This happens when we
216 ;;; delete a type check in unsafe code or when we locally know
217 ;;; something about the type of an argument variable.
218 (defun continuation-tn (node block cont)
219 (declare (type node node) (type ir2-block block) (type continuation cont))
220 (let* ((2cont (continuation-info cont))
222 (ecase (ir2-continuation-kind 2cont)
224 (let ((ref (continuation-use cont)))
225 (leaf-tn (ref-leaf ref) (node-environment ref))))
227 (aver (= (length (ir2-continuation-locs 2cont)) 1))
228 (first (ir2-continuation-locs 2cont)))))
229 (ptype (ir2-continuation-primitive-type 2cont)))
231 (cond ((and (eq (continuation-type-check cont) t)
232 (multiple-value-bind (check types)
233 (continuation-check-types cont)
234 (aver (eq check :simple))
235 ;; If the proven type is a subtype of the possibly
236 ;; weakened type check then it's always true and is
238 (unless (values-subtypep (continuation-proven-type cont)
240 (let ((temp (make-normal-tn ptype)))
241 (emit-type-check node block cont-tn temp
244 ((eq (tn-primitive-type cont-tn) ptype) cont-tn)
246 (let ((temp (make-normal-tn ptype)))
247 (emit-move node block cont-tn temp)
250 ;;; This is similar to CONTINUATION-TN, but hacks multiple values. We
251 ;;; return continuations holding the values of CONT with PTYPES as
252 ;;; their primitive types. CONT must be annotated for the same number
253 ;;; of fixed values are there are PTYPES.
255 ;;; If the continuation has a type check, check the values into temps
256 ;;; and return the temps. When we have more values than assertions, we
257 ;;; move the extra values with no check.
258 (defun continuation-tns (node block cont ptypes)
259 (declare (type node node) (type ir2-block block)
260 (type continuation cont) (list ptypes))
261 (let* ((locs (ir2-continuation-locs (continuation-info cont)))
262 (nlocs (length locs)))
263 (aver (= nlocs (length ptypes)))
264 (if (eq (continuation-type-check cont) t)
265 (multiple-value-bind (check types) (continuation-check-types cont)
266 (aver (eq check :simple))
267 (let ((ntypes (length types)))
268 (mapcar #'(lambda (from to-type assertion)
269 (let ((temp (make-normal-tn to-type)))
271 (emit-type-check node block from temp assertion)
272 (emit-move node block from temp))
276 (append types (make-list (- nlocs ntypes)
277 :initial-element nil))
279 (mapcar #'(lambda (from to-type)
280 (if (eq (tn-primitive-type from) to-type)
282 (let ((temp (make-normal-tn to-type)))
283 (emit-move node block from temp)
288 ;;;; utilities for delivering values to continuations
290 ;;; Return a list of TNs with the specifier TYPES that can be used as
291 ;;; result TNs to evaluate an expression into the continuation CONT.
292 ;;; This is used together with MOVE-CONTINUATION-RESULT to deliver
293 ;;; fixed values to a continuation.
295 ;;; If the continuation isn't annotated (meaning the values are
296 ;;; discarded) or is unknown-values, the then we make temporaries for
297 ;;; each supplied value, providing a place to compute the result in
298 ;;; until we decide what to do with it (if anything.)
300 ;;; If the continuation is fixed-values, and wants the same number of
301 ;;; values as the user wants to deliver, then we just return the
302 ;;; IR2-CONTINUATION-LOCS. Otherwise we make a new list padded as
303 ;;; necessary by discarded TNs. We always return a TN of the specified
304 ;;; type, using the continuation locs only when they are of the
306 (defun continuation-result-tns (cont types)
307 (declare (type continuation cont) (type list types))
308 (let ((2cont (continuation-info cont)))
310 (mapcar #'make-normal-tn types)
311 (ecase (ir2-continuation-kind 2cont)
313 (let* ((locs (ir2-continuation-locs 2cont))
314 (nlocs (length locs))
315 (ntypes (length types)))
316 (if (and (= nlocs ntypes)
317 (do ((loc locs (cdr loc))
318 (type types (cdr type)))
320 (unless (eq (tn-primitive-type (car loc)) (car type))
323 (mapcar #'(lambda (loc type)
324 (if (eq (tn-primitive-type loc) type)
326 (make-normal-tn type)))
329 (mapcar #'make-normal-tn
330 (subseq types nlocs)))
334 (mapcar #'make-normal-tn types))))))
336 ;;; Make the first N standard value TNs, returning them in a list.
337 (defun make-standard-value-tns (n)
338 (declare (type unsigned-byte n))
341 (res (standard-argument-location i)))
344 ;;; Return a list of TNs wired to the standard value passing
345 ;;; conventions that can be used to receive values according to the
346 ;;; unknown-values convention. This is used with together
347 ;;; MOVE-CONTINUATION-RESULT for delivering unknown values to a fixed
348 ;;; values continuation.
350 ;;; If the continuation isn't annotated, then we treat as 0-values,
351 ;;; returning an empty list of temporaries.
353 ;;; If the continuation is annotated, then it must be :FIXED.
354 (defun standard-result-tns (cont)
355 (declare (type continuation cont))
356 (let ((2cont (continuation-info cont)))
358 (ecase (ir2-continuation-kind 2cont)
360 (make-standard-value-tns (length (ir2-continuation-locs 2cont)))))
363 ;;; Just move each SRC TN into the corresponding DEST TN, defaulting
364 ;;; any unsupplied source values to NIL. We let EMIT-MOVE worry about
365 ;;; doing the appropriate coercions.
366 (defun move-results-coerced (node block src dest)
367 (declare (type node node) (type ir2-block block) (list src dest))
368 (let ((nsrc (length src))
369 (ndest (length dest)))
370 (mapc #'(lambda (from to)
372 (emit-move node block from to)))
374 (append src (make-list (- ndest nsrc)
375 :initial-element (emit-constant nil)))
380 ;;; If necessary, emit coercion code needed to deliver the Results to
381 ;;; the specified continuation. NODE and BLOCK provide context for
382 ;;; emitting code. Although usually obtained from STANDARD-RESULT-TNs
383 ;;; or CONTINUATION-RESULT-TNs, RESULTS my be a list of any type or
386 ;;; If the continuation is fixed values, then move the results into
387 ;;; the continuation locations. If the continuation is unknown values,
388 ;;; then do the moves into the standard value locations, and use
389 ;;; PUSH-VALUES to put the values on the stack.
390 (defun move-continuation-result (node block results cont)
391 (declare (type node node) (type ir2-block block)
392 (list results) (type continuation cont))
393 (let* ((2cont (continuation-info cont)))
395 (ecase (ir2-continuation-kind 2cont)
397 (let ((locs (ir2-continuation-locs 2cont)))
398 (unless (eq locs results)
399 (move-results-coerced node block results locs))))
401 (let* ((nvals (length results))
402 (locs (make-standard-value-tns nvals)))
403 (move-results-coerced node block results locs)
404 (vop* push-values node block
405 ((reference-tn-list locs nil))
406 ((reference-tn-list (ir2-continuation-locs 2cont) t))
410 ;;;; template conversion
412 ;;; Build a TN-Refs list that represents access to the values of the
413 ;;; specified list of continuations ARGS for TEMPLATE. Any :CONSTANT
414 ;;; arguments are returned in the second value as a list rather than
415 ;;; being accessed as a normal argument. NODE and BLOCK provide the
416 ;;; context for emitting any necessary type-checking code.
417 (defun reference-arguments (node block args template)
418 (declare (type node node) (type ir2-block block) (list args)
419 (type template template))
420 (collect ((info-args))
423 (do ((args args (cdr args))
424 (types (template-arg-types template) (cdr types)))
426 (let ((type (first types))
428 (if (and (consp type) (eq (car type) ':constant))
429 (info-args (continuation-value arg))
430 (let ((ref (reference-tn (continuation-tn node block arg) nil)))
432 (setf (tn-ref-across last) ref)
436 (values (the (or tn-ref null) first) (info-args)))))
438 ;;; Convert a conditional template. We try to exploit any
439 ;;; drop-through, but emit an unconditional branch afterward if we
440 ;;; fail. NOT-P is true if the sense of the TEMPLATE's test should be
442 (defun ir2-convert-conditional (node block template args info-args if not-p)
443 (declare (type node node) (type ir2-block block)
444 (type template template) (type (or tn-ref null) args)
445 (list info-args) (type cif if) (type boolean not-p))
446 (aver (= (template-info-arg-count template) (+ (length info-args) 2)))
447 (let ((consequent (if-consequent if))
448 (alternative (if-alternative if)))
449 (cond ((drop-thru-p if consequent)
450 (emit-template node block template args nil
451 (list* (block-label alternative) (not not-p)
454 (emit-template node block template args nil
455 (list* (block-label consequent) not-p info-args))
456 (unless (drop-thru-p if alternative)
457 (vop branch node block (block-label alternative)))))))
459 ;;; Convert an IF that isn't the DEST of a conditional template.
460 (defun ir2-convert-if (node block)
461 (declare (type ir2-block block) (type cif node))
462 (let* ((test (if-test node))
463 (test-ref (reference-tn (continuation-tn node block test) nil))
464 (nil-ref (reference-tn (emit-constant nil) nil)))
465 (setf (tn-ref-across test-ref) nil-ref)
466 (ir2-convert-conditional node block (template-or-lose 'if-eq)
467 test-ref () node t)))
469 ;;; Return a list of primitive-types that we can pass to
470 ;;; CONTINUATION-RESULT-TNS describing the result types we want for a
471 ;;; template call. We duplicate here the determination of output type
472 ;;; that was done in initially selecting the template, so we know that
473 ;;; the types we find are allowed by the template output type
475 (defun find-template-result-types (call cont template rtypes)
476 (declare (type combination call) (type continuation cont)
477 (type template template) (list rtypes))
478 (let* ((dtype (node-derived-type call))
479 (type (if (and (or (eq (template-ltn-policy template) :safe)
480 (policy call (= safety 0)))
481 (continuation-type-check cont))
482 (values-type-intersection
484 (continuation-asserted-type cont))
486 (types (mapcar #'primitive-type
487 (if (values-type-p type)
488 (append (values-type-required type)
489 (values-type-optional type))
491 (let ((nvals (length rtypes))
492 (ntypes (length types)))
493 (cond ((< ntypes nvals)
495 (make-list (- nvals ntypes)
496 :initial-element *backend-t-primitive-type*)))
498 (subseq types 0 nvals))
502 ;;; Return a list of TNs usable in a CALL to TEMPLATE delivering
503 ;;; values to CONT. As an efficiency hack, we pick off the common case
504 ;;; where the continuation is fixed values and has locations that
505 ;;; satisfy the result restrictions. This can fail when there is a
506 ;;; type check or a values count mismatch.
507 (defun make-template-result-tns (call cont template rtypes)
508 (declare (type combination call) (type continuation cont)
509 (type template template) (list rtypes))
510 (let ((2cont (continuation-info cont)))
511 (if (and 2cont (eq (ir2-continuation-kind 2cont) :fixed))
512 (let ((locs (ir2-continuation-locs 2cont)))
513 (if (and (= (length rtypes) (length locs))
514 (do ((loc locs (cdr loc))
515 (rtype rtypes (cdr rtype)))
517 (unless (operand-restriction-ok
519 (tn-primitive-type (car loc))
523 (continuation-result-tns
525 (find-template-result-types call cont template rtypes))))
526 (continuation-result-tns
528 (find-template-result-types call cont template rtypes)))))
530 ;;; Get the operands into TNs, make TN-Refs for them, and then call
531 ;;; the template emit function.
532 (defun ir2-convert-template (call block)
533 (declare (type combination call) (type ir2-block block))
534 (let* ((template (combination-info call))
535 (cont (node-cont call))
536 (rtypes (template-result-types template)))
537 (multiple-value-bind (args info-args)
538 (reference-arguments call block (combination-args call) template)
539 (aver (not (template-more-results-type template)))
540 (if (eq rtypes :conditional)
541 (ir2-convert-conditional call block template args info-args
542 (continuation-dest cont) nil)
543 (let* ((results (make-template-result-tns call cont template rtypes))
544 (r-refs (reference-tn-list results t)))
545 (aver (= (length info-args)
546 (template-info-arg-count template)))
548 (emit-template call block template args r-refs info-args)
549 (emit-template call block template args r-refs))
550 (move-continuation-result call block results cont)))))
553 ;;; We don't have to do much because operand count checking is done by
554 ;;; IR1 conversion. The only difference between this and the function
555 ;;; case of IR2-CONVERT-TEMPLATE is that there can be codegen-info
557 (defoptimizer (%%primitive ir2-convert) ((template info &rest args) call block)
558 (let* ((template (continuation-value template))
559 (info (continuation-value info))
560 (cont (node-cont call))
561 (rtypes (template-result-types template))
562 (results (make-template-result-tns call cont template rtypes))
563 (r-refs (reference-tn-list results t)))
564 (multiple-value-bind (args info-args)
565 (reference-arguments call block (cddr (combination-args call))
567 (aver (not (template-more-results-type template)))
568 (aver (not (eq rtypes :conditional)))
569 (aver (null info-args))
572 (emit-template call block template args r-refs info)
573 (emit-template call block template args r-refs))
575 (move-continuation-result call block results cont)))
580 ;;; Convert a LET by moving the argument values into the variables.
581 ;;; Since a LET doesn't have any passing locations, we move the
582 ;;; arguments directly into the variables. We must also allocate any
583 ;;; indirect value cells, since there is no function prologue to do
585 (defun ir2-convert-let (node block fun)
586 (declare (type combination node) (type ir2-block block) (type clambda fun))
587 (mapc #'(lambda (var arg)
589 (let ((src (continuation-tn node block arg))
590 (dest (leaf-info var)))
591 (if (lambda-var-indirect var)
592 (do-make-value-cell node block src dest)
593 (emit-move node block src dest)))))
594 (lambda-vars fun) (basic-combination-args node))
597 ;;; Emit any necessary moves into assignment temps for a local call to
598 ;;; FUN. We return two lists of TNs: TNs holding the actual argument
599 ;;; values, and (possibly EQ) TNs that are the actual destination of
600 ;;; the arguments. When necessary, we allocate temporaries for
601 ;;; arguments to preserve parallel assignment semantics. These lists
602 ;;; exclude unused arguments and include implicit environment
603 ;;; arguments, i.e. they exactly correspond to the arguments passed.
605 ;;; OLD-FP is the TN currently holding the value we want to pass as
606 ;;; OLD-FP. If null, then the call is to the same environment (an
607 ;;; :ASSIGNMENT), so we only move the arguments, and leave the
608 ;;; environment alone.
609 (defun emit-psetq-moves (node block fun old-fp)
610 (declare (type combination node) (type ir2-block block) (type clambda fun)
611 (type (or tn null) old-fp))
612 (let* ((called-env (environment-info (lambda-environment fun)))
613 (this-1env (node-environment node))
614 (actuals (mapcar #'(lambda (x)
616 (continuation-tn node block x)))
617 (combination-args node))))
620 (dolist (var (lambda-vars fun))
621 (let ((actual (pop actuals))
622 (loc (leaf-info var)))
625 ((lambda-var-indirect var)
627 (make-normal-tn *backend-t-primitive-type*)))
628 (do-make-value-cell node block actual temp)
630 ((member actual (locs))
631 (let ((temp (make-normal-tn (tn-primitive-type loc))))
632 (emit-move node block actual temp)
639 (dolist (thing (ir2-environment-environment called-env))
640 (temps (find-in-environment (car thing) this-1env))
644 (locs (ir2-environment-old-fp called-env)))
646 (values (temps) (locs)))))
648 ;;; A tail-recursive local call is done by emitting moves of stuff
649 ;;; into the appropriate passing locations. After setting up the args
650 ;;; and environment, we just move our return-pc into the called
651 ;;; function's passing location.
652 (defun ir2-convert-tail-local-call (node block fun)
653 (declare (type combination node) (type ir2-block block) (type clambda fun))
654 (let ((this-env (environment-info (node-environment node))))
655 (multiple-value-bind (temps locs)
656 (emit-psetq-moves node block fun (ir2-environment-old-fp this-env))
658 (mapc #'(lambda (temp loc)
659 (emit-move node block temp loc))
662 (emit-move node block
663 (ir2-environment-return-pc this-env)
664 (ir2-environment-return-pc-pass
666 (lambda-environment fun)))))
670 ;;; Convert an :ASSIGNMENT call. This is just like a tail local call,
671 ;;; except that the caller and callee environment are the same, so we
672 ;;; don't need to mess with the environment locations, return PC, etc.
673 (defun ir2-convert-assignment (node block fun)
674 (declare (type combination node) (type ir2-block block) (type clambda fun))
675 (multiple-value-bind (temps locs) (emit-psetq-moves node block fun nil)
677 (mapc #'(lambda (temp loc)
678 (emit-move node block temp loc))
682 ;;; Do stuff to set up the arguments to a non-tail local call
683 ;;; (including implicit environment args.) We allocate a frame
684 ;;; (returning the FP and NFP), and also compute the TN-REFS list for
685 ;;; the values to pass and the list of passing location TNs.
686 (defun ir2-convert-local-call-args (node block fun)
687 (declare (type combination node) (type ir2-block block) (type clambda fun))
688 (let ((fp (make-stack-pointer-tn))
689 (nfp (make-number-stack-pointer-tn))
690 (old-fp (make-stack-pointer-tn)))
691 (multiple-value-bind (temps locs)
692 (emit-psetq-moves node block fun old-fp)
693 (vop current-fp node block old-fp)
694 (vop allocate-frame node block
695 (environment-info (lambda-environment fun))
697 (values fp nfp temps (mapcar #'make-alias-tn locs)))))
699 ;;; Handle a non-TR known-values local call. We emit the call, then
700 ;;; move the results to the continuation's destination.
701 (defun ir2-convert-local-known-call (node block fun returns cont start)
702 (declare (type node node) (type ir2-block block) (type clambda fun)
703 (type return-info returns) (type continuation cont)
705 (multiple-value-bind (fp nfp temps arg-locs)
706 (ir2-convert-local-call-args node block fun)
707 (let ((locs (return-info-locations returns)))
708 (vop* known-call-local node block
709 (fp nfp (reference-tn-list temps nil))
710 ((reference-tn-list locs t))
711 arg-locs (environment-info (lambda-environment fun)) start)
712 (move-continuation-result node block locs cont)))
715 ;;; Handle a non-TR unknown-values local call. We do different things
716 ;;; depending on what kind of values the continuation wants.
718 ;;; If CONT is :UNKNOWN, then we use the "multiple-" variant, directly
719 ;;; specifying the continuation's LOCS as the VOP results so that we
720 ;;; don't have to do anything after the call.
722 ;;; Otherwise, we use STANDARD-RESULT-TNS to get wired result TNs, and
723 ;;; then call MOVE-CONTINUATION-RESULT to do any necessary type checks
725 (defun ir2-convert-local-unknown-call (node block fun cont start)
726 (declare (type node node) (type ir2-block block) (type clambda fun)
727 (type continuation cont) (type label start))
728 (multiple-value-bind (fp nfp temps arg-locs)
729 (ir2-convert-local-call-args node block fun)
730 (let ((2cont (continuation-info cont))
731 (env (environment-info (lambda-environment fun)))
732 (temp-refs (reference-tn-list temps nil)))
733 (if (and 2cont (eq (ir2-continuation-kind 2cont) :unknown))
734 (vop* multiple-call-local node block (fp nfp temp-refs)
735 ((reference-tn-list (ir2-continuation-locs 2cont) t))
737 (let ((locs (standard-result-tns cont)))
738 (vop* call-local node block
740 ((reference-tn-list locs t))
741 arg-locs env start (length locs))
742 (move-continuation-result node block locs cont)))))
745 ;;; Dispatch to the appropriate function, depending on whether we have
746 ;;; a let, tail or normal call. If the function doesn't return, call
747 ;;; it using the unknown-value convention. We could compile it as a
748 ;;; tail call, but that might seem confusing in the debugger.
749 (defun ir2-convert-local-call (node block)
750 (declare (type combination node) (type ir2-block block))
751 (let* ((fun (ref-leaf (continuation-use (basic-combination-fun node))))
752 (kind (functional-kind fun)))
753 (cond ((eq kind :let)
754 (ir2-convert-let node block fun))
755 ((eq kind :assignment)
756 (ir2-convert-assignment node block fun))
758 (ir2-convert-tail-local-call node block fun))
760 (let ((start (block-label (node-block (lambda-bind fun))))
761 (returns (tail-set-info (lambda-tail-set fun)))
762 (cont (node-cont node)))
764 (return-info-kind returns)
767 (ir2-convert-local-unknown-call node block fun cont start))
769 (ir2-convert-local-known-call node block fun returns
775 ;;; Given a function continuation Fun, return as values a TN holding
776 ;;; the thing that we call and true if the thing is named (false if it
777 ;;; is a function). There are two interesting non-named cases:
778 ;;; -- Known to be a function, no check needed: return the continuation loc.
779 ;;; -- Not known what it is.
780 (defun function-continuation-tn (node block cont)
781 (declare (type continuation cont))
782 (let ((2cont (continuation-info cont)))
783 (if (eq (ir2-continuation-kind 2cont) :delayed)
784 (let ((name (continuation-function-name cont t)))
786 (values (make-load-time-constant-tn :fdefinition name) t))
787 (let* ((locs (ir2-continuation-locs 2cont))
789 (check (continuation-type-check cont))
790 (function-ptype (primitive-type-or-lose 'function)))
791 (aver (and (eq (ir2-continuation-kind 2cont) :fixed)
792 (= (length locs) 1)))
793 (cond ((eq (tn-primitive-type loc) function-ptype)
794 (aver (not (eq check t)))
797 (let ((temp (make-normal-tn function-ptype)))
798 (aver (and (eq (ir2-continuation-primitive-type 2cont)
801 (emit-type-check node block loc temp
802 (specifier-type 'function))
803 (values temp nil))))))))
805 ;;; Set up the args to Node in the current frame, and return a tn-ref
806 ;;; list for the passing locations.
807 (defun move-tail-full-call-args (node block)
808 (declare (type combination node) (type ir2-block block))
809 (let ((args (basic-combination-args node))
812 (dotimes (num (length args))
813 (let ((loc (standard-argument-location num)))
814 (emit-move node block (continuation-tn node block (elt args num)) loc)
815 (let ((ref (reference-tn loc nil)))
817 (setf (tn-ref-across last) ref)
822 ;;; Move the arguments into the passing locations and do a (possibly
823 ;;; named) tail call.
824 (defun ir2-convert-tail-full-call (node block)
825 (declare (type combination node) (type ir2-block block))
826 (let* ((env (environment-info (node-environment node)))
827 (args (basic-combination-args node))
828 (nargs (length args))
829 (pass-refs (move-tail-full-call-args node block))
830 (old-fp (ir2-environment-old-fp env))
831 (return-pc (ir2-environment-return-pc env)))
833 (multiple-value-bind (fun-tn named)
834 (function-continuation-tn node block (basic-combination-fun node))
836 (vop* tail-call-named node block
837 (fun-tn old-fp return-pc pass-refs)
840 (vop* tail-call node block
841 (fun-tn old-fp return-pc pass-refs)
847 ;;; like IR2-CONVERT-LOCAL-CALL-ARGS, only different
848 (defun ir2-convert-full-call-args (node block)
849 (declare (type combination node) (type ir2-block block))
850 (let* ((args (basic-combination-args node))
851 (fp (make-stack-pointer-tn))
852 (nargs (length args)))
853 (vop allocate-full-call-frame node block nargs fp)
858 (locs (standard-argument-location num))
859 (let ((ref (reference-tn (continuation-tn node block (elt args num))
862 (setf (tn-ref-across last) ref)
866 (values fp first (locs) nargs)))))
868 ;;; Do full call when a fixed number of values are desired. We make
869 ;;; STANDARD-RESULT-TNS for our continuation, then deliver the result
870 ;;; using MOVE-CONTINUATION-RESULT. We do named or normal call, as
872 (defun ir2-convert-fixed-full-call (node block)
873 (declare (type combination node) (type ir2-block block))
874 (multiple-value-bind (fp args arg-locs nargs)
875 (ir2-convert-full-call-args node block)
876 (let* ((cont (node-cont node))
877 (locs (standard-result-tns cont))
878 (loc-refs (reference-tn-list locs t))
879 (nvals (length locs)))
880 (multiple-value-bind (fun-tn named)
881 (function-continuation-tn node block (basic-combination-fun node))
883 (vop* call-named node block (fp fun-tn args) (loc-refs)
884 arg-locs nargs nvals)
885 (vop* call node block (fp fun-tn args) (loc-refs)
886 arg-locs nargs nvals))
887 (move-continuation-result node block locs cont))))
890 ;;; Do full call when unknown values are desired.
891 (defun ir2-convert-multiple-full-call (node block)
892 (declare (type combination node) (type ir2-block block))
893 (multiple-value-bind (fp args arg-locs nargs)
894 (ir2-convert-full-call-args node block)
895 (let* ((cont (node-cont node))
896 (locs (ir2-continuation-locs (continuation-info cont)))
897 (loc-refs (reference-tn-list locs t)))
898 (multiple-value-bind (fun-tn named)
899 (function-continuation-tn node block (basic-combination-fun node))
901 (vop* multiple-call-named node block (fp fun-tn args) (loc-refs)
903 (vop* multiple-call node block (fp fun-tn args) (loc-refs)
907 ;;; stuff to check in CHECK-FULL-CALL
909 ;;; There are some things which are intended always to be optimized
910 ;;; away by DEFTRANSFORMs and such, and so never compiled into full
911 ;;; calls. This has been a source of bugs so many times that it seems
912 ;;; worth listing some of them here so that we can check the list
913 ;;; whenever we compile a full call.
915 ;;; FIXME: It might be better to represent this property by setting a
916 ;;; flag in DEFKNOWN, instead of representing it by membership in this
918 (defvar *always-optimized-away*
919 '(;; This should always be DEFTRANSFORMed away, but wasn't in a bug
920 ;; reported to cmucl-imp@cons.org 2000-06-20.
922 ;; These should always turn into VOPs, but wasn't in a bug which
923 ;; appeared when LTN-POLICY stuff was being tweaked in
924 ;; sbcl-0.6.9.16. in sbcl-0.6.0
928 ;;; more stuff to check in CHECK-FULL-CALL
930 ;;; These came in handy when troubleshooting cold boot after making
931 ;;; major changes in the package structure: various transforms and
932 ;;; VOPs and stuff got attached to the wrong symbol, so that
933 ;;; references to the right symbol were bogusly translated as full
934 ;;; calls instead of primitives, sending the system off into infinite
935 ;;; space. Having a report on all full calls generated makes it easier
936 ;;; to figure out what form caused the problem this time.
937 #!+sb-show (defvar *show-full-called-fnames-p* nil)
938 #!+sb-show (defvar *full-called-fnames* (make-hash-table :test 'equal))
940 ;;; Do some checks on a full call:
941 ;;; * Is this a full call to something we have reason to know should
942 ;;; never be full called?
943 ;;; * Is this a full call to (SETF FOO) which might conflict with
944 ;;; a DEFSETF or some such thing elsewhere in the program?
945 (defun check-full-call (node)
946 (let* ((cont (basic-combination-fun node))
947 (fname (continuation-function-name cont t)))
948 (declare (type (or symbol cons) fname))
950 #!+sb-show (unless (gethash fname *full-called-fnames*)
951 (setf (gethash fname *full-called-fnames*) t))
952 #!+sb-show (when *show-full-called-fnames-p*
953 (/show "converting full call to named function" fname)
954 (/show (basic-combination-args node))
955 (/show (policy node speed) (policy node safety))
956 (/show (policy node compilation-speed))
957 (let ((arg-types (mapcar (lambda (maybe-continuation)
958 (when maybe-continuation
961 maybe-continuation))))
962 (basic-combination-args node))))
965 (when (memq fname *always-optimized-away*)
966 (/show (policy node speed) (policy node safety))
967 (/show (policy node compilation-speed))
968 (error "internal error: full call to ~S" fname))
971 (destructuring-bind (setf stem) fname
972 (aver (eq setf 'setf))
973 (setf (gethash stem *setf-assumed-fboundp*) t)))))
975 ;;; If the call is in a tail recursive position and the return
976 ;;; convention is standard, then do a tail full call. If one or fewer
977 ;;; values are desired, then use a single-value call, otherwise use a
978 ;;; multiple-values call.
979 (defun ir2-convert-full-call (node block)
980 (declare (type combination node) (type ir2-block block))
981 (check-full-call node)
982 (let ((2cont (continuation-info (node-cont node))))
983 (cond ((node-tail-p node)
984 (ir2-convert-tail-full-call node block))
986 (eq (ir2-continuation-kind 2cont) :unknown))
987 (ir2-convert-multiple-full-call node block))
989 (ir2-convert-fixed-full-call node block))))
992 ;;;; entering functions
994 ;;; Do all the stuff that needs to be done on XEP entry:
996 ;;; -- Copy any more arg.
997 ;;; -- Set up the environment, accessing any closure variables.
998 ;;; -- Move args from the standard passing locations to their internal
1000 (defun init-xep-environment (node block fun)
1001 (declare (type bind node) (type ir2-block block) (type clambda fun))
1002 (let ((start-label (entry-info-offset (leaf-info fun)))
1003 (env (environment-info (node-environment node))))
1004 (let ((ef (functional-entry-function fun)))
1005 (cond ((and (optional-dispatch-p ef) (optional-dispatch-more-entry ef))
1006 ;; Special case the xep-allocate-frame + copy-more-arg case.
1007 (vop xep-allocate-frame node block start-label t)
1008 (vop copy-more-arg node block (optional-dispatch-max-args ef)))
1010 ;; No more args, so normal entry.
1011 (vop xep-allocate-frame node block start-label nil)))
1012 (if (ir2-environment-environment env)
1013 (let ((closure (make-normal-tn *backend-t-primitive-type*)))
1014 (vop setup-closure-environment node block start-label closure)
1015 (when (getf (functional-plist ef) :fin-function)
1016 (vop funcallable-instance-lexenv node block closure closure))
1018 (dolist (loc (ir2-environment-environment env))
1019 (vop closure-ref node block closure (incf n) (cdr loc)))))
1020 (vop setup-environment node block start-label)))
1022 (unless (eq (functional-kind fun) :top-level)
1023 (let ((vars (lambda-vars fun))
1025 (when (leaf-refs (first vars))
1026 (emit-move node block (make-argument-count-location)
1027 (leaf-info (first vars))))
1028 (dolist (arg (rest vars))
1029 (when (leaf-refs arg)
1030 (let ((pass (standard-argument-location n))
1031 (home (leaf-info arg)))
1032 (if (lambda-var-indirect arg)
1033 (do-make-value-cell node block pass home)
1034 (emit-move node block pass home))))
1037 (emit-move node block (make-old-fp-passing-location t)
1038 (ir2-environment-old-fp env)))
1042 ;;; Emit function prolog code. This is only called on bind nodes for
1043 ;;; functions that allocate environments. All semantics of let calls
1044 ;;; are handled by IR2-Convert-Let.
1046 ;;; If not an XEP, all we do is move the return PC from its passing
1047 ;;; location, since in a local call, the caller allocates the frame
1048 ;;; and sets up the arguments.
1049 (defun ir2-convert-bind (node block)
1050 (declare (type bind node) (type ir2-block block))
1051 (let* ((fun (bind-lambda node))
1052 (env (environment-info (lambda-environment fun))))
1053 (aver (member (functional-kind fun)
1054 '(nil :external :optional :top-level :cleanup)))
1056 (when (external-entry-point-p fun)
1057 (init-xep-environment node block fun)
1059 (when *collect-dynamic-statistics*
1060 (vop count-me node block *dynamic-counts-tn*
1061 (block-number (ir2-block-block block)))))
1063 (emit-move node block (ir2-environment-return-pc-pass env)
1064 (ir2-environment-return-pc env))
1066 (let ((lab (gen-label)))
1067 (setf (ir2-environment-environment-start env) lab)
1068 (vop note-environment-start node block lab)))
1072 ;;;; function return
1074 ;;; Do stuff to return from a function with the specified values and
1075 ;;; convention. If the return convention is :FIXED and we aren't
1076 ;;; returning from an XEP, then we do a known return (letting
1077 ;;; representation selection insert the correct move-arg VOPs.)
1078 ;;; Otherwise, we use the unknown-values convention. If there is a
1079 ;;; fixed number of return values, then use RETURN, otherwise use
1080 ;;; RETURN-MULTIPLE.
1081 (defun ir2-convert-return (node block)
1082 (declare (type creturn node) (type ir2-block block))
1083 (let* ((cont (return-result node))
1084 (2cont (continuation-info cont))
1085 (cont-kind (ir2-continuation-kind 2cont))
1086 (fun (return-lambda node))
1087 (env (environment-info (lambda-environment fun)))
1088 (old-fp (ir2-environment-old-fp env))
1089 (return-pc (ir2-environment-return-pc env))
1090 (returns (tail-set-info (lambda-tail-set fun))))
1092 ((and (eq (return-info-kind returns) :fixed)
1093 (not (external-entry-point-p fun)))
1094 (let ((locs (continuation-tns node block cont
1095 (return-info-types returns))))
1096 (vop* known-return node block
1097 (old-fp return-pc (reference-tn-list locs nil))
1099 (return-info-locations returns))))
1100 ((eq cont-kind :fixed)
1101 (let* ((types (mapcar #'tn-primitive-type (ir2-continuation-locs 2cont)))
1102 (cont-locs (continuation-tns node block cont types))
1103 (nvals (length cont-locs))
1104 (locs (make-standard-value-tns nvals)))
1105 (mapc #'(lambda (val loc)
1106 (emit-move node block val loc))
1110 (vop return-single node block old-fp return-pc (car locs))
1111 (vop* return node block
1112 (old-fp return-pc (reference-tn-list locs nil))
1116 (aver (eq cont-kind :unknown))
1117 (vop* return-multiple node block
1119 (reference-tn-list (ir2-continuation-locs 2cont) nil))
1126 ;;; This is used by the debugger to find the top function on the
1127 ;;; stack. It returns the OLD-FP and RETURN-PC for the current
1128 ;;; function as multiple values.
1129 (defoptimizer (sb!kernel:%caller-frame-and-pc ir2-convert) (() node block)
1130 (let ((env (environment-info (node-environment node))))
1131 (move-continuation-result node block
1132 (list (ir2-environment-old-fp env)
1133 (ir2-environment-return-pc env))
1136 ;;;; multiple values
1138 ;;; This is almost identical to IR2-Convert-Let. Since LTN annotates
1139 ;;; the continuation for the correct number of values (with the
1140 ;;; continuation user responsible for defaulting), we can just pick
1141 ;;; them up from the continuation.
1142 (defun ir2-convert-mv-bind (node block)
1143 (declare (type mv-combination node) (type ir2-block block))
1144 (let* ((cont (first (basic-combination-args node)))
1145 (fun (ref-leaf (continuation-use (basic-combination-fun node))))
1146 (vars (lambda-vars fun)))
1147 (aver (eq (functional-kind fun) :mv-let))
1148 (mapc #'(lambda (src var)
1149 (when (leaf-refs var)
1150 (let ((dest (leaf-info var)))
1151 (if (lambda-var-indirect var)
1152 (do-make-value-cell node block src dest)
1153 (emit-move node block src dest)))))
1154 (continuation-tns node block cont
1155 (mapcar #'(lambda (x)
1156 (primitive-type (leaf-type x)))
1161 ;;; Emit the appropriate fixed value, unknown value or tail variant of
1162 ;;; CALL-VARIABLE. Note that we only need to pass the values start for
1163 ;;; the first argument: all the other argument continuation TNs are
1164 ;;; ignored. This is because we require all of the values globs to be
1165 ;;; contiguous and on stack top.
1166 (defun ir2-convert-mv-call (node block)
1167 (declare (type mv-combination node) (type ir2-block block))
1168 (aver (basic-combination-args node))
1169 (let* ((start-cont (continuation-info (first (basic-combination-args node))))
1170 (start (first (ir2-continuation-locs start-cont)))
1171 (tails (and (node-tail-p node)
1172 (lambda-tail-set (node-home-lambda node))))
1173 (cont (node-cont node))
1174 (2cont (continuation-info cont)))
1175 (multiple-value-bind (fun named)
1176 (function-continuation-tn node block (basic-combination-fun node))
1177 (aver (and (not named)
1178 (eq (ir2-continuation-kind start-cont) :unknown)))
1181 (let ((env (environment-info (node-environment node))))
1182 (vop tail-call-variable node block start fun
1183 (ir2-environment-old-fp env)
1184 (ir2-environment-return-pc env))))
1186 (eq (ir2-continuation-kind 2cont) :unknown))
1187 (vop* multiple-call-variable node block (start fun nil)
1188 ((reference-tn-list (ir2-continuation-locs 2cont) t))))
1190 (let ((locs (standard-result-tns cont)))
1191 (vop* call-variable node block (start fun nil)
1192 ((reference-tn-list locs t)) (length locs))
1193 (move-continuation-result node block locs cont)))))))
1195 ;;; Reset the stack pointer to the start of the specified
1196 ;;; unknown-values continuation (discarding it and all values globs on
1198 (defoptimizer (%pop-values ir2-convert) ((continuation) node block)
1199 (let ((2cont (continuation-info (continuation-value continuation))))
1200 (aver (eq (ir2-continuation-kind 2cont) :unknown))
1201 (vop reset-stack-pointer node block
1202 (first (ir2-continuation-locs 2cont)))))
1204 ;;; Deliver the values TNs to CONT using MOVE-CONTINUATION-RESULT.
1205 (defoptimizer (values ir2-convert) ((&rest values) node block)
1206 (let ((tns (mapcar #'(lambda (x)
1207 (continuation-tn node block x))
1209 (move-continuation-result node block tns (node-cont node))))
1211 ;;; In the normal case where unknown values are desired, we use the
1212 ;;; VALUES-LIST VOP. In the relatively unimportant case of VALUES-LIST
1213 ;;; for a fixed number of values, we punt by doing a full call to the
1214 ;;; VALUES-LIST function. This gets the full call VOP to deal with
1215 ;;; defaulting any unsupplied values. It seems unworthwhile to
1216 ;;; optimize this case.
1217 (defoptimizer (values-list ir2-convert) ((list) node block)
1218 (let* ((cont (node-cont node))
1219 (2cont (continuation-info cont)))
1221 (ecase (ir2-continuation-kind 2cont)
1222 (:fixed (ir2-convert-full-call node block))
1224 (let ((locs (ir2-continuation-locs 2cont)))
1225 (vop* values-list node block
1226 ((continuation-tn node block list) nil)
1227 ((reference-tn-list locs t)))))))))
1229 (defoptimizer (%more-arg-values ir2-convert) ((context start count) node block)
1230 (let* ((cont (node-cont node))
1231 (2cont (continuation-info cont)))
1233 (ecase (ir2-continuation-kind 2cont)
1234 (:fixed (ir2-convert-full-call node block))
1236 (let ((locs (ir2-continuation-locs 2cont)))
1237 (vop* %more-arg-values node block
1238 ((continuation-tn node block context)
1239 (continuation-tn node block start)
1240 (continuation-tn node block count)
1242 ((reference-tn-list locs t)))))))))
1244 ;;;; special binding
1246 ;;; This is trivial, given our assumption of a shallow-binding
1248 (defoptimizer (%special-bind ir2-convert) ((var value) node block)
1249 (let ((name (leaf-name (continuation-value var))))
1250 (vop bind node block (continuation-tn node block value)
1251 (emit-constant name))))
1252 (defoptimizer (%special-unbind ir2-convert) ((var) node block)
1253 (vop unbind node block))
1255 ;;; ### Not clear that this really belongs in this file, or should
1256 ;;; really be done this way, but this is the least violation of
1257 ;;; abstraction in the current setup. We don't want to wire
1258 ;;; shallow-binding assumptions into IR1tran.
1259 (def-ir1-translator progv ((vars vals &body body) start cont)
1262 (if (or *converting-for-interpreter* (byte-compiling))
1263 `(%progv ,vars ,vals #'(lambda () ,@body))
1264 (once-only ((n-save-bs '(%primitive current-binding-pointer)))
1267 (mapc #'(lambda (var val)
1268 (%primitive bind val var))
1272 (%primitive unbind-to-here ,n-save-bs))))))
1276 ;;; Convert a non-local lexical exit. First find the NLX-Info in our
1277 ;;; environment. Note that this is never called on the escape exits
1278 ;;; for CATCH and UNWIND-PROTECT, since the escape functions aren't
1280 (defun ir2-convert-exit (node block)
1281 (declare (type exit node) (type ir2-block block))
1282 (let ((loc (find-in-environment (find-nlx-info (exit-entry node)
1284 (node-environment node)))
1285 (temp (make-stack-pointer-tn))
1286 (value (exit-value node)))
1287 (vop value-cell-ref node block loc temp)
1289 (let ((locs (ir2-continuation-locs (continuation-info value))))
1290 (vop unwind node block temp (first locs) (second locs)))
1291 (let ((0-tn (emit-constant 0)))
1292 (vop unwind node block temp 0-tn 0-tn))))
1296 ;;; %CLEANUP-POINT doesn't do anything except prevent the body from
1297 ;;; being entirely deleted.
1298 (defoptimizer (%cleanup-point ir2-convert) (() node block) node block)
1300 ;;; This function invalidates a lexical exit on exiting from the
1301 ;;; dynamic extent. This is done by storing 0 into the indirect value
1302 ;;; cell that holds the closed unwind block.
1303 (defoptimizer (%lexical-exit-breakup ir2-convert) ((info) node block)
1304 (vop value-cell-set node block
1305 (find-in-environment (continuation-value info) (node-environment node))
1308 ;;; We have to do a spurious move of no values to the result
1309 ;;; continuation so that lifetime analysis won't get confused.
1310 (defun ir2-convert-throw (node block)
1311 (declare (type mv-combination node) (type ir2-block block))
1312 (let ((args (basic-combination-args node)))
1313 (vop* throw node block
1314 ((continuation-tn node block (first args))
1316 (ir2-continuation-locs (continuation-info (second args)))
1320 (move-continuation-result node block () (node-cont node))
1323 ;;; Emit code to set up a non-local exit. INFO is the NLX-Info for the
1324 ;;; exit, and TAG is the continuation for the catch tag (if any.) We
1325 ;;; get at the target PC by passing in the label to the vop. The vop
1326 ;;; is responsible for building a return-PC object.
1327 (defun emit-nlx-start (node block info tag)
1328 (declare (type node node) (type ir2-block block) (type nlx-info info)
1329 (type (or continuation null) tag))
1330 (let* ((2info (nlx-info-info info))
1331 (kind (cleanup-kind (nlx-info-cleanup info)))
1332 (block-tn (environment-live-tn
1333 (make-normal-tn (primitive-type-or-lose 'catch-block))
1334 (node-environment node)))
1335 (res (make-stack-pointer-tn))
1336 (target-label (ir2-nlx-info-target 2info)))
1338 (vop current-binding-pointer node block
1339 (car (ir2-nlx-info-dynamic-state 2info)))
1340 (vop* save-dynamic-state node block
1342 ((reference-tn-list (cdr (ir2-nlx-info-dynamic-state 2info)) t)))
1343 (vop current-stack-pointer node block (ir2-nlx-info-save-sp 2info))
1347 (vop make-catch-block node block block-tn
1348 (continuation-tn node block tag) target-label res))
1349 ((:unwind-protect :block :tagbody)
1350 (vop make-unwind-block node block block-tn target-label res)))
1354 (do-make-value-cell node block res (ir2-nlx-info-home 2info)))
1356 (vop set-unwind-protect node block block-tn))
1361 ;;; Scan each of ENTRY's exits, setting up the exit for each lexical exit.
1362 (defun ir2-convert-entry (node block)
1363 (declare (type entry node) (type ir2-block block))
1364 (dolist (exit (entry-exits node))
1365 (let ((info (find-nlx-info node (node-cont exit))))
1367 (member (cleanup-kind (nlx-info-cleanup info))
1368 '(:block :tagbody)))
1369 (emit-nlx-start node block info nil))))
1372 ;;; Set up the unwind block for these guys.
1373 (defoptimizer (%catch ir2-convert) ((info-cont tag) node block)
1374 (emit-nlx-start node block (continuation-value info-cont) tag))
1375 (defoptimizer (%unwind-protect ir2-convert) ((info-cont cleanup) node block)
1376 (emit-nlx-start node block (continuation-value info-cont) nil))
1378 ;;; Emit the entry code for a non-local exit. We receive values and
1379 ;;; restore dynamic state.
1381 ;;; In the case of a lexical exit or CATCH, we look at the exit
1382 ;;; continuation's kind to determine which flavor of entry VOP to
1383 ;;; emit. If unknown values, emit the xxx-MULTIPLE variant to the
1384 ;;; continuation locs. If fixed values, make the appropriate number of
1385 ;;; temps in the standard values locations and use the other variant,
1386 ;;; delivering the temps to the continuation using
1387 ;;; MOVE-CONTINUATION-RESULT.
1389 ;;; In the UNWIND-PROTECT case, we deliver the first register
1390 ;;; argument, the argument count and the argument pointer to our
1391 ;;; continuation as multiple values. These values are the block exited
1392 ;;; to and the values start and count.
1394 ;;; After receiving values, we restore dynamic state. Except in the
1395 ;;; UNWIND-PROTECT case, the values receiving restores the stack
1396 ;;; pointer. In an UNWIND-PROTECT cleanup, we want to leave the stack
1397 ;;; pointer alone, since the thrown values are still out there.
1398 (defoptimizer (%nlx-entry ir2-convert) ((info-cont) node block)
1399 (let* ((info (continuation-value info-cont))
1400 (cont (nlx-info-continuation info))
1401 (2cont (continuation-info cont))
1402 (2info (nlx-info-info info))
1403 (top-loc (ir2-nlx-info-save-sp 2info))
1404 (start-loc (make-nlx-entry-argument-start-location))
1405 (count-loc (make-argument-count-location))
1406 (target (ir2-nlx-info-target 2info)))
1408 (ecase (cleanup-kind (nlx-info-cleanup info))
1409 ((:catch :block :tagbody)
1410 (if (and 2cont (eq (ir2-continuation-kind 2cont) :unknown))
1411 (vop* nlx-entry-multiple node block
1412 (top-loc start-loc count-loc nil)
1413 ((reference-tn-list (ir2-continuation-locs 2cont) t))
1415 (let ((locs (standard-result-tns cont)))
1416 (vop* nlx-entry node block
1417 (top-loc start-loc count-loc nil)
1418 ((reference-tn-list locs t))
1421 (move-continuation-result node block locs cont))))
1423 (let ((block-loc (standard-argument-location 0)))
1424 (vop uwp-entry node block target block-loc start-loc count-loc)
1425 (move-continuation-result
1427 (list block-loc start-loc count-loc)
1431 (when *collect-dynamic-statistics*
1432 (vop count-me node block *dynamic-counts-tn*
1433 (block-number (ir2-block-block block))))
1435 (vop* restore-dynamic-state node block
1436 ((reference-tn-list (cdr (ir2-nlx-info-dynamic-state 2info)) nil))
1438 (vop unbind-to-here node block
1439 (car (ir2-nlx-info-dynamic-state 2info)))))
1441 ;;;; n-argument functions
1443 (macrolet ((def-frob (name)
1444 `(defoptimizer (,name ir2-convert) ((&rest args) node block)
1445 (let* ((refs (move-tail-full-call-args node block))
1446 (cont (node-cont node))
1447 (res (continuation-result-tns
1449 (list (primitive-type (specifier-type 'list))))))
1450 (vop* ,name node block (refs) ((first res) nil)
1452 (move-continuation-result node block res cont)))))
1456 ;;;; structure accessors
1458 ;;;; These guys have to bizarrely determine the slot offset by looking
1459 ;;;; at the called function.
1461 (defoptimizer (%slot-accessor ir2-convert) ((str) node block)
1462 (let* ((cont (node-cont node))
1463 (res (continuation-result-tns cont
1464 (list *backend-t-primitive-type*))))
1465 (vop instance-ref node block
1466 (continuation-tn node block str)
1471 (combination-fun node)))))
1473 (move-continuation-result node block res cont)))
1475 (defoptimizer (%slot-setter ir2-convert) ((value str) node block)
1476 (let ((val (continuation-tn node block value)))
1477 (vop instance-set node block
1478 (continuation-tn node block str)
1484 (combination-fun node))))))
1486 (move-continuation-result node block (list val) (node-cont node))))
1488 ;;; Convert the code in a component into VOPs.
1489 (defun ir2-convert (component)
1490 (declare (type component component))
1491 (let (#!+sb-dyncount
1492 (*dynamic-counts-tn*
1493 (when *collect-dynamic-statistics*
1495 (block-number (block-next (component-head component))))
1496 (counts (make-array blocks
1497 :element-type '(unsigned-byte 32)
1498 :initial-element 0))
1499 (info (make-dyncount-info
1500 :for (component-name component)
1501 :costs (make-array blocks
1502 :element-type '(unsigned-byte 32)
1505 (setf (ir2-component-dyncount-info (component-info component))
1507 (emit-constant info)
1508 (emit-constant counts)))))
1510 (declare (type index num))
1511 (do-ir2-blocks (2block component)
1512 (let ((block (ir2-block-block 2block)))
1513 (when (block-start block)
1514 (setf (block-number block) num)
1516 (when *collect-dynamic-statistics*
1517 (let ((first-node (continuation-next (block-start block))))
1518 (unless (or (and (bind-p first-node)
1519 (external-entry-point-p
1520 (bind-lambda first-node)))
1521 (eq (continuation-function-name
1522 (node-cont first-node))
1527 #!+sb-dyncount *dynamic-counts-tn* #!-sb-dyncount nil
1529 (ir2-convert-block block)
1533 ;;; If necessary, emit a terminal unconditional branch to go to the
1534 ;;; successor block. If the successor is the component tail, then
1535 ;;; there isn't really any successor, but if the end is an unknown,
1536 ;;; non-tail call, then we emit an error trap just in case the
1537 ;;; function really does return.
1538 (defun finish-ir2-block (block)
1539 (declare (type cblock block))
1540 (let* ((2block (block-info block))
1541 (last (block-last block))
1542 (succ (block-succ block)))
1544 (aver (and succ (null (rest succ))))
1545 (let ((target (first succ)))
1546 (cond ((eq target (component-tail (block-component block)))
1547 (when (and (basic-combination-p last)
1548 (eq (basic-combination-kind last) :full))
1549 (let* ((fun (basic-combination-fun last))
1550 (use (continuation-use fun))
1551 (name (and (ref-p use) (leaf-name (ref-leaf use)))))
1552 (unless (or (node-tail-p last)
1553 (info :function :info name)
1554 (policy last (zerop safety)))
1555 (vop nil-function-returned-error last 2block
1557 (emit-constant name)
1558 (multiple-value-bind (tn named)
1559 (function-continuation-tn last 2block fun)
1562 ((not (eq (ir2-block-next 2block) (block-info target)))
1563 (vop branch last 2block (block-label target)))))))
1567 ;;; Convert the code in a block into VOPs.
1568 (defun ir2-convert-block (block)
1569 (declare (type cblock block))
1570 (let ((2block (block-info block)))
1571 (do-nodes (node cont block)
1574 (let ((2cont (continuation-info cont)))
1576 (not (eq (ir2-continuation-kind 2cont) :delayed)))
1577 (ir2-convert-ref node 2block))))
1579 (let ((kind (basic-combination-kind node)))
1582 (ir2-convert-local-call node 2block))
1584 (ir2-convert-full-call node 2block))
1586 (let ((fun (function-info-ir2-convert kind)))
1588 (funcall fun node 2block))
1589 ((eq (basic-combination-info node) :full)
1590 (ir2-convert-full-call node 2block))
1592 (ir2-convert-template node 2block))))))))
1594 (when (continuation-info (if-test node))
1595 (ir2-convert-if node 2block)))
1597 (let ((fun (bind-lambda node)))
1598 (when (eq (lambda-home fun) fun)
1599 (ir2-convert-bind node 2block))))
1601 (ir2-convert-return node 2block))
1603 (ir2-convert-set node 2block))
1606 ((eq (basic-combination-kind node) :local)
1607 (ir2-convert-mv-bind node 2block))
1608 ((eq (continuation-function-name (basic-combination-fun node))
1610 (ir2-convert-throw node 2block))
1612 (ir2-convert-mv-call node 2block))))
1614 (when (exit-entry node)
1615 (ir2-convert-exit node 2block)))
1617 (ir2-convert-entry node 2block)))))
1619 (finish-ir2-block block)