what about code generated for classic fac benchmark: fac 0 res = res fac n res = fac (n-1) (n*res)
This isn't really related to my patch; my patch affects hand-written loops in .cmm files (in the run-time system); the goal for now is to make them compile at all, not to make them run as efficiently as possible. For Haskell code, GHC doesn't currently pass loops to the native code generator. Also, if the above code, specialised to Int, is optimised properly, it shouldn't need any register spilling by the register allocator.
Cheers, Wolfgang _______________________________________________ Cvs-ghc mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/cvs-ghc
