Hi! I almost forgot that I never responded to this, sorry.
On Tue, Apr 18, 2006 at 11:37:12AM +0100, Simon Marlow wrote:
> Frederik Eaton wrote:
> >I have a project which currently uses Cabal, and I would like to
> >switch to using a plain Makefile. I have two examples of projects that use
> >Mak
Simon Marlow wrote:
[snip]
> >The assembler call wrapper in StgCRun has a typo which hides some bugs
> >(a missing colon before the clobber list). This probably explains some
> >failures, I'm doing a rebuild and a testsuite rerun with a fixed
> >version of the wrapper.
>
> So there should be a col
Thiemo Seufer wrote:
Simon Marlow wrote:
Thiemo Seufer wrote:
I decided to ignore the performance tuning for now and used a register
mapping which is compatible to all three relevant MIPS ABIs. It uses
4 callee-saved registers as R1-R4, plus 4 temporaries (caller-saved)
registers as R5-R8.
Hi,
In GHC (and probably JHC) it shouldn't make any difference, in other compilers
it might do.
In nhc98/Yhc it makes no performance difference. If you run Yhc with
the -core flag you can see the output for each of the functions, and
they're pretty close to identical.
Thanks
Neil
___
Simon Marlow wrote:
> Thiemo Seufer wrote:
>
> >I decided to ignore the performance tuning for now and used a register
> >mapping which is compatible to all three relevant MIPS ABIs. It uses
> >4 callee-saved registers as R1-R4, plus 4 temporaries (caller-saved)
> >registers as R5-R8.
> >
> >With
Hello Neil,
Tuesday, August 22, 2006, 5:04:58 PM, you wrote:
> Just for reference, I did this with WinHugs, I created WinHugs and
> MinHugs - with the explicit goal that a student at a uni should be
> able to install MinHugs on their disk space without blowing their
> quota. The difference was ab
Serge D. Mechveliani wrote:
Who can advise, please,
is this for sure that the program
\ x -> [f y | y <- g x]
is not more expensive in computation than
\ x -> let ys = g x in [f y | y <- ys]
?
May the difference depend on Haskell implementation?
In GHC (and probably JHC) it shou
Thiemo Seufer wrote:
I decided to ignore the performance tuning for now and used a register
mapping which is compatible to all three relevant MIPS ABIs. It uses
4 callee-saved registers as R1-R4, plus 4 temporaries (caller-saved)
registers as R5-R8.
With the appended patch to support a register
Who can advise, please,
is this for sure that the program
\ x -> [f y | y <- g x]
is not more expensive in computation than
\ x -> let ys = g x in [f y | y <- ys]
?
May the difference depend on Haskell implementation?
(I suspect that compilers convert one of these programs to anoth
Hello Krasimir,
Friday, August 25, 2006, 10:49:50 AM, you wrote:
> The usage of something else than cabarc isn't supported directly and
> will require extra work. Is the lzma algorithm better than bz2? If I
for compression of binary data (and most of windows distribution is
executable), lzma is
10 matches
Mail list logo
