projects / mit-scheme.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 5d512c3) | patch
Reimplement interval arithmetic and assembler relaxation code. New
authorChris Hanson <org/chris-hanson/cph>
Thu, 23 Dec 1993 11:14:25 +0000 (11:14 +0000)
committerChris Hanson <org/chris-hanson/cph>
Thu, 23 Dec 1993 11:14:25 +0000 (11:14 +0000)
commit55f017981b4a8769f3d338a901647e7a9d18ebc5
treefbf36ba179647979323305e151b8a17a96e396c4tree | snapshot
parent5d512c377015e2f4f8618816701c6ab1388cc3a3commit | diff
Reimplement interval arithmetic and assembler relaxation code.  New
arithmetic uses geometric model to get more accurate results.
Relaxation has been changed to eliminate assumption that if the low
bound of an interval doesn't fit, then no point within the interval
will fit.  This assumption was proven incorrect by an example on the
MIPS.
v7/src/compiler/back/bittop.scm diff | blob | history
v7/src/compiler/back/bitutl.scm diff | blob | history
MIT/GNU Scheme, Pucked