This is the mail archive of the
mailing list for the GCC project.
Re: stepanov on i686-pc-linux-gnu
- To: schwab at suse dot de (Andreas Schwab)
- Subject: Re: stepanov on i686-pc-linux-gnu
- From: Joe Buck <jbuck at synopsys dot COM>
- Date: Tue, 29 May 2001 10:41:34 -0700 (PDT)
- Cc: jbuck at racerx dot synopsys dot com (Joe Buck), rth at redhat dot com (Richard Henderson), jbuck at synopsys dot COM (Joe Buck), gcc at gcc dot gnu dot org
> |> Sigh. I'm so used to looking at Sparc assembly with the delayed
> |> branch.
> |> Nevertheless, there are two memory accesses in the loop
> No, there is only one. 'leal' only calculates the effective address,
> without any memory access.
Rather than embarrassing myself further, I ask someone who is familiar
with x86 assembly to compile the Stepanov benchmark with -O2 -S,
and compare the slow accumulate loops with the fast accumulate loops
and post an analysis of what's going wrong in the slow loops.