[m-dev.] Loop flattening and LCPS optimization

[Ralph Becket]

I've just read John Reppy's paper, "Local CPS Conversion in a Direct
Style
Compiler" http://www.cs.bell-labs.com/who/jhr/moby/index.html which
describes
a neat little optimization for loops (he reports a 25% reduction in the 
overheads for nested loops).  The main idea is to spot when direct jumps
can replace function calls in loops.

I was wondering whether this could be applied to the Mercury compiler.
What
does mmc do with nested loops at the moment, anyway?

Cheers,

Ralph
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------