1 ;;;; This file implements the IR1 finalize phase, which checks for
2 ;;;; various semantic errors.
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 ;;; Give the user grief about optimizations that we weren't able to
16 ;;; do. It is assumed that the user wants to hear about this, or there
17 ;;; wouldn't be any entries in the table. If the node has been deleted
18 ;;; or is no longer a known call, then do nothing; some other
19 ;;; optimization must have gotten to it.
20 (defun note-failed-optimization (node failures)
21 (declare (type combination node) (list failures))
22 (unless (or (node-deleted node)
23 (not (function-info-p (combination-kind node))))
24 (let ((*compiler-error-context* node))
25 (dolist (failure failures)
26 (let ((what (cdr failure))
27 (note (transform-note (car failure))))
30 (compiler-note "~@<unable to ~2I~_~A ~I~_because: ~2I~_~?~:>"
31 note (first what) (rest what)))
32 ((valid-function-use node what
33 :argument-test #'types-intersect
34 :result-test #'values-types-intersect)
36 (flet ((frob (string &rest stuff)
39 (valid-function-use node what
40 :warning-function #'frob
41 :error-function #'frob))
42 (compiler-note "~@<unable to ~
44 ~I~_due to type uncertainty: ~
47 ;; As best I can guess, it's OK to fall off the end here
48 ;; because if it's not a VALID-FUNCTION-USE, the user
49 ;; doesn't want to hear about it. The things I caught when
50 ;; I put ERROR "internal error: unexpected FAILURE=~S" here
51 ;; didn't look like things we need to report. -- WHN 2001-02-07
54 ;;; For each named function with an XEP, note the definition of that
55 ;;; name, and add derived type information to the info environment. We
56 ;;; also delete the FUNCTIONAL from *FREE-FUNCTIONS* to eliminate the
57 ;;; possibility that new references might be converted to it.
58 (defun finalize-xep-definition (fun)
59 (let* ((leaf (functional-entry-function fun))
60 (name (leaf-name leaf))
61 (dtype (definition-type leaf)))
62 (setf (leaf-type leaf) dtype)
63 (when (or (and name (symbolp name))
64 (and (consp name) (eq (car name) 'setf)))
65 (let* ((where (info :function :where-from name))
66 (*compiler-error-context* (lambda-bind (main-entry leaf)))
67 (global-def (gethash name *free-functions*))
69 (and (defined-function-p global-def)
70 (eq (defined-function-functional global-def) leaf))))
71 (note-name-defined name :function)
73 (remhash name *free-functions*))
76 (let ((approx-type (info :function :assumed-type name)))
77 (when (and approx-type (function-type-p dtype))
78 (valid-approximate-type approx-type dtype))
79 (setf (info :function :type name) dtype)
80 (setf (info :function :assumed-type name) nil))
81 (setf (info :function :where-from name) :defined))
82 (:declared); Just keep declared type.
85 (setf (info :function :type name) dtype)))))))
88 ;;; Find all calls in Component to assumed functions and update the assumed
89 ;;; type information. This is delayed until now so that we have the best
90 ;;; possible information about the actual argument types.
91 (defun note-assumed-types (component name var)
92 (when (and (eq (leaf-where-from var) :assumed)
93 (not (and (defined-function-p var)
94 (eq (defined-function-inlinep var) :notinline)))
95 (eq (info :function :where-from name) :assumed)
96 (eq (info :function :kind name) :function))
97 (let ((atype (info :function :assumed-type name)))
98 (dolist (ref (leaf-refs var))
99 (let ((dest (continuation-dest (node-cont ref))))
100 (when (and (eq (block-component (node-block ref)) component)
102 (eq (continuation-use (basic-combination-fun dest)) ref))
103 (setq atype (note-function-use dest atype)))))
104 (setf (info :function :assumed-type name) atype))))
106 ;;; Do miscellaneous things that we want to do once all optimization has
108 ;;; -- Record the derived result type before the back-end trashes the
110 ;;; -- Note definition of any entry points.
111 ;;; -- Note any failed optimizations.
112 (defun ir1-finalize (component)
113 (declare (type component component))
114 (dolist (fun (component-lambdas component))
115 (case (functional-kind fun)
117 (finalize-xep-definition fun))
119 (setf (leaf-type fun) (definition-type fun)))))
121 (maphash #'note-failed-optimization
122 (component-failed-optimizations component))
124 (maphash #'(lambda (k v)
125 (note-assumed-types component k v))