1 ;;;; This file provides a functional interface to global information
2 ;;;; about named things in the system. Information is considered to be
3 ;;;; global if it must persist between invocations of the compiler. The
4 ;;;; use of a functional interface eliminates the need for the compiler
5 ;;;; to worry about the actual representation. This is important, since
6 ;;;; the information may well have several representations.
8 ;;;; The database contains arbitrary Lisp values, addressed by a
9 ;;;; combination of Name, Class and Type. The Name is a EQUAL-thing
10 ;;;; which is the name of the thing we are recording information
11 ;;;; about. Class is the kind of object involved. Typical classes are
12 ;;;; :FUNCTION, :VARIABLE, :TYPE, ... A Type names a particular piece
13 ;;;; of information within a given class. Class and Type are keywords,
14 ;;;; and are compared with EQ.
16 ;;;; This software is part of the SBCL system. See the README file for
17 ;;;; more information.
19 ;;;; This software is derived from the CMU CL system, which was
20 ;;;; written at Carnegie Mellon University and released into the
21 ;;;; public domain. The software is in the public domain and is
22 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
23 ;;;; files for more information.
27 (!begin-collecting-cold-init-forms)
28 #!+sb-show (!cold-init-forms (/show0 "early in globaldb.lisp cold init"))
30 ;;; The DEFVAR for this appears later.
32 (declaim (special *universal-type*))
34 ;;; This is sorta semantically equivalent to SXHASH, but optimized for
35 ;;; legal function names.
37 ;;; Why optimize? We want to avoid the fully-general TYPECASE in ordinary
39 ;;; 1. This hash function has to run when we're initializing the globaldb,
40 ;;; so it has to run before the type system is initialized, and it's
41 ;;; easier to make it do this if we don't try to do a general TYPECASE.
42 ;;; 2. This function is in a potential bottleneck for the compiler,
43 ;;; and avoiding the general TYPECASE lets us improve performance
45 ;;; 2a. the general TYPECASE is intrinsically slow, and
46 ;;; 2b. the general TYPECASE is too big for us to easily afford
47 ;;; to inline it, so it brings with it a full function call.
49 ;;; Why not specialize instead of optimize? (I.e. why fall through to
50 ;;; general SXHASH as a last resort?) Because the INFO database is used
51 ;;; to hold all manner of things, e.g. (INFO :TYPE :BUILTIN ..)
52 ;;; which is called on values like (UNSIGNED-BYTE 29). Falling through
53 ;;; to SXHASH lets us support all manner of things (as long as they
54 ;;; aren't used too early in cold boot for SXHASH to run).
55 #!-sb-fluid (declaim (inline globaldb-sxhashoid))
56 (defun globaldb-sxhashoid (x)
57 (logand sb!xc:most-positive-fixnum
58 (cond ((symbolp x) (sxhash x))
61 (let ((rest (rest x)))
62 (and (symbolp (car rest))
64 ;; We need to declare the type of the value we're feeding to
65 ;; SXHASH so that the DEFTRANSFORM on symbols kicks in.
66 (let ((symbol (second x)))
67 (declare (symbol symbol))
68 (logxor (sxhash symbol) 110680597)))
71 ;;; Given any non-negative integer, return a prime number >= to it.
73 ;;; FIXME: This logic should be shared with ALMOST-PRIMIFY in
74 ;;; hash-table.lisp. Perhaps the merged logic should be
75 ;;; PRIMIFY-HASH-TABLE-SIZE, implemented as a lookup table of primes
76 ;;; after integral powers of two:
77 ;;; #(17 37 67 131 ..)
78 ;;; (Or, if that's too coarse, after half-integral powers of two.) By
79 ;;; thus getting rid of any need for primality testing at runtime, we
80 ;;; could punt POSITIVE-PRIMEP, too.
82 (declare (type unsigned-byte x))
83 (do ((n (logior x 1) (+ n 2)))
84 ((positive-primep n) n)))
86 ;;;; info classes, info types, and type numbers, part I: what's needed
87 ;;;; not only at compile time but also at run time
89 ;;;; Note: This section is a blast from the past, a little trip down
90 ;;;; memory lane to revisit the weird host/target interactions of the
91 ;;;; CMU CL build process. Because of the way that the cross-compiler
92 ;;;; and target compiler share stuff here, if you change anything in
93 ;;;; here, you'd be well-advised to nuke all your fasl files and
94 ;;;; restart compilation from the very beginning of the bootstrap
97 ;;; At run time, we represent the type of info that we want by a small
98 ;;; non-negative integer.
99 (eval-when (:compile-toplevel :load-toplevel :execute)
100 (def!constant type-number-bits 6))
101 (deftype type-number () `(unsigned-byte ,type-number-bits))
103 ;;; Why do we suppress the :COMPILE-TOPLEVEL situation here when we're
104 ;;; running the cross-compiler? The cross-compiler (which was built
105 ;;; from these sources) has its version of these data and functions
106 ;;; defined in the same places we'd be defining into. We're happy with
107 ;;; its version, since it was compiled from the same sources, so
108 ;;; there's no point in overwriting its nice compiled version of this
109 ;;; stuff with our interpreted version. (And any time we're *not*
110 ;;; happy with its version, perhaps because we've been editing the
111 ;;; sources partway through bootstrapping, tch tch, overwriting its
112 ;;; version with our version would be unlikely to help, because that
113 ;;; would make the cross-compiler very confused.)
114 (eval-when (#-sb-xc :compile-toplevel :load-toplevel :execute)
116 (defstruct (class-info
117 (:constructor make-class-info (name))
118 #-no-ansi-print-object
119 (:print-object (lambda (x s)
120 (print-unreadable-object (x s :type t)
121 (prin1 (class-info-name x) s))))
123 ;; name of this class
124 (name nil :type keyword :read-only t)
125 ;; list of Type-Info structures for each type in this class
126 (types () :type list))
128 ;;; a map from type numbers to TYPE-INFO objects. There is one type
129 ;;; number for each defined CLASS/TYPE pair.
131 ;;; We build its value at build-the-cross-compiler time (with calls to
132 ;;; DEFINE-INFO-TYPE), then generate code to recreate the compile time
133 ;;; value, and arrange for that code to be called in cold load.
134 ;;; KLUDGE: We don't try to reset its value when cross-compiling the
135 ;;; compiler, since that creates too many bootstrapping problems,
136 ;;; instead just reusing the built-in-the-cross-compiler version,
137 ;;; which is theoretically a little bit ugly but pretty safe in
138 ;;; practice because the cross-compiler is as close to the target
139 ;;; compiler as we can make it, i.e. identical in most ways, including
140 ;;; this one. -- WHN 2001-08-19
141 (defvar *info-types*)
142 (declaim (type simple-vector *info-types*))
143 #-sb-xc ; as per KLUDGE note above
144 (eval-when (:compile-toplevel :execute)
146 (make-array (ash 1 type-number-bits) :initial-element nil)))
148 (defstruct (type-info
149 #-no-ansi-print-object
150 (:print-object (lambda (x s)
151 (print-unreadable-object (x s)
154 (class-info-name (type-info-class x))
156 (type-info-number x)))))
158 ;; the name of this type
159 (name (missing-arg) :type keyword)
161 (class (missing-arg) :type class-info)
162 ;; a number that uniquely identifies this type (and implicitly its class)
163 (number (missing-arg) :type type-number)
164 ;; a type specifier which info of this type must satisfy
166 ;; a function called when there is no information of this type
167 (default (lambda () (error "type not defined yet")) :type function)
168 ;; called by (SETF INFO) before calling SET-INFO-VALUE
169 (validate-function nil :type (or function null)))
171 ;;; a map from class names to CLASS-INFO structures
173 ;;; We build the value for this at compile time (with calls to
174 ;;; DEFINE-INFO-CLASS), then generate code to recreate the compile time
175 ;;; value, and arrange for that code to be called in cold load.
176 ;;; KLUDGE: Just as for *INFO-TYPES*, we don't try to rebuild this
177 ;;; when cross-compiling, but instead just reuse the cross-compiler's
178 ;;; version for the target compiler. -- WHN 2001-08-19
179 (defvar *info-classes*)
180 (declaim (hash-table *info-classes*))
181 #-sb-xc ; as per KLUDGE note above
182 (eval-when (:compile-toplevel :execute)
183 (setf *info-classes* (make-hash-table :test #'eq)))
185 ;;; If NAME is the name of a type in CLASS, then return the TYPE-INFO,
187 (defun find-type-info (name class)
188 (declare (type keyword name) (type class-info class))
189 (dolist (type (class-info-types class) nil)
190 (when (eq (type-info-name type) name)
193 ;;; Return the info structure for an info class or type, or die trying.
194 (declaim (ftype (function (keyword) class-info) class-info-or-lose))
195 (defun class-info-or-lose (class)
196 (declare (type keyword class))
197 #+sb-xc (/noshow0 "entering CLASS-INFO-OR-LOSE, CLASS=..")
198 #+sb-xc (/nohexstr class)
200 (flet ((lookup (class)
201 (or (gethash class *info-classes*)
202 (error "~S is not a defined info class." class))))
204 (or (get class 'class-info-or-lose-cache)
205 (setf (get class 'class-info-or-lose-cache)
208 #+sb-xc (/noshow0 "returning from CLASS-INFO-OR-LOSE")))
209 (declaim (ftype (function (keyword keyword) type-info) type-info-or-lose))
210 (defun type-info-or-lose (class type)
211 #+sb-xc (/noshow0 "entering TYPE-INFO-OR-LOSE, CLASS,TYPE=..")
212 #+sb-xc (/nohexstr class)
213 #+sb-xc (/nohexstr type)
215 (or (find-type-info type (class-info-or-lose class))
216 (error "~S is not a defined info type." type))
217 #+sb-xc (/noshow0 "returning from TYPE-INFO-OR-LOSE")))
221 ;;;; info classes, info types, and type numbers, part II: what's
222 ;;;; needed only at compile time, not at run time
224 ;;; FIXME: Perhaps this stuff (the definition of DEFINE-INFO-CLASS
225 ;;; and the calls to it) could/should go in a separate file,
226 ;;; perhaps info-classes.lisp?
228 (eval-when (:compile-toplevel :execute)
230 ;;; Set up the data structures to support an info class.
232 ;;; comment from CMU CL:
233 ;;; We make sure that the class exists at compile time so that
234 ;;; macros can use it, but we don't actually store the init function
235 ;;; until load time so that we don't break the running compiler.
236 ;;; KLUDGE: I don't think that's the way it is any more, but I haven't
237 ;;; looked into it enough to write a better comment. -- WHN 2001-03-06
238 (#+sb-xc-host defmacro
239 #-sb-xc-host sb!xc:defmacro
240 define-info-class (class)
241 (declare (type keyword class))
243 ;; (We don't need to evaluate this at load time, compile time is
244 ;; enough. There's special logic elsewhere which deals with cold
245 ;; load initialization by inspecting the info class data
246 ;; structures at compile time and generating code to recreate
247 ;; those data structures.)
248 (eval-when (:compile-toplevel :execute)
249 (unless (gethash ,class *info-classes*)
250 (setf (gethash ,class *info-classes*) (make-class-info ,class))))
253 ;;; Find a type number not already in use by looking for a null entry
255 (defun find-unused-type-number ()
256 (or (position nil *info-types*)
257 (error "no more INFO type numbers available")))
259 ;;; a list of forms for initializing the DEFAULT slots of TYPE-INFO
260 ;;; objects, accumulated during compilation and eventually converted
261 ;;; into a function to be called at cold load time after the
262 ;;; appropriate TYPE-INFO objects have been created
264 ;;; Note: This is quite similar to the !COLD-INIT-FORMS machinery, but
265 ;;; we can't conveniently use the ordinary !COLD-INIT-FORMS machinery
266 ;;; here. The problem is that the natural order in which the
267 ;;; default-slot-initialization forms are generated relative to the
268 ;;; order in which the TYPE-INFO-creation forms are generated doesn't
269 ;;; match the relative order in which the forms need to be executed at
271 (defparameter *!reversed-type-info-init-forms* nil)
273 ;;; Define a new type of global information for CLASS. TYPE is the
274 ;;; name of the type, DEFAULT is the value for that type when it
275 ;;; hasn't been set, and TYPE-SPEC is a type specifier which values of
276 ;;; the type must satisfy. The default expression is evaluated each
277 ;;; time the information is needed, with NAME bound to the name for
278 ;;; which the information is being looked up.
280 ;;; The main thing we do is determine the type's number. We need to do
281 ;;; this at macroexpansion time, since both the COMPILE and LOAD time
282 ;;; calls to %DEFINE-INFO-TYPE must use the same type number.
283 (#+sb-xc-host defmacro
284 #-sb-xc-host sb!xc:defmacro
285 define-info-type (&key (class (missing-arg))
287 (type-spec (missing-arg))
290 (declare (type keyword class type))
292 (eval-when (:compile-toplevel :execute)
293 ;; At compile time, ensure that the type number exists. It will
294 ;; need to be forced to exist at cold load time, too, but
295 ;; that's not handled here; it's handled by later code which
296 ;; looks at the compile time state and generates code to
297 ;; replicate it at cold load time.
298 (let* ((class-info (class-info-or-lose ',class))
299 (old-type-info (find-type-info ',type class-info)))
300 (unless old-type-info
301 (let* ((new-type-number (find-unused-type-number))
303 (make-type-info :name ',type
305 :number new-type-number
307 (setf (aref *info-types* new-type-number) new-type-info)
308 (push new-type-info (class-info-types class-info)))))
309 ;; Arrange for TYPE-INFO-DEFAULT and
310 ;; TYPE-INFO-VALIDATE-FUNCTION to be set at cold load
311 ;; time. (They can't very well be set at cross-compile time,
312 ;; since they differ between host and target and are
313 ;; host-compiled closures.)
314 (push `(let ((type-info (type-info-or-lose ,',class ,',type)))
315 (setf (type-info-validate-function type-info)
316 ,',validate-function)
317 (setf (type-info-default type-info)
318 ;; FIXME: This code is sort of nasty. It would
319 ;; be cleaner if DEFAULT accepted a real
320 ;; function, instead of accepting a statement
321 ;; which will be turned into a lambda assuming
322 ;; that the argument name is NAME. It might
323 ;; even be more microefficient, too, since many
324 ;; DEFAULTs could be implemented as (CONSTANTLY
325 ;; NIL) instead of full-blown (LAMBDA (X) NIL).
327 (declare (ignorable name))
329 *!reversed-type-info-init-forms*))
334 ;;;; generic info environments
336 (defstruct (info-env (:constructor nil)
338 ;; some string describing what is in this environment, for
339 ;; printing/debugging purposes only
340 (name (missing-arg) :type string))
341 (def!method print-object ((x info-env) stream)
342 (print-unreadable-object (x stream :type t)
343 (prin1 (info-env-name x) stream)))
345 ;;;; generic interfaces
347 (defmacro do-info ((env &key (name (gensym)) (class (gensym)) (type (gensym))
348 (type-number (gensym)) (value (gensym)) known-volatile)
351 "DO-INFO (Env &Key Name Class Type Value) Form*
352 Iterate over all the values stored in the Info-Env Env. Name is bound to
353 the entry's name, Class and Type are bound to the class and type
354 (represented as keywords), and Value is bound to the entry's value."
355 (once-only ((n-env env))
357 (do-volatile-info name class type type-number value n-env body)
358 `(if (typep ,n-env 'volatile-info-env)
359 ,(do-volatile-info name class type type-number value n-env body)
360 ,(do-compact-info name class type type-number value
363 (eval-when (#-sb-xc :compile-toplevel :load-toplevel :execute)
365 ;;; Return code to iterate over a compact info environment.
366 (defun do-compact-info (name-var class-var type-var type-number-var value-var
368 (let ((n-index (gensym))
371 (once-only ((n-table `(compact-info-env-table ,n-env))
372 (n-entries-index `(compact-info-env-index ,n-env))
373 (n-entries `(compact-info-env-entries ,n-env))
374 (n-entries-info `(compact-info-env-entries-info ,n-env))
375 (n-info-types '*info-types*))
376 `(dotimes (,n-index (length ,n-table))
377 (declare (type index ,n-index))
379 (let ((,name-var (svref ,n-table ,n-index)))
380 (unless (eql ,name-var 0)
381 (do-anonymous ((,n-type (aref ,n-entries-index ,n-index)
384 (declare (type index ,n-type))
385 ,(once-only ((n-info `(aref ,n-entries-info ,n-type)))
386 `(let ((,type-number-var
387 (logand ,n-info compact-info-entry-type-mask)))
388 ,(once-only ((n-type-info
389 `(svref ,n-info-types
391 `(let ((,type-var (type-info-name ,n-type-info))
392 (,class-var (class-info-name
393 (type-info-class ,n-type-info)))
394 (,value-var (svref ,n-entries ,n-type)))
395 (declare (ignorable ,type-var ,class-var
398 (unless (zerop (logand ,n-info
399 compact-info-entry-last))
400 (return-from ,punt))))))))))))))
402 ;;; Return code to iterate over a volatile info environment.
403 (defun do-volatile-info (name-var class-var type-var type-number-var value-var
405 (let ((n-index (gensym)) (n-names (gensym)) (n-types (gensym)))
406 (once-only ((n-table `(volatile-info-env-table ,n-env))
407 (n-info-types '*info-types*))
408 `(dotimes (,n-index (length ,n-table))
409 (declare (type index ,n-index))
410 (do-anonymous ((,n-names (svref ,n-table ,n-index)
413 (let ((,name-var (caar ,n-names)))
414 (declare (ignorable ,name-var))
415 (do-anonymous ((,n-types (cdar ,n-names) (cdr ,n-types)))
417 (let ((,type-number-var (caar ,n-types)))
418 ,(once-only ((n-type `(svref ,n-info-types
420 `(let ((,type-var (type-info-name ,n-type))
421 (,class-var (class-info-name
422 (type-info-class ,n-type)))
423 (,value-var (cdar ,n-types)))
424 (declare (ignorable ,type-var ,class-var ,value-var))
430 ;;;; compact info environments
432 ;;; The upper limit on the size of the ENTRIES vector in a COMPACT-INFO-ENV.
434 ;;; "Why (U-B 28)?", you might wonder. Originally this was (U-B 16),
435 ;;; presumably to ensure that the arrays of :ELEMENT-TYPE
436 ;;; COMPACT-INFO-ENTRIES-INDEX could use a more space-efficient representation.
437 ;;; It turns out that a environment of of only 65536 entries is insufficient in
438 ;;; the modern world (see message from Cyrus Harmon to sbcl-devel, "Subject:
439 ;;; purify failure when compact-info-env-entries-bits is too small"). Using
440 ;;; (U-B 28) instead of (U-B 29) is to avoid the need for bignum overflow
441 ;;; checks, a probably pointless micro-optimization. Hardcoding the amount of
442 ;;; bits instead of deriving it from SB!VM::N-WORD-BITS is done to allow
443 ;;; use of a more efficient array representation on 64-bit platforms.
444 ;;; -- JES, 2005-04-06
445 (def!constant compact-info-env-entries-bits 28)
446 (deftype compact-info-entries-index () `(unsigned-byte ,compact-info-env-entries-bits))
448 ;;; the type of the values in COMPACT-INFO-ENTRIES-INFO
449 (deftype compact-info-entry () `(unsigned-byte ,(1+ type-number-bits)))
451 ;;; This is an open hashtable with rehashing. Since modification is
452 ;;; not allowed, we don't have to worry about deleted entries. We
453 ;;; indirect through a parallel vector to find the index in the
454 ;;; ENTRIES at which the entries for a given name starts.
455 (defstruct (compact-info-env (:include info-env)
456 #-sb-xc-host (:pure :substructure)
458 ;; hashtable of the names in this environment. If a bucket is
460 (table (missing-arg) :type simple-vector)
461 ;; an indirection vector parallel to TABLE, translating indices in
462 ;; TABLE to the start of the ENTRIES for that name. Unused entries
464 (index (missing-arg) :type (simple-array compact-info-entries-index (*)))
465 ;; a vector contining in contiguous ranges the values of for all the
466 ;; types of info for each name.
467 (entries (missing-arg) :type simple-vector)
468 ;; a vector parallel to ENTRIES, indicating the type number for the
469 ;; value stored in that location and whether this location is the
470 ;; last type of info stored for this name. The type number is in the
471 ;; low TYPE-NUMBER-BITS bits, and the next bit is set if this is the
473 (entries-info (missing-arg) :type (simple-array compact-info-entry (*))))
475 (def!constant compact-info-entry-type-mask (ldb (byte type-number-bits 0) -1))
476 (def!constant compact-info-entry-last (ash 1 type-number-bits))
478 ;;; Return the value of the type corresponding to NUMBER for the
479 ;;; index INDEX in ENV.
480 #!-sb-fluid (declaim (inline compact-info-lookup-index))
481 (defun compact-info-lookup-index (env number index)
482 (declare (type compact-info-env env) (type type-number number))
483 (let ((entries-info (compact-info-env-entries-info env)))
485 (do ((index index (1+ index)))
487 (declare (type index index))
488 (let ((info (aref entries-info index)))
489 (when (= (logand info compact-info-entry-type-mask) number)
490 (return (values (svref (compact-info-env-entries env) index)
492 (unless (zerop (logand compact-info-entry-last info))
493 (return (values nil nil)))))
496 ;;; Look up NAME in the compact environment ENV. HASH is the
497 ;;; GLOBALDB-SXHASHOID of NAME.
498 (defun compact-info-lookup (env name hash number)
499 (declare (type compact-info-env env)
500 (type (integer 0 #.sb!xc:most-positive-fixnum) hash))
501 (let* ((table (compact-info-env-table env))
504 (hash2 (- len-2 (rem hash len-2))))
505 (declare (type index len-2 hash2))
506 (macrolet ((lookup (test)
507 `(do ((probe (rem hash len)
508 (let ((new (+ probe hash2)))
509 (declare (type index new))
510 ;; same as (MOD NEW LEN), but faster.
512 (the index (- new len))
515 (let ((entry (svref table probe)))
518 (when (,test entry name)
519 (return (compact-info-lookup-index
522 (aref (compact-info-env-index env) probe))))))))
527 ;;; the exact density (modulo rounding) of the hashtable in a compact
528 ;;; info environment in names/bucket
529 (def!constant compact-info-environment-density 65)
531 ;;; Return a new compact info environment that holds the same
532 ;;; information as ENV.
533 (defun compact-info-environment (env &key (name (info-env-name env)))
537 (/show0 "before COLLECT in COMPACT-INFO-ENVIRONMENT")
539 ;; Iterate over the environment once to find out how many names
540 ;; and entries it has, then build the result. This code assumes
541 ;; that all the entries for a name well be iterated over
542 ;; contiguously, which holds true for the implementation of
543 ;; iteration over both kinds of environments.
546 (/show0 "at head of COLLECT in COMPACT-INFO-ENVIRONMENT")
548 (do-info (env :name name :type-number num :value value)
549 (/noshow0 "at head of DO-INFO in COMPACT-INFO-ENVIRONMENT")
550 (unless (eq name prev-name)
551 (/noshow0 "not (EQ NAME PREV-NAME) case")
553 (unless (eql prev-name 0)
554 (names (cons prev-name types)))
555 (setq prev-name name)
558 (push (cons num value) types))
559 (unless (eql prev-name 0)
560 (/show0 "not (EQL PREV-NAME 0) case")
561 (names (cons prev-name types))))
563 ;; Now that we know how big the environment is, we can build
564 ;; a table to represent it.
566 ;; When building the table, we sort the entries by pointer
567 ;; comparison in an attempt to preserve any VM locality present
568 ;; in the original load order, rather than randomizing with the
569 ;; original hash function.
570 (/show0 "about to make/sort vectors in COMPACT-INFO-ENVIRONMENT")
571 (let* ((table-size (primify
572 (+ (truncate (* name-count 100)
573 compact-info-environment-density)
575 (table (make-array table-size :initial-element 0))
576 (index (make-array table-size
577 :element-type 'compact-info-entries-index))
578 (entries (make-array entry-count))
579 (entries-info (make-array entry-count
580 :element-type 'compact-info-entry))
581 (sorted (sort (names)
583 ;; POINTER-HASH hack implements pointer
584 ;; comparison, as explained above.
585 #-sb-xc-host (lambda (x y)
587 (pointer-hash y))))))
588 (/show0 "done making/sorting vectors in COMPACT-INFO-ENVIRONMENT")
589 (let ((entries-idx 0))
590 (dolist (types sorted)
591 (let* ((name (first types))
592 (hash (globaldb-sxhashoid name))
593 (len-2 (- table-size 2))
594 (hash2 (- len-2 (rem hash len-2))))
595 (do ((probe (rem hash table-size)
596 (rem (+ probe hash2) table-size)))
598 (let ((entry (svref table probe)))
600 (setf (svref table probe) name)
601 (setf (aref index probe) entries-idx)
603 (aver (not (equal entry name))))))
605 (unless (zerop entries-idx)
606 (setf (aref entries-info (1- entries-idx))
607 (logior (aref entries-info (1- entries-idx))
608 compact-info-entry-last)))
610 (loop for (num . value) in (rest types) do
611 (setf (aref entries-info entries-idx) num)
612 (setf (aref entries entries-idx) value)
614 (/show0 "done w/ DOLIST (TYPES SORTED) in COMPACT-INFO-ENVIRONMENT")
616 (unless (zerop entry-count)
617 (/show0 "nonZEROP ENTRY-COUNT")
618 (setf (aref entries-info (1- entry-count))
619 (logior (aref entries-info (1- entry-count))
620 compact-info-entry-last)))
622 (/show0 "falling through to MAKE-COMPACT-INFO-ENV")
623 (make-compact-info-env :name name
627 :entries-info entries-info))))))
629 ;;;; volatile environments
631 ;;; This is a closed hashtable, with the bucket being computed by
632 ;;; taking the GLOBALDB-SXHASHOID of the NAME modulo the table size.
633 (defstruct (volatile-info-env (:include info-env)
635 ;; vector of alists of alists of the form:
636 ;; ((Name . ((Type-Number . Value) ...) ...)
637 (table (missing-arg) :type simple-vector)
638 ;; the number of distinct names currently in this table. Each name
639 ;; may have multiple entries, since there can be many types of info.
640 (count 0 :type index)
641 ;; the number of names at which we should grow the table and rehash
642 (threshold 0 :type index))
644 ;;; Just like COMPACT-INFO-LOOKUP, only do it on a volatile environment.
645 (defun volatile-info-lookup (env name hash number)
646 (declare (type volatile-info-env env)
647 (type (integer 0 #.sb!xc:most-positive-fixnum) hash))
648 (let ((table (volatile-info-env-table env)))
649 (macrolet ((lookup (test)
650 `(dolist (entry (svref table (mod hash (length table))) ())
651 (when (,test (car entry) name)
652 (dolist (type (cdr entry))
653 (when (eql (car type) number)
654 (return-from volatile-info-lookup
655 (values (cdr type) t))))
656 (return-from volatile-info-lookup
657 (values nil nil))))))
662 ;;; Given a volatile environment ENV, bind TABLE-VAR the environment's table
663 ;;; and INDEX-VAR to the index of NAME's bucket in the table.
664 (eval-when (:compile-toplevel :execute)
665 (#+sb-xc-host cl:defmacro
666 #-sb-xc-host sb!xc:defmacro
667 with-info-bucket ((table-var index-var name env) &body body)
668 (once-only ((n-name name)
671 (let* ((,table-var (volatile-info-env-table ,n-env))
672 (,index-var (mod (globaldb-sxhashoid ,n-name)
673 (length ,table-var))))
676 ;;; Get the info environment that we use for write/modification operations.
677 ;;; This is always the first environment in the list, and must be a
678 ;;; VOLATILE-INFO-ENV.
679 #!-sb-fluid (declaim (inline get-write-info-env))
680 (defun get-write-info-env (&optional (env-list *info-environment*))
681 (let ((env (car env-list)))
683 (error "no info environment?"))
684 (unless (typep env 'volatile-info-env)
685 (error "cannot modify this environment: ~S" env))
686 (the volatile-info-env env)))
688 ;;; If Name is already present in the table, then just create or
689 ;;; modify the specified type. Otherwise, add the new name and type,
690 ;;; checking for rehashing.
692 ;;; We rehash by making a new larger environment, copying all of the
693 ;;; entries into it, then clobbering the old environment with the new
694 ;;; environment's table. We clear the old table to prevent it from
695 ;;; holding onto garbage if it is statically allocated.
697 ;;; We return the new value so that this can be conveniently used in a
699 (defun set-info-value (name0 type new-value)
700 (let ((name (uncross name0)))
702 (error "0 is not a legal INFO name."))
703 (labels ((set-it (name type new-value env)
704 (declare (type type-number type)
705 (type volatile-info-env env))
706 (with-info-bucket (table index name env)
707 (let ((types (if (symbolp name)
708 (assoc name (svref table index) :test #'eq)
709 (assoc name (svref table index) :test #'equal))))
712 (let ((value (assoc type (cdr types))))
714 (setf (cdr value) new-value)
715 (push (cons type new-value) (cdr types)))))
717 (push (cons name (list (cons type new-value)))
720 (let ((count (incf (volatile-info-env-count env))))
721 (when (>= count (volatile-info-env-threshold env))
722 (let ((new (make-info-environment :size (* count 2))))
723 (do-info (env :name entry-name :type-number entry-num
724 :value entry-val :known-volatile t)
725 (set-it entry-name entry-num entry-val new))
726 (fill (volatile-info-env-table env) nil)
727 (setf (volatile-info-env-table env)
728 (volatile-info-env-table new))
729 (setf (volatile-info-env-threshold env)
730 (volatile-info-env-threshold new)))))))))))
731 (set-it name type new-value (get-write-info-env)))
734 ;;; INFO is the standard way to access the database. It's settable.
736 ;;; Return the information of the specified TYPE and CLASS for NAME.
737 ;;; The second value returned is true if there is any such information
738 ;;; recorded. If there is no information, the first value returned is
739 ;;; the default and the second value returned is NIL.
740 (defun info (class type name)
741 (let ((info (type-info-or-lose class type)))
742 (get-info-value name (type-info-number info))))
745 (new-value class type name)
746 (let* ((info (type-info-or-lose class type))
747 (tin (type-info-number info))
748 (validate (type-info-validate-function info)))
750 (funcall validate name new-value))
756 ;;; Clear the information of the specified TYPE and CLASS for NAME in
757 ;;; the current environment, allowing any inherited info to become
758 ;;; visible. We return true if there was any info.
759 (defun clear-info (class type name)
760 (let ((info (type-info-or-lose class type)))
761 (clear-info-value name (type-info-number info))))
763 (defun clear-info-value (name type)
764 (declare (type type-number type) (inline assoc))
765 (with-info-bucket (table index name (get-write-info-env))
766 (let ((types (assoc name (svref table index) :test #'equal)))
768 (assoc type (cdr types)))
770 (delete type (cdr types) :key #'car))
773 ;;; the maximum density of the hashtable in a volatile env (in
776 ;;; FIXME: actually seems to be measured in percent, should be
777 ;;; converted to be measured in names/bucket
778 (def!constant volatile-info-environment-density 50)
780 ;;; Make a new volatile environment of the specified size.
781 (defun make-info-environment (&key (size 42) (name "Unknown"))
782 (declare (type (integer 1) size))
783 (let ((table-size (primify (truncate (* size 100)
784 volatile-info-environment-density))))
785 (make-volatile-info-env :name name
786 :table (make-array table-size :initial-element nil)
789 ;;;; *INFO-ENVIRONMENT*
791 ;;; We do info access relative to the current *INFO-ENVIRONMENT*, a
792 ;;; list of INFO-ENVIRONMENT structures.
793 (defvar *info-environment*)
794 (declaim (type list *info-environment*))
796 (setq *info-environment*
797 (list (make-info-environment :name "initial global")))
798 (/show0 "done setting *INFO-ENVIRONMENT*"))
799 ;;; FIXME: should perhaps be *INFO-ENV-LIST*. And rename
800 ;;; all FOO-INFO-ENVIRONMENT-BAR stuff to FOO-INFO-ENV-BAR.
804 ;;; Return the value of NAME / TYPE from the first environment where
805 ;;; has it defined, or return the default if none does. We used to
806 ;;; do a lot of complicated caching here, but that was removed for
807 ;;; thread-safety reasons.
808 (defun get-info-value (name0 type)
809 (declare (type type-number type))
810 ;; sanity check: If we have screwed up initialization somehow, then
811 ;; *INFO-TYPES* could still be uninitialized at the time we try to
812 ;; get an info value, and then we'd be out of luck. (This happened,
813 ;; and was confusing to debug, when rewriting EVAL-WHEN in
815 (aver (aref *info-types* type))
816 (let ((name (uncross name0)))
817 (flet ((lookup (env-list)
818 (dolist (env env-list
819 (multiple-value-bind (val winp)
820 (funcall (type-info-default
821 (svref *info-types* type))
824 (macrolet ((frob (lookup)
825 `(let ((hash (globaldb-sxhashoid name)))
826 (multiple-value-bind (value winp)
827 (,lookup env name hash type)
828 (when winp (return (values value t)))))))
830 (volatile-info-env (frob volatile-info-lookup))
831 (compact-info-env (frob compact-info-lookup)))))))
832 (lookup *info-environment*))))
834 ;;;; definitions for function information
836 (define-info-class :function)
838 ;;; the kind of functional object being described. If null, NAME isn't
839 ;;; a known functional object.
843 :type-spec (member nil :function :macro :special-form)
844 ;; I'm a little confused what the correct behavior of this default
845 ;; is. It's not clear how to generalize the FBOUNDP expression to
846 ;; the cross-compiler. As far as I can tell, NIL is a safe default
847 ;; -- it might keep the compiler from making some valid
848 ;; optimization, but it shouldn't produce incorrect code. -- WHN
852 #-sb-xc-host (if (fboundp name) :function nil))
854 ;;; The type specifier for this function.
859 ;; Again (as in DEFINE-INFO-TYPE :CLASS :FUNCTION :TYPE :KIND) it's
860 ;; not clear how to generalize the FBOUNDP expression to the
861 ;; cross-compiler. -- WHN 19990330
863 #+sb-xc-host (specifier-type 'function)
864 #-sb-xc-host (if (fboundp name)
865 (handler-bind ((style-warning #'muffle-warning))
866 (specifier-type (sb!impl::%fun-type (fdefinition name))))
867 (specifier-type 'function)))
869 ;;; the ASSUMED-TYPE for this function, if we have to infer the type
870 ;;; due to not having a declaration or definition
874 ;; FIXME: The type-spec really should be
875 ;; (or approximate-fun-type null)).
876 ;; It was changed to T as a hopefully-temporary hack while getting
877 ;; cold init problems untangled.
880 ;;; where this information came from:
881 ;;; :ASSUMED = from uses of the object
882 ;;; :DEFINED = from examination of the definition
883 ;;; :DEFINED-METHOD = implicit, incremental declaration by CLOS.
884 ;;; :DECLARED = from a declaration
885 ;;; :DEFINED trumps :ASSUMED, :DEFINED-METHOD trumps :DEFINED,
886 ;;; and :DECLARED trumps :DEFINED-METHOD.
887 ;;; :DEFINED and :ASSUMED are useful for issuing compile-time warnings,
888 ;;; :DEFINED-METHOD and :DECLARED are useful for ANSIly specializing
889 ;;; code which implements the function, or which uses the function's
894 :type-spec (member :declared :defined-method :assumed :defined)
896 ;; Again (as in DEFINE-INFO-TYPE :CLASS :FUNCTION :TYPE :KIND) it's
897 ;; not clear how to generalize the FBOUNDP expression to the
898 ;; cross-compiler. -- WHN 19990606
899 #+sb-xc-host :assumed
900 #-sb-xc-host (if (fboundp name) :defined :assumed))
902 ;;; something which can be decoded into the inline expansion of the
903 ;;; function, or NIL if there is none
905 ;;; To inline a function, we want a lambda expression, e.g.
906 ;;; '(LAMBDA (X) (+ X 1)). That can be encoded here in one of two
908 ;;; * The value in INFO can be the lambda expression itself, e.g.
909 ;;; (SETF (INFO :FUNCTION :INLINE-EXPANSION-DESIGNATOR 'FOO)
910 ;;; '(LAMBDA (X) (+ X 1)))
911 ;;; This is the ordinary way, the natural way of representing e.g.
912 ;;; (DECLAIM (INLINE FOO))
913 ;;; (DEFUN FOO (X) (+ X 1))
914 ;;; * The value in INFO can be a closure which returns the lambda
916 ;;; (SETF (INFO :FUNCTION :INLINE-EXPANSION-DESIGNATOR 'BAR-LEFT-CHILD)
918 ;;; '(LAMBDA (BAR) (BAR-REF BAR 3))))
919 ;;; This twisty way of storing values is supported in order to
920 ;;; allow structure slot accessors, and perhaps later other
921 ;;; stereotyped functions, to be represented compactly.
924 :type :inline-expansion-designator
925 :type-spec (or list function)
928 ;;; This specifies whether this function may be expanded inline. If
929 ;;; null, we don't care.
936 ;;; a macro-like function which transforms a call to this function
937 ;;; into some other Lisp form. This expansion is inhibited if inline
938 ;;; expansion is inhibited
941 :type :source-transform
942 :type-spec (or function null))
944 ;;; the macroexpansion function for this macro
947 :type :macro-function
948 :type-spec (or function null)
951 ;;; the compiler-macroexpansion function for this macro
954 :type :compiler-macro-function
955 :type-spec (or function null)
958 ;;; a function which converts this special form into IR1
962 :type-spec (or function null))
964 ;;; If a function is "known" to the compiler, then this is a FUN-INFO
965 ;;; structure containing the info used to special-case compilation.
969 :type-spec (or fun-info null)
975 :type-spec (or fdefn null)
980 :type :structure-accessor
981 :type-spec (or defstruct-description null)
984 ;;;; definitions for other miscellaneous information
986 (define-info-class :variable)
988 ;;; the kind of variable-like thing described
992 :type-spec (member :special :constant :macro :global :alien :unknown)
993 :default (if (typep name '(or boolean keyword))
1009 ;;; the declared type for this variable
1014 :default *universal-type*)
1016 ;;; where this type and kind information came from
1020 :type-spec (member :declared :assumed :defined)
1023 ;;; We only need a mechanism different from the
1024 ;;; usual SYMBOL-VALUE for the cross compiler.
1028 :type :xc-constant-value
1032 ;;; the macro-expansion for symbol-macros
1035 :type :macro-expansion
1042 :type-spec (or heap-alien-info null)
1047 :type :documentation
1048 :type-spec (or string null)
1051 (define-info-class :type)
1053 ;;; the kind of type described. We return :INSTANCE for standard types
1054 ;;; that are implemented as structures. For PCL classes, that have
1055 ;;; only been compiled, but not loaded yet, we return
1056 ;;; :FORTHCOMING-DEFCLASS-TYPE.
1060 :type-spec (member :primitive :defined :instance
1061 :forthcoming-defclass-type nil)
1063 :validate-function (lambda (name new-value)
1064 (declare (ignore new-value)
1066 (when (info :declaration :recognized name)
1067 (error 'declaration-type-conflict-error
1068 :format-arguments (list name)))))
1070 ;;; the expander function for a defined type
1074 :type-spec (or function null)
1079 :type :documentation
1080 :type-spec (or string null))
1082 ;;; function that parses type specifiers into CTYPE structures
1086 :type-spec (or function null)
1089 ;;; If true, then the type coresponding to this name. Note that if
1090 ;;; this is a built-in class with a translation, then this is the
1091 ;;; translation, not the class object. This info type keeps track of
1092 ;;; various atomic types (NIL etc.) and also serves as a cache to
1093 ;;; ensure that common standard types (atomic and otherwise) are only
1098 :type-spec (or ctype null)
1101 ;;; layout for this type being used by the compiler
1104 :type :compiler-layout
1105 :type-spec (or layout null)
1106 :default (let ((class (find-classoid name nil)))
1107 (when class (classoid-layout class))))
1109 ;;; DEFTYPE lambda-list
1118 :type :source-location
1122 (define-info-class :typed-structure)
1124 :class :typed-structure
1129 :class :typed-structure
1130 :type :documentation
1131 :type-spec (or string null)
1134 (define-info-class :declaration)
1139 :validate-function (lambda (name new-value)
1140 (declare (ignore new-value)
1142 (when (info :type :kind name)
1143 (error 'declaration-type-conflict-error
1144 :format-arguments (list name)))))
1148 :type-spec (or function null))
1150 (define-info-class :alien-type)
1154 :type-spec (member :primitive :defined :unknown)
1159 :type-spec (or function null)
1164 :type-spec (or alien-type null)
1169 :type-spec (or alien-type null)
1174 :type-spec (or alien-type null)
1179 :type-spec (or alien-type null)
1182 (define-info-class :setf)
1187 :type-spec (or symbol null)
1192 :type :documentation
1193 :type-spec (or string null)
1199 :type-spec (or function null)
1202 ;;; This is used for storing miscellaneous documentation types. The
1203 ;;; stuff is an alist translating documentation kinds to values.
1204 (define-info-class :random-documentation)
1206 :class :random-documentation
1211 ;;; Used to record the source location of definitions.
1212 (define-info-class :source-location)
1215 :class :source-location
1221 :class :source-location
1227 :class :source-location
1228 :type :typed-structure
1233 :class :source-location
1238 #!-sb-fluid (declaim (freeze-type info-env))
1240 ;;; Now that we have finished initializing *INFO-CLASSES* and
1241 ;;; *INFO-TYPES* (at compile time), generate code to set them at cold
1242 ;;; load time to the same state they have currently.
1244 (/show0 "beginning *INFO-CLASSES* init, calling MAKE-HASH-TABLE")
1245 (setf *info-classes*
1246 (make-hash-table :test 'eq :size #.(* 2 (hash-table-count *info-classes*))))
1247 (/show0 "done with MAKE-HASH-TABLE in *INFO-CLASSES* init")
1248 (dolist (class-info-name '#.(let ((result nil))
1249 (maphash (lambda (key value)
1250 (declare (ignore value))
1253 (sort result #'string<)))
1254 (let ((class-info (make-class-info class-info-name)))
1255 (setf (gethash class-info-name *info-classes*)
1257 (/show0 "done with *INFO-CLASSES* initialization")
1258 (/show0 "beginning *INFO-TYPES* initialization")
1262 (/show0 "in LAMBDA (X), X=..")
1265 (let* ((class-info (class-info-or-lose (second x)))
1266 (type-info (make-type-info :name (first x)
1270 (/show0 "got CLASS-INFO in LAMBDA (X)")
1271 (push type-info (class-info-types class-info))
1276 (list (type-info-name info-type)
1277 (class-info-name (type-info-class info-type))
1278 (type-info-number info-type)
1279 ;; KLUDGE: for repeatable xc fasls, to
1280 ;; avoid different cross-compiler
1281 ;; treatment of equal constants here we
1282 ;; COPY-TREE, which is not in general a
1283 ;; valid identity transformation
1284 ;; [e.g. on (EQL (FOO))] but is OK for
1285 ;; all the types we use here.
1286 (copy-tree (type-info-type info-type)))))
1288 (/show0 "done with *INFO-TYPES* initialization"))
1290 ;;; At cold load time, after the INFO-TYPE objects have been created,
1291 ;;; we can set their DEFAULT and TYPE slots.
1294 ,@(reverse *!reversed-type-info-init-forms*))))
1297 ;;; Source transforms / compiler macros for INFO functions.
1299 ;;; When building the XC, we give it a source transform, so that it can
1300 ;;; compile INFO calls in the target efficiently; we also give it a compiler
1301 ;;; macro, so that at least those INFO calls compiled after this file can be
1302 ;;; efficient. (Host compiler-macros do not fire when compiling the target,
1303 ;;; and source transforms don't fire when building the XC, so we need both.)
1305 ;;; Target needs just one, since there compiler macros and source-transforms
1307 (macrolet ((def (name lambda-list form)
1308 (aver (member 'class lambda-list))
1309 (aver (member 'type lambda-list))
1312 (define-source-transform ,name ,lambda-list
1313 (if (and (keywordp class) (keywordp type))
1316 (define-compiler-macro ,name ,(append '(&whole .whole.) lambda-list)
1317 (if (and (keywordp class) (keywordp type))
1321 (def info (class type name)
1322 (let (#+sb-xc-host (sb!xc:*gensym-counter* sb!xc:*gensym-counter*)
1323 (info (type-info-or-lose class type)))
1324 (with-unique-names (value foundp)
1325 `(multiple-value-bind (,value ,foundp)
1326 (get-info-value ,name ,(type-info-number info))
1327 (declare (type ,(type-info-type info) ,value))
1328 (values ,value ,foundp)))))
1330 (def (setf info) (new-value class type name)
1331 (let* (#+sb-xc-host (sb!xc:*gensym-counter* sb!xc:*gensym-counter*)
1332 (info (type-info-or-lose class type))
1333 (tin (type-info-number info))
1334 (validate (type-info-validate-function info)))
1335 (with-unique-names (new check)
1336 `(let ((,new ,new-value)
1338 `((,check (type-info-validate-function (svref *info-types* ,tin))))))
1340 `((funcall ,check ',name ,new)))
1341 (set-info-value ,name
1345 (def clear-info (class type name)
1346 (let ((info (type-info-or-lose class type)))
1347 `(clear-info-value ,name ,(type-info-number info)))))
1349 ;;;; a hack for detecting
1350 ;;;; (DEFUN FOO (X Y)
1352 ;;;; (SETF (BAR A FFH) 12) ; compiles to a call to #'(SETF BAR)
1354 ;;;; (DEFSETF BAR SET-BAR) ; can't influence previous compilation
1356 ;;;; KLUDGE: Arguably it should be another class/type combination in
1357 ;;;; the globaldb. However, IMHO the whole globaldb/fdefinition
1358 ;;;; treatment of SETF functions is a mess which ought to be
1359 ;;;; rewritten, and I'm not inclined to mess with it short of that. So
1360 ;;;; I just put this bag on the side of it instead..
1362 ;;; true for symbols FOO which have been assumed to have '(SETF FOO)
1363 ;;; bound to a function
1364 (defvar *setf-assumed-fboundp*)
1365 (!cold-init-forms (setf *setf-assumed-fboundp* (make-hash-table)))
1367 (!defun-from-collected-cold-init-forms !globaldb-cold-init)