This is the mail archive of the
mailing list for the GCC project.
Re: gcc compile-time performance
- From: Richard Earnshaw <rearnsha at arm dot com>
- To: dewar at gnat dot com (Robert Dewar)
- Cc: Richard dot Earnshaw at arm dot com, jh at suse dot cz, gcc at gcc dot gnu dot org
- Date: Mon, 20 May 2002 15:54:20 +0100
- Subject: Re: gcc compile-time performance
- Organization: ARM Ltd.
- Reply-to: Richard dot Earnshaw at arm dot com
> <<Native floating point code is problem, unfortunately since for i386 you get
> different results in optimized and non-optimized builds breaking bootstrap.
> Fixed point code is problem, as we are interested in comparisons relative
> to the highest fequency in the program. This may be the entry block for
> tree-structured function, but it may be the internal loop and at high loop
> nests there is more than 2^30 differences between these two we can affort
> in integral arithmetics.
> Why not just use 64-bit scaled integer arithmetic, sounds like it would
> work fine in this case, and it will be a lot faster than emulated fpt
We can't assume the presence of 64-bit integer types during the initial
stage of the bootstrap (ie before we have finished making stage1)