projects
/
sbcl.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
0.9.4.68:
[sbcl.git]
/
doc
/
manual
/
debugger.texinfo
diff --git
a/doc/manual/debugger.texinfo
b/doc/manual/debugger.texinfo
index
7e923ed
..
663ad25
100644
(file)
--- a/
doc/manual/debugger.texinfo
+++ b/
doc/manual/debugger.texinfo
@@
-370,8
+370,8
@@
tail-recursively, as in this example:
@end lisp
Usually the elimination of tail-recursive frames makes debugging more
@end lisp
Usually the elimination of tail-recursive frames makes debugging more
-pleasant, since theses frames are mostly uninformative. If there is
-any doubt about how one function called another, it can usually be
+pleasant, since these frames are mostly uninformative. If there is any
+doubt about how one function called another, it can usually be
eliminated by finding the source location in the calling frame.
@xref{Source Location Printing}.
eliminated by finding the source location in the calling frame.
@xref{Source Location Printing}.
@@
-850,9
+850,13
@@
If @code{debug} is greater than both @code{speed} and @code{space},
the command @command{return} can be used to continue execution by
returning a value from the current stack frame.
the command @command{return} can be used to continue execution by
returning a value from the current stack frame.
-If @code{debug} is also at least 2, then the code is @emph{partially
+@item > (max 1 speed space compilation-speed)
+If @code{debug} is also at least 2, then the code is @emph{partially
steppable}. If @code{debug} is 3, the code is @emph{fully steppable}.
steppable}. If @code{debug} is 3, the code is @emph{fully steppable}.
-@xref{Single Stepping}, for details.
+@xref{Single Stepping}, for details. Fully steppable code take
+exponentially longer to compile in some cases, and is significantly
+larger and slower; for partially steppable code the speed and space
+penalties are signigicantly smaller.
@end table
@end table