1 ;;;; This software is part of the SBCL system. See the README file for
4 ;;;; This software is derived from the CMU CL system, which was
5 ;;;; written at Carnegie Mellon University and released into the
6 ;;;; public domain. The software is in the public domain and is
7 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
8 ;;;; files for more information.
10 (in-package "SB!KERNEL")
12 (!begin-collecting-cold-init-forms)
14 ;;;; representations of types
16 ;;; A HAIRY-TYPE represents anything too weird to be described
17 ;;; reasonably or to be useful, such as NOT, SATISFIES, unknown types,
18 ;;; and unreasonably complicated types involving AND. We just remember
19 ;;; the original type spec.
20 (defstruct (hairy-type (:include ctype
21 (class-info (type-class-or-lose 'hairy))
23 (might-contain-other-types-p t))
26 ;; the Common Lisp type-specifier of the type we represent
27 (specifier nil :type t))
29 (!define-type-class hairy)
31 ;;; An UNKNOWN-TYPE is a type not known to the type system (not yet
32 ;;; defined). We make this distinction since we don't want to complain
33 ;;; about types that are hairy but defined.
34 (defstruct (unknown-type (:include hairy-type)
37 (defun maybe-reparse-specifier (type)
38 (when (unknown-type-p type)
39 (let* ((spec (unknown-type-specifier type))
40 (name (if (consp spec)
43 (when (info :type :kind name)
44 (let ((new-type (specifier-type spec)))
45 (unless (unknown-type-p new-type)
49 (defmacro maybe-reparse-specifier! (type)
50 (assert (symbolp type))
51 (with-unique-names (new-type)
52 `(let ((,new-type (maybe-reparse-specifier ,type)))
54 (setf ,type ,new-type)
57 (defstruct (negation-type (:include ctype
58 (class-info (type-class-or-lose 'negation))
59 ;; FIXME: is this right? It's
60 ;; what they had before, anyway
62 (might-contain-other-types-p t))
65 (type (missing-arg) :type ctype))
67 (!define-type-class negation)
69 ;;; ARGS-TYPE objects are used both to represent VALUES types and
70 ;;; to represent FUNCTION types.
71 (defstruct (args-type (:include ctype)
74 ;; Lists of the type for each required and optional argument.
75 (required nil :type list)
76 (optional nil :type list)
77 ;; The type for the rest arg. NIL if there is no &REST arg.
78 (rest nil :type (or ctype null))
79 ;; true if &KEY arguments are specified
80 (keyp nil :type boolean)
81 ;; list of KEY-INFO structures describing the &KEY arguments
82 (keywords nil :type list)
83 ;; true if other &KEY arguments are allowed
84 (allowp nil :type boolean))
86 (defun canonicalize-args-type-args (required optional rest &optional keyp)
87 (when (eq rest *empty-type*)
90 (loop with last-not-rest = nil
93 do (cond ((eq opt *empty-type*)
94 (return (values required (subseq optional i) rest)))
95 ((and (not keyp) (neq opt rest))
96 (setq last-not-rest i)))
97 finally (return (values required
101 (subseq optional 0 (1+ last-not-rest))))
104 (defun parse-args-types (lambda-list-like-thing)
106 (required optional restp rest keyp keys allowp auxp aux
107 morep more-context more-count llk-p)
108 (parse-lambda-list-like-thing lambda-list-like-thing :silent t)
109 (declare (ignore aux morep more-context more-count))
111 (error "&AUX in a FUNCTION or VALUES type: ~S." lambda-list-like-thing))
112 (let ((required (mapcar #'single-value-specifier-type required))
113 (optional (mapcar #'single-value-specifier-type optional))
114 (rest (when restp (single-value-specifier-type rest)))
116 (collect ((key-info))
118 (unless (proper-list-of-length-p key 2)
119 (error "Keyword type description is not a two-list: ~S." key))
120 (let ((kwd (first key)))
121 (when (find kwd (key-info) :key #'key-info-name)
122 (error "~@<repeated keyword ~S in lambda list: ~2I~_~S~:>"
123 kwd lambda-list-like-thing))
127 :type (single-value-specifier-type (second key))))))
129 (multiple-value-bind (required optional rest)
130 (canonicalize-args-type-args required optional rest keyp)
131 (values required optional rest keyp keywords allowp llk-p)))))
133 (defstruct (values-type
135 (class-info (type-class-or-lose 'values)))
136 (:constructor %make-values-type)
139 (defun-cached (make-values-type-cached
141 :hash-function (lambda (req opt rest allowp)
143 (type-list-cache-hash req)
144 (type-list-cache-hash opt)
146 (type-hash-value rest)
150 ((required equal-but-no-car-recursion)
151 (optional equal-but-no-car-recursion)
154 (%make-values-type :required required
159 (defun make-values-type (&key required optional rest allowp)
160 (multiple-value-bind (required optional rest)
161 (canonicalize-args-type-args required optional rest)
162 (cond ((and (null required)
164 (eq rest *universal-type*))
166 ((memq *empty-type* required)
168 (t (make-values-type-cached required optional
171 (!define-type-class values)
173 ;;; (SPECIFIER-TYPE 'FUNCTION) and its subtypes
174 (defstruct (fun-type (:include args-type
175 (class-info (type-class-or-lose 'function)))
177 make-fun-type (&key required optional rest
181 &aux (rest (if (eq rest *empty-type*)
184 ;; true if the arguments are unrestrictive, i.e. *
185 (wild-args nil :type boolean)
186 ;; type describing the return values. This is a values type
187 ;; when multiple values were specified for the return.
188 (returns (missing-arg) :type ctype))
190 ;;; The CONSTANT-TYPE structure represents a use of the CONSTANT-ARG
191 ;;; "type specifier", which is only meaningful in function argument
192 ;;; type specifiers used within the compiler. (It represents something
193 ;;; that the compiler knows to be a constant.)
194 (defstruct (constant-type
196 (class-info (type-class-or-lose 'constant)))
198 ;; The type which the argument must be a constant instance of for this type
200 (type (missing-arg) :type ctype))
202 ;;; The NAMED-TYPE is used to represent *, T and NIL, the standard
203 ;;; special cases, as well as other special cases needed to
204 ;;; interpolate between regions of the type hierarchy, such as
205 ;;; INSTANCE (which corresponds to all those classes with slots which
206 ;;; are not funcallable), FUNCALLABLE-INSTANCE (those classes with
207 ;;; slots which are funcallable) and EXTENDED-SEQUUENCE (non-LIST
208 ;;; non-VECTOR classes which are also sequences). These special cases
209 ;;; are the ones that aren't really discussed by Baker in his
210 ;;; "Decision Procedure for SUBTYPEP" paper.
211 (defstruct (named-type (:include ctype
212 (class-info (type-class-or-lose 'named)))
214 (name nil :type symbol))
216 ;;; a list of all the float "formats" (i.e. internal representations;
217 ;;; nothing to do with #'FORMAT), in order of decreasing precision
218 (eval-when (:compile-toplevel :load-toplevel :execute)
219 (defparameter *float-formats*
220 '(long-float double-float single-float short-float)))
222 ;;; The type of a float format.
223 (deftype float-format () `(member ,@*float-formats*))
225 ;;; A NUMERIC-TYPE represents any numeric type, including things
227 (defstruct (numeric-type (:include ctype
228 (class-info (type-class-or-lose 'number)))
229 (:constructor %make-numeric-type)
231 ;; the kind of numeric type we have, or NIL if not specified (just
232 ;; NUMBER or COMPLEX)
234 ;; KLUDGE: A slot named CLASS for a non-CLASS value is bad.
235 ;; Especially when a CLASS value *is* stored in another slot (called
236 ;; CLASS-INFO:-). Perhaps this should be called CLASS-NAME? Also
237 ;; weird that comment above says "Numeric-Type is used to represent
238 ;; all numeric types" but this slot doesn't allow COMPLEX as an
239 ;; option.. how does this fall into "not specified" NIL case above?
240 ;; Perhaps someday we can switch to CLOS and make NUMERIC-TYPE
241 ;; be an abstract base class and INTEGER-TYPE, RATIONAL-TYPE, and
242 ;; whatnot be concrete subclasses..
243 (class nil :type (member integer rational float nil) :read-only t)
244 ;; "format" for a float type (i.e. type specifier for a CPU
245 ;; representation of floating point, e.g. 'SINGLE-FLOAT -- nothing
246 ;; to do with #'FORMAT), or NIL if not specified or not a float.
247 ;; Formats which don't exist in a given implementation don't appear
249 (format nil :type (or float-format null) :read-only t)
250 ;; Is this a complex numeric type? Null if unknown (only in NUMBER).
252 ;; FIXME: I'm bewildered by FOO-P names for things not intended to
253 ;; interpreted as truth values. Perhaps rename this COMPLEXNESS?
254 (complexp :real :type (member :real :complex nil) :read-only t)
255 ;; The upper and lower bounds on the value, or NIL if there is no
256 ;; bound. If a list of a number, the bound is exclusive. Integer
257 ;; types never have exclusive bounds, i.e. they may have them on
258 ;; input, but they're canonicalized to inclusive bounds before we
260 (low nil :type (or number cons null) :read-only t)
261 (high nil :type (or number cons null) :read-only t))
263 ;;; Impose canonicalization rules for NUMERIC-TYPE. Note that in some
264 ;;; cases, despite the name, we return *EMPTY-TYPE* instead of a
266 (defun make-numeric-type (&key class format (complexp :real) low high
268 ;; if interval is empty
271 (if (or (consp low) (consp high)) ; if either bound is exclusive
272 (>= (type-bound-number low) (type-bound-number high))
275 (multiple-value-bind (canonical-low canonical-high)
278 ;; INTEGER types always have their LOW and HIGH bounds
279 ;; represented as inclusive, not exclusive values.
280 (values (if (consp low)
281 (1+ (type-bound-number low))
284 (1- (type-bound-number high))
287 ;; no canonicalization necessary
289 (when (and (eq class 'rational)
290 (integerp canonical-low)
291 (integerp canonical-high)
292 (= canonical-low canonical-high))
293 (setf class 'integer))
294 (%make-numeric-type :class class
299 :enumerable enumerable))))
301 (defun modified-numeric-type (base
303 (class (numeric-type-class base))
304 (format (numeric-type-format base))
305 (complexp (numeric-type-complexp base))
306 (low (numeric-type-low base))
307 (high (numeric-type-high base))
308 (enumerable (numeric-type-enumerable base)))
309 (make-numeric-type :class class
314 :enumerable enumerable))
316 (defstruct (character-set-type
318 (class-info (type-class-or-lose 'character-set)))
319 (:constructor %make-character-set-type)
321 (pairs (missing-arg) :type list :read-only t))
322 (defun make-character-set-type (&key pairs)
323 ; (aver (equal (mapcar #'car pairs)
324 ; (sort (mapcar #'car pairs) #'<)))
325 ;; aver that the cars of the list elements are sorted into increasing order
326 (aver (or (null pairs)
327 (do ((p pairs (cdr p)))
329 (when (> (caar p) (caadr p)) (return nil)))))
330 (let ((pairs (let (result)
331 (do ((pairs pairs (cdr pairs)))
332 ((null pairs) (nreverse result))
333 (destructuring-bind (low . high) (car pairs)
334 (loop for (low1 . high1) in (cdr pairs)
335 if (<= low1 (1+ high))
336 do (progn (setf high (max high high1))
337 (setf pairs (cdr pairs)))
338 else do (return nil))
340 ((>= low sb!xc:char-code-limit))
342 (t (push (cons (max 0 low)
343 (min high (1- sb!xc:char-code-limit)))
347 (%make-character-set-type :pairs pairs))))
349 ;;; An ARRAY-TYPE is used to represent any array type, including
350 ;;; things such as SIMPLE-BASE-STRING.
351 (defstruct (array-type (:include ctype
352 (class-info (type-class-or-lose 'array)))
353 (:constructor %make-array-type)
355 ;; the dimensions of the array, or * if unspecified. If a dimension
356 ;; is unspecified, it is *.
357 (dimensions '* :type (or list (member *)))
358 ;; Is this not a simple array type? (:MAYBE means that we don't know.)
359 (complexp :maybe :type (member t nil :maybe))
360 ;; the element type as originally specified
361 (element-type (missing-arg) :type ctype)
362 ;; the element type as it is specialized in this implementation
363 (specialized-element-type *wild-type* :type ctype))
364 (define-cached-synonym make-array-type)
366 ;;; A MEMBER-TYPE represent a use of the MEMBER type specifier. We
367 ;;; bother with this at this level because MEMBER types are fairly
368 ;;; important and union and intersection are well defined.
369 (defstruct (member-type (:include ctype
370 (class-info (type-class-or-lose 'member))
373 (:constructor %make-member-type (xset fp-zeroes))
374 #-sb-xc-host (:pure nil))
375 (xset (missing-arg) :type xset)
376 (fp-zeroes (missing-arg) :type list))
377 (defun make-member-type (&key xset fp-zeroes members)
379 (aver (not fp-zeroes))
380 (setf xset (alloc-xset))
381 (dolist (elt members)
383 (pushnew elt fp-zeroes)
384 (add-to-xset elt xset))))
385 ;; if we have a pair of zeros (e.g. 0.0d0 and -0.0d0), then we can
386 ;; canonicalize to (DOUBLE-FLOAT 0.0d0 0.0d0), because numeric
387 ;; ranges are compared by arithmetic operators (while MEMBERship is
388 ;; compared by EQL). -- CSR, 2003-04-23
391 (do ((tail (cdr fp-zeroes) (cdr tail))
392 (zero (car fp-zeroes) (car tail)))
395 `(let ((neg (neg-fp-zero zero)))
396 (if (member neg tail)
397 (push (ctype-of ,c) union-types)
398 (push zero unpaired)))))
400 (single-float (frob 0.0f0))
401 (double-float (frob 0.0d0))
403 (long-float (frob 0.0l0)))))
404 ;; The actual member-type contains the XSET (with no FP zeroes),
405 ;; and a list of unpaired zeroes.
406 (let ((member-type (unless (and (xset-empty-p xset) (not unpaired))
407 (%make-member-type xset unpaired))))
409 (make-union-type t (if member-type
410 (cons member-type union-types)
417 (defun member-type-size (type)
418 (+ (length (member-type-fp-zeroes type))
419 (xset-count (member-type-xset type))))
421 (defun member-type-member-p (x type)
423 (and (member x (member-type-fp-zeroes type)) t)
424 (xset-member-p x (member-type-xset type))))
426 (defun mapcar-member-type-members (function type)
427 (declare (function function))
429 (map-xset (lambda (x)
430 (results (funcall function x)))
431 (member-type-xset type))
432 (dolist (zero (member-type-fp-zeroes type))
433 (results (funcall function zero)))
436 (defun mapc-member-type-members (function type)
437 (declare (function function))
438 (map-xset function (member-type-xset type))
439 (dolist (zero (member-type-fp-zeroes type))
440 (funcall function zero)))
442 (defun member-type-members (type)
443 (append (member-type-fp-zeroes type)
444 (xset-members (member-type-xset type))))
446 ;;; A COMPOUND-TYPE is a type defined out of a set of types, the
447 ;;; common parent of UNION-TYPE and INTERSECTION-TYPE.
448 (defstruct (compound-type (:include ctype
449 (might-contain-other-types-p t))
452 (types nil :type list :read-only t))
454 ;;; A UNION-TYPE represents a use of the OR type specifier which we
455 ;;; couldn't canonicalize to something simpler. Canonical form:
456 ;;; 1. All possible pairwise simplifications (using the UNION2 type
457 ;;; methods) have been performed. Thus e.g. there is never more
458 ;;; than one MEMBER-TYPE component. FIXME: As of sbcl-0.6.11.13,
459 ;;; this hadn't been fully implemented yet.
460 ;;; 2. There are never any UNION-TYPE components.
461 (defstruct (union-type (:include compound-type
462 (class-info (type-class-or-lose 'union)))
463 (:constructor %make-union-type (enumerable types))
465 (define-cached-synonym make-union-type)
467 ;;; An INTERSECTION-TYPE represents a use of the AND type specifier
468 ;;; which we couldn't canonicalize to something simpler. Canonical form:
469 ;;; 1. All possible pairwise simplifications (using the INTERSECTION2
470 ;;; type methods) have been performed. Thus e.g. there is never more
471 ;;; than one MEMBER-TYPE component.
472 ;;; 2. There are never any INTERSECTION-TYPE components: we've
473 ;;; flattened everything into a single INTERSECTION-TYPE object.
474 ;;; 3. There are never any UNION-TYPE components. Either we should
475 ;;; use the distributive rule to rearrange things so that
476 ;;; unions contain intersections and not vice versa, or we
477 ;;; should just punt to using a HAIRY-TYPE.
478 (defstruct (intersection-type (:include compound-type
479 (class-info (type-class-or-lose
481 (:constructor %make-intersection-type
485 ;;; Return TYPE converted to canonical form for a situation where the
486 ;;; "type" '* (which SBCL still represents as a type even though ANSI
487 ;;; CL defines it as a related but different kind of placeholder) is
488 ;;; equivalent to type T.
489 (defun type-*-to-t (type)
490 (if (type= type *wild-type*)
494 ;;; A CONS-TYPE is used to represent a CONS type.
495 (defstruct (cons-type (:include ctype (class-info (type-class-or-lose 'cons)))
497 %make-cons-type (car-type
500 ;; the CAR and CDR element types (to support ANSI (CONS FOO BAR) types)
502 ;; FIXME: Most or all other type structure slots could also be :READ-ONLY.
503 (car-type (missing-arg) :type ctype :read-only t)
504 (cdr-type (missing-arg) :type ctype :read-only t))
505 (defun make-cons-type (car-type cdr-type)
506 (aver (not (or (eq car-type *wild-type*)
507 (eq cdr-type *wild-type*))))
508 (if (or (eq car-type *empty-type*)
509 (eq cdr-type *empty-type*))
511 (%make-cons-type car-type cdr-type)))
513 (defun cons-type-length-info (type)
514 (declare (type cons-type type))
515 (do ((min 1 (1+ min))
516 (cdr (cons-type-cdr-type type) (cons-type-cdr-type cdr)))
517 ((not (cons-type-p cdr))
519 ((csubtypep cdr (specifier-type 'null))
521 ((csubtypep *universal-type* cdr)
523 ((type/= (type-intersection (specifier-type 'cons) cdr) *empty-type*)
525 ((type/= (type-intersection (specifier-type 'null) cdr) *empty-type*)
527 (t (values min :maybe))))
533 ;;; Return the type structure corresponding to a type specifier. We
534 ;;; pick off structure types as a special case.
536 ;;; Note: VALUES-SPECIFIER-TYPE-CACHE-CLEAR must be called whenever a
537 ;;; type is defined (or redefined).
538 (defun-cached (values-specifier-type
539 :hash-function (lambda (x)
540 (logand (sxhash x) #x3FF))
542 :init-wrapper !cold-init-forms)
543 ((orig equal-but-no-car-recursion))
544 (let ((u (uncross orig)))
545 (or (info :type :builtin u)
546 (let ((spec (typexpand u)))
548 ((and (not (eq spec u))
549 (info :type :builtin spec)))
550 ((eq (info :type :kind spec) :instance)
551 (find-classoid spec))
552 ((typep spec 'classoid)
553 (if (typep spec 'built-in-classoid)
554 (or (built-in-classoid-translation spec) spec)
557 (when (and (atom spec)
558 (member spec '(and or not member eql satisfies values)))
559 (error "The symbol ~S is not valid as a type specifier." spec))
560 (let* ((lspec (if (atom spec) (list spec) spec))
561 (fun (info :type :translator (car lspec))))
564 ((or (and (consp spec) (symbolp (car spec))
565 (not (info :type :builtin (car spec))))
566 (and (symbolp spec) (not (info :type :builtin spec))))
567 (when (and *type-system-initialized*
568 (not (eq (info :type :kind spec)
569 :forthcoming-defclass-type)))
570 (signal 'parse-unknown-type :specifier spec))
571 ;; (The RETURN-FROM here inhibits caching; this
572 ;; does not only make sense from a compiler
573 ;; diagnostics point of view but is also
574 ;; indispensable for proper workingness of
575 ;; VALID-TYPE-SPECIFIER-P.)
576 (return-from values-specifier-type
577 (make-unknown-type :specifier spec)))
579 (error "bad thing to be a type specifier: ~S"
582 ;;; This is like VALUES-SPECIFIER-TYPE, except that we guarantee to
583 ;;; never return a VALUES type.
584 (defun specifier-type (x)
585 (let ((res (values-specifier-type x)))
586 (when (or (values-type-p res)
587 ;; bootstrap magic :-(
588 (and (named-type-p res)
589 (eq (named-type-name res) '*)))
590 (error "VALUES type illegal in this context:~% ~S" x))
593 (defun single-value-specifier-type (x)
598 (defun typexpand-1 (type-specifier &optional env)
600 "Takes and expands a type specifier once like MACROEXPAND-1.
601 Returns two values: the expansion, and a boolean that is true when
603 (declare (type type-specifier type-specifier))
604 (declare (ignore env))
605 (multiple-value-bind (expander lspec)
606 (let ((spec type-specifier))
607 (cond ((and (symbolp spec) (info :type :builtin spec))
608 ;; We do not expand builtins even though it'd be
609 ;; possible to do so sometimes (e.g. STRING) for two
612 ;; a) From a user's point of view, CL types are opaque.
614 ;; b) so (EQUAL (TYPEXPAND 'STRING) (TYPEXPAND-ALL 'STRING))
617 (values (info :type :expander spec) (list spec)))
618 ((and (consp spec) (symbolp (car spec)))
619 (values (info :type :expander (car spec)) spec))
622 (values (funcall expander lspec) t)
623 (values type-specifier nil))))
625 (defun typexpand (type-specifier &optional env)
627 "Takes and expands a type specifier repeatedly like MACROEXPAND.
628 Returns two values: the expansion, and a boolean that is true when
630 (declare (type type-specifier type-specifier))
631 (multiple-value-bind (expansion flag)
632 (typexpand-1 type-specifier env)
634 (values (typexpand expansion env) t)
635 (values expansion flag))))
637 (defun typexpand-all (type-specifier &optional env)
639 "Takes and expands a type specifier recursively like MACROEXPAND-ALL."
640 (declare (type type-specifier type-specifier))
641 (declare (ignore env))
642 ;; I first thought this would not be a good implementation because
643 ;; it signals an error on e.g. (CONS 1 2) until I realized that
644 ;; walking and calling TYPEXPAND would also result in errors, and
645 ;; it actually makes sense.
647 ;; There's still a small problem in that
648 ;; (TYPEXPAND-ALL '(CONS * FIXNUM)) => (CONS T FIXNUM)
649 ;; whereas walking+typexpand would result in (CONS * FIXNUM).
651 ;; Similiarly, (TYPEXPAND-ALL '(FUNCTION (&REST T) *)) => FUNCTION.
652 (type-specifier (values-specifier-type type-specifier)))
654 (defun defined-type-name-p (name &optional env)
656 "Returns T if NAME is known to name a type specifier, otherwise NIL."
657 (declare (symbol name))
658 (declare (ignore env))
659 (and (info :type :kind name) t))
661 (defun valid-type-specifier-p (type-specifier &optional env)
663 "Returns T if TYPE-SPECIFIER is a valid type specifier, otherwise NIL.
665 There may be different metrics on what constitutes a \"valid type
666 specifier\" depending on context. If this function does not suit your
667 exact need, you may be able to craft a particular solution using a
668 combination of DEFINED-TYPE-NAME-P and the TYPEXPAND functions.
670 The definition of \"valid type specifier\" employed by this function
671 is based on the following mnemonic:
673 \"Would TYPEP accept it as second argument?\"
675 Except that unlike TYPEP, this function fully supports compound
676 FUNCTION type specifiers, and the VALUES type specifier, too.
678 In particular, VALID-TYPE-SPECIFIER-P will return NIL if
679 TYPE-SPECIFIER is not a class, not a symbol that is known to name a
680 type specifier, and not a cons that represents a known compound type
681 specifier in a syntactically and recursively correct way.
685 (valid-type-specifier-p '(cons * *)) => T
686 (valid-type-specifier-p '#:foo) => NIL
687 (valid-type-specifier-p '(cons * #:foo)) => NIL
688 (valid-type-specifier-p '(cons 1 *) => NIL
691 (declare (ignore env))
692 (handler-case (prog1 t (values-specifier-type type-specifier))
693 (parse-unknown-type () nil)
696 ;;; Note that the type NAME has been (re)defined, updating the
697 ;;; undefined warnings and VALUES-SPECIFIER-TYPE cache.
698 (defun %note-type-defined (name)
699 (declare (symbol name))
700 (note-name-defined name :type)
701 (when (boundp 'sb!kernel::*values-specifier-type-cache-vector*)
702 (values-specifier-type-cache-clear))
706 (!defun-from-collected-cold-init-forms !early-type-cold-init)