1 ;;;; This file contains code which does the translation of lambda
2 ;;;; forms from Lisp code to the first intermediate representation
5 ;;;; This software is part of the SBCL system. See the README file for
8 ;;;; This software is derived from the CMU CL system, which was
9 ;;;; written at Carnegie Mellon University and released into the
10 ;;;; public domain. The software is in the public domain and is
11 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
12 ;;;; files for more information.
18 ;;;; Note: Take a look at the compiler-overview.tex section on "Hairy
19 ;;;; function representation" before you seriously mess with this
22 ;;; Verify that the NAME is a legal name for a variable and return a
23 ;;; VAR structure for it, filling in info if it is globally special.
24 ;;; If it is losing, we punt with a COMPILER-ERROR. NAMES-SO-FAR is a
25 ;;; list of names which have previously been bound. If the NAME is in
26 ;;; this list, then we error out.
27 (declaim (ftype (sfunction (t list) lambda-var) varify-lambda-arg))
28 (defun varify-lambda-arg (name names-so-far)
29 (declare (inline member))
30 (unless (symbolp name)
31 (compiler-error "The lambda variable ~S is not a symbol." name))
32 (when (member name names-so-far :test #'eq)
33 (compiler-error "The variable ~S occurs more than once in the lambda list."
35 (let ((kind (info :variable :kind name)))
36 (when (or (keywordp name) (eq kind :constant))
37 (compiler-error "The name of the lambda variable ~S is already in use to name a constant."
39 (cond ((eq kind :special)
40 (let ((specvar (find-free-var name)))
41 (make-lambda-var :%source-name name
42 :type (leaf-type specvar)
43 :where-from (leaf-where-from specvar)
46 (make-lambda-var :%source-name name)))))
48 ;;; Make the default keyword for a &KEY arg, checking that the keyword
49 ;;; isn't already used by one of the VARS.
50 (declaim (ftype (sfunction (symbol list t) symbol) make-keyword-for-arg))
51 (defun make-keyword-for-arg (symbol vars keywordify)
52 (let ((key (if (and keywordify (not (keywordp symbol)))
56 (let ((info (lambda-var-arg-info var)))
58 (eq (arg-info-kind info) :keyword)
59 (eq (arg-info-key info) key))
61 "The keyword ~S appears more than once in the lambda list."
65 ;;; Parse a lambda list into a list of VAR structures, stripping off
66 ;;; any &AUX bindings. Each arg name is checked for legality, and
67 ;;; duplicate names are checked for. If an arg is globally special,
68 ;;; the var is marked as :SPECIAL instead of :LEXICAL. &KEY,
69 ;;; &OPTIONAL and &REST args are annotated with an ARG-INFO structure
70 ;;; which contains the extra information. If we hit something losing,
71 ;;; we bug out with COMPILER-ERROR. These values are returned:
72 ;;; 1. a list of the var structures for each top level argument;
73 ;;; 2. a flag indicating whether &KEY was specified;
74 ;;; 3. a flag indicating whether other &KEY args are allowed;
75 ;;; 4. a list of the &AUX variables; and
76 ;;; 5. a list of the &AUX values.
77 (declaim (ftype (sfunction (list) (values list boolean boolean list list))
79 (defun make-lambda-vars (list)
80 (multiple-value-bind (required optional restp rest keyp keys allowp auxp aux
81 morep more-context more-count)
82 (parse-lambda-list list)
83 (declare (ignore auxp)) ; since we just iterate over AUX regardless
88 (flet (;; PARSE-DEFAULT deals with defaults and supplied-p args
89 ;; for optionals and keywords args.
90 (parse-default (spec info)
91 (when (consp (cdr spec))
92 (setf (arg-info-default info) (second spec))
93 (when (consp (cddr spec))
94 (let* ((supplied-p (third spec))
95 (supplied-var (varify-lambda-arg supplied-p
97 (setf (arg-info-supplied-p info) supplied-var)
98 (names-so-far supplied-p)
99 (when (> (length (the list spec)) 3)
101 "The list ~S is too long to be an arg specifier."
104 (dolist (name required)
105 (let ((var (varify-lambda-arg name (names-so-far))))
107 (names-so-far name)))
109 (dolist (spec optional)
111 (let ((var (varify-lambda-arg spec (names-so-far))))
112 (setf (lambda-var-arg-info var)
113 (make-arg-info :kind :optional))
116 (let* ((name (first spec))
117 (var (varify-lambda-arg name (names-so-far)))
118 (info (make-arg-info :kind :optional)))
119 (setf (lambda-var-arg-info var) info)
122 (parse-default spec info))))
125 (let ((var (varify-lambda-arg rest (names-so-far))))
126 (setf (lambda-var-arg-info var) (make-arg-info :kind :rest))
128 (names-so-far rest)))
131 (let ((var (varify-lambda-arg more-context (names-so-far))))
132 (setf (lambda-var-arg-info var)
133 (make-arg-info :kind :more-context))
135 (names-so-far more-context))
136 (let ((var (varify-lambda-arg more-count (names-so-far))))
137 (setf (lambda-var-arg-info var)
138 (make-arg-info :kind :more-count))
140 (names-so-far more-count)))
145 (let ((var (varify-lambda-arg spec (names-so-far))))
146 (setf (lambda-var-arg-info var)
147 (make-arg-info :kind :keyword
148 :key (make-keyword-for-arg spec
152 (names-so-far spec)))
154 (let* ((name (first spec))
155 (var (varify-lambda-arg name (names-so-far)))
158 :key (make-keyword-for-arg name (vars) t))))
159 (setf (lambda-var-arg-info var) info)
162 (parse-default spec info)))
164 (let ((head (first spec)))
165 (unless (proper-list-of-length-p head 2)
166 (error "malformed &KEY argument specifier: ~S" spec))
167 (let* ((name (second head))
168 (var (varify-lambda-arg name (names-so-far)))
171 :key (make-keyword-for-arg (first head)
174 (setf (lambda-var-arg-info var) info)
177 (parse-default spec info))))))
181 (let ((var (varify-lambda-arg spec nil)))
184 (names-so-far spec)))
186 (unless (proper-list-of-length-p spec 1 2)
187 (compiler-error "malformed &AUX binding specifier: ~S"
189 (let* ((name (first spec))
190 (var (varify-lambda-arg name nil)))
192 (aux-vals (second spec))
193 (names-so-far name)))))
195 (values (vars) keyp allowp (aux-vars) (aux-vals))))))
197 ;;; This is similar to IR1-CONVERT-PROGN-BODY except that we
198 ;;; sequentially bind each AUX-VAR to the corresponding AUX-VAL before
199 ;;; converting the body. If there are no bindings, just convert the
200 ;;; body, otherwise do one binding and recurse on the rest.
202 ;;; FIXME: This could and probably should be converted to use
203 ;;; SOURCE-NAME and DEBUG-NAME. But I (WHN) don't use &AUX bindings,
204 ;;; so I'm not motivated. Patches will be accepted...
205 (defun ir1-convert-aux-bindings (start next result body aux-vars aux-vals)
206 (declare (type ctran start next) (type (or lvar null) result)
207 (list body aux-vars aux-vals))
209 (ir1-convert-progn-body start next result body)
210 (let ((ctran (make-ctran))
211 (fun-lvar (make-lvar))
212 (fun (ir1-convert-lambda-body body
213 (list (first aux-vars))
214 :aux-vars (rest aux-vars)
215 :aux-vals (rest aux-vals)
216 :debug-name (debug-namify
219 (reference-leaf start ctran fun-lvar fun)
220 (ir1-convert-combination-args fun-lvar ctran next result
221 (list (first aux-vals)))))
224 ;;; This is similar to IR1-CONVERT-PROGN-BODY except that code to bind
225 ;;; the SPECVAR for each SVAR to the value of the variable is wrapped
226 ;;; around the body. If there are no special bindings, we just convert
227 ;;; the body, otherwise we do one special binding and recurse on the
230 ;;; We make a cleanup and introduce it into the lexical
231 ;;; environment. If there are multiple special bindings, the cleanup
232 ;;; for the blocks will end up being the innermost one. We force NEXT
233 ;;; to start a block outside of this cleanup, causing cleanup code to
234 ;;; be emitted when the scope is exited.
235 (defun ir1-convert-special-bindings
236 (start next result body aux-vars aux-vals svars)
237 (declare (type ctran start next) (type (or lvar null) result)
238 (list body aux-vars aux-vals svars))
241 (ir1-convert-aux-bindings start next result body aux-vars aux-vals))
243 (ctran-starts-block next)
244 (let ((cleanup (make-cleanup :kind :special-bind))
246 (bind-ctran (make-ctran))
247 (cleanup-ctran (make-ctran)))
248 (ir1-convert start bind-ctran nil
249 `(%special-bind ',(lambda-var-specvar var) ,var))
250 (setf (cleanup-mess-up cleanup) (ctran-use bind-ctran))
251 (let ((*lexenv* (make-lexenv :cleanup cleanup)))
252 (ir1-convert bind-ctran cleanup-ctran nil '(%cleanup-point))
253 (ir1-convert-special-bindings cleanup-ctran next result
254 body aux-vars aux-vals
258 ;;; FIXME: this is the interface of the CMUCL WITH-DYNAMIC-EXTENT
259 ;;; macro. It is slightly confusing, in that START and BODY-START are
260 ;;; already-existing CTRANs (and FIXME: probably deserve a ONCE-ONLY),
261 ;;; whereas NEXT is a variable naming a CTRAN in the body. -- CSR,
263 (defmacro with-dynamic-extent ((start body-start next kind) &body body)
264 (declare (ignore kind))
265 (with-unique-names (cleanup next-ctran)
267 (ctran-starts-block ,body-start)
268 (let ((,cleanup (make-cleanup :kind :dynamic-extent))
269 (,next-ctran (make-ctran))
270 (,next (make-ctran)))
271 (ir1-convert ,start ,next-ctran nil '(%dynamic-extent-start))
272 (setf (cleanup-mess-up ,cleanup) (ctran-use ,next-ctran))
273 (let ((*lexenv* (make-lexenv :cleanup ,cleanup)))
274 (ir1-convert ,next-ctran ,next nil '(%cleanup-point))
275 (locally ,@body))))))
277 ;;; Create a lambda node out of some code, returning the result. The
278 ;;; bindings are specified by the list of VAR structures VARS. We deal
279 ;;; with adding the names to the LEXENV-VARS for the conversion. The
280 ;;; result is added to the NEW-FUNCTIONALS in the *CURRENT-COMPONENT*
281 ;;; and linked to the component head and tail.
283 ;;; We detect special bindings here, replacing the original VAR in the
284 ;;; lambda list with a temporary variable. We then pass a list of the
285 ;;; special vars to IR1-CONVERT-SPECIAL-BINDINGS, which actually emits
286 ;;; the special binding code.
288 ;;; We ignore any ARG-INFO in the VARS, trusting that someone else is
289 ;;; dealing with &NONSENSE, except for &REST vars with DYNAMIC-EXTENT.
291 ;;; AUX-VARS is a list of VAR structures for variables that are to be
292 ;;; sequentially bound. Each AUX-VAL is a form that is to be evaluated
293 ;;; to get the initial value for the corresponding AUX-VAR.
294 (defun ir1-convert-lambda-body (body
299 (source-name '.anonymous.)
301 (note-lexical-bindings t))
302 (declare (list body vars aux-vars aux-vals))
304 ;; We're about to try to put new blocks into *CURRENT-COMPONENT*.
305 (aver-live-component *current-component*)
307 (let* ((bind (make-bind))
308 (lambda (make-lambda :vars vars
310 :%source-name source-name
311 :%debug-name debug-name))
312 (result-ctran (make-ctran))
313 (result-lvar (make-lvar))
316 (awhen (lexenv-lambda *lexenv*)
317 (push lambda (lambda-children it))
318 (setf (lambda-parent lambda) it))
320 ;; just to check: This function should fail internal assertions if
321 ;; we didn't set up a valid debug name above.
323 ;; (In SBCL we try to make everything have a debug name, since we
324 ;; lack the omniscient perspective the original implementors used
325 ;; to decide which things didn't need one.)
326 (functional-debug-name lambda)
328 (setf (lambda-home lambda) lambda)
333 ;; As far as I can see, LAMBDA-VAR-HOME should never have
334 ;; been set before. Let's make sure. -- WHN 2001-09-29
335 (aver (not (lambda-var-home var)))
336 (setf (lambda-var-home var) lambda)
337 (let ((specvar (lambda-var-specvar var)))
340 (new-venv (cons (leaf-source-name specvar) specvar)))
342 (when note-lexical-bindings
343 (note-lexical-binding (leaf-source-name var)))
344 (new-venv (cons (leaf-source-name var) var)))))
345 (let ((info (lambda-var-arg-info var)))
347 (eq (arg-info-kind info) :rest)
348 (leaf-dynamic-extent var))
351 (let ((*lexenv* (make-lexenv :vars (new-venv)
354 (setf (bind-lambda bind) lambda)
355 (setf (node-lexenv bind) *lexenv*)
357 (let ((block (ctran-starts-block result-ctran)))
358 (let ((return (make-return :result result-lvar :lambda lambda))
359 (tail-set (make-tail-set :funs (list lambda))))
360 (setf (lambda-tail-set lambda) tail-set)
361 (setf (lambda-return lambda) return)
362 (setf (lvar-dest result-lvar) return)
363 (link-node-to-previous-ctran return result-ctran)
364 (setf (block-last block) return))
365 (link-blocks block (component-tail *current-component*)))
367 (with-component-last-block (*current-component*
368 (ctran-block result-ctran))
369 (let ((prebind-ctran (make-ctran))
370 (postbind-ctran (make-ctran)))
371 (ctran-starts-block prebind-ctran)
372 (link-node-to-previous-ctran bind prebind-ctran)
373 (use-ctran bind postbind-ctran)
375 (with-dynamic-extent (postbind-ctran result-ctran dx :rest)
376 (ir1-convert-special-bindings dx result-ctran result-lvar
377 body aux-vars aux-vals
379 (ir1-convert-special-bindings postbind-ctran result-ctran
381 aux-vars aux-vals (svars)))))))
383 (link-blocks (component-head *current-component*) (node-block bind))
384 (push lambda (component-new-functionals *current-component*))
388 ;;; Entry point CLAMBDAs have a special kind
389 (defun register-entry-point (entry dispatcher)
390 (declare (type clambda entry)
391 (type optional-dispatch dispatcher))
392 (setf (functional-kind entry) :optional)
393 (setf (leaf-ever-used entry) t)
394 (setf (lambda-optional-dispatch entry) dispatcher)
397 ;;; Create the actual entry-point function for an optional entry
398 ;;; point. The lambda binds copies of each of the VARS, then calls FUN
399 ;;; with the argument VALS and the DEFAULTS. Presumably the VALS refer
400 ;;; to the VARS by name. The VALS are passed in the reverse order.
402 ;;; If any of the copies of the vars are referenced more than once,
403 ;;; then we mark the corresponding var as EVER-USED to inhibit
404 ;;; "defined but not read" warnings for arguments that are only used
405 ;;; by default forms.
406 (defun convert-optional-entry (fun vars vals defaults)
407 (declare (type clambda fun) (list vars vals defaults))
408 (let* ((fvars (reverse vars))
409 (arg-vars (mapcar (lambda (var)
411 :%source-name (leaf-source-name var)
412 :type (leaf-type var)
413 :where-from (leaf-where-from var)
414 :specvar (lambda-var-specvar var)))
416 (fun (collect ((default-bindings)
418 (dolist (default defaults)
419 (if (constantp default)
420 (default-vals default)
421 (let ((var (gensym)))
422 (default-bindings `(,var ,default))
423 (default-vals var))))
424 (ir1-convert-lambda-body `((let (,@(default-bindings))
430 (debug-namify "&OPTIONAL processor "
432 :note-lexical-bindings nil))))
433 (mapc (lambda (var arg-var)
434 (when (cdr (leaf-refs arg-var))
435 (setf (leaf-ever-used var) t)))
439 ;;; This function deals with supplied-p vars in optional arguments. If
440 ;;; the there is no supplied-p arg, then we just call
441 ;;; IR1-CONVERT-HAIRY-ARGS on the remaining arguments, and generate a
442 ;;; optional entry that calls the result. If there is a supplied-p
443 ;;; var, then we add it into the default vars and throw a T into the
444 ;;; entry values. The resulting entry point function is returned.
445 (defun generate-optional-default-entry (res default-vars default-vals
446 entry-vars entry-vals
447 vars supplied-p-p body
449 source-name debug-name
451 (declare (type optional-dispatch res)
452 (list default-vars default-vals entry-vars entry-vals vars body
454 (let* ((arg (first vars))
455 (arg-name (leaf-source-name arg))
456 (info (lambda-var-arg-info arg))
457 (default (arg-info-default info))
458 (supplied-p (arg-info-supplied-p info))
460 (not (sb!xc:constantp (arg-info-default info)))))
462 (ir1-convert-hairy-args
464 (list* supplied-p arg default-vars)
465 (list* (leaf-source-name supplied-p) arg-name default-vals)
466 (cons arg entry-vars)
467 (list* t arg-name entry-vals)
468 (rest vars) t body aux-vars aux-vals
469 source-name debug-name
471 (ir1-convert-hairy-args
473 (cons arg default-vars)
474 (cons arg-name default-vals)
475 (cons arg entry-vars)
476 (cons arg-name entry-vals)
477 (rest vars) supplied-p-p body aux-vars aux-vals
478 source-name debug-name
481 ;; We want to delay converting the entry, but there exist
482 ;; problems: hidden references should not be established to
483 ;; lambdas of kind NIL should not have (otherwise the compiler
484 ;; might let-convert or delete them) and to variables.
486 supplied-p-p ; this entry will be of kind NIL
487 (and (lambda-p ep) (eq (lambda-kind ep) nil)))
488 (convert-optional-entry ep
489 default-vars default-vals
494 (register-entry-point
495 (convert-optional-entry (force ep)
496 default-vars default-vals
502 ;;; Create the MORE-ENTRY function for the OPTIONAL-DISPATCH RES.
503 ;;; ENTRY-VARS and ENTRY-VALS describe the fixed arguments. REST is
504 ;;; the var for any &REST arg. KEYS is a list of the &KEY arg vars.
506 ;;; The most interesting thing that we do is parse keywords. We create
507 ;;; a bunch of temporary variables to hold the result of the parse,
508 ;;; and then loop over the supplied arguments, setting the appropriate
509 ;;; temps for the supplied keyword. Note that it is significant that
510 ;;; we iterate over the keywords in reverse order --- this implements
511 ;;; the CL requirement that (when a keyword appears more than once)
512 ;;; the first value is used.
514 ;;; If there is no supplied-p var, then we initialize the temp to the
515 ;;; default and just pass the temp into the main entry. Since
516 ;;; non-constant &KEY args are forcibly given a supplied-p var, we
517 ;;; know that the default is constant, and thus safe to evaluate out
520 ;;; If there is a supplied-p var, then we create temps for both the
521 ;;; value and the supplied-p, and pass them into the main entry,
522 ;;; letting it worry about defaulting.
524 ;;; We deal with :ALLOW-OTHER-KEYS by delaying unknown keyword errors
525 ;;; until we have scanned all the keywords.
526 (defun convert-more-entry (res entry-vars entry-vals rest morep keys)
527 (declare (type optional-dispatch res) (list entry-vars entry-vals keys))
529 (arg-vals (reverse entry-vals))
533 (dolist (var (reverse entry-vars))
534 (arg-vars (make-lambda-var :%source-name (leaf-source-name var)
535 :type (leaf-type var)
536 :where-from (leaf-where-from var))))
538 (let* ((n-context (gensym "N-CONTEXT-"))
539 (context-temp (make-lambda-var :%source-name n-context))
540 (n-count (gensym "N-COUNT-"))
541 (count-temp (make-lambda-var :%source-name n-count
542 :type (specifier-type 'index))))
544 (arg-vars context-temp count-temp)
547 (arg-vals `(%listify-rest-args
548 ,n-context ,n-count ,(leaf-dynamic-extent rest))))
553 (when (optional-dispatch-keyp res)
554 (let ((n-index (gensym "N-INDEX-"))
555 (n-key (gensym "N-KEY-"))
556 (n-value-temp (gensym "N-VALUE-TEMP-"))
557 (n-allowp (gensym "N-ALLOWP-"))
558 (n-losep (gensym "N-LOSEP-"))
559 (allowp (or (optional-dispatch-allowp res)
560 (policy *lexenv* (zerop safety))))
563 (temps `(,n-index (1- ,n-count)) n-key n-value-temp)
564 (body `(declare (fixnum ,n-index) (ignorable ,n-key ,n-value-temp)))
568 (let* ((info (lambda-var-arg-info key))
569 (default (arg-info-default info))
570 (keyword (arg-info-key info))
571 (supplied-p (arg-info-supplied-p info))
572 (n-value (gensym "N-VALUE-"))
573 (clause (cond (supplied-p
574 (let ((n-supplied (gensym "N-SUPPLIED-")))
576 (arg-vals n-value n-supplied)
577 `((eq ,n-key ',keyword)
579 (setq ,n-value ,n-value-temp))))
582 `((eq ,n-key ',keyword)
583 (setq ,n-value ,n-value-temp))))))
584 (when (and (not allowp) (eq keyword :allow-other-keys))
585 (setq found-allow-p t)
587 (append clause `((setq ,n-allowp ,n-value-temp)))))
589 (temps `(,n-value ,default))
593 (temps n-allowp n-losep)
594 (unless found-allow-p
595 (tests `((eq ,n-key :allow-other-keys)
596 (setq ,n-allowp ,n-value-temp))))
598 (setq ,n-losep (list ,n-key)))))
601 `(when (oddp ,n-count)
602 (%odd-key-args-error)))
606 (declare (optimize (safety 0)))
608 (when (minusp ,n-index) (return))
609 (setf ,n-value-temp (%more-arg ,n-context ,n-index))
611 (setq ,n-key (%more-arg ,n-context ,n-index))
616 (body `(when (and ,n-losep (not ,n-allowp))
617 (%unknown-key-arg-error (car ,n-losep))))))))
619 (let ((ep (ir1-convert-lambda-body
622 (%funcall ,(optional-dispatch-main-entry res)
625 :debug-name "&MORE processing"
626 :note-lexical-bindings nil)))
627 (setf (optional-dispatch-more-entry res)
628 (register-entry-point ep res)))))
632 ;;; This is called by IR1-CONVERT-HAIRY-ARGS when we run into a &REST
633 ;;; or &KEY arg. The arguments are similar to that function, but we
634 ;;; split off any &REST arg and pass it in separately. REST is the
635 ;;; &REST arg var, or NIL if there is no &REST arg. KEYS is a list of
636 ;;; the &KEY argument vars.
638 ;;; When there are &KEY arguments, we introduce temporary gensym
639 ;;; variables to hold the values while keyword defaulting is in
640 ;;; progress to get the required sequential binding semantics.
642 ;;; This gets interesting mainly when there are &KEY arguments with
643 ;;; supplied-p vars or non-constant defaults. In either case, pass in
644 ;;; a supplied-p var. If the default is non-constant, we introduce an
645 ;;; IF in the main entry that tests the supplied-p var and decides
646 ;;; whether to evaluate the default or not. In this case, the real
647 ;;; incoming value is NIL, so we must union NULL with the declared
648 ;;; type when computing the type for the main entry's argument.
649 (defun ir1-convert-more (res default-vars default-vals entry-vars entry-vals
650 rest more-context more-count keys supplied-p-p
651 body aux-vars aux-vals
652 source-name debug-name)
653 (declare (type optional-dispatch res)
654 (list default-vars default-vals entry-vars entry-vals keys body
656 (collect ((main-vars (reverse default-vars))
657 (main-vals default-vals cons)
664 (main-vars more-context)
666 (main-vars more-count)
670 (let* ((info (lambda-var-arg-info key))
671 (default (arg-info-default info))
672 (hairy-default (not (sb!xc:constantp default)))
673 (supplied-p (arg-info-supplied-p info))
674 (n-val (make-symbol (format nil
676 (leaf-source-name key))))
677 (key-type (leaf-type key))
678 (val-temp (make-lambda-var
680 :type (if hairy-default
681 (type-union key-type (specifier-type 'null))
685 (cond ((or hairy-default supplied-p)
686 (let* ((n-supplied (gensym "N-SUPPLIED-"))
687 (supplied-temp (make-lambda-var
688 :%source-name n-supplied)))
690 (setf (arg-info-supplied-p info) supplied-temp))
692 (setf (arg-info-default info) nil))
693 (main-vars supplied-temp)
696 (bind-vals `(if ,n-supplied ,n-val ,default)))
698 (main-vals default nil)
701 (bind-vars supplied-p)
702 (bind-vals n-supplied))))
704 (main-vals (arg-info-default info))
705 (bind-vals n-val)))))
707 (let* ((main-entry (ir1-convert-lambda-body
709 :aux-vars (append (bind-vars) aux-vars)
710 :aux-vals (append (bind-vals) aux-vals)
711 :debug-name (debug-namify
712 "varargs entry for " source-name debug-name)))
713 (last-entry (convert-optional-entry main-entry default-vars
715 (setf (optional-dispatch-main-entry res)
716 (register-entry-point main-entry res))
717 (convert-more-entry res entry-vars entry-vals rest more-context keys)
719 (push (register-entry-point
721 (convert-optional-entry last-entry entry-vars entry-vals ())
724 (optional-dispatch-entry-points res))
727 ;;; This function generates the entry point functions for the
728 ;;; OPTIONAL-DISPATCH RES. We accomplish this by recursion on the list
729 ;;; of arguments, analyzing the arglist on the way down and generating
730 ;;; entry points on the way up.
732 ;;; DEFAULT-VARS is a reversed list of all the argument vars processed
733 ;;; so far, including supplied-p vars. DEFAULT-VALS is a list of the
734 ;;; names of the DEFAULT-VARS.
736 ;;; ENTRY-VARS is a reversed list of processed argument vars,
737 ;;; excluding supplied-p vars. ENTRY-VALS is a list things that can be
738 ;;; evaluated to get the values for all the vars from the ENTRY-VARS.
739 ;;; It has the var name for each required or optional arg, and has T
740 ;;; for each supplied-p arg.
742 ;;; VARS is a list of the LAMBDA-VAR structures for arguments that
743 ;;; haven't been processed yet. SUPPLIED-P-P is true if a supplied-p
744 ;;; argument has already been processed; only in this case are the
745 ;;; DEFAULT-XXX and ENTRY-XXX different.
747 ;;; The result at each point is a lambda which should be called by the
748 ;;; above level to default the remaining arguments and evaluate the
749 ;;; body. We cause the body to be evaluated by converting it and
750 ;;; returning it as the result when the recursion bottoms out.
752 ;;; Each level in the recursion also adds its entry point function to
753 ;;; the result OPTIONAL-DISPATCH. For most arguments, the defaulting
754 ;;; function and the entry point function will be the same, but when
755 ;;; SUPPLIED-P args are present they may be different.
757 ;;; When we run into a &REST or &KEY arg, we punt out to
758 ;;; IR1-CONVERT-MORE, which finishes for us in this case.
759 (defun ir1-convert-hairy-args (res default-vars default-vals
760 entry-vars entry-vals
761 vars supplied-p-p body aux-vars
763 source-name debug-name
765 (declare (type optional-dispatch res)
766 (list default-vars default-vals entry-vars entry-vals vars body
769 (if (optional-dispatch-keyp res)
770 ;; Handle &KEY with no keys...
771 (ir1-convert-more res default-vars default-vals
772 entry-vars entry-vals
773 nil nil nil vars supplied-p-p body aux-vars
774 aux-vals source-name debug-name)
775 (let ((fun (ir1-convert-lambda-body
776 body (reverse default-vars)
779 :debug-name (debug-namify
780 "hairy arg processor for "
783 (setf (optional-dispatch-main-entry res) fun)
784 (register-entry-point fun res)
785 (push (if supplied-p-p
786 (register-entry-point
787 (convert-optional-entry fun entry-vars entry-vals ())
790 (optional-dispatch-entry-points res))
792 ((not (lambda-var-arg-info (first vars)))
793 (let* ((arg (first vars))
794 (nvars (cons arg default-vars))
795 (nvals (cons (leaf-source-name arg) default-vals)))
796 (ir1-convert-hairy-args res nvars nvals nvars nvals
797 (rest vars) nil body aux-vars aux-vals
798 source-name debug-name
801 (let* ((arg (first vars))
802 (info (lambda-var-arg-info arg))
803 (kind (arg-info-kind info)))
806 (let ((ep (generate-optional-default-entry
807 res default-vars default-vals
808 entry-vars entry-vals vars supplied-p-p body
810 source-name debug-name
812 ;; See GENERATE-OPTIONAL-DEFAULT-ENTRY.
813 (push (if (lambda-p ep)
814 (register-entry-point
816 (convert-optional-entry ep entry-vars entry-vals ())
819 (progn (aver (not supplied-p-p))
821 (optional-dispatch-entry-points res))
824 (ir1-convert-more res default-vars default-vals
825 entry-vars entry-vals
826 arg nil nil (rest vars) supplied-p-p body
828 source-name debug-name))
830 (ir1-convert-more res default-vars default-vals
831 entry-vars entry-vals
832 nil arg (second vars) (cddr vars) supplied-p-p
833 body aux-vars aux-vals
834 source-name debug-name))
836 (ir1-convert-more res default-vars default-vals
837 entry-vars entry-vals
838 nil nil nil vars supplied-p-p body aux-vars
839 aux-vals source-name debug-name)))))))
841 ;;; This function deals with the case where we have to make an
842 ;;; OPTIONAL-DISPATCH to represent a LAMBDA. We cons up the result and
843 ;;; call IR1-CONVERT-HAIRY-ARGS to do the work. When it is done, we
844 ;;; figure out the MIN-ARGS and MAX-ARGS.
845 (defun ir1-convert-hairy-lambda (body vars keyp allowp aux-vars aux-vals
847 (source-name '.anonymous.)
848 (debug-name (debug-namify
851 (declare (list body vars aux-vars aux-vals))
852 (let ((res (make-optional-dispatch :arglist vars
855 :%source-name source-name
856 :%debug-name debug-name
857 :plist `(:ir1-environment
860 (min (or (position-if #'lambda-var-arg-info vars) (length vars))))
861 (aver-live-component *current-component*)
862 (push res (component-new-functionals *current-component*))
863 (ir1-convert-hairy-args res () () () () vars nil body aux-vars aux-vals
864 source-name debug-name nil)
865 (setf (optional-dispatch-min-args res) min)
866 (setf (optional-dispatch-max-args res)
867 (+ (1- (length (optional-dispatch-entry-points res))) min))
871 ;;; Convert a LAMBDA form into a LAMBDA leaf or an OPTIONAL-DISPATCH leaf.
872 (defun ir1-convert-lambda (form &key (source-name '.anonymous.)
874 allow-debug-catch-tag)
877 (compiler-error "A ~S was found when expecting a lambda expression:~% ~S"
880 (unless (eq (car form) 'lambda)
881 (compiler-error "~S was expected but ~S was found:~% ~S"
885 (unless (and (consp (cdr form)) (listp (cadr form)))
887 "The lambda expression has a missing or non-list lambda list:~% ~S"
890 (let ((*allow-debug-catch-tag* (and *allow-debug-catch-tag* allow-debug-catch-tag)))
891 (multiple-value-bind (vars keyp allow-other-keys aux-vars aux-vals)
892 (make-lambda-vars (cadr form))
893 (multiple-value-bind (forms decls) (parse-body (cddr form))
894 (binding* (((*lexenv* result-type)
895 (process-decls decls (append aux-vars vars) nil))
896 (forms (if (and *allow-debug-catch-tag*
897 (policy *lexenv* (>= insert-debug-catch 2)))
898 `((catch (make-symbol "SB-DEBUG-CATCH-TAG")
901 (forms (if (eq result-type *wild-type*)
903 `((the ,result-type (progn ,@forms)))))
904 (res (if (or (find-if #'lambda-var-arg-info vars) keyp)
905 (ir1-convert-hairy-lambda forms vars keyp
908 :source-name source-name
909 :debug-name debug-name)
910 (ir1-convert-lambda-body forms vars
913 :source-name source-name
914 :debug-name debug-name))))
915 (setf (functional-inline-expansion res) form)
916 (setf (functional-arg-documentation res) (cadr form))
919 ;;; helper for LAMBDA-like things, to massage them into a form
920 ;;; suitable for IR1-CONVERT-LAMBDA.
922 ;;; KLUDGE: We cons up a &REST list here, maybe for no particularly
923 ;;; good reason. It's probably lost in the noise of all the other
924 ;;; consing, but it's still inelegant. And we force our called
925 ;;; functions to do full runtime keyword parsing, ugh. -- CSR,
927 (defun ir1-convert-lambdalike (thing &rest args
928 &key (source-name '.anonymous.)
929 debug-name allow-debug-catch-tag)
930 (declare (ignorable source-name debug-name allow-debug-catch-tag))
932 ((lambda) (apply #'ir1-convert-lambda thing args))
934 (let ((res (apply #'ir1-convert-lambda
935 `(lambda ,@(cdr thing)) args)))
936 (setf (getf (functional-plist res) :fin-function) t)
939 (let ((name (cadr thing)))
940 (if (legal-fun-name-p name)
941 (let ((defined-fun-res (get-defined-fun name))
942 (res (apply #'ir1-convert-lambda `(lambda ,@(cddr thing))
946 (assert-global-function-definition-type name res)
947 (setf (defined-fun-functional defined-fun-res)
949 (unless (eq (defined-fun-inlinep defined-fun-res) :notinline)
952 (policy ref (> recognize-self-calls 0)))
953 res defined-fun-res))
955 (apply #'ir1-convert-lambda `(lambda ,@(cddr thing))
956 :debug-name name args))))
957 ((lambda-with-lexenv) (apply #'ir1-convert-inline-lambda thing args))))
959 ;;;; defining global functions
961 ;;; Convert FUN as a lambda in the null environment, but use the
962 ;;; current compilation policy. Note that FUN may be a
963 ;;; LAMBDA-WITH-LEXENV, so we may have to augment the environment to
964 ;;; reflect the state at the definition site.
965 (defun ir1-convert-inline-lambda (fun &key
966 (source-name '.anonymous.)
968 allow-debug-catch-tag)
969 (declare (ignore allow-debug-catch-tag))
970 (destructuring-bind (decls macros symbol-macros &rest body)
971 (if (eq (car fun) 'lambda-with-lexenv)
973 `(() () () . ,(cdr fun)))
974 (let ((*lexenv* (make-lexenv
975 :default (process-decls decls nil nil
977 :vars (copy-list symbol-macros)
978 :funs (mapcar (lambda (x)
980 (macro . ,(coerce (cdr x) 'function))))
982 :policy (lexenv-policy *lexenv*))))
983 (ir1-convert-lambda `(lambda ,@body)
984 :source-name source-name
985 :debug-name debug-name
986 :allow-debug-catch-tag nil))))
988 ;;; Get a DEFINED-FUN object for a function we are about to define. If
989 ;;; the function has been forward referenced, then substitute for the
990 ;;; previous references.
991 (defun get-defined-fun (name)
992 (proclaim-as-fun-name name)
993 (let ((found (find-free-fun name "shouldn't happen! (defined-fun)")))
994 (note-name-defined name :function)
995 (cond ((not (defined-fun-p found))
996 (aver (not (info :function :inlinep name)))
997 (let* ((where-from (leaf-where-from found))
998 (res (make-defined-fun
1000 :where-from (if (eq where-from :declared)
1002 :type (leaf-type found))))
1003 (substitute-leaf res found)
1004 (setf (gethash name *free-funs*) res)))
1005 ;; If *FREE-FUNS* has a previously converted definition
1006 ;; for this name, then blow it away and try again.
1007 ((defined-fun-functional found)
1008 (remhash name *free-funs*)
1009 (get-defined-fun name))
1012 ;;; Check a new global function definition for consistency with
1013 ;;; previous declaration or definition, and assert argument/result
1014 ;;; types if appropriate. This assertion is suppressed by the
1015 ;;; EXPLICIT-CHECK attribute, which is specified on functions that
1016 ;;; check their argument types as a consequence of type dispatching.
1017 ;;; This avoids redundant checks such as NUMBERP on the args to +, etc.
1018 (defun assert-new-definition (var fun)
1019 (let ((type (leaf-type var))
1020 (for-real (eq (leaf-where-from var) :declared))
1021 (info (info :function :info (leaf-source-name var))))
1022 (assert-definition-type
1024 ;; KLUDGE: Common Lisp is such a dynamic language that in general
1025 ;; all we can do here in general is issue a STYLE-WARNING. It
1026 ;; would be nice to issue a full WARNING in the special case of
1027 ;; of type mismatches within a compilation unit (as in section
1028 ;; 3.2.2.3 of the spec) but at least as of sbcl-0.6.11, we don't
1029 ;; keep track of whether the mismatched data came from the same
1030 ;; compilation unit, so we can't do that. -- WHN 2001-02-11
1031 :lossage-fun #'compiler-style-warn
1032 :unwinnage-fun (cond (info #'compiler-style-warn)
1033 (for-real #'compiler-notify)
1038 (ir1-attributep (fun-info-attributes info)
1041 "previous declaration"
1042 "previous definition"))))
1044 ;;; Convert a lambda doing all the basic stuff we would do if we were
1045 ;;; converting a DEFUN. In the old CMU CL system, this was used both
1046 ;;; by the %DEFUN translator and for global inline expansion, but
1047 ;;; since sbcl-0.pre7.something %DEFUN does things differently.
1048 ;;; FIXME: And now it's probably worth rethinking whether this
1049 ;;; function is a good idea.
1051 ;;; Unless a :INLINE function, we temporarily clobber the inline
1052 ;;; expansion. This prevents recursive inline expansion of
1053 ;;; opportunistic pseudo-inlines.
1054 (defun ir1-convert-lambda-for-defun (lambda var expansion converter)
1055 (declare (cons lambda) (function converter) (type defined-fun var))
1056 (let ((var-expansion (defined-fun-inline-expansion var)))
1057 (unless (eq (defined-fun-inlinep var) :inline)
1058 (setf (defined-fun-inline-expansion var) nil))
1059 (let* ((name (leaf-source-name var))
1060 (fun (funcall converter lambda
1062 (fun-info (info :function :info name)))
1063 (setf (functional-inlinep fun) (defined-fun-inlinep var))
1064 (assert-new-definition var fun)
1065 (setf (defined-fun-inline-expansion var) var-expansion)
1066 ;; If definitely not an interpreter stub, then substitute for
1067 ;; any old references.
1068 (unless (or (eq (defined-fun-inlinep var) :notinline)
1069 (not *block-compile*)
1071 (or (fun-info-transforms fun-info)
1072 (fun-info-templates fun-info)
1073 (fun-info-ir2-convert fun-info))))
1074 (substitute-leaf fun var)
1075 ;; If in a simple environment, then we can allow backward
1076 ;; references to this function from following top level forms.
1077 (when expansion (setf (defined-fun-functional var) fun)))
1080 ;;; the even-at-compile-time part of DEFUN
1082 ;;; The INLINE-EXPANSION is a LAMBDA-WITH-LEXENV, or NIL if there is
1083 ;;; no inline expansion.
1084 (defun %compiler-defun (name lambda-with-lexenv compile-toplevel)
1086 (let ((defined-fun nil)) ; will be set below if we're in the compiler
1088 (when compile-toplevel
1089 ;; better be in the compiler
1090 (aver (boundp '*lexenv*))
1091 (when sb!xc:*compile-print*
1092 (compiler-mumble "~&; recognizing DEFUN ~S~%" name))
1093 (remhash name *free-funs*)
1094 (setf defined-fun (get-defined-fun name))
1096 (aver (fasl-output-p *compile-object*))
1097 (if (member name *fun-names-in-this-file* :test #'equal)
1098 (warn 'duplicate-definition :name name)
1099 (push name *fun-names-in-this-file*)))
1101 (become-defined-fun-name name)
1103 (cond (lambda-with-lexenv
1104 (setf (info :function :inline-expansion-designator name)
1107 (setf (defined-fun-inline-expansion defined-fun)
1108 lambda-with-lexenv)))
1110 (clear-info :function :inline-expansion-designator name)))
1112 ;; old CMU CL comment:
1113 ;; If there is a type from a previous definition, blast it,
1114 ;; since it is obsolete.
1115 (when (and defined-fun
1116 (eq (leaf-where-from defined-fun) :defined))
1117 (setf (leaf-type defined-fun)
1118 ;; FIXME: If this is a block compilation thing, shouldn't
1119 ;; we be setting the type to the full derived type for the
1120 ;; definition, instead of this most general function type?
1121 (specifier-type 'function))))
1126 ;;; Entry point utilities
1128 ;;; Return a function for the Nth entry point.
1129 (defun optional-dispatch-entry-point-fun (dispatcher n)
1130 (declare (type optional-dispatch dispatcher)
1131 (type unsigned-byte n))
1132 (let* ((env (getf (optional-dispatch-plist dispatcher) :ir1-environment))
1133 (*lexenv* (first env))
1134 (*current-path* (second env)))
1135 (force (nth n (optional-dispatch-entry-points dispatcher)))))