0.8.18.28:

[sbcl.git] / tests / bit-vector.impure-cload.lisp

diff --git a/tests/bit-vector.impure-cload.lisp b/tests/bit-vector.impure-cload.lisp
index 640470b..bd37acb 100644 (file)
--- a/tests/bit-vector.impure-cload.lisp
+++ b/tests/bit-vector.impure-cload.lisp
@@ -32,6 +32,8 @@
     (assert (equal (bit-xor a b) #*001111111111111111111111111111111))
     (assert (equal (bit-and a b) #*010000000000000000000000000000000)))
   ;; now test the biggy, mostly that it works...
+  #-x86-64 ; except on machines where addressable space is likely to be
+           ; much bigger than physical memory
   (let ((a (make-array (1- array-dimension-limit) :element-type 'bit :initial-element 0))
        (b (make-array (1- array-dimension-limit) :element-type 'bit :initial-element 0)))
     (bit-not a a)
@@ -39,7 +41,24 @@
     (assert (= (aref a (- array-dimension-limit 2)) 1))
     (bit-and a b a)
     (assert (= (aref a 0) 0))
-    (assert (= (aref a (- array-dimension-limit 2)) 0))))
+    (assert (= (aref a (- array-dimension-limit 2)) 0)))
+  ;; a special COUNT transform on bitvectors; triggers on (>= SPEED SPACE)
+  (locally
+   (declare (optimize (speed 3) (space 1)))
+   (let ((bv1 (make-array 5 :element-type 'bit))
+        (bv2 (make-array 0 :element-type 'bit))
+        (bv3 (make-array 68 :element-type 'bit)))
+     (declare (type simple-bit-vector bv1 bv2 bv3))
+     (setf (sbit bv3 42) 1)
+     ;; bitvector smaller than the word size
+     (assert (= 0 (count 1 bv1)))
+     (assert (= 5 (count 0 bv1)))
+     ;; special case of 0-length bitvectors
+     (assert (= 0 (count 1 bv2)))
+     (assert (= 0 (count 0 bv2)))
+     ;; bitvector larger than the word size
+     (assert (= 1 (count 1 bv3)))
+     (assert (= 67 (count 0 bv3))))))
 
 (bit-vector-test)
 \f