X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=tests%2Farith.pure.lisp;h=3452abea638a676e5ff0a39535e932117f5be43f;hb=ba02429b75951fc407be01c44fdcb01ff2908707;hp=b46a12c63326bb0ae494f9396fe691b807445ec5;hpb=56f96e77ade913d6363a3068c94e60f44ae9b3e7;p=sbcl.git diff --git a/tests/arith.pure.lisp b/tests/arith.pure.lisp index b46a12c..3452abe 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,11 +44,104 @@ (assert (= (coerce 1/2 '(complex float)) #c(0.5 0.0))) (assert (= (coerce 1.0d0 '(complex float)) #c(1.0d0 0.0d0))) -;;; ANSI: MIN and MAX should signal TYPE-ERROR if any argument -;;; isn't REAL. SBCL 0.7.7 didn't. (reported as a bug in CMU CL -;;; on IRC by lrasinen 2002-09-01) -;;; -;;; FIXME: Alas, even with the new fixed definition of MIN, no error -;;; is thrown, because of bug 194, so until bug 194 is fixed, we can't -;;; use this test. -#+nil (assert (null (ignore-errors (min '(1 2 3))))) \ No newline at end of file +;;; 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) +(assert (null (ignore-errors (min '(1 2 3))))) +(assert (= (min -1) -1)) +(assert (null (ignore-errors (min 1 #(1 2 3))))) +(assert (= (min 10 11) 10)) +(assert (null (ignore-errors (min (find-package "CL") -5.0)))) +(assert (= (min 5.0 -3) -3)) +(assert (null (ignore-errors (max #c(4 3))))) +(assert (= (max 0) 0)) +(assert (null (ignore-errors (max "MIX" 3)))) +(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))) + +;;; x86 LEA bug: +(assert (= (funcall + (compile nil '(lambda (x) (declare (bit x)) (+ x #xf0000000))) + 1) + #xf0000001)) + +;;; LOGBITP on bignums: +(dolist (x '(((1+ most-positive-fixnum) 1 nil) + ((1+ most-positive-fixnum) -1 t) + ((1+ most-positive-fixnum) (1+ most-positive-fixnum) nil) + ((1+ most-positive-fixnum) (1- most-negative-fixnum) t) + (1 (ash most-negative-fixnum 1) nil) + (29 most-negative-fixnum t) + (30 (ash most-negative-fixnum 1) t) + (31 (ash most-negative-fixnum 1) t) + (64 (ash most-negative-fixnum 36) nil) + (65 (ash most-negative-fixnum 36) t))) + (destructuring-bind (index int result) x + (assert (eq (eval `(logbitp ,index ,int)) result)))) + +;;; off-by-1 type inference error for %DPB and %DEPOSIT-FIELD: +(let ((f (compile nil '(lambda (b) + (integer-length (dpb b (byte 4 28) -1005)))))) + (assert (= (funcall f 1230070) 32))) +(let ((f (compile nil '(lambda (b) + (integer-length (deposit-field b (byte 4 28) -1005)))))) + (assert (= (funcall f 1230070) 32)))