Pierre-Alexandre Voye wrote:
Note that the ocaml compiler has a flag -cmm which outputs C-- ast code.
F. Reig made a c-- ocaml backend during his thesis. Including a GC.
Unhappily, sources code haven't been released.
But it proves it works.
If anyone is interested, the dissertation is
Le Thursday 25 Aug 2011 à 12:25:49 (+0200), Pierre-Alexandre Voye a écrit :
I have a stupid question : I wonder if it would not be a bad idea that
Ocaml output C code and let gcc do its work, so compile code with good
performances in a lot of architecture ? Gcc is able to do
Pierre-Alexandre Voye wrote:
I have a stupid question : I wonder if it would not be a bad idea that Ocaml
output C code and let gcc do its work, so compile code with good
performances in a lot of architecture ? Gcc is able to do autovectorization
(SSE, MMX, Larabee in the futur, etc...), very
Note that the ocaml compiler has a flag -cmm which outputs C-- ast code.
F. Reig made a c-- ocaml backend during his thesis. Including a GC.
Unhappily, sources code haven't been released.
But it proves it works.
Le 26 août 2011 14:30, Erik de Castro Lopo mle+oc...@mega-nerd.com a
écrit :
On Aug 24, 2011, at 22:40 , Gerd Stolpmann wrote:
- the performance cost of this new allocator in the generated code? I
suppose the results may vary between different architectures (eg. x86
is probably more sensitive to good allocation decisions than x86_64).
-
Am Donnerstag, den 25.08.2011, 11:34 +0200 schrieb Benedikt Meurer:
On Aug 25, 2011, at 10:02 , Benedikt Meurer wrote:
- http://ps.informatik.uni-siegen.de/~meurer/tmp/compiletime_timings.pdf
contains a comparison of the ocamlopt invocations.
-
On Aug 25, 2011, at 12:21 , Gerd Stolpmann wrote:
Reran the benchmark with 32bit ocaml on the MBP (Early 2011), results are
available at:
http://ps.informatik.uni-siegen.de/~meurer/tmp/linscan-i7-i386-timings.pdf
Hard to interpret. I have the impression that the compile times for
graph
On Aug 1, 2011, at 17:04 , Gabriel Scherer wrote:
Do you have more precise measurements on
Also posting Marcell's timing results here for reference (taken from bug 5324).
- the performance cost of this new allocator in the generated code? I
suppose the results may vary between different
This work is meant to make a compromise between generated code quality
and compilation speed to have good performances in rapid
prototyping/development scenario.
Do you have more precise measurements on
- the relative costs of the successive transformations during native
compilation (including
On Aug 1, 2011, at 17:04 , Gabriel Scherer wrote:
This work is meant to make a compromise between generated code quality
and compilation speed to have good performances in rapid
prototyping/development scenario.
Do you have more precise measurements on
- the relative costs of the
10 matches
Mail list logo
