projects / sbcl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 0338d1f) | patch
fix a bug in signed modular arithmetic
authorChristophe Rhodes <csr21@cantab.net>
Tue, 4 Dec 2012 20:50:12 +0000 (20:50 +0000)
committerChristophe Rhodes <csr21@cantab.net>
Tue, 4 Dec 2012 20:50:12 +0000 (20:50 +0000)
commitdd18ecfb2cde114c75d4f6b4a172d1f4723eafbb
tree6c4c6f2e544ebd66b555c4f75278f1fb6921f2bbtree | snapshot
parent0338d1fc97a74b8ff332821ea275120b9de951c1commit | diff
fix a bug in signed modular arithmetic

Sadly not the ones that Eric gently reminds us of every month or so, but
a far more basic one.  If something is a (signed-byte x), its integer-length
will be at most (1- x).  Search appropriately for a signed arithmetic
variant.
src/compiler/srctran.lisp diff | blob | history
tests/compiler.pure.lisp diff | blob | history
Mirror of Steel Bank Common Lisp SBCL's official repository