Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

0.8.15:

	some trivial text fixes (like s/the the/the/)
	release, tagged as sbcl_0_8_15
  • Loading branch information...
commit 3c5609fe910bae51ff885c8cfd4be879151e7489 1 parent b9259fb
William Harold Newman authored
View
6 doc/manual/debugger.texinfo
@@ -790,7 +790,7 @@ form have been added or deleted.)
If the heuristic doesn't work, the displayed source will be wrong, but will
probably be near the actual source. If the ``shape'' of the top-level form in
the source file is too different from the original form, then an error will be
-signaled. When the heuristic is used, the the source location commands are
+signaled. When the heuristic is used, the source location commands are
noticeably slowed.
Source location printing can also be confused if (after the source was
@@ -830,7 +830,7 @@ some properties of the block start location:
@item The block start location may be the same as the true location.
-@item The block start location will never be later in the the
+@item The block start location will never be later in the
program's flow of control than the true location.
@item No conditional control structures (such as @code{if},
@@ -1023,7 +1023,7 @@ Selects the @code{continue} restart if one exists and starts single stepping.
@c @cindex Breakpoints
@c SBCL supports setting of breakpoints inside compiled functions and
-@c stepping of compiled code. Breakpoints can only be set at at known
+@c stepping of compiled code. Breakpoints can only be set at known
@c locations (@pxref{Unknown Locations and Interrupts}), so these
@c commands are largely useless unless the @code{debug} optimize quality
@c is at least @code{2} (@pxref{Debugger Policy Control}). These
View
2  src/assembly/x86/assem-rtns.lisp
@@ -126,7 +126,7 @@
(move ecx esi)
(inst sub ecx esp-tn)
- ;; Check for all the args fitting the the registers.
+ ;; Check for all the args fitting the registers.
(inst cmp ecx (fixnumize 3))
(inst jmp :le REGISTER-ARGS)
View
2  src/code/debug-info.lisp
@@ -75,7 +75,7 @@
;; CMU CL, there are two distinct -- but coupled -- mechanisms to
;; finding the name of a function. The slot here is one mechanism
;; (used in CMU CL to look up names in the debugger, e.g. in
- ;; BACKTRACE). The other mechanism is the the NAME slot in function
+ ;; BACKTRACE). The other mechanism is the NAME slot in function
;; primitive objects (used in CMU CL to look up names elsewhere,
;; e.g. in CL:FUNCTION-LAMBDA-EXPRESSION and in CL:DESCRIBE).
;;
View
2  src/code/room.lisp
@@ -513,7 +513,7 @@
(values)))
;;; Print a breakdown by instance type of all the instances allocated
-;;; in SPACE. If TOP-N is true, print only information for the the
+;;; in SPACE. If TOP-N is true, print only information for the
;;; TOP-N types with largest usage.
(defun instance-usage (space &key (top-n 15))
(declare (type spaces space) (type (or fixnum null) top-n))
View
2  src/code/unix.lisp
@@ -241,7 +241,7 @@
;;; UNIX-WRITE accepts a file descriptor, a buffer, an offset, and the
;;; length to write. It attempts to write len bytes to the device
-;;; associated with fd from the the buffer starting at offset. It returns
+;;; associated with fd from the buffer starting at offset. It returns
;;; the actual number of bytes written.
(defun unix-write (fd buf offset len)
(declare (type unix-fd fd)
View
2  src/compiler/array-tran.lisp
@@ -678,7 +678,7 @@
;; given a set of indices. We wrap each index with a call
;; to %CHECK-BOUND to ensure that everything works out
;; correctly. We can wrap all the interior arithmetic with
- ;; TRULY-THE INDEX because we know the the resultant
+ ;; TRULY-THE INDEX because we know the resultant
;; row-major index must be an index.
(with-row-major-index ((array indices index &optional new-value)
&rest body)
View
2  src/compiler/dump.lisp
@@ -391,7 +391,7 @@
;;; Dump an object of any type by dispatching to the correct
;;; type-specific dumping function. We pick off immediate objects,
-;;; symbols and and magic lists here. Other objects are handled by
+;;; symbols and magic lists here. Other objects are handled by
;;; DUMP-NON-IMMEDIATE-OBJECT.
;;;
;;; This is the function used for recursive calls to the fasl dumper.
View
4 src/compiler/hppa/move.lisp
@@ -225,13 +225,13 @@
;; Create the result pointer.
(inst move alloc-tn y)
(inst dep other-pointer-lowtag 31 3 y)
- ;; Check the high bit, and skip the next instruction it it's 0.
+ ;; Check the high bit, and skip the next instruction if it's 0.
(inst comclr x zero-tn zero-tn :>=)
;; The high bit is set, so allocate enough space for a two-word bignum.
;; We always skip the following instruction, so it is only executed
;; when we want one word.
(inst addi (pad-data-block 1) alloc-tn alloc-tn :tr)
- ;; Set up the header for one word. Use addi instead of li so we can
+ ;; Set up the header for one word. Use ADDI instead of LI so we can
;; skip the next instruction.
(inst addi (logior (ash 1 n-widetag-bits) bignum-widetag) zero-tn temp :tr)
;; Set up the header for two words.
View
4 src/compiler/macros.lisp
@@ -259,14 +259,14 @@
;;; Given a DEFTRANSFORM-style lambda-list, generate code that parses
;;; the arguments of a combination with respect to that
-;;; lambda-list. BODY is the the list of forms which are to be
+;;; lambda-list. BODY is the list of forms which are to be
;;; evaluated within the bindings. ARGS is the variable that holds
;;; list of argument lvars. ERROR-FORM is a form which is evaluated
;;; when the syntax of the supplied arguments is incorrect or a
;;; non-constant argument keyword is supplied. Defaults and other gunk
;;; are ignored. The second value is a list of all the arguments
;;; bound. We make the variables IGNORABLE so that we don't have to
-;;; manually declare them Ignore if their only purpose is to make the
+;;; manually declare them IGNORE if their only purpose is to make the
;;; syntax work.
(defun parse-deftransform (lambda-list body args error-form)
(multiple-value-bind (req opt restp rest keyp keys allowp)
View
2  src/compiler/main.lisp
@@ -196,7 +196,7 @@
(t
(compiler-warn
"~@<The ~(~A~) ~S is undefined, and its name is ~
- reserved by ANSI CL so that even if it it were ~
+ reserved by ANSI CL so that even if it were ~
defined later, the code doing so would not be ~
portable.~:@>"
kind name)))
View
2  src/compiler/sparc/float.lisp
@@ -1314,7 +1314,7 @@
;; high 32 bits of the FSR, which contain the additional
;; %fcc's on the sparc V9. If not, we don't need this, but we
;; do need to make sure that the unused bits are written as
- ;; zeroes, according the the V9 architecture manual.
+ ;; zeroes, according the V9 architecture manual.
(inst sra new 0)
(inst srlx my-fsr 32)
(inst sllx my-fsr 32)
View
2  src/runtime/util.c
@@ -69,7 +69,7 @@ void**
voidacc_give_away_result(struct voidacc *va)
{
/* (We could do realloc(3) here to try to shrink the result down
- * to minimum size, but that's not really needed for the the
+ * to minimum size, but that's not really needed for the
* directory-iteration application this was originally written
* for, so for now we just do the simplest thing which could
* possibly work.) */
View
2  version.lisp-expr
@@ -17,4 +17,4 @@
;;; checkins which aren't released. (And occasionally for internal
;;; versions, especially for internal versions off the main CVS
;;; branch, it gets hairier, e.g. "0.pre7.14.flaky4.13".)
-"0.8.14.30"
+"0.8.15"
Please sign in to comment.
Something went wrong with that request. Please try again.