;;;; -*- coding: utf-8; fill-column: 78 -*-
-changes relative to sbcl-1.0.30:
+changes relative to sbcl-1.0.31
+ * bug fix: SAVE-LISP-AND-DIE option :SAVE-RUNTIME-OPTIONS did not work
+ correctly when starting from an executable core without saved runtime
+ options (reported by Faré Rideau, thanks to Zach Beane)
+ * bug fix: (SETF SLOT-VALUE) signalled a warning which should have been
+ an optimization note instead. (reported by Martin Cracauer)
+ * bug fix: WITH-SLOTS did not work with THE forms. (thanks to David Tolpin)
+
+changes in sbcl-1.0.31 relative to sbcl-1.0.30:
* improvement: stack allocation is should now be possible in all nested
inlining cases: failure to stack allocate when equivalent code is manually
open coded is now considered a bug.
- * improvement: the Unicode character database has been upgraded to the
- Unicode 5.0.1 standard, giving names and properties to a number of new
- characters, and providing a few extra characters with case
- transformations.
+ * improvements related to Unicode:
+ ** the Unicode character database has been upgraded to the
+ Unicode 5.1 standard, giving names and properties to a number of new
+ characters, and providing a few extra characters with case
+ transformations.
+ ** the system now recognizes and produces names for Unicode Hangul
+ syllable characters.
+ ** the EBCDIC-US external-format is now supported for octet operations
+ (as well as for stream operations).
* new feature: experimental :EMIT-CFASL parameter to COMPILE-FILE can
be used to output toplevel compile-time effects into a separate .CFASL
file.
* optimization: COERCE to VECTOR, STRING, SIMPLE-STRING and recognizable
one-dimenstional subtypes of ARRAY is upto 70% faster when the coercion is
actually needed.
+ * optimization: TRUNCATE on known single- and double-floats is upto 25%
+ faster.
* optimization: division of floating point numbers by constants uses
multiplication by reciprocal when an exact reciprocal exists.
* optimization: multiplication of single- and double-floats floats by
constant two has been optimized.
* optimization: ARRAY-IN-BOUNDS-P is resolved at compile-time when
sufficient type information is available. (thanks to Leslie Polzer)
+ * optimization: SLOT-VALUE and (SETF SLOT-VALUE) with constant slot names on
+ known structure objects are as efficient as defstruct generated accessors.
* optimization: unused vector creation can now be optimized away.
* improvement: ASDF systems can now depends on SB-INTROSPECT.
* improvement: a STYLE-WARNING is signalled when a generic function
Elsasser)
* improvement: pretty-printing of various Lisp forms has been improved
(thanks to Tobias Rittweiler)
+ * bug fix: calls to DECODE-FLOAT and INTEGER-DECODE-FLOAT whose value was
+ unused were deleted in safe code. (reported by John Fremlin)
+ * bug fix: a failing AVER compiling certain MAKE-ARRAY forms. (reported
+ by James Wright)
+ * bug fix: some out-of-line array predicates were missing (reported by
+ Stelian Ionescu)
* bug fix: a failing AVER in CONVERT-MV-CALL has been fixed. (thanks to
Larry D'Anna)
* bug fix: a failing AVER in %ALLOCATE-CLOSURES conversion has been fixed
* bug fix: DELETE-FILE on streams no longer closes the stream with :ABORT T,
leading to possible attempts to delete the same file twice. See docstring
on DELETE-FILE for details. (reported by John Fremlin)
+ * bug fix: DELETE-FILE once again deletes the file named by the pathname
+ designator argument, rather than its truename. (reported by Luis
+ Oliveira)
* bug fix: the low-level debugger had 32-bit assumptions and was missing
information about some array types. (thanks to Luis Oliveira)
* bug fix: moderately complex combinations of inline expansions could
be miscompiled if the result was declared to be dynamic extent.
+ * bug fix: on x86, SAP-REF of sizes greater than 8 bits with offsets of the
+ form (+ <variable> <integer>) were miscompiled under certain
+ circumstances.
* bug fix: in some cases no compiler note about failure to stack allocate
was emitted, even if the objects were in fact heap allocated.
* bug fix: minor violation of "otherwise inaccessible" rule for stack