On Fri, 8 May 1998, Fergus Henderson wrote: > Note that consolidating multiple passes into single passes is not > always a win. For example, if your machine has 10 available registers, > and each pass uses 8 of them, then combining the two passes may mean > that some variables can longer fit in registers, which may lead to > things being less efficient. Isn't it somewhat unreasonable to expect the typical Haskell programmer to know how many registers a particular target CPU has and for that matter how many registers a particular algorithm actually uses? Can't the compiler figure this one out? -Alex- ___________________________________________________________________ S. Alexander Jacobson i2x Media 1-212-697-0184 voice 1-212-697-1427 fax
- Re: quicksort and compiler optimization Fergus Henderson
- Re: quicksort and compiler optimization Hans Aberg
- Re: quicksort and compiler optimization Hans Aberg
- Re: quicksort and compiler optimization Hans Aberg
- Re: quicksort and compiler optimization Carl R. Witty
- Re: quicksort and compiler optimization Mariano Suarez Alvarez
- Re: quicksort and compiler optimization Hans Aberg
- Re: quicksort and compiler optimization Adrian Hey
- Re: quicksort and compiler optimization Mariano Suarez Alvarez
- Re: quicksort and compiler optimization S. Alexander Jacobson
- Re: quicksort and compiler optimization S. Alexander Jacobson
- Re: quicksort and compiler optimization Carl R. Witty
- Re: quicksort and compiler optimization Torsten Grust
- Re: quicksort and compiler optimization Ralf Hinze
- Re: quicksort and compiler optimization Mariano Suarez Alvarez
- Re: quicksort and compiler optimization Fergus Henderson
