X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=tests%2Farith.pure.lisp;h=1f26fcc8c8210a5048e0af0360e39ba5b69ff68a;hb=4f102592a1c122f17231563671930456c7c85f5c;hp=e2b5e4cad78f4d756970d83979949db18655cfe6;hpb=6e73f7320651975ce7cd8e72e2334041b7e80df1;p=sbcl.git diff --git a/tests/arith.pure.lisp b/tests/arith.pure.lisp index e2b5e4c..1f26fcc 100644 --- a/tests/arith.pure.lisp +++ b/tests/arith.pure.lisp @@ -34,12 +34,8 @@ ;;; In a bug reported by Wolfhard Buss on cmucl-imp 2002-06-18 (BUG ;;; 184), sbcl didn't catch all divisions by zero, notably divisions ;;; of bignums and ratios by 0. Fixed in sbcl-0.7.6.13. -(macrolet ((test (form) `(multiple-value-bind (val cond) - (ignore-errors ,form) - (assert (null val)) - (assert (typep cond 'division-by-zero))))) - (test (/ 2/3 0)) - (test (/ (1+ most-positive-fixnum) 0))) +(assert (raises-error? (/ 2/3 0) division-by-zero)) +(assert (raises-error? (/ (1+ most-positive-fixnum) 0) division-by-zero)) ;;; In a bug reported by Raymond Toy on cmucl-imp 2002-07-18, (COERCE ;;; '(COMPLEX FLOAT)) was failing to return a complex @@ -48,15 +44,16 @@ (assert (= (coerce 1/2 '(complex float)) #c(0.5 0.0))) (assert (= (coerce 1.0d0 '(complex float)) #c(1.0d0 0.0d0))) +;;; COERCE also sometimes failed to verify that a particular coercion +;;; was possible (in particular coercing rationals to bounded float +;;; types. +(assert (raises-error? (coerce 1 '(float 2.0 3.0)) type-error)) +(assert (raises-error? (coerce 1 '(single-float -1.0 0.0)) type-error)) +(assert (eql (coerce 1 '(single-float -1.0 2.0)) 1.0)) + ;;; ANSI says MIN and MAX should signal TYPE-ERROR if any argument ;;; isn't REAL. SBCL 0.7.7 didn't in the 1-arg case. (reported as a ;;; bug in CMU CL on #lisp IRC by lrasinen 2002-09-01) -#|| - -FIXME: These tests would be good to have. But although, in -sbcl-0.7.7.2x, (NULL (IGNORE-ERRORS (MIN 1 #(1 2 3)))) returns T, the -ASSERTion fails, probably in something related to bug #194. - (assert (null (ignore-errors (min '(1 2 3))))) (assert (= (min -1) -1)) (assert (null (ignore-errors (min 1 #(1 2 3))))) @@ -69,4 +66,54 @@ ASSERTion fails, probably in something related to bug #194. (assert (= (max -1 10.0) 10.0)) (assert (null (ignore-errors (max 3 #'max)))) (assert (= (max -3 0) 0)) -||# + +;;; (CEILING x 2^k) was optimized incorrectly +(loop for divisor in '(-4 4) + for ceiler = (compile nil `(lambda (x) + (declare (fixnum x)) + (declare (optimize (speed 3))) + (ceiling x ,divisor))) + do (loop for i from -5 to 5 + for exact-q = (/ i divisor) + do (multiple-value-bind (q r) + (funcall ceiler i) + (assert (= (+ (* q divisor) r) i)) + (assert (<= exact-q q)) + (assert (< q (1+ exact-q)))))) + +;;; CEILING had a corner case, spotted by Paul Dietz +(assert (= (ceiling most-negative-fixnum (1+ most-positive-fixnum)) -1)) + +;;; give any optimizers of constant multiplication a light testing. +;;; 100 may seem low, but (a) it caught CSR's initial errors, and (b) +;;; before checking in, CSR tested with 10000. So one hundred +;;; checkins later, we'll have doubled the coverage. +(dotimes (i 100) + (let* ((x (random most-positive-fixnum)) + (x2 (* x 2)) + (x3 (* x 3))) + (let ((fn (handler-bind ((sb-ext:compiler-note #'error)) + (compile nil + `(lambda (y) + (declare (optimize speed) (type (integer 0 3) y)) + (* y ,x)))))) + (unless (and (= (funcall fn 0) 0) + (= (funcall fn 1) x) + (= (funcall fn 2) x2) + (= (funcall fn 3) x3)) + (error "bad results for ~D" x))))) + +;;; Bugs reported by Paul Dietz: + +;;; (GCD 0 x) must return (abs x) +(dolist (x (list -10 (* 3 most-negative-fixnum))) + (assert (= (gcd 0 x) (abs x)))) +;;; LCM returns a non-negative number +(assert (= (lcm 4 -10) 20)) +(assert (= (lcm 0 0) 0)) + +;;; PPC bignum arithmetic bug: +(multiple-value-bind (quo rem) + (truncate 291351647815394962053040658028983955 10000000000000000000000000) + (assert (= quo 29135164781)) + (assert (= rem 5394962053040658028983955)))