sbcl Log


Commit Date  
[f3a2d7] (sbcl_1_0_12) by William Harold Newman William Harold Newman

1.0.12: release, will be tagged as sbcl_1_0_12

2007-11-26 00:33:55 Tree
[b1cd84] by Nikodemus Siivola Nikodemus Siivola

1.0.11.35: fixed bug 417

* Don't store non-unique objects like symbols, fixnums,
or characters in *SOURCE-PATHS*.

* For future refactoring ease, always access *SOURCE-PATHS*
via GET-SOURCE-PATH and NOTE-SOURCE-PATH.

2007-11-20 14:50:40 Tree
[2419de] by Nikodemus Siivola Nikodemus Siivola

1.0.11.34: better SUBSEQ on lists

* Be prepared to handle bignum cases (once we support
them.)

* Better (and faster) error-checking.

2007-11-20 14:19:54 Tree
[b29b99] by Juho Snellman Juho Snellman

1.0.11.33: Oops, restore REPLACE deftransforms that got dropped in refactoring

2007-11-19 23:54:22 Tree
[67d782] by Nikodemus Siivola Nikodemus Siivola

1.0.11.32: fix bogus fixnum declarations in ROOM

...conservative approximation: some of the changed
declaractions may have been safe after all.

2007-11-19 15:26:28 Tree
[f8cb95] by Juho Snellman Juho Snellman

1.0.11.31: Make SB-PROFILE cons less

* dx allocate the closed over variables for the profiling wrapper
* Fixes a bug where a profiled function A calling profiled function
B would cause 6 words of consing to be attributed to A in the
profiler.

2007-11-19 01:04:38 Tree
[4a859f] by kreuter kreuter

1.0.11.30: restore buildability on Windows after 1.0.11.27.

src/runtime/wrap.c: move conditional definition of WIN32_LEAN_AND_MEAN
so that it precedes other #includes, to prevent
conflicting win32 stuff from being pulled in by the
new wrap.h.

src/runtime/wrap.h: Add preprocessor conditionals to guard against repeated
inclusion.

tools-for-build/grovel-headers.c: grovel the wrapped stat types on win32.

2007-11-18 19:46:01 Tree
[260a91] by Juho Snellman Juho Snellman

1.0.11.29: Faster CONCATENATE on strings

* Add a result-type dependent DEFTRANSFORM which open-codes directly
to calls to REPLACE.
* Constant-fold the array reads for constant string arguments
in the transform (intended as a slezy benchmark trick, but actually
it looks as if having some literal strings mixed in with
variables is pretty common in real world CONCATENATE uses).
* Add transforms for REPLACE on mixed SIMPLE-BASE-STRINGS and
(SIMPLE-ARRAY CHARACTER (*)) to support.
* Speeds up a simple benchmark of concatenating two three-character
strings by a factor of 15, and by a factor of 30 when the strings
are constant. For a more real-world example, doing DIRECTORY on
a large set of files speeds up by 25%.

Also:

* Fix a broken test (extra close paren) that was uncovered by
the write-no-partial-fasls change.

2007-11-18 04:13:27 Tree
[b841aa] by kreuter kreuter

1.0.11.28: Fix one Win32 regression introduced by 1.0.11.26-27.

* grovel-headers.c now pulls in src/code/runtime.h, and so needs a
kludge to keep Win32's definition of boolean from conflicting with
SBCL's. This kludge already existed in win32-os.c, so I moved it
into runtime.h.

2007-11-18 01:13:40 Tree
[a92242] by kreuter kreuter

1.0.11.27: Oops-fix -- committed intermediate code to 1.0.11.26

2007-11-17 22:27:10 Tree
[9c6193] by kreuter kreuter

1.0.11.26: correcting some types in SB-UNIX.

2007-11-17 20:23:29 Tree
[a0889b] by Nikodemus Siivola Nikodemus Siivola

1.0.11.25: don't leave incomplete fasls around after compilation

* CLHS says the first return value of COMPILE-FILE is
NIL if "file could not be created" -- interpret this
to mean "fasl could not be created" and don't count
incomplete fasls as fasls.

2007-11-17 16:34:00 Tree
[818805] by Nikodemus Siivola Nikodemus Siivola

1.0.11.24: internal hash-table usage thread-safety, part 2

* Logical hosts.

* TRACE.

* Instrumenting profiler.

* Mapping over *PACKAGE-NAMES*.

2007-11-14 18:30:14 Tree
[32eb2c] by Nikodemus Siivola Nikodemus Siivola

1.0.11.23: internal hash-table usage thread-safety, part 1

* Use :SYNCHRONIZED hash-tables for the most part, and a light dash of
WITH-LOCKED-HASH-TABLE as approriapte: *FORWARD-REFERENCED-LAYOUTS*,
CLASSOID-SUBCLASSES, *COMPILED-DEBUG-FUNS*, *FUN-END-COOKIES*,
*COMPONENT-BREAKPOINT-OFFSETS*, *EFFECTIVE-METHOD-CACHE*.

