X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fcompiler%2Fearly-c.lisp;h=6b793b7bcd40dd049717e0f2f0d6c82d596af2bd;hb=2912f5f6c2acb2da3b9fcc0f5afd1ca89782a9f8;hp=62b732914c55d577191e99c7de2fab26d9b76bf0;hpb=fa8962d732057015fbb9a2f8a08ea8d5299b50dd;p=sbcl.git diff --git a/src/compiler/early-c.lisp b/src/compiler/early-c.lisp index 62b7329..6b793b7 100644 --- a/src/compiler/early-c.lisp +++ b/src/compiler/early-c.lisp @@ -15,11 +15,33 @@ (in-package "SB!C") -;;; FIXME: Shouldn't SB!C::&MORE be in this list? -(defconstant-eqx sb!xc:lambda-list-keywords - '(&optional &rest &key &aux &body &whole &allow-other-keys &environment) +;;; ANSI limits on compilation +(def!constant sb!xc:call-arguments-limit most-positive-fixnum + #!+sb-doc + "The exclusive upper bound on the number of arguments which may be passed + to a function, including &REST args.") +(def!constant sb!xc:lambda-parameters-limit most-positive-fixnum + #!+sb-doc + "The exclusive upper bound on the number of parameters which may be specifed + in a given lambda list. This is actually the limit on required and &OPTIONAL + parameters. With &KEY and &AUX you can get more.") +(def!constant sb!xc:multiple-values-limit most-positive-fixnum #!+sb-doc + "The exclusive upper bound on the number of multiple VALUES that you can + return.") + +(defconstant-eqx sb!xc:lambda-list-keywords + '(&allow-other-keys + &aux + &body + &environment + &key + &more + &optional + &rest + &whole) #'equal + #!+sb-doc "symbols which are magical in a lambda list") ;;;; cross-compiler-only versions of CL special variables, so that we @@ -51,18 +73,18 @@ (defvar *lexenv*) (declaim (type lexenv *lexenv*)) -;;; *FREE-VARIABLES* translates from the names of variables referenced -;;; globally to the LEAF structures for them. *FREE-FUNCTIONS* is like -;;; *FREE-VARIABLES*, only it deals with function names. -(defvar *free-variables*) -(defvar *free-functions*) -(declaim (hash-table *free-variables* *free-functions*)) +;;; *FREE-VARS* translates from the names of variables referenced +;;; globally to the LEAF structures for them. *FREE-FUNS* is like +;;; *FREE-VARS*, only it deals with function names. +(defvar *free-vars*) +(defvar *free-funs*) +(declaim (type hash-table *free-vars* *free-funs*)) -;;; We use the same Constant structure to represent all equal anonymous -;;; constants. This hashtable translates from constants to the Leafs that +;;; We use the same CONSTANT structure to represent all equal anonymous +;;; constants. This hashtable translates from constants to the LEAFs that ;;; represent them. (defvar *constants*) -(declaim (hash-table *constants*)) +(declaim (type hash-table *constants*)) ;;; miscellaneous forward declarations (defvar *code-segment*) @@ -73,18 +95,19 @@ (defvar *compiler-warning-count*) (defvar *compiler-style-warning-count*) (defvar *compiler-note-count*) -(defvar *converting-for-interpreter*) +(defvar *compiler-trace-output*) +(defvar *constraint-number*) (defvar *count-vop-usages*) (defvar *current-path*) (defvar *current-component*) +(defvar *delayed-ir1-transforms*) (defvar *policy*) -(defvar *interface-policy*) (defvar *dynamic-counts-tn*) (defvar *elsewhere*) (defvar *event-info*) (defvar *event-note-threshold*) (defvar *failure-p*) -(defvar *fixups*) +(defvar *fixup-notes*) (defvar *in-pack*) (defvar *info-environment*) (defvar *lexenv*) @@ -92,6 +115,23 @@ (defvar *trace-table*) (defvar *undefined-warnings*) (defvar *warnings-p*) + +;;; This lock is seized in the compiler, and related areas: the +;;; compiler is not presently thread-safe +(defvar *big-compiler-lock* + (sb!thread:make-mutex :name "big compiler lock")) + +;;; unique ID for the next object created (to let us track object +;;; identity even across GC, useful for understanding weird compiler +;;; bugs where something is supposed to be unique but is instead +;;; exists as duplicate objects) +#!+sb-show +(progn + (defvar *object-id-counter* 0) + (defun new-object-id () + (prog1 + *object-id-counter* + (incf *object-id-counter*)))) ;;;; miscellaneous utilities @@ -102,7 +142,7 @@ note-name-defined)) (defun note-name-defined (name kind) ;; We do this BOUNDP check because this function can be called when - ;; not in a compilation unit (as when loading top-level forms). + ;; not in a compilation unit (as when loading top level forms). (when (boundp '*undefined-warnings*) (setq *undefined-warnings* (delete-if (lambda (x) @@ -114,7 +154,6 @@ ;;; to be called when a variable is lexically bound (declaim (ftype (function (symbol) (values)) note-lexical-binding)) (defun note-lexical-binding (symbol) - (let ((name (symbol-name symbol))) ;; This check is intended to protect us from getting silently ;; burned when we define ;; foo.lisp: @@ -125,10 +164,26 @@ ;; (LET ((*FOO* X)) ;; (FOO 14))) ;; and then we happen to compile bar.lisp before foo.lisp. - (when (and (char= #\* (aref name 0)) - (char= #\* (aref name (1- (length name))))) - ;; FIXME: should be COMPILER-STYLE-WARNING? - (style-warn "using the lexical binding of the symbol ~S, not the~@ + (when (looks-like-name-of-special-var-p symbol) + ;; FIXME: should be COMPILER-STYLE-WARNING? + (style-warn "using the lexical binding of the symbol ~S, not the~@ dynamic binding, even though the symbol name follows the usual naming~@ -convention (names like *FOO*) for special variables" symbol))) +convention (names like *FOO*) for special variables" symbol)) (values)) + +;;; shorthand for creating debug names from source names or other +;;; stems, e.g. +;;; (DEBUG-NAMIFY "FLET ~S" SOURCE-NAME) +;;; (DEBUG-NAMIFY "top level form ~S" FORM) +;;; +;;; FIXME: This function seems to have a lot in common with +;;; STRINGIFY-FORM, and perhaps there's some way to merge the two +;;; functions. +(declaim (ftype (sfunction (string &rest t) string) debug-namify)) +(defun debug-namify (format-string &rest format-arguments) + (with-standard-io-syntax + (let ((*print-readably* nil) + (*package* *cl-package*) + (*print-length* 3) + (*print-level* 2)) + (apply #'format nil format-string format-arguments))))