Download Latest Version sbcl-2.5.6-source.tar.bz2 (8.3 MB)
Email in envelope

Get an email when there's a new version of Steel Bank Common Lisp

Home / sbcl / 2.3.7
Name Modified Size InfoDownloads / Week
Parent folder
README 2023-07-29 2.1 kB
sbcl-2.3.7-release-notes.txt 2023-07-29 2.1 kB
sbcl-2.3.7-documentation-html.tar.bz2 2023-07-29 233.2 kB
sbcl-2.3.7-source.tar.bz2 2023-07-29 7.5 MB
sbcl-2.3.7-x86-64-linux-binary.tar.bz2 2023-07-29 11.8 MB
sbcl-2.3.7-crhodes.asc 2023-07-29 967 Bytes
Totals: 6 Items   19.5 MB 13
changes in sbcl-2.3.7 relative to sbcl-2.3.6:
  * minor incompatible change: MACROLET macro functions are now compiled with
    (SPEED 1), leading to fewer efficiency notes being emitted when compiled
    in otherwise high-SPEED environments.
  * minor incompatible change: when coalescing list data, the file compiler
    respects substructure equality more accurately, with the side-effect of
    coalescing along CDR chains as well as CARs.  (lp#2025086)
  * minor incompatible change: FUNCTION type declarations for local variables
    generate assertions around their use when called.
  * platform support
    ** on OpenBSD, the regression test suite expectations have been updated.
       (lp#2026809, thanks to Sebastien Marie)
    ** on OpenBSD, the data limit is now 1GB.  (lp#2027536, thanks to
       Sebastien Marie)
    ** on Darwin with the SB-FUTEX feature, do not use unpaired
       mach_thread_self() syscalls, avoiding resource leaks when creating
       threads.
    ** on 64-bit RISCV, add support for some REM-by-multiplication
       optimizations.
    ** on Windows, work around a C compiler bug relating to SYSV_ABI.
  * bug fix: FILE-POSITION on string output streams no longer crashes or
    causes arbitrary memory overwrites.  (lp#1839040)
  * bug fix: the compiler no longer constant-folds POSITION to NIL if the
    START or END arguments are not valid.
  * optimization: the compiler derives types of &KEY arguments in local calls.
    (lp#655562)
  * optimization: type tests of values of known union type can be faster if
    the type being tested for has a non-trivial intersection with the known
    type.
  * optimization: the low-level implementation of NUMBERP, REALP and RATIONALP
    has been improved on x86-64 and arm64.
  * optimization: the compiler removes known-NIL arguments from calls to
    APPEND and NCONC, and empty sequences from calls to CONCATENATE.
  * optimization: checks for symbols being bindable are now memoized, speeding
    up compiled uses of PROGV.
  * optimization: SLOT-VALUE on STRUCTURE-OBJECTs with non-constant slot-name
    argument is faster.

Source: README, updated 2023-07-29