| blob | 877d2c8fc8eb61cfd4b27c0d2cd94886aff1e572 |
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
115 "If true (the default), the compiler respects DYNAMIC-EXTENT declarations
116 and stack allocates otherwise inaccessible parts of the object whenever
117 possible. Potentially long (over one page in size) vectors are, however, not
118 stack allocated except in zero SAFETY code, as such a vector could overflow
122 ;;; This lock is seized in the compiler, and related areas -- like the
123 ;;; classoid/layout/class system.
125 (!cold-init-forms
136 ;;; unique ID for the next object created (to let us track object
137 ;;; identity even across GC, useful for understanding weird compiler
138 ;;; bugs where something is supposed to be unique but is instead
139 ;;; exists as duplicate objects)
140 #!+sb-show
147 \f
148 ;;;; miscellaneous utilities
150 ;;; Delete any undefined warnings for NAME and KIND. This is for the
151 ;;; benefit of the compiler, but it's sometimes called from stuff like
152 ;;; type-defining code which isn't logically part of the compiler.
154 note-name-defined))
156 ;; We do this BOUNDP check because this function can be called when
157 ;; not in a compilation unit (as when loading top level forms).
166 ;;; to be called when a variable is lexically bound
169 ;; This check is intended to protect us from getting silently
170 ;; burned when we define
171 ;; foo.lisp:
172 ;; (DEFVAR *FOO* -3)
173 ;; (DEFUN FOO (X) (+ X *FOO*))
174 ;; bar.lisp:
175 ;; (DEFUN BAR (X)
176 ;; (LET ((*FOO* X))
177 ;; (FOO 14)))
178 ;; and then we happen to compile bar.lisp before foo.lisp.
180 ;; FIXME: should be COMPILER-STYLE-WARNING?
182 :format-control
183 "using the lexical binding of the symbol ~S, not the~@
184 dynamic binding"
248 x)
255 name))))