| blob | b6d0803a07d6a3c190b4e6bb34d528f51d7ce1c5 |
1 ;;;; This file contains compiler code and compiler-related stuff which
2 ;;;; can be built early on. Some of the stuff may be here because it's
3 ;;;; needed early on, some other stuff (e.g. constants) just because
4 ;;;; it might as well be done early so we don't have to think about
5 ;;;; whether it's done early enough.
7 ;;;; This software is part of the SBCL system. See the README file for
8 ;;;; more information.
9 ;;;;
10 ;;;; This software is derived from the CMU CL system, which was
11 ;;;; written at Carnegie Mellon University and released into the
12 ;;;; public domain. The software is in the public domain and is
13 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
14 ;;;; files for more information.
18 ;;; ANSI limits on compilation
20 #!+sb-doc
21 "The exclusive upper bound on the number of arguments which may be passed
24 #!+sb-doc
25 "The exclusive upper bound on the number of parameters which may be specifed
26 in a given lambda list. This is actually the limit on required and &OPTIONAL
29 #!+sb-doc
30 "The exclusive upper bound on the number of multiple VALUES that you can
32 \f
33 ;;;; cross-compiler-only versions of CL special variables, so that we
34 ;;;; don't have weird interactions with the host compiler
40 \f
41 ;;;; miscellaneous types used both in the cross-compiler and on the target
43 ;;;; FIXME: The INDEX and LAYOUT-DEPTHOID definitions probably belong
44 ;;;; somewhere else, not "early-c", since they're after all not part
45 ;;;; of the compiler.
47 ;;; the type of LAYOUT-DEPTHOID slot values
49 \f
50 ;;; possible values for the INLINE-ness of a function.
58 ;;; the lexical environment we are currently converting in
62 ;;; *FREE-VARS* translates from the names of variables referenced
63 ;;; globally to the LEAF structures for them. *FREE-FUNS* is like
64 ;;; *FREE-VARS*, only it deals with function names.
69 ;;; We use the same CONSTANT structure to represent all equal anonymous
70 ;;; constants. This hashtable translates from constants to the LEAFs that
71 ;;; represent them.
75 ;;; *ALLOW-INSTRUMENTING* controls whether we should allow the
76 ;;; insertion of instrumenting code (like a (CATCH ...)) around code
77 ;;; to allow the debugger RETURN and STEP commands to function (we
78 ;;; disallow it for internal stuff).
81 ;;; miscellaneous forward declarations
114 ;;; This lock is seized in the compiler, and related areas: the
115 ;;; compiler is not presently thread-safe
122 ;;; unique ID for the next object created (to let us track object
123 ;;; identity even across GC, useful for understanding weird compiler
124 ;;; bugs where something is supposed to be unique but is instead
125 ;;; exists as duplicate objects)
126 #!+sb-show
133 \f
134 ;;;; miscellaneous utilities
136 ;;; Delete any undefined warnings for NAME and KIND. This is for the
137 ;;; benefit of the compiler, but it's sometimes called from stuff like
138 ;;; type-defining code which isn't logically part of the compiler.
140 note-name-defined))
142 ;; We do this BOUNDP check because this function can be called when
143 ;; not in a compilation unit (as when loading top level forms).
152 ;;; to be called when a variable is lexically bound
155 ;; This check is intended to protect us from getting silently
156 ;; burned when we define
157 ;; foo.lisp:
158 ;; (DEFVAR *FOO* -3)
159 ;; (DEFUN FOO (X) (+ X *FOO*))
160 ;; bar.lisp:
161 ;; (DEFUN BAR (X)
162 ;; (LET ((*FOO* X))
163 ;; (FOO 14)))
164 ;; and then we happen to compile bar.lisp before foo.lisp.
166 ;; FIXME: should be COMPILER-STYLE-WARNING?
168 :format-control
169 "using the lexical binding of the symbol ~S, not the~@
170 dynamic binding"
234 x)
241 name))))