X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fcompiler%2Fsset.lisp;h=c38239b17ae0d957a88f9ea42af669632140cab3;hb=769e1d8a825c587df85896dc971d0f90748e134e;hp=32cf880ca7397aef4280a0f98be4886591e52c29;hpb=2df8b5a0f18a3320d5b7652a958fae73cee1f937;p=sbcl.git

diff --git a/src/compiler/sset.lisp b/src/compiler/sset.lisp
index 32cf880..c38239b 100644
--- a/src/compiler/sset.lisp
+++ b/src/compiler/sset.lisp
@@ -84,7 +84,8 @@
   (let* ((vector (sset-vector set))
          (new-vector (make-array (if (zerop (length vector))
                                      2
-                                     (* (length vector) 2)))))
+                                     (* (length vector) 2))
+                                 :initial-element 0)))
     (setf (sset-vector set) new-vector
           (sset-free set) (length new-vector)
           (sset-count set) 0)
@@ -94,7 +95,8 @@
 
 ;;; Rehash the sset when the proportion of free cells in the set is
 ;;; lower than this.
-(defconstant +sset-rehash-threshold+ 1/4)
+(eval-when (:compile-toplevel :load-toplevel :execute)
+  (defconstant +sset-rehash-threshold+ 1/4))
 
 ;;; Destructively add ELEMENT to SET. If ELEMENT was not in the set,
 ;;; then we return true, otherwise we return false.