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: Jan Hubicka <jh at suse dot cz>
- Cc: Richard dot Earnshaw at arm dot com, Robert Dewar <dewar at gnat dot com>, gcc at gcc dot gnu dot org
- Date: Mon, 20 May 2002 16:41:24 +0100
- Subject: Re: gcc compile-time performance
- Organization: ARM Ltd.
- Reply-to: Richard dot Earnshaw at arm dot com
Do you have a feeling for the amount of precision needed? Eg, if we did a
simple floating-type code that used 16-bit fraction and 16-bit exponent,
then operations like multiply and divide would become very cheap (we could
simply cast to long for the tricky bits): the statistics show that
multiplication and division out-number addition and subtraction, but there
is one place where we have
REAL_ARITHMETIC (real_almost_one, MINUS_EXPR, real_one,
Which might be too small.