X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=tests%2Farray.pure.lisp;h=5068878805396a363a38e8682d92db0e899a1735;hb=1714224f33ba559eab11af8827a78f9a5aebd698;hp=023e170317276a13b944ad786833eb9fa675d6ab;hpb=09cd508206ea4d5da08d3950f9cddb862e81dffd;p=sbcl.git

diff --git a/tests/array.pure.lisp b/tests/array.pure.lisp
index 023e170..5068878 100644
--- a/tests/array.pure.lisp
+++ b/tests/array.pure.lisp
@@ -145,3 +145,67 @@
 ;;; Bug reported by Kalle Olavi Niemitalo for CMUCL through Debian BTS
 (let ((array (make-array nil :initial-contents nil)))
   (assert (eql (aref array) nil)))
+
+(let ((f (compile nil '(lambda ()
+			(let ((a (make-array '(4)
+					     :element-type 'base-char
+					     :initial-element #\z)))
+			  (setf (aref a 0) #\a)
+			  (setf (aref a 1) #\b)
+			  (setf (aref a 2) #\c)
+			  a)))))
+  (assert (= (length (funcall f)) 4)))
+
+(let ((x (make-array nil :initial-element 'foo)))
+  (adjust-array x nil)
+  (assert (eql (aref x) 'foo)))
+
+;;; BUG 315: "no bounds check for access to displaced array"
+;;;  reported by Bruno Haible sbcl-devel "various SBCL bugs" from CLISP
+;;;  test suite.
+(multiple-value-bind (val err)
+    (ignore-errors
+      (locally (declare (optimize (safety 3) (speed 0)))
+	(let* ((x (make-array 10 :fill-pointer 4 :element-type 'character
+			      :initial-element #\space :adjustable t))
+	       (y (make-array 10 :fill-pointer 4 :element-type 'character
+			      :displaced-to x)))
+	  (adjust-array x '(5))
+	  (char y 5))))
+  (assert (and (not val) (typep err 'sb-kernel:displaced-to-array-too-small-error))))
+
+;;; MISC.527: bit-vector bitwise operations used LENGTH to get a size
+;;; of a vector
+(flet ((bit-vector-equal (v1 v2)
+         (and (bit-vector-p v1) (bit-vector-p v2)
+              (equal (array-dimension v1 0) (array-dimension v2 0))
+              (loop for i below (array-dimension v1 0)
+                    always (eql (aref v1 i) (aref v2 i))))))
+  (let* ((length 1024)
+         (v1 (make-array length :element-type 'bit :fill-pointer 0))
+         (v2 (make-array length :element-type 'bit :fill-pointer 1)))
+    (loop for i from 0 below length
+          for x1 in '#1=(0 0 1 1 . #1#)
+          and x2 in '#2=(0 1 0 1 . #2#)
+          do (setf (aref v1 i) x1)
+          do (setf (aref v2 i) x2))
+    (loop for (bf lf) in '((bit-and logand)
+                           (bit-andc1 logandc1)
+                           (bit-andc2 logandc2)
+                           (bit-eqv logeqv)
+                           (bit-ior logior)
+                           (bit-nand lognand)
+                           (bit-nor lognor)
+                           (bit-orc1 logorc1)
+                           (bit-orc2 logorc2)
+                           (bit-xor logxor)
+                           ((lambda (x y) (bit-not x)) #.(lambda (x y) (lognot x))))
+          for fun = (compile nil `(lambda (v)
+                                    (declare (type (array bit (*)) v))
+                                    (declare (optimize (speed 3) (safety 0)))
+                                    (,bf v ,v2)))
+          for r1 = (funcall fun v1)
+          and r2 = (coerce (loop for i below length
+                                 collect (logand 1 (funcall lf (aref v1 i) (aref v2 i))))
+                           'bit-vector)
+          do (assert (bit-vector-equal r1 r2)))))