[m-dev.] preliminary MLDS performance comparisons

[Fergus Henderson]

On 23-Nov-2000, Peter Ross <peter.ross at miscrit.be> wrote:
> On Fri, Nov 24, 2000 at 03:45:03AM +1100, Fergus Henderson wrote:
> > 
> > There are still a couple of optimizations which are present in the
> > LLDS back-end are still not yet implemented in the MLDS back-end:
> > 	- lookup switch optimization
> > 	- reverse tag test optimization for types with two functors
> > However, I don't expect to get big speed-ups for those.
>
> What about middle recursion?  I would imagine that this will also avoid
> a lot of the stack overflow problems.

Middle recursion is not yet implemented in the MLDS back-end.

However, even for the LLDS back-end, it only applies in a quite
restrictive set of circumstances.  I don't expect that it gives
much of a speedup for the compiler.

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
                                    |  of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh>  |     -- the last words of T. S. Garp.
--------------------------------------------------------------------------
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
--------------------------------------------------------------------------