X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fcompiler%2Fknownfun.lisp;h=640b393a5ab533e33ddb19ade592a632e282b5fa;hb=57e21c4b62e8c1a1ee7ef59ed2abb0c864fb06bc;hp=ea1ec4a0ea2adfe47a316831d697a84495e64507;hpb=dea9bd5c1afe23d9e061c60db654b88187ba9a5e;p=sbcl.git diff --git a/src/compiler/knownfun.lisp b/src/compiler/knownfun.lisp index ea1ec4a..640b393 100644 --- a/src/compiler/knownfun.lisp +++ b/src/compiler/knownfun.lisp @@ -25,7 +25,7 @@ ;;; breakdown of side effects, since we do very little code motion on ;;; IR1. We are interested in some deeper semantic properties such as ;;; whether it is safe to pass stack closures to. -(def-boolean-attribute ir1 +(!def-boolean-attribute ir1 ;; may call functions that are passed as arguments. In order to ;; determine what other effects are present, we must find the ;; effects of all arguments that may be functions. @@ -49,15 +49,29 @@ ;; mark these functions as foldable in this database. foldable ;; may be eliminated if value is unused. The function has no side - ;; effects except possibly CONS. If a function is defined to signal - ;; errors, then it is not flushable even if it is movable or - ;; foldable. + ;; effects except possibly cons. If a function might signal errors, + ;; then it is not flushable even if it is movable, foldable or + ;; unsafely-flushable. Implies UNSAFELY-FLUSHABLE. (In safe code + ;; type checking of arguments is always performed by the caller, so + ;; a function which SHOULD signal an error if arguments are not of + ;; declared types may be FLUSHABLE.) flushable + ;; unsafe call may be eliminated if value is unused. The function + ;; has no side effects except possibly cons and signalling an error + ;; in the safe code. If a function MUST signal errors, then it is + ;; not unsafely-flushable even if it is movable or foldable. + unsafely-flushable ;; may be moved with impunity. Has no side effects except possibly ;; consing, and is affected only by its arguments. + ;; + ;; Since it is not used now, its distribution in fndb.lisp is + ;; mere random; use with caution. movable ;; The function is a true predicate likely to be open-coded. Convert - ;; any non-conditional uses into (IF T NIL). + ;; any non-conditional uses into (IF T NIL). Not usually + ;; specified to DEFKNOWN, since this is implementation dependent, + ;; and is usually automatically set by the DEFINE-VOP :CONDITIONAL + ;; option. predicate ;; Inhibit any warning for compiling a recursive definition. ;; (Normally the compiler warns when compiling a recursive @@ -105,6 +119,8 @@ (predicate-type nil :type (or ctype null))) (defprinter (fun-info) + (attributes :test (not (zerop attributes)) + :prin1 (decode-ir1-attributes attributes)) (transforms :test transforms) (derive-type :test derive-type) (optimizer :test optimizer) @@ -150,12 +166,14 @@ (string-equal (transform-note x) note) (eq (transform-important x) important))) (fun-info-transforms info)))) - (if old - (setf (transform-function old) fun - (transform-note old) note) - (push (make-transform :type ctype :function fun :note note - :important important) - (fun-info-transforms info))) + (cond (old + (style-warn "Overwriting ~S" old) + (setf (transform-function old) fun + (transform-note old) note)) + (t + (push (make-transform :type ctype :function fun :note note + :important important) + (fun-info-transforms info)))) name)) ;;; Make a FUN-INFO structure with the specified type, attributes @@ -168,8 +186,8 @@ (defun %defknown (names type attributes &key derive-type optimizer) (let ((ctype (specifier-type type)) (info (make-fun-info :attributes attributes - :derive-type derive-type - :optimizer optimizer)) + :derive-type derive-type + :optimizer optimizer)) (target-env *info-environment*)) (dolist (name names) (let ((old-fun-info (info :function :info name))) @@ -197,7 +215,7 @@ ;;; shared, we copy it. We don't have to copy the lists, since each ;;; function that has generators or transforms has already been ;;; through here. -(declaim (ftype (function (t) fun-info) fun-info-or-lose)) +(declaim (ftype (sfunction (t) fun-info) fun-info-or-lose)) (defun fun-info-or-lose (name) (let (;; FIXME: Do we need this rebinding here? It's a literal ;; translation of the old CMU CL rebinding to @@ -215,12 +233,12 @@ ;;; only be done when the result value is that argument. (defun result-type-first-arg (call) (declare (type combination call)) - (let ((cont (first (combination-args call)))) - (when cont (continuation-type cont)))) + (let ((lvar (first (combination-args call)))) + (when lvar (lvar-type lvar)))) (defun result-type-last-arg (call) (declare (type combination call)) - (let ((cont (car (last (combination-args call))))) - (when cont (continuation-type cont)))) + (let ((lvar (car (last (combination-args call))))) + (when lvar (lvar-type lvar)))) ;;; Derive the result type according to the float contagion rules, but ;;; always return a float. This is used for irrational functions that @@ -228,7 +246,7 @@ (defun result-type-float-contagion (call) (declare (type combination call)) (reduce #'numeric-contagion (combination-args call) - :key #'continuation-type + :key #'lvar-type :initial-value (specifier-type 'single-float))) ;;; Return a closure usable as a derive-type method for accessing the @@ -237,9 +255,9 @@ (defun sequence-result-nth-arg (n) (lambda (call) (declare (type combination call)) - (let ((cont (nth (1- n) (combination-args call)))) - (when cont - (let ((type (continuation-type cont))) + (let ((lvar (nth (1- n) (combination-args call)))) + (when lvar + (let ((type (lvar-type lvar))) (if (array-type-p type) (specifier-type `(vector ,(type-specifier (array-type-element-type type)))) @@ -247,12 +265,52 @@ (when (csubtypep type ltype) ltype)))))))) -;;; Derive the type to be the type specifier which is the N'th arg. +;;; Derive the type to be the type specifier which is the Nth arg. (defun result-type-specifier-nth-arg (n) (lambda (call) (declare (type combination call)) - (let ((cont (nth (1- n) (combination-args call)))) - (when (and cont (constant-continuation-p cont)) - (careful-specifier-type (continuation-value cont)))))) + (let ((lvar (nth (1- n) (combination-args call)))) + (when (and lvar (constant-lvar-p lvar)) + (careful-specifier-type (lvar-value lvar)))))) + +;;; Derive the type to be the type specifier which is the Nth arg, +;;; with the additional restriptions noted in the CLHS for STRING and +;;; SIMPLE-STRING, defined to specialize on CHARACTER, and for VECTOR +;;; (under the page for MAKE-SEQUENCE). +(defun creation-result-type-specifier-nth-arg (n) + (lambda (call) + (declare (type combination call)) + (let ((lvar (nth (1- n) (combination-args call)))) + (when (and lvar (constant-lvar-p lvar)) + (let* ((specifier (lvar-value lvar)) + (lspecifier (if (atom specifier) (list specifier) specifier))) + (cond + ((eq (car lspecifier) 'string) + (destructuring-bind (string &rest size) + lspecifier + (declare (ignore string)) + (careful-specifier-type + `(vector character ,@(when size size))))) + ((eq (car lspecifier) 'simple-string) + (destructuring-bind (simple-string &rest size) + lspecifier + (declare (ignore simple-string)) + (careful-specifier-type + `(simple-array character ,@(if size (list size) '((*))))))) + (t + (let ((ctype (careful-specifier-type specifier))) + (if (and (array-type-p ctype) + (eq (array-type-specialized-element-type ctype) + *wild-type*)) + ;; I don't think I'm allowed to modify what I get + ;; back from SPECIFIER-TYPE; it is, after all, + ;; cached. Better copy it, then. + (let ((real-ctype (copy-structure ctype))) + (setf (array-type-element-type real-ctype) + *universal-type* + (array-type-specialized-element-type real-ctype) + *universal-type*) + real-ctype) + ctype))))))))) (/show0 "knownfun.lisp end of file")