[project @ 2000-02-02 11:40:33 by sewardj]
authorsewardj <unknown>
Wed, 2 Feb 2000 11:40:33 +0000 (11:40 +0000)
committersewardj <unknown>
Wed, 2 Feb 2000 11:40:33 +0000 (11:40 +0000)
commita040ea4a643d8113a023ec7ed880b1e33726b4f4
tree359fa75454820201e3816dc4f61f570014c2e253
parentd70de6f98f9d833adf4c8d68afc17bd1e6493545
[project @ 2000-02-02 11:40:33 by sewardj]
trivialCode on x86 is the heart of instruction selection for
expressions.  It is definitely a non-trivial in complexity.
To generate correct code it needs to observe preserve several
delicate invariants, but didn't.

-- Recorded in MachCode.lhs the "Rules of the Game"; ie what I think
   the required invariants are.

-- Completely rewrote trivialCode (also shift_code).  I think it should
   handle all cases correctly, and has special treatment for literal
   operands.

-- Updated NOTES file to record issues which need to be resolved
   before x86 nativeGen can be considered ready for public use.
ghc/compiler/nativeGen/AsmCodeGen.lhs
ghc/compiler/nativeGen/MachCode.lhs
ghc/compiler/nativeGen/NOTES