On Tue, 18 Feb 2003 [EMAIL PROTECTED] wrote:
>
> I think --optimize alone is busted.
>
You'd be right: the code adding the optimization flags to the list of
compiler flags is only executed if 'debugging' is defined, which is
only the case when the --debugging flag has been used.
The patches
On Thu, 20 Feb 2003, Simon Glover wrote:
>
> On Thu, 20 Feb 2003, Nicholas Clark wrote:
>
> > If I
> >
> > perl Configure.pl --cgoto=0 && make all test
> >
> > then the build fails with:
> >
> > ccache /usr/local/bin/gcc -DHAS_FPSETMASK -DHAS_FLOATINGPOINT_H
> > -I/usr/local/include -Wall -Wstr
On Thu, 20 Feb 2003, Nicholas Clark wrote:
> If I
>
> perl Configure.pl --cgoto=0 && make all test
>
> then the build fails with:
>
> ccache /usr/local/bin/gcc -DHAS_FPSETMASK -DHAS_FLOATINGPOINT_H
> -I/usr/local/include -Wall -Wstrict-prototypes -Wmissing-prototypes -Winline
> -Wshadow -Wpoi
On Thursday 20 February 2003 18:14, Leopold Toetsch wrote:
> Tupshin Harper wrote:
> > Leopold Toetsch wrote:
> >> Starting from the unbearable fact, that optimized compiled C is still
> >> faster then parrot -j (in primes.pasm)
> >
> > Lol...what are you going to do when somebody comes along with
Dan Sugalski <[EMAIL PROTECTED]>:
> At 2:06 PM + 2/19/03, Peter Haworth wrote:
> >On Fri, 14 Feb 2003 15:56:25 -0500, Dan Sugalski wrote:
> >> I got clarification. The sequence is:
> >>
> >> 1) Search for method of the matching name in inheritance tree
> >> 2) if #1 fails, search for an AUTO
Tupshin Harper wrote:
Leopold Toetsch wrote:
Starting from the unbearable fact, that optimized compiled C is still
faster then parrot -j (in primes.pasm)
Lol...what are you going to do when somebody comes along with the
unbearable example of primes.s(optimized x86 assembly), and you are
forc
If I
perl Configure.pl --cgoto=0 && make all test
then the build fails with:
ccache /usr/local/bin/gcc -DHAS_FPSETMASK -DHAS_FLOATINGPOINT_H -I/usr/local/include
-Wall -Wstrict-prototypes -Wmissing-prototypes -Winline -Wshadow -Wpointer-arith
-Wcast-qual -Wcast-align -Wwrite-strings -Waggreg
At 2:06 PM + 2/19/03, Peter Haworth wrote:
On Fri, 14 Feb 2003 15:56:25 -0500, Dan Sugalski wrote:
I got clarification. The sequence is:
1) Search for method of the matching name in inheritance tree
2) if #1 fails, search for an AUTOLOAD
3) if #2 fails (or all AUTOLOADs give up) then do MM
Leopold Toetsch wrote:
Starting from the unbearable fact, that optimized compiled C is still
faster then parrot -j (in primes.pasm)
Lol...what are you going to do when somebody comes along with the
unbearable example of primes.s(optimized x86 assembly), and you are
forced to throw up your hands
Sean O'Rourke wrote:
On Thu, 20 Feb 2003, Leopold Toetsch wrote:
What do people think?
Cool idea -- a lot of optimization-helpers could eventually be passed on
to the jit (possibly in the metadata?). One thought -- the information
imcc computes should be platform-independent. e.g. it could
On Thu, 20 Feb 2003, Leopold Toetsch wrote:
> What do people think?
Cool idea -- a lot of optimization-helpers could eventually be passed on
to the jit (possibly in the metadata?). One thought -- the information
imcc computes should be platform-independent. e.g. it could pass a
control flow grap
Starting from the unbearable fact, that optimized compiled C is still
faster then parrot -j (in primes.pasm), I did this experiment:
- do register allocation for JIT in imcc
- use the first N registers as MAPped processor registers
Here is the JIT optimized PASM output of
$ imcc -Oj -o p.pasm pr
12 matches
Mail list logo
