(DECLARE (IGNORE OTHER-1))))
(continuation-1)))
-\f
-(sb-ext:quit :unix-status 104)
+;;; reported by antifuchs/bdowning/etc on #lisp: ITERATE failure on
+;;; (iter (for i in '(1 2 3)) (+ i 50))
+(defun values-producer () (values 1 2 3 4 5 6 7))
+
+(defun values-consumer (fn)
+ (let (a b c d e f g h)
+ (multiple-value-bind (aa bb cc dd ee ff gg hh) (funcall fn)
+ (setq a aa)
+ (setq b bb)
+ (setq c cc)
+ (setq d dd)
+ (setq e ee)
+ (setq f ff)
+ (setq g gg)
+ (setq h hh)
+ (values a b c d e f g h))))
+
+(let ((list (multiple-value-list (values-consumer #'values-producer))))
+ (assert (= (length list) 8))
+ (assert (null (nth 7 list))))
+
+;;; failed on Alpha prior to sbcl-0.8.10.30
+(defun lotso-values ()
+ (values 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9
+ 0 1 2 3 4 5 6 7 8 9))
+
+;;; bug 313: source transforms were "lisp-1"
+(defun srctran-lisp1-1 (cadr) (if (functionp cadr) (funcall cadr 1) nil))
+(assert (eql (funcall (eval #'srctran-lisp1-1) #'identity) 1))
+(without-package-locks
+ ;; this be a nasal demon, but test anyways
+ (defvar caar))
+(defun srctran-lisp1-2 (caar) (funcall (sb-ext:truly-the function caar) 1))
+(assert (eql (funcall (eval #'srctran-lisp1-2) #'identity) 1))
+
+;;; partial bug 262: reference of deleted CTRAN (in RETURN-FROM)
+;;; during inline expansion. Bug report by Peter Denno, simplified
+;;; test case by David Wragg.
+(defun bug262-return-from (x &aux (y nil))
+ (labels ((foo-a (z) (return-from bug262-return-from z))
+ (foo-b (z) (foo-a z)))
+ (declare (inline foo-a))
+ (foo-a x)))
+
+;;; broken inference of an upper bound of an iteration variable,
+;;; reported by Rajat Datta.
+(defun isieve (num)
+ (let ((vec (make-array num :initial-element 0))
+ (acc 0))
+ (do ((i 2 (+ i 1)))
+ ((>= i num) 'done)
+ (when (= (svref vec i) 0)
+ (do ((j (* i i) (+ j i)))
+ ((>= j num) 'done)
+ (setf (svref vec j) 1))
+ (incf acc)))
+ acc))
+
+(assert (= (isieve 46349) 4792))
+
+;;; COERCE should not be constant-folded (reported by Nikodemus
+;;; Siivola)
+(let ((f (gensym)))
+ (setf (fdefinition f) (lambda (x) x))
+ (let ((g (compile nil `(lambda () (coerce ',f 'function)))))
+ (setf (fdefinition f) (lambda (x) (1+ x)))
+ (assert (eq (funcall g) (fdefinition f)))))
+
+(let ((x (coerce '(1 11) 'vector)))
+ (incf (aref x 0))
+ (assert (equalp x #(2 11))))
+
+;;; and BIT-* too (reported by Paul F. Dietz)
+(loop with v1 = #*0011
+ and v2 = #*0101
+ for f in '(bit-and bit-andc1 bit-andc2 bit-eqv
+ bit-ior bit-nand bit-nor bit-not
+ bit-orc1 bit-orc2 bit-xor
+ )
+ for form = `(lambda ()
+ (let ((v (,f ,v1 ,v2)))
+ (setf (aref v 0) (- 1 (aref v 0)))
+ (aref v 0)))
+ for compiled-res = (funcall (compile nil form))
+ for real-res = (- 1 (aref (funcall f v1 v2) 0))
+ do (assert (equal compiled-res real-res)))
+(let* ((v #*0011)
+ (form `(lambda ()
+ (let ((v (bit-not ,v)))
+ (setf (aref v 0) (- 1 (aref v 0)))
+ (aref v 0))))
+ (compiled-res (funcall (compile nil form)))
+ (real-res (- 1 (aref (funcall (eval #'bit-not) v) 0))))
+ (assert (equal compiled-res real-res)))
+
+;; bug reported on sbcl-devel by Hannu Koivisto on 2005-08-10
+(defvar *hannu-trap* nil)
+(progv '(*hannu-trap*) '()
+ (setq *hannu-trap* t))
+(assert (not *hannu-trap*))
+
+;;; bug reported on sbcl-help by Vasile Rotaru
+(let* ((initial-size (expt 2 16))
+ (prime-table (make-array initial-size
+ :element-type 'integer))
+ (first-primes #(5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71
+ 73
+ 79 83 89 97 101 103 107 109 113 127 131 137 139 149
+ 151 157 163 167 173 179 181 191 193 197 199 211 223
+ 227 229 233 239 241 251 257 263 269 271 277 281))
+ (count 0)
+ (increment 2))
+
+ (defun largest-prime-so-far ()
+ (aref prime-table (1- count)))
+ (defun add-prime (prime)
+ (setf (aref prime-table count) prime) (incf count))
+ (defun init-table ()
+ (map 'nil #'add-prime first-primes))
+ (defun next-candidate (candidate)
+ (prog1 (+ candidate increment)
+ (ecase increment
+ (2 (setf increment 4))
+ (4 (setf increment 2)))))
+ (defun prime-p (n)
+ (let ((sqrt-n (truncate (sqrt n))))
+ (dotimes (i count)
+ (let ((prime (aref prime-table i)))
+ (when (> prime sqrt-n)
+ (return-from prime-p t))
+ (when (zerop (mod n prime))
+ (return-from prime-p nil))))
+ (error "~&prime-table too small: ~A ~A~%" n
+ (largest-prime-so-far))))
+ (defun generate-primes (required)
+ (do ((candidate (next-candidate (largest-prime-so-far))
+ (next-candidate candidate)))
+ ((> candidate required))
+ (when (prime-p candidate)
+ (add-prime candidate))))
+ ;;
+ (init-table))
projects / sbcl.git / blobdiff