X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=tests%2Farith.pure.lisp;h=d257edca253595c0aae4d9bfa346af9e0ccaa52c;hb=cf49f2d086069a9c1b57f501df9a6a0bd3a34c3c;hp=77291fffe54538f69ca25b9b9943888c5b0ba781;hpb=05abd44bb4a3699285dd499dbbb4c77b64304835;p=sbcl.git diff --git a/tests/arith.pure.lisp b/tests/arith.pure.lisp index 77291ff..d257edc 100644 --- a/tests/arith.pure.lisp +++ b/tests/arith.pure.lisp @@ -371,8 +371,12 @@ ;; GCD used to sometimes return negative values. The following did, on 32 bit ;; builds. (with-test (:name :gcd) + ;; from lp#413680 (assert (plusp (gcd 20286123923750474264166990598656 - 680564733841876926926749214863536422912)))) + 680564733841876926926749214863536422912))) + ;; from lp#516750 + (assert (plusp (gcd 2596102012663483082521318626691873 + 2596148429267413814265248164610048)))) (with-test (:name :expt-zero-zero) ;; Check that (expt 0.0 0.0) and (expt 0 0.0) signal error, but (expt 0.0 0) @@ -572,6 +576,8 @@ (test x2) (test (1+ x2)) (test (1- x2))))) + (test most-positive-fixnum) + (test (1+ most-positive-fixnum)) (loop for i from 1 to 200 for pow = (expt 2 (1- i)) for j = (+ pow (random pow)) @@ -580,3 +586,71 @@ (tests j)) (dotimes (i 10) (tests (random (expt 2 (+ 1000 (random 10000)))))))) + +;; bug 1026634 (reported by Eric Marsden on sbcl-devel) +(with-test (:name :recursive-cut-to-width) + (assert (eql (funcall + (compile nil + `(lambda (x) + (declare (optimize (space 3)) + (type (integer 12417236377505266230 + 12417274239874990070) x)) + (logand 8459622733968096971 x))) + 12417237222845306758) + 2612793697039849090))) + +;; Also reported by Eric Marsden on sbcl-devel (2013-06-06) +(with-test (:name :more-recursive-cut-to-width) + (assert (eql (funcall + (compile nil `(lambda (a b) + (declare (optimize (speed 2) (safety 0))) + (logand (the (eql 16779072918521075607) a) + (the (integer 21371810342718833225 21371810343571293860) b)))) + 16779072918521075607 21371810342718833263) + 2923729245085762055))) + +(with-test (:name :complicated-logand-identity) + (loop for k from -8 upto 8 do + (loop for min from -16 upto 16 do + (loop for max from min upto 16 do + (let ((f (compile nil `(lambda (x) + (declare (type (integer ,min ,max) x)) + (logand x ,k))))) + (loop for x from min upto max do + (assert (eql (logand x k) (funcall f x))))))))) + +(with-test (:name :complicated-logior-identity) + (loop for k from -8 upto 8 do + (loop for min from -16 upto 16 do + (loop for max from min upto 16 do + (let ((f (compile nil `(lambda (x) + (declare (type (integer ,min ,max) x)) + (logior x ,k))))) + (loop for x from min upto max do + (assert (eql (logior x k) (funcall f x))))))))) + +(with-test (:name :ldb-negative-index-no-error) + (assert + (raises-error? + (funcall (compile nil + `(lambda (x y) + (ldb (byte x y) 100))) + -1 -2))) + (assert + (raises-error? + (funcall (compile nil + `(lambda (x y) + (mask-field (byte x y) 100))) + -1 -2))) + (assert + (raises-error? + (funcall (compile nil + `(lambda (x y) + (dpb 0 (byte x y) 100))) + -1 -2))) + (assert + (raises-error? + (funcall (compile nil + `(lambda (x y) + (deposit-field 0 (byte x y) 100))) + -1 -2))))