This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [GCC 3.x] Performance testing for QA
- From: Kevin Atkinson <kevina at gnu dot org>
- To: Robert Dewar <dewar at gnat dot com>
- Cc: Peter dot Sasi at t-systems dot co dot hu, <aj at suse dot de>, <gcc at gcc dot gnu dot org>,<tjw at omnigroup dot com>
- Date: Tue, 3 Sep 2002 17:05:24 -0400 (EDT)
- Subject: Re: [GCC 3.x] Performance testing for QA
On Tue, 3 Sep 2002, Robert Dewar wrote:
> <<The type of operations that encoder decoders use (lots of arithmetic and
> data movement) should somehow be incorporate as a benchmark test gcc
> should optimize for. The ideal goal would be to make the code fast enough
> that hand written assembly would not be necessary. Thus using an encoder as
> a benchmark would be beneficial. Even if it concentrates on tight loops.
> >>
>
> You need to remember that it is trivial to make a compiler make any ONE
> simple program as fast as optimal assembly language.
Than you need to use a wide variety of encoders to avoid this problem.
Also since the source code for gcc is freely available such a thing will
not go unnoticed for long. I seams that you are trying to say that making
tight loops run fast is a pointless exercise by the compiler. If a large
number of programs tend to use a particular type of loop than optimizing
for those loops would be a huge win in terms of performance.
---
http://kevin.atkinson.dhs.org