X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fcompiler%2Ffloat-tran.lisp;h=bc7a1cd6508d3614cae6082552abbbe17170ea6b;hb=dfa55a883f94470267b626dae77ce7e7dfac3df6;hp=282923c2940d375562579eafecb1db7f4c088426;hpb=cea4896b2482b7b2b429c1631d774b4cfbc0efba;p=sbcl.git diff --git a/src/compiler/float-tran.lisp b/src/compiler/float-tran.lisp index 282923c..bc7a1cd 100644 --- a/src/compiler/float-tran.lisp +++ b/src/compiler/float-tran.lisp @@ -63,7 +63,7 @@ ;; of automatically finding #!+sb-doc in proximity to DEFTRANSFORM ;; to let me scan for places that I made this mistake and didn't ;; catch myself. - "use inline (unsigned-byte 32) operations" + "use inline (UNSIGNED-BYTE 32) operations" (let ((num-high (numeric-type-high (continuation-type num)))) (when (null num-high) (give-up-ir1-transform)) @@ -178,14 +178,9 @@ '(%scalbn f ex) '(scale-double-float f ex))) -;;; toy@rtp.ericsson.se: -;;; -;;; Optimizers for scale-float. If the float has bounds, new bounds +;;; optimizers for SCALE-FLOAT. If the float has bounds, new bounds ;;; are computed for the result, if possible. - -#-sb-xc-host ;(CROSS-FLOAT-INFINITY-KLUDGE, see base-target-features.lisp-expr) -(progn -#!+propagate-float-type +#!+sb-propagate-float-type (progn (defun scale-float-derive-type-aux (f ex same-arg) @@ -196,7 +191,7 @@ ;; zeros. (set-bound (handler-case - (scale-float (bound-value x) n) + (scale-float (type-bound-number x) n) (floating-point-overflow () nil)) (consp x)))) @@ -223,13 +218,10 @@ (two-arg-derive-type f ex #'scale-float-derive-type-aux #'scale-double-float t)) -;;; toy@rtp.ericsson.se: -;;; -;;; Defoptimizers for %single-float and %double-float. This makes the +;;; DEFOPTIMIZERs for %SINGLE-FLOAT and %DOUBLE-FLOAT. This makes the ;;; FLOAT function return the correct ranges if the input has some ;;; defined range. Quite useful if we want to convert some type of ;;; bounded integer into a float. - (macrolet ((frob (fun type) (let ((aux-name (symbolicate fun "-DERIVE-TYPE-AUX"))) @@ -249,7 +241,7 @@ (one-arg-derive-type num #',aux-name #',fun)))))) (frob %single-float single-float) (frob %double-float double-float)) -)) ; PROGN PROGN +) ; PROGN ;;;; float contagion @@ -280,9 +272,10 @@ ;;; float (such as 0). (macrolet ((frob (op) `(deftransform ,op ((x y) (float rational) * :when :both) + "open-code FLOAT to RATIONAL comparison" (unless (constant-continuation-p y) (give-up-ir1-transform - "can't open-code float to rational comparison")) + "The RATIONAL value isn't known at compile time.")) (let ((val (continuation-value y))) (unless (eql (rational (float val)) val) (give-up-ir1-transform @@ -297,7 +290,7 @@ ;;; Derive the result to be float for argument types in the ;;; appropriate domain. -#!-propagate-fun-type +#!-sb-propagate-fun-type (dolist (stuff '((asin (real -1.0 1.0)) (acos (real -1.0 1.0)) (acosh (real 1.0)) @@ -306,14 +299,14 @@ (destructuring-bind (name type) stuff (let ((type (specifier-type type))) (setf (function-info-derive-type (function-info-or-lose name)) - #'(lambda (call) - (declare (type combination call)) - (when (csubtypep (continuation-type - (first (combination-args call))) - type) - (specifier-type 'float))))))) - -#!-propagate-fun-type + (lambda (call) + (declare (type combination call)) + (when (csubtypep (continuation-type + (first (combination-args call))) + type) + (specifier-type 'float))))))) + +#!-sb-propagate-fun-type (defoptimizer (log derive-type) ((x &optional y)) (when (and (csubtypep (continuation-type x) (specifier-type '(real 0.0))) @@ -329,52 +322,52 @@ (movable foldable flushable)) (defknown (%sin %cos %tanh %sin-quick %cos-quick) - (double-float) (double-float -1.0d0 1.0d0) - (movable foldable flushable)) + (double-float) (double-float -1.0d0 1.0d0) + (movable foldable flushable)) (defknown (%asin %atan) - (double-float) (double-float #.(- (/ pi 2)) #.(/ pi 2)) - (movable foldable flushable)) + (double-float) (double-float #.(- (/ pi 2)) #.(/ pi 2)) + (movable foldable flushable)) (defknown (%acos) - (double-float) (double-float 0.0d0 #.pi) - (movable foldable flushable)) + (double-float) (double-float 0.0d0 #.pi) + (movable foldable flushable)) (defknown (%cosh) - (double-float) (double-float 1.0d0) - (movable foldable flushable)) + (double-float) (double-float 1.0d0) + (movable foldable flushable)) (defknown (%acosh %exp %sqrt) - (double-float) (double-float 0.0d0) - (movable foldable flushable)) + (double-float) (double-float 0.0d0) + (movable foldable flushable)) (defknown %expm1 - (double-float) (double-float -1d0) - (movable foldable flushable)) + (double-float) (double-float -1d0) + (movable foldable flushable)) (defknown (%hypot) - (double-float double-float) (double-float 0d0) + (double-float double-float) (double-float 0d0) (movable foldable flushable)) (defknown (%pow) - (double-float double-float) double-float + (double-float double-float) double-float (movable foldable flushable)) (defknown (%atan2) - (double-float double-float) (double-float #.(- pi) #.pi) + (double-float double-float) (double-float #.(- pi) #.pi) (movable foldable flushable)) (defknown (%scalb) - (double-float double-float) double-float + (double-float double-float) double-float (movable foldable flushable)) (defknown (%scalbn) - (double-float (signed-byte 32)) double-float - (movable foldable flushable)) + (double-float (signed-byte 32)) double-float + (movable foldable flushable)) (defknown (%log1p) - (double-float) double-float - (movable foldable flushable)) + (double-float) double-float + (movable foldable flushable)) (dolist (stuff '((exp %exp *) (log %log float) @@ -401,6 +394,7 @@ (cos %cos %cos-quick) (tan %tan %tan-quick))) (destructuring-bind (name prim prim-quick) stuff + (declare (ignorable prim-quick)) (deftransform name ((x) '(single-float) '* :eval-name t) #!+x86 (cond ((csubtypep (continuation-type x) (specifier-type '(single-float @@ -473,7 +467,7 @@ (float pi x) (float 0 x))) -#!+(or propagate-float-type propagate-fun-type) +;; #!+(or propagate-float-type propagate-fun-type) (progn ;;; The number is of type REAL. @@ -492,7 +486,7 @@ ) ; PROGN -#!+propagate-fun-type +#!+sb-propagate-fun-type (progn ;;;; optimizers for elementary functions @@ -510,7 +504,7 @@ (float-type (or format 'float))) (specifier-type `(complex ,float-type)))) -;;; Compute a specifier like '(or float (complex float)), except float +;;; Compute a specifier like '(OR FLOAT (COMPLEX FLOAT)), except float ;;; should be the right kind of float. Allow bounds for the float ;;; part too. (defun float-or-complex-float-type (arg &optional lo hi) @@ -526,16 +520,16 @@ ;;; Test whether the numeric-type ARG is within in domain specified by ;;; DOMAIN-LOW and DOMAIN-HIGH, consider negative and positive zero to -;;; be distinct as for the :negative-zero-is-not-zero feature. With -;;; the :negative-zero-is-not-zero feature this could be handled by +;;; be distinct as for the :NEGATIVE-ZERO-IS-NOT-ZERO feature. With +;;; the :NEGATIVE-ZERO-IS-NOT-ZERO feature this could be handled by ;;; the numeric subtype code in type.lisp. (defun domain-subtypep (arg domain-low domain-high) (declare (type numeric-type arg) (type (or real null) domain-low domain-high)) (let* ((arg-lo (numeric-type-low arg)) - (arg-lo-val (bound-value arg-lo)) + (arg-lo-val (type-bound-number arg-lo)) (arg-hi (numeric-type-high arg)) - (arg-hi-val (bound-value arg-hi))) + (arg-hi-val (type-bound-number arg-hi))) ;; Check that the ARG bounds are correctly canonicalized. (when (and arg-lo (floatp arg-lo-val) (zerop arg-lo-val) (consp arg-lo) (minusp (float-sign arg-lo-val))) @@ -562,8 +556,6 @@ (minusp (float-sign arg-hi-val)) (plusp (float-sign arg-hi-val)))))))))) -;;; Elfun-Derive-Type-Simple -;;; ;;; Handle monotonic functions of a single variable whose domain is ;;; possibly part of the real line. ARG is the variable, FCN is the ;;; function, and DOMAIN is a specifier that gives the (real) domain @@ -608,7 +600,6 @@ default-low)) (res-hi (or (bound-func fcn (if increasingp high low)) default-high)) - ;; Result specifier type. (format (case (numeric-type-class arg) ((integer rational) 'single-float) (t (numeric-type-format arg)))) @@ -682,19 +673,19 @@ ;; Y is positive and log X >= 0. The range of exp(y * log(x)) is ;; obviously non-negative. We just have to be careful for ;; infinite bounds (given by nil). - (let ((lo (safe-expt (sb!c::bound-value (sb!c::interval-low x)) - (sb!c::bound-value (sb!c::interval-low y)))) - (hi (safe-expt (sb!c::bound-value (sb!c::interval-high x)) - (sb!c::bound-value (sb!c::interval-high y))))) + (let ((lo (safe-expt (type-bound-number (sb!c::interval-low x)) + (type-bound-number (sb!c::interval-low y)))) + (hi (safe-expt (type-bound-number (sb!c::interval-high x)) + (type-bound-number (sb!c::interval-high y))))) (list (sb!c::make-interval :low (or lo 1) :high hi)))) ('- ;; Y is negative and log x >= 0. The range of exp(y * log(x)) is ;; obviously [0, 1]. However, underflow (nil) means 0 is the ;; result. - (let ((lo (safe-expt (sb!c::bound-value (sb!c::interval-high x)) - (sb!c::bound-value (sb!c::interval-low y)))) - (hi (safe-expt (sb!c::bound-value (sb!c::interval-low x)) - (sb!c::bound-value (sb!c::interval-high y))))) + (let ((lo (safe-expt (type-bound-number (sb!c::interval-high x)) + (type-bound-number (sb!c::interval-low y)))) + (hi (safe-expt (type-bound-number (sb!c::interval-low x)) + (type-bound-number (sb!c::interval-high y))))) (list (sb!c::make-interval :low (or lo 0) :high (or hi 1))))) (t ;; Split the interval in half. @@ -713,18 +704,18 @@ ;; Y is positive and log X <= 0. The range of exp(y * log(x)) is ;; obviously [0, 1]. We just have to be careful for infinite bounds ;; (given by nil). - (let ((lo (safe-expt (sb!c::bound-value (sb!c::interval-low x)) - (sb!c::bound-value (sb!c::interval-high y)))) - (hi (safe-expt (sb!c::bound-value (sb!c::interval-high x)) - (sb!c::bound-value (sb!c::interval-low y))))) + (let ((lo (safe-expt (type-bound-number (sb!c::interval-low x)) + (type-bound-number (sb!c::interval-high y)))) + (hi (safe-expt (type-bound-number (sb!c::interval-high x)) + (type-bound-number (sb!c::interval-low y))))) (list (sb!c::make-interval :low (or lo 0) :high (or hi 1))))) ('- ;; Y is negative and log x <= 0. The range of exp(y * log(x)) is ;; obviously [1, inf]. - (let ((hi (safe-expt (sb!c::bound-value (sb!c::interval-low x)) - (sb!c::bound-value (sb!c::interval-low y)))) - (lo (safe-expt (sb!c::bound-value (sb!c::interval-high x)) - (sb!c::bound-value (sb!c::interval-high y))))) + (let ((hi (safe-expt (type-bound-number (sb!c::interval-low x)) + (type-bound-number (sb!c::interval-low y)))) + (lo (safe-expt (type-bound-number (sb!c::interval-high x)) + (type-bound-number (sb!c::interval-high y))))) (list (sb!c::make-interval :low (or lo 1) :high hi)))) (t ;; Split the interval in half @@ -744,7 +735,6 @@ (interval-expt-< pos y)))))) ;;; Compute bounds for (expt x y). - (defun interval-expt (x y) (case (interval-range-info x 1) ('+ @@ -764,7 +754,7 @@ ;; Figure out what the return type should be, given the argument ;; types and bounds and the result type and bounds. (cond ((csubtypep x-type (specifier-type 'integer)) - ;; An integer to some power. Cases to consider: + ;; an integer to some power (case (numeric-type-class y-type) (integer ;; Positive integer to an integer power is either an @@ -772,7 +762,7 @@ (let ((lo (or (interval-low bnd) '*)) (hi (or (interval-high bnd) '*))) (if (and (interval-low y-int) - (>= (bound-value (interval-low y-int)) 0)) + (>= (type-bound-number (interval-low y-int)) 0)) (specifier-type `(integer ,lo ,hi)) (specifier-type `(rational ,lo ,hi))))) (rational @@ -781,10 +771,10 @@ (let* ((lo (interval-low bnd)) (hi (interval-high bnd)) (int-lo (if lo - (floor (bound-value lo)) + (floor (type-bound-number lo)) '*)) (int-hi (if hi - (ceiling (bound-value hi)) + (ceiling (type-bound-number hi)) '*)) (f-lo (if lo (bound-func #'float lo) @@ -795,32 +785,30 @@ (specifier-type `(or (rational ,int-lo ,int-hi) (single-float ,f-lo, f-hi))))) (float - ;; Positive integer to a float power is a float. - (let ((res (copy-numeric-type y-type))) - (setf (numeric-type-low res) (interval-low bnd)) - (setf (numeric-type-high res) (interval-high bnd)) - res)) + ;; A positive integer to a float power is a float. + (modified-numeric-type y-type + :low (interval-low bnd) + :high (interval-high bnd))) (t - ;; Positive integer to a number is a number (for now). - (specifier-type 'number))) - ) + ;; A positive integer to a number is a number (for now). + (specifier-type 'number)))) ((csubtypep x-type (specifier-type 'rational)) ;; a rational to some power (case (numeric-type-class y-type) (integer - ;; Positive rational to an integer power is always a rational. + ;; A positive rational to an integer power is always a rational. (specifier-type `(rational ,(or (interval-low bnd) '*) ,(or (interval-high bnd) '*)))) (rational - ;; Positive rational to rational power is either a rational + ;; A positive rational to rational power is either a rational ;; or a single-float. (let* ((lo (interval-low bnd)) (hi (interval-high bnd)) (int-lo (if lo - (floor (bound-value lo)) + (floor (type-bound-number lo)) '*)) (int-hi (if hi - (ceiling (bound-value hi)) + (ceiling (type-bound-number hi)) '*)) (f-lo (if lo (bound-func #'float lo) @@ -831,20 +819,18 @@ (specifier-type `(or (rational ,int-lo ,int-hi) (single-float ,f-lo, f-hi))))) (float - ;; Positive rational to a float power is a float. - (let ((res (copy-numeric-type y-type))) - (setf (numeric-type-low res) (interval-low bnd)) - (setf (numeric-type-high res) (interval-high bnd)) - res)) + ;; A positive rational to a float power is a float. + (modified-numeric-type y-type + :low (interval-low bnd) + :high (interval-high bnd))) (t - ;; Positive rational to a number is a number (for now). - (specifier-type 'number))) - ) + ;; A positive rational to a number is a number (for now). + (specifier-type 'number)))) ((csubtypep x-type (specifier-type 'float)) ;; a float to some power (case (numeric-type-class y-type) ((or integer rational) - ;; Positive float to an integer or rational power is + ;; A positive float to an integer or rational power is ;; always a float. (make-numeric-type :class 'float @@ -852,7 +838,8 @@ :low (interval-low bnd) :high (interval-high bnd))) (float - ;; Positive float to a float power is a float of the higher type. + ;; A positive float to a float power is a float of the + ;; higher type. (make-numeric-type :class 'float :format (float-format-max (numeric-type-format x-type) @@ -860,7 +847,7 @@ :low (interval-low bnd) :high (interval-high bnd))) (t - ;; Positive float to a number is a number (for now) + ;; A positive float to a number is a number (for now) (specifier-type 'number)))) (t ;; A number to some power is a number. @@ -869,8 +856,8 @@ (defun merged-interval-expt (x y) (let* ((x-int (numeric-type->interval x)) (y-int (numeric-type->interval y))) - (mapcar #'(lambda (type) - (fixup-interval-expt type x-int y-int x y)) + (mapcar (lambda (type) + (fixup-interval-expt type x-int y-int x y)) (flatten-list (interval-expt x-int y-int))))) (defun expt-derive-type-aux (x y same-arg) @@ -890,7 +877,7 @@ ;; But a positive real to any power is well-defined. (merged-interval-expt x y)) (t - ;; A real to some power. The result could be a real + ;; a real to some power. The result could be a real ;; or a complex. (float-or-complex-float-type (numeric-contagion x y))))))) @@ -905,16 +892,13 @@ (defun log-derive-type-aux-2 (x y same-arg) (let ((log-x (log-derive-type-aux-1 x)) (log-y (log-derive-type-aux-1 y)) - (result '())) - ;; log-x or log-y might be union types. We need to run through - ;; the union types ourselves because /-derive-type-aux doesn't. + (accumulated-list nil)) + ;; LOG-X or LOG-Y might be union types. We need to run through + ;; the union types ourselves because /-DERIVE-TYPE-AUX doesn't. (dolist (x-type (prepare-arg-for-derive-type log-x)) (dolist (y-type (prepare-arg-for-derive-type log-y)) - (push (/-derive-type-aux x-type y-type same-arg) result))) - (setf result (flatten-list result)) - (if (rest result) - (make-union-type result) - (first result)))) + (push (/-derive-type-aux x-type y-type same-arg) accumulated-list))) + (apply #'type-union (flatten-list accumulated-list)))) (defoptimizer (log derive-type) ((x &optional y)) (if y @@ -930,7 +914,9 @@ (let ((result-type (numeric-contagion y x))) (cond ((and (numeric-type-real-p x) (numeric-type-real-p y)) - (let* ((format (case (numeric-type-class result-type) + (let* (;; FIXME: This expression for FORMAT seems to + ;; appear multiple times, and should be factored out. + (format (case (numeric-type-class result-type) ((integer rational) 'single-float) (t (numeric-type-format result-type)))) (bound-format (or format 'float))) @@ -1015,7 +1001,6 @@ ;;; Make REALPART and IMAGPART return the appropriate types. This ;;; should help a lot in optimized code. - (defun realpart-derive-type-aux (type) (let ((class (numeric-type-class type)) (format (numeric-type-format type))) @@ -1036,11 +1021,9 @@ :complexp :real :low (numeric-type-low type) :high (numeric-type-high type)))))) - -#!+(or propagate-fun-type propagate-float-type) +#!+(or sb-propagate-fun-type sb-propagate-float-type) (defoptimizer (realpart derive-type) ((num)) (one-arg-derive-type num #'realpart-derive-type-aux #'realpart)) - (defun imagpart-derive-type-aux (type) (let ((class (numeric-type-class type)) (format (numeric-type-format type))) @@ -1062,8 +1045,7 @@ :complexp :real :low (numeric-type-low type) :high (numeric-type-high type)))))) - -#!+(or propagate-fun-type propagate-float-type) +#!+(or sb-propagate-fun-type sb-propagate-float-type) (defoptimizer (imagpart derive-type) ((num)) (one-arg-derive-type num #'imagpart-derive-type-aux #'imagpart)) @@ -1095,10 +1077,9 @@ (rat-result-p (csubtypep element-type (specifier-type 'rational)))) (if rat-result-p - (make-union-type - (list element-type - (specifier-type - `(complex ,(numeric-type-class element-type))))) + (type-union element-type + (specifier-type + `(complex ,(numeric-type-class element-type)))) (make-numeric-type :class (numeric-type-class element-type) :format (numeric-type-format element-type) :complexp (if rat-result-p @@ -1106,7 +1087,7 @@ :complex)))) (specifier-type 'complex))) -#!+(or propagate-fun-type propagate-float-type) +#!+(or sb-propagate-fun-type sb-propagate-float-type) (defoptimizer (complex derive-type) ((re &optional im)) (if im (two-arg-derive-type re im #'complex-derive-type-aux-2 #'complex) @@ -1184,13 +1165,12 @@ (frob single-float) (frob double-float)) -;;; Here are simple optimizers for sin, cos, and tan. They do not +;;; Here are simple optimizers for SIN, COS, and TAN. They do not ;;; produce a minimal range for the result; the result is the widest ;;; possible answer. This gets around the problem of doing range ;;; reduction correctly but still provides useful results when the ;;; inputs are union types. - -#!+propagate-fun-type +#!+sb-propagate-fun-type (progn (defun trig-derive-type-aux (arg domain fcn &optional def-lo def-hi (increasingp t)) @@ -1233,39 +1213,42 @@ (defoptimizer (sin derive-type) ((num)) (one-arg-derive-type num - #'(lambda (arg) - ;; Derive the bounds if the arg is in [-pi/2, pi/2]. - (trig-derive-type-aux - arg - (specifier-type `(float ,(- (/ pi 2)) ,(/ pi 2))) - #'sin - -1 1)) + (lambda (arg) + ;; Derive the bounds if the arg is in [-pi/2, pi/2]. + (trig-derive-type-aux + arg + (specifier-type `(float ,(- (/ pi 2)) ,(/ pi 2))) + #'sin + -1 1)) #'sin)) (defoptimizer (cos derive-type) ((num)) (one-arg-derive-type num - #'(lambda (arg) - ;; Derive the bounds if the arg is in [0, pi]. - (trig-derive-type-aux arg - (specifier-type `(float 0d0 ,pi)) - #'cos - -1 1 - nil)) + (lambda (arg) + ;; Derive the bounds if the arg is in [0, pi]. + (trig-derive-type-aux arg + (specifier-type `(float 0d0 ,pi)) + #'cos + -1 1 + nil)) #'cos)) (defoptimizer (tan derive-type) ((num)) (one-arg-derive-type num - #'(lambda (arg) - ;; Derive the bounds if the arg is in [-pi/2, pi/2]. - (trig-derive-type-aux arg - (specifier-type `(float ,(- (/ pi 2)) ,(/ pi 2))) - #'tan - nil nil)) + (lambda (arg) + ;; Derive the bounds if the arg is in [-pi/2, pi/2]. + (trig-derive-type-aux arg + (specifier-type `(float ,(- (/ pi 2)) ,(/ pi 2))) + #'tan + nil nil)) #'tan)) ;;; CONJUGATE always returns the same type as the input type. +;;; +;;; FIXME: ANSI allows any subtype of REAL for the components of COMPLEX. +;;; So what if the input type is (COMPLEX (SINGLE-FLOAT 0 1))? (defoptimizer (conjugate derive-type) ((num)) (continuation-type num))