This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: Patch to decrease time of building minimal delay issue table for the DFA scheduler
- From: law at redhat dot com
- To: Jan Hubicka <jh at suse dot cz>
- Cc: Vladimir Makarov <vmakarov at redhat dot com>, gcc-patches at gcc dot gnu dot org
- Date: Fri, 03 May 2002 17:11:49 -0600
- Subject: Re: Patch to decrease time of building minimal delay issue table for the DFA scheduler
- Reply-to: law at redhat dot com
In message <20020503225832.GI23248@atrey.karlin.mff.cuni.cz>, Jan Hubicka
writes:
> Just curious, how large is resulting insn-attrtab file?
> In my experiments large genattrtab times just signalized large files so
> I split the automatons. You will probably find usefull to model decoders,
> ieu and fp as separate beasts.
The DFA will eventually be factored and simplified. RIght now the point
behind that particular DFA is to 100% model the existing pipeline description
for the PPro/P2/P3.
That means doing some things which are short term hacks to ensure I can do what
I set out to do. The fact that doing so resulted in a 3M insn-attrtab with
just the PPro/P2/P3 description isn't particularly concerning because the code
will eventually be simplified.
jeff