* Replace *FOREIGN-LOCK* with *SHARED-OBJECT-LOCK* and hash-table
based locking for *LINKAGE-INFO* for efficiency.

2007-11-14 15:57:27 Tree
[b9a1b1] by Nikodemus Siivola Nikodemus Siivola

1.0.11.22: hash-table synchronization support

* :SYNCHRONIZED argument to MAKE-HASH-TABLE.

* HASH-TABLE-SYNCHRONIZED-P predicate.

* WITH-LOCKED-HASH-TABLE for coarser locks.

* Additional MAPHASH & WITH-HASH-TABLE-ITERATOR documentation.

* :LOCKED argument added to DOHASH, and used where appropriate
(some usages might be overly conservative, though, and could
be removed.)

2007-11-12 17:14:50 Tree
[9d9b3c] by Christophe Rhodes Christophe Rhodes

1.0.11.21: Give NO-PRIMARY-METHOD a reference.
Motivated by _deepfire's question on #lisp

2007-11-10 23:57:52 Tree
[d01a68] by Nikodemus Siivola Nikodemus Siivola

1.0.11.20: fix with-pinned-objects stack corruption potential

* In the old WITH-PINNED-OBJECTS implementation we pushed pointers
onto stack explicitly (without telling the compiler), executed
the body, and _prior_to_returning_values_of_body_ popped the pointers.
If the values from the body were in progress of being returned via
unknown-values convention we would (try to) pop the pointers while
the last callee stack frame (where the values to be returned are)
is still on the stack. In many cases this was harmless, as the correct
SP was restored soon enough, but there were bad interactions as well.

* Solution: instead of explicitly pushing pointers, use a LET to
add binding to the current stack frame for the objects, and further
use a magic TOUCH-OBJECT function implemented with an empty VOP
to trick the compiler into keeping the variables live till the end
of the body.

Probably not perfect, but seems to do the job. Of the added test-case,
the MULTIPLE variants used to fail prior to this.

2007-11-09 17:38:14 Tree
[51eada] by Nikodemus Siivola Nikodemus Siivola

1.0.11.19: hard failure for corrupted fixups vectors

* Prior to this SBCL used to only print an error message to stderr of
the process, but since bogus fixups should only occur if something
is badly wrong we prefer to lose().

2007-11-09 14:57:01 Tree
[cdc099] by Juho Snellman Juho Snellman

1.0.11.18: Make fasls LISP-IMPLEMENTATION-VERSION specific

* As discussed on sbcl-devel.
* Reduce the support burden: We get a lot of bug reports that turn
out to be caused by stale fasls, and even more people probably
don't report these problems, but just end up thinking that SBCL
crashes all the time.
* +FASL-FILE-VERSION+ retained for backwards compability, but should
only be incremented if the actual fasl format changes.

2007-11-09 01:10:21 Tree
[7137cb] by William Harold Newman William Harold Newman

1.0.11.17: fixed dumb buglet in DEFMACRO NAMED-LET
Someone (jsnell?) on #lisp pointed out that there was still a
#!+SB-DOC left behind after some clod deleted the corresponding
doc string.:-|

also a few comment tweaks

2007-11-08 21:08:40 Tree
[2dd7bd] by Rudi Schlatte Rudi Schlatte

1.0.11.16: Fix tyops in the manual
* Patch submitted by Eugene Ossintsev

2007-11-07 07:24:55 Tree
[706866] by Rudi Schlatte Rudi Schlatte

1.0.11.15: Fix sb-posix building on Windows
* This should unbreak slime on Windows (First reported by Jerry van Dijk)
* Fix suggested by nyef on #lisp

2007-11-07 06:34:26 Tree
[3b96e3] by Nikodemus Siivola Nikodemus Siivola

1.0.11.14: thread-safe FORM-NUMBER-TRANSLATIONS

* Instead of keeping global tables, allocate new ones for each
call. Since common case seems to be a "decently small" form,
use a list instead of hash-table.

...but we could really do with a better internal set representation
for arbitrary objects -- both here and in MEMBER type machinery.

2007-11-06 15:01:06 Tree
[862685] by Nikodemus Siivola Nikodemus Siivola

1.0.11.13: dead code deletion

* *IR1-LAMBDA-DEBUG-FUN* and *IR1-BLOCK-DEBUG-BLOCK* have been
unused for a looong time...

2007-11-06 14:25:37 Tree
[4fc336] by Nikodemus Siivola Nikodemus Siivola

1.0.11.12: MAPHASH and WITH-HASH-TABLE documentation

* paraphrase the hash-table traversal/side-effect rule

2007-11-06 14:21:50 Tree
Older >