1 ;;;; This file contains structures and functions for the maintenance of
2 ;;;; basic information about defined types. Different object systems
3 ;;;; can be supported simultaneously.
5 ;;;; This software is part of the SBCL system. See the README file for
8 ;;;; This software is derived from the CMU CL system, which was
9 ;;;; written at Carnegie Mellon University and released into the
10 ;;;; public domain. The software is in the public domain and is
11 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
12 ;;;; files for more information.
14 (in-package "SB!KERNEL")
16 (!begin-collecting-cold-init-forms)
18 ;;;; the CLASSOID structure
20 ;;; The CLASSOID structure is a supertype of all classoid types. A
21 ;;; CLASSOID is also a CTYPE structure as recognized by the type
22 ;;; system. (FIXME: It's also a type specifier, though this might go
23 ;;; away as with the merger of SB-PCL:CLASS and CL:CLASS it's no
26 (:make-load-form-fun classoid-make-load-form-fun)
28 (class-info (type-class-or-lose 'classoid)))
30 #-no-ansi-print-object
32 (lambda (class stream)
33 (let ((name (classoid-name class)))
34 (print-unreadable-object (class stream
38 ;; FIXME: Make sure that this prints
39 ;; reasonably for anonymous classes.
40 "~:[anonymous~;~:*~S~]~@[ (~(~A~))~]"
42 (classoid-state class))))))
43 #-sb-xc-host (:pure nil))
44 ;; the value to be returned by CLASSOID-NAME.
45 (name nil :type symbol)
46 ;; the current layout for this class, or NIL if none assigned yet
47 (layout nil :type (or layout null))
48 ;; How sure are we that this class won't be redefined?
49 ;; :READ-ONLY = We are committed to not changing the effective
50 ;; slots or superclasses.
51 ;; :SEALED = We can't even add subclasses.
52 ;; NIL = Anything could happen.
53 (state nil :type (member nil :read-only :sealed))
54 ;; direct superclasses of this class
55 (direct-superclasses () :type list)
56 ;; representation of all of the subclasses (direct or indirect) of
57 ;; this class. This is NIL if no subclasses or not initalized yet;
58 ;; otherwise, it's an EQ hash-table mapping CLASSOID objects to the
59 ;; subclass layout that was in effect at the time the subclass was
61 (subclasses nil :type (or null hash-table))
62 ;; the PCL class (= CL:CLASS, but with a view to future flexibility
63 ;; we don't just call it the CLASS slot) object for this class, or
64 ;; NIL if none assigned yet
67 (defun classoid-make-load-form-fun (class)
68 (/show "entering CLASSOID-MAKE-LOAD-FORM-FUN" class)
69 (let ((name (classoid-name class)))
70 (unless (and name (eq (find-classoid name nil) class))
71 (/show "anonymous/undefined class case")
72 (error "can't use anonymous or undefined class as constant:~% ~S"
75 ;; KLUDGE: There's a FIND-CLASSOID DEFTRANSFORM for constant
76 ;; class names which creates fast but non-cold-loadable,
77 ;; non-compact code. In this context, we'd rather have compact,
78 ;; cold-loadable code. -- WHN 19990928
79 (declare (notinline find-classoid))
80 (find-classoid ',name))))
82 ;;;; basic LAYOUT stuff
84 ;;; Note: This bound is set somewhat less than MOST-POSITIVE-FIXNUM
85 ;;; in order to guarantee that several hash values can be added without
86 ;;; overflowing into a bignum.
87 (def!constant layout-clos-hash-max (ash most-positive-fixnum -3)
89 "the inclusive upper bound on LAYOUT-CLOS-HASH values")
91 ;;; a list of conses, initialized by genesis
93 ;;; In each cons, the car is the symbol naming the layout, and the
94 ;;; cdr is the layout itself.
95 (defvar *!initial-layouts*)
97 ;;; a table mapping class names to layouts for classes we have
98 ;;; referenced but not yet loaded. This is initialized from an alist
99 ;;; created by genesis describing the layouts that genesis created at
101 (defvar *forward-referenced-layouts*)
103 (setq *forward-referenced-layouts* (make-hash-table :test 'equal))
105 (/show0 "processing *!INITIAL-LAYOUTS*")
106 (dolist (x *!initial-layouts*)
107 (setf (gethash (car x) *forward-referenced-layouts*)
109 (/show0 "done processing *!INITIAL-LAYOUTS*")))
111 ;;; The LAYOUT structure is pointed to by the first cell of instance
112 ;;; (or structure) objects. It represents what we need to know for
113 ;;; type checking and garbage collection. Whenever a class is
114 ;;; incompatibly redefined, a new layout is allocated. If two object's
115 ;;; layouts are EQ, then they are exactly the same type.
117 ;;; KLUDGE: The genesis code has raw offsets of slots in this
118 ;;; structure hardwired into it. It would be good to rewrite that code
119 ;;; so that it looks up those offsets in the compiler's tables, but
120 ;;; for now if you change this structure, lucky you, you get to grovel
121 ;;; over the genesis code by hand.:-( -- WHN 19990820
123 ;; KLUDGE: A special hack keeps this from being
124 ;; called when building code for the
125 ;; cross-compiler. See comments at the DEFUN for
126 ;; this. -- WHN 19990914
127 (:make-load-form-fun #-sb-xc-host ignore-it
128 ;; KLUDGE: DEF!STRUCT at #+SB-XC-HOST
129 ;; time controls both the
130 ;; build-the-cross-compiler behavior
131 ;; and the run-the-cross-compiler
132 ;; behavior. The value below only
133 ;; works for build-the-cross-compiler.
134 ;; There's a special hack in
135 ;; EMIT-MAKE-LOAD-FORM which gives
136 ;; effectively IGNORE-IT behavior for
137 ;; LAYOUT at run-the-cross-compiler
138 ;; time. It would be cleaner to
139 ;; actually have an IGNORE-IT value
140 ;; stored, but it's hard to see how to
141 ;; do that concisely with the current
142 ;; DEF!STRUCT setup. -- WHN 19990930
144 make-load-form-for-layout))
145 ;; hash bits which should be set to constant pseudo-random values
146 ;; for use by CLOS. Sleazily accessed via %INSTANCE-REF, see
149 ;; FIXME: We should get our story straight on what the type of these
150 ;; values is. (declared INDEX here, described as <=
151 ;; LAYOUT-CLOS-HASH-MAX by the doc string of that constant,
152 ;; generated as strictly positive in RANDOM-LAYOUT-CLOS-HASH..)
154 ;; KLUDGE: The fact that the slots here start at offset 1 is known
155 ;; to the LAYOUT-CLOS-HASH function and to the LAYOUT-dumping code
157 (clos-hash-0 (random-layout-clos-hash) :type index)
158 (clos-hash-1 (random-layout-clos-hash) :type index)
159 (clos-hash-2 (random-layout-clos-hash) :type index)
160 (clos-hash-3 (random-layout-clos-hash) :type index)
161 (clos-hash-4 (random-layout-clos-hash) :type index)
162 (clos-hash-5 (random-layout-clos-hash) :type index)
163 (clos-hash-6 (random-layout-clos-hash) :type index)
164 (clos-hash-7 (random-layout-clos-hash) :type index)
165 ;; the class that this is a layout for
166 (classoid (missing-arg) :type classoid)
167 ;; The value of this slot can be:
168 ;; * :UNINITIALIZED if not initialized yet;
169 ;; * NIL if this is the up-to-date layout for a class; or
170 ;; * T if this layout has been invalidated (by being replaced by
171 ;; a new, more-up-to-date LAYOUT).
172 ;; * something else (probably a list) if the class is a PCL wrapper
173 ;; and PCL has made it invalid and made a note to itself about it
174 (invalid :uninitialized :type (or cons (member nil t :uninitialized)))
175 ;; the layouts for all classes we inherit. If hierarchical, i.e. if
176 ;; DEPTHOID >= 0, then these are ordered by ORDER-LAYOUT-INHERITS,
177 ;; so that each inherited layout appears at its expected depth,
178 ;; i.e. at its LAYOUT-DEPTHOID value.
180 ;; Remaining elements are filled by the non-hierarchical layouts or,
181 ;; if they would otherwise be empty, by copies of succeeding layouts.
182 (inherits #() :type simple-vector)
183 ;; If inheritance is not hierarchical, this is -1. If inheritance is
184 ;; hierarchical, this is the inheritance depth, i.e. (LENGTH INHERITS).
186 ;; (1) This turns out to be a handy encoding for arithmetically
187 ;; comparing deepness; it is generally useful to do a bare numeric
188 ;; comparison of these depthoid values, and we hardly ever need to
189 ;; test whether the values are negative or not.
190 ;; (2) This was called INHERITANCE-DEPTH in classic CMU CL. It was
191 ;; renamed because some of us find it confusing to call something
192 ;; a depth when it isn't quite.
193 (depthoid -1 :type layout-depthoid)
194 ;; the number of top level descriptor cells in each instance
195 (length 0 :type index)
196 ;; If this layout has some kind of compiler meta-info, then this is
197 ;; it. If a structure, then we store the DEFSTRUCT-DESCRIPTION here.
199 ;; This is true if objects of this class are never modified to
200 ;; contain dynamic pointers in their slots or constant-like
201 ;; substructure (and hence can be copied into read-only space by
204 ;; KLUDGE: This slot is known to the C runtime support code.
205 (pure nil :type (member t nil 0)))
207 (def!method print-object ((layout layout) stream)
208 (print-unreadable-object (layout stream :type t :identity t)
210 "for ~S~@[, INVALID=~S~]"
211 (layout-proper-name layout)
212 (layout-invalid layout))))
214 (eval-when (:compile-toplevel :load-toplevel :execute)
215 (defun layout-proper-name (layout)
216 (classoid-proper-name (layout-classoid layout))))
218 ;;;; support for the hash values used by CLOS when working with LAYOUTs
220 (def!constant layout-clos-hash-length 8)
221 #!-sb-fluid (declaim (inline layout-clos-hash))
222 (defun layout-clos-hash (layout i)
223 ;; FIXME: Either this I should be declared to be `(MOD
224 ;; ,LAYOUT-CLOS-HASH-LENGTH), or this is used in some inner loop
225 ;; where we can't afford to check that kind of thing and therefore
226 ;; should have some insane level of optimization. (This is true both
227 ;; of this function and of the SETF function below.)
228 (declare (type layout layout) (type index i))
229 ;; FIXME: LAYOUT slots should have type `(MOD ,LAYOUT-CLOS-HASH-MAX),
231 (truly-the index (%instance-ref layout (1+ i))))
232 #!-sb-fluid (declaim (inline (setf layout-clos-hash)))
233 (defun (setf layout-clos-hash) (new-value layout i)
234 (declare (type layout layout) (type index new-value i))
235 (setf (%instance-ref layout (1+ i)) new-value))
237 ;;; a generator for random values suitable for the CLOS-HASH slots of
238 ;;; LAYOUTs. We use our own RANDOM-STATE here because we'd like
239 ;;; pseudo-random values to come the same way in the target even when
240 ;;; we make minor changes to the system, in order to reduce the
241 ;;; mysteriousness of possible CLOS bugs.
242 (defvar *layout-clos-hash-random-state*)
243 (defun random-layout-clos-hash ()
244 ;; FIXME: I'm not sure why this expression is (1+ (RANDOM FOO)),
245 ;; returning a strictly positive value. I copied it verbatim from
246 ;; CMU CL INITIALIZE-LAYOUT-HASH, so presumably it works, but I
247 ;; dunno whether the hash values are really supposed to be 1-based.
248 ;; They're declared as INDEX.. Or is this a hack to try to avoid
249 ;; having to use bignum arithmetic? Or what? An explanation would be
251 (1+ (random layout-clos-hash-max
252 (if (boundp '*layout-clos-hash-random-state*)
253 *layout-clos-hash-random-state*
254 (setf *layout-clos-hash-random-state*
255 (make-random-state))))))
257 ;;; If we can't find any existing layout, then we create a new one
258 ;;; storing it in *FORWARD-REFERENCED-LAYOUTS*. In classic CMU CL, we
259 ;;; used to immediately check for compatibility, but for
260 ;;; cross-compilability reasons (i.e. convenience of using this
261 ;;; function in a MAKE-LOAD-FORM expression) that functionality has
262 ;;; been split off into INIT-OR-CHECK-LAYOUT.
263 (declaim (ftype (function (symbol) layout) find-layout))
264 (defun find-layout (name)
265 (let ((classoid (find-classoid name nil)))
266 (or (and classoid (classoid-layout classoid))
267 (gethash name *forward-referenced-layouts*)
268 (setf (gethash name *forward-referenced-layouts*)
269 (make-layout :classoid (or classoid
270 (make-undefined-classoid name)))))))
272 ;;; If LAYOUT is uninitialized, initialize it with CLASSOID, LENGTH,
273 ;;; INHERITS, and DEPTHOID, otherwise require that it be consistent
274 ;;; with CLASSOID, LENGTH, INHERITS, and DEPTHOID.
276 ;;; UNDEFINED-CLASS values are interpreted specially as "we don't know
277 ;;; anything about the class", so if LAYOUT is initialized, any
278 ;;; preexisting class slot value is OK, and if it's not initialized,
279 ;;; its class slot value is set to an UNDEFINED-CLASS. -- FIXME: This
280 ;;; is no longer true, :UNINITIALIZED used instead.
281 (declaim (ftype (function (layout classoid index simple-vector layout-depthoid)
283 init-or-check-layout))
284 (defun init-or-check-layout (layout classoid length inherits depthoid)
285 (cond ((eq (layout-invalid layout) :uninitialized)
286 ;; There was no layout before, we just created one which
287 ;; we'll now initialize with our information.
288 (setf (layout-length layout) length
289 (layout-inherits layout) inherits
290 (layout-depthoid layout) depthoid
291 (layout-classoid layout) classoid
292 (layout-invalid layout) nil))
293 ;; FIXME: Now that LAYOUTs are born :UNINITIALIZED, maybe this
294 ;; clause is not needed?
295 ((not *type-system-initialized*)
296 (setf (layout-classoid layout) classoid))
298 ;; There was an old layout already initialized with old
299 ;; information, and we'll now check that old information
300 ;; which was known with certainty is consistent with current
301 ;; information which is known with certainty.
302 (check-layout layout classoid length inherits depthoid)))
305 ;;; In code for the target Lisp, we don't use dump LAYOUTs using the
306 ;;; standard load form mechanism, we use special fops instead, in
307 ;;; order to make cold load come out right. But when we're building
308 ;;; the cross-compiler, we can't do that because we don't have access
309 ;;; to special non-ANSI low-level things like special fops, and we
310 ;;; don't need to do that anyway because our code isn't going to be
311 ;;; cold loaded, so we use the ordinary load form system.
313 ;;; KLUDGE: A special hack causes this not to be called when we are
314 ;;; building code for the target Lisp. It would be tidier to just not
315 ;;; have it in place when we're building the target Lisp, but it
316 ;;; wasn't clear how to do that without rethinking DEF!STRUCT quite a
317 ;;; bit, so I punted. -- WHN 19990914
319 (defun make-load-form-for-layout (layout &optional env)
320 (declare (type layout layout))
321 (declare (ignore env))
322 (when (layout-invalid layout)
323 (compiler-error "can't dump reference to obsolete class: ~S"
324 (layout-classoid layout)))
325 (let ((name (classoid-name (layout-classoid layout))))
327 (compiler-error "can't dump anonymous LAYOUT: ~S" layout))
328 ;; Since LAYOUT refers to a class which refers back to the LAYOUT,
329 ;; we have to do this in two stages, like the TREE-WITH-PARENT
330 ;; example in the MAKE-LOAD-FORM entry in the ANSI spec.
332 ;; "creation" form (which actually doesn't create a new LAYOUT if
333 ;; there's a preexisting one with this name)
334 `(find-layout ',name)
335 ;; "initialization" form (which actually doesn't initialize
336 ;; preexisting LAYOUTs, just checks that they're consistent).
337 `(init-or-check-layout ',layout
338 ',(layout-classoid layout)
339 ',(layout-length layout)
340 ',(layout-inherits layout)
341 ',(layout-depthoid layout)))))
343 ;;; If LAYOUT's slot values differ from the specified slot values in
344 ;;; any interesting way, then give a warning and return T.
345 (declaim (ftype (function (simple-string
351 redefine-layout-warning))
352 (defun redefine-layout-warning (old-context old-layout
353 context length inherits depthoid)
354 (declare (type layout old-layout) (type simple-string old-context context))
355 (let ((name (layout-proper-name old-layout)))
356 (or (let ((old-inherits (layout-inherits old-layout)))
357 (or (when (mismatch old-inherits
359 :key #'layout-proper-name)
360 (warn "change in superclasses of class ~S:~% ~
361 ~A superclasses: ~S~% ~
365 (map 'list #'layout-proper-name old-inherits)
367 (map 'list #'layout-proper-name inherits))
369 (let ((diff (mismatch old-inherits inherits)))
373 ~:(~A~) definition of superclass ~S is incompatible with~% ~
377 (layout-proper-name (svref old-inherits diff))
380 (let ((old-length (layout-length old-layout)))
381 (unless (= old-length length)
382 (warn "change in instance length of class ~S:~% ~
386 old-context old-length
389 (unless (= (layout-depthoid old-layout) depthoid)
390 (warn "change in the inheritance structure of class ~S~% ~
391 between the ~A definition and the ~A definition"
392 name old-context context)
395 ;;; Require that LAYOUT data be consistent with CLASS, LENGTH,
396 ;;; INHERITS, and DEPTHOID.
397 (declaim (ftype (function
398 (layout classoid index simple-vector layout-depthoid))
400 (defun check-layout (layout classoid length inherits depthoid)
401 (aver (eq (layout-classoid layout) classoid))
402 (when (redefine-layout-warning "current" layout
403 "compile time" length inherits depthoid)
404 ;; Classic CMU CL had more options here. There are several reasons
405 ;; why they might want more options which are less appropriate for
406 ;; us: (1) It's hard to fit the classic CMU CL flexible approach
407 ;; into the ANSI-style MAKE-LOAD-FORM system, and having a
408 ;; non-MAKE-LOAD-FORM-style system is painful when we're trying to
409 ;; make the cross-compiler run under vanilla ANSI Common Lisp. (2)
410 ;; We have CLOS now, and if you want to be able to flexibly
411 ;; redefine classes without restarting the system, it'd make sense
412 ;; to use that, so supporting complexity in order to allow
413 ;; modifying DEFSTRUCTs without restarting the system is a low
414 ;; priority. (3) We now have the ability to rebuild the SBCL
415 ;; system from scratch, so we no longer need this functionality in
416 ;; order to maintain the SBCL system by modifying running images.
417 (error "The class ~S was not changed, and there's no guarantee that~@
418 the loaded code (which expected another layout) will work."
419 (layout-proper-name layout)))
422 ;;; a common idiom (the same as CMU CL FIND-LAYOUT) rolled up into a
423 ;;; single function call
425 ;;; Used by the loader to forward-reference layouts for classes whose
426 ;;; definitions may not have been loaded yet. This allows type tests
427 ;;; to be loaded when the type definition hasn't been loaded yet.
428 (declaim (ftype (function (symbol index simple-vector layout-depthoid) layout)
429 find-and-init-or-check-layout))
430 (defun find-and-init-or-check-layout (name length inherits depthoid)
431 (let ((layout (find-layout name)))
432 (init-or-check-layout layout
433 (or (find-classoid name nil)
434 (make-undefined-classoid name))
439 ;;; Record LAYOUT as the layout for its class, adding it as a subtype
440 ;;; of all superclasses. This is the operation that "installs" a
441 ;;; layout for a class in the type system, clobbering any old layout.
442 ;;; However, this does not modify the class namespace; that is a
443 ;;; separate operation (think anonymous classes.)
444 ;;; -- If INVALIDATE, then all the layouts for any old definition
445 ;;; and subclasses are invalidated, and the SUBCLASSES slot is cleared.
446 ;;; -- If DESTRUCT-LAYOUT, then this is some old layout, and is to be
447 ;;; destructively modified to hold the same type information.
448 (eval-when (#-sb-xc :compile-toplevel :load-toplevel :execute)
449 (defun register-layout (layout &key (invalidate t) destruct-layout)
450 (declare (type layout layout) (type (or layout null) destruct-layout))
451 (let* ((classoid (layout-classoid layout))
452 (classoid-layout (classoid-layout classoid))
453 (subclasses (classoid-subclasses classoid)))
455 ;; Attempting to register ourselves with a temporary undefined
456 ;; class placeholder is almost certainly a programmer error. (I
457 ;; should know, I did it.) -- WHN 19990927
458 (aver (not (undefined-classoid-p classoid)))
460 ;; This assertion dates from classic CMU CL. The rationale is
461 ;; probably that calling REGISTER-LAYOUT more than once for the
462 ;; same LAYOUT is almost certainly a programmer error.
463 (aver (not (eq classoid-layout layout)))
465 ;; Figure out what classes are affected by the change, and issue
466 ;; appropriate warnings and invalidations.
467 (when classoid-layout
468 (modify-classoid classoid)
470 (dohash (subclass subclass-layout subclasses)
471 (modify-classoid subclass)
473 (invalidate-layout subclass-layout))))
475 (invalidate-layout classoid-layout)
476 (setf (classoid-subclasses classoid) nil)))
479 (setf (layout-invalid destruct-layout) nil
480 (layout-inherits destruct-layout) (layout-inherits layout)
481 (layout-depthoid destruct-layout)(layout-depthoid layout)
482 (layout-length destruct-layout) (layout-length layout)
483 (layout-info destruct-layout) (layout-info layout)
484 (classoid-layout classoid) destruct-layout)
485 (setf (layout-invalid layout) nil
486 (classoid-layout classoid) layout))
488 (let ((inherits (layout-inherits layout)))
489 (dotimes (i (length inherits)) ; FIXME: should be DOVECTOR
490 (let* ((super (layout-classoid (svref inherits i)))
491 (subclasses (or (classoid-subclasses super)
492 (setf (classoid-subclasses super)
493 (make-hash-table :test 'eq)))))
494 (when (and (eq (classoid-state super) :sealed)
495 (not (gethash classoid subclasses)))
496 (warn "unsealing sealed class ~S in order to subclass it"
497 (classoid-name super))
498 (setf (classoid-state super) :read-only))
499 (setf (gethash classoid subclasses)
500 (or destruct-layout layout))))))
505 ;;; Arrange the inherited layouts to appear at their expected depth,
506 ;;; ensuring that hierarchical type tests succeed. Layouts with
507 ;;; DEPTHOID >= 0 (i.e. hierarchical classes) are placed first,
508 ;;; at exactly that index in the INHERITS vector. Then, non-hierarchical
509 ;;; layouts are placed in remaining elements. Then, any still-empty
510 ;;; elements are filled with their successors, ensuring that each
511 ;;; element contains a valid layout.
513 ;;; This reordering may destroy CPL ordering, so the inherits should
514 ;;; not be read as being in CPL order.
515 (defun order-layout-inherits (layouts)
516 (declare (simple-vector layouts))
517 (let ((length (length layouts))
520 (let ((depth (layout-depthoid (svref layouts i))))
521 (when (> depth max-depth)
522 (setf max-depth depth))))
523 (let* ((new-length (max (1+ max-depth) length))
524 (inherits (make-array new-length)))
526 (let* ((layout (svref layouts i))
527 (depth (layout-depthoid layout)))
528 (unless (eql depth -1)
529 (let ((old-layout (svref inherits depth)))
530 (unless (or (eql old-layout 0) (eq old-layout layout))
531 (error "layout depth conflict: ~S~%" layouts)))
532 (setf (svref inherits depth) layout))))
536 (declare (type index i j))
537 (let* ((layout (svref layouts i))
538 (depth (layout-depthoid layout)))
540 (loop (when (eql (svref inherits j) 0)
543 (setf (svref inherits j) layout))))
544 (do ((i (1- new-length) (1- i)))
546 (declare (type fixnum i))
547 (when (eql (svref inherits i) 0)
548 (setf (svref inherits i) (svref inherits (1+ i)))))
551 ;;;; class precedence lists
553 ;;; Topologically sort the list of objects to meet a set of ordering
554 ;;; constraints given by pairs (A . B) constraining A to precede B.
555 ;;; When there are multiple objects to choose, the tie-breaker
556 ;;; function is called with both the list of object to choose from and
557 ;;; the reverse ordering built so far.
558 (defun topological-sort (objects constraints tie-breaker)
559 (declare (list objects constraints)
560 (function tie-breaker))
561 (let ((obj-info (make-hash-table :size (length objects)))
564 (dolist (constraint constraints)
565 (let ((obj1 (car constraint))
566 (obj2 (cdr constraint)))
567 (let ((info2 (gethash obj2 obj-info)))
570 (setf (gethash obj2 obj-info) (list 1))))
571 (let ((info1 (gethash obj1 obj-info)))
573 (push obj2 (rest info1))
574 (setf (gethash obj1 obj-info) (list 0 obj2))))))
575 (dolist (obj objects)
576 (let ((info (gethash obj obj-info)))
577 (when (or (not info) (zerop (first info)))
578 (push obj free-objs))))
580 (flet ((next-result (obj)
582 (dolist (successor (rest (gethash obj obj-info)))
583 (let* ((successor-info (gethash successor obj-info))
584 (count (1- (first successor-info))))
585 (setf (first successor-info) count)
587 (push successor free-objs))))))
588 (cond ((endp free-objs)
589 (dohash (obj info obj-info)
590 (unless (zerop (first info))
591 (error "Topological sort failed due to constraint on ~S."
593 (return (nreverse result)))
594 ((endp (rest free-objs))
595 (next-result (pop free-objs)))
597 (let ((obj (funcall tie-breaker free-objs result)))
598 (setf free-objs (remove obj free-objs))
599 (next-result obj))))))))
602 ;;; standard class precedence list computation
603 (defun std-compute-class-precedence-list (class)
606 (labels ((note-class (class)
607 (unless (member class classes)
609 (let ((superclasses (classoid-direct-superclasses class)))
611 (rest superclasses (rest rest)))
613 (let ((next (first rest)))
614 (push (cons prev next) constraints)
616 (dolist (class superclasses)
617 (note-class class)))))
618 (std-cpl-tie-breaker (free-classes rev-cpl)
619 (dolist (class rev-cpl (first free-classes))
620 (let* ((superclasses (classoid-direct-superclasses class))
621 (intersection (intersection free-classes
624 (return (first intersection)))))))
626 (topological-sort classes constraints #'std-cpl-tie-breaker))))
628 ;;;; object types to represent classes
630 ;;; An UNDEFINED-CLASSOID is a cookie we make up to stick in forward
631 ;;; referenced layouts. Users should never see them.
632 (def!struct (undefined-classoid
634 (:constructor make-undefined-classoid (name))))
636 ;;; BUILT-IN-CLASS is used to represent the standard classes that
637 ;;; aren't defined with DEFSTRUCT and other specially implemented
638 ;;; primitive types whose only attribute is their name.
640 ;;; Some BUILT-IN-CLASSes have a TRANSLATION, which means that they
641 ;;; are effectively DEFTYPE'd to some other type (usually a union of
642 ;;; other classes or a "primitive" type such as NUMBER, ARRAY, etc.)
643 ;;; This translation is done when type specifiers are parsed. Type
644 ;;; system operations (union, subtypep, etc.) should never encounter
645 ;;; translated classes, only their translation.
646 (def!struct (built-in-classoid (:include classoid)
647 (:constructor make-built-in-classoid))
648 ;; the type we translate to on parsing. If NIL, then this class
649 ;; stands on its own; or it can be set to :INITIALIZING for a period
651 (translation nil :type (or ctype (member nil :initializing))))
653 ;;; FIXME: In CMU CL, this was a class with a print function, but not
654 ;;; necessarily a structure class (e.g. CONDITIONs). In SBCL,
655 ;;; we let CLOS handle our print functions, so that is no longer needed.
656 ;;; Is there any need for this class any more?
657 (def!struct (slot-classoid (:include classoid)
660 ;;; STRUCTURE-CLASS represents what we need to know about structure
661 ;;; classes. Non-structure "typed" defstructs are a special case, and
662 ;;; don't have a corresponding class.
663 (def!struct (basic-structure-classoid (:include slot-classoid)
666 (def!struct (structure-classoid (:include basic-structure-classoid)
667 (:constructor make-structure-classoid))
668 ;; If true, a default keyword constructor for this structure.
669 (constructor nil :type (or function null)))
671 ;;; FUNCALLABLE-STRUCTURE-CLASS is used to represent funcallable
672 ;;; structures, which are used to implement generic functions.
673 (def!struct (funcallable-structure-classoid
674 (:include basic-structure-classoid)
675 (:constructor make-funcallable-structure-classoid)))
677 ;;;; classoid namespace
679 ;;; We use an indirection to allow forward referencing of class
680 ;;; definitions with load-time resolution.
681 (def!struct (classoid-cell
682 (:constructor make-classoid-cell (name &optional classoid))
683 (:make-load-form-fun (lambda (c)
685 ',(classoid-cell-name c))))
686 #-no-ansi-print-object
687 (:print-object (lambda (s stream)
688 (print-unreadable-object (s stream :type t)
689 (prin1 (classoid-cell-name s) stream)))))
690 ;; Name of class we expect to find.
691 (name nil :type symbol :read-only t)
692 ;; Class or NIL if not yet defined.
693 (classoid nil :type (or classoid null)))
694 (defun find-classoid-cell (name)
695 (or (info :type :classoid name)
696 (setf (info :type :classoid name)
697 (make-classoid-cell name))))
699 ;;; FIXME: When the system is stable, this DECLAIM FTYPE should
700 ;;; probably go away in favor of the DEFKNOWN for FIND-CLASS.
701 (declaim (ftype (function (symbol &optional t (or null sb!c::lexenv)))
703 (eval-when (#-sb-xc :compile-toplevel :load-toplevel :execute)
704 (defun find-classoid (name &optional (errorp t) environment)
706 "Return the class with the specified NAME. If ERRORP is false, then NIL is
707 returned when no such class exists."
708 (declare (type symbol name) (ignore environment))
709 (let ((res (classoid-cell-classoid (find-classoid-cell name))))
710 (if (or res (not errorp))
712 (error "class not yet defined:~% ~S" name))))
713 (defun (setf find-classoid) (new-value name)
714 #-sb-xc (declare (type classoid new-value))
715 (ecase (info :type :kind name)
717 (:forthcoming-defclass-type
718 ;; XXX Currently, nothing needs to be done in this case. Later, when
719 ;; PCL is integrated tighter into SBCL, this might need more work.
722 ;; KLUDGE: The reason these clauses aren't directly parallel is
723 ;; that we need to use the internal CLASSOID structure ourselves,
724 ;; because we don't have CLASSes to work with until PCL is built.
725 ;; In the host, CLASSes have an approximately one-to-one
726 ;; correspondence with the target CLASSOIDs (as well as with the
727 ;; target CLASSes, modulo potential differences with respect to
730 (let ((old (class-of (find-classoid name)))
731 (new (class-of new-value)))
733 (bug "trying to change the metaclass of ~S from ~S to ~S in the ~
735 name (class-name old) (class-name new))))
737 (let ((old (classoid-of (find-classoid name)))
738 (new (classoid-of new-value)))
740 (warn "changing meta-class of ~S from ~S to ~S"
741 name (classoid-name old) (classoid-name new)))))
743 (error "illegal to redefine standard type ~S" name))
745 (warn "redefining DEFTYPE type to be a class: ~S" name)
746 (setf (info :type :expander name) nil)))
748 (remhash name *forward-referenced-layouts*)
749 (%note-type-defined name)
750 (setf (info :type :kind name) :instance)
751 (setf (classoid-cell-classoid (find-classoid-cell name)) new-value)
752 (unless (eq (info :type :compiler-layout name)
753 (classoid-layout new-value))
754 (setf (info :type :compiler-layout name) (classoid-layout new-value)))
758 ;;; Called when we are about to define NAME as a class meeting some
759 ;;; predicate (such as a meta-class type test.) The first result is
760 ;;; always of the desired class. The second result is any existing
761 ;;; LAYOUT for this name.
762 (defun insured-find-classoid (name predicate constructor)
763 (declare (type function predicate constructor))
764 (let* ((old (find-classoid name nil))
765 (res (if (and old (funcall predicate old))
767 (funcall constructor :name name)))
768 (found (or (gethash name *forward-referenced-layouts*)
769 (when old (classoid-layout old)))))
771 (setf (layout-classoid found) res))
774 ;;; If the class has a proper name, return the name, otherwise return
776 (defun classoid-proper-name (class)
777 #-sb-xc (declare (type classoid class))
778 (let ((name (classoid-name class)))
779 (if (and name (eq (find-classoid name nil) class))
783 ;;;; CLASS type operations
785 (!define-type-class classoid)
787 ;;; Simple methods for TYPE= and SUBTYPEP should never be called when
788 ;;; the two classes are equal, since there are EQ checks in those
790 (!define-type-method (classoid :simple-=) (type1 type2)
791 (aver (not (eq type1 type2)))
794 (!define-type-method (classoid :simple-subtypep) (class1 class2)
795 (aver (not (eq class1 class2)))
796 (let ((subclasses (classoid-subclasses class2)))
797 (if (and subclasses (gethash class1 subclasses))
801 ;;; When finding the intersection of a sealed class and some other
802 ;;; class (not hierarchically related) the intersection is the union
803 ;;; of the currently shared subclasses.
804 (defun sealed-class-intersection2 (sealed other)
805 (declare (type classoid sealed other))
806 (let ((s-sub (classoid-subclasses sealed))
807 (o-sub (classoid-subclasses other)))
808 (if (and s-sub o-sub)
809 (collect ((res *empty-type* type-union))
810 (dohash (subclass layout s-sub)
811 (declare (ignore layout))
812 (when (gethash subclass o-sub)
813 (res (specifier-type subclass))))
817 (!define-type-method (classoid :simple-intersection2) (class1 class2)
818 (declare (type classoid class1 class2))
819 (cond ((eq class1 class2)
821 ;; If one is a subclass of the other, then that is the
823 ((let ((subclasses (classoid-subclasses class2)))
824 (and subclasses (gethash class1 subclasses)))
826 ((let ((subclasses (classoid-subclasses class1)))
827 (and subclasses (gethash class2 subclasses)))
829 ;; Otherwise, we can't in general be sure that the
830 ;; intersection is empty, since a subclass of both might be
831 ;; defined. But we can eliminate it for some special cases.
832 ((or (basic-structure-classoid-p class1)
833 (basic-structure-classoid-p class2))
834 ;; No subclass of both can be defined.
836 ((eq (classoid-state class1) :sealed)
837 ;; checking whether a subclass of both can be defined:
838 (sealed-class-intersection2 class1 class2))
839 ((eq (classoid-state class2) :sealed)
840 ;; checking whether a subclass of both can be defined:
841 (sealed-class-intersection2 class2 class1))
843 ;; uncertain, since a subclass of both might be defined
846 ;;; KLUDGE: we need this because of the need to represent
847 ;;; intersections of two classes, even when empty at a given time, as
848 ;;; uncanonicalized intersections because of the possibility of later
849 ;;; defining a subclass of both classes. The necessity for changing
850 ;;; the default return value from SUBTYPEP to NIL, T if no alternate
851 ;;; method is present comes about because, unlike the other places we
852 ;;; use INVOKE-COMPLEX-SUBTYPEP-ARG1-METHOD, in HAIRY methods and the
853 ;;; like, classes are in their own hierarchy with no possibility of
854 ;;; mixtures with other type classes.
855 (!define-type-method (classoid :complex-subtypep-arg2) (type1 class2)
856 (if (and (intersection-type-p type1)
857 (> (count-if #'classoid-p (intersection-type-types type1)) 1))
859 (invoke-complex-subtypep-arg1-method type1 class2 nil t)))
861 (!define-type-method (classoid :unparse) (type)
862 (classoid-proper-name type))
866 (def!struct (std-classoid (:include classoid)
868 (def!struct (standard-classoid (:include std-classoid)
869 (:constructor make-standard-classoid)))
870 (def!struct (random-pcl-classoid (:include std-classoid)
871 (:constructor make-random-pcl-classoid)))
873 ;;;; built-in classes
875 ;;; The BUILT-IN-CLASSES list is a data structure which configures the
876 ;;; creation of all the built-in classes. It contains all the info
877 ;;; that we need to maintain the mapping between classes, compile-time
878 ;;; types and run-time type codes. These options are defined:
880 ;;; :TRANSLATION (default none)
881 ;;; When this class is "parsed" as a type specifier, it is
882 ;;; translated into the specified internal type representation,
883 ;;; rather than being left as a class. This is used for types
884 ;;; which we want to canonicalize to some other kind of type
885 ;;; object because in general we want to be able to include more
886 ;;; information than just the class (e.g. for numeric types.)
888 ;;; :ENUMERABLE (default NIL)
889 ;;; The value of the :ENUMERABLE slot in the created class.
890 ;;; Meaningless in translated classes.
892 ;;; :STATE (default :SEALED)
893 ;;; The value of CLASS-STATE which we want on completion,
894 ;;; indicating whether subclasses can be created at run-time.
896 ;;; :HIERARCHICAL-P (default T unless any of the inherits are non-hierarchical)
897 ;;; True if we can assign this class a unique inheritance depth.
899 ;;; :CODES (default none)
900 ;;; Run-time type codes which should be translated back to this
901 ;;; class by CLASS-OF. Unspecified for abstract classes.
903 ;;; :INHERITS (default this class and T)
904 ;;; The class-precedence list for this class, with this class and
907 ;;; :DIRECT-SUPERCLASSES (default to head of CPL)
908 ;;; List of the direct superclasses of this class.
910 ;;; FIXME: This doesn't seem to be needed after cold init (and so can
911 ;;; probably be uninterned at the end of cold init).
912 (defvar *built-in-classes*)
914 (/show0 "setting *BUILT-IN-CLASSES*")
917 '((t :state :read-only :translation t)
918 (character :enumerable t :translation base-char)
919 (base-char :enumerable t
920 :inherits (character)
921 :codes (#.sb!vm:base-char-widetag))
922 (symbol :codes (#.sb!vm:symbol-header-widetag))
924 (instance :state :read-only)
926 (system-area-pointer :codes (#.sb!vm:sap-widetag))
927 (weak-pointer :codes (#.sb!vm:weak-pointer-widetag))
928 (code-component :codes (#.sb!vm:code-header-widetag))
929 (lra :codes (#.sb!vm:return-pc-header-widetag))
930 (fdefn :codes (#.sb!vm:fdefn-widetag))
931 (random-class) ; used for unknown type codes
934 :codes (#.sb!vm:closure-header-widetag
935 #.sb!vm:simple-fun-header-widetag)
937 (funcallable-instance
941 (array :translation array :codes (#.sb!vm:complex-array-widetag)
944 :translation simple-array :codes (#.sb!vm:simple-array-widetag)
947 :translation (or cons (member nil) vector))
949 :translation vector :codes (#.sb!vm:complex-vector-widetag)
950 :direct-superclasses (array sequence)
951 :inherits (array sequence))
953 :translation simple-vector :codes (#.sb!vm:simple-vector-widetag)
954 :direct-superclasses (vector simple-array)
955 :inherits (vector simple-array array sequence))
957 :translation bit-vector :codes (#.sb!vm:complex-bit-vector-widetag)
958 :inherits (vector array sequence))
960 :translation simple-bit-vector :codes (#.sb!vm:simple-bit-vector-widetag)
961 :direct-superclasses (bit-vector simple-array)
962 :inherits (bit-vector vector simple-array
964 (simple-array-unsigned-byte-2
965 :translation (simple-array (unsigned-byte 2) (*))
966 :codes (#.sb!vm:simple-array-unsigned-byte-2-widetag)
967 :direct-superclasses (vector simple-array)
968 :inherits (vector simple-array array sequence))
969 (simple-array-unsigned-byte-4
970 :translation (simple-array (unsigned-byte 4) (*))
971 :codes (#.sb!vm:simple-array-unsigned-byte-4-widetag)
972 :direct-superclasses (vector simple-array)
973 :inherits (vector simple-array array sequence))
974 (simple-array-unsigned-byte-8
975 :translation (simple-array (unsigned-byte 8) (*))
976 :codes (#.sb!vm:simple-array-unsigned-byte-8-widetag)
977 :direct-superclasses (vector simple-array)
978 :inherits (vector simple-array array sequence))
979 (simple-array-unsigned-byte-16
980 :translation (simple-array (unsigned-byte 16) (*))
981 :codes (#.sb!vm:simple-array-unsigned-byte-16-widetag)
982 :direct-superclasses (vector simple-array)
983 :inherits (vector simple-array array sequence))
984 (simple-array-unsigned-byte-32
985 :translation (simple-array (unsigned-byte 32) (*))
986 :codes (#.sb!vm:simple-array-unsigned-byte-32-widetag)
987 :direct-superclasses (vector simple-array)
988 :inherits (vector simple-array array sequence))
989 (simple-array-signed-byte-8
990 :translation (simple-array (signed-byte 8) (*))
991 :codes (#.sb!vm:simple-array-signed-byte-8-widetag)
992 :direct-superclasses (vector simple-array)
993 :inherits (vector simple-array array sequence))
994 (simple-array-signed-byte-16
995 :translation (simple-array (signed-byte 16) (*))
996 :codes (#.sb!vm:simple-array-signed-byte-16-widetag)
997 :direct-superclasses (vector simple-array)
998 :inherits (vector simple-array array sequence))
999 (simple-array-signed-byte-30
1000 :translation (simple-array (signed-byte 30) (*))
1001 :codes (#.sb!vm:simple-array-signed-byte-30-widetag)
1002 :direct-superclasses (vector simple-array)
1003 :inherits (vector simple-array array sequence))
1004 (simple-array-signed-byte-32
1005 :translation (simple-array (signed-byte 32) (*))
1006 :codes (#.sb!vm:simple-array-signed-byte-32-widetag)
1007 :direct-superclasses (vector simple-array)
1008 :inherits (vector simple-array array sequence))
1009 (simple-array-single-float
1010 :translation (simple-array single-float (*))
1011 :codes (#.sb!vm:simple-array-single-float-widetag)
1012 :direct-superclasses (vector simple-array)
1013 :inherits (vector simple-array array sequence))
1014 (simple-array-double-float
1015 :translation (simple-array double-float (*))
1016 :codes (#.sb!vm:simple-array-double-float-widetag)
1017 :direct-superclasses (vector simple-array)
1018 :inherits (vector simple-array array sequence))
1020 (simple-array-long-float
1021 :translation (simple-array long-float (*))
1022 :codes (#.sb!vm:simple-array-long-float-widetag)
1023 :direct-superclasses (vector simple-array)
1024 :inherits (vector simple-array array sequence))
1025 (simple-array-complex-single-float
1026 :translation (simple-array (complex single-float) (*))
1027 :codes (#.sb!vm:simple-array-complex-single-float-widetag)
1028 :direct-superclasses (vector simple-array)
1029 :inherits (vector simple-array array sequence))
1030 (simple-array-complex-double-float
1031 :translation (simple-array (complex double-float) (*))
1032 :codes (#.sb!vm:simple-array-complex-double-float-widetag)
1033 :direct-superclasses (vector simple-array)
1034 :inherits (vector simple-array array sequence))
1036 (simple-array-complex-long-float
1037 :translation (simple-array (complex long-float) (*))
1038 :codes (#.sb!vm:simple-array-complex-long-float-widetag)
1039 :direct-superclasses (vector simple-array)
1040 :inherits (vector simple-array array sequence))
1043 :codes (#.sb!vm:complex-string-widetag)
1044 :direct-superclasses (vector)
1045 :inherits (vector array sequence))
1047 :translation simple-string
1048 :codes (#.sb!vm:simple-string-widetag)
1049 :direct-superclasses (string simple-array)
1050 :inherits (string vector simple-array
1053 :translation (or cons (member nil))
1054 :inherits (sequence))
1056 :codes (#.sb!vm:list-pointer-lowtag)
1058 :inherits (list sequence))
1060 :translation (member nil)
1061 :inherits (symbol list sequence)
1062 :direct-superclasses (symbol list))
1063 (number :translation number)
1065 :translation complex
1067 :codes (#.sb!vm:complex-widetag))
1068 (complex-single-float
1069 :translation (complex single-float)
1070 :inherits (complex number)
1071 :codes (#.sb!vm:complex-single-float-widetag))
1072 (complex-double-float
1073 :translation (complex double-float)
1074 :inherits (complex number)
1075 :codes (#.sb!vm:complex-double-float-widetag))
1078 :translation (complex long-float)
1079 :inherits (complex number)
1080 :codes (#.sb!vm:complex-long-float-widetag))
1081 (real :translation real :inherits (number))
1084 :inherits (real number))
1086 :translation single-float
1087 :inherits (float real number)
1088 :codes (#.sb!vm:single-float-widetag))
1090 :translation double-float
1091 :inherits (float real number)
1092 :codes (#.sb!vm:double-float-widetag))
1095 :translation long-float
1096 :inherits (float real number)
1097 :codes (#.sb!vm:long-float-widetag))
1099 :translation rational
1100 :inherits (real number))
1102 :translation (and rational (not integer))
1103 :inherits (rational real number)
1104 :codes (#.sb!vm:ratio-widetag))
1106 :translation integer
1107 :inherits (rational real number))
1109 :translation (integer #.sb!xc:most-negative-fixnum
1110 #.sb!xc:most-positive-fixnum)
1111 :inherits (integer rational real number)
1112 :codes (#.sb!vm:even-fixnum-lowtag #.sb!vm:odd-fixnum-lowtag))
1114 :translation (and integer (not fixnum))
1115 :inherits (integer rational real number)
1116 :codes (#.sb!vm:bignum-widetag))
1120 :inherits (instance)))))
1122 ;;; comment from CMU CL:
1123 ;;; See also type-init.lisp where we finish setting up the
1124 ;;; translations for built-in types.
1126 (dolist (x *built-in-classes*)
1127 #-sb-xc-host (/show0 "at head of loop over *BUILT-IN-CLASSES*")
1130 (translation nil trans-p)
1136 (hierarchical-p t) ; might be modified below
1137 (direct-superclasses (if inherits
1138 (list (car inherits))
1141 (declare (ignore codes state translation))
1142 (let ((inherits-list (if (eq name t)
1144 (cons t (reverse inherits))))
1145 (classoid (make-built-in-classoid
1146 :enumerable enumerable
1148 :translation (if trans-p :initializing nil)
1149 :direct-superclasses
1152 (mapcar #'find-classoid direct-superclasses)))))
1153 (setf (info :type :kind name) #+sb-xc-host :defined #-sb-xc-host :primitive
1154 (classoid-cell-classoid (find-classoid-cell name)) classoid)
1156 (setf (info :type :builtin name) classoid))
1157 (let* ((inherits-vector
1161 (classoid-layout (find-classoid x))))
1162 (when (minusp (layout-depthoid super-layout))
1163 (setf hierarchical-p nil))
1166 (depthoid (if hierarchical-p
1167 (or depth (length inherits-vector))
1170 (find-and-init-or-check-layout name
1174 :invalidate nil)))))
1175 (/show0 "done with loop over *BUILT-IN-CLASSES*"))
1177 ;;; Define temporary PCL STANDARD-CLASSes. These will be set up
1178 ;;; correctly and the Lisp layout replaced by a PCL wrapper after PCL
1179 ;;; is loaded and the class defined.
1181 (/show0 "about to define temporary STANDARD-CLASSes")
1182 (dolist (x '(;; Why is STREAM duplicated in this list? Because, when
1183 ;; the inherits-vector of FUNDAMENTAL-STREAM is set up,
1184 ;; a vector containing the elements of the list below,
1185 ;; i.e. '(T INSTANCE STREAM STREAM), is created, and
1186 ;; this is what the function ORDER-LAYOUT-INHERITS
1189 ;; So, the purpose is to guarantee a valid layout for
1190 ;; the FUNDAMENTAL-STREAM class, matching what
1191 ;; ORDER-LAYOUT-INHERITS would do.
1192 ;; ORDER-LAYOUT-INHERITS would place STREAM at index 3
1193 ;; in the INHERITS(-VECTOR). Index 2 would not be
1194 ;; filled, so STREAM is duplicated there (as
1195 ;; ORDER-LAYOUTS-INHERITS would do). Maybe the
1196 ;; duplicate definition could be removed (removing a
1197 ;; STREAM element), because FUNDAMENTAL-STREAM is
1198 ;; redefined after PCL is set up, anyway. But to play
1199 ;; it safely, we define the class with a valid INHERITS
1201 (fundamental-stream (t instance stream stream))))
1202 (/show0 "defining temporary STANDARD-CLASS")
1203 (let* ((name (first x))
1204 (inherits-list (second x))
1205 (classoid (make-standard-classoid :name name))
1206 (classoid-cell (find-classoid-cell name)))
1207 ;; Needed to open-code the MAP, below
1208 (declare (type list inherits-list))
1209 (setf (classoid-cell-classoid classoid-cell) classoid
1210 (info :type :classoid name) classoid-cell
1211 (info :type :kind name) :instance)
1212 (let ((inherits (map 'simple-vector
1214 (classoid-layout (find-classoid x)))
1216 #-sb-xc-host (/show0 "INHERITS=..") #-sb-xc-host (/hexstr inherits)
1217 (register-layout (find-and-init-or-check-layout name 0 inherits -1)
1219 (/show0 "done defining temporary STANDARD-CLASSes"))
1221 ;;; Now that we have set up the class heterarchy, seal the sealed
1222 ;;; classes. This must be done after the subclasses have been set up.
1224 (dolist (x *built-in-classes*)
1225 (destructuring-bind (name &key (state :sealed) &allow-other-keys) x
1226 (setf (classoid-state (find-classoid name)) state))))
1228 ;;;; class definition/redefinition
1230 ;;; This is to be called whenever we are altering a class.
1231 (defun modify-classoid (classoid)
1233 (when (member (classoid-state classoid) '(:read-only :frozen))
1234 ;; FIXME: This should probably be CERROR.
1235 (warn "making ~(~A~) class ~S writable"
1236 (classoid-state classoid)
1237 (classoid-name classoid))
1238 (setf (classoid-state classoid) nil)))
1240 ;;; Mark LAYOUT as invalid. Setting DEPTHOID -1 helps cause unsafe
1241 ;;; structure type tests to fail. Remove class from all superclasses
1242 ;;; too (might not be registered, so might not be in subclasses of the
1243 ;;; nominal superclasses.)
1244 (defun invalidate-layout (layout)
1245 (declare (type layout layout))
1246 (setf (layout-invalid layout) t
1247 (layout-depthoid layout) -1)
1248 (let ((inherits (layout-inherits layout))
1249 (classoid (layout-classoid layout)))
1250 (modify-classoid classoid)
1251 (dotimes (i (length inherits)) ; FIXME: DOVECTOR
1252 (let* ((super (svref inherits i))
1253 (subs (classoid-subclasses (layout-classoid super))))
1255 (remhash classoid subs)))))
1258 ;;;; cold loading initializations
1260 ;;; FIXME: It would be good to arrange for this to be called when the
1261 ;;; cross-compiler is being built, not just when the target Lisp is
1262 ;;; being cold loaded. Perhaps this could be moved to its own file
1263 ;;; late in the build-order.lisp-expr sequence, and be put in
1264 ;;; !COLD-INIT-FORMS there?
1265 (defun !class-finalize ()
1266 (dohash (name layout *forward-referenced-layouts*)
1267 (let ((class (find-classoid name nil)))
1269 (setf (layout-classoid layout) (make-undefined-classoid name)))
1270 ((eq (classoid-layout class) layout)
1271 (remhash name *forward-referenced-layouts*))
1274 (warn "something strange with forward layout for ~S:~% ~S"
1278 ;;; a vector that maps type codes to layouts, used for quickly finding
1279 ;;; the layouts of built-in classes
1280 (defvar *built-in-class-codes*) ; initialized in cold load
1281 (declaim (type simple-vector *built-in-class-codes*))
1284 #-sb-xc-host (/show0 "about to set *BUILT-IN-CLASS-CODES*")
1285 (setq *built-in-class-codes*
1286 (let* ((initial-element
1288 ;; KLUDGE: There's a FIND-CLASSOID DEFTRANSFORM for
1289 ;; constant class names which creates fast but
1290 ;; non-cold-loadable, non-compact code. In this
1291 ;; context, we'd rather have compact, cold-loadable
1292 ;; code. -- WHN 19990928
1293 (declare (notinline find-classoid))
1294 (classoid-layout (find-classoid 'random-class))))
1295 (res (make-array 256 :initial-element initial-element)))
1296 (dolist (x *built-in-classes* res)
1297 (destructuring-bind (name &key codes &allow-other-keys)
1299 (let ((layout (classoid-layout (find-classoid name))))
1300 (dolist (code codes)
1301 (setf (svref res code) layout)))))))
1302 #-sb-xc-host (/show0 "done setting *BUILT-IN-CLASS-CODES*"))
1304 (!defun-from-collected-cold-init-forms !classes-cold-init)