1.0.27.32: implement and use SB!XC:GENSYM

[sbcl.git] / src / code / typedefs.lisp

diff --git a/src/code/typedefs.lisp b/src/code/typedefs.lisp
index bcbfece..d9403c2 100644 (file)
--- a/src/code/typedefs.lisp
+++ b/src/code/typedefs.lisp
@@ -41,44 +41,61 @@
   ;;   package!)
   (multiple-value-bind (whole wholeless-arglist)
       (if (eq '&whole (car arglist))
-         (values (cadr arglist) (cddr arglist))
-         (values (gensym) arglist))
-    (multiple-value-bind (forms decls) (parse-body body nil)
+          (values (cadr arglist) (cddr arglist))
+          (values (sb!xc:gensym) arglist))
+    (multiple-value-bind (forms decls)
+        (parse-body body :doc-string-allowed nil)
       `(progn
-        (!cold-init-forms
-         (setf (info :type :translator ',name)
-               (lambda (,whole)
-                 (block ,name
-                   (destructuring-bind ,wholeless-arglist
-                       (rest ,whole) ; discarding NAME
-                     ,@decls
-                     ,@forms)))))
-        ',name))))
+         (!cold-init-forms
+          (setf (info :type :translator ',name)
+                (lambda (,whole)
+                  (block ,name
+                    (destructuring-bind ,wholeless-arglist
+                        (rest ,whole) ; discarding NAME
+                      ,@decls
+                      ,@forms)))))
+         ',name))))
 
 ;;; DEFVARs for these come later, after we have enough stuff defined.
 (declaim (special *wild-type* *universal-type* *empty-type*))
 \f
+(defvar *type-random-state*)
+
 ;;; the base class for the internal representation of types
 (def!struct (ctype (:conc-name type-)
-                  (:constructor nil)
-                  (:make-load-form-fun make-type-load-form)
-                  #-sb-xc-host (:pure t))
+                   (:constructor nil)
+                   (:make-load-form-fun make-type-load-form)
+                   #-sb-xc-host (:pure t))
   ;; the class of this type
   ;;
   ;; FIXME: It's unnecessarily confusing to have a structure accessor
   ;; named TYPE-CLASS-INFO which is an accessor for the CTYPE structure
   ;; even though the TYPE-CLASS structure also exists in the system.
   ;; Rename this slot: TYPE-CLASS or ASSOCIATED-TYPE-CLASS or something.
-  (class-info (required-argument) :type type-class)
+  (class-info (missing-arg) :type type-class)
   ;; True if this type has a fixed number of members, and as such
   ;; could possibly be completely specified in a MEMBER type. This is
   ;; used by the MEMBER type methods.
   (enumerable nil :read-only t)
   ;; an arbitrary hash code used in EQ-style hashing of identity
   ;; (since EQ hashing can't be done portably)
-  (hash-value (random (1+ most-positive-fixnum))
-             :type (and fixnum unsigned-byte)
-             :read-only t))
+  (hash-value (random #.(ash 1 15)
+                      (if (boundp '*type-random-state*)
+                          *type-random-state*
+                          (setf *type-random-state*
+                                (make-random-state))))
+              :type (and fixnum unsigned-byte)
+              :read-only t)
+  ;; Can this object contain other types? A global property of our
+  ;; implementation (which unfortunately seems impossible to enforce
+  ;; with assertions or other in-the-code checks and constraints) is
+  ;; that subclasses which don't contain other types correspond to
+  ;; disjoint subsets (except of course for the NAMED-TYPE T, which
+  ;; covers everything). So NUMBER-TYPE is disjoint from CONS-TYPE is
+  ;; is disjoint from MEMBER-TYPE and so forth. But types which can
+  ;; contain other types, like HAIRY-TYPE and INTERSECTION-TYPE, can
+  ;; violate this rule.
+  (might-contain-other-types-p nil :read-only t))
 (def!method print-object ((ctype ctype) stream)
   (print-unreadable-object (ctype stream :type t)
     (prin1 (type-specifier ctype) stream)))
@@ -96,13 +113,13 @@
   (multiple-value-bind (subtypep1 win1) (csubtypep type1 type2)
     (multiple-value-bind (subtypep2 win2) (csubtypep type2 type1)
       (cond (subtypep1 type1)
-           (subtypep2 type2)
-           ((and win1 win2) *empty-type*)
-           (t nil)))))
+            (subtypep2 type2)
+            ((and win1 win2) *empty-type*)
+            (t nil)))))
 (defun hierarchical-union2 (type1 type2)
   (cond ((csubtypep type1 type2) type2)
-       ((csubtypep type2 type1) type1)
-       (t nil)))
+        ((csubtypep type2 type1) type1)
+        (t nil)))
 
 ;;; Hash two things (types) down to 8 bits. In CMU CL this was an EQ
 ;;; hash, but since it now needs to run in vanilla ANSI Common Lisp at
@@ -116,8 +133,17 @@
 (declaim (ftype (function (ctype ctype) (unsigned-byte 8)) type-cache-hash))
 (defun type-cache-hash (type1 type2)
   (logand (logxor (ash (type-hash-value type1) -3)
-                 (type-hash-value type2))
-         #xFF))
+                  (type-hash-value type2))
+          #xFF))
+#!-sb-fluid (declaim (inline type-list-cache-hash))
+(declaim (ftype (function (list) (unsigned-byte 8)) type-list-cache-hash))
+(defun type-list-cache-hash (types)
+  (logand (loop with res = 0
+             for type in types
+             for hash = (type-hash-value type)
+             do (setq res (logxor res hash))
+             finally (return res))
+          #xFF))
 \f
 ;;;; cold loading initializations