|386 code generation with arithmetic overflow handling M.D.Poole@ukc.ac.uk (1996-11-15)|
|Date:||15 Nov 1996 10:35:41 -0500|
|Organization:||University of Kent at Canterbury, UK.|
|Keywords:||386, code, optimize, comment|
Can anyone recommend a good source of material on code generation for
386 and successor architectures?
I am particularly interested in the best code sequences for performing
arithmetic operations with full overflow checking, as the language I am
compiling (occam) defines that all such overflows shall be trapped.
Michael Poole, Research Fellow, Computing Laboratory, University of Kent,
Canterbury, Kent, CT2 7NF, England Tel:01227 827553
[I've never seen much written down. Modern graph coloring approaches are
apparently hard to use because the 386 doesn't have many registers, and the
register set is still somewhat asymmetrical. -John]
Return to the
Search the comp.compilers archives again.