This is the mail archive of the
mailing list for the GCC project.
Re: Faster compilation speed
- From: David Edelsohn <dje at watson dot ibm dot com>
- To: dberlin at dberlin dot org
- Cc: Daniel Berlin <dan at dberlin dot org>, Matt Austern <austern at apple dot com>, "David S. Miller" <davem at redhat dot com>, gcc at gcc dot gnu dot org
- Date: Tue, 13 Aug 2002 18:58:25 -0400
- Subject: Re: Faster compilation speed
>>>>> Daniel Berlin writes:
>> As one of my colleagues commented, this is the cache behavior one
>> would see with database transaction processing. In other words, this is
>> *really bad*.
The problem isn't that the number is low at optimization. 29 I/M
is not horrible. Low 20's is bad. Scientific code will have a value in
the low hundreds, but compilation is not that regular a computation.
The problem is that the number stays the same or gets worse
without optimization. Most commercial compilers will be in the same
ballpark when optimizing, but use a lot fewer instructions and a lot fewer
cache misses to produce minimally optimized, debuggable code.