This is the mail archive of the
mailing list for the GCC project.
Re: gcc compile-time performance
- From: Jan Hubicka <jh at suse dot cz>
- To: Robert Dewar <dewar at gnat dot com>
- Cc: Richard dot Earnshaw at arm dot com, gcc at gcc dot gnu dot org, jh at suse dot cz
- Date: Mon, 20 May 2002 17:08:41 +0200
- Subject: Re: gcc compile-time performance
- References: <20020520150323.52615F28D4@nile.gnat.com>
> <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)
> Do you really need this in the first bootstrap stage.
If we don't do it at first bootstrap stage, we would get different compiler
at stage2 and stage3 adding extra stage to the bootstrap.
> Anyway, you could write a little library of scaled integer arithmetic using
> two 32-bit integers to represent binary exponent and fraction for example.
Yes, that is alternative. Will it be considerably faster than the current
FP emulation library doing the same?